Home
last modified time | relevance | path

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

/dports/biology/fasttree/FastTree-2.1.10_5/
H A DFastTree-2.1.10.c597 } besthit_t; typedef
7744 besthit_t *besthitsSeed = (besthit_t*)mymalloc(sizeof(besthit_t)*NJ->nSeq); in SetAllLeafTopHits()
7745 besthit_t *besthitsNeighbor = (besthit_t*)mymalloc(sizeof(besthit_t) * 2 * tophits->m); in SetAllLeafTopHits()
8022 besthit_t *uniqueList = (besthit_t*)mymalloc(sizeof(besthit_t)*nCombined); in UniqueBestHits()
8083 besthit_t *combinedList = (besthit_t*)mymalloc(sizeof(besthit_t)*nCombined); in TopHitJoin()
8233 besthit_t *allhits = (besthit_t*)mymalloc(sizeof(besthit_t)*NJ->maxnode); in TopHitJoin()
8259 besthit_t *bothList = (besthit_t*)mymalloc(sizeof(besthit_t) * 3 * tophits->m); in TopHitJoin()
8596 const besthit_t *hit1 = (besthit_t*)c1; in CompareHitsByCriterion()
8597 const besthit_t *hit2 = (besthit_t*)c2; in CompareHitsByCriterion()
8604 const besthit_t *hit1 = (besthit_t*)c1; in CompareHitsByIJ()
[all …]