int main (int argc, char *argv[]) { Lump_s a; Lump_s b; Lump_s p; int i; for (i = 0; i < 20; i++) { a = rnd_lump(); b = rnd_lump(); p = prefix(a, b); printf("%.*s %.*s %.*s\n", LUMP(a), LUMP(b), LUMP(p)); } return 0; }
void test_seq(int n) { BiTree_s tree = { 0 }; Rec_s rec; unint i; if (FALSE) seed_random(); for (i = 0; i < n; i++) { rec.key = seq_lump(); rec.val = rnd_lump(); bi_insert(&tree, rec); } bi_print(&tree); }
void test_bi_find(int n) { BiTree_s tree = { 0 }; Rec_s rec; unint i; if (FALSE) seed_random(); for (i = 0; i < n; i++) { rec.key = fixed_lump(7); rec.val = rnd_lump(); r_add(rec); bi_insert(&tree, rec); } r_for_each(find_find, &tree); bi_audit(&tree); }
void test_rnd(int n) { BiTree_s tree = { 0 }; Rec_s rec; unint i; if (FALSE) seed_random(); for (i = 0; i < n; i++) { rec.key = fixed_lump(7); rec.val = rnd_lump(); bi_insert(&tree, rec); } // bi_print(&tree); // pr_all_records(&tree); // pr_tree(&tree); bi_audit(&tree); }