链式哈希表.docVIP

链式哈希表 将数据存储在桶中-桶是链表。如果冲突，增大链表长度 需要用到我的链表 头文件 // // cntbl.h // hash // // Created by bikang on 16/9/22. // Copyright (c) 2016年 bikang. All rights reserved. // #ifndef __hash__cntbl__ #define __hash__cntbl__ #include list.h #include stdlib.h typedef struct CHTbl_{ int buckets;//桶的大小 unsigned int (*h)(const void *key);//哈希函数 int (*match)(const void *key1,const void *key2);//比较,匹配 void (*destroy)(void *data);//内存释放函数 int size;//数据的多少 List *table; }CHTbl; //初始化 int chtbl_init(CHTbl *htbl,int buckets,int (*h)(const void *key), int(*match)(const void *k1,const void *k2), void(*destroy)(void*data)); //销毁 void chtbl_destroy(CHTbl *htbl); //插入 int chtbl_insert(CHTbl *htbl,void *data); //删除 int chtbl_remove(CHTbl *htbl,void **data); //查找 int chtbl_lookup(CHTbl *htbl,void **data); //数据的多少 #define chtbl_size(htbl) ((htbl)-size) #endif /* defined(__hash__cntbl__) */ 实现 // // cntbl.c // hash // // Created by bikang on 16/9/22. // Copyright (c) 2016年 bikang. All rights reserved. // #include stdio.h #include string.h #include stdlib.h #include cntbl.h #include list.h //初始化 int chtbl_init(CHTbl *htbl,int buckets,int (*h)(const void *key), int(*match)(const void *k1,const void *k2), void(*destroy)(void*data)){ int i; //初始化数据 if((htbl-table =(List*)malloc(sizeof(List)*buckets) ) == NULL) return -1; htbl-buckets = buckets; for(i=0;ihtbl-buckets;i++){ list_init(htbl-table[i], destroy); } htbl-h = h; htbl-match = match; htbl-destroy = destroy; htbl-size = 0; return 0; } //释放数据 void chtbl_destroy(CHTbl *htbl){ int i; for(i=0;ihtbl-buckets;i++){ list_destroy(htbl-table[i]); } free(htbl-table); memset(htbl, 0, sizeof(CHTbl)); return; } //插入 int chtbl_insert(CHTbl *htbl,void *data){ void *temp; int bucket,retval; temp = (void*)data; //是否存在,存在直接返回 if(chtbl_lookup(htbl, temp) == 0) retu