| /external/webkit/Source/WebKit/android/WebCoreSupport/ |
| ResourceLoaderAndroid.cpp | 45 bool isMainFrame = !(clientAndroid->getFrame()->tree() && clientAndroid->getFrame()->tree()->parent());
|
| /frameworks/base/tools/aapt/ |
| Command.cpp | 214 ResXMLTree tree; local
215 tree.setTo(manifestAsset->getBuffer(true),
217 printXMLBlock(&tree);
229 static ssize_t indexOfAttribute(const ResXMLTree& tree, uint32_t attrRes)
231 size_t N = tree.getAttributeCount();
233 if (tree.getAttributeNameResID(i) == attrRes) {
240 String8 getAttribute(const ResXMLTree& tree, const char* ns,
243 ssize_t idx = tree.indexOfAttribute(ns, attr);
248 if (tree.getAttributeValue(idx, &value) != NO_ERROR) {
255 const uint16_t* str = tree.getAttributeStringValue(idx, &len)
496 ResXMLTree tree; local
523 ResXMLTree tree; local
541 ResXMLTree tree; local
[all...] |
| /external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/swingui/ |
| RunnerController.java | 44 import javax.swing.tree.DefaultMutableTreeNode;
45 import javax.swing.tree.DefaultTreeModel;
46 import javax.swing.tree.TreeCellRenderer;
47 import javax.swing.tree.TreeModel;
48 import javax.swing.tree.TreePath;
67 private JTree tree = new JTree(); field in class:RunnerController.RunnerView
69 private JScrollPane scroll = new JScrollPane(tree,
75 tree.setOpaque(false);
103 view.tree.setModel(new RunnerTreeModel(suite));
104 view.tree.setCellRenderer(new RunnerTreeRenderer())
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/ |
| TreeRewriteParser.m | 45 @synthesize tree; /* start of synthesize -- OBJC-Line 1837 */
60 return tree;
65 if (tree != aTree) {
66 if (tree != nil) [tree release];
68 tree = aTree;
74 self.tree = nil;
85 @synthesize tree; /* start of synthesize -- OBJC-Line 1837 */
100 return tree;
105 if (tree != aTree)
[all...] |
| TreeRewriteParser.h | 38 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
|
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| function.h | 25 #include "tree.h"
186 /* Number of tree-constants deferred during the expansion of this
270 tree stack_protect_guard;
525 tree decl;
529 tree static_chain_decl;
534 tree nonlocal_goto_save_area;
537 VEC(tree,gc) *local_decls;
683 add_local_decl (struct function *fun, tree d)
685 VEC_safe_push (tree, gc, fun->local_decls, d);
689 FOR_EACH_VEC_ELT_REVERSE (tree, (FUN)->local_decls, I, D
[all...] |
| predict.h | 43 extern tree build_predict_expr (enum br_predictor, enum prediction);
|
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| function.h | 25 #include "tree.h"
186 /* Number of tree-constants deferred during the expansion of this
270 tree stack_protect_guard;
525 tree decl;
529 tree static_chain_decl;
534 tree nonlocal_goto_save_area;
537 VEC(tree,gc) *local_decls;
683 add_local_decl (struct function *fun, tree d)
685 VEC_safe_push (tree, gc, fun->local_decls, d);
689 FOR_EACH_VEC_ELT_REVERSE (tree, (FUN)->local_decls, I, D
[all...] |
| predict.h | 43 extern tree build_predict_expr (enum br_predictor, enum prediction);
|
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| function.h | 25 #include "tree.h"
186 /* Number of tree-constants deferred during the expansion of this
270 tree stack_protect_guard;
525 tree decl;
529 tree static_chain_decl;
534 tree nonlocal_goto_save_area;
537 VEC(tree,gc) *local_decls;
683 add_local_decl (struct function *fun, tree d)
685 VEC_safe_push (tree, gc, fun->local_decls, d);
689 FOR_EACH_VEC_ELT_REVERSE (tree, (FUN)->local_decls, I, D
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/ |
| wizard.rb | 43 using definitions writing in ANTLR-style tree definition syntax. It can also
44 define <i>tree patterns</i>, objects that are conceptually similar to regular
46 AST for a particular node structure. These features make tree wizards useful
47 while testing and debugging AST constructing parsers and tree parsers. This
52 for more background on the concept of a tree wizard.
56 # setting up and creating a tree wizard
70 deep_node = wizard.create(<<-TREE)
78 TREE
84 # test whether a tree matches a pattern
94 # iterate through the tree and extract nodes with pattern label
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/ |
| SimpleCParser.m | 234 @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 != aTree)
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| BstOperations.java | 37 * 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 will be rebalanced using the balance policy of the mutation rule
[all...] |
| BstAggregate.java | 22 * 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);
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| RewriteCardinalityException.as | 28 package org.antlr.runtime.tree {
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/output1/ |
| TreeRewriteParser.h | 21 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/ |
| TestBufferedTreeNodeStream.java | 31 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;
52 Tree r0 = new CommonTree(new CommonToken(101));
53 Tree r1 = new CommonTree(new CommonToken(102));
56 Tree r2 = new CommonTree(new CommonToken(106));
67 assertEquals(107, ((Tree)stream.LT(1)).getType());
71 assertEquals(104, ((Tree)stream.LT(1)).getType())
[all...] |
| /external/libxslt/libxslt/ |
| preproc.h | 14 #include <libxml/tree.h>
|
| xslt.h | 13 #include <libxml/tree.h>
|
| /external/qemu/distrib/zlib-1.2.3/ |
| trees.c | 12 * Each code tree is stored in a compressed form which is itself
91 /* The static literal tree. Since the bit lengths are imposed, there is no
93 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
98 /* The static distance tree. (Actually a trivial tree since all codes use
122 const ct_data *static_tree; /* static tree or NULL */
125 int elems; /* max number of elements in the tree */
144 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
148 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code))
494 ct_data *tree = desc->dyn_tree; local
623 ct_data *tree = desc->dyn_tree; local
[all...] |
| /external/smali/smali/src/main/java/org/jf/smali/ |
| SemanticException.java | 35 import org.antlr.runtime.tree.CommonTree;
51 SemanticException(IntStream input, CommonTree tree, String errorMessage, Object... messageArguments) {
54 this.token = tree.getToken();
55 this.index = tree.getTokenStartIndex();
|
| /external/smali/util/src/main/java/ds/tree/ |
| VisitorImpl.java | 1 package ds.tree;
|
| /external/zlib/ |
| trees.c | 13 * 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, int max_code))
492 ct_data *tree = desc->dyn_tree; local
621 ct_data *tree = desc->dyn_tree; local
[all...] |
| /frameworks/testing/uiautomator/utils/uiautomatorviewer/src/com/android/uiautomator/tree/ |
| RootWindowNode.java | 17 package com.android.uiautomator.tree;
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| predict.h | 42 extern tree build_predict_expr (enum br_predictor, enum prediction);
|
