| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| RewriteEmptyStreamException.java | 28 package org.antlr.runtime.tree;
|
| RewriteRuleSubtreeStream.java | 28 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.
68 //System.out.println("nextNode: elements="+elements+", singleElement="+((Tree)singleElement).toStringTree());
77 Object tree = _next(); local
78 while (adaptor.isNil(tree) && adaptor.getChildCount(tree) == 1)
79 tree = adaptor.getChild(tree, 0)
[all...] |
| RewriteEarlyExitException.java | 28 package org.antlr.runtime.tree;
|
| TreeVisitorAction.java | 29 package org.antlr.runtime.tree;
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| RewriteEmptyStreamException.js | 2 org.antlr.runtime.tree.RewriteEmptyStreamException = function(elementDescription) {
3 var sup = org.antlr.runtime.tree.RewriteEmptyStreamException.superclass;
7 org.antlr.lang.extend(org.antlr.runtime.tree.RewriteEmptyStreamException,
8 org.antlr.runtime.tree.RewriteCardinalityException, {
10 return "org.antlr.runtime.tree.RewriteEmptyStreamException";
|
| RewriteEarlyExitException.js | 2 org.antlr.runtime.tree.RewriteEarlyExitException = function(elementDescription) {
3 var sup = org.antlr.runtime.tree.RewriteEarlyExitException.superclass;
10 org.antlr.lang.extend(org.antlr.runtime.tree.RewriteEarlyExitException,
11 org.antlr.runtime.tree.RewriteCardinalityException, {
13 return "org.antlr.runtime.tree.RewriteEarlyExitException";
|
| RewriteRuleNodeStream.js | 1 /** Queues up nodes matched on left side of -> in a tree parser. This is
4 org.antlr.runtime.tree.RewriteRuleNodeStream = function(adaptor, elementDescription, el) {
5 org.antlr.runtime.tree.RewriteRuleNodeStream.superclass.constructor.apply(this, arguments);
8 org.antlr.lang.extend(org.antlr.runtime.tree.RewriteRuleNodeStream,
9 org.antlr.runtime.tree.RewriteRuleElementStream,
|
| /external/smali/util/src/main/java/ds/tree/ |
| DuplicateKeyException.java | 25 package ds.tree;
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| target.h | 123 void (* globalize_decl_name) (FILE *, tree);
130 void (* unwind_label) (FILE *, tree, int, int);
146 associated with the tree decl. */
147 void (* visibility) (tree, int);
167 void (* named_section) (const char *name, unsigned int flags, tree decl);
179 section *(* select_section) (tree, int, unsigned HOST_WIDE_INT);
188 void (* unique_section) (tree, int);
191 section *(* function_rodata_section) (tree);
204 void (* output_mi_thunk) (FILE *file, tree thunk_decl,
206 tree function_decl)
[all...] |
| output.h | 153 extern void declare_weak (tree);
155 extern void merge_weak (tree, tree);
172 extern void assemble_alias (tree, tree);
174 extern void default_assemble_visibility (tree, int);
178 extern void assemble_asm (tree);
184 extern void assemble_start_function (tree, const char *);
188 extern void assemble_end_function (tree, const char *);
199 extern void assemble_variable (tree, int, int, int)
[all...] |
| alias.h | 34 extern alias_set_type get_alias_set (tree);
40 extern void record_component_aliases (tree);
43 extern int objects_must_conflict_p (tree, tree);
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3parsetree.h | 2 * Abstraction of Common tree to provide payload and string representation of node.
53 /** The payload that the parse tree node passes around
57 /** An encapsulated BASE TREE strcuture (NOT a pointer)
64 pANTLR3_BASE_TREE (*dupNode) (struct ANTLR3_PARSE_TREE_struct * tree);
68 ANTLR3_UINT32 (*getType) (struct ANTLR3_PARSE_TREE_struct * tree);
76 void (*free) (struct ANTLR3_PARSE_TREE_struct * tree);
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| ParserRuleReturnScope.java | 30 import org.antlr.runtime.tree.CommonTree;
37 * available depending on output option such as template and tree.
55 public Object tree; // only used when output=AST field in class:ParserRuleReturnScope
56 public Object getTree() { return tree; }
|
| /external/bluetooth/glib/glib/ |
| gtree.h | 53 void g_tree_destroy (GTree *tree);
54 void g_tree_insert (GTree *tree,
57 void g_tree_replace (GTree *tree,
60 gboolean g_tree_remove (GTree *tree,
62 gboolean g_tree_steal (GTree *tree,
64 gpointer g_tree_lookup (GTree *tree,
66 gboolean g_tree_lookup_extended (GTree *tree,
70 void g_tree_foreach (GTree *tree,
75 void g_tree_traverse (GTree *tree,
81 gpointer g_tree_search (GTree *tree,
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| tree.h | 1 /* Front-end tree definitions for GNU compiler.
37 /* Codes of tree nodes */
43 #include "all-tree.def"
53 /* Number of language-independent tree codes. */
56 /* Tree code classes. */
78 /* Each tree code class has an associated string representation.
163 /* Returns nonzero iff CLASS is the tree-code class of an
173 /* Number of argument-words in each kind of tree-node. */
178 /* Names of tree components. */
198 tree decl
4639 extern VEC(tree,gc) *ctor_to_vec (tree); variable
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| tree.h | 1 /* Front-end tree definitions for GNU compiler.
37 /* Codes of tree nodes */
43 #include "all-tree.def"
53 /* Number of language-independent tree codes. */
56 /* Tree code classes. */
78 /* Each tree code class has an associated string representation.
163 /* Returns nonzero iff CLASS is the tree-code class of an
173 /* Number of argument-words in each kind of tree-node. */
178 /* Names of tree components. */
198 tree decl
4639 extern VEC(tree,gc) *ctor_to_vec (tree); variable
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| tree.h | 1 /* Front-end tree definitions for GNU compiler.
37 /* Codes of tree nodes */
43 #include "all-tree.def"
53 /* Number of language-independent tree codes. */
56 /* Tree code classes. */
78 /* Each tree code class has an associated string representation.
163 /* Returns nonzero iff CLASS is the tree-code class of an
173 /* Number of argument-words in each kind of tree-node. */
178 /* Names of tree components. */
198 tree decl
4639 extern VEC(tree,gc) *ctor_to_vec (tree); variable
[all...] |
| /prebuilts/tools/common/asm-tools/ |
| asm-analysis-4.0.jar | |
| asm-tree-4.0.jar | |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| TreeRuleReturnScope.as | 28 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
39 /** First node or root node of tree matched for this rule. */
41 private var _tree:Object; // if output=AST this contains the tree
45 public override function get tree():Object {
49 public function set tree(tree:Object):void {
50 _tree = tree;
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| BaseTreeAdaptor.cs | 33 namespace Antlr.Runtime.Tree
42 /** <summary>A TreeAdaptor that works with any Tree implementation.</summary> */
48 * expensive: we have to create a hashtable with all tree nodes in it.
60 * Create tree node that holds the start and stop tokens associated
65 * If you specify your own kind of tree nodes, you will likely have to
71 * subclass your own tree node class to avoid class cast exception.
82 public virtual bool IsNil( object tree )
84 return ( (ITree)tree ).IsNil;
109 public virtual object DupTree( object tree )
111 return DupTree( tree, null )
[all...] |
| /external/bluetooth/glib/tests/ |
| tree-test.c | 108 GTree *tree; local
113 tree = g_tree_new (my_compare);
116 g_tree_insert (tree, &chars[i], &chars[i]);
118 g_tree_foreach (tree, my_traverse, NULL);
120 g_assert (g_tree_nnodes (tree) == strlen (chars));
121 g_assert (g_tree_height (tree) == 6);
124 g_tree_foreach (tree, check_order, &p);
128 removed = g_tree_remove (tree, &chars[i + 10]);
133 removed = g_tree_remove (tree, &c);
136 g_tree_foreach (tree, my_traverse, NULL)
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/ui/tree/ |
| ICommitXml.java | 18 package com.android.ide.eclipse.adt.internal.editors.ui.tree;
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/debug/ |
| trace-event-listener.rb | 52 def consume_node( tree )
53 record '(%s) unique_id=%s text=%p type=%s[%s]', __method__, @adaptor.unique_id( tree ),
54 @adaptor.text_of( tree ), @adaptor.type_name( tree ), @adaptor.type_of( tree )
57 def look( i, tree )
58 record '(%s): k=%s unique_id=%s text=%p type=%s[%s]', __method__, i, @adaptor.unique_id( tree ),
59 @adaptor.text_of( tree ), @adaptor.type_name( tree ), @adaptor.type_of( tree )
[all...] |
| /external/webkit/Source/WebCore/page/ |
| FrameTree.cpp | 38 for (Frame* child = firstChild(); child; child = child->tree()->nextSibling())
50 m_uniqueName = parent()->tree()->uniqueChildName(name);
68 Frame* oldParent = child->tree()->parent();
73 oldParent->tree()->removeChild(child.get());
76 child->tree()->m_parent = m_thisFrame;
79 child->tree()->setName(child->tree()->m_name);
88 child->tree()->m_parent = m_thisFrame;
94 ASSERT(child->tree()->m_parent == m_thisFrame);
99 child->tree()->m_previousSibling = oldLast
[all...] |
