Searched refs:tree (Results 226 - 250 of 1355) sorted by relevance

1234567891011>>

/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/
H A DAST.stg40 <if(!TREE_PARSER)><! tree parser would already have imported !>
41 from antlr3.tree import *<\n>
69 self.tree = None
138 <finishedBacktracking({stream_<rule.name>.add(<label>.tree)})>
144 <listLabel(label, {<label>.tree})>
150 <finishedBacktracking({stream_<rule.name>.add(<label>.tree)})>
156 <listLabel(label, {<label>.tree})>
180 <prevRuleRootRef()>.tree = root_0
187 <! if tree parser and rewrite=true !>
190 <prevRuleRootRef()>.tree
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
H A DANTLRBufferedTreeNodeStream.h98 + (ANTLRBufferedTreeNodeStream *) newANTLRBufferedTreeNodeStream:(id<ANTLRTree>)tree;
99 + (ANTLRBufferedTreeNodeStream *) newANTLRBufferedTreeNodeStream:(id<ANTLRTreeAdaptor>)adaptor Tree:(id<ANTLRTree>)tree;
100 + (ANTLRBufferedTreeNodeStream *) newANTLRBufferedTreeNodeStream:(id<ANTLRTreeAdaptor>)adaptor Tree:(id<ANTLRTree>)tree withBufferSize:(NSInteger)initialBufferSize;
103 - (id) initWithTree:(id<ANTLRTree>)tree;
104 - (id) initWithTreeAdaptor:(ANTLRCommonTreeAdaptor *)anAdaptor Tree:(id<ANTLRTree>)tree;
105 - (id) initWithTreeAdaptor:(ANTLRCommonTreeAdaptor *)anAdaptor Tree:(id<ANTLRTree>)tree WithBufferSize:(NSInteger)bufferSize;
112 - (void) fillBufferWithTree:(id<ANTLRTree>) tree;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
H A DANTLRBufferedTreeNodeStream.h98 + (ANTLRBufferedTreeNodeStream *) newANTLRBufferedTreeNodeStream:(id<ANTLRTree>)tree;
99 + (ANTLRBufferedTreeNodeStream *) newANTLRBufferedTreeNodeStream:(id<ANTLRTreeAdaptor>)adaptor Tree:(id<ANTLRTree>)tree;
100 + (ANTLRBufferedTreeNodeStream *) newANTLRBufferedTreeNodeStream:(id<ANTLRTreeAdaptor>)adaptor Tree:(id<ANTLRTree>)tree withBufferSize:(NSInteger)initialBufferSize;
103 - (id) initWithTree:(id<ANTLRTree>)tree;
104 - (id) initWithTreeAdaptor:(ANTLRCommonTreeAdaptor *)anAdaptor Tree:(id<ANTLRTree>)tree;
105 - (id) initWithTreeAdaptor:(ANTLRCommonTreeAdaptor *)anAdaptor Tree:(id<ANTLRTree>)tree WithBufferSize:(NSInteger)bufferSize;
112 - (void) fillBufferWithTree:(id<ANTLRTree>) tree;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
H A DANTLRBufferedTreeNodeStream.h98 + (ANTLRBufferedTreeNodeStream *) newANTLRBufferedTreeNodeStream:(id<ANTLRTree>)tree;
99 + (ANTLRBufferedTreeNodeStream *) newANTLRBufferedTreeNodeStream:(id<ANTLRTreeAdaptor>)adaptor Tree:(id<ANTLRTree>)tree;
100 + (ANTLRBufferedTreeNodeStream *) newANTLRBufferedTreeNodeStream:(id<ANTLRTreeAdaptor>)adaptor Tree:(id<ANTLRTree>)tree withBufferSize:(NSInteger)initialBufferSize;
103 - (id) initWithTree:(id<ANTLRTree>)tree;
104 - (id) initWithTreeAdaptor:(ANTLRCommonTreeAdaptor *)anAdaptor Tree:(id<ANTLRTree>)tree;
105 - (id) initWithTreeAdaptor:(ANTLRCommonTreeAdaptor *)anAdaptor Tree:(id<ANTLRTree>)tree WithBufferSize:(NSInteger)bufferSize;
112 - (void) fillBufferWithTree:(id<ANTLRTree>) tree;
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRBufferedTreeNodeStream.h99 + (ANTLRBufferedTreeNodeStream *) newANTLRBufferedTreeNodeStream:(ANTLRCommonTree *)tree;
100 + (ANTLRBufferedTreeNodeStream *) newANTLRBufferedTreeNodeStream:(id<ANTLRTreeAdaptor>)adaptor Tree:(ANTLRCommonTree *)tree;
101 + (ANTLRBufferedTreeNodeStream *) newANTLRBufferedTreeNodeStream:(id<ANTLRTreeAdaptor>)adaptor Tree:(ANTLRCommonTree *)tree withBufferSize:(NSInteger)initialBufferSize;
104 - (id) initWithTree:(ANTLRCommonTree *)tree;
105 - (id) initWithTreeAdaptor:(ANTLRCommonTreeAdaptor *)anAdaptor Tree:(ANTLRCommonTree *)tree;
106 - (id) initWithTreeAdaptor:(ANTLRCommonTreeAdaptor *)anAdaptor Tree:(ANTLRCommonTree *)tree WithBufferSize:(NSInteger)bufferSize;
114 - (void) fillBufferWithTree:(ANTLRCommonTree *) tree;
/external/eigen/unsupported/Eigen/src/BVH/
H A DBVAlgorithms.h19 bool intersect_helper(const BVH &tree, Intersector &intersector, typename BVH::Index root) argument
31 tree.getChildren(todo.back(), vBegin, vEnd, oBegin, oEnd);
35 if(intersector.intersectVolume(tree.getVolume(*vBegin)))
79 void BVIntersect(const BVH &tree, Intersector &intersector) argument
81 internal::intersect_helper(tree, intersector, tree.getRootIndex());
116 for(; vBegin1 != vEnd1; ++vBegin1) { //go through child volumes of first tree
118 for(vCur2 = vBegin2; vCur2 != vEnd2; ++vCur2) { //go through child volumes of second tree
123 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree
130 for(; oBegin1 != oEnd1; ++oBegin1) { //go through child objects of first tree
149 minimize_helper(const BVH &tree, Minimizer &minimizer, typename BVH::Index root, typename Minimizer::Scalar minimum) argument
219 BVMinimize(const BVH &tree, Minimizer &minimizer) argument
[all...]
/external/srec/seti/sltsEngine/src/
H A Drun_seq_lts.c503 RT_LTREE * tree = NULL; local
547 trees[let] = tree = (RT_LTREE*) lts_alloc(1, sizeof(RT_LTREE));
548 if (tree == NULL) {
553 tree->num_nodes = load_int(fp);
555 tree->values_or_question1 = (short*) lts_alloc(tree->num_nodes, sizeof(short));
556 if (tree->values_or_question1 == NULL) {
561 tree->question2 = (short*) lts_alloc(tree->num_nodes, sizeof(short));
562 if (tree
619 RT_LTREE * tree; local
1312 RT_LTREE *tree; local
[all...]
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
H A DBaseTreeAdaptor.as1 package org.antlr.runtime.tree {
13 * expensive: we have to create a hashtable with all tree nodes in it.
22 /** create tree node that holds the start and stop tokens associated
25 * If you specify your own kind of tree nodes, you will likely have to
31 * subclass your own tree node class to avoid class cast exception.
40 public function isNil(tree:Object):Boolean {
41 return Tree(tree).isNil;
44 public function dupTree(tree:Object):Object {
45 return dupTreeWithParent(tree, null);
49 * tree (no
[all...]
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3commontree.h1 /** Interface for an ANTLR3 common tree which is what gets
54 /// Start token index that encases this tree
58 /// End token that encases this tree
62 /// A single token, this is the payload for the tree
76 /// Pointer to the tree factory that manufactured this
78 /// to manufacture another auto-tracked common tree structure
85 /// payload. You can further abstract common tree so long
90 /// general tree duplication stuff.
95 /// the tree adaptor (see comments there) should allocate the
101 /// JIMS_TREE (note that the base tree i
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DBaseTreeAdaptor.cs45 * expensive: we have to create a hashtable with all tree nodes in it.
56 * Create tree node that holds the start and stop tokens associated
61 * If you specify your own kind of tree nodes, you will likely have to
67 * subclass your own tree node class to avoid class cast exception.
77 public virtual bool IsNil(object tree) { argument
78 return ((ITree)tree).IsNil;
81 public virtual object DupTree(object tree) { argument
82 return DupTree(tree, null);
87 * tree (not just ITree interface). It invokes the adaptor routines
88 * not the tree nod
[all...]
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DRewriteRuleTokenStream.java28 package org.antlr.runtime.tree;
66 /** Don't convert to a tree unless they explicitly call nextTree.
67 * This way we can do hetero tree nodes in rewrite.
H A DTree.java28 package org.antlr.runtime.tree;
34 /** What does a tree look like? ANTLR has a number of support classes
39 * NOTE: When constructing trees, ANTLR can build any kind of tree; it can
42 * This is a tree node without any payload; just navigation and factory stuff.
87 * a list (nil-root tree). num of children can increase or decrease.
94 * the tree is a flat list.
114 /** Return a token type; needed for tree parsing */
H A DTreeVisitor.java29 package org.antlr.runtime.tree;
31 /** Do a depth first walk of a tree, applying pre() and post() actions
42 /** Visit every node in tree t and trigger an action for each node
48 * and returns the new tree.
/external/antlr/antlr-3.4/runtime/Python/tests/
H A Dt056lexer.py4 import antlr3.tree namespace
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/modes/
H A Dast-builder.rb4 require 'antlr3/tree'
12 super.push( :tree )
/external/chromium-trace/trace-viewer/src/cc/
H A Dlayer_tree_host_impl.js56 throw new Exception('Unknown tree type + ' + whichTree);
91 function handleTree(tree) {
92 tree.renderSurfaceLayerList.forEach(function(layer) {
/external/chromium_org/cc/layers/
H A Dpicture_image_layer_impl_unittest.cc43 LayerTreeImpl* tree = NULL; local
46 tree = host_impl_.active_tree();
49 tree = host_impl_.pending_tree();
56 new TestablePictureImageLayerImpl(tree, id);
/external/chromium_org/native_client_sdk/src/build_tools/
H A Dtest_sdk.py49 tree = parse_dsc.LoadProjectTree(SDK_SRC_DIR, include=filters)
51 build_projects.UpdateProjects(pepperdir, tree, clobber=False,
67 tree = parse_dsc.LoadProjectTree(SDK_SRC_DIR, include=filters)
87 for root, projects in tree.iteritems():
/external/chromium_org/third_party/libxml/src/include/libxml/
H A Dc14n.h27 #include <libxml/tree.h>
H A Ddict.h15 #include <libxml/tree.h>
/external/chromium_org/third_party/libxml/src/
H A DtestXPath.c32 #include <libxml/tree.h>
47 static int tree = 0; variable
99 if (tree)
161 else if ((!strcmp(argv[i], "-tree")) || (!strcmp(argv[i], "--tree")))
162 tree++;
207 printf("\t--tree : show the compiled XPath tree\n");
/external/chromium_org/third_party/libxslt/libxslt/
H A Ddocuments.h15 #include <libxml/tree.h>
H A Dnamespaces.h14 #include <libxml/tree.h>
/external/libvpx/libvpx/vp8/common/
H A Dentropy.h6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
42 vp8_tree_p tree; member in struct:__anon20608
/external/libvpx/libvpx/vp8/common/ppc/
H A Dplatform_altivec.asm6 ; tree. An additional intellectual property rights grant can be found
8 ; be found in the AUTHORS file in the root of the source tree.

Completed in 396 milliseconds

1234567891011>>