| /dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
| H A D | pstep-mrca.c | 522 void allpstep(uli Numtrial, /* in: no. psteps to perform */ in allpstep() argument
552 bp = (cmatrix *) calloc((size_t) Numtrial, sizeof(void *)); in allpstep()
553 for(n=0; n<Numtrial; n++) { in allpstep()
561 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
653 tc2 = 100.0*Currtrial/Numtrial; in allpstep()
675 PP_SendSplitsBlock(Maxspc, Numtrial, bp, psteptreenum, psteptreelist); in allpstep()
678 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
|
| H A D | pstep-recursive.c | 522 void allpstep(uli Numtrial, /* in: no. psteps to perform */ in allpstep() argument
552 bp = (cmatrix *) calloc((size_t) Numtrial, sizeof(void *)); in allpstep()
553 for(n=0; n<Numtrial; n++) { in allpstep()
561 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
653 tc2 = 100.0*Currtrial/Numtrial; in allpstep()
675 PP_SendSplitsBlock(Maxspc, Numtrial, bp, psteptreenum, psteptreelist); in allpstep()
678 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
|
| H A D | pstep-trueID.c | 534 void allpstep(uli Numtrial, /* in: no. psteps to perform */ in allpstep() argument
564 bp = (cmatrix *) calloc((size_t) Numtrial, sizeof(void *)); in allpstep()
565 for(n=0; n<Numtrial; n++) { in allpstep()
573 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
675 tc2 = 100.0*Currtrial/Numtrial; in allpstep()
697 PP_SendSplitsBlock(Maxspc, Numtrial, bp, psteptreenum, psteptreelist); in allpstep()
700 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
|
| H A D | pstep.c | 700 void allpstep(uli Numtrial, /* in: no. psteps to perform */ in allpstep() argument
734 bp = (cmatrix *) calloc((size_t) Numtrial, sizeof(void *)); in allpstep()
735 for(n=0; n<Numtrial; n++) { in allpstep()
746 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
879 checktime(&time0, &time1, &time2, Currtrial, Numtrial, &mflag); in allpstep()
891 (double)(benchtime1-benchtime0)/60.0, Numtrial, Maxspc); in allpstep()
896 PP_SendSplitsBlock(Maxspc, Numtrial, bp, psteptreenum, psteptreelist); in allpstep()
899 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
|
| H A D | pstep-split.c | 662 void allpstep_split(uli Numtrial, /* in: no. psteps to perform */ in allpstep_split() argument
693 bp = (cmatrix *) calloc((size_t) Numtrial, sizeof(void *)); in allpstep_split()
694 for(n=0; n<Numtrial; n++) { in allpstep_split()
702 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep_split()
801 tc2 = 100.0*Currtrial/Numtrial; in allpstep_split()
823 PP_SendSplitsBlock(Maxspc, Numtrial, bp, psteptreenum, psteptreelist); in allpstep_split()
826 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep_split()
|
| H A D | pstep-mrca.h | 154 void allpstep(uli Numtrial, /* in: no. psteps to perform */
|
| H A D | pstep-recursive.h | 154 void allpstep(uli Numtrial, /* in: no. psteps to perform */
|
| H A D | pstep-trueID.h | 154 void allpstep(uli Numtrial, /* in: no. psteps to perform */
|
| H A D | pstep-split.h | 180 void allpstep_split(uli Numtrial, /* in: no. psteps to perform */
|
| H A D | pstep.h | 382 void allpstep(uli Numtrial, /* in: no. psteps to perform */
|
| H A D | puzzle1.c | 437 if (Maxspc <= 25) Numtrial = 1000;
438 else if (Maxspc <= 50) Numtrial = 10000;
439 else if (Maxspc <= 75) Numtrial = 25000;
440 else Numtrial = 50000;
489 Numtrial);
1149 scanf("%lu", &Numtrial);
1152 if (Numtrial < 1) {
1155 Numtrial = 1000;
3729 fprintf(ofp, "in the %lu puzzling steps.\n", Numtrial);
4801 PP_SendDoPermutBlock(Numtrial);
[all …]
|
| H A D | puzzle.h | 328 EXTERN uli Numtrial; /* number of puzzling steps */ variable
|
| /dports/biology/treepuzzle/tree-puzzle-5.2/ |
| H A D | ChangeLog | 231 O(Numtrial*n^4) to O(Numtrial) -> less overhead,
|