Searched refs:Trees (Results 1 – 3 of 3) sorted by relevance
577 Trees.insert(Trees.end(), {&T, L}); in Forest()586 assert((std::next(It) == Trees.end() || in assignRole()598 assert((BeginChildren == Trees.end() || in shrinkToFitList()632 assert((BeginChildren == Trees.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()[all …]
863 std::vector<TreePatternNodePtr> Trees; variable911 const std::vector<TreePatternNodePtr> &getTrees() const { return Trees; } in getTrees()912 unsigned getNumTrees() const { return Trees.size(); } in getNumTrees()913 const TreePatternNodePtr &getTree(unsigned i) const { return Trees[i]; } in getTree()914 void setTree(unsigned i, TreePatternNodePtr Tree) { Trees[i] = Tree; } in setTree()916 assert(Trees.size() == 1 && "Doesn't have exactly one pattern!"); in getOnlyTree()917 return Trees[0]; in getOnlyTree()945 std::vector<TreePatternNodePtr> Copy = Trees; in InlinePatternFragments()946 Trees.clear(); in InlinePatternFragments()948 Copy[i]->InlinePatternFragments(Copy[i], *this, Trees); in InlinePatternFragments()
2747 Trees.push_back(ParseTreePattern(I, "")); in TreePattern()2754 Trees.push_back(ParseTreePattern(Pat, "")); in TreePattern()2761 Trees.push_back(Pat); in TreePattern()2773 for (TreePatternNodePtr &Tree : Trees) in ComputeNamedNodes()3018 for (TreePatternNodePtr &Tree : Trees) { in InferAllTypes()3046 if (Node == Trees[0].get() && Node->isLeaf()) { in InferAllTypes()3077 for (const TreePatternNodePtr &Tree : Trees) in InferAllTypes()3093 if (Trees.size() > 1) in print()3095 for (const TreePatternNodePtr &Tree : Trees) { in print()3101 if (Trees.size() > 1) in print()