| /dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
| H A D | pstep-deglob.c | 415 uli mininfo; /* minumum penalty */ in minimumedgeinfo_orig() local
419 mininfo = edge[0].edgeinfo; in minimumedgeinfo_orig()
421 if (edge[i].edgeinfo <= mininfo) { in minimumedgeinfo_orig()
422 if (edge[i].edgeinfo == mininfo) { in minimumedgeinfo_orig()
426 mininfo = edge[i].edgeinfo; in minimumedgeinfo_orig()
437 } while (edge[i].edgeinfo != mininfo); in minimumedgeinfo_orig()
443 *out_mininfo=mininfo; in minimumedgeinfo_orig()
|
| H A D | pstep-mrca.c | 421 uli mininfo; /* minumum penalty */ in minimumedgeinfo_orig() local
425 mininfo = edge[0].edgeinfo; in minimumedgeinfo_orig()
427 if (edge[i].edgeinfo <= mininfo) { in minimumedgeinfo_orig()
428 if (edge[i].edgeinfo == mininfo) { in minimumedgeinfo_orig()
432 mininfo = edge[i].edgeinfo; in minimumedgeinfo_orig()
443 } while (edge[i].edgeinfo != mininfo); in minimumedgeinfo_orig()
449 *out_mininfo=mininfo; in minimumedgeinfo_orig()
472 uli mininfo; /* minimum penalty */ in onepstep() local
509 minimumedgeinfo_orig(*edge, *edgeofleaf, nextedge, nextleaf, &minedge, &mininfo); in onepstep()
|
| H A D | pstep-recursive.c | 421 uli mininfo; /* minumum penalty */ in minimumedgeinfo_orig() local
425 mininfo = edge[0].edgeinfo; in minimumedgeinfo_orig()
427 if (edge[i].edgeinfo <= mininfo) { in minimumedgeinfo_orig()
428 if (edge[i].edgeinfo == mininfo) { in minimumedgeinfo_orig()
432 mininfo = edge[i].edgeinfo; in minimumedgeinfo_orig()
443 } while (edge[i].edgeinfo != mininfo); in minimumedgeinfo_orig()
449 *out_mininfo=mininfo; in minimumedgeinfo_orig()
472 uli mininfo; /* minimum penalty */ in onepstep() local
509 minimumedgeinfo_orig(*edge, *edgeofleaf, nextedge, nextleaf, &minedge, &mininfo); in onepstep()
|
| H A D | pstep-trueID.c | 431 uli mininfo; /* minumum penalty */ in minimumedgeinfo_orig() local
435 mininfo = edge[0].edgeinfo; in minimumedgeinfo_orig()
437 if (edge[i].edgeinfo <= mininfo) { in minimumedgeinfo_orig()
438 if (edge[i].edgeinfo == mininfo) { in minimumedgeinfo_orig()
442 mininfo = edge[i].edgeinfo; in minimumedgeinfo_orig()
453 } while (edge[i].edgeinfo != mininfo); in minimumedgeinfo_orig()
459 *out_mininfo=mininfo; in minimumedgeinfo_orig()
483 uli mininfo; /* minimum penalty */ in onepstep() local
521 minimumedgeinfo_orig(*edge, *edgeofleaf, nextedge, nextleaf, &minedge, &mininfo); in onepstep()
|
| H A D | pstep-split.c | 559 uli mininfo; /* minumum penalty */ in minimumedgeinfo_split() local
563 mininfo = edge[0].penalty; in minimumedgeinfo_split()
565 if (edge[i].penalty <= mininfo) { in minimumedgeinfo_split()
566 if (edge[i].penalty == mininfo) { in minimumedgeinfo_split()
570 mininfo = edge[i].penalty; in minimumedgeinfo_split()
581 } while (edge[i].penalty != mininfo); in minimumedgeinfo_split()
587 *out_mininfo=mininfo; in minimumedgeinfo_split()
611 uli mininfo; /* minimum penalty */ in onepstep_split() local
649 minimumedgeinfo_split(*edge, *edgeofleaf, nextedge, nextleaf, &minedge, &mininfo); in onepstep_split()
|
| H A D | pstep-orig.c | 350 mininfo = edge[0].edgeinfo; in minimumedgeinfo()
352 if (edge[i].edgeinfo <= mininfo) { in minimumedgeinfo()
353 if (edge[i].edgeinfo == mininfo) { in minimumedgeinfo()
357 mininfo = edge[i].edgeinfo; in minimumedgeinfo()
368 } while (edge[i].edgeinfo != mininfo); in minimumedgeinfo()
|
| H A D | pstep-orig.h | 60 uli mininfo; /* value of edgeinfo on minedge */ variable
|
| H A D | pstep-mrca.h | 138 uli *mininfo); /* minumum penalty */
|
| H A D | pstep-recursive.h | 138 uli *mininfo); /* minumum penalty */
|
| H A D | pstep-trueID.h | 138 uli *mininfo); /* minumum penalty */
|
| H A D | pstep-deglob.h | 156 uli *mininfo); /* minumum penalty */
|
| H A D | pstep-split.h | 164 uli *mininfo); /* minumum penalty */
|
| H A D | mrca.c | 764 uli mininfo; /* minimum penalty */ in onepstep_mrca() local
854 &minedges, &howmany, &mininfo, &minedge); in onepstep_mrca()
870 minedges, &howmany, &mininfo, &minedge); in onepstep_mrca()
|
| H A D | recur.c | 771 uli mininfo; /* minimum penalty */ in onepstep_recur() local
853 &minedges, &howmany, &mininfo, &minedge); in onepstep_recur()
858 minedges, &howmany, &mininfo, &minedge); in onepstep_recur()
|
| H A D | split.c | 469 uli mininfo; /* minimum penalty */ in onepstep_split() local
545 minedges, &howmany, &mininfo, &minedge); in onepstep_split()
|
| H A D | recur-old.c | 729 uli mininfo; /* minimum penalty */ in onepstep_recur() local
849 &minedges, &howmany, &mininfo, &minedge); in onepstep_recur()
854 &minedges, &howmany, &mininfo, &minedge); in onepstep_recur()
|
| H A D | pstep.c | 608 uli mininfo; /* minimum penalty */ in onepstep_orig() local
654 …inimumedgeinfo(tmpedge, tmpedgeofleaf, nextedge, nextleaf, minedges, &howmany, &minedge, &mininfo); in onepstep_orig()
|