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 GtkRBNode *parent = node->parent;
271 while (node != tree->root && GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)
273 if (node == parent->left)
275 GtkRBNode *w = parent->right;
276 if (GTK_RBNODE_GET_COLOR (w) == GTK_RBNODE_RED)
278 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_BLACK);
279 GTK_RBNODE_SET_COLOR (parent, GTK_RBNODE_RED);
280 _gtk_rbnode_rotate_left (tree, parent);
283 if (GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK && GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK)
285 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
290 if (GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK)
292 GTK_RBNODE_SET_COLOR (w->left, GTK_RBNODE_BLACK);
293 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
294 _gtk_rbnode_rotate_right (tree, w);
297 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_GET_COLOR (parent));
298 GTK_RBNODE_SET_COLOR (parent, GTK_RBNODE_BLACK);
299 GTK_RBNODE_SET_COLOR (w->right, GTK_RBNODE_BLACK);
300 _gtk_rbnode_rotate_left (tree, parent);
306 GtkRBNode *w = parent->left;
307 if (GTK_RBNODE_GET_COLOR (w) == GTK_RBNODE_RED)
309 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_BLACK);
310 GTK_RBNODE_SET_COLOR (parent, GTK_RBNODE_RED);
311 _gtk_rbnode_rotate_right (tree, parent);
314 if (GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK && GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK)
316 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
321 if (GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK)
323 GTK_RBNODE_SET_COLOR (w->right, GTK_RBNODE_BLACK);
324 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
325 _gtk_rbnode_rotate_left (tree, w);
328 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_GET_COLOR (parent));
329 GTK_RBNODE_SET_COLOR (parent, GTK_RBNODE_BLACK);
330 GTK_RBNODE_SET_COLOR (w->left, GTK_RBNODE_BLACK);
331 _gtk_rbnode_rotate_right (tree, parent);
336 parent = node->parent;
338 GTK_RBNODE_SET_COLOR (node, GTK_RBNODE_BLACK);
342 _gtk_rbtree_new (void)
346 retval = g_new (GtkRBTree, 1);
347 retval->parent_tree = NULL;
348 retval->parent_node = NULL;
350 retval->nil = g_slice_new (GtkRBNode);
351 retval->nil->left = NULL;
352 retval->nil->right = NULL;
353 retval->nil->parent = NULL;
354 retval->nil->flags = GTK_RBNODE_BLACK;
355 retval->nil->count = 0;
356 retval->nil->offset = 0;
357 retval->nil->total_count = 0;
359 retval->root = retval->nil;
364 _gtk_rbtree_free_helper (GtkRBTree *tree,
369 _gtk_rbtree_free (node->children);
371 _gtk_rbnode_free (node);
375 _gtk_rbtree_free (GtkRBTree *tree)
377 _gtk_rbtree_traverse (tree,
380 _gtk_rbtree_free_helper,
383 if (tree->parent_node &&
384 tree->parent_node->children == tree)
385 tree->parent_node->children = NULL;
386 _gtk_rbnode_free (tree->nil);
391 gtk_rbnode_adjust (GtkRBTree *tree,
394 int total_count_diff,
397 while (tree && node && node != tree->nil)
399 _fixup_validation (tree, node);
400 node->offset += offset_diff;
401 node->count += count_diff;
402 node->total_count += total_count_diff;
405 if (node == tree->nil)
407 node = tree->parent_node;
408 tree = tree->parent_tree;
415 _gtk_rbtree_remove (GtkRBTree *tree)
417 #ifdef G_ENABLE_DEBUG
420 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
421 _gtk_rbtree_test (G_STRLOC, tree);
424 /* ugly hack to make _fixup_validation work in the first iteration of the
426 GTK_RBNODE_UNSET_FLAG (tree->root, GTK_RBNODE_DESCENDANTS_INVALID);
428 gtk_rbnode_adjust (tree->parent_tree,
431 - (int) tree->root->total_count,
432 - tree->root->offset);
434 #ifdef G_ENABLE_DEBUG
435 tmp_tree = tree->parent_tree;
438 _gtk_rbtree_free (tree);
440 #ifdef G_ENABLE_DEBUG
441 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
442 _gtk_rbtree_test (G_STRLOC, tmp_tree);
448 _gtk_rbtree_insert_after (GtkRBTree *tree,
454 gboolean right = TRUE;
456 #ifdef G_ENABLE_DEBUG
457 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
459 g_print ("\n\n_gtk_rbtree_insert_after: %p\n", current);
460 _gtk_rbtree_debug_spew (tree);
461 _gtk_rbtree_test (G_STRLOC, tree);
463 #endif /* G_ENABLE_DEBUG */
465 if (current != NULL && current->right != tree->nil)
467 current = current->right;
468 while (current->left != tree->nil)
469 current = current->left;
473 node = _gtk_rbnode_new (tree, height);
474 node->parent = (current?current:tree->nil);
476 /* insert node in tree */
480 current->right = node;
482 current->left = node;
483 gtk_rbnode_adjust (tree, node->parent,
488 g_assert (tree->root == tree->nil);
490 gtk_rbnode_adjust (tree->parent_tree, tree->parent_node,
495 _gtk_rbtree_node_mark_valid (tree, node);
497 _gtk_rbtree_node_mark_invalid (tree, node);
499 _gtk_rbtree_insert_fixup (tree, node);
501 #ifdef G_ENABLE_DEBUG
502 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
504 g_print ("_gtk_rbtree_insert_after finished...\n");
505 _gtk_rbtree_debug_spew (tree);
507 _gtk_rbtree_test (G_STRLOC, tree);
509 #endif /* G_ENABLE_DEBUG */
515 _gtk_rbtree_insert_before (GtkRBTree *tree,
521 gboolean left = TRUE;
523 #ifdef G_ENABLE_DEBUG
524 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
526 g_print ("\n\n_gtk_rbtree_insert_before: %p\n", current);
527 _gtk_rbtree_debug_spew (tree);
528 _gtk_rbtree_test (G_STRLOC, tree);
530 #endif /* G_ENABLE_DEBUG */
532 if (current != NULL && current->left != tree->nil)
534 current = current->left;
535 while (current->right != tree->nil)
536 current = current->right;
541 node = _gtk_rbnode_new (tree, height);
542 node->parent = (current?current:tree->nil);
544 /* insert node in tree */
548 current->left = node;
550 current->right = node;
551 gtk_rbnode_adjust (tree, node->parent,
556 g_assert (tree->root == tree->nil);
558 gtk_rbnode_adjust (tree->parent_tree, tree->parent_node,
563 _gtk_rbtree_node_mark_valid (tree, node);
565 _gtk_rbtree_node_mark_invalid (tree, node);
567 _gtk_rbtree_insert_fixup (tree, node);
569 #ifdef G_ENABLE_DEBUG
570 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
572 g_print ("_gtk_rbtree_insert_before finished...\n");
573 _gtk_rbtree_debug_spew (tree);
575 _gtk_rbtree_test (G_STRLOC, tree);
577 #endif /* G_ENABLE_DEBUG */
583 _gtk_rbtree_find_count (GtkRBTree *tree,
589 while (node != tree->nil && (node->left->count + 1 != count))
591 if (node->left->count >= count)
595 count -= (node->left->count + 1);
599 if (node == tree->nil)
605 _gtk_rbtree_node_set_height (GtkRBTree *tree,
609 gint diff = height - GTK_RBNODE_GET_HEIGHT (node);
614 gtk_rbnode_adjust (tree, node, 0, 0, diff);
616 #ifdef G_ENABLE_DEBUG
617 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
618 _gtk_rbtree_test (G_STRLOC, tree);
623 _gtk_rbtree_node_mark_invalid (GtkRBTree *tree,
626 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))
629 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
632 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))
634 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
636 if (node == tree->nil)
638 node = tree->parent_node;
639 tree = tree->parent_tree;
646 /* Draconian version. */
648 _gtk_rbtree_node_mark_invalid (GtkRBTree *tree,
651 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
654 _fixup_validation (tree, node);
656 if (node == tree->nil)
658 node = tree->parent_node;
659 tree = tree->parent_tree;
667 _gtk_rbtree_node_mark_valid (GtkRBTree *tree,
670 if ((!GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)) &&
671 (!GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID)))
674 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_INVALID);
675 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
679 if ((GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)) ||
680 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID)) ||
681 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)) ||
682 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
683 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)))
686 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
688 if (node == tree->nil)
690 node = tree->parent_node;
691 tree = tree->parent_tree;
698 /* Draconian version */
700 _gtk_rbtree_node_mark_valid (GtkRBTree *tree,
703 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_INVALID);
704 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
708 _fixup_validation (tree, node);
710 if (node == tree->nil)
712 node = tree->parent_node;
713 tree = tree->parent_tree;
719 /* Assume tree is the root node as it doesn't set DESCENDANTS_INVALID above.
722 _gtk_rbtree_column_invalid (GtkRBTree *tree)
731 while (node->left != tree->nil)
736 if (! (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)))
737 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
738 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
741 _gtk_rbtree_column_invalid (node->children);
743 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
747 _gtk_rbtree_mark_invalid (GtkRBTree *tree)
756 while (node->left != tree->nil)
761 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
762 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
765 _gtk_rbtree_mark_invalid (node->children);
767 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
771 _gtk_rbtree_set_fixed_height (GtkRBTree *tree,
783 while (node->left != tree->nil)
788 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))
790 _gtk_rbtree_node_set_height (tree, node, height);
792 _gtk_rbtree_node_mark_valid (tree, node);
796 _gtk_rbtree_set_fixed_height (node->children, height, mark_valid);
798 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
801 typedef struct _GtkRBReorder
812 gtk_rbtree_reorder_sort_func (gconstpointer a,
815 return ((GtkRBReorder *) a)->order - ((GtkRBReorder *) b)->order;
819 gtk_rbtree_reorder_invert_func (gconstpointer a,
822 return ((GtkRBReorder *) a)->invert_order - ((GtkRBReorder *) b)->invert_order;
826 gtk_rbtree_reorder_fixup (GtkRBTree *tree,
829 if (node == tree->nil)
832 node->total_count = 1;
834 if (node->left != tree->nil)
836 gtk_rbtree_reorder_fixup (tree, node->left);
837 node->offset += node->left->offset;
838 node->total_count += node->left->total_count;
840 if (node->right != tree->nil)
842 gtk_rbtree_reorder_fixup (tree, node->right);
843 node->offset += node->right->offset;
844 node->total_count += node->right->total_count;
849 node->offset += node->children->root->offset;
850 node->total_count += node->children->root->total_count;
853 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
854 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
855 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
856 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)))
857 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
859 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
862 /* It basically pulls everything out of the tree, rearranges it, and puts it
863 * back together. Our strategy is to keep the old RBTree intact, and just
864 * rearrange the contents. When that is done, we go through and update the
865 * heights. There is probably a more elegant way to write this function. If
866 * anyone wants to spend the time writing it, patches will be accepted.
869 _gtk_rbtree_reorder (GtkRBTree *tree,
873 GtkRBReorder reorder = { NULL };
878 g_return_if_fail (tree != NULL);
879 g_return_if_fail (length > 0);
880 g_return_if_fail (tree->root->count == length);
882 /* Sort the trees values in the new tree. */
883 array = g_array_sized_new (FALSE, FALSE, sizeof (GtkRBReorder), length);
884 for (i = 0; i < length; i++)
886 reorder.order = new_order[i];
887 reorder.invert_order = i;
888 g_array_append_val (array, reorder);
891 g_array_sort(array, gtk_rbtree_reorder_sort_func);
895 while (node && node->left != tree->nil)
898 for (i = 0; i < length; i++)
900 g_assert (node != tree->nil);
901 g_array_index (array, GtkRBReorder, i).children = node->children;
902 g_array_index (array, GtkRBReorder, i).flags = GTK_RBNODE_NON_COLORS & node->flags;
903 g_array_index (array, GtkRBReorder, i).height = GTK_RBNODE_GET_HEIGHT (node);
905 node = _gtk_rbtree_next (tree, node);
908 g_array_sort (array, gtk_rbtree_reorder_invert_func);
912 while (node && node->left != tree->nil)
915 /* Go through the tree and change the values to the new ones. */
916 for (i = 0; i < length; i++)
918 reorder = g_array_index (array, GtkRBReorder, i);
919 node->children = reorder.children;
921 node->children->parent_node = node;
922 node->flags = GTK_RBNODE_GET_COLOR (node) | reorder.flags;
923 /* We temporarily set the height to this. */
924 node->offset = reorder.height;
925 node = _gtk_rbtree_next (tree, node);
927 gtk_rbtree_reorder_fixup (tree, tree->root);
929 g_array_free (array, TRUE);
934 _gtk_rbtree_node_find_offset (GtkRBTree *tree,
941 g_assert (node->left);
943 retval = node->left->offset;
945 while (tree && node && node != tree->nil)
950 /* Add left branch, plus children, iff we came from the right */
951 if (node->right == last)
952 retval += node->offset - node->right->offset;
954 if (node == tree->nil)
956 node = tree->parent_node;
957 tree = tree->parent_tree;
959 /* Add the parent node, plus the left branch. */
961 retval += node->left->offset + GTK_RBNODE_GET_HEIGHT (node);
968 _gtk_rbtree_node_get_index (GtkRBTree *tree,
975 g_assert (node->left);
977 retval = node->left->total_count;
979 while (tree && node && node != tree->nil)
984 /* Add left branch, plus children, iff we came from the right */
985 if (node->right == last)
986 retval += node->total_count - node->right->total_count;
988 if (node == tree->nil)
990 node = tree->parent_node;
991 tree = tree->parent_tree;
993 /* Add the parent node, plus the left branch. */
995 retval += node->left->total_count + 1; /* 1 == GTK_RBNODE_GET_PARITY() */
1003 _gtk_rbtree_real_find_offset (GtkRBTree *tree,
1005 GtkRBTree **new_tree,
1006 GtkRBNode **new_node)
1008 GtkRBNode *tmp_node;
1021 tmp_node = tree->root;
1022 while (tmp_node != tree->nil &&
1023 (tmp_node->left->offset > height ||
1024 (tmp_node->offset - tmp_node->right->offset) < height))
1026 if (tmp_node->left->offset > height)
1027 tmp_node = tmp_node->left;
1030 height -= (tmp_node->offset - tmp_node->right->offset);
1031 tmp_node = tmp_node->right;
1034 if (tmp_node == tree->nil)
1040 if (tmp_node->children)
1042 if ((tmp_node->offset -
1043 tmp_node->right->offset -
1044 tmp_node->children->root->offset) > height)
1047 *new_node = tmp_node;
1048 return (height - tmp_node->left->offset);
1050 return _gtk_rbtree_real_find_offset (tmp_node->children,
1051 height - tmp_node->left->offset -
1053 tmp_node->left->offset -
1054 tmp_node->right->offset -
1055 tmp_node->children->root->offset),
1060 *new_node = tmp_node;
1061 return (height - tmp_node->left->offset);
1065 _gtk_rbtree_find_offset (GtkRBTree *tree,
1067 GtkRBTree **new_tree,
1068 GtkRBNode **new_node)
1073 (height >= tree->root->offset))
1080 return _gtk_rbtree_real_find_offset (tree, height, new_tree, new_node);
1084 _gtk_rbtree_find_index (GtkRBTree *tree,
1086 GtkRBTree **new_tree,
1087 GtkRBNode **new_node)
1089 GtkRBNode *tmp_node;
1093 tmp_node = tree->root;
1094 while (tmp_node != tree->nil)
1096 if (tmp_node->left->total_count > index)
1098 tmp_node = tmp_node->left;
1100 else if (tmp_node->total_count - tmp_node->right->total_count <= index)
1102 index -= tmp_node->total_count - tmp_node->right->total_count;
1103 tmp_node = tmp_node->right;
1107 index -= tmp_node->left->total_count;
1111 if (tmp_node == tree->nil)
1120 g_assert (tmp_node->children);
1122 return _gtk_rbtree_find_index (tmp_node->children,
1129 *new_node = tmp_node;
1134 _gtk_rbtree_remove_node (GtkRBTree *tree,
1139 guint y_total_count;
1141 g_return_if_fail (tree != NULL);
1142 g_return_if_fail (node != NULL);
1145 #ifdef G_ENABLE_DEBUG
1146 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
1148 g_print ("\n\n_gtk_rbtree_remove_node: %p\n", node);
1149 _gtk_rbtree_debug_spew (tree);
1150 _gtk_rbtree_test (G_STRLOC, tree);
1152 #endif /* G_ENABLE_DEBUG */
1154 /* make sure we're deleting a node that's actually in the tree */
1155 for (x = node; x->parent != tree->nil; x = x->parent)
1157 g_return_if_fail (x == tree->root);
1159 #ifdef G_ENABLE_DEBUG
1160 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
1161 _gtk_rbtree_test (G_STRLOC, tree);
1164 if (node->left == tree->nil || node->right == tree->nil)
1172 while (y->left != tree->nil)
1176 y_height = GTK_RBNODE_GET_HEIGHT (y)
1177 + (y->children ? y->children->root->offset : 0);
1178 y_total_count = 1 + (y->children ? y->children->root->total_count : 0);
1180 /* x is y's only child, or nil */
1181 if (y->left != tree->nil)
1186 /* remove y from the parent chain */
1187 x->parent = y->parent;
1188 if (y->parent != tree->nil)
1190 if (y == y->parent->left)
1191 y->parent->left = x;
1193 y->parent->right = x;
1200 /* We need to clean up the validity of the tree.
1202 gtk_rbnode_adjust (tree, y, -1, - y_total_count, - y_height);
1206 gint node_height, node_total_count;
1208 /* We want to see how much we remove from the aggregate values.
1209 * This is all the children we remove plus the node's values.
1211 node_height = GTK_RBNODE_GET_HEIGHT (node)
1212 + (node->children ? node->children->root->offset : 0);
1213 node_total_count = 1
1214 + (node->children ? node->children->root->total_count : 0);
1216 /* Move the node over */
1217 if (GTK_RBNODE_GET_COLOR (node) != GTK_RBNODE_GET_COLOR (y))
1219 node->flags ^= (GTK_RBNODE_BLACK | GTK_RBNODE_RED);
1220 y->flags ^= (GTK_RBNODE_BLACK | GTK_RBNODE_RED);
1223 y->left = node->left;
1224 if (y->left != tree->nil)
1225 y->left->parent = y;
1226 y->right = node->right;
1227 if (y->right != tree->nil)
1228 y->right->parent = y;
1229 y->parent = node->parent;
1230 if (y->parent != tree->nil)
1232 if (y->parent->left == node)
1233 y->parent->left = y;
1235 y->parent->right = y;
1241 y->count = node->count;
1242 y->total_count = node->total_count;
1243 y->offset = node->offset;
1245 gtk_rbnode_adjust (tree, y,
1247 y_total_count - node_total_count,
1248 y_height - node_height);
1251 if (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)
1252 _gtk_rbtree_remove_node_fixup (tree, x);
1253 _gtk_rbnode_free (node);
1255 #ifdef G_ENABLE_DEBUG
1256 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
1258 g_print ("_gtk_rbtree_remove_node finished...\n");
1259 _gtk_rbtree_debug_spew (tree);
1261 _gtk_rbtree_test (G_STRLOC, tree);
1263 #endif /* G_ENABLE_DEBUG */
1267 _gtk_rbtree_next (GtkRBTree *tree,
1270 g_return_val_if_fail (tree != NULL, NULL);
1271 g_return_val_if_fail (node != NULL, NULL);
1273 /* Case 1: the node's below us. */
1274 if (node->right != tree->nil)
1277 while (node->left != tree->nil)
1282 /* Case 2: it's an ancestor */
1283 while (node->parent != tree->nil)
1285 if (node->parent->right == node)
1286 node = node->parent;
1288 return (node->parent);
1291 /* Case 3: There is no next node */
1296 _gtk_rbtree_prev (GtkRBTree *tree,
1299 g_return_val_if_fail (tree != NULL, NULL);
1300 g_return_val_if_fail (node != NULL, NULL);
1302 /* Case 1: the node's below us. */
1303 if (node->left != tree->nil)
1306 while (node->right != tree->nil)
1311 /* Case 2: it's an ancestor */
1312 while (node->parent != tree->nil)
1314 if (node->parent->left == node)
1315 node = node->parent;
1317 return (node->parent);
1320 /* Case 3: There is no next node */
1325 _gtk_rbtree_next_full (GtkRBTree *tree,
1327 GtkRBTree **new_tree,
1328 GtkRBNode **new_node)
1330 g_return_if_fail (tree != NULL);
1331 g_return_if_fail (node != NULL);
1332 g_return_if_fail (new_tree != NULL);
1333 g_return_if_fail (new_node != NULL);
1337 *new_tree = node->children;
1338 *new_node = (*new_tree)->root;
1339 while ((*new_node)->left != (*new_tree)->nil)
1340 *new_node = (*new_node)->left;
1345 *new_node = _gtk_rbtree_next (tree, node);
1347 while ((*new_node == NULL) &&
1348 (*new_tree != NULL))
1350 *new_node = (*new_tree)->parent_node;
1351 *new_tree = (*new_tree)->parent_tree;
1353 *new_node = _gtk_rbtree_next (*new_tree, *new_node);
1358 _gtk_rbtree_prev_full (GtkRBTree *tree,
1360 GtkRBTree **new_tree,
1361 GtkRBNode **new_node)
1363 g_return_if_fail (tree != NULL);
1364 g_return_if_fail (node != NULL);
1365 g_return_if_fail (new_tree != NULL);
1366 g_return_if_fail (new_node != NULL);
1369 *new_node = _gtk_rbtree_prev (tree, node);
1371 if (*new_node == NULL)
1373 *new_node = (*new_tree)->parent_node;
1374 *new_tree = (*new_tree)->parent_tree;
1378 while ((*new_node)->children)
1380 *new_tree = (*new_node)->children;
1381 *new_node = (*new_tree)->root;
1382 while ((*new_node)->right != (*new_tree)->nil)
1383 *new_node = (*new_node)->right;
1389 _gtk_rbtree_get_depth (GtkRBTree *tree)
1391 GtkRBTree *tmp_tree;
1394 tmp_tree = tree->parent_tree;
1398 tmp_tree = tmp_tree->parent_tree;
1405 _gtk_rbtree_traverse_pre_order (GtkRBTree *tree,
1407 GtkRBTreeTraverseFunc func,
1410 if (node == tree->nil)
1413 (* func) (tree, node, data);
1414 _gtk_rbtree_traverse_pre_order (tree, node->left, func, data);
1415 _gtk_rbtree_traverse_pre_order (tree, node->right, func, data);
1419 _gtk_rbtree_traverse_post_order (GtkRBTree *tree,
1421 GtkRBTreeTraverseFunc func,
1424 if (node == tree->nil)
1427 _gtk_rbtree_traverse_post_order (tree, node->left, func, data);
1428 _gtk_rbtree_traverse_post_order (tree, node->right, func, data);
1429 (* func) (tree, node, data);
1433 _gtk_rbtree_traverse (GtkRBTree *tree,
1435 GTraverseType order,
1436 GtkRBTreeTraverseFunc func,
1439 g_return_if_fail (tree != NULL);
1440 g_return_if_fail (node != NULL);
1441 g_return_if_fail (func != NULL);
1442 g_return_if_fail (order <= G_LEVEL_ORDER);
1447 _gtk_rbtree_traverse_pre_order (tree, node, func, data);
1450 _gtk_rbtree_traverse_post_order (tree, node, func, data);
1455 g_warning ("unsupported traversal order.");
1461 void _fixup_validation (GtkRBTree *tree,
1464 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
1465 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
1466 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1467 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1468 (node->children != NULL && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)))
1470 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
1474 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
1479 void _fixup_total_count (GtkRBTree *tree,
1482 node->total_count = 1 +
1483 (node->children != NULL ? node->children->root->total_count : 0) +
1484 node->left->total_count + node->right->total_count;
1487 #ifdef G_ENABLE_DEBUG
1489 get_total_count (GtkRBNode *node)
1491 guint child_total = 0;
1493 child_total += (guint) node->left->total_count;
1494 child_total += (guint) node->right->total_count;
1497 child_total += (guint) node->children->root->total_count;
1499 return child_total + 1;
1503 count_total (GtkRBTree *tree,
1508 if (node == tree->nil)
1512 count_total (tree, node->left) +
1513 count_total (tree, node->right) +
1515 (node->children ? count_total (node->children, node->children->root) : 0);
1517 if (res != node->total_count)
1518 g_print ("total count incorrect for node\n");
1520 if (get_total_count (node) != node->total_count)
1521 g_error ("Node has incorrect total count %u, should be %u", node->total_count, get_total_count (node));
1527 _count_nodes (GtkRBTree *tree,
1531 if (node == tree->nil)
1534 g_assert (node->left);
1535 g_assert (node->right);
1537 res = (_count_nodes (tree, node->left) +
1538 _count_nodes (tree, node->right) + 1);
1540 if (res != node->count)
1541 g_print ("Tree failed\n");
1546 _gtk_rbtree_test_height (GtkRBTree *tree,
1549 gint computed_offset = 0;
1551 /* This whole test is sort of a useless truism. */
1553 if (node->left != tree->nil)
1554 computed_offset += node->left->offset;
1556 if (node->right != tree->nil)
1557 computed_offset += node->right->offset;
1559 if (node->children && node->children->root != node->children->nil)
1560 computed_offset += node->children->root->offset;
1562 if (GTK_RBNODE_GET_HEIGHT (node) + computed_offset != node->offset)
1563 g_error ("node has broken offset\n");
1565 if (node->left != tree->nil)
1566 _gtk_rbtree_test_height (tree, node->left);
1568 if (node->right != tree->nil)
1569 _gtk_rbtree_test_height (tree, node->right);
1571 if (node->children && node->children->root != node->children->nil)
1572 _gtk_rbtree_test_height (node->children, node->children->root);
1576 _gtk_rbtree_test_dirty (GtkRBTree *tree,
1578 gint expected_dirtyness)
1581 if (expected_dirtyness)
1583 g_assert (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
1584 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
1585 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1586 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1587 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)));
1591 g_assert (! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) &&
1592 ! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID));
1593 if (node->left != tree->nil)
1594 g_assert (! GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
1595 if (node->right != tree->nil)
1596 g_assert (! GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
1597 if (node->children != NULL)
1598 g_assert (! GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
1601 if (node->left != tree->nil)
1602 _gtk_rbtree_test_dirty (tree, node->left, GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
1603 if (node->right != tree->nil)
1604 _gtk_rbtree_test_dirty (tree, node->right, GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
1605 if (node->children != NULL && node->children->root != node->children->nil)
1606 _gtk_rbtree_test_dirty (node->children, node->children->root, GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
1609 static void _gtk_rbtree_test_structure (GtkRBTree *tree);
1612 _gtk_rbtree_test_structure_helper (GtkRBTree *tree,
1615 g_assert (node != tree->nil);
1617 g_assert (node->left != NULL);
1618 g_assert (node->right != NULL);
1619 g_assert (node->parent != NULL);
1621 if (node->left != tree->nil)
1623 g_assert (node->left->parent == node);
1624 _gtk_rbtree_test_structure_helper (tree, node->left);
1626 if (node->right != tree->nil)
1628 g_assert (node->right->parent == node);
1629 _gtk_rbtree_test_structure_helper (tree, node->right);
1632 if (node->children != NULL)
1634 g_assert (node->children->parent_tree == tree);
1635 g_assert (node->children->parent_node == node);
1637 _gtk_rbtree_test_structure (node->children);
1641 _gtk_rbtree_test_structure (GtkRBTree *tree)
1643 g_assert (tree->root);
1644 if (tree->root == tree->nil)
1647 g_assert (tree->root->parent == tree->nil);
1648 _gtk_rbtree_test_structure_helper (tree, tree->root);
1652 _gtk_rbtree_test (const gchar *where,
1655 GtkRBTree *tmp_tree;
1660 /* Test the entire tree */
1662 while (tmp_tree->parent_tree)
1663 tmp_tree = tmp_tree->parent_tree;
1665 g_assert (tmp_tree->nil != NULL);
1667 if (tmp_tree->root == tmp_tree->nil)
1670 _gtk_rbtree_test_structure (tmp_tree);
1672 g_assert ((_count_nodes (tmp_tree, tmp_tree->root->left) +
1673 _count_nodes (tmp_tree, tmp_tree->root->right) + 1) == tmp_tree->root->count);
1676 _gtk_rbtree_test_height (tmp_tree, tmp_tree->root);
1677 _gtk_rbtree_test_dirty (tmp_tree, tmp_tree->root, GTK_RBNODE_FLAG_SET (tmp_tree->root, GTK_RBNODE_DESCENDANTS_INVALID));
1678 g_assert (count_total (tmp_tree, tmp_tree->root) == tmp_tree->root->total_count);
1682 _gtk_rbtree_debug_spew_helper (GtkRBTree *tree,
1687 for (i = 0; i < depth; i++)
1690 g_print ("(%p - %s) (Offset %d) (Parity %d) (Validity %d%d%d)\n",
1692 (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)?"BLACK":" RED ",
1695 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))?1:0,
1696 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))?1:0,
1697 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID))?1:0);
1698 if (node->children != NULL)
1700 g_print ("Looking at child.\n");
1701 _gtk_rbtree_debug_spew (node->children);
1702 g_print ("Done looking at child.\n");
1704 if (node->left != tree->nil)
1706 _gtk_rbtree_debug_spew_helper (tree, node->left, depth+1);
1708 if (node->right != tree->nil)
1710 _gtk_rbtree_debug_spew_helper (tree, node->right, depth+1);
1715 _gtk_rbtree_debug_spew (GtkRBTree *tree)
1717 g_return_if_fail (tree != NULL);
1719 if (tree->root == tree->nil)
1720 g_print ("Empty tree...\n");
1722 _gtk_rbtree_debug_spew_helper (tree, tree->root, 0);
1724 #endif /* G_ENABLE_DEBUG */