81     char **p = data;  in check_order()  local
84     g_assert(**p == *ch);  in check_order()
86     (*p)++;  in check_order()
97     gchar *p, *d;  in test_tree_search()  local
110     p = chars;  in test_tree_search()
111     q_tree_foreach(tree, check_order, &p);  in test_tree_search()
127     p = chars2;  in test_tree_search()
128     q_tree_foreach(tree, check_order, &p);  in test_tree_search()
134     p = chars;  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()
139     g_assert(p && *p == c);  in test_tree_search()
140     g_assert(q_tree_lookup_extended(tree, &c, (gpointer *)&d, (gpointer *)&p));  in test_tree_search()
141     g_assert(c == *d && c == *p);  in test_tree_search()
144     p = q_tree_lookup(tree, &c);  in test_tree_search()
145     g_assert(p && *p == c);  in test_tree_search()
148     p = q_tree_lookup(tree, &c);  in test_tree_search()
149     g_assert(p && *p == c);  in test_tree_search()
152     p = q_tree_lookup(tree, &c);  in test_tree_search()
153     g_assert(p && *p == c);  in test_tree_search()
156     p = q_tree_lookup(tree, &c);  in test_tree_search()
157     g_assert(p == NULL);  in test_tree_search()
160     p = q_tree_lookup(tree, &c);  in test_tree_search()
161     g_assert(p == NULL);  in test_tree_search()
164     p = q_tree_lookup(tree, &c);  in test_tree_search()
165     g_assert(p == NULL);  in test_tree_search()
168     p = q_tree_search(tree, my_search, &c);  in test_tree_search()
169     g_assert(p && *p == c);  in test_tree_search()
172     p = q_tree_search(tree, my_search, &c);  in test_tree_search()
173     g_assert(p && *p == c);  in test_tree_search()
176     p = q_tree_search(tree, my_search, &c);  in test_tree_search()
177     g_assert(p && *p == c);  in test_tree_search()
180     p = q_tree_search(tree, my_search, &c);  in test_tree_search()
181     g_assert(p && *p == c);  in test_tree_search()
184     p = q_tree_search(tree, my_search, &c);  in test_tree_search()
185     g_assert(p == NULL);  in test_tree_search()
188     p = q_tree_search(tree, my_search, &c);  in test_tree_search()
189     g_assert(p == NULL);  in test_tree_search()
192     p = q_tree_search(tree, my_search, &c);  in test_tree_search()
193     g_assert(p == NULL);  in test_tree_search()
276     gchar *p;  in test_tree_insert()  local
285     p = chars;  in test_tree_insert()
286     q_tree_foreach(tree, check_order, &p);  in test_tree_insert()
294     p = chars;  in test_tree_insert()
295     q_tree_foreach(tree, check_order, &p);  in test_tree_insert()
316     p = chars;  in test_tree_insert()
317     q_tree_foreach(tree, check_order, &p);  in test_tree_insert()