12 static IntervalTreeNode nodes[20];  variable
41     nodes[0].start = 1;  in test_find_one_point()
42     nodes[0].last = 1;  in test_find_one_point()
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()
47     g_assert(interval_tree_iter_next(&nodes[0], 0, 9) == NULL);  in test_find_one_point()
49     g_assert(interval_tree_iter_next(&nodes[0], 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()
55     interval_tree_remove(&nodes[0], &root);  in test_find_one_point()
64     /* Create a tree of a two nodes, which are both the point [1,1]. */  in test_find_two_point()
65     nodes[0].start = 1;  in test_find_two_point()
66     nodes[0].last = 1;  in test_find_two_point()
67     nodes[1] = nodes[0];  in test_find_two_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()
73     g_assert(find0 == &nodes[0] || find0 == &nodes[1]);  in test_find_two_point()
76     g_assert(find1 == &nodes[0] || find1 == &nodes[1]);  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()
82     g_assert(interval_tree_iter_next(&nodes[0], 0, 9) == NULL);  in test_find_two_point()
84     interval_tree_remove(&nodes[0], &root);  in test_find_two_point()
90     nodes[0].start = 1;  in test_find_one_range()
91     nodes[0].last = 8;  in test_find_one_range()
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()
96     g_assert(interval_tree_iter_next(&nodes[0], 0, 9) == 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()
104     interval_tree_remove(&nodes[0], &root);  in test_find_one_range()
112      * Create a tree of many nodes in [0,99] and [200,299],  in test_find_one_range_many()
115     nodes[0].start = 110;  in test_find_one_range_many()
116     nodes[0].last = 190;  in test_find_one_range_many()
118     for (i = 1; i < ARRAY_SIZE(nodes) / 2; ++i) {  in test_find_one_range_many()
119         rand_interval(&nodes[i], 0, 99);  in test_find_one_range_many()
121     for (; i < ARRAY_SIZE(nodes); ++i) {  in test_find_one_range_many()
122         rand_interval(&nodes[i], 200, 299);  in test_find_one_range_many()
125     for (i = 0; i < ARRAY_SIZE(nodes); ++i) {  in test_find_one_range_many()
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()
131     g_assert(interval_tree_iter_next(&nodes[0], 100, 199) == 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()
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()
149     for (i = 1; i < ARRAY_SIZE(nodes); ++i) {  in test_find_one_range_many()
150         interval_tree_remove(&nodes[i], &root);  in test_find_one_range_many()
159     n = g_test_rand_int_range(ARRAY_SIZE(nodes) / 3, ARRAY_SIZE(nodes) / 2);  in test_find_many_range()
162      * Create a fair few nodes in [2000,2999], with the others  in test_find_many_range()
166         rand_interval(&nodes[i], 2000, 2999);  in test_find_many_range()
168     for (; i < ARRAY_SIZE(nodes) * 2 / 3; ++i) {  in test_find_many_range()
169         rand_interval(&nodes[i], 1000, 1899);  in test_find_many_range()
171     for (; i < ARRAY_SIZE(nodes); ++i) {  in test_find_many_range()
172         rand_interval(&nodes[i], 3100, 3999);  in test_find_many_range()
175     for (i = 0; i < ARRAY_SIZE(nodes); ++i) {  in test_find_many_range()
176         interval_tree_insert(&nodes[i], &root);  in test_find_many_range()
179     /* Test that we find all of the nodes. */  in test_find_many_range()
191     for (i = 0; i < ARRAY_SIZE(nodes); ++i) {  in test_find_many_range()
192         interval_tree_remove(&nodes[i], &root);  in test_find_many_range()