Home
last modified time | relevance | path

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

/dports/biology/iqtree/IQ-TREE-2.0.6/pll/
H A DbipartitionList.c91 e->treeVector = (unsigned int*)NULL; in initEntry()
122 e->treeVector[0] = e->treeVector[0] & 2; in cleanupHashTable()
123 assert(!(e->treeVector[0] & 1)); in cleanupHashTable()
127 e->treeVector[0] = e->treeVector[0] & 1; in cleanupHashTable()
128 assert(!(e->treeVector[0] & 2)); in cleanupHashTable()
131 if(e->treeVector[0] != 0) in cleanupHashTable()
149 if(remove->treeVector) rax_free(remove->treeVector); in cleanupHashTable()
320 e->treeVector[treeNumber / PLL_MASK_LENGTH] |= mask32[treeNumber % PLL_MASK_LENGTH]; in insertHashRF()
335 e->treeVector = (unsigned int*)rax_calloc((size_t)treeVectorLength, sizeof(unsigned int)); in insertHashRF()
339 e->treeVector[treeNumber / PLL_MASK_LENGTH] |= mask32[treeNumber % PLL_MASK_LENGTH]; in insertHashRF()
[all …]
H A Dpll.h337 unsigned int *treeVector; member
H A DsearchAlgo.c3032 if(e->treeVector) rax_free(e->treeVector); in hash_dealloc_bipentry()
/dports/misc/dartsim/dart-6.11.1/dart/dynamics/
H A DReferentialSkeleton.cpp897 const Eigen::VectorXd& treeVector = (skel_i.get()->*getVector)(tree_i); in setVectorFromSkeletonData() local
899 V[i] = treeVector[index_i]; in setVectorFromSkeletonData()