Searched refs:t_prior_max (Results 1 – 14 of 14) sorted by relevance
/dports/biology/phyml/phyml-3.3.20200621/src/ |
H A D | invitee.c | 782 t_prior_max = tree -> rates -> t_prior_max; in K_Constant_Prior_Times_Log() 1786 t_prior_max = tree -> rates -> t_prior_max; in TIMES_Calib_Partial_Proba() 1859 t_prior_max = tree -> rates -> t_prior_max; in Check_Node_Time() 1953 t_prior_max = tree -> rates -> t_prior_max; in Set_Current_Calibration() 2028 t_prior_max = tree -> rates -> t_prior_max; in RND_Calibration_And_Node_Number() 2103 t_prior_max = tree -> rates -> t_prior_max; in Lk_Hastings_Ratio_Times() 2136 t_prior_max = tree -> rates -> t_prior_max; in Update_Descendent_Cond_Jump() 2174 t_prior_max = tree -> rates -> t_prior_max; in Update_Ancestor_Cond_Jump() 2218 t_prior_max = tree -> rates -> t_prior_max; in Update_Times_RND_Node_Ancestor_Descendant() 2246 t_prior_max = tree -> rates -> t_prior_max; in Update_Times_Down_Tree() [all …]
|
H A D | times.c | 205 tree->times->t_prior_max[d->num]); in TIMES_Print_Node_Times() 298 MIN(tree->times->t_prior_max[v1->num], in TIMES_Set_All_Node_Priors_Bottom_Up() 299 tree->times->t_prior_max[v2->num])); in TIMES_Set_All_Node_Priors_Bottom_Up() 301 tree->times->t_prior_max[d->num] = t_sup; in TIMES_Set_All_Node_Priors_Bottom_Up() 313 tree->times->t_prior_max[d->num] = in TIMES_Set_All_Node_Priors_Bottom_Up() 314 MIN(tree->times->t_prior_max[v1->num], in TIMES_Set_All_Node_Priors_Bottom_Up() 315 tree->times->t_prior_max[v2->num]); in TIMES_Set_All_Node_Priors_Bottom_Up() 579 tp_max = tree->times->t_prior_max; in TIMES_Lk_Yule_Order() 1148 tree->times->t_prior_max[i] = BIG; in TIMES_Set_Calibration() 1212 tp_max = tree->times->t_prior_max; in TIMES_Lk_Yule_Order_Root_Cond() [all …]
|
H A D | date.c | 337 tree->times->t_prior_max[i] = +INFINITY; in DATE_Update_T_Prior_MinMax() 344 … tree->times->t_prior_max[i] = MIN(tree->times->t_prior_max[i],tree->a_nodes[i]->cal[j]->upper); in DATE_Update_T_Prior_MinMax() 433 minmax[len+1] = tree->times->t_prior_max[i]; in DATE_Splitted_Calibration() 621 Are_Equal(tree->times->t_prior_max[d->num],splitted_cal[which+1],eps) || in DATE_Is_Split_Accessible() 623 …tree->times->t_prior_max[d->num] > splitted_cal[which+1])) return 0; // splitte… in DATE_Is_Split_Accessible() 624 else if(Are_Equal(tree->times->t_prior_max[d->num],splitted_cal[which],eps) || in DATE_Is_Split_Accessible() 625 …splitted_cal[which] > tree->times->t_prior_max[d->num]) return +1; // splitted in… in DATE_Is_Split_Accessible() 633 tree->times->t_prior_max[d->num]); in DATE_Is_Split_Accessible() 700 if(tree->times->nd_t[i] > tree->times->t_prior_max[i] || in DATE_Check_Time_Constraints()
|
H A D | invitee.h | 36 phydbl LOG_g_i(phydbl lmbd, phydbl t_slice_max, phydbl t_slice_min, phydbl t_prior_max, phydbl t_pr…
|
H A D | mcmc.c | 952 t_max = MIN(tree->times->t_prior_max[d->num],MIN(t2,t3)); in MCMC_Times_And_Rates_Recur() 1134 t_max = MIN(tree->times->t_prior_max[d->num],MIN(t2,t3)); in MCMC_Time_Recur() 1654 if(tree->times->nd_t[i] > tree->times->t_prior_max[i] || in MCMC_Updown_T_Br() 1966 if(tree->times->nd_t[i] > tree->times->t_prior_max[i] || in MCMC_Swing() 3150 t_sup = tree->times->t_prior_max[tree->n_root->num]; in MCMC_Randomize_Node_Times() 3188 tree->times->nd_t[i] > tree->times->t_prior_max[i]) in MCMC_Randomize_Node_Times() 3281 t_sup = tree->times->t_prior_max[d->num]; in MCMC_Randomize_Node_Times_Top_Down() 4967 tree->times->t_prior_max[prune->num], in MCMC_Prune_Regraft() 5091 tree->times->t_prior_max[prune->num], in MCMC_Prune_Regraft() 5373 tree->times->t_prior_max[prune->num], in MCMC_Prune_Regraft_Weighted() [all …]
|
H A D | rates.c | 755 …prior_min=%f a->t_prior_max=%f",tree->times->t_prior_min[a->num],tree->times->t_prior_max[a->num]); in RATES_Check_Node_Times_Pre() 756 …prior_min=%f d->t_prior_max=%f",tree->times->t_prior_min[d->num],tree->times->t_prior_max[d->num]); in RATES_Check_Node_Times_Pre() 1795 if(FABS(tree->times->t_prior_min[d->num] - tree->times->t_prior_max[d->num]) < 1.E-10) return; in RATES_Posterior_One_Time() 1924 t_max = MIN(MIN(t2,t3),tree->times->t_prior_max[d->num]); in RATES_Posterior_One_Time() 2255 t0_max = MIN(t0_max,tree->times->t_prior_max[root->num]); in RATES_Posterior_Time_Root() 2267 …if(FABS(tree->times->t_prior_min[root->num] - tree->times->t_prior_max[root->num]) < 1.E-10) retur… in RATES_Posterior_Time_Root() 3542 min = -0.01*tree->times->t_prior_max[tree->n_root->num]; in RATES_Set_Birth_Rate_Boundaries()
|
H A D | free.c | 1259 Free(times->t_prior_max); in TIMES_Free_Times()
|
H A D | spr.c | 2273 tree->times->t_prior_max[prune->num], in Prune_Regraft_Time_Tree() 2275 tree->times->t_prior_max[new_regraft_nd->num]); in Prune_Regraft_Time_Tree()
|
H A D | init.c | 940 times->t_prior_max[i] = 0.0; in TIMES_Init_Time_Struct() 946 times->t_prior_max[i] = 0.0; in TIMES_Init_Time_Struct()
|
H A D | utilities.h | 1634 phydbl *t_prior_max; member
|
H A D | optimiz.c | 2678 MIN(tree->times->t_prior_max[tree->n_root->num], in Opt_Node_Heights_Recurr() 2721 t_max = MIN(t_max,tree->times->t_prior_max[d->num]); in Opt_Node_Heights_Recurr_Pre()
|
H A D | make.c | 1268 times->t_prior_max = (phydbl *)mCalloc(2*n_otu-1,sizeof(phydbl)); in TIMES_Make_Time_Struct()
|
H A D | io.c | 2059 tree->rates?tree->times->t_prior_max[a->num]:-1.); in Print_Node() 3730 tree->times->t_prior_max[node_num] = -MIN(prior_low,prior_up); in Read_Clade_Priors()
|
H A D | utilities.c | 9458 K,floor,tree->times->t_prior_max[a->num],tree->times->t_prior_max[d->num], in Scale_Node_Heights_Post()
|