Searched refs:tree (Results 126 - 150 of 1842) sorted by relevance

1234567891011>>

/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/
H A DSimpleCParser.m234 @synthesize tree; /* start of synthesize -- OBJC-Line 1837 */
249 return tree;
254 if (tree != aTree) {
255 if (tree != nil) [tree release];
257 tree = aTree;
263 self.tree = nil;
274 @synthesize tree; /* start of synthesize -- OBJC-Line 1837 */
289 return tree;
294 if (tree !
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DBstOperations.java37 * Returns the node with key {@code key} in {@code tree}, if any.
41 Comparator<? super K> comparator, @Nullable N tree, @Nullable K key) {
43 if (tree == null) {
46 int cmp = comparator.compare(key, tree.getKey());
48 return tree;
51 return seek(comparator, tree.childOrNull(side), key);
57 * tree} at the location with key {@code key}.
61 * original tree is returned.
63 * the tree will be rebuilt with the node factory of the mutation rule, but not rebalanced.
65 * the tree wil
40 seek( Comparator<? super K> comparator, @Nullable N tree, @Nullable K key) argument
68 mutate( Comparator<? super K> comparator, BstMutationRule<K, N> mutationRule, @Nullable N tree, @Nullable K key) argument
112 modify( @ullable N tree, K key, BstMutationRule<K, N> mutationRule) argument
[all...]
H A DBstAggregate.java22 * An integer-valued function on binary search tree nodes that adds between nodes.
25 * tree can require a {@code long}.
35 long treeValue(@Nullable N tree); argument
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
H A DRewriteCardinalityException.as28 package org.antlr.runtime.tree {
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DITreeNodeStream.cs34 /** <summary>A stream of tree nodes, accessing nodes from a tree of some kind</summary> */
37 * Get a tree node at an absolute index i; 0..n-1.
47 * Get tree node at current input pointer + i ahead where i=1 is next node.
57 * returns a tree node instead of a token. Makes code gen identical
58 * for both parser and tree grammars. :)
73 * If the tree associated with this stream was created from a TokenStream,
74 * you can specify it here. Used to do rule $text attribute in tree
75 * parser. Optional unless you use tree parser rule text attribute
93 * As we flatten the tree, w
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
H A DITreeNodeStream.cs35 /** <summary>A stream of tree nodes, accessing nodes from a tree of some kind</summary> */
39 * Get a tree node at an absolute index i; 0..n-1.
50 * Get tree node at current input pointer + i ahead where i=1 is next node.
60 * returns a tree node instead of a token. Makes code gen identical
61 * for both parser and tree grammars. :)
77 * If the tree associated with this stream was created from a TokenStream,
78 * you can specify it here. Used to do rule $text attribute in tree
79 * parser. Optional unless you use tree parser rule text attribute
99 * As we flatten the tree, w
[all...]
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
H A DCommonErrorNode.js1 org.antlr.runtime.tree.CommonErrorNode = function(input, start, stop, e) {
18 org.antlr.lang.extend(org.antlr.runtime.tree.CommonErrorNode, org.antlr.runtime.tree.CommonTree, {
37 else if ( this.start instanceof org.antlr.runtime.tree.Tree ) {
41 // people should subclass if they alter the tree type so this
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/
H A DTreeRewriteParser.h38 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
42 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
57 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
61 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/output1/
H A DTreeRewriteParser.h21 ANTLRCommonTree *tree; // start of memVars() variable
25 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
35 ANTLRCommonTree *tree; // start of memVars() variable
39 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree; variable
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
H A DTestBufferedTreeNodeStream.java31 import org.antlr.runtime.tree.BufferedTreeNodeStream;
32 import org.antlr.runtime.tree.CommonTree;
33 import org.antlr.runtime.tree.Tree;
34 import org.antlr.runtime.tree.TreeNodeStream;
/external/chromium-trace/trace-viewer/src/cc/
H A Dlayer_tree_quad_stack_viewer.css7 layer-tree-quad-stack-viewer > top-controls {
19 layer-tree-quad-stack-viewer > quad-stack-viewer {
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DTransformSource.h25 #include <libxml/tree.h>
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/
H A DnavigatorView.css30 .navigator-domain-tree-item .icon {
34 .navigator-folder-tree-item .icon {
39 .navigator-script-tree-item .icon {
43 .navigator-stylesheet-tree-item .icon {
47 .navigator-document-tree-item .icon {
51 .navigator-other-tree-item .icon {
85 .navigator .base-navigator-tree-element-title {
91 .navigator .base-navigator-tree-element-title.editing {
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/test/
H A Dfinder.py59 """Returns the relative path from the top of the tree to the path, or None if the path is not under the top of the tree."""
66 """Delete all .pyc files in the tree that have no matching .py file."""
88 return [tree.top_directory for tree in self.trees if tree.top_directory not in paths]
91 for tree in self.trees:
92 tree.clean()
96 return any(self.filesystem.exists(self.filesystem.join(tree.top_directory, relpath)) for tree i
[all...]
/external/chromium_org/third_party/cython/src/Cython/Compiler/Tests/
H A DTestVisitor.py44 tree = self._build_tree()
45 Test(None)(tree)
58 tree = self._build_tree()
59 Test(None)(tree)
/external/chromium_org/third_party/libxslt/libxslt/
H A Dpreproc.h14 #include <libxml/tree.h>
H A Dxslt.h13 #include <libxml/tree.h>
/external/chromium_org/ui/wm/core/
H A Dwindow_util_unittest.cc34 scoped_ptr<ui::LayerTreeOwner> tree = local
39 ASSERT_EQ(1u, tree->root()->children().size());
41 EXPECT_NE(window11->layer(), tree->root()->children()[0]);
42 EXPECT_NE(window12->layer(), tree->root()->children()[0]);
/external/libxml2/
H A Denc.h15 #include <libxml/tree.h>
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/
H A DInsnNode.java30 package org.mockito.asm.tree;
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/analysis/
H A DAnalyzerException.java30 package org.mockito.asm.tree.analysis;
/external/qemu/distrib/zlib-1.2.8/
H A Dtrees.c13 * Each code tree is stored in a compressed form which is itself
87 /* The static literal tree. Since the bit lengths are imposed, there is no
89 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
94 /* The static distance tree. (Actually a trivial tree since all codes use
118 const ct_data *static_tree; /* static tree or NULL */
121 int elems; /* max number of elements in the tree */
140 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
144 local void scan_tree OF((deflate_state *s, ct_data *tree, in
492 ct_data *tree = desc->dyn_tree; local
621 ct_data *tree = desc->dyn_tree; local
[all...]
/external/smali/smali/src/main/java/org/jf/smali/
H A DSemanticException.java35 import org.antlr.runtime.tree.CommonTree;
51 SemanticException(IntStream input, CommonTree tree, String errorMessage, Object... messageArguments) { argument
54 this.token = tree.getToken();
55 this.index = tree.getTokenStartIndex();
/external/smali/util/src/main/java/ds/tree/
H A DVisitorImpl.java1 package ds.tree;
/external/zlib/src/
H A Dtrees.c13 * Each code tree is stored in a compressed form which is itself
87 /* The static literal tree. Since the bit lengths are imposed, there is no
89 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
94 /* The static distance tree. (Actually a trivial tree since all codes use
118 const ct_data *static_tree; /* static tree or NULL */
121 int elems; /* max number of elements in the tree */
140 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
144 local void scan_tree OF((deflate_state *s, ct_data *tree, in
492 ct_data *tree = desc->dyn_tree; local
621 ct_data *tree = desc->dyn_tree; local
[all...]

Completed in 4459 milliseconds

1234567891011>>