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"
25 static GtkRBNode * _gtk_rbnode_new (GtkRBTree *tree,
27 static void _gtk_rbnode_free (GtkRBNode *node);
28 static void _gtk_rbnode_rotate_left (GtkRBTree *tree,
30 static void _gtk_rbnode_rotate_right (GtkRBTree *tree,
32 static void _gtk_rbtree_insert_fixup (GtkRBTree *tree,
34 static void _gtk_rbtree_remove_node_fixup (GtkRBTree *tree,
36 static gint _count_nodes (GtkRBTree *tree,
38 static inline void _fixup_validation (GtkRBTree *tree,
40 static inline void _fixup_parity (GtkRBTree *tree,
46 _gtk_rbnode_new (GtkRBTree *tree,
49 GtkRBNode *node = g_slice_new (GtkRBNode);
51 node->left = tree->nil;
52 node->right = tree->nil;
53 node->parent = tree->nil;
54 node->flags = GTK_RBNODE_RED;
57 node->children = NULL;
58 node->offset = height;
63 _gtk_rbnode_free (GtkRBNode *node)
65 if (gtk_debug_flags & GTK_DEBUG_TREE)
67 node->left = (gpointer) 0xdeadbeef;
68 node->right = (gpointer) 0xdeadbeef;
69 node->parent = (gpointer) 0xdeadbeef;
74 g_slice_free (GtkRBNode, node);
78 _gtk_rbnode_rotate_left (GtkRBTree *tree,
81 gint node_height, right_height;
82 GtkRBNode *right = node->right;
84 g_return_if_fail (node != tree->nil);
86 node_height = node->offset -
87 (node->left?node->left->offset:0) -
88 (node->right?node->right->offset:0) -
89 (node->children?node->children->root->offset:0);
90 right_height = right->offset -
91 (right->left?right->left->offset:0) -
92 (right->right?right->right->offset:0) -
93 (right->children?right->children->root->offset:0);
94 node->right = right->left;
95 if (right->left != tree->nil)
96 right->left->parent = node;
98 if (right != tree->nil)
99 right->parent = node->parent;
100 if (node->parent != tree->nil)
102 if (node == node->parent->left)
103 node->parent->left = right;
105 node->parent->right = right;
111 if (node != tree->nil)
112 node->parent = right;
114 node->count = 1 + (node->left?node->left->count:0) +
115 (node->right?node->right->count:0);
116 right->count = 1 + (right->left?right->left->count:0) +
117 (right->right?right->right->count:0);
119 node->offset = node_height +
120 (node->left?node->left->offset:0) +
121 (node->right?node->right->offset:0) +
122 (node->children?node->children->root->offset:0);
123 right->offset = right_height +
124 (right->left?right->left->offset:0) +
125 (right->right?right->right->offset:0) +
126 (right->children?right->children->root->offset:0);
128 _fixup_validation (tree, node);
129 _fixup_validation (tree, right);
130 _fixup_parity (tree, node);
131 _fixup_parity (tree, right);
135 _gtk_rbnode_rotate_right (GtkRBTree *tree,
138 gint node_height, left_height;
139 GtkRBNode *left = node->left;
141 g_return_if_fail (node != tree->nil);
143 node_height = node->offset -
144 (node->left?node->left->offset:0) -
145 (node->right?node->right->offset:0) -
146 (node->children?node->children->root->offset:0);
147 left_height = left->offset -
148 (left->left?left->left->offset:0) -
149 (left->right?left->right->offset:0) -
150 (left->children?left->children->root->offset:0);
152 node->left = left->right;
153 if (left->right != tree->nil)
154 left->right->parent = node;
156 if (left != tree->nil)
157 left->parent = node->parent;
158 if (node->parent != tree->nil)
160 if (node == node->parent->right)
161 node->parent->right = left;
163 node->parent->left = left;
170 /* link node and left */
172 if (node != tree->nil)
175 node->count = 1 + (node->left?node->left->count:0) +
176 (node->right?node->right->count:0);
177 left->count = 1 + (left->left?left->left->count:0) +
178 (left->right?left->right->count:0);
180 node->offset = node_height +
181 (node->left?node->left->offset:0) +
182 (node->right?node->right->offset:0) +
183 (node->children?node->children->root->offset:0);
184 left->offset = left_height +
185 (left->left?left->left->offset:0) +
186 (left->right?left->right->offset:0) +
187 (left->children?left->children->root->offset:0);
189 _fixup_validation (tree, node);
190 _fixup_validation (tree, left);
191 _fixup_parity (tree, node);
192 _fixup_parity (tree, left);
196 _gtk_rbtree_insert_fixup (GtkRBTree *tree,
200 /* check Red-Black properties */
201 while (node != tree->root && GTK_RBNODE_GET_COLOR (node->parent) == GTK_RBNODE_RED)
203 /* we have a violation */
204 if (node->parent == node->parent->parent->left)
206 GtkRBNode *y = node->parent->parent->right;
207 if (GTK_RBNODE_GET_COLOR (y) == GTK_RBNODE_RED)
209 /* uncle is GTK_RBNODE_RED */
210 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
211 GTK_RBNODE_SET_COLOR (y, GTK_RBNODE_BLACK);
212 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
213 node = node->parent->parent;
217 /* uncle is GTK_RBNODE_BLACK */
218 if (node == node->parent->right)
220 /* make node a left child */
222 _gtk_rbnode_rotate_left (tree, node);
225 /* recolor and rotate */
226 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
227 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
228 _gtk_rbnode_rotate_right(tree, node->parent->parent);
233 /* mirror image of above code */
234 GtkRBNode *y = node->parent->parent->left;
235 if (GTK_RBNODE_GET_COLOR (y) == GTK_RBNODE_RED)
237 /* uncle is GTK_RBNODE_RED */
238 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
239 GTK_RBNODE_SET_COLOR (y, GTK_RBNODE_BLACK);
240 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
241 node = node->parent->parent;
245 /* uncle is GTK_RBNODE_BLACK */
246 if (node == node->parent->left)
249 _gtk_rbnode_rotate_right (tree, node);
251 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
252 GTK_RBNODE_SET_COLOR (node->parent->parent, GTK_RBNODE_RED);
253 _gtk_rbnode_rotate_left (tree, node->parent->parent);
257 GTK_RBNODE_SET_COLOR (tree->root, GTK_RBNODE_BLACK);
261 _gtk_rbtree_remove_node_fixup (GtkRBTree *tree,
264 while (node != tree->root && GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)
266 if (node == node->parent->left)
268 GtkRBNode *w = node->parent->right;
269 if (GTK_RBNODE_GET_COLOR (w) == GTK_RBNODE_RED)
271 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_BLACK);
272 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_RED);
273 _gtk_rbnode_rotate_left (tree, node->parent);
274 w = node->parent->right;
276 if (GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK && GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK)
278 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
283 if (GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK)
285 GTK_RBNODE_SET_COLOR (w->left, GTK_RBNODE_BLACK);
286 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
287 _gtk_rbnode_rotate_right (tree, w);
288 w = node->parent->right;
290 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_GET_COLOR (node->parent));
291 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
292 GTK_RBNODE_SET_COLOR (w->right, GTK_RBNODE_BLACK);
293 _gtk_rbnode_rotate_left (tree, node->parent);
299 GtkRBNode *w = node->parent->left;
300 if (GTK_RBNODE_GET_COLOR (w) == GTK_RBNODE_RED)
302 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_BLACK);
303 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_RED);
304 _gtk_rbnode_rotate_right (tree, node->parent);
305 w = node->parent->left;
307 if (GTK_RBNODE_GET_COLOR (w->right) == GTK_RBNODE_BLACK && GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK)
309 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
314 if (GTK_RBNODE_GET_COLOR (w->left) == GTK_RBNODE_BLACK)
316 GTK_RBNODE_SET_COLOR (w->right, GTK_RBNODE_BLACK);
317 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_RED);
318 _gtk_rbnode_rotate_left (tree, w);
319 w = node->parent->left;
321 GTK_RBNODE_SET_COLOR (w, GTK_RBNODE_GET_COLOR (node->parent));
322 GTK_RBNODE_SET_COLOR (node->parent, GTK_RBNODE_BLACK);
323 GTK_RBNODE_SET_COLOR (w->left, GTK_RBNODE_BLACK);
324 _gtk_rbnode_rotate_right (tree, node->parent);
329 GTK_RBNODE_SET_COLOR (node, GTK_RBNODE_BLACK);
333 _gtk_rbtree_new (void)
337 retval = g_new (GtkRBTree, 1);
338 retval->parent_tree = NULL;
339 retval->parent_node = NULL;
341 retval->nil = g_slice_new (GtkRBNode);
342 retval->nil->left = NULL;
343 retval->nil->right = NULL;
344 retval->nil->parent = NULL;
345 retval->nil->flags = GTK_RBNODE_BLACK;
346 retval->nil->count = 0;
347 retval->nil->offset = 0;
348 retval->nil->parity = 0;
350 retval->root = retval->nil;
355 _gtk_rbtree_free_helper (GtkRBTree *tree,
360 _gtk_rbtree_free (node->children);
362 _gtk_rbnode_free (node);
366 _gtk_rbtree_free (GtkRBTree *tree)
368 _gtk_rbtree_traverse (tree,
371 _gtk_rbtree_free_helper,
374 if (tree->parent_node &&
375 tree->parent_node->children == tree)
376 tree->parent_node->children = NULL;
377 _gtk_rbnode_free (tree->nil);
382 _gtk_rbtree_remove (GtkRBTree *tree)
387 gint height = tree->root->offset;
389 #ifdef G_ENABLE_DEBUG
390 if (gtk_debug_flags & GTK_DEBUG_TREE)
391 _gtk_rbtree_test (G_STRLOC, tree);
394 tmp_tree = tree->parent_tree;
395 tmp_node = tree->parent_node;
397 /* ugly hack to make _fixup_validation work in the first iteration of the
399 GTK_RBNODE_UNSET_FLAG (tree->root, GTK_RBNODE_DESCENDANTS_INVALID);
401 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
403 _fixup_validation (tmp_tree, tmp_node);
404 tmp_node->offset -= height;
406 /* If the removed tree was odd, flip all parents */
407 if (tree->root->parity)
408 tmp_node->parity = !tmp_node->parity;
410 tmp_node = tmp_node->parent;
411 if (tmp_node == tmp_tree->nil)
413 tmp_node = tmp_tree->parent_node;
414 tmp_tree = tmp_tree->parent_tree;
418 tmp_tree = tree->parent_tree;
419 tmp_node = tree->parent_node;
420 _gtk_rbtree_free (tree);
422 #ifdef G_ENABLE_DEBUG
423 if (gtk_debug_flags & GTK_DEBUG_TREE)
424 _gtk_rbtree_test (G_STRLOC, tmp_tree);
430 _gtk_rbtree_insert_after (GtkRBTree *tree,
436 gboolean right = TRUE;
440 #ifdef G_ENABLE_DEBUG
441 if (gtk_debug_flags & GTK_DEBUG_TREE)
443 g_print ("\n\n_gtk_rbtree_insert_after: %p\n", current);
444 _gtk_rbtree_debug_spew (tree);
445 _gtk_rbtree_test (G_STRLOC, tree);
447 #endif /* G_ENABLE_DEBUG */
449 if (current != NULL && current->right != tree->nil)
451 current = current->right;
452 while (current->left != tree->nil)
453 current = current->left;
457 node = _gtk_rbnode_new (tree, height);
458 node->parent = (current?current:tree->nil);
460 /* insert node in tree */
464 current->right = node;
466 current->left = node;
467 tmp_node = node->parent;
473 tmp_node = tree->parent_node;
474 tmp_tree = tree->parent_tree;
477 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
479 /* We only want to propagate the count if we are in the tree we
481 if (tmp_tree == tree)
484 tmp_node->parity += 1;
485 tmp_node->offset += height;
486 tmp_node = tmp_node->parent;
487 if (tmp_node == tmp_tree->nil)
489 tmp_node = tmp_tree->parent_node;
490 tmp_tree = tmp_tree->parent_tree;
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_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;
525 #ifdef G_ENABLE_DEBUG
526 if (gtk_debug_flags & GTK_DEBUG_TREE)
528 g_print ("\n\n_gtk_rbtree_insert_before: %p\n", current);
529 _gtk_rbtree_debug_spew (tree);
530 _gtk_rbtree_test (G_STRLOC, tree);
532 #endif /* G_ENABLE_DEBUG */
534 if (current != NULL && current->left != tree->nil)
536 current = current->left;
537 while (current->right != tree->nil)
538 current = current->right;
543 node = _gtk_rbnode_new (tree, height);
544 node->parent = (current?current:tree->nil);
546 /* insert node in tree */
550 current->left = node;
552 current->right = node;
553 tmp_node = node->parent;
559 tmp_node = tree->parent_node;
560 tmp_tree = tree->parent_tree;
563 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
565 /* We only want to propagate the count if we are in the tree we
567 if (tmp_tree == tree)
570 tmp_node->parity += 1;
571 tmp_node->offset += height;
572 tmp_node = tmp_node->parent;
573 if (tmp_node == tmp_tree->nil)
575 tmp_node = tmp_tree->parent_node;
576 tmp_tree = tmp_tree->parent_tree;
581 _gtk_rbtree_node_mark_valid (tree, node);
583 _gtk_rbtree_node_mark_invalid (tree, node);
585 _gtk_rbtree_insert_fixup (tree, node);
587 #ifdef G_ENABLE_DEBUG
588 if (gtk_debug_flags & GTK_DEBUG_TREE)
590 g_print ("_gtk_rbtree_insert_before finished...\n");
591 _gtk_rbtree_debug_spew (tree);
593 _gtk_rbtree_test (G_STRLOC, tree);
595 #endif /* G_ENABLE_DEBUG */
601 _gtk_rbtree_find_count (GtkRBTree *tree,
607 while (node != tree->nil && (node->left->count + 1 != count))
609 if (node->left->count >= count)
613 count -= (node->left->count + 1);
617 if (node == tree->nil)
623 _gtk_rbtree_node_set_height (GtkRBTree *tree,
627 gint diff = height - GTK_RBNODE_GET_HEIGHT (node);
628 GtkRBNode *tmp_node = node;
629 GtkRBTree *tmp_tree = tree;
634 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
636 tmp_node->offset += diff;
637 tmp_node = tmp_node->parent;
638 if (tmp_node == tmp_tree->nil)
640 tmp_node = tmp_tree->parent_node;
641 tmp_tree = tmp_tree->parent_tree;
644 #ifdef G_ENABLE_DEBUG
645 if (gtk_debug_flags & GTK_DEBUG_TREE)
646 _gtk_rbtree_test (G_STRLOC, tree);
651 _gtk_rbtree_node_mark_invalid (GtkRBTree *tree,
654 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))
657 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
660 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))
662 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
664 if (node == tree->nil)
666 node = tree->parent_node;
667 tree = tree->parent_tree;
674 /* Draconian version. */
676 _gtk_rbtree_node_mark_invalid (GtkRBTree *tree,
679 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
682 _fixup_validation (tree, node);
684 if (node == tree->nil)
686 node = tree->parent_node;
687 tree = tree->parent_tree;
695 _gtk_rbtree_node_mark_valid (GtkRBTree *tree,
698 if ((!GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)) &&
699 (!GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID)))
702 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_INVALID);
703 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
707 if ((GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)) ||
708 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID)) ||
709 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)) ||
710 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
711 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)))
714 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
716 if (node == tree->nil)
718 node = tree->parent_node;
719 tree = tree->parent_tree;
726 /* Draconian version */
728 _gtk_rbtree_node_mark_valid (GtkRBTree *tree,
731 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_INVALID);
732 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
736 _fixup_validation (tree, node);
738 if (node == tree->nil)
740 node = tree->parent_node;
741 tree = tree->parent_tree;
747 /* Assume tree is the root node as it doesn't set DESCENDANTS_INVALID above.
750 _gtk_rbtree_column_invalid (GtkRBTree *tree)
759 while (node->left != tree->nil)
764 if (! (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID)))
765 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_COLUMN_INVALID);
766 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
769 _gtk_rbtree_column_invalid (node->children);
771 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
775 _gtk_rbtree_mark_invalid (GtkRBTree *tree)
784 while (node->left != tree->nil)
789 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_INVALID);
790 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
793 _gtk_rbtree_mark_invalid (node->children);
795 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
799 _gtk_rbtree_set_fixed_height (GtkRBTree *tree,
811 while (node->left != tree->nil)
816 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))
818 _gtk_rbtree_node_set_height (tree, node, height);
820 _gtk_rbtree_node_mark_valid (tree, node);
824 _gtk_rbtree_set_fixed_height (node->children, height, mark_valid);
826 while ((node = _gtk_rbtree_next (tree, node)) != NULL);
829 typedef struct _GtkRBReorder
840 gtk_rbtree_reorder_sort_func (gconstpointer a,
843 return ((GtkRBReorder *) a)->order - ((GtkRBReorder *) b)->order;
847 gtk_rbtree_reorder_invert_func (gconstpointer a,
850 return ((GtkRBReorder *) a)->invert_order - ((GtkRBReorder *) b)->invert_order;
854 gtk_rbtree_reorder_fixup (GtkRBTree *tree,
857 if (node == tree->nil)
862 if (node->left != tree->nil)
864 gtk_rbtree_reorder_fixup (tree, node->left);
865 node->offset += node->left->offset;
866 node->parity += node->left->parity;
868 if (node->right != tree->nil)
870 gtk_rbtree_reorder_fixup (tree, node->right);
871 node->offset += node->right->offset;
872 node->parity += node->right->parity;
877 node->offset += node->children->root->offset;
878 node->parity += node->children->root->parity;
881 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
882 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
883 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
884 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)))
885 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
887 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
890 /* It basically pulls everything out of the tree, rearranges it, and puts it
891 * back together. Our strategy is to keep the old RBTree intact, and just
892 * rearrange the contents. When that is done, we go through and update the
893 * heights. There is probably a more elegant way to write this function. If
894 * anyone wants to spend the time writing it, patches will be accepted.
897 _gtk_rbtree_reorder (GtkRBTree *tree,
901 GtkRBReorder reorder = { NULL };
906 g_return_if_fail (tree != NULL);
907 g_return_if_fail (length > 0);
908 g_return_if_fail (tree->root->count == length);
910 /* Sort the trees values in the new tree. */
911 array = g_array_sized_new (FALSE, FALSE, sizeof (GtkRBReorder), length);
912 for (i = 0; i < length; i++)
914 reorder.order = new_order[i];
915 reorder.invert_order = i;
916 g_array_append_val (array, reorder);
919 g_array_sort(array, gtk_rbtree_reorder_sort_func);
923 while (node && node->left != tree->nil)
926 for (i = 0; i < length; i++)
928 g_assert (node != tree->nil);
929 g_array_index (array, GtkRBReorder, i).children = node->children;
930 g_array_index (array, GtkRBReorder, i).flags = GTK_RBNODE_NON_COLORS & node->flags;
931 g_array_index (array, GtkRBReorder, i).height = GTK_RBNODE_GET_HEIGHT (node);
933 node = _gtk_rbtree_next (tree, node);
936 g_array_sort (array, gtk_rbtree_reorder_invert_func);
940 while (node && node->left != tree->nil)
943 /* Go through the tree and change the values to the new ones. */
944 for (i = 0; i < length; i++)
946 reorder = g_array_index (array, GtkRBReorder, i);
947 node->children = reorder.children;
949 node->children->parent_node = node;
950 node->flags = GTK_RBNODE_GET_COLOR (node) | reorder.flags;
951 /* We temporarily set the height to this. */
952 node->offset = reorder.height;
953 node = _gtk_rbtree_next (tree, node);
955 gtk_rbtree_reorder_fixup (tree, tree->root);
957 g_array_free (array, TRUE);
962 _gtk_rbtree_node_find_offset (GtkRBTree *tree,
969 g_assert (node->left);
971 retval = node->left->offset;
973 while (tree && node && node != tree->nil)
978 /* Add left branch, plus children, iff we came from the right */
979 if (node->right == last)
980 retval += node->offset - node->right->offset;
982 if (node == tree->nil)
984 node = tree->parent_node;
985 tree = tree->parent_tree;
987 /* Add the parent node, plus the left branch. */
989 retval += node->left->offset + GTK_RBNODE_GET_HEIGHT (node);
996 _gtk_rbtree_node_find_parity (GtkRBTree *tree,
1003 g_assert (node->left);
1005 retval = node->left->parity;
1007 while (tree && node && node != tree->nil)
1010 node = node->parent;
1012 /* Add left branch, plus children, iff we came from the right */
1013 if (node->right == last)
1014 retval += node->parity - node->right->parity;
1016 if (node == tree->nil)
1018 node = tree->parent_node;
1019 tree = tree->parent_tree;
1021 /* Add the parent node, plus the left branch. */
1023 retval += node->left->parity + 1; /* 1 == GTK_RBNODE_GET_PARITY() */
1031 _gtk_rbtree_real_find_offset (GtkRBTree *tree,
1033 GtkRBTree **new_tree,
1034 GtkRBNode **new_node)
1036 GtkRBNode *tmp_node;
1049 tmp_node = tree->root;
1050 while (tmp_node != tree->nil &&
1051 (tmp_node->left->offset > height ||
1052 (tmp_node->offset - tmp_node->right->offset) < height))
1054 if (tmp_node->left->offset > height)
1055 tmp_node = tmp_node->left;
1058 height -= (tmp_node->offset - tmp_node->right->offset);
1059 tmp_node = tmp_node->right;
1062 if (tmp_node == tree->nil)
1068 if (tmp_node->children)
1070 if ((tmp_node->offset -
1071 tmp_node->right->offset -
1072 tmp_node->children->root->offset) > height)
1075 *new_node = tmp_node;
1076 return (height - tmp_node->left->offset);
1078 return _gtk_rbtree_real_find_offset (tmp_node->children,
1079 height - tmp_node->left->offset -
1081 tmp_node->left->offset -
1082 tmp_node->right->offset -
1083 tmp_node->children->root->offset),
1088 *new_node = tmp_node;
1089 return (height - tmp_node->left->offset);
1093 _gtk_rbtree_find_offset (GtkRBTree *tree,
1095 GtkRBTree **new_tree,
1096 GtkRBNode **new_node)
1101 (height >= tree->root->offset))
1108 return _gtk_rbtree_real_find_offset (tree, height, new_tree, new_node);
1112 _gtk_rbtree_remove_node (GtkRBTree *tree,
1116 GtkRBTree *tmp_tree;
1117 GtkRBNode *tmp_node;
1120 g_return_if_fail (tree != NULL);
1121 g_return_if_fail (node != NULL);
1124 #ifdef G_ENABLE_DEBUG
1125 if (gtk_debug_flags & GTK_DEBUG_TREE)
1127 g_print ("\n\n_gtk_rbtree_remove_node: %p\n", node);
1128 _gtk_rbtree_debug_spew (tree);
1129 _gtk_rbtree_test (G_STRLOC, tree);
1131 #endif /* G_ENABLE_DEBUG */
1133 /* make sure we're deleting a node that's actually in the tree */
1134 for (x = node; x->parent != tree->nil; x = x->parent)
1136 g_return_if_fail (x == tree->root);
1138 #ifdef G_ENABLE_DEBUG
1139 if (gtk_debug_flags & GTK_DEBUG_TREE)
1140 _gtk_rbtree_test (G_STRLOC, tree);
1143 if (node->left == tree->nil || node->right == tree->nil)
1151 while (y->left != tree->nil)
1155 /* adjust count only beneath tree */
1156 for (x = y; x != tree->nil; x = x->parent)
1161 /* offsets and parity adjust all the way up through parent trees */
1162 y_height = GTK_RBNODE_GET_HEIGHT (y);
1166 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
1168 tmp_node->offset -= (y_height + (y->children?y->children->root->offset:0));
1169 _fixup_validation (tmp_tree, tmp_node);
1170 _fixup_parity (tmp_tree, tmp_node);
1171 tmp_node = tmp_node->parent;
1172 if (tmp_node == tmp_tree->nil)
1174 tmp_node = tmp_tree->parent_node;
1175 tmp_tree = tmp_tree->parent_tree;
1179 /* x is y's only child, or nil */
1180 if (y->left != tree->nil)
1185 /* remove y from the parent chain */
1186 x->parent = y->parent;
1187 if (y->parent != tree->nil)
1189 if (y == y->parent->left)
1190 y->parent->left = x;
1192 y->parent->right = x;
1199 /* We need to clean up the validity of the tree.
1206 /* We skip the first time, iff x is nil */
1207 if (tmp_node != tmp_tree->nil)
1209 _fixup_validation (tmp_tree, tmp_node);
1210 _fixup_parity (tmp_tree, tmp_node);
1212 tmp_node = tmp_node->parent;
1213 if (tmp_node == tmp_tree->nil)
1215 tmp_node = tmp_tree->parent_node;
1216 tmp_tree = tmp_tree->parent_tree;
1219 while (tmp_tree != NULL);
1225 /* Copy the node over */
1226 if (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)
1227 node->flags = ((y->flags & (GTK_RBNODE_NON_COLORS)) | GTK_RBNODE_BLACK);
1229 node->flags = ((y->flags & (GTK_RBNODE_NON_COLORS)) | GTK_RBNODE_RED);
1230 node->children = y->children;
1233 node->children = y->children;
1234 node->children->parent_node = node;
1238 node->children = NULL;
1240 _fixup_validation (tree, node);
1241 _fixup_parity (tree, node);
1242 /* We want to see how different our height is from the previous node.
1243 * To do this, we compare our current height with our supposed height.
1245 diff = y_height - GTK_RBNODE_GET_HEIGHT (node);
1249 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
1251 tmp_node->offset += diff;
1252 _fixup_validation (tmp_tree, tmp_node);
1253 _fixup_parity (tmp_tree, tmp_node);
1254 tmp_node = tmp_node->parent;
1255 if (tmp_node == tmp_tree->nil)
1257 tmp_node = tmp_tree->parent_node;
1258 tmp_tree = tmp_tree->parent_tree;
1263 if (GTK_RBNODE_GET_COLOR (y) == GTK_RBNODE_BLACK)
1264 _gtk_rbtree_remove_node_fixup (tree, x);
1265 _gtk_rbnode_free (y);
1267 #ifdef G_ENABLE_DEBUG
1268 if (gtk_debug_flags & GTK_DEBUG_TREE)
1270 g_print ("_gtk_rbtree_remove_node finished...\n");
1271 _gtk_rbtree_debug_spew (tree);
1273 _gtk_rbtree_test (G_STRLOC, tree);
1275 #endif /* G_ENABLE_DEBUG */
1279 _gtk_rbtree_next (GtkRBTree *tree,
1282 g_return_val_if_fail (tree != NULL, NULL);
1283 g_return_val_if_fail (node != NULL, NULL);
1285 /* Case 1: the node's below us. */
1286 if (node->right != tree->nil)
1289 while (node->left != tree->nil)
1294 /* Case 2: it's an ancestor */
1295 while (node->parent != tree->nil)
1297 if (node->parent->right == node)
1298 node = node->parent;
1300 return (node->parent);
1303 /* Case 3: There is no next node */
1308 _gtk_rbtree_prev (GtkRBTree *tree,
1311 g_return_val_if_fail (tree != NULL, NULL);
1312 g_return_val_if_fail (node != NULL, NULL);
1314 /* Case 1: the node's below us. */
1315 if (node->left != tree->nil)
1318 while (node->right != tree->nil)
1323 /* Case 2: it's an ancestor */
1324 while (node->parent != tree->nil)
1326 if (node->parent->left == node)
1327 node = node->parent;
1329 return (node->parent);
1332 /* Case 3: There is no next node */
1337 _gtk_rbtree_next_full (GtkRBTree *tree,
1339 GtkRBTree **new_tree,
1340 GtkRBNode **new_node)
1342 g_return_if_fail (tree != NULL);
1343 g_return_if_fail (node != NULL);
1344 g_return_if_fail (new_tree != NULL);
1345 g_return_if_fail (new_node != NULL);
1349 *new_tree = node->children;
1350 *new_node = (*new_tree)->root;
1351 while ((*new_node)->left != (*new_tree)->nil)
1352 *new_node = (*new_node)->left;
1357 *new_node = _gtk_rbtree_next (tree, node);
1359 while ((*new_node == NULL) &&
1360 (*new_tree != NULL))
1362 *new_node = (*new_tree)->parent_node;
1363 *new_tree = (*new_tree)->parent_tree;
1365 *new_node = _gtk_rbtree_next (*new_tree, *new_node);
1370 _gtk_rbtree_prev_full (GtkRBTree *tree,
1372 GtkRBTree **new_tree,
1373 GtkRBNode **new_node)
1375 g_return_if_fail (tree != NULL);
1376 g_return_if_fail (node != NULL);
1377 g_return_if_fail (new_tree != NULL);
1378 g_return_if_fail (new_node != NULL);
1381 *new_node = _gtk_rbtree_prev (tree, node);
1383 if (*new_node == NULL)
1385 *new_node = (*new_tree)->parent_node;
1386 *new_tree = (*new_tree)->parent_tree;
1390 while ((*new_node)->children)
1392 *new_tree = (*new_node)->children;
1393 *new_node = (*new_tree)->root;
1394 while ((*new_node)->right != (*new_tree)->nil)
1395 *new_node = (*new_node)->right;
1401 _gtk_rbtree_get_depth (GtkRBTree *tree)
1403 GtkRBTree *tmp_tree;
1406 tmp_tree = tree->parent_tree;
1410 tmp_tree = tmp_tree->parent_tree;
1417 _gtk_rbtree_traverse_pre_order (GtkRBTree *tree,
1419 GtkRBTreeTraverseFunc func,
1422 if (node == tree->nil)
1425 (* func) (tree, node, data);
1426 _gtk_rbtree_traverse_pre_order (tree, node->left, func, data);
1427 _gtk_rbtree_traverse_pre_order (tree, node->right, func, data);
1431 _gtk_rbtree_traverse_post_order (GtkRBTree *tree,
1433 GtkRBTreeTraverseFunc func,
1436 if (node == tree->nil)
1439 _gtk_rbtree_traverse_post_order (tree, node->left, func, data);
1440 _gtk_rbtree_traverse_post_order (tree, node->right, func, data);
1441 (* func) (tree, node, data);
1445 _gtk_rbtree_traverse (GtkRBTree *tree,
1447 GTraverseType order,
1448 GtkRBTreeTraverseFunc func,
1451 g_return_if_fail (tree != NULL);
1452 g_return_if_fail (node != NULL);
1453 g_return_if_fail (func != NULL);
1454 g_return_if_fail (order <= G_LEVEL_ORDER);
1459 _gtk_rbtree_traverse_pre_order (tree, node, func, data);
1462 _gtk_rbtree_traverse_post_order (tree, node, func, data);
1467 g_warning ("unsupported traversal order.");
1473 _count_nodes (GtkRBTree *tree,
1477 if (node == tree->nil)
1480 g_assert (node->left);
1481 g_assert (node->right);
1483 res = (_count_nodes (tree, node->left) +
1484 _count_nodes (tree, node->right) + 1);
1486 if (res != node->count)
1487 g_print ("Tree failed\n");
1492 void _fixup_validation (GtkRBTree *tree,
1495 if (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
1496 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
1497 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1498 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1499 (node->children != NULL && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)))
1501 GTK_RBNODE_SET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
1505 GTK_RBNODE_UNSET_FLAG (node, GTK_RBNODE_DESCENDANTS_INVALID);
1510 void _fixup_parity (GtkRBTree *tree,
1514 ((node->children != NULL && node->children->root != node->children->nil) ? node->children->root->parity : 0) +
1515 ((node->left != tree->nil) ? node->left->parity : 0) +
1516 ((node->right != tree->nil) ? node->right->parity : 0);
1519 #ifdef G_ENABLE_DEBUG
1521 get_parity (GtkRBNode *node)
1523 guint child_total = 0;
1526 /* The parity of a node is node->parity minus
1527 * the parity of left, right, and children.
1529 * This is equivalent to saying that if left, right, children
1530 * sum to 0 parity, then node->parity is the parity of node,
1531 * and if left, right, children are odd parity, then
1532 * node->parity is the reverse of the node's parity.
1535 child_total += (guint) node->left->parity;
1536 child_total += (guint) node->right->parity;
1539 child_total += (guint) node->children->root->parity;
1541 rem = child_total % 2;
1544 return node->parity;
1546 return !node->parity;
1550 count_parity (GtkRBTree *tree,
1555 if (node == tree->nil)
1559 count_parity (tree, node->left) +
1560 count_parity (tree, node->right) +
1562 (node->children ? count_parity (node->children, node->children->root) : 0);
1564 res = res % (guint)2;
1566 if (res != node->parity)
1567 g_print ("parity incorrect for node\n");
1569 if (get_parity (node) != 1)
1570 g_error ("Node has incorrect parity %u", get_parity (node));
1576 _gtk_rbtree_test_height (GtkRBTree *tree,
1579 gint computed_offset = 0;
1581 /* This whole test is sort of a useless truism. */
1583 if (node->left != tree->nil)
1584 computed_offset += node->left->offset;
1586 if (node->right != tree->nil)
1587 computed_offset += node->right->offset;
1589 if (node->children && node->children->root != node->children->nil)
1590 computed_offset += node->children->root->offset;
1592 if (GTK_RBNODE_GET_HEIGHT (node) + computed_offset != node->offset)
1593 g_error ("node has broken offset\n");
1595 if (node->left != tree->nil)
1596 _gtk_rbtree_test_height (tree, node->left);
1598 if (node->right != tree->nil)
1599 _gtk_rbtree_test_height (tree, node->right);
1601 if (node->children && node->children->root != node->children->nil)
1602 _gtk_rbtree_test_height (node->children, node->children->root);
1606 _gtk_rbtree_test_dirty (GtkRBTree *tree,
1608 gint expected_dirtyness)
1611 if (expected_dirtyness)
1613 g_assert (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
1614 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
1615 (node->left != tree->nil && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1616 (node->right != tree->nil && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
1617 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)));
1621 g_assert (! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) &&
1622 ! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID));
1623 if (node->left != tree->nil)
1624 g_assert (! GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
1625 if (node->right != tree->nil)
1626 g_assert (! GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
1627 if (node->children != NULL)
1628 g_assert (! GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
1631 if (node->left != tree->nil)
1632 _gtk_rbtree_test_dirty (tree, node->left, GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
1633 if (node->right != tree->nil)
1634 _gtk_rbtree_test_dirty (tree, node->right, GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
1635 if (node->children != NULL && node->children->root != node->children->nil)
1636 _gtk_rbtree_test_dirty (node->children, node->children->root, GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
1639 static void _gtk_rbtree_test_structure (GtkRBTree *tree);
1642 _gtk_rbtree_test_structure_helper (GtkRBTree *tree,
1645 g_assert (node != tree->nil);
1647 g_assert (node->left != NULL);
1648 g_assert (node->right != NULL);
1649 g_assert (node->parent != NULL);
1651 if (node->left != tree->nil)
1653 g_assert (node->left->parent == node);
1654 _gtk_rbtree_test_structure_helper (tree, node->left);
1656 if (node->right != tree->nil)
1658 g_assert (node->right->parent == node);
1659 _gtk_rbtree_test_structure_helper (tree, node->right);
1662 if (node->children != NULL)
1664 g_assert (node->children->parent_tree == tree);
1665 g_assert (node->children->parent_node == node);
1667 _gtk_rbtree_test_structure (node->children);
1671 _gtk_rbtree_test_structure (GtkRBTree *tree)
1673 g_assert (tree->root);
1674 if (tree->root == tree->nil)
1677 g_assert (tree->root->parent == tree->nil);
1678 _gtk_rbtree_test_structure_helper (tree, tree->root);
1682 _gtk_rbtree_test (const gchar *where,
1685 GtkRBTree *tmp_tree;
1690 /* Test the entire tree */
1692 while (tmp_tree->parent_tree)
1693 tmp_tree = tmp_tree->parent_tree;
1695 g_assert (tmp_tree->nil != NULL);
1697 if (tmp_tree->root == tmp_tree->nil)
1700 _gtk_rbtree_test_structure (tmp_tree);
1702 g_assert ((_count_nodes (tmp_tree, tmp_tree->root->left) +
1703 _count_nodes (tmp_tree, tmp_tree->root->right) + 1) == tmp_tree->root->count);
1706 _gtk_rbtree_test_height (tmp_tree, tmp_tree->root);
1707 _gtk_rbtree_test_dirty (tmp_tree, tmp_tree->root, GTK_RBNODE_FLAG_SET (tmp_tree->root, GTK_RBNODE_DESCENDANTS_INVALID));
1708 g_assert (count_parity (tmp_tree, tmp_tree->root) == tmp_tree->root->parity);
1712 _gtk_rbtree_debug_spew_helper (GtkRBTree *tree,
1717 for (i = 0; i < depth; i++)
1720 g_print ("(%p - %s) (Offset %d) (Parity %d) (Validity %d%d%d)\n",
1722 (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)?"BLACK":" RED ",
1725 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))?1:0,
1726 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))?1:0,
1727 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID))?1:0);
1728 if (node->children != NULL)
1730 g_print ("Looking at child.\n");
1731 _gtk_rbtree_debug_spew (node->children);
1732 g_print ("Done looking at child.\n");
1734 if (node->left != tree->nil)
1736 _gtk_rbtree_debug_spew_helper (tree, node->left, depth+1);
1738 if (node->right != tree->nil)
1740 _gtk_rbtree_debug_spew_helper (tree, node->right, depth+1);
1745 _gtk_rbtree_debug_spew (GtkRBTree *tree)
1747 g_return_if_fail (tree != NULL);
1749 if (tree->root == tree->nil)
1750 g_print ("Empty tree...\n");
1752 _gtk_rbtree_debug_spew_helper (tree, tree->root, 0);
1754 #endif /* G_ENABLE_DEBUG */