php hash代码下载,PHP HASH算法实现代码分享

小咪咪 2023-01-15 02:19 139阅读 0赞

例子，php hash算法的实现代码。 代码示例:

/\*

\* 头文件

\* 说明：此实现不保存对象，只保存对象的引用

\*/

\#ifndef \_HASH\_H

\#define \_HASH\_H

\#ifdef \_\_cplusplus

extern "C" \{

\#endif

typedef struct tagHASHBUCKET HASHBUCKET, \*LPHASHBUCKET;

typedef struct tagHASHTABLE HASHTABLE, \*LPHASHTABLE;

struct tagHASHBUCKET

unsigned long h;

unsigned int key\_length;

void \*data;

LPHASHBUCKET next;

LPHASHBUCKET previous;

LPHASHBUCKET conflict\_next;

LPHASHBUCKET conflict\_previous;

char key\[1\];

\};

typedef unsigned long (\*hash\_func\_t)(char \*, unsigned int);

struct tagHASHTABLE

unsigned int table\_size;

unsigned int size\_index;

unsigned int elements;

hash\_func\_t hash;

LPHASHBUCKET p;

LPHASHBUCKET head;

LPHASHBUCKET tail;

LPHASHBUCKET \*buckets;

\};

extern int hash\_create(LPHASHTABLE, unsigned int, hash\_func\_t);

extern int hash\_entry(LPHASHTABLE, char \*, unsigned int, void \*);

extern int hash\_find(LPHASHTABLE, char \*, unsigned int, void \*\*);

extern int hash\_update(LPHASHTABLE, char \*, unsigned int, void \*);

extern int hash\_remove(LPHASHTABLE, char \*, unsigned int);

extern int hash\_destroy(LPHASHTABLE);

\#ifdef \_\_cplusplus

\};

\#endif

/\*

\* HASH实现

\*/

\#include

\#include "main.h"

static unsigned int size\_table\[\] =

\{5, 11, 19, 53, 107, 223, 463, 983, 1979, 3907, 7963, 16229, 32531, 65407, 130987, 262237, 524521, 1048793, 2097397, 41941

03, 8388857, 16777447, 33554201, 67108961, 134217487, 268435697, 536870683, 1073741621, 2147483399\};

\#define COUNTS\_OF\_SIZE\_TABLE    (sizeof(size\_table) / sizeof(size\_table\[0\]))

static unsigned long

hashpjw(char \*key, unsigned int key\_length)

unsigned long h, g;

char \*p;

h = 0;

p = key + key\_length;

while (key < p)

h = (h << 4) + \*key++;

if ((g = (h & 0xF0000000)))

h = h ^ (g >> 24);

h = h ^ g;

return h;

static int

hash\_do\_rehash(LPHASHTABLE pht)

LPHASHBUCKET p;

unsigned int index;

memset(pht->buckets, 0, sizeof(LPHASHBUCKET) \* size\_table\[pht->size\_index\]);

for (p = pht->head; p; p = p->next)

index = p->h % pht->table\_size;

p->conflict\_next = 0;

p->conflict\_previous = pht->buckets\[index\];

if (p->conflict\_previous)

p->conflict\_previous->conflict\_next = p;

pht->buckets\[index\] = p;

return 0;

static int

hash\_do\_resize(LPHASHTABLE pht)

LPHASHBUCKET \*pp;

if (pht->size\_index < (unsigned int)COUNTS\_OF\_SIZE\_TABLE - 1)

pp = (LPHASHBUCKET \*)realloc(pht->buckets, size\_table\[pht->size\_index + 1\] \* sizeof(LPHASHBUCKET));

if (pp)

pht->buckets = pp;

pht->size\_index++;

pht->table\_size = size\_table\[pht->size\_index\];

hash\_do\_rehash(pht);

return 0;

return -1;

return 0;

int

hash\_create(LPHASHTABLE pht, unsigned int size, hash\_func\_t hash)

int i;

for (i = 0; i < COUNTS\_OF\_SIZE\_TABLE; ++i)

if (size <= size\_table\[i\])

size = size\_table\[i\];

pht->size\_index = i;

break;

if (i == COUNTS\_OF\_SIZE\_TABLE)

size = size\_table\[COUNTS\_OF\_SIZE\_TABLE - 1\];

pht->size\_index = COUNTS\_OF\_SIZE\_TABLE - 1;

