Home
last modified time | relevance | path

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

/dports/biology/treepuzzle/tree-puzzle-5.2/src/
H A Dtreesort.c32 int ct_sortkeyaddr(int addr) in ct_sortkeyaddr() function
226 ctree[ct_sortkeyaddr(0)] = trueID[0];
263 ctree[ct_sortkeyaddr(nextcurredge)] = edge[ed].taxon; in copyOTU()
304 ctree[ct_sortkeyaddr(0)] = rootleaf; in copytree()
332 return ctree[ct_sortkeyaddr(edge)]; in sortOTU()
352 ctree[ct_sortkeyaddr(edge)] = key2; in sortOTU()
355 ctree[ct_sortkeyaddr(edge)] = key1; in sortOTU()
357 return ctree[ct_sortkeyaddr(edge)]; in sortOTU()
370 if (ctree[ct_sortkeyaddr(n*4)] == 0) in sortctree()
411 if (ctree[ct_sortkeyaddr(n*4)] == 0) in fprintfsortctree()
[all …]
H A Dtreesort.h47 int ct_sortkeyaddr(int addr);