577         Trees.insert(Trees.end(), {&T, L});  in Forest()
583       auto It = Trees.lower_bound(Range.begin());  in assignRole()
584       assert(It != Trees.end() && "no node found");  in assignRole()
586       assert((std::next(It) == Trees.end() ||  in assignRole()
597       auto BeginChildren = Trees.lower_bound(Range.begin());  in shrinkToFitList()
598       assert((BeginChildren == Trees.end() ||  in shrinkToFitList()
602       auto EndChildren = Trees.lower_bound(Range.end());  in shrinkToFitList()
604           (EndChildren == Trees.end() || EndChildren->first == Range.end()) &&  in shrinkToFitList()
607       auto BelongsToList = [](decltype(Trees)::value_type KV) {  in shrinkToFitList()
630       auto BeginChildren = Trees.lower_bound(FirstToken);  in foldChildren()
632       assert((BeginChildren == Trees.end() ||  in foldChildren()
635       auto EndChildren = Trees.lower_bound(Tokens.end());  in foldChildren()
637           (EndChildren == Trees.end() || EndChildren->first == Tokens.end()) &&  in foldChildren()
652       Trees.erase(BeginChildren, EndChildren);  in foldChildren()
653       Trees.insert({FirstToken, Node});  in foldChildren()
658       assert(Trees.size() == 1);  in finalize()
659       auto *Root = Trees.begin()->second;  in finalize()
660       Trees = {};  in finalize()
666       for (auto It = Trees.begin(); It != Trees.end(); ++It) {  in str()
668             It != Trees.end()  in str()
684     std::map<const syntax::Token *, syntax::Node *> Trees;  member