OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:Trees
(Results
1 - 13
of
13
) sorted by null
/external/swiftshader/third_party/LLVM/utils/TableGen/
CodeGenDAGPatterns.h
492
///
Trees
- The list of pattern
trees
which corresponds to this pattern.
495
std::vector<TreePatternNode*>
Trees
;
497
/// NamedNodes - This is all of the nodes that have names in the
trees
in this
529
const std::vector<TreePatternNode*> &getTrees() const { return
Trees
; }
530
unsigned getNumTrees() const { return
Trees
.size(); }
531
TreePatternNode *getTree(unsigned i) const { return
Trees
[i]; }
533
assert(
Trees
.size() == 1 && "Doesn't have exactly one pattern!");
534
return
Trees
[0];
561
for (unsigned i = 0, e =
Trees
.size(); i != e; ++i
[
all
...]
CodeGenDAGPatterns.cpp
[
all
...]
/external/swiftshader/third_party/llvm-7.0/llvm/utils/TableGen/
CodeGenDAGPatterns.h
780
///
Trees
- The list of pattern
trees
which corresponds to this pattern.
783
std::vector<TreePatternNodePtr>
Trees
;
785
/// NamedNodes - This is all of the nodes that have names in the
trees
in this
831
const std::vector<TreePatternNodePtr> &getTrees() const { return
Trees
; }
832
unsigned getNumTrees() const { return
Trees
.size(); }
833
const TreePatternNodePtr &getTree(unsigned i) const { return
Trees
[i]; }
834
void setTree(unsigned i, TreePatternNodePtr Tree) {
Trees
[i] = Tree; }
836
assert(
Trees
.size() == 1 && "Doesn't have exactly one pattern!");
837
return
Trees
[0]
[
all
...]
CodeGenDAGPatterns.cpp
[
all
...]
/external/llvm/utils/TableGen/
CodeGenDAGPatterns.h
528
///
Trees
- The list of pattern
trees
which corresponds to this pattern.
531
std::vector<TreePatternNode*>
Trees
;
533
/// NamedNodes - This is all of the nodes that have names in the
trees
in this
576
const std::vector<TreePatternNode*> &getTrees() const { return
Trees
; }
577
unsigned getNumTrees() const { return
Trees
.size(); }
578
TreePatternNode *getTree(unsigned i) const { return
Trees
[i]; }
580
assert(
Trees
.size() == 1 && "Doesn't have exactly one pattern!");
581
return
Trees
[0];
608
for (unsigned i = 0, e =
Trees
.size(); i != e; ++i
[
all
...]
CodeGenDAGPatterns.cpp
[
all
...]
/external/robolectric-shadows/processor/src/main/java/org/robolectric/annotation/processing/validator/
ImplementsValidator.java
6
import com.sun.source.util.
Trees
;
259
List<? extends ImportTree> importLines =
Trees
.instance(env).getPath(elem).getCompilationUnit().getImports();
/external/antlr/runtime/Ruby/lib/
antlr3.rb
75
contains everything pertaining to Abstract Syntax
Trees
(ASTs). This script is
/external/antlr/runtime/Ruby/lib/antlr3/
tree.rb
72
Trees
(ASTs), tree structures that reflect the high-level syntactic and semantic
90
(instead of basic tokens), and adds some helper methods for working with
trees
.
192
= ANTLR Abstract Syntax
Trees
195
wraps a token, a list of child
trees
, and some information about the collective
200
tree nodes as well as the methods
trees
need to implement.
463
application, building
trees
with all of this extra information may be
468
the customized lighter-weight
trees
.
669
trees
. Using an adaptor object permits a single recognizer to work with any
671
on customized tree structures. For example, if you want to represent
trees
using
[
all
...]
/external/v8/benchmarks/spinning-balls/
splay-tree.js
193
* "Self-adjusting Binary Search
Trees
" by Sleator and Tarjan
/external/v8/tools/
splaytree.js
219
* "Self-adjusting Binary Search
Trees
" by Sleator and Tarjan
/external/v8/benchmarks/
splay.js
32
// used for old nodes. Because of the way splay
trees
work, the engine
288
* "Self-adjusting Binary Search
Trees
" by Sleator and Tarjan
/external/error_prone/javac/
javac-9+181-r4173-1.jar
Completed in 8510 milliseconds