7 int ivals[] = {0,1,2,3,4,5,6,7,8,9};
9 unsigned long djb2hash(const void *x)
12 unsigned long hash = 5381;
16 while ( (c = *str++) )
21 int scmp(const void *a, const void *b, void *aux)
27 void myfree(void *a, void *aux)
35 hashmap *h = hm_new(0, djb2hash, scmp, NULL);
36 assert(hm_length(h) == 0);
37 assert(hm_is_empty(h));
39 assert(!hm_at(h, "zero"));
40 hm_insert(h, "zero", ivals);
41 assert(hm_length(h) == 1);
42 assert(*(int*)hm_at(h, "zero") == 0);
45 hm_insert(h, "zero", ivals+1);
46 assert(hm_length(h) == 1);
47 assert(*(int*)hm_at(h, "zero") == 1);
49 hm_insert(h, "zero", ivals);
50 assert(*(int*)hm_at(h, "zero") == 0);
52 hm_insert(h, "one", ivals+1);
53 assert(hm_length(h) == 2);
54 assert(*(int*)hm_at(h, "zero") == 0);
55 assert(*(int*)hm_at(h, "one") == 1);
56 assert(!hm_at(h, "flurgle"));
59 assert(!hm_at(h, "one"));
62 assert(hm_length(h) == 0);
63 assert(!hm_at(h, "zero"));
65 /* test for memory leak */
66 hm_dtor(h, myfree, myfree, NULL);
67 char *key = malloc(5);
68 int *val1 = malloc(sizeof *val1),
69 *val2 = malloc(sizeof *val2);
73 hm_insert(h, key, val1);
74 hm_insert(h, key, val2);