pht->buckets = (LPHASHBUCKET \*)calloc(size, sizeof(LPHASHBUCKET));

if (!pht->buckets)

return -1;

pht->hash = hash? hash: hashpjw;

pht->elements = 0;

pht->head = 0;

pht->p = 0;

pht->tail = 0;

pht->table\_size = size;

return 0;

int

hash\_entry(LPHASHTABLE pht, char \*key, unsigned int key\_length, void \*data)

unsigned long h;

unsigned int index;

LPHASHBUCKET p;

h = pht->hash(key, key\_length);

index = h % pht->table\_size;

for (p = pht->buckets\[index\]; p; p = p->conflict\_previous)

if (p->h == h && p->key\_length == key\_length)

if (!memcmp(p->key, key, key\_length))

return -1;

p = (LPHASHBUCKET)malloc(sizeof(HASHBUCKET) - 1 + key\_length);

if (!p)

return -1;

memcpy(p->key, key, key\_length);

p->key\_length = key\_length;

p->h = h;

p->data = data;

p->conflict\_next = 0;

p->conflict\_previous = pht->buckets\[index\];

if (p->conflict\_previous)

p->conflict\_previous->conflict\_next = p;

p->previous = pht->tail;

p->next = 0;

pht->tail = p;

if (p->previous)

p->previous->next = p;

if (!pht->head)

pht->head = p;

pht->buckets\[index\] = p;

\++pht->elements;

if (pht->elements > pht->table\_size)

hash\_do\_resize(pht);

return 0;

int

hash\_find(LPHASHTABLE pht, char \*key, unsigned int key\_length, void \*\*data)

unsigned long h;

unsigned int index;

LPHASHBUCKET p;

h = pht->hash(key, key\_length);

index = h % pht->table\_size;

for (p = pht->buckets\[index\]; p; p = p->conflict\_previous)

if (p->h == h && p->key\_length == key\_length && !memcmp(p->key, key, key\_length))

\*data = p->data;

return 0;

return -1;

int

hash\_remove(LPHASHTABLE pht, char \*key, unsigned int key\_length)

unsigned long h;

unsigned int index;

LPHASHBUCKET p;

h = pht->hash(key, key\_length);

index = h % pht->table\_size;

for (p = pht->buckets\[index\]; p; p = p->conflict\_previous)

if (p->h == h && p->key\_length == key\_length && !memcmp(p->key, key, key\_length))

if (p->conflict\_previous)

p->conflict\_previous->conflict\_next = p->conflict\_next;

if (p->conflict\_next)

p->conflict\_next->conflict\_previous = p->conflict\_previous;

if (p->previous)

p->previous->next = p->next;

if (p->next)

p->next->previous = p->previous;

if (pht->buckets\[index\] == p)

pht->buckets\[index\] = p->conflict\_previous;

if (pht->head == p)

pht->head = p->next;

if (pht->tail == p)

pht->tail = p->previous;

\--pht->elements;

free(p);

return 0;

return -1;

int

hash\_update(LPHASHTABLE pht, char \*key, unsigned int key\_length, void \*data)

unsigned long h;

unsigned int index;

LPHASHBUCKET p;

h = pht->hash(key, key\_length);

index = h % pht->table\_size;

for (p = pht->buckets\[index\]; p; p = p->conflict\_previous)

if (p->h == h && p->key\_length == key\_length && !memcmp(p->key, key, key\_length))

p->data = data;

return 0;

return -1;

int

hash\_destroy(LPHASHTABLE pht)

LPHASHBUCKET p, q;

p = pht->head;

while (p)

q = p;

p = p->next;

free(q);

free(pht->buckets);

return 0;

php hash代码下载,PHP HASH算法实现代码分享

发表评论取消回复

还没有评论，来说两句吧...

相关阅读

相关 php hash代码下载,PHP HASH算法实现代码分享

相关 Hash算法的设计原理与代码实现

相关 php tab代码,PHP中实现crontab代码分享

相关从PHP的Hash（哈希）算法开始

相关一致性hash以及python代码实现

相关一致性hash以及python代码实现

相关 PHP使用hash算法实现一个简单的数据库代码实例

相关 PHP实现一个hash表（拉链法解决hash冲突）代码实例

相关对一致性Hash算法，Java代码实现的深入研究

相关 PHP实现下载功能的代码