Linux C 下的哈希表

最新推荐文章于 2024-09-21 18:47:52 发布

lichenyu

最新推荐文章于 2024-09-21 18:47:52 发布

阅读量4.1k

点赞数

文章标签： linux struct c

本文链接：https://blog.csdn.net/LEEtcWorks/article/details/7731807

版权

/*
 * HashTest.c
 *
 *  Created on: 2012-7-10
 *      Author: root
 */


#include <stdio.h>
#include <stdlib.h>
#define __USE_GNU
#include <search.h>

int main()
{
	printf("hashtest\n");
	struct hsearch_data *ht1 = (struct hsearch_data*)calloc(5, sizeof(struct hsearch_data));
	struct hsearch_data *ht2 = (struct hsearch_data*)calloc(5, sizeof(struct hsearch_data));
	struct hsearch_data *ht3 = (struct hsearch_data*)calloc(5, sizeof(struct hsearch_data));

	if(0 == hcreate_r(5, ht1) || 0 == hcreate_r(5, ht2) || 0 == hcreate_r(5, ht3))
	{
		printf("cannot create hashtable");
	}

	ENTRY e;
	ENTRY *ee;

	e.key = "e1";
	e.data = "e1data";
	hsearch_r(e, ENTER, &ee, ht1);

	e.key = "e2";
	e.data = "e2data";
	hsearch_r(e, ENTER, &ee, ht1);

	e.key = "e3";
	e.data = "e3data";
	hsearch_r(e, ENTER, &ee, ht2);

	e.key = "e4";
	e.data = "e4data";
	hsearch_r(e, ENTER, &ee, ht2);

	e.key = "e5";
	e.data = "e5data";
	hsearch_r(e, ENTER, &ee, ht3);

	ENTRY *eee;
	e.key = "e1";
	if (0 == hsearch_r(e, FIND, &eee, ht1))
		printf("cannot find entry\n");
	else
		printf("key: %s , value: %s .\n", eee->key, (char *)eee->data);

	e.key = "e2";
	if (0 == hsearch_r(e, FIND, &eee, ht1))
		printf("cannot find entry\n");
	else
		printf("key: %s , value: %s .\n", eee->key, (char *)eee->data);

	e.key = "e3";
	if (0 == hsearch_r(e, FIND, &eee, ht1))
		printf("cannot find entry\n");
	else
		printf("key: %s , value: %s .\n", eee->key, (char *)eee->data);

	e.key = "e4";
	if (0 == hsearch_r(e, FIND, &eee, ht2))
		printf("cannot find entry\n");
	else
		printf("key: %s , value: %s .\n", eee->key, (char *)eee->data);

	e.key = "e5";
	if (0 == hsearch_r(e, FIND, &eee, ht3))
		printf("cannot find entry\n");
	else
		printf("key: %s , value: %s .\n", eee->key, (char *)eee->data);

	hdestroy_r(ht1);
	hdestroy_r(ht2);
	hdestroy_r(ht3);

	return 0;
}