bruno/Le-Compte-est-Bon
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Remove useless debug information

Browse Source
This commit is contained in:
Bruno Raoult
2021-01-23 15:48:04 +01:00
parent 5025303e18
commit 1b43433420
3 changed files with 8 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
lceb.c
View File

@@ -40,8 +40,8 @@ int main(ac, av)
gen_combinations(nops);
//ncombs=ncombinations(len_ops, nops);
ncombs=n_combs();
print_combs();
printf("target=%d\nstacksize=%d\nops_comb=%d\n", target, stacksize, ncombs);
//print_combs();
printf("target=%d\nstacksize=%d\n", target, stacksize);
set_target(target);
//printf("len_ops=%d\nnops=%d\nops_comb=%d\n", len_ops, nops, ncombs);
//stack=new_stack(stacksize, "Main Stack", 1);
@@ -53,7 +53,7 @@ int main(ac, av)
//print_stack(stack, 1);
gen_stacks(&inputstack); // printf("sorting stack...\n");
print_stacks();
//print_stacks();
//mergesort_stack(stack->stack, 0, stack->last-1);
//print_stack(stack, 1);
@@ -65,11 +65,10 @@ int main(ac, av)
*/
gen_tree(intarray, nops, 0, 0);
printf("operators combinations : %d\n", ncombs);
nstacks=n_stacks();
ntrees=n_trees();
printf("nstacks=%d\nncombs=%d\nntrees=%d\n", nstacks, ncombs, ntrees);
printf("stacks=%d\noperators combinations=%d\ntrees=%d\n",
nstacks, ncombs, ntrees);
//for (k=0; k<nstacks; ++k) {
// stack=nth_stack(k);
// printf("%%%%%%%%%%%%%%%%%%\n");