Searched refs:effectiveBrLen (Results 1 – 5 of 5) sorted by relevance
1910 pt->effectiveBrLen = NULL; in AllocatePolyTree()1940 pt->effectiveBrLen = (MrBFlt **) SafeCalloc (pt->nBSets, sizeof (MrBFlt *)); in AllocatePolyTreeRelClockParams()3089 to->effectiveBrLen[i][j] = from->effectiveBrLen[i][j]; in CopyToPolyTreeFromPolyTree()3810 free (pt->effectiveBrLen[i]); in FreePolyTreeRelClockParams()3812 free (pt->effectiveBrLen); in FreePolyTreeRelClockParams()3815 pt->effectiveBrLen = NULL; in FreePolyTreeRelClockParams()5474 printf ("%d:%f", j, pt->effectiveBrLen[pt->nBSets][j]); in PrintPolyNodes()5553 t->effectiveBrLen[i][b] += t->effectiveBrLen[i][a]; in AppendRelaxedBranch()5586 tmp = t->effectiveBrLen[i][a]; in SwapRelaxedBranchInfo()5587 t->effectiveBrLen[i][a] = t->effectiveBrLen[i][b]; in SwapRelaxedBranchInfo()[all …]
662 MrBFlt **effectiveBrLen; /*!< effective branch lengths of ebl set */ member
2906 r->bLen [i][runId][0] = t->effectiveBrLen[i][p->index]; in AddSumtPartition()2907 r->bRate[i][runId][0] = t->effectiveBrLen[i][p->index] / p->length; in AddSumtPartition()2977 r->bLen [i][runId][n] = t->effectiveBrLen[i][p->index]; in AddSumtPartition()2978 r->bRate[i][runId][n] = t->effectiveBrLen[i][p->index] / p->length; in AddSumtPartition()
8362 …t->effectiveBrLen = (MrBFlt **) SafeRealloc ((void *)t->effectiveBrLen, (size_t)(t->nBSets)*sizeof… in DoTreeParm()8363 … t->effectiveBrLen[t->nBSets-1] = (MrBFlt *) SafeCalloc (2*(size_t)numTaxa, sizeof(MrBFlt)); in DoTreeParm()8365 t->effectiveBrLen[t->nBSets-1][i] = 1.0; in DoTreeParm()8646 t->effectiveBrLen[bSetIndex][pp->index] = tempD; in DoTreeParm()
20122 effectiveBranchLengthP = pt->effectiveBrLen[i]; in SetRelaxedClockParam()20137 effectiveBranchLengthP = pt->effectiveBrLen[i]; in SetRelaxedClockParam()