Lines Matching refs:k
224 unsigned i, j, k, black_height, imbalances; in TEST_BEGIN() local
248 for (k = 0; k < j; k++) { in TEST_BEGIN()
249 nodes[k].magic = NODE_MAGIC; in TEST_BEGIN()
250 nodes[k].key = bag[k]; in TEST_BEGIN()
254 for (k = 0; k < j; k++) { in TEST_BEGIN()
255 tree_insert(&tree, &nodes[k]); in TEST_BEGIN()
264 assert_u_eq(tree_iterate(&tree), k+1, in TEST_BEGIN()
266 assert_u_eq(tree_iterate_reverse(&tree), k+1, in TEST_BEGIN()
276 tree_next(&tree, &nodes[k]); in TEST_BEGIN()
277 tree_prev(&tree, &nodes[k]); in TEST_BEGIN()
283 for (k = 0; k < j; k++) in TEST_BEGIN()
284 node_remove(&tree, &nodes[k], j - k); in TEST_BEGIN()
287 for (k = j; k > 0; k--) in TEST_BEGIN()
288 node_remove(&tree, &nodes[k-1], k); in TEST_BEGIN()