191 namespace IntervalMapImpl {
934           unsigned N = IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize,
937   using Sizer = IntervalMapImpl::NodeSizer<KeyT, ValT>;
938   using Leaf = IntervalMapImpl::LeafNode<KeyT, ValT, Sizer::LeafSize, Traits>;
940       IntervalMapImpl::BranchNode<KeyT, ValT, Sizer::BranchSize, Traits>;
941   using RootLeaf = IntervalMapImpl::LeafNode<KeyT, ValT, N, Traits>;
942   using IdxPair = IntervalMapImpl::IdxPair;
948       (sizeof(KeyT) + sizeof(IntervalMapImpl::NodeRef)),
953       IntervalMapImpl::BranchNode<KeyT, ValT, RootBranchCap, Traits>;
1036   void visitNodes(void (IntervalMap::*f)(IntervalMapImpl::NodeRef,
1038   void deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level);
1205   IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x);  in treeSafeLookup()
1214 IntervalMapImpl::IdxPair IntervalMap<KeyT, ValT, N, Traits>::
1216   using namespace IntervalMapImpl;  in branchRoot()  local
1255 IntervalMapImpl::IdxPair IntervalMap<KeyT, ValT, N, Traits>::
1257   using namespace IntervalMapImpl;  in splitRoot()  local
1294 visitNodes(void (IntervalMap::*f)(IntervalMapImpl::NodeRef, unsigned Height)) {  in visitNodes()
1297   SmallVector<IntervalMapImpl::NodeRef, 4> Refs, NextRefs;  in visitNodes()
1321 deleteNode(IntervalMapImpl::NodeRef Node, unsigned Level) {  in deleteNode()
1359   IntervalMapImpl::Path path;
1510   IntervalMapImpl::NodeRef NR = path.subtree(path.height());  in pathFillFind()
1575   using IdxPair = IntervalMapImpl::IdxPair;
1580   bool insertNode(unsigned Level, IntervalMapImpl::NodeRef Node, KeyT Stop);
1666   using namespace IntervalMapImpl;  in canCoalesceLeft()  local
1694   using namespace IntervalMapImpl;  in canCoalesceRight()  local
1721   IntervalMapImpl::Path &P = this->path;  in setNodeStop()
1788 iterator::insertNode(unsigned Level, IntervalMapImpl::NodeRef Node, KeyT Stop) {  in insertNode()
1792   IntervalMapImpl::Path &P = this->path;  in insertNode()
1837   IntervalMapImpl::Path &P = this->path;  in insert()
1859   using namespace IntervalMapImpl;  in treeInsert()  local
1924   IntervalMapImpl::Path &P = this->path;  in erase()
1937   IntervalMapImpl::Path &P = this->path;  in treeErase()
1971   IntervalMapImpl::Path &P = this->path;  in eraseNode()
2018   using namespace IntervalMapImpl;  in overflow()  local