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, see <http://www.gnu.org/licenses/>.
22 #include "../gtkrbtree.h"
24 /* _gtk_rbtree_test */
27 get_total_count (GtkRBNode *node)
29 guint child_total = 0;
31 child_total += (guint) node->left->total_count;
32 child_total += (guint) node->right->total_count;
35 child_total += (guint) node->children->root->total_count;
37 return child_total + 1;
41 count_total (GtkRBTree *tree,
46 if (_gtk_rbtree_is_nil (node))
50 count_total (tree, node->left) +
51 count_total (tree, node->right) +
53 (node->children ? count_total (node->children, node->children->root) : 0);
55 if (res != node->total_count)
56 g_print ("total count incorrect for node\n");
58 if (get_total_count (node) != node->total_count)
59 g_error ("Node has incorrect total count %u, should be %u", node->total_count, get_total_count (node));
65 _count_nodes (GtkRBTree *tree,
69 if (_gtk_rbtree_is_nil (node))
72 g_assert (node->left);
73 g_assert (node->right);
75 res = (_count_nodes (tree, node->left) +
76 _count_nodes (tree, node->right) + 1);
78 if (res != node->count)
79 g_print ("Tree failed\n");
84 _gtk_rbtree_test_height (GtkRBTree *tree,
87 gint computed_offset = 0;
89 /* This whole test is sort of a useless truism. */
91 if (!_gtk_rbtree_is_nil (node->left))
92 computed_offset += node->left->offset;
94 if (!_gtk_rbtree_is_nil (node->right))
95 computed_offset += node->right->offset;
97 if (node->children && !_gtk_rbtree_is_nil (node->children->root))
98 computed_offset += node->children->root->offset;
100 if (GTK_RBNODE_GET_HEIGHT (node) + computed_offset != node->offset)
101 g_error ("node has broken offset\n");
103 if (!_gtk_rbtree_is_nil (node->left))
104 _gtk_rbtree_test_height (tree, node->left);
106 if (!_gtk_rbtree_is_nil (node->right))
107 _gtk_rbtree_test_height (tree, node->right);
109 if (node->children && !_gtk_rbtree_is_nil (node->children->root))
110 _gtk_rbtree_test_height (node->children, node->children->root);
114 _gtk_rbtree_test_dirty (GtkRBTree *tree,
116 gint expected_dirtyness)
119 if (expected_dirtyness)
121 g_assert (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) ||
122 GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID) ||
123 GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID) ||
124 GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID) ||
125 (node->children && GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID)));
129 g_assert (! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID) &&
130 ! GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID));
131 if (!_gtk_rbtree_is_nil (node->left))
132 g_assert (! GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
133 if (!_gtk_rbtree_is_nil (node->right))
134 g_assert (! GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
135 if (node->children != NULL)
136 g_assert (! GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
139 if (!_gtk_rbtree_is_nil (node->left))
140 _gtk_rbtree_test_dirty (tree, node->left, GTK_RBNODE_FLAG_SET (node->left, GTK_RBNODE_DESCENDANTS_INVALID));
141 if (!_gtk_rbtree_is_nil (node->right))
142 _gtk_rbtree_test_dirty (tree, node->right, GTK_RBNODE_FLAG_SET (node->right, GTK_RBNODE_DESCENDANTS_INVALID));
143 if (node->children != NULL && !_gtk_rbtree_is_nil (node->children->root))
144 _gtk_rbtree_test_dirty (node->children, node->children->root, GTK_RBNODE_FLAG_SET (node->children->root, GTK_RBNODE_DESCENDANTS_INVALID));
147 static void _gtk_rbtree_test_structure (GtkRBTree *tree);
150 _gtk_rbtree_test_structure_helper (GtkRBTree *tree,
153 guint left_blacks, right_blacks;
155 g_assert (!_gtk_rbtree_is_nil (node));
157 g_assert (node->left != NULL);
158 g_assert (node->right != NULL);
159 g_assert (node->parent != NULL);
161 if (!_gtk_rbtree_is_nil (node->left))
163 g_assert (node->left->parent == node);
164 left_blacks = _gtk_rbtree_test_structure_helper (tree, node->left);
169 if (!_gtk_rbtree_is_nil (node->right))
171 g_assert (node->right->parent == node);
172 right_blacks = _gtk_rbtree_test_structure_helper (tree, node->right);
177 if (node->children != NULL)
179 g_assert (node->children->parent_tree == tree);
180 g_assert (node->children->parent_node == node);
182 _gtk_rbtree_test_structure (node->children);
185 g_assert (left_blacks == right_blacks);
187 return left_blacks + (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK ? 1 : 0);
191 _gtk_rbtree_test_structure (GtkRBTree *tree)
193 g_assert (tree->root);
194 if (_gtk_rbtree_is_nil (tree->root))
197 g_assert (_gtk_rbtree_is_nil (tree->root->parent));
198 _gtk_rbtree_test_structure_helper (tree, tree->root);
202 _gtk_rbtree_test (GtkRBTree *tree)
209 /* Test the entire tree */
211 while (tmp_tree->parent_tree)
212 tmp_tree = tmp_tree->parent_tree;
214 if (_gtk_rbtree_is_nil (tmp_tree->root))
217 _gtk_rbtree_test_structure (tmp_tree);
219 g_assert ((_count_nodes (tmp_tree, tmp_tree->root->left) +
220 _count_nodes (tmp_tree, tmp_tree->root->right) + 1) == tmp_tree->root->count);
222 _gtk_rbtree_test_height (tmp_tree, tmp_tree->root);
223 _gtk_rbtree_test_dirty (tmp_tree, tmp_tree->root, GTK_RBNODE_FLAG_SET (tmp_tree->root, GTK_RBNODE_DESCENDANTS_INVALID));
224 g_assert (count_total (tmp_tree, tmp_tree->root) == tmp_tree->root->total_count);
227 /* gtk_rbtree_print() - unused, for debugging only */
230 gtk_rbtree_print_node (GtkRBTree *tree,
235 for (i = 0; i < depth; i++)
238 g_print ("(%p - %s) (Offset %d) (Parity %d) (Validity %d%d%d)\n",
240 (GTK_RBNODE_GET_COLOR (node) == GTK_RBNODE_BLACK)?"BLACK":" RED ",
243 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_DESCENDANTS_INVALID))?1:0,
244 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_INVALID))?1:0,
245 (GTK_RBNODE_FLAG_SET (node, GTK_RBNODE_COLUMN_INVALID))?1:0);
246 if (node->children != NULL)
248 g_print ("Looking at child.\n");
249 gtk_rbtree_print_node (node->children, node->children->root, depth + 1);
250 g_print ("Done looking at child.\n");
252 if (!_gtk_rbtree_is_nil (node->left))
254 gtk_rbtree_print_node (tree, node->left, depth+1);
256 if (!_gtk_rbtree_is_nil (node->right))
258 gtk_rbtree_print_node (tree, node->right, depth+1);
262 /* not static so the debugger finds it. */
263 void gtk_rbtree_print (GtkRBTree *tree);
266 gtk_rbtree_print (GtkRBTree *tree)
268 g_return_if_fail (tree != NULL);
270 if (_gtk_rbtree_is_nil (tree->root))
271 g_print ("Empty tree...\n");
273 gtk_rbtree_print_node (tree, tree->root, 0);
279 append_elements (GtkRBTree *tree,
281 guint elements_per_depth,
288 g_assert (depth > 0);
293 for (i = 0; i < elements_per_depth; i++)
295 node = _gtk_rbtree_insert_after (tree, node, ++height, TRUE);
298 node->children = _gtk_rbtree_new ();
299 node->children->parent_tree = tree;
300 node->children->parent_node = node;
301 height = append_elements (node->children, depth, elements_per_depth, check, height);
304 _gtk_rbtree_test (tree);
311 create_rbtree (guint depth,
312 guint elements_per_depth,
317 tree = _gtk_rbtree_new ();
319 append_elements (tree, depth, elements_per_depth, check, 0);
321 _gtk_rbtree_test (tree);
331 tree = create_rbtree (5, 5, TRUE);
333 _gtk_rbtree_free (tree);
337 test_insert_after (void)
343 tree = _gtk_rbtree_new ();
346 for (i = 1; i <= 100; i++)
348 node = _gtk_rbtree_insert_after (tree, node, i, TRUE);
349 _gtk_rbtree_test (tree);
350 g_assert (tree->root->count == i);
351 g_assert (tree->root->total_count == i);
352 g_assert (tree->root->offset == i * (i + 1) / 2);
355 _gtk_rbtree_free (tree);
359 test_insert_before (void)
365 tree = _gtk_rbtree_new ();
368 for (i = 1; i <= 100; i++)
370 node = _gtk_rbtree_insert_before (tree, node, i, TRUE);
371 _gtk_rbtree_test (tree);
372 g_assert (tree->root->count == i);
373 g_assert (tree->root->total_count == i);
374 g_assert (tree->root->offset == i * (i + 1) / 2);
377 _gtk_rbtree_free (tree);
381 test_remove_node (void)
385 tree = create_rbtree (3, 16, g_test_thorough ());
387 while (tree->root->count > 1)
389 GtkRBTree *find_tree;
390 GtkRBNode *find_node;
393 i = g_test_rand_int_range (0, tree->root->total_count);
394 if (!_gtk_rbtree_find_index (tree, i, &find_tree, &find_node))
396 /* We search an available index, so we mustn't fail. */
397 g_assert_not_reached ();
400 _gtk_rbtree_test (find_tree);
402 if (find_tree->root->count == 1)
404 _gtk_rbtree_remove (find_tree);
407 _gtk_rbtree_remove_node (find_tree, find_node);
408 _gtk_rbtree_test (tree);
411 _gtk_rbtree_free (tree);
415 test_remove_root (void)
420 tree = _gtk_rbtree_new ();
422 node = _gtk_rbtree_insert_after (tree, NULL, 1, TRUE);
423 _gtk_rbtree_insert_after (tree, node, 2, TRUE);
424 _gtk_rbtree_insert_before (tree, node, 3, TRUE);
426 _gtk_rbtree_remove_node (tree, node);
428 _gtk_rbtree_free (tree);
432 fisher_yates_shuffle (guint n_items)
437 list = g_new (gint, n_items);
439 for (i = 0; i < n_items; i++)
441 j = g_random_int_range (0, i + 1);
450 create_unsorted_tree (gint *order,
457 tree = _gtk_rbtree_new ();
460 for (i = 0; i < n; i++)
462 node = _gtk_rbtree_insert_after (tree, node, 0, TRUE);
465 for (i = 0; i < n; i++)
467 node = _gtk_rbtree_find_count (tree, order[i] + 1);
468 _gtk_rbtree_node_set_height (tree, node, i);
471 _gtk_rbtree_test (tree);
479 guint n = g_test_perf () ? 1000000 : 100;
486 reorder = fisher_yates_shuffle (n);
487 tree = create_unsorted_tree (reorder, n);
489 g_test_timer_start ();
491 _gtk_rbtree_reorder (tree, reorder, n);
493 elapsed = g_test_timer_elapsed ();
495 g_test_minimized_result (elapsed, "reordering rbtree with %u items: %gsec", n, elapsed);
497 _gtk_rbtree_test (tree);
499 for (node = _gtk_rbtree_first (tree), i = 0;
501 node = _gtk_rbtree_next (tree, node), i++)
503 g_assert (GTK_RBNODE_GET_HEIGHT (node) == i);
507 _gtk_rbtree_free (tree);
511 main (int argc, char *argv[])
513 g_test_init (&argc, &argv, NULL);
514 setlocale (LC_ALL, "C");
515 g_test_bug_base ("http://bugzilla.gnome.org/show_bug.cgi?id=%s");
517 g_test_add_func ("/rbtree/create", test_create);
518 g_test_add_func ("/rbtree/insert_after", test_insert_after);
519 g_test_add_func ("/rbtree/insert_before", test_insert_before);
520 g_test_add_func ("/rbtree/remove_node", test_remove_node);
521 g_test_add_func ("/rbtree/remove_root", test_remove_root);
522 g_test_add_func ("/rbtree/reorder", test_reorder);
524 return g_test_run ();