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_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID) ||
126 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,
290 g_assert (depth > 0);
295 for (i = 0; i < elements_per_depth; i++)
297 node = _gtk_rbtree_insert_after (tree, node, ++height, TRUE);
300 node->children = _gtk_rbtree_new ();
301 node->children->parent_tree = tree;
302 node->children->parent_node = node;
303 height = append_elements (node->children, depth, elements_per_depth, check, height);
306 _gtk_rbtree_test (tree);
313 create_rbtree (guint depth,
314 guint elements_per_depth,
319 tree = _gtk_rbtree_new ();
321 append_elements (tree, depth, elements_per_depth, check, 0);
323 _gtk_rbtree_test (tree);
333 tree = create_rbtree (5, 5, TRUE);
335 _gtk_rbtree_free (tree);
339 test_insert_after (void)
345 tree = _gtk_rbtree_new ();
348 for (i = 1; i <= 100; i++)
350 node = _gtk_rbtree_insert_after (tree, node, i, TRUE);
351 _gtk_rbtree_test (tree);
352 g_assert (tree->root->count == i);
353 g_assert (tree->root->total_count == i);
354 g_assert (tree->root->offset == i * (i + 1) / 2);
357 _gtk_rbtree_free (tree);
361 test_insert_before (void)
367 tree = _gtk_rbtree_new ();
370 for (i = 1; i <= 100; i++)
372 node = _gtk_rbtree_insert_before (tree, node, i, TRUE);
373 _gtk_rbtree_test (tree);
374 g_assert (tree->root->count == i);
375 g_assert (tree->root->total_count == i);
376 g_assert (tree->root->offset == i * (i + 1) / 2);
379 _gtk_rbtree_free (tree);
383 test_remove_node (void)
387 tree = create_rbtree (3, 16, g_test_thorough ());
389 while (tree->root->count > 1)
391 GtkRBTree *find_tree;
392 GtkRBNode *find_node;
395 i = g_test_rand_int_range (0, tree->root->total_count);
396 if (!_gtk_rbtree_find_index (tree, i, &find_tree, &find_node))
398 /* We search an available index, so we mustn't fail. */
399 g_assert_not_reached ();
402 _gtk_rbtree_test (find_tree);
404 if (find_tree->root->count == 1)
406 _gtk_rbtree_remove (find_tree);
409 _gtk_rbtree_remove_node (find_tree, find_node);
410 _gtk_rbtree_test (tree);
413 _gtk_rbtree_free (tree);
417 test_remove_root (void)
422 tree = _gtk_rbtree_new ();
424 node = _gtk_rbtree_insert_after (tree, NULL, 1, TRUE);
425 _gtk_rbtree_insert_after (tree, node, 2, TRUE);
426 _gtk_rbtree_insert_before (tree, node, 3, TRUE);
428 _gtk_rbtree_remove_node (tree, node);
430 _gtk_rbtree_free (tree);
434 fisher_yates_shuffle (guint n_items)
439 list = g_new (gint, n_items);
441 for (i = 0; i < n_items; i++)
443 j = g_random_int_range (0, i + 1);
452 create_unsorted_tree (gint *order,
459 tree = _gtk_rbtree_new ();
462 for (i = 0; i < n; i++)
464 node = _gtk_rbtree_insert_after (tree, node, 0, TRUE);
467 for (i = 0; i < n; i++)
469 node = _gtk_rbtree_find_count (tree, order[i] + 1);
470 _gtk_rbtree_node_set_height (tree, node, i);
473 _gtk_rbtree_test (tree);
481 guint n = g_test_perf () ? 1000000 : 100;
488 reorder = fisher_yates_shuffle (n);
489 tree = create_unsorted_tree (reorder, n);
491 g_test_timer_start ();
493 _gtk_rbtree_reorder (tree, reorder, n);
495 elapsed = g_test_timer_elapsed ();
497 g_test_minimized_result (elapsed, "reordering rbtree with %u items: %gsec", n, elapsed);
499 _gtk_rbtree_test (tree);
501 for (node = _gtk_rbtree_first (tree), i = 0;
503 node = _gtk_rbtree_next (tree, node), i++)
505 g_assert (GTK_RBNODE_GET_HEIGHT (node) == i);
509 _gtk_rbtree_free (tree);
513 main (int argc, char *argv[])
515 g_test_init (&argc, &argv, NULL);
516 setlocale (LC_ALL, "C");
517 g_test_bug_base ("http://bugzilla.gnome.org/show_bug.cgi?id=%s");
519 g_test_add_func ("/rbtree/create", test_create);
520 g_test_add_func ("/rbtree/insert_after", test_insert_after);
521 g_test_add_func ("/rbtree/insert_before", test_insert_before);
522 g_test_add_func ("/rbtree/remove_node", test_remove_node);
523 g_test_add_func ("/rbtree/remove_root", test_remove_root);
524 g_test_add_func ("/rbtree/reorder", test_reorder);
526 return g_test_run ();