Lines Matching refs:root

13 static IntervalTreeRoot root;  variable
33 g_assert(root.rb_root.rb_node == NULL); in test_empty()
34 g_assert(root.rb_leftmost == NULL); in test_empty()
35 g_assert(interval_tree_iter_first(&root, 0, UINT64_MAX) == NULL); in test_empty()
44 interval_tree_insert(&nodes[0], &root); in test_find_one_point()
46 g_assert(interval_tree_iter_first(&root, 0, 9) == &nodes[0]); in test_find_one_point()
48 g_assert(interval_tree_iter_first(&root, 0, 0) == NULL); in test_find_one_point()
50 g_assert(interval_tree_iter_first(&root, 0, 1) == &nodes[0]); in test_find_one_point()
51 g_assert(interval_tree_iter_first(&root, 1, 1) == &nodes[0]); in test_find_one_point()
52 g_assert(interval_tree_iter_first(&root, 1, 2) == &nodes[0]); in test_find_one_point()
53 g_assert(interval_tree_iter_first(&root, 2, 2) == NULL); in test_find_one_point()
55 interval_tree_remove(&nodes[0], &root); in test_find_one_point()
56 g_assert(root.rb_root.rb_node == NULL); in test_find_one_point()
57 g_assert(root.rb_leftmost == NULL); in test_find_one_point()
69 interval_tree_insert(&nodes[0], &root); in test_find_two_point()
70 interval_tree_insert(&nodes[1], &root); in test_find_two_point()
72 find0 = interval_tree_iter_first(&root, 0, 9); in test_find_two_point()
79 interval_tree_remove(&nodes[1], &root); in test_find_two_point()
81 g_assert(interval_tree_iter_first(&root, 0, 9) == &nodes[0]); in test_find_two_point()
84 interval_tree_remove(&nodes[0], &root); in test_find_two_point()
93 interval_tree_insert(&nodes[0], &root); in test_find_one_range()
95 g_assert(interval_tree_iter_first(&root, 0, 9) == &nodes[0]); in test_find_one_range()
97 g_assert(interval_tree_iter_first(&root, 0, 0) == NULL); in test_find_one_range()
98 g_assert(interval_tree_iter_first(&root, 0, 1) == &nodes[0]); in test_find_one_range()
99 g_assert(interval_tree_iter_first(&root, 1, 1) == &nodes[0]); in test_find_one_range()
100 g_assert(interval_tree_iter_first(&root, 4, 6) == &nodes[0]); in test_find_one_range()
101 g_assert(interval_tree_iter_first(&root, 8, 8) == &nodes[0]); in test_find_one_range()
102 g_assert(interval_tree_iter_first(&root, 9, 9) == NULL); in test_find_one_range()
104 interval_tree_remove(&nodes[0], &root); in test_find_one_range()
126 interval_tree_insert(&nodes[i], &root); in test_find_one_range_many()
130 g_assert(interval_tree_iter_first(&root, 100, 199) == &nodes[0]); in test_find_one_range_many()
132 g_assert(interval_tree_iter_first(&root, 100, 109) == NULL); in test_find_one_range_many()
133 g_assert(interval_tree_iter_first(&root, 100, 110) == &nodes[0]); in test_find_one_range_many()
134 g_assert(interval_tree_iter_first(&root, 111, 120) == &nodes[0]); in test_find_one_range_many()
135 g_assert(interval_tree_iter_first(&root, 111, 199) == &nodes[0]); in test_find_one_range_many()
136 g_assert(interval_tree_iter_first(&root, 190, 199) == &nodes[0]); in test_find_one_range_many()
137 g_assert(interval_tree_iter_first(&root, 192, 199) == NULL); in test_find_one_range_many()
143 g_assert(interval_tree_iter_first(&root, 100, 300) == &nodes[0]); in test_find_one_range_many()
146 interval_tree_remove(&nodes[0], &root); in test_find_one_range_many()
147 g_assert(interval_tree_iter_first(&root, 100, 199) == NULL); in test_find_one_range_many()
150 interval_tree_remove(&nodes[i], &root); in test_find_one_range_many()
176 interval_tree_insert(&nodes[i], &root); in test_find_many_range()
180 find = interval_tree_iter_first(&root, 2000, 2999); in test_find_many_range()
186 g_assert(interval_tree_iter_first(&root, 0, 999) == NULL); in test_find_many_range()
187 g_assert(interval_tree_iter_first(&root, 1900, 1999) == NULL); in test_find_many_range()
188 g_assert(interval_tree_iter_first(&root, 3000, 3099) == NULL); in test_find_many_range()
189 g_assert(interval_tree_iter_first(&root, 4000, UINT64_MAX) == NULL); in test_find_many_range()
192 interval_tree_remove(&nodes[i], &root); in test_find_many_range()