70 char chars[] =  variable
101     for (i = 0; chars[i]; i++) {  in test_tree_search()
102         q_tree_insert(tree, &chars[i], &chars[i]);  in test_tree_search()
107     g_assert(q_tree_nnodes(tree) == strlen(chars));  in test_tree_search()
110     p = chars;  in test_tree_search()
114         removed = q_tree_remove(tree, &chars[i + 10]);  in test_tree_search()
131         q_tree_insert(tree, &chars[i + 10], &chars[i + 10]);  in test_tree_search()
134     p = chars;  in test_tree_search()
209     for (i = 0; chars[i]; i++) {  in test_tree_remove()
210         q_tree_insert(tree, &chars[i], &chars[i]);  in test_tree_remove()
216     g_assert(destroyed_value == &chars[0]);  in test_tree_remove()
222     g_assert(destroyed_key == &chars[1]);  in test_tree_remove()
223     g_assert(destroyed_value == &chars[1]);  in test_tree_remove()
230     g_assert(destroyed_key == &chars[2]);  in test_tree_remove()
231     g_assert(destroyed_value == &chars[2]);  in test_tree_remove()
257     for (i = 0; chars[i]; i++) {  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()
282     for (i = 0; chars[i]; i++) {  in test_tree_insert()
283         q_tree_insert(tree, &chars[i], &chars[i]);  in test_tree_insert()
285     p = chars;  in test_tree_insert()
291     for (i = strlen(chars) - 1; i >= 0; i--) {  in test_tree_insert()
292         q_tree_insert(tree, &chars[i], &chars[i]);  in test_tree_insert()
294     p = chars;  in test_tree_insert()
300     scrambled = g_strdup(chars);  in test_tree_insert()
316     p = chars;  in test_tree_insert()