57,7 → 57,7 |
static extavltree_node_t *exttree_test_parents(extavltree_node_t *node); |
static void print_exttree_structure_flat (extavltree_node_t *node, int level); |
static bool exttree_test_link(int node_count); |
static void print_exttree_link(int node_count); |
static void print_exttree_link(void); |
static extavltree_node_t *alloc_extavltree_node(void); |
|
|
124,7 → 124,7 |
test_link = false; |
} |
} |
if (node_count && i != node_count) { |
if (i != node_count) { |
printf("\nBad node count!!! Counted: %d, right number: %d", i, node_count); |
test_link = false; |
} |
134,7 → 134,7 |
test_link = false; |
} |
} |
if (node_count && i != node_count) { |
if (i != node_count) { |
printf("\nBad node count!!! Counted: %d, right number: %d", i, node_count); |
test_link = false; |
} |
180,7 → 180,7 |
/** Prints list of nodes |
* |
*/ |
static void print_exttree_link(int node_count) |
static void print_exttree_link(void) |
{ |
extavltree_node_t *node; |
printf("\n"); |
260,7 → 260,7 |
*/ |
extavltree_create(tree); |
|
if (!quiet) printf("\n\nInserting %d nodes ...\n", node_count); |
if (!quiet) printf("\nInserting %d nodes ...\n", node_count); |
|
for (i = 0; i < node_count; i++) { |
newnode = alloc_extavltree_node(); |
269,7 → 269,7 |
extavltree_insert(tree, newnode); |
if (!quiet) { |
if (!exttree_test_link(i+1)) { |
print_exttree_link(i+1); |
print_exttree_link(); |
printf("\n"); |
} |
exttree_test_parents(tree->root); |
310,14 → 310,14 |
|
switch(node_position) { |
case 0: //mazani vzdy korene |
if (!quiet) printf("\n\nDelete root nodes\n"); |
i = node_count; |
if (!quiet) printf("\nDelete root nodes\n"); |
i = node_count - 1; |
while(tree->root != NULL) { |
delnode = tree->root; |
extavltree_delete(tree,delnode); |
if (!quiet) { |
if (!exttree_test_link(i)) { |
print_exttree_link(i); |
print_exttree_link(); |
printf("\n"); |
} |
exttree_test_parents(tree->root); |
328,12 → 328,12 |
|
break; |
case 1: |
if (!quiet) printf("\n\nDelete nodes according to their time of origin\n"); |
if (!quiet) printf("\nDelete nodes according to their time of origin\n"); |
for (i = 0; i < node_count; i++) { |
extavltree_delete(tree,&(extavltree_nodes[i])); |
if (!quiet) { |
if (!exttree_test_link(i+1)) { |
print_exttree_link(i+1); |
if (!exttree_test_link(node_count-i-1)) { |
print_exttree_link(); |
printf("\n"); |
} |
exttree_test_parents(tree->root); |
349,15 → 349,15 |
|
static void timeout_exttree(extavltree_t *tree, int node_count, bool quiet) |
{ |
int i = node_count; |
int i = node_count - 1; |
|
if (!quiet) printf("Timeout tree ...\n"); |
if (!quiet) printf("\nTimeout tree ...\n"); |
|
while(tree->head.next != &(tree->head)) { |
extavltree_delete_min(tree); |
if (!quiet) { |
if (!exttree_test_link(i)) { |
print_exttree_link(i); |
print_exttree_link(); |
printf("\n"); |
} |
exttree_test_parents(tree->root); |
366,7 → 366,7 |
i--; |
} |
|
if (!quiet && (i != 0)) printf("Bad node count. Some nodes have been lost!"); |
if (!quiet && (i != -1)) printf("Bad node count. Some nodes have been lost!\n"); |
|
if (!quiet) printf("Timeout tree finished\n"); |
} |