Home
last modified time | relevance | path

Searched refs:ct_nextleaf (Results 1 – 2 of 2) sorted by relevance

/dports/biology/treepuzzle/tree-puzzle-5.2/src/
H A Dtreesort.c177 nextcurredge = ct_1stedge(*ct_nextleaf);
182 (*ct_nextleaf)++;
195 ct_nextleaf, edge[ed].downleft->numedge,
200 ct_nextleaf, edge[ed].downright->numedge,
216 int ct_nextleaf;
221 ct_nextleaf = 1;
260 nextcurredge = ct_1stedge(*ct_nextleaf); in copyOTU()
264 (*ct_nextleaf)++; in copyOTU()
275 ct_nextleaf, edge[ed].downleft->numedge, in copyOTU()
295 int ct_nextleaf; in copytree() local
[all …]
H A Dtreesort.h100 int *ct_nextleaf,/* in/out: next free leaf (0-maxspc) */
122 int *ct_nextleaf,/* in/out: next free leaf (0-maxspc) */