Lines Matching refs:Trees
458 Trees.insert(Trees.end(), {&T, L});
465 auto It = Trees.lower_bound(Range.begin());
466 assert(It != Trees.end() && "no node found");
468 assert((std::next(It) == Trees.end() ||
484 auto BeginChildren = Trees.lower_bound(FirstToken);
486 assert((BeginChildren == Trees.end() ||
489 auto EndChildren = Trees.lower_bound(Tokens.end());
491 (EndChildren == Trees.end() || EndChildren->first == Tokens.end()) &&
506 Trees.erase(BeginChildren, EndChildren);
507 Trees.insert({FirstToken, Node});
512 assert(Trees.size() == 1);
513 auto *Root = Trees.begin()->second;
514 Trees = {};
520 for (auto It = Trees.begin(); It != Trees.end(); ++It) {
522 It != Trees.end()
538 std::map<const syntax::Token *, syntax::Node *> Trees;