2 * Copyright (C) 2000, 2011 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.
24 #include "ui/gui/pspp-rb-tree.h"
26 static GtkRBNode * _pspp_rbnode_new (GtkRBTree *tree,
28 static void _pspp_rbnode_free (GtkRBNode *node);
29 static void _pspp_rbnode_rotate_left (GtkRBTree *tree,
31 static void _pspp_rbnode_rotate_right (GtkRBTree *tree,
33 static void _pspp_rbtree_insert_fixup (GtkRBTree *tree,
35 static void _pspp_rbtree_remove_node_fixup (GtkRBTree *tree,
37 static inline void _fixup_validation (GtkRBTree *tree,
39 static inline void _fixup_parity (GtkRBTree *tree,
45 _pspp_rbnode_new (GtkRBTree *tree,
48 GtkRBNode *node = g_slice_new (GtkRBNode);
50 node->left = tree->nil;
51 node->right = tree->nil;
52 node->parent = tree->nil;
53 node->flags = PSPP_RBNODE_RED;
56 node->children = NULL;
57 node->offset = height;
62 _pspp_rbnode_free (GtkRBNode *node)
64 if (gtk_debug_flags & GTK_DEBUG_TREE)
66 node->left = (gpointer) 0xdeadbeef;
67 node->right = (gpointer) 0xdeadbeef;
68 node->parent = (gpointer) 0xdeadbeef;
73 g_slice_free (GtkRBNode, node);
77 _pspp_rbnode_rotate_left (GtkRBTree *tree,
80 gint node_height, right_height;
81 GtkRBNode *right = node->right;
83 g_return_if_fail (node != tree->nil);
85 node_height = node->offset -
86 (node->left?node->left->offset:0) -
87 (node->right?node->right->offset:0) -
88 (node->children?node->children->root->offset:0);
89 right_height = right->offset -
90 (right->left?right->left->offset:0) -
91 (right->right?right->right->offset:0) -
92 (right->children?right->children->root->offset:0);
93 node->right = right->left;
94 if (right->left != tree->nil)
95 right->left->parent = node;
97 if (right != tree->nil)
98 right->parent = node->parent;
99 if (node->parent != tree->nil)
101 if (node == node->parent->left)
102 node->parent->left = right;
104 node->parent->right = right;
110 if (node != tree->nil)
111 node->parent = right;
113 node->count = 1 + (node->left?node->left->count:0) +
114 (node->right?node->right->count:0);
115 right->count = 1 + (right->left?right->left->count:0) +
116 (right->right?right->right->count:0);
118 node->offset = node_height +
119 (node->left?node->left->offset:0) +
120 (node->right?node->right->offset:0) +
121 (node->children?node->children->root->offset:0);
122 right->offset = right_height +
123 (right->left?right->left->offset:0) +
124 (right->right?right->right->offset:0) +
125 (right->children?right->children->root->offset:0);
127 _fixup_validation (tree, node);
128 _fixup_validation (tree, right);
129 _fixup_parity (tree, node);
130 _fixup_parity (tree, right);
134 _pspp_rbnode_rotate_right (GtkRBTree *tree,
137 gint node_height, left_height;
138 GtkRBNode *left = node->left;
140 g_return_if_fail (node != tree->nil);
142 node_height = node->offset -
143 (node->left?node->left->offset:0) -
144 (node->right?node->right->offset:0) -
145 (node->children?node->children->root->offset:0);
146 left_height = left->offset -
147 (left->left?left->left->offset:0) -
148 (left->right?left->right->offset:0) -
149 (left->children?left->children->root->offset:0);
151 node->left = left->right;
152 if (left->right != tree->nil)
153 left->right->parent = node;
155 if (left != tree->nil)
156 left->parent = node->parent;
157 if (node->parent != tree->nil)
159 if (node == node->parent->right)
160 node->parent->right = left;
162 node->parent->left = left;
169 /* link node and left */
171 if (node != tree->nil)
174 node->count = 1 + (node->left?node->left->count:0) +
175 (node->right?node->right->count:0);
176 left->count = 1 + (left->left?left->left->count:0) +
177 (left->right?left->right->count:0);
179 node->offset = node_height +
180 (node->left?node->left->offset:0) +
181 (node->right?node->right->offset:0) +
182 (node->children?node->children->root->offset:0);
183 left->offset = left_height +
184 (left->left?left->left->offset:0) +
185 (left->right?left->right->offset:0) +
186 (left->children?left->children->root->offset:0);
188 _fixup_validation (tree, node);
189 _fixup_validation (tree, left);
190 _fixup_parity (tree, node);
191 _fixup_parity (tree, left);
195 _pspp_rbtree_insert_fixup (GtkRBTree *tree,
199 /* check Red-Black properties */
200 while (node != tree->root && PSPP_RBNODE_GET_COLOR (node->parent) == PSPP_RBNODE_RED)
202 /* we have a violation */
203 if (node->parent == node->parent->parent->left)
205 GtkRBNode *y = node->parent->parent->right;
206 if (PSPP_RBNODE_GET_COLOR (y) == PSPP_RBNODE_RED)
208 /* uncle is PSPP_RBNODE_RED */
209 PSPP_RBNODE_SET_COLOR (node->parent, PSPP_RBNODE_BLACK);
210 PSPP_RBNODE_SET_COLOR (y, PSPP_RBNODE_BLACK);
211 PSPP_RBNODE_SET_COLOR (node->parent->parent, PSPP_RBNODE_RED);
212 node = node->parent->parent;
216 /* uncle is PSPP_RBNODE_BLACK */
217 if (node == node->parent->right)
219 /* make node a left child */
221 _pspp_rbnode_rotate_left (tree, node);
224 /* recolor and rotate */
225 PSPP_RBNODE_SET_COLOR (node->parent, PSPP_RBNODE_BLACK);
226 PSPP_RBNODE_SET_COLOR (node->parent->parent, PSPP_RBNODE_RED);
227 _pspp_rbnode_rotate_right(tree, node->parent->parent);
232 /* mirror image of above code */
233 GtkRBNode *y = node->parent->parent->left;
234 if (PSPP_RBNODE_GET_COLOR (y) == PSPP_RBNODE_RED)
236 /* uncle is PSPP_RBNODE_RED */
237 PSPP_RBNODE_SET_COLOR (node->parent, PSPP_RBNODE_BLACK);
238 PSPP_RBNODE_SET_COLOR (y, PSPP_RBNODE_BLACK);
239 PSPP_RBNODE_SET_COLOR (node->parent->parent, PSPP_RBNODE_RED);
240 node = node->parent->parent;
244 /* uncle is PSPP_RBNODE_BLACK */
245 if (node == node->parent->left)
248 _pspp_rbnode_rotate_right (tree, node);
250 PSPP_RBNODE_SET_COLOR (node->parent, PSPP_RBNODE_BLACK);
251 PSPP_RBNODE_SET_COLOR (node->parent->parent, PSPP_RBNODE_RED);
252 _pspp_rbnode_rotate_left (tree, node->parent->parent);
256 PSPP_RBNODE_SET_COLOR (tree->root, PSPP_RBNODE_BLACK);
260 _pspp_rbtree_remove_node_fixup (GtkRBTree *tree,
263 while (node != tree->root && PSPP_RBNODE_GET_COLOR (node) == PSPP_RBNODE_BLACK)
265 if (node == node->parent->left)
267 GtkRBNode *w = node->parent->right;
268 if (PSPP_RBNODE_GET_COLOR (w) == PSPP_RBNODE_RED)
270 PSPP_RBNODE_SET_COLOR (w, PSPP_RBNODE_BLACK);
271 PSPP_RBNODE_SET_COLOR (node->parent, PSPP_RBNODE_RED);
272 _pspp_rbnode_rotate_left (tree, node->parent);
273 w = node->parent->right;
275 if (PSPP_RBNODE_GET_COLOR (w->left) == PSPP_RBNODE_BLACK && PSPP_RBNODE_GET_COLOR (w->right) == PSPP_RBNODE_BLACK)
277 PSPP_RBNODE_SET_COLOR (w, PSPP_RBNODE_RED);
282 if (PSPP_RBNODE_GET_COLOR (w->right) == PSPP_RBNODE_BLACK)
284 PSPP_RBNODE_SET_COLOR (w->left, PSPP_RBNODE_BLACK);
285 PSPP_RBNODE_SET_COLOR (w, PSPP_RBNODE_RED);
286 _pspp_rbnode_rotate_right (tree, w);
287 w = node->parent->right;
289 PSPP_RBNODE_SET_COLOR (w, PSPP_RBNODE_GET_COLOR (node->parent));
290 PSPP_RBNODE_SET_COLOR (node->parent, PSPP_RBNODE_BLACK);
291 PSPP_RBNODE_SET_COLOR (w->right, PSPP_RBNODE_BLACK);
292 _pspp_rbnode_rotate_left (tree, node->parent);
298 GtkRBNode *w = node->parent->left;
299 if (PSPP_RBNODE_GET_COLOR (w) == PSPP_RBNODE_RED)
301 PSPP_RBNODE_SET_COLOR (w, PSPP_RBNODE_BLACK);
302 PSPP_RBNODE_SET_COLOR (node->parent, PSPP_RBNODE_RED);
303 _pspp_rbnode_rotate_right (tree, node->parent);
304 w = node->parent->left;
306 if (PSPP_RBNODE_GET_COLOR (w->right) == PSPP_RBNODE_BLACK && PSPP_RBNODE_GET_COLOR (w->left) == PSPP_RBNODE_BLACK)
308 PSPP_RBNODE_SET_COLOR (w, PSPP_RBNODE_RED);
313 if (PSPP_RBNODE_GET_COLOR (w->left) == PSPP_RBNODE_BLACK)
315 PSPP_RBNODE_SET_COLOR (w->right, PSPP_RBNODE_BLACK);
316 PSPP_RBNODE_SET_COLOR (w, PSPP_RBNODE_RED);
317 _pspp_rbnode_rotate_left (tree, w);
318 w = node->parent->left;
320 PSPP_RBNODE_SET_COLOR (w, PSPP_RBNODE_GET_COLOR (node->parent));
321 PSPP_RBNODE_SET_COLOR (node->parent, PSPP_RBNODE_BLACK);
322 PSPP_RBNODE_SET_COLOR (w->left, PSPP_RBNODE_BLACK);
323 _pspp_rbnode_rotate_right (tree, node->parent);
328 PSPP_RBNODE_SET_COLOR (node, PSPP_RBNODE_BLACK);
332 _pspp_rbtree_new (void)
336 retval = g_new (GtkRBTree, 1);
337 retval->parent_tree = NULL;
338 retval->parent_node = NULL;
340 retval->nil = g_slice_new (GtkRBNode);
341 retval->nil->left = NULL;
342 retval->nil->right = NULL;
343 retval->nil->parent = NULL;
344 retval->nil->flags = PSPP_RBNODE_BLACK;
345 retval->nil->count = 0;
346 retval->nil->offset = 0;
347 retval->nil->parity = 0;
349 retval->root = retval->nil;
354 _pspp_rbtree_free_helper (GtkRBTree *tree,
359 _pspp_rbtree_free (node->children);
361 _pspp_rbnode_free (node);
365 _pspp_rbtree_free (GtkRBTree *tree)
367 _pspp_rbtree_traverse (tree,
370 _pspp_rbtree_free_helper,
373 if (tree->parent_node &&
374 tree->parent_node->children == tree)
375 tree->parent_node->children = NULL;
376 _pspp_rbnode_free (tree->nil);
381 _pspp_rbtree_remove (GtkRBTree *tree)
386 gint height = tree->root->offset;
388 #ifdef G_ENABLE_DEBUG
389 if (gtk_debug_flags & GTK_DEBUG_TREE)
390 _pspp_rbtree_test (G_STRLOC, tree);
393 tmp_tree = tree->parent_tree;
394 tmp_node = tree->parent_node;
396 /* ugly hack to make _fixup_validation work in the first iteration of the
398 PSPP_RBNODE_UNSET_FLAG (tree->root, PSPP_RBNODE_DESCENDANTS_INVALID);
400 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
402 _fixup_validation (tmp_tree, tmp_node);
403 tmp_node->offset -= height;
405 /* If the removed tree was odd, flip all parents */
406 if (tree->root->parity)
407 tmp_node->parity = !tmp_node->parity;
409 tmp_node = tmp_node->parent;
410 if (tmp_node == tmp_tree->nil)
412 tmp_node = tmp_tree->parent_node;
413 tmp_tree = tmp_tree->parent_tree;
417 tmp_tree = tree->parent_tree;
418 tmp_node = tree->parent_node;
419 _pspp_rbtree_free (tree);
421 #ifdef G_ENABLE_DEBUG
422 if (gtk_debug_flags & GTK_DEBUG_TREE)
423 _pspp_rbtree_test (G_STRLOC, tmp_tree);
429 _pspp_rbtree_insert_after (GtkRBTree *tree,
435 gboolean right = TRUE;
439 #ifdef G_ENABLE_DEBUG
440 if (gtk_debug_flags & GTK_DEBUG_TREE)
442 g_print ("\n\n_pspp_rbtree_insert_after: %p\n", current);
443 _pspp_rbtree_debug_spew (tree);
444 _pspp_rbtree_test (G_STRLOC, tree);
446 #endif /* G_ENABLE_DEBUG */
448 if (current != NULL && current->right != tree->nil)
450 current = current->right;
451 while (current->left != tree->nil)
452 current = current->left;
456 node = _pspp_rbnode_new (tree, height);
457 node->parent = (current?current:tree->nil);
459 /* insert node in tree */
463 current->right = node;
465 current->left = node;
466 tmp_node = node->parent;
472 tmp_node = tree->parent_node;
473 tmp_tree = tree->parent_tree;
476 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
478 /* We only want to propagate the count if we are in the tree we
480 if (tmp_tree == tree)
483 tmp_node->parity += 1;
484 tmp_node->offset += height;
485 tmp_node = tmp_node->parent;
486 if (tmp_node == tmp_tree->nil)
488 tmp_node = tmp_tree->parent_node;
489 tmp_tree = tmp_tree->parent_tree;
494 _pspp_rbtree_node_mark_valid (tree, node);
496 _pspp_rbtree_node_mark_invalid (tree, node);
498 _pspp_rbtree_insert_fixup (tree, node);
500 #ifdef G_ENABLE_DEBUG
501 if (gtk_debug_flags & GTK_DEBUG_TREE)
503 g_print ("_pspp_rbtree_insert_after finished...\n");
504 _pspp_rbtree_debug_spew (tree);
506 _pspp_rbtree_test (G_STRLOC, tree);
508 #endif /* G_ENABLE_DEBUG */
514 _pspp_rbtree_insert_before (GtkRBTree *tree,
520 gboolean left = TRUE;
524 #ifdef G_ENABLE_DEBUG
525 if (gtk_debug_flags & GTK_DEBUG_TREE)
527 g_print ("\n\n_pspp_rbtree_insert_before: %p\n", current);
528 _pspp_rbtree_debug_spew (tree);
529 _pspp_rbtree_test (G_STRLOC, tree);
531 #endif /* G_ENABLE_DEBUG */
533 if (current != NULL && current->left != tree->nil)
535 current = current->left;
536 while (current->right != tree->nil)
537 current = current->right;
542 node = _pspp_rbnode_new (tree, height);
543 node->parent = (current?current:tree->nil);
545 /* insert node in tree */
549 current->left = node;
551 current->right = node;
552 tmp_node = node->parent;
558 tmp_node = tree->parent_node;
559 tmp_tree = tree->parent_tree;
562 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
564 /* We only want to propagate the count if we are in the tree we
566 if (tmp_tree == tree)
569 tmp_node->parity += 1;
570 tmp_node->offset += height;
571 tmp_node = tmp_node->parent;
572 if (tmp_node == tmp_tree->nil)
574 tmp_node = tmp_tree->parent_node;
575 tmp_tree = tmp_tree->parent_tree;
580 _pspp_rbtree_node_mark_valid (tree, node);
582 _pspp_rbtree_node_mark_invalid (tree, node);
584 _pspp_rbtree_insert_fixup (tree, node);
586 #ifdef G_ENABLE_DEBUG
587 if (gtk_debug_flags & GTK_DEBUG_TREE)
589 g_print ("_pspp_rbtree_insert_before finished...\n");
590 _pspp_rbtree_debug_spew (tree);
592 _pspp_rbtree_test (G_STRLOC, tree);
594 #endif /* G_ENABLE_DEBUG */
600 _pspp_rbtree_find_count (GtkRBTree *tree,
606 while (node != tree->nil && (node->left->count + 1 != count))
608 if (node->left->count >= count)
612 count -= (node->left->count + 1);
616 if (node == tree->nil)
622 _pspp_rbtree_node_set_height (GtkRBTree *tree,
626 gint diff = height - PSPP_RBNODE_GET_HEIGHT (node);
627 GtkRBNode *tmp_node = node;
628 GtkRBTree *tmp_tree = tree;
633 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
635 tmp_node->offset += diff;
636 tmp_node = tmp_node->parent;
637 if (tmp_node == tmp_tree->nil)
639 tmp_node = tmp_tree->parent_node;
640 tmp_tree = tmp_tree->parent_tree;
643 #ifdef G_ENABLE_DEBUG
644 if (gtk_debug_flags & GTK_DEBUG_TREE)
645 _pspp_rbtree_test (G_STRLOC, tree);
650 _pspp_rbtree_node_mark_invalid (GtkRBTree *tree,
653 if (PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_INVALID))
656 PSPP_RBNODE_SET_FLAG (node, PSPP_RBNODE_INVALID);
659 if (PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_DESCENDANTS_INVALID))
661 PSPP_RBNODE_SET_FLAG (node, PSPP_RBNODE_DESCENDANTS_INVALID);
663 if (node == tree->nil)
665 node = tree->parent_node;
666 tree = tree->parent_tree;
673 /* Draconian version. */
675 _pspp_rbtree_node_mark_invalid (GtkRBTree *tree,
678 PSPP_RBNODE_SET_FLAG (node, PSPP_RBNODE_INVALID);
681 _fixup_validation (tree, node);
683 if (node == tree->nil)
685 node = tree->parent_node;
686 tree = tree->parent_tree;
694 _pspp_rbtree_node_mark_valid (GtkRBTree *tree,
697 if ((!PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_INVALID)) &&
698 (!PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_COLUMN_INVALID)))
701 PSPP_RBNODE_UNSET_FLAG (node, PSPP_RBNODE_INVALID);
702 PSPP_RBNODE_UNSET_FLAG (node, PSPP_RBNODE_COLUMN_INVALID);
706 if ((PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_INVALID)) ||
707 (PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_COLUMN_INVALID)) ||
708 (node->children && PSPP_RBNODE_FLAG_SET (node->children->root, PSPP_RBNODE_DESCENDANTS_INVALID)) ||
709 (node->left != tree->nil && PSPP_RBNODE_FLAG_SET (node->left, PSPP_RBNODE_DESCENDANTS_INVALID)) ||
710 (node->right != tree->nil && PSPP_RBNODE_FLAG_SET (node->right, PSPP_RBNODE_DESCENDANTS_INVALID)))
713 PSPP_RBNODE_UNSET_FLAG (node, PSPP_RBNODE_DESCENDANTS_INVALID);
715 if (node == tree->nil)
717 node = tree->parent_node;
718 tree = tree->parent_tree;
725 /* Draconian version */
727 _pspp_rbtree_node_mark_valid (GtkRBTree *tree,
730 PSPP_RBNODE_UNSET_FLAG (node, PSPP_RBNODE_INVALID);
731 PSPP_RBNODE_UNSET_FLAG (node, PSPP_RBNODE_COLUMN_INVALID);
735 _fixup_validation (tree, node);
737 if (node == tree->nil)
739 node = tree->parent_node;
740 tree = tree->parent_tree;
746 /* Assume tree is the root node as it doesn't set DESCENDANTS_INVALID above.
749 _pspp_rbtree_column_invalid (GtkRBTree *tree)
758 while (node->left != tree->nil)
763 if (! (PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_INVALID)))
764 PSPP_RBNODE_SET_FLAG (node, PSPP_RBNODE_COLUMN_INVALID);
765 PSPP_RBNODE_SET_FLAG (node, PSPP_RBNODE_DESCENDANTS_INVALID);
768 _pspp_rbtree_column_invalid (node->children);
770 while ((node = _pspp_rbtree_next (tree, node)) != NULL);
774 _pspp_rbtree_mark_invalid (GtkRBTree *tree)
783 while (node->left != tree->nil)
788 PSPP_RBNODE_SET_FLAG (node, PSPP_RBNODE_INVALID);
789 PSPP_RBNODE_SET_FLAG (node, PSPP_RBNODE_DESCENDANTS_INVALID);
792 _pspp_rbtree_mark_invalid (node->children);
794 while ((node = _pspp_rbtree_next (tree, node)) != NULL);
798 _pspp_rbtree_set_fixed_height (GtkRBTree *tree,
810 while (node->left != tree->nil)
815 if (PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_INVALID))
817 _pspp_rbtree_node_set_height (tree, node, height);
819 _pspp_rbtree_node_mark_valid (tree, node);
823 _pspp_rbtree_set_fixed_height (node->children, height, mark_valid);
825 while ((node = _pspp_rbtree_next (tree, node)) != NULL);
828 typedef struct _GtkRBReorder
839 pspp_rbtree_reorder_sort_func (gconstpointer a,
842 return ((GtkRBReorder *) a)->order - ((GtkRBReorder *) b)->order;
846 pspp_rbtree_reorder_invert_func (gconstpointer a,
849 return ((GtkRBReorder *) a)->invert_order - ((GtkRBReorder *) b)->invert_order;
853 pspp_rbtree_reorder_fixup (GtkRBTree *tree,
856 if (node == tree->nil)
861 if (node->left != tree->nil)
863 pspp_rbtree_reorder_fixup (tree, node->left);
864 node->offset += node->left->offset;
865 node->parity += node->left->parity;
867 if (node->right != tree->nil)
869 pspp_rbtree_reorder_fixup (tree, node->right);
870 node->offset += node->right->offset;
871 node->parity += node->right->parity;
876 node->offset += node->children->root->offset;
877 node->parity += node->children->root->parity;
880 if (PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_INVALID) ||
881 (node->right != tree->nil && PSPP_RBNODE_FLAG_SET (node->right, PSPP_RBNODE_DESCENDANTS_INVALID)) ||
882 (node->left != tree->nil && PSPP_RBNODE_FLAG_SET (node->left, PSPP_RBNODE_DESCENDANTS_INVALID)) ||
883 (node->children && PSPP_RBNODE_FLAG_SET (node->children->root, PSPP_RBNODE_DESCENDANTS_INVALID)))
884 PSPP_RBNODE_SET_FLAG (node, PSPP_RBNODE_DESCENDANTS_INVALID);
886 PSPP_RBNODE_UNSET_FLAG (node, PSPP_RBNODE_DESCENDANTS_INVALID);
889 /* It basically pulls everything out of the tree, rearranges it, and puts it
890 * back together. Our strategy is to keep the old RBTree intact, and just
891 * rearrange the contents. When that is done, we go through and update the
892 * heights. There is probably a more elegant way to write this function. If
893 * anyone wants to spend the time writing it, patches will be accepted.
896 _pspp_rbtree_reorder (GtkRBTree *tree,
900 GtkRBReorder reorder = { NULL };
905 g_return_if_fail (tree != NULL);
906 g_return_if_fail (length > 0);
907 g_return_if_fail (tree->root->count == length);
909 /* Sort the trees values in the new tree. */
910 array = g_array_sized_new (FALSE, FALSE, sizeof (GtkRBReorder), length);
911 for (i = 0; i < length; i++)
913 reorder.order = new_order[i];
914 reorder.invert_order = i;
915 g_array_append_val (array, reorder);
918 g_array_sort(array, pspp_rbtree_reorder_sort_func);
922 while (node && node->left != tree->nil)
925 for (i = 0; i < length; i++)
927 g_assert (node != tree->nil);
928 g_array_index (array, GtkRBReorder, i).children = node->children;
929 g_array_index (array, GtkRBReorder, i).flags = PSPP_RBNODE_NON_COLORS & node->flags;
930 g_array_index (array, GtkRBReorder, i).height = PSPP_RBNODE_GET_HEIGHT (node);
932 node = _pspp_rbtree_next (tree, node);
935 g_array_sort (array, pspp_rbtree_reorder_invert_func);
939 while (node && node->left != tree->nil)
942 /* Go through the tree and change the values to the new ones. */
943 for (i = 0; i < length; i++)
945 reorder = g_array_index (array, GtkRBReorder, i);
946 node->children = reorder.children;
948 node->children->parent_node = node;
949 node->flags = PSPP_RBNODE_GET_COLOR (node) | reorder.flags;
950 /* We temporarily set the height to this. */
951 node->offset = reorder.height;
952 node = _pspp_rbtree_next (tree, node);
954 pspp_rbtree_reorder_fixup (tree, tree->root);
956 g_array_free (array, TRUE);
961 _pspp_rbtree_node_find_offset (GtkRBTree *tree,
968 g_assert (node->left);
970 retval = node->left->offset;
972 while (tree && node && node != tree->nil)
977 /* Add left branch, plus children, iff we came from the right */
978 if (node->right == last)
979 retval += node->offset - node->right->offset;
981 if (node == tree->nil)
983 node = tree->parent_node;
984 tree = tree->parent_tree;
986 /* Add the parent node, plus the left branch. */
988 retval += node->left->offset + PSPP_RBNODE_GET_HEIGHT (node);
995 _pspp_rbtree_node_find_parity (GtkRBTree *tree,
1002 g_assert (node->left);
1004 retval = node->left->parity;
1006 while (tree && node && node != tree->nil)
1009 node = node->parent;
1011 /* Add left branch, plus children, iff we came from the right */
1012 if (node->right == last)
1013 retval += node->parity - node->right->parity;
1015 if (node == tree->nil)
1017 node = tree->parent_node;
1018 tree = tree->parent_tree;
1020 /* Add the parent node, plus the left branch. */
1022 retval += node->left->parity + 1; /* 1 == PSPP_RBNODE_GET_PARITY() */
1030 _pspp_rbtree_real_find_offset (GtkRBTree *tree,
1032 GtkRBTree **new_tree,
1033 GtkRBNode **new_node)
1035 GtkRBNode *tmp_node;
1048 tmp_node = tree->root;
1049 while (tmp_node != tree->nil &&
1050 (tmp_node->left->offset > height ||
1051 (tmp_node->offset - tmp_node->right->offset) < height))
1053 if (tmp_node->left->offset > height)
1054 tmp_node = tmp_node->left;
1057 height -= (tmp_node->offset - tmp_node->right->offset);
1058 tmp_node = tmp_node->right;
1061 if (tmp_node == tree->nil)
1067 if (tmp_node->children)
1069 if ((tmp_node->offset -
1070 tmp_node->right->offset -
1071 tmp_node->children->root->offset) > height)
1074 *new_node = tmp_node;
1075 return (height - tmp_node->left->offset);
1077 return _pspp_rbtree_real_find_offset (tmp_node->children,
1078 height - tmp_node->left->offset -
1080 tmp_node->left->offset -
1081 tmp_node->right->offset -
1082 tmp_node->children->root->offset),
1087 *new_node = tmp_node;
1088 return (height - tmp_node->left->offset);
1092 _pspp_rbtree_find_offset (GtkRBTree *tree,
1094 GtkRBTree **new_tree,
1095 GtkRBNode **new_node)
1100 (height >= tree->root->offset))
1107 return _pspp_rbtree_real_find_offset (tree, height, new_tree, new_node);
1111 _pspp_rbtree_remove_node (GtkRBTree *tree,
1115 GtkRBTree *tmp_tree;
1116 GtkRBNode *tmp_node;
1119 g_return_if_fail (tree != NULL);
1120 g_return_if_fail (node != NULL);
1123 #ifdef G_ENABLE_DEBUG
1124 if (gtk_debug_flags & GTK_DEBUG_TREE)
1126 g_print ("\n\n_pspp_rbtree_remove_node: %p\n", node);
1127 _pspp_rbtree_debug_spew (tree);
1128 _pspp_rbtree_test (G_STRLOC, tree);
1130 #endif /* G_ENABLE_DEBUG */
1132 /* make sure we're deleting a node that's actually in the tree */
1133 for (x = node; x->parent != tree->nil; x = x->parent)
1135 g_return_if_fail (x == tree->root);
1137 #ifdef G_ENABLE_DEBUG
1138 if (gtk_debug_flags & GTK_DEBUG_TREE)
1139 _pspp_rbtree_test (G_STRLOC, tree);
1142 if (node->left == tree->nil || node->right == tree->nil)
1150 while (y->left != tree->nil)
1154 /* adjust count only beneath tree */
1155 for (x = y; x != tree->nil; x = x->parent)
1160 /* offsets and parity adjust all the way up through parent trees */
1161 y_height = PSPP_RBNODE_GET_HEIGHT (y);
1165 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
1167 tmp_node->offset -= (y_height + (y->children?y->children->root->offset:0));
1168 _fixup_validation (tmp_tree, tmp_node);
1169 _fixup_parity (tmp_tree, tmp_node);
1170 tmp_node = tmp_node->parent;
1171 if (tmp_node == tmp_tree->nil)
1173 tmp_node = tmp_tree->parent_node;
1174 tmp_tree = tmp_tree->parent_tree;
1178 /* x is y's only child, or nil */
1179 if (y->left != tree->nil)
1184 /* remove y from the parent chain */
1185 x->parent = y->parent;
1186 if (y->parent != tree->nil)
1188 if (y == y->parent->left)
1189 y->parent->left = x;
1191 y->parent->right = x;
1198 /* We need to clean up the validity of the tree.
1205 /* We skip the first time, iff x is nil */
1206 if (tmp_node != tmp_tree->nil)
1208 _fixup_validation (tmp_tree, tmp_node);
1209 _fixup_parity (tmp_tree, tmp_node);
1211 tmp_node = tmp_node->parent;
1212 if (tmp_node == tmp_tree->nil)
1214 tmp_node = tmp_tree->parent_node;
1215 tmp_tree = tmp_tree->parent_tree;
1218 while (tmp_tree != NULL);
1224 /* Copy the node over */
1225 if (PSPP_RBNODE_GET_COLOR (node) == PSPP_RBNODE_BLACK)
1226 node->flags = ((y->flags & (PSPP_RBNODE_NON_COLORS)) | PSPP_RBNODE_BLACK);
1228 node->flags = ((y->flags & (PSPP_RBNODE_NON_COLORS)) | PSPP_RBNODE_RED);
1229 node->children = y->children;
1232 node->children = y->children;
1233 node->children->parent_node = node;
1237 node->children = NULL;
1239 _fixup_validation (tree, node);
1240 _fixup_parity (tree, node);
1241 /* We want to see how different our height is from the previous node.
1242 * To do this, we compare our current height with our supposed height.
1244 diff = y_height - PSPP_RBNODE_GET_HEIGHT (node);
1248 while (tmp_tree && tmp_node && tmp_node != tmp_tree->nil)
1250 tmp_node->offset += diff;
1251 _fixup_validation (tmp_tree, tmp_node);
1252 _fixup_parity (tmp_tree, tmp_node);
1253 tmp_node = tmp_node->parent;
1254 if (tmp_node == tmp_tree->nil)
1256 tmp_node = tmp_tree->parent_node;
1257 tmp_tree = tmp_tree->parent_tree;
1262 if (PSPP_RBNODE_GET_COLOR (y) == PSPP_RBNODE_BLACK)
1263 _pspp_rbtree_remove_node_fixup (tree, x);
1264 _pspp_rbnode_free (y);
1266 #ifdef G_ENABLE_DEBUG
1267 if (gtk_debug_flags & GTK_DEBUG_TREE)
1269 g_print ("_pspp_rbtree_remove_node finished...\n");
1270 _pspp_rbtree_debug_spew (tree);
1272 _pspp_rbtree_test (G_STRLOC, tree);
1274 #endif /* G_ENABLE_DEBUG */
1278 _pspp_rbtree_next (GtkRBTree *tree,
1281 g_return_val_if_fail (tree != NULL, NULL);
1282 g_return_val_if_fail (node != NULL, NULL);
1284 /* Case 1: the node's below us. */
1285 if (node->right != tree->nil)
1288 while (node->left != tree->nil)
1293 /* Case 2: it's an ancestor */
1294 while (node->parent != tree->nil)
1296 if (node->parent->right == node)
1297 node = node->parent;
1299 return (node->parent);
1302 /* Case 3: There is no next node */
1307 _pspp_rbtree_prev (GtkRBTree *tree,
1310 g_return_val_if_fail (tree != NULL, NULL);
1311 g_return_val_if_fail (node != NULL, NULL);
1313 /* Case 1: the node's below us. */
1314 if (node->left != tree->nil)
1317 while (node->right != tree->nil)
1322 /* Case 2: it's an ancestor */
1323 while (node->parent != tree->nil)
1325 if (node->parent->left == node)
1326 node = node->parent;
1328 return (node->parent);
1331 /* Case 3: There is no next node */
1336 _pspp_rbtree_next_full (GtkRBTree *tree,
1338 GtkRBTree **new_tree,
1339 GtkRBNode **new_node)
1341 g_return_if_fail (tree != NULL);
1342 g_return_if_fail (node != NULL);
1343 g_return_if_fail (new_tree != NULL);
1344 g_return_if_fail (new_node != NULL);
1348 *new_tree = node->children;
1349 *new_node = (*new_tree)->root;
1350 while ((*new_node)->left != (*new_tree)->nil)
1351 *new_node = (*new_node)->left;
1356 *new_node = _pspp_rbtree_next (tree, node);
1358 while ((*new_node == NULL) &&
1359 (*new_tree != NULL))
1361 *new_node = (*new_tree)->parent_node;
1362 *new_tree = (*new_tree)->parent_tree;
1364 *new_node = _pspp_rbtree_next (*new_tree, *new_node);
1369 _pspp_rbtree_prev_full (GtkRBTree *tree,
1371 GtkRBTree **new_tree,
1372 GtkRBNode **new_node)
1374 g_return_if_fail (tree != NULL);
1375 g_return_if_fail (node != NULL);
1376 g_return_if_fail (new_tree != NULL);
1377 g_return_if_fail (new_node != NULL);
1380 *new_node = _pspp_rbtree_prev (tree, node);
1382 if (*new_node == NULL)
1384 *new_node = (*new_tree)->parent_node;
1385 *new_tree = (*new_tree)->parent_tree;
1389 while ((*new_node)->children)
1391 *new_tree = (*new_node)->children;
1392 *new_node = (*new_tree)->root;
1393 while ((*new_node)->right != (*new_tree)->nil)
1394 *new_node = (*new_node)->right;
1400 _pspp_rbtree_get_depth (GtkRBTree *tree)
1402 GtkRBTree *tmp_tree;
1405 tmp_tree = tree->parent_tree;
1409 tmp_tree = tmp_tree->parent_tree;
1416 _pspp_rbtree_traverse_pre_order (GtkRBTree *tree,
1418 GtkRBTreeTraverseFunc func,
1421 if (node == tree->nil)
1424 (* func) (tree, node, data);
1425 _pspp_rbtree_traverse_pre_order (tree, node->left, func, data);
1426 _pspp_rbtree_traverse_pre_order (tree, node->right, func, data);
1430 _pspp_rbtree_traverse_post_order (GtkRBTree *tree,
1432 GtkRBTreeTraverseFunc func,
1435 if (node == tree->nil)
1438 _pspp_rbtree_traverse_post_order (tree, node->left, func, data);
1439 _pspp_rbtree_traverse_post_order (tree, node->right, func, data);
1440 (* func) (tree, node, data);
1444 _pspp_rbtree_traverse (GtkRBTree *tree,
1446 GTraverseType order,
1447 GtkRBTreeTraverseFunc func,
1450 g_return_if_fail (tree != NULL);
1451 g_return_if_fail (node != NULL);
1452 g_return_if_fail (func != NULL);
1453 g_return_if_fail (order <= G_LEVEL_ORDER);
1458 _pspp_rbtree_traverse_pre_order (tree, node, func, data);
1461 _pspp_rbtree_traverse_post_order (tree, node, func, data);
1466 g_warning ("unsupported traversal order.");
1472 void _fixup_validation (GtkRBTree *tree,
1475 if (PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_INVALID) ||
1476 PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_COLUMN_INVALID) ||
1477 (node->left != tree->nil && PSPP_RBNODE_FLAG_SET (node->left, PSPP_RBNODE_DESCENDANTS_INVALID)) ||
1478 (node->right != tree->nil && PSPP_RBNODE_FLAG_SET (node->right, PSPP_RBNODE_DESCENDANTS_INVALID)) ||
1479 (node->children != NULL && PSPP_RBNODE_FLAG_SET (node->children->root, PSPP_RBNODE_DESCENDANTS_INVALID)))
1481 PSPP_RBNODE_SET_FLAG (node, PSPP_RBNODE_DESCENDANTS_INVALID);
1485 PSPP_RBNODE_UNSET_FLAG (node, PSPP_RBNODE_DESCENDANTS_INVALID);
1490 void _fixup_parity (GtkRBTree *tree,
1494 ((node->children != NULL && node->children->root != node->children->nil) ? node->children->root->parity : 0) +
1495 ((node->left != tree->nil) ? node->left->parity : 0) +
1496 ((node->right != tree->nil) ? node->right->parity : 0);
1499 #ifdef G_ENABLE_DEBUG
1501 get_parity (GtkRBNode *node)
1503 guint child_total = 0;
1506 /* The parity of a node is node->parity minus
1507 * the parity of left, right, and children.
1509 * This is equivalent to saying that if left, right, children
1510 * sum to 0 parity, then node->parity is the parity of node,
1511 * and if left, right, children are odd parity, then
1512 * node->parity is the reverse of the node's parity.
1515 child_total += (guint) node->left->parity;
1516 child_total += (guint) node->right->parity;
1519 child_total += (guint) node->children->root->parity;
1521 rem = child_total % 2;
1524 return node->parity;
1526 return !node->parity;
1530 count_parity (GtkRBTree *tree,
1535 if (node == tree->nil)
1539 count_parity (tree, node->left) +
1540 count_parity (tree, node->right) +
1542 (node->children ? count_parity (node->children, node->children->root) : 0);
1544 res = res % (guint)2;
1546 if (res != node->parity)
1547 g_print ("parity incorrect for node\n");
1549 if (get_parity (node) != 1)
1550 g_error ("Node has incorrect parity %u", get_parity (node));
1556 _count_nodes (GtkRBTree *tree,
1560 if (node == tree->nil)
1563 g_assert (node->left);
1564 g_assert (node->right);
1566 res = (_count_nodes (tree, node->left) +
1567 _count_nodes (tree, node->right) + 1);
1569 if (res != node->count)
1570 g_print ("Tree failed\n");
1575 _pspp_rbtree_test_height (GtkRBTree *tree,
1578 gint computed_offset = 0;
1580 /* This whole test is sort of a useless truism. */
1582 if (node->left != tree->nil)
1583 computed_offset += node->left->offset;
1585 if (node->right != tree->nil)
1586 computed_offset += node->right->offset;
1588 if (node->children && node->children->root != node->children->nil)
1589 computed_offset += node->children->root->offset;
1591 if (PSPP_RBNODE_GET_HEIGHT (node) + computed_offset != node->offset)
1592 g_error ("node has broken offset\n");
1594 if (node->left != tree->nil)
1595 _pspp_rbtree_test_height (tree, node->left);
1597 if (node->right != tree->nil)
1598 _pspp_rbtree_test_height (tree, node->right);
1600 if (node->children && node->children->root != node->children->nil)
1601 _pspp_rbtree_test_height (node->children, node->children->root);
1605 _pspp_rbtree_test_dirty (GtkRBTree *tree,
1607 gint expected_dirtyness)
1610 if (expected_dirtyness)
1612 g_assert (PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_COLUMN_INVALID) ||
1613 PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_INVALID) ||
1614 (node->left != tree->nil && PSPP_RBNODE_FLAG_SET (node->left, PSPP_RBNODE_DESCENDANTS_INVALID)) ||
1615 (node->right != tree->nil && PSPP_RBNODE_FLAG_SET (node->right, PSPP_RBNODE_DESCENDANTS_INVALID)) ||
1616 (node->children && PSPP_RBNODE_FLAG_SET (node->children->root, PSPP_RBNODE_DESCENDANTS_INVALID)));
1620 g_assert (! PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_COLUMN_INVALID) &&
1621 ! PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_INVALID));
1622 if (node->left != tree->nil)
1623 g_assert (! PSPP_RBNODE_FLAG_SET (node->left, PSPP_RBNODE_DESCENDANTS_INVALID));
1624 if (node->right != tree->nil)
1625 g_assert (! PSPP_RBNODE_FLAG_SET (node->right, PSPP_RBNODE_DESCENDANTS_INVALID));
1626 if (node->children != NULL)
1627 g_assert (! PSPP_RBNODE_FLAG_SET (node->children->root, PSPP_RBNODE_DESCENDANTS_INVALID));
1630 if (node->left != tree->nil)
1631 _pspp_rbtree_test_dirty (tree, node->left, PSPP_RBNODE_FLAG_SET (node->left, PSPP_RBNODE_DESCENDANTS_INVALID));
1632 if (node->right != tree->nil)
1633 _pspp_rbtree_test_dirty (tree, node->right, PSPP_RBNODE_FLAG_SET (node->right, PSPP_RBNODE_DESCENDANTS_INVALID));
1634 if (node->children != NULL && node->children->root != node->children->nil)
1635 _pspp_rbtree_test_dirty (node->children, node->children->root, PSPP_RBNODE_FLAG_SET (node->children->root, PSPP_RBNODE_DESCENDANTS_INVALID));
1638 static void _pspp_rbtree_test_structure (GtkRBTree *tree);
1641 _pspp_rbtree_test_structure_helper (GtkRBTree *tree,
1644 g_assert (node != tree->nil);
1646 g_assert (node->left != NULL);
1647 g_assert (node->right != NULL);
1648 g_assert (node->parent != NULL);
1650 if (node->left != tree->nil)
1652 g_assert (node->left->parent == node);
1653 _pspp_rbtree_test_structure_helper (tree, node->left);
1655 if (node->right != tree->nil)
1657 g_assert (node->right->parent == node);
1658 _pspp_rbtree_test_structure_helper (tree, node->right);
1661 if (node->children != NULL)
1663 g_assert (node->children->parent_tree == tree);
1664 g_assert (node->children->parent_node == node);
1666 _pspp_rbtree_test_structure (node->children);
1670 _pspp_rbtree_test_structure (GtkRBTree *tree)
1672 g_assert (tree->root);
1673 if (tree->root == tree->nil)
1676 g_assert (tree->root->parent == tree->nil);
1677 _pspp_rbtree_test_structure_helper (tree, tree->root);
1681 _pspp_rbtree_test (const gchar *where,
1684 GtkRBTree *tmp_tree;
1689 /* Test the entire tree */
1691 while (tmp_tree->parent_tree)
1692 tmp_tree = tmp_tree->parent_tree;
1694 g_assert (tmp_tree->nil != NULL);
1696 if (tmp_tree->root == tmp_tree->nil)
1699 _pspp_rbtree_test_structure (tmp_tree);
1701 g_assert ((_count_nodes (tmp_tree, tmp_tree->root->left) +
1702 _count_nodes (tmp_tree, tmp_tree->root->right) + 1) == tmp_tree->root->count);
1705 _pspp_rbtree_test_height (tmp_tree, tmp_tree->root);
1706 _pspp_rbtree_test_dirty (tmp_tree, tmp_tree->root, PSPP_RBNODE_FLAG_SET (tmp_tree->root, PSPP_RBNODE_DESCENDANTS_INVALID));
1707 g_assert (count_parity (tmp_tree, tmp_tree->root) == tmp_tree->root->parity);
1711 _pspp_rbtree_debug_spew_helper (GtkRBTree *tree,
1716 for (i = 0; i < depth; i++)
1719 g_print ("(%p - %s) (Offset %d) (Parity %d) (Validity %d%d%d)\n",
1721 (PSPP_RBNODE_GET_COLOR (node) == PSPP_RBNODE_BLACK)?"BLACK":" RED ",
1724 (PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_DESCENDANTS_INVALID))?1:0,
1725 (PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_INVALID))?1:0,
1726 (PSPP_RBNODE_FLAG_SET (node, PSPP_RBNODE_COLUMN_INVALID))?1:0);
1727 if (node->children != NULL)
1729 g_print ("Looking at child.\n");
1730 _pspp_rbtree_debug_spew (node->children);
1731 g_print ("Done looking at child.\n");
1733 if (node->left != tree->nil)
1735 _pspp_rbtree_debug_spew_helper (tree, node->left, depth+1);
1737 if (node->right != tree->nil)
1739 _pspp_rbtree_debug_spew_helper (tree, node->right, depth+1);
1744 _pspp_rbtree_debug_spew (GtkRBTree *tree)
1746 g_return_if_fail (tree != NULL);
1748 if (tree->root == tree->nil)
1749 g_print ("Empty tree...\n");
1751 _pspp_rbtree_debug_spew_helper (tree, tree->root, 0);
1753 #endif /* G_ENABLE_DEBUG */