Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/clang/lib/Tooling/Syntax/
H A DBuildTree.cpp581 Trees.insert(Trees.end(), {&T, L}); in Forest()
587 auto It = Trees.lower_bound(Range.begin()); in assignRole()
588 assert(It != Trees.end() && "no node found"); in assignRole()
590 assert((std::next(It) == Trees.end() || in assignRole()
601 auto BeginChildren = Trees.lower_bound(Range.begin()); in shrinkToFitList()
602 assert((BeginChildren == Trees.end() || in shrinkToFitList()
606 auto EndChildren = Trees.lower_bound(Range.end()); in shrinkToFitList()
608 (EndChildren == Trees.end() || EndChildren->first == Range.end()) && in shrinkToFitList()
611 auto BelongsToList = [](decltype(Trees)::value_type KV) { in shrinkToFitList()
634 auto BeginChildren = Trees.lower_bound(FirstToken); in foldChildren()
[all …]
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenDAGPatterns.h872 std::vector<TreePatternNodePtr> Trees; variable
919 const std::vector<TreePatternNodePtr> &getTrees() const { return Trees; } in getTrees()
920 unsigned getNumTrees() const { return Trees.size(); } in getNumTrees()
921 const TreePatternNodePtr &getTree(unsigned i) const { return Trees[i]; } in getTree()
922 void setTree(unsigned i, TreePatternNodePtr Tree) { Trees[i] = Tree; } in setTree()
924 assert(Trees.size() == 1 && "Doesn't have exactly one pattern!"); in getOnlyTree()
925 return Trees[0]; in getOnlyTree()
954 Trees.swap(Copy); in InlinePatternFragments()
956 C->InlinePatternFragments(*this, Trees); in InlinePatternFragments()
H A DCodeGenDAGPatterns.cpp2803 Trees.push_back(ParseTreePattern(I, "")); in TreePattern()
2810 Trees.push_back(ParseTreePattern(Pat, "")); in TreePattern()
2817 Trees.push_back(Pat); in TreePattern()
2829 for (TreePatternNodePtr &Tree : Trees) in ComputeNamedNodes()
3077 for (TreePatternNodePtr &Tree : Trees) { in InferAllTypes()
3105 if (Node == Trees[0].get() && Node->isLeaf()) { in InferAllTypes()
3135 for (const TreePatternNodePtr &Tree : Trees) in InferAllTypes()
3151 if (Trees.size() > 1) in print()
3153 for (const TreePatternNodePtr &Tree : Trees) { in print()
3159 if (Trees.size() > 1) in print()
/freebsd/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'' . . . . . . . . . . . . ??
2489 Michael C. Loui Weighted Derivation Trees . . . . . . . 509--513
2499 Ben Wegbreit Faster Retrieval from Context Trees . . 526--529
[all …]
H A Dfunstack.in3746 title = "On the Probability Distribution of the Values of Binary Trees",
5817 title = "Optimizing Binary Trees Grown with a Storing Algorithm",
8194 title = "On {Foster}'s Information Storage and Retrieval Using {AVL} Trees",
11203 title = "A Generalization of {AVL} Trees",
16997 title = "Multidimensional Binary Search Trees Used for Associative Searching",
17646 title = "Performance of Height-Balanced Trees",
18871 title = "An Insertion Technique for One-Sided Height-Balanced Trees",
18911 title = "Corrigendum: ``{Faster Retrieval from Context Trees}''",
18981 title = "Weighted Derivation Trees",
19080 title = "Faster Retrieval from Context Trees",
[all …]