void restoreTL(topolRELL_LIST *rl, tree *tr, int n) { assert(n >= 0 && n < rl->max); restoreTopolRELL(tr, rl->t[n]); }
void restoreTL(topolRELL_LIST *rl, pllInstance *tr, int n, int numBranches) { assert(n >= 0 && n < rl->max); restoreTopolRELL(tr, rl->t[n], numBranches); }