Searched refs:Trees (Results 1 – 5 of 5) sorted by relevance
495 std::vector<TreePatternNode*> Trees; variable529 const std::vector<TreePatternNode*> &getTrees() const { return Trees; } in getTrees()530 unsigned getNumTrees() const { return Trees.size(); } in getNumTrees()531 TreePatternNode *getTree(unsigned i) const { return Trees[i]; } in getTree()533 assert(Trees.size() == 1 && "Doesn't have exactly one pattern!"); in getOnlyTree()534 return Trees[0]; in getOnlyTree()561 for (unsigned i = 0, e = Trees.size(); i != e; ++i) in InlinePatternFragments()562 Trees[i] = Trees[i]->InlinePatternFragments(*this); in InlinePatternFragments()
1708 Trees.push_back(ParseTreePattern(RawPat->getElement(i), "")); in TreePattern()1714 Trees.push_back(ParseTreePattern(Pat, "")); in TreePattern()1720 Trees.push_back(Pat); in TreePattern()1729 for (unsigned i = 0, e = Trees.size(); i != e; ++i) in ComputeNamedNodes()1730 ComputeNamedNodes(Trees[i]); in ComputeNamedNodes()1922 for (unsigned i = 0, e = Trees.size(); i != e; ++i) { in InferAllTypes()1923 MadeChange |= Trees[i]->ApplyTypeConstraints(*this, false); in InferAllTypes()1924 MadeChange |= SimplifyTree(Trees[i]); in InferAllTypes()1949 if (Nodes[i] == Trees[0] && Nodes[i]->isLeaf()) { in InferAllTypes()1980 for (unsigned i = 0, e = Trees.size(); i != e; ++i) in InferAllTypes()[all …]
11 these were ignored and discarded. For use, see the Parse Trees link
65 /* Collapsing Trees: http://dbtree.megalingo.com/web/demo/simple-collapsible-tree.cfm */
2172 <TITLE>Balanced Binary Trees</TITLE>2195 <TITLE>N-ary Trees</TITLE>