#include "kbtree.h" KBTREE_INIT(int, intmap_t, __intcmp) KBTREE_INIT(str, strmap_t, __strcmp) int test_int(int N, const unsigned *data) { int i, ret; intmap_t d; kbtree_t(int) *h; h = kb_init(int, KB_DEFAULT_SIZE); for (i = 0; i < N; ++i) { d.key = data[i]; d.value = i; if (kb_getp(int, h, &d) == 0) kb_putp(int, h, &d); else kb_delp(int, h, &d); } ret = (int)kb_size(h); if (0) { unsigned xor = 0; #define traf(k) (xor ^= (k)->value) __kb_traverse(intmap_t, h, traf); printf("%u\n", xor); } kb_destroy(int, h); return ret; } int test_str(int N, char * const *data) { int i, ret; strmap_t d; kbtree_t(str) *h; h = kb_init(str, KB_DEFAULT_SIZE);
free(str_data); free(int_data); } void ht_khash_int() { int i; unsigned *data = int_data; uint32_t *l, *u; kbtree_t(int) *h; h = kb_init(int, KB_DEFAULT_SIZE); for (i = 0; i < data_size; ++i) { if (kb_get(int, h, data[i]) == 0) kb_put(int, h, data[i]); else kb_del(int, h, data[i]); } printf("[ht_khash_int] size: %d\n", kb_size(h)); if (1) { int cnt = 0; kb_interval(int, h, 2174625464u, &l, &u); printf("interval for 2174625464: (%u, %u)\n", l? *l : 0, u? *u : 0); #define traverse_f(p) ++cnt __kb_traverse(uint32_t, h, traverse_f); printf("# of elements from traversal: %d\n", cnt); } __kb_destroy(h); } void ht_khash_str() { int i; char **data = str_data; kbtree_t(str) *h;