3 * Copyright (C) 2011, Red Hat, Inc.
4 * Authors: Benjamin Otte <otte@gnome.org>
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the
18 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
19 * Boston, MA 02111-1307, USA.
24 #include "../gtkrbtree.h"
26 /* _gtk_rbtree_test */
29 get_total_count (GtkRBNode *node)
31 guint child_total = 0;
33 child_total += (guint) node->left->total_count;
34 child_total += (guint) node->right->total_count;
37 child_total += (guint) node->children->root->total_count;
39 return child_total + 1;
43 count_total (GtkRBTree *tree,
48 if (_gtk_rbtree_is_nil (node))
52 count_total (tree, node->left) +
53 count_total (tree, node->right) +
55 (node->children ? count_total (node->children, node->children->root) : 0);
57 if (res != node->total_count)
58 g_print ("total count incorrect for node\n");
60 if (get_total_count (node) != node->total_count)
61 g_error ("Node has incorrect total count %u, should be %u", node->total_count, get_total_count (node));
67 _count_nodes (GtkRBTree *tree,
71 if (_gtk_rbtree_is_nil (node))
74 g_assert (node->left);
75 g_assert (node->right);
77 res = (_count_nodes (tree, node->left) +
78 _count_nodes (tree, node->right) + 1);
80 if (res != node->count)
81 g_print ("Tree failed\n");
86 _gtk_rbtree_test_height (GtkRBTree *tree,
89 gint computed_offset = 0;
91 /* This whole test is sort of a useless truism. */
93 if (!_gtk_rbtree_is_nil (node->left))
94 computed_offset += node->left->offset;
96 if (!_gtk_rbtree_is_nil (node->right))
97 computed_offset += node->right->offset;
99 if (node->children && !_gtk_rbtree_is_nil (node->children->root))
100 computed_offset += node->children->root->offset;
102 if (GTK_RBNODE_GET_HEIGHT (node) + computed_offset != node->offset)
103 g_error ("node has broken offset\n");
105 if (!_gtk_rbtree_is_nil (node->left))
106 _gtk_rbtree_test_height (tree, node->left);
108 if (!_gtk_rbtree_is_nil (node->right))
109 _gtk_rbtree_test_height (tree, node->right);
111 if (node->children && !_gtk_rbtree_is_nil (node->children->root))
112 _gtk_rbtree_test_height (node->children, node->children->root);
116 _gtk_rbtree_test_dirty (GtkRBTree *tree,
118 gint expected_dirtyness)
121 if (expected_dirtyness)
123 g_assert (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
124 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
125 (!_gtk_rbtree_is_nil (node->left) && GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID)) ||
126 (!_gtk_rbtree_is_nil (node->right) && GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID)) ||
127 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)));
131 g_assert (! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) &&
132 ! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID));
133 if (!_gtk_rbtree_is_nil (node->left))
134 g_assert (! GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
135 if (!_gtk_rbtree_is_nil (node->right))
136 g_assert (! GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
137 if (node->children != NULL)
138 g_assert (! GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
141 if (!_gtk_rbtree_is_nil (node->left))
142 _gtk_rbtree_test_dirty (tree, node->left, GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
143 if (!_gtk_rbtree_is_nil (node->right))
144 _gtk_rbtree_test_dirty (tree, node->right, GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
145 if (node->children != NULL && !_gtk_rbtree_is_nil (node->children->root))
146 _gtk_rbtree_test_dirty (node->children, node->children->root, GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
149 static void _gtk_rbtree_test_structure (GtkRBTree *tree);
152 _gtk_rbtree_test_structure_helper (GtkRBTree *tree,
155 guint left_blacks, right_blacks;
157 g_assert (!_gtk_rbtree_is_nil (node));
159 g_assert (node->left != NULL);
160 g_assert (node->right != NULL);
161 g_assert (node->parent != NULL);
163 if (!_gtk_rbtree_is_nil (node->left))
165 g_assert (node->left->parent == node);
166 left_blacks = _gtk_rbtree_test_structure_helper (tree, node->left);
171 if (!_gtk_rbtree_is_nil (node->right))
173 g_assert (node->right->parent == node);
174 right_blacks = _gtk_rbtree_test_structure_helper (tree, node->right);
179 if (node->children != NULL)
181 g_assert (node->children->parent_tree == tree);
182 g_assert (node->children->parent_node == node);
184 _gtk_rbtree_test_structure (node->children);
187 g_assert (left_blacks == right_blacks);
189 return left_blacks + (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK ? 1 : 0);
193 _gtk_rbtree_test_structure (GtkRBTree *tree)
195 g_assert (tree->root);
196 if (_gtk_rbtree_is_nil (tree->root))
199 g_assert (_gtk_rbtree_is_nil (tree->root->parent));
200 _gtk_rbtree_test_structure_helper (tree, tree->root);
204 _gtk_rbtree_test (GtkRBTree *tree)
211 /* Test the entire tree */
213 while (tmp_tree->parent_tree)
214 tmp_tree = tmp_tree->parent_tree;
216 if (_gtk_rbtree_is_nil (tmp_tree->root))
219 _gtk_rbtree_test_structure (tmp_tree);
221 g_assert ((_count_nodes (tmp_tree, tmp_tree->root->left) +
222 _count_nodes (tmp_tree, tmp_tree->root->right) + 1) == tmp_tree->root->count);
224 _gtk_rbtree_test_height (tmp_tree, tmp_tree->root);
225 _gtk_rbtree_test_dirty (tmp_tree, tmp_tree->root, GTK_RBNODE_FLAG_SET (tmp_tree->root, GTK_RBNODE_DESCENDANTS_INVALID));
226 g_assert (count_total (tmp_tree, tmp_tree->root) == tmp_tree->root->total_count);
229 /* gtk_rbtree_print() - unused, for debugging only */
232 gtk_rbtree_print_node (GtkRBTree *tree,
237 for (i = 0; i < depth; i++)
240 g_print ("(%p - %s) (Offset %d) (Parity %d) (Validity %d%d%d)\n",
242 (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)?"BLACK":" RED ",
245 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))?1:0,
246 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))?1:0,
247 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID))?1:0);
248 if (node->children != NULL)
250 g_print ("Looking at child.\n");
251 gtk_rbtree_print_node (node->children, node->children->root, depth + 1);
252 g_print ("Done looking at child.\n");
254 if (!_gtk_rbtree_is_nil (node->left))
256 gtk_rbtree_print_node (tree, node->left, depth+1);
258 if (!_gtk_rbtree_is_nil (node->right))
260 gtk_rbtree_print_node (tree, node->right, depth+1);
264 /* not static so the debugger finds it. */
265 void gtk_rbtree_print (GtkRBTree *tree);
268 gtk_rbtree_print (GtkRBTree *tree)
270 g_return_if_fail (tree != NULL);
272 if (_gtk_rbtree_is_nil (tree->root))
273 g_print ("Empty tree...\n");
275 gtk_rbtree_print_node (tree, tree->root, 0);
281 append_elements (GtkRBTree *tree,
283 guint elements_per_depth,
289 g_assert (depth > 0);
294 for (i = 0; i < elements_per_depth; i++)
296 node = _gtk_rbtree_insert_after (tree, node, ++height, TRUE);
299 node->children = _gtk_rbtree_new ();
300 node->children->parent_tree = tree;
301 node->children->parent_node = node;
302 height = append_elements (node->children, depth, elements_per_depth, height);
304 _gtk_rbtree_test (tree);
311 create_rbtree (guint depth,
312 guint elements_per_depth)
316 tree = _gtk_rbtree_new ();
318 append_elements (tree, depth, elements_per_depth, 0);
328 tree = create_rbtree (5, 5);
330 _gtk_rbtree_free (tree);
334 test_insert_after (void)
340 tree = _gtk_rbtree_new ();
343 for (i = 1; i <= 100; i++)
345 node = _gtk_rbtree_insert_after (tree, node, i, TRUE);
346 _gtk_rbtree_test (tree);
347 g_assert (tree->root->count == i);
348 g_assert (tree->root->total_count == i);
349 g_assert (tree->root->offset == i * (i + 1) / 2);
352 _gtk_rbtree_free (tree);
356 test_insert_before (void)
362 tree = _gtk_rbtree_new ();
365 for (i = 1; i <= 100; i++)
367 node = _gtk_rbtree_insert_before (tree, node, i, TRUE);
368 _gtk_rbtree_test (tree);
369 g_assert (tree->root->count == i);
370 g_assert (tree->root->total_count == i);
371 g_assert (tree->root->offset == i * (i + 1) / 2);
374 _gtk_rbtree_free (tree);
378 test_remove_node (void)
382 tree = create_rbtree (3, 16);
384 while (tree->root->count > 1)
386 GtkRBTree *find_tree;
387 GtkRBNode *find_node;
390 i = g_test_rand_int_range (0, tree->root->total_count);
391 if (!_gtk_rbtree_find_index (tree, i, &find_tree, &find_node))
393 /* We search an available index, so we mustn't fail. */
394 g_assert_not_reached ();
397 _gtk_rbtree_test (find_tree);
399 if (find_tree->root->count == 1)
401 _gtk_rbtree_remove (find_tree);
404 _gtk_rbtree_remove_node (find_tree, find_node);
405 _gtk_rbtree_test (tree);
408 _gtk_rbtree_free (tree);
412 test_remove_root (void)
417 tree = _gtk_rbtree_new ();
419 node = _gtk_rbtree_insert_after (tree, NULL, 1, TRUE);
420 _gtk_rbtree_insert_after (tree, node, 2, TRUE);
421 _gtk_rbtree_insert_before (tree, node, 3, TRUE);
423 _gtk_rbtree_remove_node (tree, node);
425 _gtk_rbtree_free (tree);
429 main (int argc, char *argv[])
431 g_test_init (&argc, &argv, NULL);
432 setlocale (LC_ALL, "C");
433 g_test_bug_base ("http://bugzilla.gnome.org/show_bug.cgi?id=%s");
435 g_test_add_func ("/rbtree/create", test_create);
436 g_test_add_func ("/rbtree/insert_after", test_insert_after);
437 g_test_add_func ("/rbtree/insert_before", test_insert_before);
438 g_test_add_func ("/rbtree/remove_node", test_remove_node);
440 g_test_add_func ("/rbtree/remove_root", test_remove_root);
442 return g_test_run ();