Home
last modified time | relevance | path

Searched refs:Trees (Results 1 – 5 of 5) sorted by relevance

/freebsd-14.2/contrib/llvm-project/clang/lib/Tooling/Syntax/
H A DBuildTree.cpp581 Trees.insert(Trees.end(), {&T, L}); in Forest()
590 assert((std::next(It) == Trees.end() || in assignRole()
602 assert((BeginChildren == Trees.end() || in shrinkToFitList()
636 assert((BeginChildren == Trees.end() || in foldChildren()
656 Trees.erase(BeginChildren, EndChildren); in foldChildren()
657 Trees.insert({FirstToken, Node}); in foldChildren()
662 assert(Trees.size() == 1); in finalize()
663 auto *Root = Trees.begin()->second; in finalize()
664 Trees = {}; in finalize()
670 for (auto It = Trees.begin(); It != Trees.end(); ++It) { in str()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.h877 std::vector<TreePatternNodePtr> Trees; variable
925 const std::vector<TreePatternNodePtr> &getTrees() const { return Trees; } in getTrees()
926 unsigned getNumTrees() const { return Trees.size(); } in getNumTrees()
927 const TreePatternNodePtr &getTree(unsigned i) const { return Trees[i]; } in getTree()
928 void setTree(unsigned i, TreePatternNodePtr Tree) { Trees[i] = Tree; } in setTree()
930 assert(Trees.size() == 1 && "Doesn't have exactly one pattern!"); in getOnlyTree()
931 return Trees[0]; in getOnlyTree()
960 Trees.swap(Copy); in InlinePatternFragments()
962 C->InlinePatternFragments(*this, Trees); in InlinePatternFragments()
H A DCodeGenDAGPatterns.cpp2815 Trees.push_back(ParseTreePattern(I, "")); in TreePattern()
2822 Trees.push_back(ParseTreePattern(Pat, "")); in TreePattern()
2829 Trees.push_back(Pat); in TreePattern()
2841 for (TreePatternNodePtr &Tree : Trees) in ComputeNamedNodes()
3088 for (TreePatternNodePtr &Tree : Trees) { in InferAllTypes()
3116 if (Node == Trees[0].get() && Node->isLeaf()) { in InferAllTypes()
3147 for (const TreePatternNodePtr &Tree : Trees) in InferAllTypes()
3163 if (Trees.size() > 1) in print()
3165 for (const TreePatternNodePtr &Tree : Trees) { in print()
3171 if (Trees.size() > 1) in print()
/freebsd-14.2/contrib/one-true-awk/testdir/
H A Dfunstack.ok532 Values of Binary Trees . . . . . . . . . 99--102
835 D. N. Ness Optimizing Binary Trees Grown with a
1126 Retrieval Using AVL Trees . . . . . . . 843--843
1499 Caxton C. Foster A Generalization of AVL Trees . . . . . 513--517
2243 Jon Louis Bentley Multidimensional Binary Search Trees
2330 E. B. Kaehler Performance of Height-Balanced Trees . . 23--28
2475 Height-Balanced Trees . . . . . . . . . 471--473
2485 Context Trees'' . . . . . . . . . . . . ??
2796 Edward M. McCreight Pagination of B*-Trees with
3192 B. A. Sheil Median Split Trees: A Fast Lookup
[all …]
H A Dfunstack.in5817 title = "Optimizing Binary Trees Grown with a Storing Algorithm",
11203 title = "A Generalization of {AVL} Trees",
17646 title = "Performance of Height-Balanced Trees",
18981 title = "Weighted Derivation Trees",
19080 title = "Faster Retrieval from Context Trees",
19801 title = "A Numbering System for Binary Trees",
21336 title = "Pagination of {B*}-Trees with Variable-Length Records",
22347 title = "{B}-Trees Re-Examined",
23600 title = "{B-Trees} Re-examined",
23908 title = "Right Brother Trees",
[all …]