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
61
62
63
64
65
66
|
#include "uthash.h"
#include <stdlib.h> /* malloc */
#include <stdio.h> /* printf */
typedef struct example_user_t {
int id;
int cookie;
UT_hash_handle hh;
UT_hash_handle alth;
} example_user_t;
static int ascending_sort(void *_a, void *_b)
{
example_user_t *a = (example_user_t*)_a;
example_user_t *b = (example_user_t*)_b;
if (a->id == b->id) {
return 0;
}
return (a->id < b->id) ? -1 : 1;
}
static int descending_sort(void *_a, void *_b)
{
example_user_t *a = (example_user_t*)_a;
example_user_t *b = (example_user_t*)_b;
if (a->id == b->id) {
return 0;
}
return (a->id < b->id) ? 1 : -1;
}
int main()
{
int i;
example_user_t *user, *users=NULL, *altusers=NULL;
/* create elements */
for(i=0; i<1000; i++) {
user = (example_user_t*)malloc(sizeof(example_user_t));
if (user == NULL) {
exit(-1);
}
user->id = i;
user->cookie = i*i;
if (i<10) {
HASH_ADD_INT(users,id,user);
}
HASH_ADD(alth,altusers,id,sizeof(int),user);
}
printf("sorting users ascending\n");
HASH_SRT(hh,users,ascending_sort);
for(user=users; user!=NULL; user=(example_user_t*)user->hh.next) {
printf("user %d\n", user->id);
}
printf("sorting altusers descending\n");
HASH_SRT(alth,altusers,descending_sort);
for(user=altusers; user!=NULL; user=(example_user_t*)user->alth.next) {
printf("altuser %d\n", user->id);
}
/* HASH_FSCK(hh,users); */
/* HASH_FSCK(alth,altusers); */
return 0;
}
|