Searched refs:intDownPass (Results 1 – 9 of 9) sorted by relevance
268 p = speciesTree->intDownPass[i]; in GetDepthMatrix()324 p = speciesTree->intDownPass[i]; in GetMeanDist()407 p = geneTrees[w]->intDownPass[i]; in GetMinDepthMatrix()423 p = geneTrees[w]->intDownPass[j]; in GetMinDepthMatrix()860 …qsort((void *)(geneTree->intDownPass), (size_t)(geneTree->nIntNodes), sizeof(TreeNode *), CompareN… in LnPriorProbGeneTree()866 …printf ("%d -- %d -- %e\n", geneTree->intDownPass[i]->index, geneTree->intDownPass[i]->x, geneTree… in LnPriorProbGeneTree()893 q = geneTree->intDownPass[index]; in LnPriorProbGeneTree()899 r = geneTree->intDownPass[index-1]; in LnPriorProbGeneTree()972 p = speciesTree->intDownPass[i]; in LnProposalProbSpeciesTree()1064 …printf ("%-2d -- %d -- %e\n", geneTree->intDownPass[i]->index, geneTree->intDownPass[i]->x, geneTr… in MapGeneTreeToSpeciesTree()[all …]
446 p = tree->intDownPass[i]; in LaunchBEAGLELogLikeForDivision()462 p = tree->intDownPass[i]; in LaunchBEAGLELogLikeForDivision()527 p = tree->intDownPass[i]; in LaunchBEAGLELogLikeForDivision()811 p = t->intDownPass[i]; in TreeCondLikes_Beagle_No_Rescale()912 p = t->intDownPass[i]; in TreeCondLikes_Beagle_Rescale_All()1023 p = t->intDownPass[i]; in TreeCondLikes_Beagle_Always_Rescale()1774 p = tree->intDownPass[i]; in LaunchBEAGLELogLikeMultiPartition()1793 p = tree->intDownPass[i]; in LaunchBEAGLELogLikeMultiPartition()2184 p = t->intDownPass[i]; in TreeCondLikes_BeagleMultiPartition_No_Rescale()2330 p = t->intDownPass[i]; in TreeCondLikes_BeagleMultiPartition_Rescale_All()[all …]
2199 p = t1->intDownPass[i]; in AreTopologiesSame()2843 p = t->intDownPass[i]; in CheckSetConstraints()2983 r = t->intDownPass[k]; in CopySubtreeToTree()4431 p = t->intDownPass[i]; in GetRandomEmbeddedSubtree()5436 p = t->intDownPass[i]; in PrintNodes()6089 p = t->intDownPass[i]; in RandResolve()6198 p = t->intDownPass[i]; in RandResolve()6626 t->intDownPass[m]->index=t->intDownPass[i]->index; in ResetIntNodeIndices()6658 p1 = top->intDownPass[i]; in ResetTopologyFromTree()6726 p1 = top->intDownPass[i]; in ResetTopologyFromPolyTree()[all …]
609 …TreeNode **intDownPass; /*!< downpass array of interior nodes (including upper but exc… member651 PolyNode **intDownPass; /*!< downpass array over interior nodes */ member
4250 p = t->intDownPass[i]; in Move_ExtSSClock()4316 p = t->intDownPass[i]; in Move_ExtSSClock()4402 p = t->intDownPass[i]; in Move_ExtSSClock()4445 p = t->intDownPass[i]; in Move_ExtSSClock()7629 p = t->intDownPass[i]; in Move_NNIClock()7715 p = t->intDownPass[i]; in Move_NNIClock()7817 p = t->intDownPass[brIndex]; in Move_NNI_Hetero()9304 p = t->intDownPass[i]; in Move_ParsEraser1()9322 p = t->intDownPass[i]; in Move_ParsEraser1()9437 free (subtree->intDownPass); in Move_ParsEraser1()[all …]
580 p = tree->intDownPass[i]; in AddTreeToPartitionCounters()1482 p = t->intDownPass[j++]; in BuildStepwiseTree()1497 p = t->intDownPass[j++]; in BuildStepwiseTree()1516 p = t->intDownPass[j]; in BuildStepwiseTree()2184 to->intDownPass[i] = to->nodes + from->intDownPass[i]->memoryIndex; in CopyTrees()5466 p = t->intDownPass[i]; in GibbsSampleGamma()8420 p = t->intDownPass[i]; in LnBirthDeathPriorPrRandom()8487 p = t->intDownPass[i]; in LnBirthDeathPriorPrDiversity()8562 p = t->intDownPass[i]; in LnBirthDeathPriorPrCluster()9388 p = t->intDownPass[i]; in LnCoalescencePriorPr()[all …]
7708 p = t->intDownPass[i]; in Likelihood_Pars()7720 p = t->intDownPass[i]; in Likelihood_Pars()7874 p = t->intDownPass[i]; in Likelihood_ParsStd()8035 p = tree->intDownPass[i]; in LaunchLogLikeForDivision()
11926 p = t->intDownPass[i]; in DoesTreeSatisfyConstraints()11968 p = t->intDownPass[i]; in DoesTreeSatisfyConstraints()12024 p = t->intDownPass[i]; in DoesTreeSatisfyConstraints()12054 p = t->intDownPass[i]; in DoesTreeSatisfyConstraints()
8040 p = t->intDownPass[i]; in ShowConTree()