| /external/llvm-project/clang/lib/Tooling/Syntax/ |
| D | BuildTree.cpp | 576 Trees.insert(Trees.end(), {&T, L}); in Forest()
582 auto It = Trees.lower_bound(Range.begin()); in assignRole()
583 assert(It != Trees.end() && "no node found"); in assignRole()
585 assert((std::next(It) == Trees.end() || in assignRole()
596 auto BeginChildren = Trees.lower_bound(Range.begin()); in shrinkToFitList()
597 assert((BeginChildren == Trees.end() || in shrinkToFitList()
601 auto EndChildren = Trees.lower_bound(Range.end()); in shrinkToFitList()
603 (EndChildren == Trees.end() || EndChildren->first == Range.end()) && in shrinkToFitList()
606 auto BelongsToList = [](decltype(Trees)::value_type KV) { in shrinkToFitList()
629 auto BeginChildren = Trees.lower_bound(FirstToken); in foldChildren()
[all …]
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenDAGPatterns.h | 531 std::vector<TreePatternNode*> Trees; variable
576 const std::vector<TreePatternNode*> &getTrees() const { return Trees; } in getTrees()
577 unsigned getNumTrees() const { return Trees.size(); } in getNumTrees()
578 TreePatternNode *getTree(unsigned i) const { return Trees[i]; } in getTree()
580 assert(Trees.size() == 1 && "Doesn't have exactly one pattern!"); in getOnlyTree()
581 return Trees[0]; in getOnlyTree()
608 for (unsigned i = 0, e = Trees.size(); i != e; ++i) in InlinePatternFragments()
609 Trees[i] = Trees[i]->InlinePatternFragments(*this); in InlinePatternFragments()
|
| D | CodeGenDAGPatterns.cpp | 2049 Trees.push_back(ParseTreePattern(I, "")); in TreePattern()
2055 Trees.push_back(ParseTreePattern(Pat, "")); in TreePattern()
2061 Trees.push_back(Pat); in TreePattern()
2073 for (TreePatternNode *Tree : Trees) in ComputeNamedNodes()
2300 for (TreePatternNode *Tree : Trees) { in InferAllTypes()
2328 if (Node == Trees[0] && Node->isLeaf()) { in InferAllTypes()
2359 for (const TreePatternNode *Tree : Trees) in InferAllTypes()
2374 if (Trees.size() > 1) in print()
2376 for (const TreePatternNode *Tree : Trees) { in print()
2382 if (Trees.size() > 1) in print()
|
| /external/llvm-project/llvm/utils/TableGen/ |
| D | CodeGenDAGPatterns.h | 865 std::vector<TreePatternNodePtr> Trees; variable
913 const std::vector<TreePatternNodePtr> &getTrees() const { return Trees; } in getTrees()
914 unsigned getNumTrees() const { return Trees.size(); } in getNumTrees()
915 const TreePatternNodePtr &getTree(unsigned i) const { return Trees[i]; } in getTree()
916 void setTree(unsigned i, TreePatternNodePtr Tree) { Trees[i] = Tree; } in setTree()
918 assert(Trees.size() == 1 && "Doesn't have exactly one pattern!"); in getOnlyTree()
919 return Trees[0]; in getOnlyTree()
947 std::vector<TreePatternNodePtr> Copy = Trees; in InlinePatternFragments()
948 Trees.clear(); in InlinePatternFragments()
950 Copy[i]->InlinePatternFragments(Copy[i], *this, Trees); in InlinePatternFragments()
|
| D | CodeGenDAGPatterns.cpp | 2696 Trees.push_back(ParseTreePattern(I, "")); in TreePattern()
2703 Trees.push_back(ParseTreePattern(Pat, "")); in TreePattern()
2710 Trees.push_back(Pat); in TreePattern()
2722 for (TreePatternNodePtr &Tree : Trees) in ComputeNamedNodes()
2966 for (TreePatternNodePtr &Tree : Trees) { in InferAllTypes()
2994 if (Node == Trees[0].get() && Node->isLeaf()) { in InferAllTypes()
3025 for (const TreePatternNodePtr &Tree : Trees) in InferAllTypes()
3040 if (Trees.size() > 1) in print()
3042 for (const TreePatternNodePtr &Tree : Trees) { in print()
3048 if (Trees.size() > 1) in print()
|
| /external/doclava/src/com/google/doclava/parser/ |
| D | README.txt | 11 these were ignored and discarded. For use, see the Parse Trees link
|
| /external/tensorflow/tensorflow/python/kernel_tests/boosted_trees/ |
| D | BUILD | 2 # Kernel tests for Boosted Trees.
|
| /external/google-java-format/core/src/main/java/com/google/googlejavaformat/java/ |
| D | Trees.java | 34 class Trees { class
|
| D | JavaInputAstVisitor.java | 24 import static com.google.googlejavaformat.java.Trees.getEndPosition;
25 import static com.google.googlejavaformat.java.Trees.getLength;
26 import static com.google.googlejavaformat.java.Trees.getMethodName;
27 import static com.google.googlejavaformat.java.Trees.getSourceForNode;
28 import static com.google.googlejavaformat.java.Trees.getStartPosition;
29 import static com.google.googlejavaformat.java.Trees.operatorName;
30 import static com.google.googlejavaformat.java.Trees.precedence;
31 import static com.google.googlejavaformat.java.Trees.skipParen;
1544 curr = Trees.getMethodReceiver(method);
|
| /external/robolectric-shadows/processor/src/main/java/org/robolectric/annotation/processing/validator/ |
| D | ImplementsValidator.java | 6 import com.sun.source.util.Trees;
259 …List<? extends ImportTree> importLines = Trees.instance(env).getPath(elem).getCompilationUnit().ge… in captureJavadoc()
|
| /external/mesa3d/docs/relnotes/ |
| D | 20.1.6.rst | 38 - Mafia 3: Trees get rendered incorrectly
|
| /external/avb/proto/ |
| D | trillian.proto | 84 // tree is forbidden. Trees should not be frozen when there are entries
130 // Trees are ACTIVE after creation. At any point the tree may transition
|
| /external/one-true-awk/testdir/ |
| D | funstack.ok | 532 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 …]
|
| D | funstack.in | 3746 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 …]
|
| /external/antlr/runtime/Ruby/ |
| D | README.txt | 47 * constructing Abstract Syntax Trees (ASTs)
|
| /external/python/cpython2/Doc/library/ |
| D | ast.rst | 1 :mod:`ast` --- Abstract Syntax Trees
|
| /external/llvm-project/polly/lib/External/isl/doc/ |
| D | isl.bib | 435 title = {Schedule Trees},
|
| /external/javaparser/javaparser-core-testing/src/test/resources/com/github/javaparser/lexical_preservation_samples/ |
| D | Example4_original.java.txt | 47 * Parse Java source code and creates Abstract Syntax Trees.
|
| /external/arm-trusted-firmware/docs/components/ |
| D | sdei.rst | 118 Device Trees or firmware configuration tables.
|
| D | secure-partition-manager-mm.rst | 195 like ACPI and Device Trees. For example, *Volume 4: Platform Initialisation
|
| /external/antlr/runtime/ObjC/Framework/test/runtime/tree/ |
| D | CommonTreeTest.m | 307 STAssertTrue([parent getChild:0] == tree, @"Trees don't match");
|
| /external/arm-trusted-firmware/docs/plat/arm/fvp/ |
| D | index.rst | 305 Obtaining the Flattened Device Trees
|
| /external/antlr/runtime/ObjC/Framework/ANTLR.xcodeproj/ |
| D | project.pbxproj | 1181 F73E2B590A9CF83A005D6267 /* Trees */,
1417 F71325850C4A05DC00B99F2D /* Trees */,
1448 F71325850C4A05DC00B99F2D /* Trees */ = {
1467 name = Trees;
1490 F73E2B590A9CF83A005D6267 /* Trees */ = {
1522 name = Trees;
|
| /external/python/cpython3/Doc/library/ |
| D | ast.rst | 1 :mod:`ast` --- Abstract Syntax Trees
|
| /external/llvm-project/mlir/docs/ |
| D | LangRef.md | 68 structures, such as Abstract Syntax Trees in a language frontend, generated
|