Searched defs:tree (Results 1 - 25 of 88) sorted by relevance

1234

/external/antlr/src/org/antlr/runtime/tree/
H A DRewriteCardinalityException.java28 package org.antlr.runtime.tree;
H A DRewriteEarlyExitException.java28 package org.antlr.runtime.tree;
H A DRewriteEmptyStreamException.java28 package org.antlr.runtime.tree;
H A DTreeRuleReturnScope.java28 package org.antlr.runtime.tree;
33 * the start property is a tree nodes not Token object
34 * when you are parsing trees. To be generic the tree node types
38 /** First node or root node of tree matched for this rule. */
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.
H A DTreeVisitorAction.java29 package org.antlr.runtime.tree;
H A DTreeIterator.java28 package org.antlr.runtime.tree;
36 /** Return a node stream from a doubly-linked tree whose nodes
39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
44 protected Object tree; field in class:TreeIterator
57 public TreeIterator(Object tree) { argument
58 this(new CommonTreeAdaptor(),tree);
61 public TreeIterator(TreeAdaptor adaptor, Object tree) { argument
63 this.tree = tree;
64 this.root = tree;
[all...]
H A DCommonErrorNode.java28 package org.antlr.runtime.tree;
81 // people should subclass if they alter the tree type so this
H A DRewriteRuleNodeStream.java28 package org.antlr.runtime.tree;
32 /** Queues up nodes matched on left side of -> in a tree parser. This is
H A DRewriteRuleSubtreeStream.java28 package org.antlr.runtime.tree;
56 * tree root node. Also prevents us from duplicating recently-added
60 * Referencing a rule result twice is ok; dup entire tree as
65 * and super.next() doesn't know which to call: dup node or dup tree.
77 Object tree = _next();
78 while (adaptor.isNil(tree) && adaptor.getChildCount(tree) == 1)
79 tree = adaptor.getChild(tree, 0);
80 //System.out.println("_next="+((Tree)tree)
[all...]
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 DTreePatternParser.java28 package org.antlr.runtime.tree;
H A DTreeFilter.java28 package org.antlr.runtime.tree;
38 Now, how are we going to test these tree patterns against every
39 subtree in our original tree? In what order should we visit nodes?
41 rule application strategy and a ``down then up'' tree traversal
45 a pattern matches, we execute the associated tree rewrite and move on
49 TreeParser (derived from a tree grammar) to a tree:
54 tree parser class (@cl Simplify in this case). Most of the time, the
55 rule will not match the tree. To avoid issuing syntax errors and
59 the details. This method boils down to ``call a rule to match a tree,
[all...]
H A DParseTree.java28 package org.antlr.runtime.tree;
35 * end up as the leaves of this tree and rule nodes are the interior nodes.
100 /** Print out the leaves of this tree, which means printing original
H A DRewriteRuleElementStream.java28 package org.antlr.runtime.tree;
41 * @see org.antlr.runtime.tree.RewriteRuleSubtreeStream
42 * @see org.antlr.runtime.tree.RewriteRuleTokenStream
149 * a tree node or subtree. Deal with the optimization of single-
180 * the element is for a tree root; then it must be a node dup.
H A DTreeNodeStream.java28 package org.antlr.runtime.tree;
33 /** A stream of tree nodes, accessing nodes from a tree of some kind */
35 /** Get a tree node at an absolute index i; 0..n-1.
41 /** Get tree node at current input pointer + i ahead where i=1 is next node.
49 * returns a tree node instead of a token. Makes code gen identical
50 * for both parser and tree grammars. :)
59 /** If the tree associated with this stream was created from a TokenStream,
60 * you can specify it here. Used to do rule $text attribute in tree
61 * parser. Optional unless you use tree parse
[all...]
H A DTreePatternLexer.java28 package org.antlr.runtime.tree;
40 /** The tree pattern to lex like "(A B C)" */
H A DTreeRewriter.java28 package org.antlr.runtime.tree;
116 // to override, just define tree grammar rule topdown and turn on
/external/chromium/chrome/browser/extensions/
H A Dextension_bookmarks_unittest.cc34 DictionaryValue* tree = extension_bookmark_helpers::GetNodeDictionary( local
39 tree->GetList(keys::kChildrenKey, &children);
44 DictionaryValue* tree = extension_bookmark_helpers::GetNodeDictionary( local
49 tree->GetList(keys::kChildrenKey, &children);
54 DictionaryValue* tree = extension_bookmark_helpers::GetNodeDictionary( local
59 tree->GetList(keys::kChildrenKey, &children);
69 DictionaryValue* tree = extension_bookmark_helpers::GetNodeDictionary( local
74 tree->GetList(keys::kChildrenKey, &children);
/external/openssl/crypto/x509v3/
H A Dpcy_lib.c70 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) argument
72 if (!tree)
74 return tree->nlevel;
78 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i) argument
80 if (!tree || (i < 0) || (i >= tree->nlevel))
82 return tree->levels + i;
86 X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree)
88 if (!tree)
90 return tree
[all...]
H A Dpcy_node.c115 X509_POLICY_TREE *tree)
144 if (tree)
146 if (!tree->extra_data)
147 tree->extra_data = sk_X509_POLICY_DATA_new_null();
148 if (!tree->extra_data)
150 if (!sk_X509_POLICY_DATA_push(tree->extra_data, data))
112 level_add_node(X509_POLICY_LEVEL *level, const X509_POLICY_DATA *data, X509_POLICY_NODE *parent, X509_POLICY_TREE *tree) argument
/external/webkit/Source/WebKit/chromium/tests/
H A DPODRedBlackTreeTest.cpp26 // Tests for the red-black tree class.
49 PODRedBlackTree<int> tree(arena);
52 tree.add(i);
60 PODRedBlackTree<int> tree; local
61 tree.add(5);
62 ASSERT_TRUE(tree.checkInvariants());
63 EXPECT_TRUE(tree.contains(5));
68 PODRedBlackTree<int> tree; local
69 tree.add(4);
70 ASSERT_TRUE(tree
84 PODRedBlackTree<int> tree; local
97 PODRedBlackTree<int> tree; local
108 PODRedBlackTree<int> tree; local
135 PODRedBlackTree<int> tree; local
159 PODRedBlackTree<int> tree; local
178 PODRedBlackTree<int> tree; local
[all...]
/external/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.
43 vp8_tree_p tree; member in struct:__anon6203
H A Dtreecoder.c6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
59 vp8_tree tree,
96 i = tree[ i + b];
112 vp8_tree tree,
123 branch_counts(n, tok, tree, branch_ct, num_events);
56 branch_counts( int n, vp8_token tok [ ], vp8_tree tree, unsigned int branch_ct [ ] [2], const unsigned int num_events[ ] ) argument
109 vp8_tree_probs_from_distribution( int n, vp8_token tok [ ], vp8_tree tree, vp8_prob probs [ ], unsigned int branch_ct [ ] [2], const unsigned int num_events[ ], unsigned int Pfac, int rd ) argument
/external/v8/src/
H A Dprofile-generator-inl.h74 ProfileNode::ProfileNode(ProfileTree* tree, CodeEntry* entry) argument
75 : tree_(tree),

Completed in 233 milliseconds

1234