Lines Matching full:tree
6 * https://gitlab.gnome.org/GNOME/glib/-/blob/main/glib/tests/tree.c
94 QTree *tree; in test_tree_search() local
99 tree = q_tree_new_with_data(my_compare_with_data, GINT_TO_POINTER(123)); in test_tree_search()
102 q_tree_insert(tree, &chars[i], &chars[i]); in test_tree_search()
105 q_tree_foreach(tree, my_traverse, NULL); in test_tree_search()
107 g_assert(q_tree_nnodes(tree) == strlen(chars)); in test_tree_search()
108 g_assert(q_tree_height(tree) == 6); in test_tree_search()
111 q_tree_foreach(tree, check_order, &p); in test_tree_search()
114 removed = q_tree_remove(tree, &chars[i + 10]); in test_tree_search()
119 removed = q_tree_remove(tree, &c); in test_tree_search()
122 q_tree_foreach(tree, my_traverse, NULL); in test_tree_search()
124 g_assert(q_tree_nnodes(tree) == strlen(chars2)); in test_tree_search()
125 g_assert(q_tree_height(tree) == 6); in test_tree_search()
128 q_tree_foreach(tree, check_order, &p); in test_tree_search()
131 q_tree_insert(tree, &chars[i + 10], &chars[i + 10]); in test_tree_search()
135 q_tree_foreach(tree, check_order, &p); in test_tree_search()
138 p = q_tree_lookup(tree, &c); in test_tree_search()
140 g_assert(q_tree_lookup_extended(tree, &c, (gpointer *)&d, (gpointer *)&p)); in test_tree_search()
144 p = q_tree_lookup(tree, &c); in test_tree_search()
148 p = q_tree_lookup(tree, &c); in test_tree_search()
152 p = q_tree_lookup(tree, &c); in test_tree_search()
156 p = q_tree_lookup(tree, &c); in test_tree_search()
160 p = q_tree_lookup(tree, &c); in test_tree_search()
164 p = q_tree_lookup(tree, &c); in test_tree_search()
168 p = q_tree_search(tree, my_search, &c); in test_tree_search()
172 p = q_tree_search(tree, my_search, &c); in test_tree_search()
176 p = q_tree_search(tree, my_search, &c); in test_tree_search()
180 p = q_tree_search(tree, my_search, &c); in test_tree_search()
184 p = q_tree_search(tree, my_search, &c); in test_tree_search()
188 p = q_tree_search(tree, my_search, &c); in test_tree_search()
192 p = q_tree_search(tree, my_search, &c); in test_tree_search()
195 q_tree_destroy(tree); in test_tree_search()
200 QTree *tree; in test_tree_remove() local
205 tree = q_tree_new_full((GCompareDataFunc)my_compare, NULL, in test_tree_remove()
210 q_tree_insert(tree, &chars[i], &chars[i]); in test_tree_remove()
214 q_tree_insert(tree, &c, &c); in test_tree_remove()
221 q_tree_replace(tree, &d, &d); in test_tree_remove()
228 removed = q_tree_remove(tree, &c); in test_tree_remove()
236 removed = q_tree_steal(tree, &c); in test_tree_remove()
243 removed = q_tree_remove(tree, &remove[i]); in test_tree_remove()
247 q_tree_destroy(tree); in test_tree_remove()
252 QTree *tree; in test_tree_destroy() local
255 tree = q_tree_new(my_compare); in test_tree_destroy()
258 q_tree_insert(tree, &chars[i], &chars[i]); in test_tree_destroy()
261 g_assert(q_tree_nnodes(tree) == strlen(chars)); in test_tree_destroy()
263 g_test_message("nnodes: %d", q_tree_nnodes(tree)); in test_tree_destroy()
264 q_tree_ref(tree); in test_tree_destroy()
265 q_tree_destroy(tree); in test_tree_destroy()
267 g_test_message("nnodes: %d", q_tree_nnodes(tree)); in test_tree_destroy()
268 g_assert(q_tree_nnodes(tree) == 0); in test_tree_destroy()
270 q_tree_unref(tree); in test_tree_destroy()
275 QTree *tree; in test_tree_insert() local
280 tree = q_tree_new(my_compare); in test_tree_insert()
283 q_tree_insert(tree, &chars[i], &chars[i]); in test_tree_insert()
286 q_tree_foreach(tree, check_order, &p); in test_tree_insert()
288 q_tree_unref(tree); in test_tree_insert()
289 tree = q_tree_new(my_compare); in test_tree_insert()
292 q_tree_insert(tree, &chars[i], &chars[i]); in test_tree_insert()
295 q_tree_foreach(tree, check_order, &p); in test_tree_insert()
297 q_tree_unref(tree); in test_tree_insert()
298 tree = q_tree_new(my_compare); in test_tree_insert()
314 q_tree_insert(tree, &scrambled[i], &scrambled[i]); in test_tree_insert()
317 q_tree_foreach(tree, check_order, &p); in test_tree_insert()
320 q_tree_unref(tree); in test_tree_insert()