1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
#include "uthash.h"
#include <stdlib.h> /* malloc */
#include <stdio.h> /* printf */
typedef struct example_user_t {
int id;
int cookie;
UT_hash_handle hh;
} example_user_t;
int main()
{
int i;
unsigned c;
example_user_t *user, *tmp, *users=NULL;
/* create elements */
for(i=0; i<10; i++) {
if ( (user = (example_user_t*)malloc(sizeof(example_user_t))) == NULL) {
exit(-1);
}
user->id = i;
user->cookie = i*i;
HASH_ADD_INT(users,id,user);
}
/* show the hash */
for(user=users; user != NULL; user=(example_user_t*)(user->hh.next)) {
printf("user %d, cookie %d\n", user->id, user->cookie);
}
c = HASH_COUNT(users);
printf("%u users. Deleting odd id's...\n", c);
/* delete the odd id's */
HASH_ITER(hh, users, user, tmp) {
if ((user->id & 1) != 0) {
HASH_DEL(users,user);
}
}
/* show the hash */
for(user=users; user != NULL; user=(example_user_t*)(user->hh.next)) {
printf("user %d, cookie %d\n", user->id, user->cookie);
}
c = HASH_COUNT(users);
printf("%u users. Deleting remaining id's...\n", c);
/* delete all that are left */
HASH_ITER(hh, users, user, tmp) {
HASH_DEL(users,user);
}
c = HASH_COUNT(users);
printf("%u users.\n", c);
/* show the hash */
for(user=users; user != NULL; user=(example_user_t*)(user->hh.next)) {
printf("user %d, cookie %d\n", user->id, user->cookie);
}
return 0;
}
|