35 avl_create (avl_comparison_func *compare,
void *param,
40 assert (compare != NULL);
42 if (allocator == NULL)
43 allocator = &avl_allocator_default;
45 tree = allocator->libavl_malloc (allocator,
sizeof *tree);
49 tree->avl_root = NULL;
50 tree->avl_compare = compare;
51 tree->avl_param = param;
52 tree->avl_alloc = allocator;
54 tree->avl_generation = 0;
62 avl_find (
const struct avl_table *tree,
const void *item)
66 assert (tree != NULL && item != NULL);
67 for (p = tree->avl_root; p != NULL; )
69 int cmp = tree->avl_compare (item, p->avl_data, tree->avl_param);
87 avl_probe (
struct avl_table *tree,
void *item)
95 unsigned char da[AVL_MAX_HEIGHT];
98 assert (tree != NULL && item != NULL);
100 z = (
struct avl_node *) &tree->avl_root;
103 for (q = z, p = y; p != NULL; q = p, p = p->avl_link[dir])
105 int cmp = tree->avl_compare (item, p->avl_data, tree->avl_param);
109 if (p->avl_balance != 0)
111 da[k++] = dir = cmp > 0;
114 n = q->avl_link[dir] =
115 tree->avl_alloc->libavl_malloc (tree->avl_alloc,
sizeof *n);
121 n->avl_link[0] = n->avl_link[1] = NULL;
126 for (p = y, k = 0; p != n; p = p->avl_link[da[k]], k++)
132 if (y->avl_balance == -2)
134 struct avl_node *x = y->avl_link[0];
135 if (x->avl_balance == -1)
138 y->avl_link[0] = x->avl_link[1];
140 x->avl_balance = y->avl_balance = 0;
144 assert (x->avl_balance == +1);
146 x->avl_link[1] = w->avl_link[0];
148 y->avl_link[0] = w->avl_link[1];
150 if (w->avl_balance == -1)
151 x->avl_balance = 0, y->avl_balance = +1;
152 else if (w->avl_balance == 0)
153 x->avl_balance = y->avl_balance = 0;
155 x->avl_balance = -1, y->avl_balance = 0;
159 else if (y->avl_balance == +2)
161 struct avl_node *x = y->avl_link[1];
162 if (x->avl_balance == +1)
165 y->avl_link[1] = x->avl_link[0];
167 x->avl_balance = y->avl_balance = 0;
171 assert (x->avl_balance == -1);
173 x->avl_link[0] = w->avl_link[1];
175 y->avl_link[1] = w->avl_link[0];
177 if (w->avl_balance == +1)
178 x->avl_balance = 0, y->avl_balance = -1;
179 else if (w->avl_balance == 0)
180 x->avl_balance = y->avl_balance = 0;
182 x->avl_balance = +1, y->avl_balance = 0;
188 z->avl_link[y != z->avl_link[0]] = w;
190 tree->avl_generation++;
199 avl_insert (
struct avl_table *table,
void *item)
201 void **p = avl_probe (table, item);
202 return p == NULL || *p == item ? NULL : *p;
210 avl_replace (
struct avl_table *table,
void *item)
212 void **p = avl_probe (table, item);
213 if (p == NULL || *p == item)
226 avl_delete (
struct avl_table *tree,
const void *item)
229 struct avl_node *pa[AVL_MAX_HEIGHT];
230 unsigned char da[AVL_MAX_HEIGHT];
236 assert (tree != NULL && item != NULL);
239 p = (
struct avl_node *) &tree->avl_root;
240 for (cmp = -1; cmp != 0;
241 cmp = tree->avl_compare (item, p->avl_data, tree->avl_param))
248 p = p->avl_link[dir];
254 if (p->avl_link[1] == NULL)
255 pa[k - 1]->avl_link[da[k - 1]] = p->avl_link[0];
258 struct avl_node *r = p->avl_link[1];
259 if (r->avl_link[0] == NULL)
261 r->avl_link[0] = p->avl_link[0];
262 r->avl_balance = p->avl_balance;
263 pa[k - 1]->avl_link[da[k - 1]] = r;
277 if (s->avl_link[0] == NULL)
283 s->avl_link[0] = p->avl_link[0];
284 r->avl_link[0] = s->avl_link[1];
285 s->avl_link[1] = p->avl_link[1];
286 s->avl_balance = p->avl_balance;
288 pa[j - 1]->avl_link[da[j - 1]] = s;
294 tree->avl_alloc->libavl_free (tree->avl_alloc, p);
304 if (y->avl_balance == +1)
306 else if (y->avl_balance == +2)
308 struct avl_node *x = y->avl_link[1];
309 if (x->avl_balance == -1)
312 assert (x->avl_balance == -1);
314 x->avl_link[0] = w->avl_link[1];
316 y->avl_link[1] = w->avl_link[0];
318 if (w->avl_balance == +1)
319 x->avl_balance = 0, y->avl_balance = -1;
320 else if (w->avl_balance == 0)
321 x->avl_balance = y->avl_balance = 0;
323 x->avl_balance = +1, y->avl_balance = 0;
325 pa[k - 1]->avl_link[da[k - 1]] = w;
329 y->avl_link[1] = x->avl_link[0];
331 pa[k - 1]->avl_link[da[k - 1]] = x;
332 if (x->avl_balance == 0)
339 x->avl_balance = y->avl_balance = 0;
346 if (y->avl_balance == -1)
348 else if (y->avl_balance == -2)
350 struct avl_node *x = y->avl_link[0];
351 if (x->avl_balance == +1)
354 assert (x->avl_balance == +1);
356 x->avl_link[1] = w->avl_link[0];
358 y->avl_link[0] = w->avl_link[1];
360 if (w->avl_balance == -1)
361 x->avl_balance = 0, y->avl_balance = +1;
362 else if (w->avl_balance == 0)
363 x->avl_balance = y->avl_balance = 0;
365 x->avl_balance = -1, y->avl_balance = 0;
367 pa[k - 1]->avl_link[da[k - 1]] = w;
371 y->avl_link[0] = x->avl_link[1];
373 pa[k - 1]->avl_link[da[k - 1]] = x;
374 if (x->avl_balance == 0)
381 x->avl_balance = y->avl_balance = 0;
388 tree->avl_generation++;
389 return (
void *) item;
397 assert (trav != NULL);
399 trav->avl_generation = trav->avl_table->avl_generation;
401 if (trav->avl_node != NULL)
403 avl_comparison_func *cmp = trav->avl_table->avl_compare;
404 void *param = trav->avl_table->avl_param;
405 struct avl_node *node = trav->avl_node;
408 trav->avl_height = 0;
409 for (i = trav->avl_table->avl_root; i != node; )
411 assert (trav->avl_height < AVL_MAX_HEIGHT);
414 trav->avl_stack[trav->avl_height++] = i;
415 i = i->avl_link[cmp (node->avl_data, i->avl_data, param) > 0];
425 trav->avl_table = tree;
426 trav->avl_node = NULL;
427 trav->avl_height = 0;
428 trav->avl_generation = tree->avl_generation;
439 assert (tree != NULL && trav != NULL);
441 trav->avl_table = tree;
442 trav->avl_height = 0;
443 trav->avl_generation = tree->avl_generation;
447 while (x->avl_link[0] != NULL)
449 assert (trav->avl_height < AVL_MAX_HEIGHT);
450 trav->avl_stack[trav->avl_height++] = x;
455 return x != NULL ? x->avl_data : NULL;
466 assert (tree != NULL && trav != NULL);
468 trav->avl_table = tree;
469 trav->avl_height = 0;
470 trav->avl_generation = tree->avl_generation;
474 while (x->avl_link[1] != NULL)
476 assert (trav->avl_height < AVL_MAX_HEIGHT);
477 trav->avl_stack[trav->avl_height++] = x;
482 return x != NULL ? x->avl_data : NULL;
495 assert (trav != NULL && tree != NULL && item != NULL);
496 trav->avl_table = tree;
497 trav->avl_height = 0;
498 trav->avl_generation = tree->avl_generation;
499 for (p = tree->avl_root; p != NULL; p = q)
501 int cmp = tree->avl_compare (item, p->avl_data, tree->avl_param);
513 assert (trav->avl_height < AVL_MAX_HEIGHT);
514 trav->avl_stack[trav->avl_height++] = p;
517 trav->avl_height = 0;
518 trav->avl_node = NULL;
534 assert (trav != NULL && tree != NULL && item != NULL);
536 p = avl_probe (tree, item);
539 trav->avl_table = tree;
542 ((
char *) p - offsetof (
struct avl_node, avl_data)));
543 trav->avl_generation = tree->avl_generation - 1;
548 avl_t_init (trav, tree);
557 assert (trav != NULL && src != NULL);
561 trav->avl_table = src->avl_table;
562 trav->avl_node = src->avl_node;
563 trav->avl_generation = src->avl_generation;
564 if (trav->avl_generation == trav->avl_table->avl_generation)
566 trav->avl_height = src->avl_height;
567 memcpy (trav->avl_stack, (
const void *) src->avl_stack,
568 sizeof *trav->avl_stack * trav->avl_height);
572 return trav->avl_node != NULL ? trav->avl_node->avl_data : NULL;
583 assert (trav != NULL);
585 if (trav->avl_generation != trav->avl_table->avl_generation)
591 return avl_t_first (trav, trav->avl_table);
593 else if (x->avl_link[1] != NULL)
595 assert (trav->avl_height < AVL_MAX_HEIGHT);
596 trav->avl_stack[trav->avl_height++] = x;
599 while (x->avl_link[0] != NULL)
601 assert (trav->avl_height < AVL_MAX_HEIGHT);
602 trav->avl_stack[trav->avl_height++] = x;
612 if (trav->avl_height == 0)
614 trav->avl_node = NULL;
619 x = trav->avl_stack[--trav->avl_height];
621 while (y == x->avl_link[1]);
636 assert (trav != NULL);
638 if (trav->avl_generation != trav->avl_table->avl_generation)
644 return avl_t_last (trav, trav->avl_table);
646 else if (x->avl_link[0] != NULL)
648 assert (trav->avl_height < AVL_MAX_HEIGHT);
649 trav->avl_stack[trav->avl_height++] = x;
652 while (x->avl_link[1] != NULL)
654 assert (trav->avl_height < AVL_MAX_HEIGHT);
655 trav->avl_stack[trav->avl_height++] = x;
665 if (trav->avl_height == 0)
667 trav->avl_node = NULL;
672 x = trav->avl_stack[--trav->avl_height];
674 while (y == x->avl_link[0]);
685 assert (trav != NULL);
687 return trav->avl_node != NULL ? trav->avl_node->avl_data : NULL;
698 assert (trav != NULL && trav->avl_node != NULL &&
new != NULL);
699 old = trav->avl_node->avl_data;
700 trav->avl_node->avl_data =
new;
705 copy_error_recovery (
struct avl_node **stack,
int height,
706 struct avl_table *
new, avl_item_func *destroy)
708 assert (stack != NULL && height >= 0 &&
new != NULL);
710 for (; height > 2; height -= 2)
711 stack[height - 1]->avl_link[1] = NULL;
712 avl_destroy (
new, destroy);
725 avl_copy (
const struct avl_table *org, avl_copy_func *copy,
728 struct avl_node *stack[2 * (AVL_MAX_HEIGHT + 1)];
735 assert (org != NULL);
736 new = avl_create (org->avl_compare, org->avl_param,
737 allocator != NULL ? allocator : org->avl_alloc);
740 new->avl_count = org->avl_count;
741 if (new->avl_count == 0)
744 x = (
const struct avl_node *) &org->avl_root;
745 y = (
struct avl_node *) &
new->avl_root;
748 while (x->avl_link[0] != NULL)
750 assert (height < 2 * (AVL_MAX_HEIGHT + 1));
753 new->avl_alloc->libavl_malloc (new->avl_alloc,
754 sizeof *y->avl_link[0]);
755 if (y->avl_link[0] == NULL)
757 if (y != (
struct avl_node *) &new->avl_root)
760 y->avl_link[1] = NULL;
763 copy_error_recovery (stack, height,
new, destroy);
767 stack[height++] = (
struct avl_node *) x;
772 y->avl_link[0] = NULL;
776 y->avl_balance = x->avl_balance;
778 y->avl_data = x->avl_data;
781 y->avl_data = copy (x->avl_data, org->avl_param);
782 if (y->avl_data == NULL)
784 y->avl_link[1] = NULL;
785 copy_error_recovery (stack, height,
new, destroy);
790 if (x->avl_link[1] != NULL)
793 new->avl_alloc->libavl_malloc (new->avl_alloc,
794 sizeof *y->avl_link[1]);
795 if (y->avl_link[1] == NULL)
797 copy_error_recovery (stack, height,
new, destroy);
806 y->avl_link[1] = NULL;
820 avl_destroy (
struct avl_table *tree, avl_item_func *destroy)
824 assert (tree != NULL);
826 for (p = tree->avl_root; p != NULL; p = q)
827 if (p->avl_link[0] == NULL)
830 if (destroy != NULL && p->avl_data != NULL)
831 destroy (p->avl_data, tree->avl_param);
832 tree->avl_alloc->libavl_free (tree->avl_alloc, p);
837 p->avl_link[0] = q->avl_link[1];
841 tree->avl_alloc->libavl_free (tree->avl_alloc, tree);
849 assert (allocator != NULL && size > 0);
850 return malloc (size);
857 assert (allocator != NULL && block != NULL);
873 (avl_assert_insert) (
struct avl_table *table,
void *item)
875 void **p = avl_probe (table, item);
876 assert (p != NULL && *p == item);
882 (avl_assert_delete) (
struct avl_table *table,
void *item)
884 void *p = avl_delete (table, item);
890 return t->avl_node == NULL;