2 * Copyright (C) 2000 Red Hat, Inc., Jonathan Blandford <jrb@redhat.com>
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Library General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Library General Public License for more details.
14 * You should have received a copy of the GNU Library General Public
15 * License along with this library; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 02111-1307, USA.
21 #include "gtkrbtree.h"
24 static GtkRBNode * _gtk_rbnode_new (GtkRBTree *tree,
26 static void _gtk_rbnode_free (GtkRBNode *node);
27 static void _gtk_rbnode_rotate_left (GtkRBTree *tree,
29 static void _gtk_rbnode_rotate_right (GtkRBTree *tree,
31 static void _gtk_rbtree_insert_fixup (GtkRBTree *tree,
33 static void _gtk_rbtree_remove_node_fixup (GtkRBTree *tree,
35 static inline void _fixup_validation (GtkRBTree *tree,
37 static inline void _fixup_total_count (GtkRBTree *tree,
40 static void _gtk_rbtree_test (const gchar *where,
42 static void _gtk_rbtree_debug_spew (GtkRBTree *tree);
48 _gtk_rbnode_new (GtkRBTree *tree,
51 GtkRBNode *node = g_slice_new (GtkRBNode);
53 node->left = tree->nil;
54 node->right = tree->nil;
55 node->parent = tree->nil;
56 node->flags = GTK_RBNODE_RED;
57 node->total_count = 1;
59 node->children = NULL;
60 node->offset = height;
65 _gtk_rbnode_free (GtkRBNode *node)
68 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
70 node->left = (gpointer) 0xdeadbeef;
71 node->right = (gpointer) 0xdeadbeef;
72 node->parent = (gpointer) 0xdeadbeef;
73 node->total_count = 56789;
79 g_slice_free (GtkRBNode, node);
83 _gtk_rbnode_rotate_left (GtkRBTree *tree,
86 gint node_height, right_height;
87 GtkRBNode *right = node->right;
89 g_return_if_fail (node != tree->nil);
91 node_height = node->offset -
92 (node->left?node->left->offset:0) -
93 (node->right?node->right->offset:0) -
94 (node->children?node->children->root->offset:0);
95 right_height = right->offset -
96 (right->left?right->left->offset:0) -
97 (right->right?right->right->offset:0) -
98 (right->children?right->children->root->offset:0);
99 node->right = right->left;
100 if (right->left != tree->nil)
101 right->left->parent = node;
103 if (right != tree->nil)
104 right->parent = node->parent;
105 if (node->parent != tree->nil)
107 if (node == node->parent->left)
108 node->parent->left = right;
110 node->parent->right = right;
116 if (node != tree->nil)
117 node->parent = right;
119 node->count = 1 + (node->left?node->left->count:0) +
120 (node->right?node->right->count:0);
121 right->count = 1 + (right->left?right->left->count:0) +
122 (right->right?right->right->count:0);
124 node->offset = node_height +
125 (node->left?node->left->offset:0) +
126 (node->right?node->right->offset:0) +
127 (node->children?node->children->root->offset:0);
128 right->offset = right_height +
129 (right->left?right->left->offset:0) +
130 (right->right?right->right->offset:0) +
131 (right->children?right->children->root->offset:0);
133 _fixup_validation (tree, node);
134 _fixup_validation (tree, right);
135 _fixup_total_count (tree, node);
136 _fixup_total_count (tree, right);
140 _gtk_rbnode_rotate_right (GtkRBTree *tree,
143 gint node_height, left_height;
144 GtkRBNode *left = node->left;
146 g_return_if_fail (node != tree->nil);
148 node_height = node->offset -
149 (node->left?node->left->offset:0) -
150 (node->right?node->right->offset:0) -
151 (node->children?node->children->root->offset:0);
152 left_height = left->offset -
153 (left->left?left->left->offset:0) -
154 (left->right?left->right->offset:0) -
155 (left->children?left->children->root->offset:0);
157 node->left = left->right;
158 if (left->right != tree->nil)
159 left->right->parent = node;
161 if (left != tree->nil)
162 left->parent = node->parent;
163 if (node->parent != tree->nil)
165 if (node == node->parent->right)
166 node->parent->right = left;
168 node->parent->left = left;
175 /* link node and left */
177 if (node != tree->nil)
180 node->count = 1 + (node->left?node->left->count:0) +
181 (node->right?node->right->count:0);
182 left->count = 1 + (left->left?left->left->count:0) +
183 (left->right?left->right->count:0);
185 node->offset = node_height +
186 (node->left?node->left->offset:0) +
187 (node->right?node->right->offset:0) +
188 (node->children?node->children->root->offset:0);
189 left->offset = left_height +
190 (left->left?left->left->offset:0) +
191 (left->right?left->right->offset:0) +
192 (left->children?left->children->root->offset:0);
194 _fixup_validation (tree, node);
195 _fixup_validation (tree, left);
196 _fixup_total_count (tree, node);
197 _fixup_total_count (tree, left);
201 _gtk_rbtree_insert_fixup (GtkRBTree *tree,
205 /* check Red-Black properties */
206 while (node != tree->root && GTK_RBNODE_GET_COLOR (node->parent) == GTK_RBNODE_RED)
208 /* we have a violation */
209 if (node->parent == node->parent->parent->left)
211 GtkRBNode *y = node->parent->parent->right;
212 if (GTK_RBNODE_GET_COLOR (y) == GTK_RBNODE_RED)
214 /* uncle is GTK_RBNODE_RED */
215 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
216 GTK_RBNODE_SET_COLOR (y, GTK_RBNODE_BLACK);
217 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
218 node = node->parent->parent;
222 /* uncle is GTK_RBNODE_BLACK */
223 if (node == node->parent->right)
225 /* make node a left child */
227 _gtk_rbnode_rotate_left (tree, node);
230 /* recolor and rotate */
231 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
232 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
233 _gtk_rbnode_rotate_right(tree, node->parent->parent);
238 /* mirror image of above code */
239 GtkRBNode *y = node->parent->parent->left;
240 if (GTK_RBNODE_GET_COLOR (y) == GTK_RBNODE_RED)
242 /* uncle is GTK_RBNODE_RED */
243 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
244 GTK_RBNODE_SET_COLOR (y, GTK_RBNODE_BLACK);
245 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
246 node = node->parent->parent;
250 /* uncle is GTK_RBNODE_BLACK */
251 if (node == node->parent->left)
254 _gtk_rbnode_rotate_right (tree, node);
256 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
257 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
258 _gtk_rbnode_rotate_left (tree, node->parent->parent);
262 GTK_RBNODE_SET_COLOR (tree->root, GTK_RBNODE_BLACK);
266 _gtk_rbtree_remove_node_fixup (GtkRBTree *tree,
269 while (node != tree->root && GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)
271 if (node == node->parent->left)
273 GtkRBNode *w = node->parent->right;
274 if (GTK_RBNODE_GET_COLOR (w) == GTK_RBNODE_RED)
276 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_BLACK);
277 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_RED);
278 _gtk_rbnode_rotate_left (tree, node->parent);
279 w = node->parent->right;
281 if (GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK && GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK)
283 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
288 if (GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK)
290 GTK_RBNODE_SET_COLOR (w->left, GTK_RBNODE_BLACK);
291 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
292 _gtk_rbnode_rotate_right (tree, w);
293 w = node->parent->right;
295 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_GET_COLOR (node->parent));
296 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
297 GTK_RBNODE_SET_COLOR (w->right, GTK_RBNODE_BLACK);
298 _gtk_rbnode_rotate_left (tree, node->parent);
304 GtkRBNode *w = node->parent->left;
305 if (GTK_RBNODE_GET_COLOR (w) == GTK_RBNODE_RED)
307 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_BLACK);
308 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_RED);
309 _gtk_rbnode_rotate_right (tree, node->parent);
310 w = node->parent->left;
312 if (GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK && GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK)
314 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
319 if (GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK)
321 GTK_RBNODE_SET_COLOR (w->right, GTK_RBNODE_BLACK);
322 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
323 _gtk_rbnode_rotate_left (tree, w);
324 w = node->parent->left;
326 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_GET_COLOR (node->parent));
327 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
328 GTK_RBNODE_SET_COLOR (w->left, GTK_RBNODE_BLACK);
329 _gtk_rbnode_rotate_right (tree, node->parent);
334 GTK_RBNODE_SET_COLOR (node, GTK_RBNODE_BLACK);
338 _gtk_rbtree_new (void)
342 retval = g_new (GtkRBTree, 1);
343 retval->parent_tree = NULL;
344 retval->parent_node = NULL;
346 retval->nil = g_slice_new (GtkRBNode);
347 retval->nil->left = NULL;
348 retval->nil->right = NULL;
349 retval->nil->parent = NULL;
350 retval->nil->flags = GTK_RBNODE_BLACK;
351 retval->nil->count = 0;
352 retval->nil->offset = 0;
353 retval->nil->total_count = 0;
355 retval->root = retval->nil;
360 _gtk_rbtree_free_helper (GtkRBTree *tree,
365 _gtk_rbtree_free (node->children);
367 _gtk_rbnode_free (node);
371 _gtk_rbtree_free (GtkRBTree *tree)
373 _gtk_rbtree_traverse (tree,
376 _gtk_rbtree_free_helper,
379 if (tree->parent_node &&
380 tree->parent_node->children == tree)
381 tree->parent_node->children = NULL;
382 _gtk_rbnode_free (tree->nil);
387 _gtk_rbtree_remove (GtkRBTree *tree)
392 gint height = tree->root->offset;
393 guint total_count = tree->root->total_count;
395 #ifdef G_ENABLE_DEBUG
396 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
397 _gtk_rbtree_test (G_STRLOC, tree);
400 tmp_tree = tree->parent_tree;
401 tmp_node = tree->parent_node;
403 /* ugly hack to make _fixup_validation work in the first iteration of the
405 GTK_RBNODE_UNSET_FLAG (tree->root, GTK_RBNODE_DESCENDANTS_INVALID);
407 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
409 _fixup_validation (tmp_tree, tmp_node);
410 tmp_node->offset -= height;
411 tmp_node->total_count -= total_count;
413 tmp_node = tmp_node->parent;
414 if (tmp_node == tmp_tree->nil)
416 tmp_node = tmp_tree->parent_node;
417 tmp_tree = tmp_tree->parent_tree;
421 tmp_tree = tree->parent_tree;
422 tmp_node = tree->parent_node;
423 _gtk_rbtree_free (tree);
425 #ifdef G_ENABLE_DEBUG
426 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
427 _gtk_rbtree_test (G_STRLOC, tmp_tree);
433 _gtk_rbtree_insert_after (GtkRBTree *tree,
439 gboolean right = TRUE;
443 #ifdef G_ENABLE_DEBUG
444 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
446 g_print ("\n\n_gtk_rbtree_insert_after: %p\n", current);
447 _gtk_rbtree_debug_spew (tree);
448 _gtk_rbtree_test (G_STRLOC, tree);
450 #endif /* G_ENABLE_DEBUG */
452 if (current != NULL && current->right != tree->nil)
454 current = current->right;
455 while (current->left != tree->nil)
456 current = current->left;
460 node = _gtk_rbnode_new (tree, height);
461 node->parent = (current?current:tree->nil);
463 /* insert node in tree */
467 current->right = node;
469 current->left = node;
470 tmp_node = node->parent;
476 tmp_node = tree->parent_node;
477 tmp_tree = tree->parent_tree;
480 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
482 /* We only want to propagate the count if we are in the tree we
484 if (tmp_tree == tree)
487 tmp_node->total_count += 1;
488 tmp_node->offset += height;
489 tmp_node = tmp_node->parent;
490 if (tmp_node == tmp_tree->nil)
492 tmp_node = tmp_tree->parent_node;
493 tmp_tree = tmp_tree->parent_tree;
498 _gtk_rbtree_node_mark_valid (tree, node);
500 _gtk_rbtree_node_mark_invalid (tree, node);
502 _gtk_rbtree_insert_fixup (tree, node);
504 #ifdef G_ENABLE_DEBUG
505 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
507 g_print ("_gtk_rbtree_insert_after finished...\n");
508 _gtk_rbtree_debug_spew (tree);
510 _gtk_rbtree_test (G_STRLOC, tree);
512 #endif /* G_ENABLE_DEBUG */
518 _gtk_rbtree_insert_before (GtkRBTree *tree,
524 gboolean left = TRUE;
528 #ifdef G_ENABLE_DEBUG
529 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
531 g_print ("\n\n_gtk_rbtree_insert_before: %p\n", current);
532 _gtk_rbtree_debug_spew (tree);
533 _gtk_rbtree_test (G_STRLOC, tree);
535 #endif /* G_ENABLE_DEBUG */
537 if (current != NULL && current->left != tree->nil)
539 current = current->left;
540 while (current->right != tree->nil)
541 current = current->right;
546 node = _gtk_rbnode_new (tree, height);
547 node->parent = (current?current:tree->nil);
549 /* insert node in tree */
553 current->left = node;
555 current->right = node;
556 tmp_node = node->parent;
562 tmp_node = tree->parent_node;
563 tmp_tree = tree->parent_tree;
566 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
568 /* We only want to propagate the count if we are in the tree we
570 if (tmp_tree == tree)
573 tmp_node->total_count += 1;
574 tmp_node->offset += height;
575 tmp_node = tmp_node->parent;
576 if (tmp_node == tmp_tree->nil)
578 tmp_node = tmp_tree->parent_node;
579 tmp_tree = tmp_tree->parent_tree;
584 _gtk_rbtree_node_mark_valid (tree, node);
586 _gtk_rbtree_node_mark_invalid (tree, node);
588 _gtk_rbtree_insert_fixup (tree, node);
590 #ifdef G_ENABLE_DEBUG
591 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
593 g_print ("_gtk_rbtree_insert_before finished...\n");
594 _gtk_rbtree_debug_spew (tree);
596 _gtk_rbtree_test (G_STRLOC, tree);
598 #endif /* G_ENABLE_DEBUG */
604 _gtk_rbtree_find_count (GtkRBTree *tree,
610 while (node != tree->nil && (node->left->count + 1 != count))
612 if (node->left->count >= count)
616 count -= (node->left->count + 1);
620 if (node == tree->nil)
626 _gtk_rbtree_node_set_height (GtkRBTree *tree,
630 gint diff = height - GTK_RBNODE_GET_HEIGHT (node);
631 GtkRBNode *tmp_node = node;
632 GtkRBTree *tmp_tree = tree;
637 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
639 tmp_node->offset += diff;
640 tmp_node = tmp_node->parent;
641 if (tmp_node == tmp_tree->nil)
643 tmp_node = tmp_tree->parent_node;
644 tmp_tree = tmp_tree->parent_tree;
647 #ifdef G_ENABLE_DEBUG
648 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
649 _gtk_rbtree_test (G_STRLOC, tree);
654 _gtk_rbtree_node_mark_invalid (GtkRBTree *tree,
657 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))
660 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
663 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))
665 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
667 if (node == tree->nil)
669 node = tree->parent_node;
670 tree = tree->parent_tree;
677 /* Draconian version. */
679 _gtk_rbtree_node_mark_invalid (GtkRBTree *tree,
682 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
685 _fixup_validation (tree, node);
687 if (node == tree->nil)
689 node = tree->parent_node;
690 tree = tree->parent_tree;
698 _gtk_rbtree_node_mark_valid (GtkRBTree *tree,
701 if ((!GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)) &&
702 (!GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID)))
705 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_INVALID);
706 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
710 if ((GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)) ||
711 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID)) ||
712 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)) ||
713 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
714 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)))
717 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
719 if (node == tree->nil)
721 node = tree->parent_node;
722 tree = tree->parent_tree;
729 /* Draconian version */
731 _gtk_rbtree_node_mark_valid (GtkRBTree *tree,
734 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_INVALID);
735 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
739 _fixup_validation (tree, node);
741 if (node == tree->nil)
743 node = tree->parent_node;
744 tree = tree->parent_tree;
750 /* Assume tree is the root node as it doesn't set DESCENDANTS_INVALID above.
753 _gtk_rbtree_column_invalid (GtkRBTree *tree)
762 while (node->left != tree->nil)
767 if (! (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)))
768 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
769 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
772 _gtk_rbtree_column_invalid (node->children);
774 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
778 _gtk_rbtree_mark_invalid (GtkRBTree *tree)
787 while (node->left != tree->nil)
792 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
793 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
796 _gtk_rbtree_mark_invalid (node->children);
798 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
802 _gtk_rbtree_set_fixed_height (GtkRBTree *tree,
814 while (node->left != tree->nil)
819 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))
821 _gtk_rbtree_node_set_height (tree, node, height);
823 _gtk_rbtree_node_mark_valid (tree, node);
827 _gtk_rbtree_set_fixed_height (node->children, height, mark_valid);
829 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
832 typedef struct _GtkRBReorder
843 gtk_rbtree_reorder_sort_func (gconstpointer a,
846 return ((GtkRBReorder *) a)->order - ((GtkRBReorder *) b)->order;
850 gtk_rbtree_reorder_invert_func (gconstpointer a,
853 return ((GtkRBReorder *) a)->invert_order - ((GtkRBReorder *) b)->invert_order;
857 gtk_rbtree_reorder_fixup (GtkRBTree *tree,
860 if (node == tree->nil)
863 node->total_count = 1;
865 if (node->left != tree->nil)
867 gtk_rbtree_reorder_fixup (tree, node->left);
868 node->offset += node->left->offset;
869 node->total_count += node->left->total_count;
871 if (node->right != tree->nil)
873 gtk_rbtree_reorder_fixup (tree, node->right);
874 node->offset += node->right->offset;
875 node->total_count += node->right->total_count;
880 node->offset += node->children->root->offset;
881 node->total_count += node->children->root->total_count;
884 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
885 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
886 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
887 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)))
888 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
890 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
893 /* It basically pulls everything out of the tree, rearranges it, and puts it
894 * back together. Our strategy is to keep the old RBTree intact, and just
895 * rearrange the contents. When that is done, we go through and update the
896 * heights. There is probably a more elegant way to write this function. If
897 * anyone wants to spend the time writing it, patches will be accepted.
900 _gtk_rbtree_reorder (GtkRBTree *tree,
904 GtkRBReorder reorder = { NULL };
909 g_return_if_fail (tree != NULL);
910 g_return_if_fail (length > 0);
911 g_return_if_fail (tree->root->count == length);
913 /* Sort the trees values in the new tree. */
914 array = g_array_sized_new (FALSE, FALSE, sizeof (GtkRBReorder), length);
915 for (i = 0; i < length; i++)
917 reorder.order = new_order[i];
918 reorder.invert_order = i;
919 g_array_append_val (array, reorder);
922 g_array_sort(array, gtk_rbtree_reorder_sort_func);
926 while (node && node->left != tree->nil)
929 for (i = 0; i < length; i++)
931 g_assert (node != tree->nil);
932 g_array_index (array, GtkRBReorder, i).children = node->children;
933 g_array_index (array, GtkRBReorder, i).flags = GTK_RBNODE_NON_COLORS & node->flags;
934 g_array_index (array, GtkRBReorder, i).height = GTK_RBNODE_GET_HEIGHT (node);
936 node = _gtk_rbtree_next (tree, node);
939 g_array_sort (array, gtk_rbtree_reorder_invert_func);
943 while (node && node->left != tree->nil)
946 /* Go through the tree and change the values to the new ones. */
947 for (i = 0; i < length; i++)
949 reorder = g_array_index (array, GtkRBReorder, i);
950 node->children = reorder.children;
952 node->children->parent_node = node;
953 node->flags = GTK_RBNODE_GET_COLOR (node) | reorder.flags;
954 /* We temporarily set the height to this. */
955 node->offset = reorder.height;
956 node = _gtk_rbtree_next (tree, node);
958 gtk_rbtree_reorder_fixup (tree, tree->root);
960 g_array_free (array, TRUE);
965 _gtk_rbtree_node_find_offset (GtkRBTree *tree,
972 g_assert (node->left);
974 retval = node->left->offset;
976 while (tree && node && node != tree->nil)
981 /* Add left branch, plus children, iff we came from the right */
982 if (node->right == last)
983 retval += node->offset - node->right->offset;
985 if (node == tree->nil)
987 node = tree->parent_node;
988 tree = tree->parent_tree;
990 /* Add the parent node, plus the left branch. */
992 retval += node->left->offset + GTK_RBNODE_GET_HEIGHT (node);
999 _gtk_rbtree_node_get_index (GtkRBTree *tree,
1006 g_assert (node->left);
1008 retval = node->left->total_count;
1010 while (tree && node && node != tree->nil)
1013 node = node->parent;
1015 /* Add left branch, plus children, iff we came from the right */
1016 if (node->right == last)
1017 retval += node->total_count - node->right->total_count;
1019 if (node == tree->nil)
1021 node = tree->parent_node;
1022 tree = tree->parent_tree;
1024 /* Add the parent node, plus the left branch. */
1026 retval += node->left->total_count + 1; /* 1 == GTK_RBNODE_GET_PARITY() */
1034 _gtk_rbtree_real_find_offset (GtkRBTree *tree,
1036 GtkRBTree **new_tree,
1037 GtkRBNode **new_node)
1039 GtkRBNode *tmp_node;
1052 tmp_node = tree->root;
1053 while (tmp_node != tree->nil &&
1054 (tmp_node->left->offset > height ||
1055 (tmp_node->offset - tmp_node->right->offset) < height))
1057 if (tmp_node->left->offset > height)
1058 tmp_node = tmp_node->left;
1061 height -= (tmp_node->offset - tmp_node->right->offset);
1062 tmp_node = tmp_node->right;
1065 if (tmp_node == tree->nil)
1071 if (tmp_node->children)
1073 if ((tmp_node->offset -
1074 tmp_node->right->offset -
1075 tmp_node->children->root->offset) > height)
1078 *new_node = tmp_node;
1079 return (height - tmp_node->left->offset);
1081 return _gtk_rbtree_real_find_offset (tmp_node->children,
1082 height - tmp_node->left->offset -
1084 tmp_node->left->offset -
1085 tmp_node->right->offset -
1086 tmp_node->children->root->offset),
1091 *new_node = tmp_node;
1092 return (height - tmp_node->left->offset);
1096 _gtk_rbtree_find_offset (GtkRBTree *tree,
1098 GtkRBTree **new_tree,
1099 GtkRBNode **new_node)
1104 (height >= tree->root->offset))
1111 return _gtk_rbtree_real_find_offset (tree, height, new_tree, new_node);
1115 _gtk_rbtree_find_index (GtkRBTree *tree,
1117 GtkRBTree **new_tree,
1118 GtkRBNode **new_node)
1120 GtkRBNode *tmp_node;
1124 tmp_node = tree->root;
1125 while (tmp_node != tree->nil)
1127 if (tmp_node->left->total_count > index)
1129 tmp_node = tmp_node->left;
1131 else if (tmp_node->total_count - tmp_node->right->total_count <= index)
1133 index -= tmp_node->total_count - tmp_node->right->total_count;
1134 tmp_node = tmp_node->right;
1138 index -= tmp_node->left->total_count;
1142 if (tmp_node == tree->nil)
1151 g_assert (tmp_node->children);
1153 return _gtk_rbtree_find_index (tmp_node->children,
1160 *new_node = tmp_node;
1165 _gtk_rbtree_remove_node (GtkRBTree *tree,
1169 GtkRBTree *tmp_tree;
1170 GtkRBNode *tmp_node;
1173 g_return_if_fail (tree != NULL);
1174 g_return_if_fail (node != NULL);
1177 #ifdef G_ENABLE_DEBUG
1178 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
1180 g_print ("\n\n_gtk_rbtree_remove_node: %p\n", node);
1181 _gtk_rbtree_debug_spew (tree);
1182 _gtk_rbtree_test (G_STRLOC, tree);
1184 #endif /* G_ENABLE_DEBUG */
1186 /* make sure we're deleting a node that's actually in the tree */
1187 for (x = node; x->parent != tree->nil; x = x->parent)
1189 g_return_if_fail (x == tree->root);
1191 #ifdef G_ENABLE_DEBUG
1192 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
1193 _gtk_rbtree_test (G_STRLOC, tree);
1196 if (node->left == tree->nil || node->right == tree->nil)
1204 while (y->left != tree->nil)
1208 /* adjust count only beneath tree */
1209 for (x = y; x != tree->nil; x = x->parent)
1214 /* offsets and total count adjust all the way up through parent trees */
1215 y_height = GTK_RBNODE_GET_HEIGHT (y);
1219 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
1221 tmp_node->offset -= (y_height + (y->children?y->children->root->offset:0));
1222 _fixup_validation (tmp_tree, tmp_node);
1223 _fixup_total_count (tmp_tree, tmp_node);
1224 tmp_node = tmp_node->parent;
1225 if (tmp_node == tmp_tree->nil)
1227 tmp_node = tmp_tree->parent_node;
1228 tmp_tree = tmp_tree->parent_tree;
1232 /* x is y's only child, or nil */
1233 if (y->left != tree->nil)
1238 /* remove y from the parent chain */
1239 x->parent = y->parent;
1240 if (y->parent != tree->nil)
1242 if (y == y->parent->left)
1243 y->parent->left = x;
1245 y->parent->right = x;
1252 /* We need to clean up the validity of the tree.
1259 /* We skip the first time, iff x is nil */
1260 if (tmp_node != tmp_tree->nil)
1262 _fixup_validation (tmp_tree, tmp_node);
1263 _fixup_total_count (tmp_tree, tmp_node);
1265 tmp_node = tmp_node->parent;
1266 if (tmp_node == tmp_tree->nil)
1268 tmp_node = tmp_tree->parent_node;
1269 tmp_tree = tmp_tree->parent_tree;
1272 while (tmp_tree != NULL);
1278 /* Copy the node over */
1279 if (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)
1280 node->flags = ((y->flags & (GTK_RBNODE_NON_COLORS)) | GTK_RBNODE_BLACK);
1282 node->flags = ((y->flags & (GTK_RBNODE_NON_COLORS)) | GTK_RBNODE_RED);
1283 node->children = y->children;
1286 node->children = y->children;
1287 node->children->parent_node = node;
1291 node->children = NULL;
1293 _fixup_validation (tree, node);
1294 _fixup_total_count (tree, node);
1295 /* We want to see how different our height is from the previous node.
1296 * To do this, we compare our current height with our supposed height.
1298 diff = y_height - GTK_RBNODE_GET_HEIGHT (node);
1302 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
1304 tmp_node->offset += diff;
1305 _fixup_validation (tmp_tree, tmp_node);
1306 _fixup_total_count (tmp_tree, tmp_node);
1307 tmp_node = tmp_node->parent;
1308 if (tmp_node == tmp_tree->nil)
1310 tmp_node = tmp_tree->parent_node;
1311 tmp_tree = tmp_tree->parent_tree;
1316 if (GTK_RBNODE_GET_COLOR (y) == GTK_RBNODE_BLACK)
1317 _gtk_rbtree_remove_node_fixup (tree, x);
1318 _gtk_rbnode_free (y);
1320 #ifdef G_ENABLE_DEBUG
1321 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
1323 g_print ("_gtk_rbtree_remove_node finished...\n");
1324 _gtk_rbtree_debug_spew (tree);
1326 _gtk_rbtree_test (G_STRLOC, tree);
1328 #endif /* G_ENABLE_DEBUG */
1332 _gtk_rbtree_next (GtkRBTree *tree,
1335 g_return_val_if_fail (tree != NULL, NULL);
1336 g_return_val_if_fail (node != NULL, NULL);
1338 /* Case 1: the node's below us. */
1339 if (node->right != tree->nil)
1342 while (node->left != tree->nil)
1347 /* Case 2: it's an ancestor */
1348 while (node->parent != tree->nil)
1350 if (node->parent->right == node)
1351 node = node->parent;
1353 return (node->parent);
1356 /* Case 3: There is no next node */
1361 _gtk_rbtree_prev (GtkRBTree *tree,
1364 g_return_val_if_fail (tree != NULL, NULL);
1365 g_return_val_if_fail (node != NULL, NULL);
1367 /* Case 1: the node's below us. */
1368 if (node->left != tree->nil)
1371 while (node->right != tree->nil)
1376 /* Case 2: it's an ancestor */
1377 while (node->parent != tree->nil)
1379 if (node->parent->left == node)
1380 node = node->parent;
1382 return (node->parent);
1385 /* Case 3: There is no next node */
1390 _gtk_rbtree_next_full (GtkRBTree *tree,
1392 GtkRBTree **new_tree,
1393 GtkRBNode **new_node)
1395 g_return_if_fail (tree != NULL);
1396 g_return_if_fail (node != NULL);
1397 g_return_if_fail (new_tree != NULL);
1398 g_return_if_fail (new_node != NULL);
1402 *new_tree = node->children;
1403 *new_node = (*new_tree)->root;
1404 while ((*new_node)->left != (*new_tree)->nil)
1405 *new_node = (*new_node)->left;
1410 *new_node = _gtk_rbtree_next (tree, node);
1412 while ((*new_node == NULL) &&
1413 (*new_tree != NULL))
1415 *new_node = (*new_tree)->parent_node;
1416 *new_tree = (*new_tree)->parent_tree;
1418 *new_node = _gtk_rbtree_next (*new_tree, *new_node);
1423 _gtk_rbtree_prev_full (GtkRBTree *tree,
1425 GtkRBTree **new_tree,
1426 GtkRBNode **new_node)
1428 g_return_if_fail (tree != NULL);
1429 g_return_if_fail (node != NULL);
1430 g_return_if_fail (new_tree != NULL);
1431 g_return_if_fail (new_node != NULL);
1434 *new_node = _gtk_rbtree_prev (tree, node);
1436 if (*new_node == NULL)
1438 *new_node = (*new_tree)->parent_node;
1439 *new_tree = (*new_tree)->parent_tree;
1443 while ((*new_node)->children)
1445 *new_tree = (*new_node)->children;
1446 *new_node = (*new_tree)->root;
1447 while ((*new_node)->right != (*new_tree)->nil)
1448 *new_node = (*new_node)->right;
1454 _gtk_rbtree_get_depth (GtkRBTree *tree)
1456 GtkRBTree *tmp_tree;
1459 tmp_tree = tree->parent_tree;
1463 tmp_tree = tmp_tree->parent_tree;
1470 _gtk_rbtree_traverse_pre_order (GtkRBTree *tree,
1472 GtkRBTreeTraverseFunc func,
1475 if (node == tree->nil)
1478 (* func) (tree, node, data);
1479 _gtk_rbtree_traverse_pre_order (tree, node->left, func, data);
1480 _gtk_rbtree_traverse_pre_order (tree, node->right, func, data);
1484 _gtk_rbtree_traverse_post_order (GtkRBTree *tree,
1486 GtkRBTreeTraverseFunc func,
1489 if (node == tree->nil)
1492 _gtk_rbtree_traverse_post_order (tree, node->left, func, data);
1493 _gtk_rbtree_traverse_post_order (tree, node->right, func, data);
1494 (* func) (tree, node, data);
1498 _gtk_rbtree_traverse (GtkRBTree *tree,
1500 GTraverseType order,
1501 GtkRBTreeTraverseFunc func,
1504 g_return_if_fail (tree != NULL);
1505 g_return_if_fail (node != NULL);
1506 g_return_if_fail (func != NULL);
1507 g_return_if_fail (order <= G_LEVEL_ORDER);
1512 _gtk_rbtree_traverse_pre_order (tree, node, func, data);
1515 _gtk_rbtree_traverse_post_order (tree, node, func, data);
1520 g_warning ("unsupported traversal order.");
1526 void _fixup_validation (GtkRBTree *tree,
1529 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
1530 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
1531 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1532 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1533 (node->children != NULL && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)))
1535 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
1539 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
1544 void _fixup_total_count (GtkRBTree *tree,
1547 node->total_count = 1 +
1548 (node->children != NULL ? node->children->root->total_count : 0) +
1549 node->left->total_count + node->right->total_count;
1552 #ifdef G_ENABLE_DEBUG
1554 get_total_count (GtkRBNode *node)
1556 guint child_total = 0;
1558 child_total += (guint) node->left->total_count;
1559 child_total += (guint) node->right->total_count;
1562 child_total += (guint) node->children->root->total_count;
1564 return child_total + 1;
1568 count_total (GtkRBTree *tree,
1573 if (node == tree->nil)
1577 count_total (tree, node->left) +
1578 count_total (tree, node->right) +
1580 (node->children ? count_total (node->children, node->children->root) : 0);
1582 if (res != node->total_count)
1583 g_print ("total count incorrect for node\n");
1585 if (get_total_count (node) != node->total_count)
1586 g_error ("Node has incorrect total count %u, should be %u", node->total_count, get_total_count (node));
1592 _count_nodes (GtkRBTree *tree,
1596 if (node == tree->nil)
1599 g_assert (node->left);
1600 g_assert (node->right);
1602 res = (_count_nodes (tree, node->left) +
1603 _count_nodes (tree, node->right) + 1);
1605 if (res != node->count)
1606 g_print ("Tree failed\n");
1611 _gtk_rbtree_test_height (GtkRBTree *tree,
1614 gint computed_offset = 0;
1616 /* This whole test is sort of a useless truism. */
1618 if (node->left != tree->nil)
1619 computed_offset += node->left->offset;
1621 if (node->right != tree->nil)
1622 computed_offset += node->right->offset;
1624 if (node->children && node->children->root != node->children->nil)
1625 computed_offset += node->children->root->offset;
1627 if (GTK_RBNODE_GET_HEIGHT (node) + computed_offset != node->offset)
1628 g_error ("node has broken offset\n");
1630 if (node->left != tree->nil)
1631 _gtk_rbtree_test_height (tree, node->left);
1633 if (node->right != tree->nil)
1634 _gtk_rbtree_test_height (tree, node->right);
1636 if (node->children && node->children->root != node->children->nil)
1637 _gtk_rbtree_test_height (node->children, node->children->root);
1641 _gtk_rbtree_test_dirty (GtkRBTree *tree,
1643 gint expected_dirtyness)
1646 if (expected_dirtyness)
1648 g_assert (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
1649 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
1650 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1651 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1652 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)));
1656 g_assert (! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) &&
1657 ! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID));
1658 if (node->left != tree->nil)
1659 g_assert (! GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
1660 if (node->right != tree->nil)
1661 g_assert (! GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
1662 if (node->children != NULL)
1663 g_assert (! GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
1666 if (node->left != tree->nil)
1667 _gtk_rbtree_test_dirty (tree, node->left, GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
1668 if (node->right != tree->nil)
1669 _gtk_rbtree_test_dirty (tree, node->right, GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
1670 if (node->children != NULL && node->children->root != node->children->nil)
1671 _gtk_rbtree_test_dirty (node->children, node->children->root, GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
1674 static void _gtk_rbtree_test_structure (GtkRBTree *tree);
1677 _gtk_rbtree_test_structure_helper (GtkRBTree *tree,
1680 g_assert (node != tree->nil);
1682 g_assert (node->left != NULL);
1683 g_assert (node->right != NULL);
1684 g_assert (node->parent != NULL);
1686 if (node->left != tree->nil)
1688 g_assert (node->left->parent == node);
1689 _gtk_rbtree_test_structure_helper (tree, node->left);
1691 if (node->right != tree->nil)
1693 g_assert (node->right->parent == node);
1694 _gtk_rbtree_test_structure_helper (tree, node->right);
1697 if (node->children != NULL)
1699 g_assert (node->children->parent_tree == tree);
1700 g_assert (node->children->parent_node == node);
1702 _gtk_rbtree_test_structure (node->children);
1706 _gtk_rbtree_test_structure (GtkRBTree *tree)
1708 g_assert (tree->root);
1709 if (tree->root == tree->nil)
1712 g_assert (tree->root->parent == tree->nil);
1713 _gtk_rbtree_test_structure_helper (tree, tree->root);
1717 _gtk_rbtree_test (const gchar *where,
1720 GtkRBTree *tmp_tree;
1725 /* Test the entire tree */
1727 while (tmp_tree->parent_tree)
1728 tmp_tree = tmp_tree->parent_tree;
1730 g_assert (tmp_tree->nil != NULL);
1732 if (tmp_tree->root == tmp_tree->nil)
1735 _gtk_rbtree_test_structure (tmp_tree);
1737 g_assert ((_count_nodes (tmp_tree, tmp_tree->root->left) +
1738 _count_nodes (tmp_tree, tmp_tree->root->right) + 1) == tmp_tree->root->count);
1741 _gtk_rbtree_test_height (tmp_tree, tmp_tree->root);
1742 _gtk_rbtree_test_dirty (tmp_tree, tmp_tree->root, GTK_RBNODE_FLAG_SET (tmp_tree->root, GTK_RBNODE_DESCENDANTS_INVALID));
1743 g_assert (count_total (tmp_tree, tmp_tree->root) == tmp_tree->root->total_count);
1747 _gtk_rbtree_debug_spew_helper (GtkRBTree *tree,
1752 for (i = 0; i < depth; i++)
1755 g_print ("(%p - %s) (Offset %d) (Parity %d) (Validity %d%d%d)\n",
1757 (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)?"BLACK":" RED ",
1760 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))?1:0,
1761 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))?1:0,
1762 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID))?1:0);
1763 if (node->children != NULL)
1765 g_print ("Looking at child.\n");
1766 _gtk_rbtree_debug_spew (node->children);
1767 g_print ("Done looking at child.\n");
1769 if (node->left != tree->nil)
1771 _gtk_rbtree_debug_spew_helper (tree, node->left, depth+1);
1773 if (node->right != tree->nil)
1775 _gtk_rbtree_debug_spew_helper (tree, node->right, depth+1);
1780 _gtk_rbtree_debug_spew (GtkRBTree *tree)
1782 g_return_if_fail (tree != NULL);
1784 if (tree->root == tree->nil)
1785 g_print ("Empty tree...\n");
1787 _gtk_rbtree_debug_spew_helper (tree, tree->root, 0);
1789 #endif /* G_ENABLE_DEBUG */