Home
last modified time | relevance | path

Searched defs:nextleaf (Results 1 – 23 of 23) sorted by relevance

/dports/biology/treepuzzle/tree-puzzle-5.2/src/
H A Dpstep-deglob.c62 int *nextleaf) /* out: next free leaf index (=3) */ in inittree_orig()
133 int nextleaf; in addnextleaf_orig() local
291 int nextleaf, /* next free leaf idx */ in writeOTU_orig()
332 int nextleaf, /* next free leaf idx */ in writetree_orig()
409 int nextleaf, /* next free leaf idx */ in minimumedgeinfo_orig()
H A Dpstep-mrca.c65 int *nextleaf) /* out: next free leaf index (=3) */ in inittree_orig()
137 int nextleaf; in addnextleaf_orig() local
295 int nextleaf, /* next free leaf idx */ in writeOTU_orig()
333 int nextleaf, /* next free leaf idx */ in writetree_orig()
415 int nextleaf, /* next free leaf idx */ in minimumedgeinfo_orig()
470 int nextleaf; /* next free leaf index (=3) */ in onepstep() local
H A Dpstep-recursive.c65 int *nextleaf) /* out: next free leaf index (=3) */ in inittree_orig()
137 int nextleaf; in addnextleaf_orig() local
295 int nextleaf, /* next free leaf idx */ in writeOTU_orig()
333 int nextleaf, /* next free leaf idx */ in writetree_orig()
415 int nextleaf, /* next free leaf idx */ in minimumedgeinfo_orig()
470 int nextleaf; /* next free leaf index (=3) */ in onepstep() local
H A Dpstep-split.c87 int *nextleaf) /* out: next free leaf index (=3) */ in inittree_split()
269 int nextleaf; in addnextleaf_split() local
430 int nextleaf, /* next free leaf idx */ in writeOTU_split()
469 int nextleaf, /* next free leaf idx */ in writetree_split()
553 int nextleaf, /* next free leaf idx */ in minimumedgeinfo_split()
609 int nextleaf; /* next free leaf index (=3) */ in onepstep_split() local
H A Dpstep-trueID.c69 int *nextleaf) /* out: next free leaf index (=3) */ in inittree_orig()
141 int nextleaf; in addnextleaf_orig() local
300 int nextleaf, /* next free leaf idx */ in writeOTU_orig()
341 int nextleaf, /* next free leaf idx */ in writetree_orig()
425 int nextleaf, /* next free leaf idx */ in minimumedgeinfo_orig()
481 int nextleaf; /* next free leaf index (=3) */ in onepstep() local
H A Dpstep.c51 int nextleaf, /* next free leaf idx */ in writeOTU()
86 int nextleaf, /* next free leaf idx */ in writetree()
112 int nextleaf, /* next free leaf idx */ in minimumedgeinfo()
232 int *nextleaf, /* out: next free leaf index (=3) */ in inittree_orig()
323 int nextleaf; in addnextleaf_orig() local
606 int nextleaf; /* next free leaf index (=3) */ in onepstep_orig() local
H A Drecur-old.c26 int *nextleaf, /* out: next free leaf index (=3) */ in inittree_recur()
335 int nextleaf; in addnextleaf_recur() local
507 int nextleaf, /* next free leaf idx */ in computepenaltiestree_recur()
727 int nextleaf; /* next free leaf index (=3) */ in onepstep_recur() local
H A Dsplit.c26 int *nextleaf, /* out: next free leaf index (=3) */ in inittree_split()
146 int nextleaf, /* next free leaf idx */ in check_split()
329 int nextleaf; in addnextleaf_split() local
467 int nextleaf; /* next free leaf index (=3) */ in onepstep_split() local
H A Drecur.c26 int *nextleaf, /* out: next free leaf index (=3) */ in inittree_recur()
392 int nextleaf; in addnextleaf_recur() local
572 int nextleaf, /* next free leaf idx */ in computepenaltiestree_recur()
769 int nextleaf; /* next free leaf index (=3) */ in onepstep_recur() local
H A Dmrca.c26 int *nextleaf, /* out: next free leaf index (=3) */ in inittree_mrca()
398 int nextleaf; in addnextleaf_mrca() local
552 int nextleaf, /* next free leaf idx */ in computepenaltiestree_mrca()
762 int nextleaf; /* next free leaf index (=3) */ in onepstep_mrca() local
H A Dpstep-orig.h46 EXTERN int nextleaf; /* next leaf to add to tree */ variable
/dports/biology/mummer/mummer-4.0.0beta2-2-g277dac5/src/kurtz/streesrc/
H A Diterator.c84 /*@null@*/ Lref nextleaf(Suffixtree *stree,Lref lptr) in nextleaf() function
/dports/devel/tcllib/tcllib-1.20/modules/struct/tree/
H A Dds.h31 TNPtr nextleaf; /* Double linked list of all */ member
/dports/devel/tcllibc/tcllib-1.20/modules/struct/tree/
H A Dds.h31 TNPtr nextleaf; /* Double linked list of all */ member
/dports/print/lyx/lyx-2.3.4.2/src/support/
H A Dweighted_btree.h299 leaf_node *nextleaf; member
/dports/net/tcptrace/tcptrace-508f73a/
H A Ddyncounter.c85 struct node *nextleaf; /* linked list of leaves, for NextCounter() */ member
/dports/www/domoticz/domoticz-2020.2/extern/mosquitto/src/
H A Ddatabase.c150 struct mosquitto__subleaf *leaf, *nextleaf; in subhier_clean() local
/dports/net/mosquitto/mosquitto-2.0.13/src/
H A Ddatabase.c224 struct mosquitto__subleaf *leaf, *nextleaf; in subhier_clean() local
/dports/textproc/estraier/estraier-1.2.30/qdbm/
H A Dvilla.c1927 VLLEAF *newleaf, *nextleaf; in vlleafdivide() local
/dports/sysutils/boxbackup-devel/boxbackup-0.11_trunk_2979/qdbm/
H A Dvilla.c2311 VLLEAF *newleaf, *nextleaf; in vlleafdivide() local
/dports/databases/qdbm-plus/qdbm-1.8.78/
H A Dvilla.c2311 VLLEAF *newleaf, *nextleaf; in vlleafdivide() local
/dports/databases/qdbm/qdbm-1.8.78/
H A Dvilla.c2311 VLLEAF *newleaf, *nextleaf; in vlleafdivide() local
/dports/databases/tokyocabinet/tokyocabinet-1.4.48/
H A Dtcbdb.c2356 BDBLEAF *nextleaf = tcbdbleafload(bdb, newleaf->next); in tcbdbleafdivide() local