779   template <typename NodeT> NodeT &leaf() const {  in leaf()  function
1309     return branched() ? path.leaf<Leaf>().start(path.leafOffset()) :  in unsafeStart()
1310                         path.leaf<RootLeaf>().start(path.leafOffset());  in unsafeStart()
1316     return branched() ? path.leaf<Leaf>().stop(path.leafOffset()) :  in unsafeStop()
1317                         path.leaf<RootLeaf>().stop(path.leafOffset());  in unsafeStop()
1323     return branched() ? path.leaf<Leaf>().value(path.leafOffset()) :  in unsafeValue()
1324                         path.leaf<RootLeaf>().value(path.leafOffset());  in unsafeValue()
1358     return &path.template leaf<Leaf>() == &RHS.path.template leaf<Leaf>();
1462   if (!Traits::stopLess(path.leaf<Leaf>().stop(path.leafSize() - 1), x)) {  in treeAdvanceTo()
1463     path.leafOffset() = path.leaf<Leaf>().safeFind(path.leafOffset(), x);  in treeAdvanceTo()
1597     RootLeaf &Node = P.leaf<RootLeaf>();  in canCoalesceLeft()
1603     Leaf &Node = P.leaf<Leaf>();  in canCoalesceLeft()
1627     RootLeaf &Node = P.leaf<RootLeaf>();  in canCoalesceRight()
1632     Leaf &Node = P.leaf<Leaf>();  in canCoalesceRight()
1794   if (P.leafOffset() == 0 && Traits::startLess(a, P.leaf<Leaf>().start(0))) {  in treeInsert()
1806         Leaf &CurLeaf = P.leaf<Leaf>();  in treeInsert()
1829   Size = P.leaf<Leaf>().insertFrom(P.leafOffset(), Size, a, b, y);  in treeInsert()
1835     Size = P.leaf<Leaf>().insertFrom(P.leafOffset(), P.leafSize(), a, b, y);  in treeInsert()
1866   Leaf &Node = P.leaf<Leaf>();  in treeErase()
1874       IM.rootBranchStart() = P.leaf<Leaf>().start(0);  in treeErase()
1887     IM.rootBranchStart() = P.leaf<Leaf>().start(0);  in treeErase()