12 static struct e tab[100];
13 static struct e *cur = tab;
15 static int cmp(const void *a, const void *b)
17 return strcmp(((struct e*)a)->k, ((struct e*)b)->k);
20 static int wantc = 'a';
21 static void act(const void *node, VISIT v, int d)
23 struct e *e = *(struct e **)node;
27 t_error("preorder visited node \"%s\" before \"%c\"\n", e->k, wantc);
30 t_error("endorder visited node \"%s\" after \"%c\"\n", e->k, wantc);
33 t_error("postorder visited node \"%s\", wanted \"%c\"\n", e->k, wantc);
36 t_error("visited leaf node \"%s\", wanted \"%c\"\n", e->k, wantc);
37 if (v == postorder || v == leaf)
41 static const void *parent;
42 static char *searchkey;
43 static void getparent(const void *node, VISIT v, int d)
46 struct e *e = *(struct e **)node;
48 if (v == preorder || v == leaf)
49 if (strcmp(searchkey, e->k) == 0)
51 if (v == preorder || v == postorder)
55 struct e *set(char *k, int v)
60 p = tsearch(cur++, &root, cmp);
61 if (!p || strcmp((*p)->k, k) != 0)
62 t_error("tsearch %s %d failed\n", k, v);
68 struct e **get(char *k)
70 return tfind(&(struct e){.k = k}, &root, cmp);
73 struct e **del(char *k)
75 return tdelete(&(struct e){.k = k}, &root, cmp);
92 if (!p || (*p)->v != 1)
93 t_error("tfind a failed\n");
95 t_error("tfind z should fail\n");
98 t_error("tsearch g 9 returned data %d, wanted 7\n", e->v);
101 t_error("tsearch g 9 returned data %d, wanted 7\n", e->v);
104 t_error("tsearch i 9 returned data %d, wanted 9\n", e->v);
106 t_error("tdelete foobar should fail\n");
110 t_error("twalk did not visit all nodes (wanted 'j' got '%c')\n", wantc);
112 twalk(root, getparent);
114 t_error("twalk search for key \"%s\" failed\n", searchkey);
117 t_error("tdelete h failed to return parent (got %p wanted %p)\n", p, parent);
121 t_error("tdelete root \"%s\" failed (returned 0)\n", (*p)->k);