void avl_unit_clear_tree(struct avltree *t)
{
avl_unit_val_t *v;
struct avltree_node *node, *next_node;
if (avltree_size(t) < 1)
return;
node = avltree_first(t);
while (node) {
next_node = avltree_next(node);
v = avltree_container_of(node, avl_unit_val_t, node_hk);
avltree_remove(&v->node_hk, &avl_tree_1);
gsh_free(v->name);
avl_unit_free_val(v);
node = next_node;
}
}
void check_delete_1(void)
{
struct avltree_node *node;
avl_unit_val_t *v, *v2;
avl_unit_clear_and_destroy_tree(&avl_tree_1);
avltree_init(&avl_tree_1, avl_unit_cmpf, 0 /* flags */);
insert_long_val(&avl_tree_1, 4);
insert_long_val(&avl_tree_1, 1);
insert_long_val(&avl_tree_1, 10010);
insert_long_val(&avl_tree_1, 267);
insert_long_val(&avl_tree_1, 3382);
insert_long_val(&avl_tree_1, 22);
insert_long_val(&avl_tree_1, 82);
insert_long_val(&avl_tree_1, 3);
node = avltree_first(&avl_tree_1);
v2 = avltree_container_of(node, avl_unit_val_t, node_k);
CU_ASSERT(v2->val == (1 + 1));
delete_long_val(&avl_tree_1, 1);
/* new key */
v = avl_unit_new_val(4);
v->key = 4;
node = avltree_lookup(&v->node_k, &avl_tree_1);
v2 = avltree_container_of(node, avl_unit_val_t, node_k);
CU_ASSERT(v2->val == (4 + 1));
delete_long_val(&avl_tree_1, 267);
v->key = 3382;
node = avltree_lookup(&v->node_k, &avl_tree_1);
v2 = avltree_container_of(node, avl_unit_val_t, node_k);
CU_ASSERT(v2->val == (3382 + 1));
avl_unit_free_val(v);
}
void lookups_tree_10000(void)
{
struct avltree_node *node;
avl_unit_val_t *v2, *v = avl_unit_new_val(0);
int ix;
for (ix = 1; ix < 2; ++ix) {
/* reuse v */
v->key = ix;
/* lookup mapping */
node = avltree_lookup(&v->node_k, &avl_tree_10000);
v2 = avltree_container_of(node, avl_unit_val_t, node_k);
CU_ASSERT((unsigned long)v2->val == (ix + 1));
}
/* free v */
avl_unit_free_val(v);
}
