Searched refs:rootleaf (Results 1 – 9 of 9) sorted by relevance
/dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
H A D | mrca.c | 69 *rootleaf = trueID[0]; in inittree_mrca() 87 mrcamatrix[*rootleaf][i] = 0; in inittree_mrca() 88 mrcamatrix[i][*rootleaf] = 0; in inittree_mrca() 217 mrcamatrix[rootleaf][newleaf] = in_nextedge; in updatetreeclusters_mrca() 218 mrcamatrix[newleaf][rootleaf] = in_nextedge; in updatetreeclusters_mrca() 222 mrcamatrix[rootleaf][n] = in_nextedge; in updatetreeclusters_mrca() 223 mrcamatrix[n][rootleaf] = in_nextedge; in updatetreeclusters_mrca() 422 if (edgeofleaf[rootleaf] == dockedge) in addnextleaf_mrca() 423 edgeofleaf[rootleaf] = nextedge; in addnextleaf_mrca() 571 rootedge = edgeofleaf[rootleaf]; in computepenaltiestree_mrca() [all …]
|
H A D | pstep.c | 87 int rootleaf) /* root leaf of tree */ in writetree() argument 92 column += fputid(outfp, rootleaf) + 3; in writetree() 95 …writeOTU(outfp, edge[edgeofleaf[rootleaf]].downleft->numedge, edge, edgeofleaf, nextedge, nextleaf… in writetree() 100 …writeOTU(outfp, edge[edgeofleaf[rootleaf]].downright->numedge, edge, edgeofleaf, nextedge, nextlea… in writetree() 228 int *rootleaf, /* out: rooting leaf (=trueID[0]) */ in inittree_orig() argument 306 *rootleaf = trueID[0]; in inittree_orig() 315 int rootleaf, /* uppest leaf */ in addnextleaf_orig() argument 347 if (edgeofleaf[rootleaf] == dockedge) edgeofleaf[rootleaf] = nextedge; in addnextleaf_orig() 597 int *rootleaf, /* out: root leaf in topol, starting perm[0] */ in onepstep_orig() argument 662 *rootleaf = tmprootleaf; /* export root edge */ in onepstep_orig()
|
H A D | pstep.h | 248 int rootleaf); /* root leaf of tree */ 313 int *rootleaf, /* out: root leaf in topol, starting perm[0] */ 370 int *rootleaf, /* out: root leaf in topol, starting perm[0] */
|
H A D | recur.c | 22 int *rootleaf, /* out: rooting leaf (=trueID[0]) */ in inittree_recur() argument 100 *rootleaf = trueID[0]; in inittree_recur() 384 int rootleaf, /* uppest leaf */ in addnextleaf_recur() argument 416 if (edgeofleaf[rootleaf] == dockedge) in addnextleaf_recur() 417 edgeofleaf[rootleaf] = nextedge; in addnextleaf_recur() 571 int rootleaf, /* idx of uppest edge */ in computepenaltiestree_recur() argument 594 rootedge = edgeofleaf[rootleaf]; in computepenaltiestree_recur() 596 curredge->edgeinfo = leafpenalty[rootleaf]; in computepenaltiestree_recur() 760 int *rootleaf, /* out: root leaf in topol, starting perm[0] */ in onepstep_recur() argument 867 *rootleaf = tmprootleaf; /* export root edge */ in onepstep_recur()
|
H A D | split.c | 22 int *rootleaf, /* out: rooting leaf (=trueID[0]) */ in inittree_split() argument 109 *rootleaf = trueID[0]; in inittree_split() 321 int rootleaf, /* uppest leaf */ in addnextleaf_split() argument 353 if (edgeofleaf[rootleaf] == dockedge) in addnextleaf_split() 354 edgeofleaf[rootleaf] = nextedge; in addnextleaf_split() 458 int *rootleaf, /* out: root leaf in topol, starting perm[0] */ in onepstep_split() argument 554 *rootleaf = tmprootleaf; /* export root edge */ in onepstep_split()
|
H A D | recur-old.c | 22 int *rootleaf, /* out: rooting leaf (=trueID[0]) */ in inittree_recur() argument 113 *rootleaf = trueID[0]; in inittree_recur() 327 int rootleaf, /* uppest leaf */ in addnextleaf_recur() argument 360 if (edgeofleaf[rootleaf] == dockedge) in addnextleaf_recur() 361 edgeofleaf[rootleaf] = nextedge; in addnextleaf_recur() 506 int rootleaf, /* idx of uppest edge */ in computepenaltiestree_recur() argument 530 rootedge = edgeofleaf[rootleaf]; in computepenaltiestree_recur() 532 curredge->edgeinfo = leafpenalty[rootleaf]; in computepenaltiestree_recur() 718 int *rootleaf, /* out: root leaf in topol, starting perm[0] */ in onepstep_recur() argument 876 *rootleaf = tmprootleaf; /* export root edge */ in onepstep_recur()
|
H A D | treesort.c | 291 int rootleaf, in copytree() argument 304 ctree[ct_sortkeyaddr(0)] = rootleaf; in copytree() 311 &ct_nextleaf, edgeset[edgeofleaf[rootleaf]].downleft->numedge, in copytree() 316 &ct_nextleaf, edgeset[edgeofleaf[rootleaf]].downright->numedge, in copytree()
|
H A D | treesort.h | 134 int rootleaf,
|
/dports/textproc/p5-Unicode-Tussle/Unicode-Tussle-1.111/data/ |
H A D | words.utf8 | 374895 rootleaf ˈroot-leaf [n.]
|