Searched refs:Currtrial (Results 1 – 6 of 6) sorted by relevance
| /dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
| H A D | pstep-mrca.c | 529 uli Currtrial; /* step counter */ in allpstep() local
561 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
585 bp[Currtrial], outgroup, Maxspc); in allpstep()
591 makenewsplitentries(bp[Currtrial], Maxspc-3, in allpstep()
626 Currtrial + 1, (*treeitem).count, (*treeitem).id, psteptreenum, psteptreesum); in allpstep()
653 tc2 = 100.0*Currtrial/Numtrial; in allpstep()
678 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
679 free_cmatrix(bp[Currtrial]); in allpstep()
|
| H A D | pstep-recursive.c | 529 uli Currtrial; /* step counter */ in allpstep() local
561 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
585 bp[Currtrial], outgroup, Maxspc); in allpstep()
591 makenewsplitentries(bp[Currtrial], Maxspc-3, in allpstep()
626 Currtrial + 1, (*treeitem).count, (*treeitem).id, psteptreenum, psteptreesum); in allpstep()
653 tc2 = 100.0*Currtrial/Numtrial; in allpstep()
678 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
679 free_cmatrix(bp[Currtrial]); in allpstep()
|
| H A D | pstep-trueID.c | 541 uli Currtrial; /* step counter */ in allpstep() local
573 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
606 bp[Currtrial], outgroup, Maxspc); in allpstep()
612 makenewsplitentries(bp[Currtrial], Maxspc-3, in allpstep()
648 Currtrial + 1, (*treeitem).count, (*treeitem).id, psteptreenum, psteptreesum); in allpstep()
675 tc2 = 100.0*Currtrial/Numtrial; in allpstep()
700 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
701 free_cmatrix(bp[Currtrial]); in allpstep()
|
| H A D | pstep-split.c | 670 uli Currtrial; /* step counter */ in allpstep_split() local
702 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep_split()
733 bp[Currtrial], outgroup, Maxspc); in allpstep_split()
739 makenewsplitentries(bp[Currtrial], Maxspc-3, in allpstep_split()
774 Currtrial + 1, (*treeitem).count, (*treeitem).id, psteptreenum, psteptreesum); in allpstep_split()
801 tc2 = 100.0*Currtrial/Numtrial; in allpstep_split()
826 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep_split()
827 free_cmatrix(bp[Currtrial]); in allpstep_split()
|
| H A D | pstep.c | 707 uli Currtrial; /* step counter */ in allpstep() local
746 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
804 bp[Currtrial], outgroup, Maxspc); in allpstep()
810 makenewsplitentries(bp[Currtrial], Maxspc-3, in allpstep()
847 Currtrial + 1, (*treeitem).count, in allpstep()
879 checktime(&time0, &time1, &time2, Currtrial, Numtrial, &mflag); in allpstep()
899 for (Currtrial = 0; Currtrial < Numtrial; Currtrial++) { in allpstep()
900 free_cmatrix(bp[Currtrial]); in allpstep()
|
| H A D | puzzle.h | 325 EXTERN uli Currtrial; /* counter for puzzling steps */ variable
|