84 static int bt_check_node(bt* tree, bt_node* node) {  in bt_check_node()
112 int bt_check(bt* tree) {  in bt_check()
121     bt* tree = calloc(1, sizeof(bt));  in bt_new()  local
131 int bt_size(bt* tree) {  in bt_size()
135 int bt_height(bt* tree) {  in bt_height()
157 int bt_count_leaves(bt* tree) {  in bt_count_leaves()
169 void bt_free(bt* tree) {  in bt_free()
175 static Pure void* get_element(bt* tree, bt_leaf* leaf, int index) {  in get_element()
184 static Malloc bt_node* bt_new_branch(bt* tree) {  in bt_new_branch()
193 static Malloc bt_node* bt_new_leaf(bt* tree) {  in bt_new_leaf()
204 static anbool bt_leaf_insert(bt* tree, bt_leaf* leaf, void* data, anbool unique,  in bt_leaf_insert()
289 static anbool bt_leaf_contains(bt* tree, bt_leaf* leaf, void* data,  in bt_leaf_contains()
313 anbool bt_contains(bt* tree, void* data, compare_func compare) {  in bt_contains()
317 anbool bt_contains2(bt* tree, void* data, compare_func_2 compare, void* token) {  in bt_contains2()
346 anbool bt_insert(bt* tree, void* data, anbool unique, compare_func compare) {  in bt_insert()
350 anbool bt_insert2(bt* tree, void* data, anbool unique, compare_func_2 compare, void* token) {  in bt_insert2()
662 void* bt_access(bt* tree, int index) {  in bt_access()
676 static void bt_print_node(bt* tree, bt_node* node, char* indent,  in bt_print_node()
709 void bt_print(bt* tree, void (*print_element)(void* val)) {  in bt_print()
720 static void bt_print_struct_node(bt* tree, bt_node* node, char* indent,  in bt_print_struct_node()
745 void bt_print_structure(bt* tree, void (*print_element)(void* val)) {  in bt_print_structure()