Searched refs:treenum (Results 1 – 8 of 8) sorted by relevance
/dports/cad/scotch/scotch-6.0.4/src/libscotch/ |
H A D | kgraph_map_ex.c | 242 Anum treenum; in kgraphMapExTree() local 262 treenum = (*treeptr) ++; /* Reserve slot for node */ in kgraphMapExTree() 274 treetab[sonsnum].fathnum = treenum; in kgraphMapExTree() 277 treetab[treenum].domndat = *domnptr; in kgraphMapExTree() 310 doextab[domnnum].treenum = treenum; /* Record entry point in tree structure */ in kgraphMapExTree() 313 return (treenum); in kgraphMapExTree() 333 Anum treenum; in kgraphMapExFind() local 339 treenum = doextab[domnnum].treenum; /* Start from leaf of subdomain tree */ in kgraphMapExFind() 345 treenum = treetab[treenum].fathnum; /* Get father node */ in kgraphMapExFind() 349 …othrnum = treetab[treenum].sonstab[(treetab[treenum].sonstab[0] == nodenum) ? 1 : 0]; /* Don't con… in kgraphMapExFind() [all …]
|
H A D | kgraph_map_ex.h | 64 Anum treenum; /*+ Tree node index for this domain +*/ member
|
/dports/devel/tex-kpathsea/texlive-20150521-source/texk/kpathsea/win32/ |
H A D | mktexupd.c | 18 int i, j, treenum; in mktexupd() local 60 treenum = i; in mktexupd() 63 for (i = 0; i < treenum; i++) { in mktexupd() 82 for (i = 0; i < treenum; i++) { in mktexupd()
|
/dports/print/tex-xdvik/xdvik-22.87/texk/kpathsea/win32/ |
H A D | mktexupd.c | 18 int i, j, treenum; in mktexupd() local 60 treenum = i; in mktexupd() 63 for (i = 0; i < treenum; i++) { in mktexupd() 82 for (i = 0; i < treenum; i++) { in mktexupd()
|
/dports/biology/p5-BioPerl/BioPerl-1.7.7/lib/Bio/Tools/Phylo/ |
H A D | Molphy.pm | 160 my ( $treenum,$possible_trees, $model); 248 if( defined $treenum ) { 254 ($treenum,$possible_trees, $model) = @save;
|
/dports/biology/treepuzzle/tree-puzzle-5.2/src/ |
H A D | treesort.h | 172 treelistitemtype *inittreelist(int *treenum);
|
H A D | treesort.c | 480 treelistitemtype *inittreelist(int *treenum) in inittreelist() argument 482 *treenum = 0; in inittreelist()
|
/dports/math/gap/gap-4.11.0/pkg/gbnp/lib/ |
H A D | occurtree.gi | 544 treenum,# index in tree 552 treenum:=OT.nextnum; 562 OT.tree2arr[treenum]:=arrnum; 563 Add(OT.arr2tree,treenum); 566 InsertElmList(OT.arr2tree,i,treenum); 594 r[pi]:=treenum;
|