// Go up the tree until we can go right.
unsigned l = Level - 1;
- while (l && atLastBranch(l))
+ while (l && atLastEntry(l))
--l;
// We can't go right.
- if (atLastBranch(l))
+ if (atLastEntry(l))
return NodeRef();
// NR is the subtree containing our right sibling.
// Go up the tree until we can go right.
unsigned l = Level - 1;
- while (l && atLastBranch(l))
+ while (l && atLastEntry(l))
--l;
// NR is the subtree containing our right sibling. If we hit end(), we have