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;
475 g_assert (tree->root == tree->nil);
477 tmp_node = tree->parent_node;
478 tmp_tree = tree->parent_tree;
481 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
483 /* We only want to propagate the count if we are in the tree we
485 if (tmp_tree == tree)
488 tmp_node->total_count += 1;
489 tmp_node->offset += height;
490 tmp_node = tmp_node->parent;
491 if (tmp_node == tmp_tree->nil)
493 tmp_node = tmp_tree->parent_node;
494 tmp_tree = tmp_tree->parent_tree;
499 _gtk_rbtree_node_mark_valid (tree, node);
501 _gtk_rbtree_node_mark_invalid (tree, node);
503 _gtk_rbtree_insert_fixup (tree, node);
505 #ifdef G_ENABLE_DEBUG
506 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
508 g_print ("_gtk_rbtree_insert_after finished...\n");
509 _gtk_rbtree_debug_spew (tree);
511 _gtk_rbtree_test (G_STRLOC, tree);
513 #endif /* G_ENABLE_DEBUG */
519 _gtk_rbtree_insert_before (GtkRBTree *tree,
525 gboolean left = TRUE;
529 #ifdef G_ENABLE_DEBUG
530 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
532 g_print ("\n\n_gtk_rbtree_insert_before: %p\n", current);
533 _gtk_rbtree_debug_spew (tree);
534 _gtk_rbtree_test (G_STRLOC, tree);
536 #endif /* G_ENABLE_DEBUG */
538 if (current != NULL && current->left != tree->nil)
540 current = current->left;
541 while (current->right != tree->nil)
542 current = current->right;
547 node = _gtk_rbnode_new (tree, height);
548 node->parent = (current?current:tree->nil);
550 /* insert node in tree */
554 current->left = node;
556 current->right = node;
557 tmp_node = node->parent;
562 g_assert (tree->root == tree->nil);
564 tmp_node = tree->parent_node;
565 tmp_tree = tree->parent_tree;
568 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
570 /* We only want to propagate the count if we are in the tree we
572 if (tmp_tree == tree)
575 tmp_node->total_count += 1;
576 tmp_node->offset += height;
577 tmp_node = tmp_node->parent;
578 if (tmp_node == tmp_tree->nil)
580 tmp_node = tmp_tree->parent_node;
581 tmp_tree = tmp_tree->parent_tree;
586 _gtk_rbtree_node_mark_valid (tree, node);
588 _gtk_rbtree_node_mark_invalid (tree, node);
590 _gtk_rbtree_insert_fixup (tree, node);
592 #ifdef G_ENABLE_DEBUG
593 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
595 g_print ("_gtk_rbtree_insert_before finished...\n");
596 _gtk_rbtree_debug_spew (tree);
598 _gtk_rbtree_test (G_STRLOC, tree);
600 #endif /* G_ENABLE_DEBUG */
606 _gtk_rbtree_find_count (GtkRBTree *tree,
612 while (node != tree->nil && (node->left->count + 1 != count))
614 if (node->left->count >= count)
618 count -= (node->left->count + 1);
622 if (node == tree->nil)
628 _gtk_rbtree_node_set_height (GtkRBTree *tree,
632 gint diff = height - GTK_RBNODE_GET_HEIGHT (node);
633 GtkRBNode *tmp_node = node;
634 GtkRBTree *tmp_tree = tree;
639 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
641 tmp_node->offset += diff;
642 tmp_node = tmp_node->parent;
643 if (tmp_node == tmp_tree->nil)
645 tmp_node = tmp_tree->parent_node;
646 tmp_tree = tmp_tree->parent_tree;
649 #ifdef G_ENABLE_DEBUG
650 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
651 _gtk_rbtree_test (G_STRLOC, tree);
656 _gtk_rbtree_node_mark_invalid (GtkRBTree *tree,
659 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))
662 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
665 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))
667 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
669 if (node == tree->nil)
671 node = tree->parent_node;
672 tree = tree->parent_tree;
679 /* Draconian version. */
681 _gtk_rbtree_node_mark_invalid (GtkRBTree *tree,
684 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
687 _fixup_validation (tree, node);
689 if (node == tree->nil)
691 node = tree->parent_node;
692 tree = tree->parent_tree;
700 _gtk_rbtree_node_mark_valid (GtkRBTree *tree,
703 if ((!GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)) &&
704 (!GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID)))
707 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_INVALID);
708 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
712 if ((GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)) ||
713 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID)) ||
714 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)) ||
715 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
716 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)))
719 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
721 if (node == tree->nil)
723 node = tree->parent_node;
724 tree = tree->parent_tree;
731 /* Draconian version */
733 _gtk_rbtree_node_mark_valid (GtkRBTree *tree,
736 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_INVALID);
737 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
741 _fixup_validation (tree, node);
743 if (node == tree->nil)
745 node = tree->parent_node;
746 tree = tree->parent_tree;
752 /* Assume tree is the root node as it doesn't set DESCENDANTS_INVALID above.
755 _gtk_rbtree_column_invalid (GtkRBTree *tree)
764 while (node->left != tree->nil)
769 if (! (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)))
770 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
771 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
774 _gtk_rbtree_column_invalid (node->children);
776 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
780 _gtk_rbtree_mark_invalid (GtkRBTree *tree)
789 while (node->left != tree->nil)
794 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
795 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
798 _gtk_rbtree_mark_invalid (node->children);
800 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
804 _gtk_rbtree_set_fixed_height (GtkRBTree *tree,
816 while (node->left != tree->nil)
821 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))
823 _gtk_rbtree_node_set_height (tree, node, height);
825 _gtk_rbtree_node_mark_valid (tree, node);
829 _gtk_rbtree_set_fixed_height (node->children, height, mark_valid);
831 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
834 typedef struct _GtkRBReorder
845 gtk_rbtree_reorder_sort_func (gconstpointer a,
848 return ((GtkRBReorder *) a)->order - ((GtkRBReorder *) b)->order;
852 gtk_rbtree_reorder_invert_func (gconstpointer a,
855 return ((GtkRBReorder *) a)->invert_order - ((GtkRBReorder *) b)->invert_order;
859 gtk_rbtree_reorder_fixup (GtkRBTree *tree,
862 if (node == tree->nil)
865 node->total_count = 1;
867 if (node->left != tree->nil)
869 gtk_rbtree_reorder_fixup (tree, node->left);
870 node->offset += node->left->offset;
871 node->total_count += node->left->total_count;
873 if (node->right != tree->nil)
875 gtk_rbtree_reorder_fixup (tree, node->right);
876 node->offset += node->right->offset;
877 node->total_count += node->right->total_count;
882 node->offset += node->children->root->offset;
883 node->total_count += node->children->root->total_count;
886 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
887 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
888 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
889 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)))
890 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
892 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
895 /* It basically pulls everything out of the tree, rearranges it, and puts it
896 * back together. Our strategy is to keep the old RBTree intact, and just
897 * rearrange the contents. When that is done, we go through and update the
898 * heights. There is probably a more elegant way to write this function. If
899 * anyone wants to spend the time writing it, patches will be accepted.
902 _gtk_rbtree_reorder (GtkRBTree *tree,
906 GtkRBReorder reorder = { NULL };
911 g_return_if_fail (tree != NULL);
912 g_return_if_fail (length > 0);
913 g_return_if_fail (tree->root->count == length);
915 /* Sort the trees values in the new tree. */
916 array = g_array_sized_new (FALSE, FALSE, sizeof (GtkRBReorder), length);
917 for (i = 0; i < length; i++)
919 reorder.order = new_order[i];
920 reorder.invert_order = i;
921 g_array_append_val (array, reorder);
924 g_array_sort(array, gtk_rbtree_reorder_sort_func);
928 while (node && node->left != tree->nil)
931 for (i = 0; i < length; i++)
933 g_assert (node != tree->nil);
934 g_array_index (array, GtkRBReorder, i).children = node->children;
935 g_array_index (array, GtkRBReorder, i).flags = GTK_RBNODE_NON_COLORS & node->flags;
936 g_array_index (array, GtkRBReorder, i).height = GTK_RBNODE_GET_HEIGHT (node);
938 node = _gtk_rbtree_next (tree, node);
941 g_array_sort (array, gtk_rbtree_reorder_invert_func);
945 while (node && node->left != tree->nil)
948 /* Go through the tree and change the values to the new ones. */
949 for (i = 0; i < length; i++)
951 reorder = g_array_index (array, GtkRBReorder, i);
952 node->children = reorder.children;
954 node->children->parent_node = node;
955 node->flags = GTK_RBNODE_GET_COLOR (node) | reorder.flags;
956 /* We temporarily set the height to this. */
957 node->offset = reorder.height;
958 node = _gtk_rbtree_next (tree, node);
960 gtk_rbtree_reorder_fixup (tree, tree->root);
962 g_array_free (array, TRUE);
967 _gtk_rbtree_node_find_offset (GtkRBTree *tree,
974 g_assert (node->left);
976 retval = node->left->offset;
978 while (tree && node && node != tree->nil)
983 /* Add left branch, plus children, iff we came from the right */
984 if (node->right == last)
985 retval += node->offset - node->right->offset;
987 if (node == tree->nil)
989 node = tree->parent_node;
990 tree = tree->parent_tree;
992 /* Add the parent node, plus the left branch. */
994 retval += node->left->offset + GTK_RBNODE_GET_HEIGHT (node);
1001 _gtk_rbtree_node_get_index (GtkRBTree *tree,
1008 g_assert (node->left);
1010 retval = node->left->total_count;
1012 while (tree && node && node != tree->nil)
1015 node = node->parent;
1017 /* Add left branch, plus children, iff we came from the right */
1018 if (node->right == last)
1019 retval += node->total_count - node->right->total_count;
1021 if (node == tree->nil)
1023 node = tree->parent_node;
1024 tree = tree->parent_tree;
1026 /* Add the parent node, plus the left branch. */
1028 retval += node->left->total_count + 1; /* 1 == GTK_RBNODE_GET_PARITY() */
1036 _gtk_rbtree_real_find_offset (GtkRBTree *tree,
1038 GtkRBTree **new_tree,
1039 GtkRBNode **new_node)
1041 GtkRBNode *tmp_node;
1054 tmp_node = tree->root;
1055 while (tmp_node != tree->nil &&
1056 (tmp_node->left->offset > height ||
1057 (tmp_node->offset - tmp_node->right->offset) < height))
1059 if (tmp_node->left->offset > height)
1060 tmp_node = tmp_node->left;
1063 height -= (tmp_node->offset - tmp_node->right->offset);
1064 tmp_node = tmp_node->right;
1067 if (tmp_node == tree->nil)
1073 if (tmp_node->children)
1075 if ((tmp_node->offset -
1076 tmp_node->right->offset -
1077 tmp_node->children->root->offset) > height)
1080 *new_node = tmp_node;
1081 return (height - tmp_node->left->offset);
1083 return _gtk_rbtree_real_find_offset (tmp_node->children,
1084 height - tmp_node->left->offset -
1086 tmp_node->left->offset -
1087 tmp_node->right->offset -
1088 tmp_node->children->root->offset),
1093 *new_node = tmp_node;
1094 return (height - tmp_node->left->offset);
1098 _gtk_rbtree_find_offset (GtkRBTree *tree,
1100 GtkRBTree **new_tree,
1101 GtkRBNode **new_node)
1106 (height >= tree->root->offset))
1113 return _gtk_rbtree_real_find_offset (tree, height, new_tree, new_node);
1117 _gtk_rbtree_find_index (GtkRBTree *tree,
1119 GtkRBTree **new_tree,
1120 GtkRBNode **new_node)
1122 GtkRBNode *tmp_node;
1126 tmp_node = tree->root;
1127 while (tmp_node != tree->nil)
1129 if (tmp_node->left->total_count > index)
1131 tmp_node = tmp_node->left;
1133 else if (tmp_node->total_count - tmp_node->right->total_count <= index)
1135 index -= tmp_node->total_count - tmp_node->right->total_count;
1136 tmp_node = tmp_node->right;
1140 index -= tmp_node->left->total_count;
1144 if (tmp_node == tree->nil)
1153 g_assert (tmp_node->children);
1155 return _gtk_rbtree_find_index (tmp_node->children,
1162 *new_node = tmp_node;
1167 _gtk_rbtree_remove_node (GtkRBTree *tree,
1171 GtkRBTree *tmp_tree;
1172 GtkRBNode *tmp_node;
1175 g_return_if_fail (tree != NULL);
1176 g_return_if_fail (node != NULL);
1179 #ifdef G_ENABLE_DEBUG
1180 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
1182 g_print ("\n\n_gtk_rbtree_remove_node: %p\n", node);
1183 _gtk_rbtree_debug_spew (tree);
1184 _gtk_rbtree_test (G_STRLOC, tree);
1186 #endif /* G_ENABLE_DEBUG */
1188 /* make sure we're deleting a node that's actually in the tree */
1189 for (x = node; x->parent != tree->nil; x = x->parent)
1191 g_return_if_fail (x == tree->root);
1193 #ifdef G_ENABLE_DEBUG
1194 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
1195 _gtk_rbtree_test (G_STRLOC, tree);
1198 if (node->left == tree->nil || node->right == tree->nil)
1206 while (y->left != tree->nil)
1210 /* adjust count only beneath tree */
1211 for (x = y; x != tree->nil; x = x->parent)
1216 /* offsets and total count adjust all the way up through parent trees */
1217 y_height = GTK_RBNODE_GET_HEIGHT (y);
1221 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
1223 tmp_node->offset -= (y_height + (y->children?y->children->root->offset:0));
1224 _fixup_validation (tmp_tree, tmp_node);
1225 _fixup_total_count (tmp_tree, tmp_node);
1226 tmp_node = tmp_node->parent;
1227 if (tmp_node == tmp_tree->nil)
1229 tmp_node = tmp_tree->parent_node;
1230 tmp_tree = tmp_tree->parent_tree;
1234 /* x is y's only child, or nil */
1235 if (y->left != tree->nil)
1240 /* remove y from the parent chain */
1241 x->parent = y->parent;
1242 if (y->parent != tree->nil)
1244 if (y == y->parent->left)
1245 y->parent->left = x;
1247 y->parent->right = x;
1254 /* We need to clean up the validity of the tree.
1261 /* We skip the first time, iff x is nil */
1262 if (tmp_node != tmp_tree->nil)
1264 _fixup_validation (tmp_tree, tmp_node);
1265 _fixup_total_count (tmp_tree, tmp_node);
1267 tmp_node = tmp_node->parent;
1268 if (tmp_node == tmp_tree->nil)
1270 tmp_node = tmp_tree->parent_node;
1271 tmp_tree = tmp_tree->parent_tree;
1274 while (tmp_tree != NULL);
1280 /* Copy the node over */
1281 if (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)
1282 node->flags = ((y->flags & (GTK_RBNODE_NON_COLORS)) | GTK_RBNODE_BLACK);
1284 node->flags = ((y->flags & (GTK_RBNODE_NON_COLORS)) | GTK_RBNODE_RED);
1287 node->children = y->children;
1288 node->children->parent_node = node;
1292 node->children = NULL;
1294 _fixup_validation (tree, node);
1295 _fixup_total_count (tree, node);
1296 /* We want to see how different our height is from the previous node.
1297 * To do this, we compare our current height with our supposed height.
1299 diff = y_height - GTK_RBNODE_GET_HEIGHT (node);
1303 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
1305 tmp_node->offset += diff;
1306 _fixup_validation (tmp_tree, tmp_node);
1307 _fixup_total_count (tmp_tree, tmp_node);
1308 tmp_node = tmp_node->parent;
1309 if (tmp_node == tmp_tree->nil)
1311 tmp_node = tmp_tree->parent_node;
1312 tmp_tree = tmp_tree->parent_tree;
1317 if (GTK_RBNODE_GET_COLOR (y) == GTK_RBNODE_BLACK)
1318 _gtk_rbtree_remove_node_fixup (tree, x);
1319 _gtk_rbnode_free (y);
1321 #ifdef G_ENABLE_DEBUG
1322 if (gtk_get_debug_flags () & GTK_DEBUG_TREE)
1324 g_print ("_gtk_rbtree_remove_node finished...\n");
1325 _gtk_rbtree_debug_spew (tree);
1327 _gtk_rbtree_test (G_STRLOC, tree);
1329 #endif /* G_ENABLE_DEBUG */
1333 _gtk_rbtree_next (GtkRBTree *tree,
1336 g_return_val_if_fail (tree != NULL, NULL);
1337 g_return_val_if_fail (node != NULL, NULL);
1339 /* Case 1: the node's below us. */
1340 if (node->right != tree->nil)
1343 while (node->left != tree->nil)
1348 /* Case 2: it's an ancestor */
1349 while (node->parent != tree->nil)
1351 if (node->parent->right == node)
1352 node = node->parent;
1354 return (node->parent);
1357 /* Case 3: There is no next node */
1362 _gtk_rbtree_prev (GtkRBTree *tree,
1365 g_return_val_if_fail (tree != NULL, NULL);
1366 g_return_val_if_fail (node != NULL, NULL);
1368 /* Case 1: the node's below us. */
1369 if (node->left != tree->nil)
1372 while (node->right != tree->nil)
1377 /* Case 2: it's an ancestor */
1378 while (node->parent != tree->nil)
1380 if (node->parent->left == node)
1381 node = node->parent;
1383 return (node->parent);
1386 /* Case 3: There is no next node */
1391 _gtk_rbtree_next_full (GtkRBTree *tree,
1393 GtkRBTree **new_tree,
1394 GtkRBNode **new_node)
1396 g_return_if_fail (tree != NULL);
1397 g_return_if_fail (node != NULL);
1398 g_return_if_fail (new_tree != NULL);
1399 g_return_if_fail (new_node != NULL);
1403 *new_tree = node->children;
1404 *new_node = (*new_tree)->root;
1405 while ((*new_node)->left != (*new_tree)->nil)
1406 *new_node = (*new_node)->left;
1411 *new_node = _gtk_rbtree_next (tree, node);
1413 while ((*new_node == NULL) &&
1414 (*new_tree != NULL))
1416 *new_node = (*new_tree)->parent_node;
1417 *new_tree = (*new_tree)->parent_tree;
1419 *new_node = _gtk_rbtree_next (*new_tree, *new_node);
1424 _gtk_rbtree_prev_full (GtkRBTree *tree,
1426 GtkRBTree **new_tree,
1427 GtkRBNode **new_node)
1429 g_return_if_fail (tree != NULL);
1430 g_return_if_fail (node != NULL);
1431 g_return_if_fail (new_tree != NULL);
1432 g_return_if_fail (new_node != NULL);
1435 *new_node = _gtk_rbtree_prev (tree, node);
1437 if (*new_node == NULL)
1439 *new_node = (*new_tree)->parent_node;
1440 *new_tree = (*new_tree)->parent_tree;
1444 while ((*new_node)->children)
1446 *new_tree = (*new_node)->children;
1447 *new_node = (*new_tree)->root;
1448 while ((*new_node)->right != (*new_tree)->nil)
1449 *new_node = (*new_node)->right;
1455 _gtk_rbtree_get_depth (GtkRBTree *tree)
1457 GtkRBTree *tmp_tree;
1460 tmp_tree = tree->parent_tree;
1464 tmp_tree = tmp_tree->parent_tree;
1471 _gtk_rbtree_traverse_pre_order (GtkRBTree *tree,
1473 GtkRBTreeTraverseFunc func,
1476 if (node == tree->nil)
1479 (* func) (tree, node, data);
1480 _gtk_rbtree_traverse_pre_order (tree, node->left, func, data);
1481 _gtk_rbtree_traverse_pre_order (tree, node->right, func, data);
1485 _gtk_rbtree_traverse_post_order (GtkRBTree *tree,
1487 GtkRBTreeTraverseFunc func,
1490 if (node == tree->nil)
1493 _gtk_rbtree_traverse_post_order (tree, node->left, func, data);
1494 _gtk_rbtree_traverse_post_order (tree, node->right, func, data);
1495 (* func) (tree, node, data);
1499 _gtk_rbtree_traverse (GtkRBTree *tree,
1501 GTraverseType order,
1502 GtkRBTreeTraverseFunc func,
1505 g_return_if_fail (tree != NULL);
1506 g_return_if_fail (node != NULL);
1507 g_return_if_fail (func != NULL);
1508 g_return_if_fail (order <= G_LEVEL_ORDER);
1513 _gtk_rbtree_traverse_pre_order (tree, node, func, data);
1516 _gtk_rbtree_traverse_post_order (tree, node, func, data);
1521 g_warning ("unsupported traversal order.");
1527 void _fixup_validation (GtkRBTree *tree,
1530 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
1531 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
1532 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1533 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1534 (node->children != NULL && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)))
1536 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
1540 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
1545 void _fixup_total_count (GtkRBTree *tree,
1548 node->total_count = 1 +
1549 (node->children != NULL ? node->children->root->total_count : 0) +
1550 node->left->total_count + node->right->total_count;
1553 #ifdef G_ENABLE_DEBUG
1555 get_total_count (GtkRBNode *node)
1557 guint child_total = 0;
1559 child_total += (guint) node->left->total_count;
1560 child_total += (guint) node->right->total_count;
1563 child_total += (guint) node->children->root->total_count;
1565 return child_total + 1;
1569 count_total (GtkRBTree *tree,
1574 if (node == tree->nil)
1578 count_total (tree, node->left) +
1579 count_total (tree, node->right) +
1581 (node->children ? count_total (node->children, node->children->root) : 0);
1583 if (res != node->total_count)
1584 g_print ("total count incorrect for node\n");
1586 if (get_total_count (node) != node->total_count)
1587 g_error ("Node has incorrect total count %u, should be %u", node->total_count, get_total_count (node));
1593 _count_nodes (GtkRBTree *tree,
1597 if (node == tree->nil)
1600 g_assert (node->left);
1601 g_assert (node->right);
1603 res = (_count_nodes (tree, node->left) +
1604 _count_nodes (tree, node->right) + 1);
1606 if (res != node->count)
1607 g_print ("Tree failed\n");
1612 _gtk_rbtree_test_height (GtkRBTree *tree,
1615 gint computed_offset = 0;
1617 /* This whole test is sort of a useless truism. */
1619 if (node->left != tree->nil)
1620 computed_offset += node->left->offset;
1622 if (node->right != tree->nil)
1623 computed_offset += node->right->offset;
1625 if (node->children && node->children->root != node->children->nil)
1626 computed_offset += node->children->root->offset;
1628 if (GTK_RBNODE_GET_HEIGHT (node) + computed_offset != node->offset)
1629 g_error ("node has broken offset\n");
1631 if (node->left != tree->nil)
1632 _gtk_rbtree_test_height (tree, node->left);
1634 if (node->right != tree->nil)
1635 _gtk_rbtree_test_height (tree, node->right);
1637 if (node->children && node->children->root != node->children->nil)
1638 _gtk_rbtree_test_height (node->children, node->children->root);
1642 _gtk_rbtree_test_dirty (GtkRBTree *tree,
1644 gint expected_dirtyness)
1647 if (expected_dirtyness)
1649 g_assert (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
1650 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
1651 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1652 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1653 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)));
1657 g_assert (! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) &&
1658 ! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID));
1659 if (node->left != tree->nil)
1660 g_assert (! GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
1661 if (node->right != tree->nil)
1662 g_assert (! GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
1663 if (node->children != NULL)
1664 g_assert (! GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
1667 if (node->left != tree->nil)
1668 _gtk_rbtree_test_dirty (tree, node->left, GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
1669 if (node->right != tree->nil)
1670 _gtk_rbtree_test_dirty (tree, node->right, GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
1671 if (node->children != NULL && node->children->root != node->children->nil)
1672 _gtk_rbtree_test_dirty (node->children, node->children->root, GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
1675 static void _gtk_rbtree_test_structure (GtkRBTree *tree);
1678 _gtk_rbtree_test_structure_helper (GtkRBTree *tree,
1681 g_assert (node != tree->nil);
1683 g_assert (node->left != NULL);
1684 g_assert (node->right != NULL);
1685 g_assert (node->parent != NULL);
1687 if (node->left != tree->nil)
1689 g_assert (node->left->parent == node);
1690 _gtk_rbtree_test_structure_helper (tree, node->left);
1692 if (node->right != tree->nil)
1694 g_assert (node->right->parent == node);
1695 _gtk_rbtree_test_structure_helper (tree, node->right);
1698 if (node->children != NULL)
1700 g_assert (node->children->parent_tree == tree);
1701 g_assert (node->children->parent_node == node);
1703 _gtk_rbtree_test_structure (node->children);
1707 _gtk_rbtree_test_structure (GtkRBTree *tree)
1709 g_assert (tree->root);
1710 if (tree->root == tree->nil)
1713 g_assert (tree->root->parent == tree->nil);
1714 _gtk_rbtree_test_structure_helper (tree, tree->root);
1718 _gtk_rbtree_test (const gchar *where,
1721 GtkRBTree *tmp_tree;
1726 /* Test the entire tree */
1728 while (tmp_tree->parent_tree)
1729 tmp_tree = tmp_tree->parent_tree;
1731 g_assert (tmp_tree->nil != NULL);
1733 if (tmp_tree->root == tmp_tree->nil)
1736 _gtk_rbtree_test_structure (tmp_tree);
1738 g_assert ((_count_nodes (tmp_tree, tmp_tree->root->left) +
1739 _count_nodes (tmp_tree, tmp_tree->root->right) + 1) == tmp_tree->root->count);
1742 _gtk_rbtree_test_height (tmp_tree, tmp_tree->root);
1743 _gtk_rbtree_test_dirty (tmp_tree, tmp_tree->root, GTK_RBNODE_FLAG_SET (tmp_tree->root, GTK_RBNODE_DESCENDANTS_INVALID));
1744 g_assert (count_total (tmp_tree, tmp_tree->root) == tmp_tree->root->total_count);
1748 _gtk_rbtree_debug_spew_helper (GtkRBTree *tree,
1753 for (i = 0; i < depth; i++)
1756 g_print ("(%p - %s) (Offset %d) (Parity %d) (Validity %d%d%d)\n",
1758 (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)?"BLACK":" RED ",
1761 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))?1:0,
1762 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))?1:0,
1763 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID))?1:0);
1764 if (node->children != NULL)
1766 g_print ("Looking at child.\n");
1767 _gtk_rbtree_debug_spew (node->children);
1768 g_print ("Done looking at child.\n");
1770 if (node->left != tree->nil)
1772 _gtk_rbtree_debug_spew_helper (tree, node->left, depth+1);
1774 if (node->right != tree->nil)
1776 _gtk_rbtree_debug_spew_helper (tree, node->right, depth+1);
1781 _gtk_rbtree_debug_spew (GtkRBTree *tree)
1783 g_return_if_fail (tree != NULL);
1785 if (tree->root == tree->nil)
1786 g_print ("Empty tree...\n");
1788 _gtk_rbtree_debug_spew_helper (tree, tree->root, 0);
1790 #endif /* G_ENABLE_DEBUG */