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

2
oper.c
View File

@@ -59,7 +59,7 @@ void gen_combinations(nops)
int len_ops=strlen(ops); int len_ops=strlen(ops);
n_combs=n_combine(len_ops, nops); n_combs=n_combine(len_ops, nops);
printf("gen: n=%d\n", n_combs); //printf("gen: n=%d\n", n_combs);
for (i=0; i<n_combs; ++i) { for (i=0; i<n_combs; ++i) {
combs[ncombs]=strdup(combine(ops, nops, i)); combs[ncombs]=strdup(combine(ops, nops, i));
ncombs++; ncombs++;

4
stack.c
View File

@@ -74,7 +74,7 @@ STACK *new_stack(size, name, keep)
} }
stack=allstacks+laststack; stack=allstacks+laststack;
printf("new_stack %d/%d: address=%p\n", laststack, totalstacks, stack); //printf("new_stack %d/%d: address=%p\n", laststack, totalstacks, stack);
laststack++; laststack++;
//malloc(sizeof (STACK)); //malloc(sizeof (STACK));
//stack->stack=NULL; //stack->stack=NULL;
@@ -216,7 +216,7 @@ int gen_stacks(stack)
//printf("Permute : "); //printf("Permute : ");
//print_stack(stack, 0); //print_stack(stack, 0);
if (exists) { if (exists) {
printf("++++++++++++++++ Adding stack... "); //printf("++++++++++++++++ Adding stack... ");
new=dup_stack(stack, name); new=dup_stack(stack, name);
// print_stack(new, 0); // print_stack(new, 0);
//keep_stack(new); //keep_stack(new);