Searched refs:tree (Results 276 - 300 of 1842) sorted by relevance

<<11121314151617181920>>

/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/analysis/
H A DBasicInterpreter.java30 package org.mockito.asm.tree.analysis;
36 import org.mockito.asm.tree.AbstractInsnNode;
37 import org.mockito.asm.tree.FieldInsnNode;
38 import org.mockito.asm.tree.IntInsnNode;
39 import org.mockito.asm.tree.LdcInsnNode;
40 import org.mockito.asm.tree.MethodInsnNode;
41 import org.mockito.asm.tree.MultiANewArrayInsnNode;
42 import org.mockito.asm.tree.TypeInsnNode;
H A DSourceInterpreter.java30 package org.mockito.asm.tree.analysis;
38 import org.mockito.asm.tree.AbstractInsnNode;
39 import org.mockito.asm.tree.FieldInsnNode;
40 import org.mockito.asm.tree.LdcInsnNode;
41 import org.mockito.asm.tree.MethodInsnNode;
/external/antlr/antlr-3.4/runtime/Python/tests/
H A Dt055templates.py4 import antlr3.tree namespace
435 r'''tree grammar T6Walker;
484 tree = parser.prog().tree
485 nodes = antlr3.tree.CommonTreeNodeStream(tree)
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/
H A DASTTreeParser.stg29 /** Templates for building ASTs during tree parsing.
54 retval.tree = (<ASTLabelType>)_first_0;
55 if ( adaptor.getParent(retval.tree)!=null && adaptor.isNil( adaptor.getParent(retval.tree) ) )
56 retval.tree = (<ASTLabelType>)adaptor.getParent(retval.tree);
61 /** match ^(root children) in tree parser; override here to
62 * add tree construction actions.
64 tree(root, actionsAfterRoot, children, nullableChildList,
77 if ( _first_<enclosingTreeLevel>==null ) _first_<enclosingTreeLevel> = <root.el.label>.tree;
[all...]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/
H A DASTTreeParser.stg1 /** Templates for building ASTs during tree parsing.
27 retval.tree = _first_0;
28 if ( this.adaptor.getParent(retval.tree) && this.adaptor.isNil( this.adaptor.getParent(retval.tree) ) )
29 retval.tree = this.adaptor.getParent(retval.tree);
34 /** match ^(root children) in tree parser; override here to
35 * add tree construction actions.
37 tree(root, actionsAfterRoot, children, nullableChildList,
50 if ( !_first_<enclosingTreeLevel> ) _first_<enclosingTreeLevel> = <root.el.label>.tree;
[all...]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Perl5/
H A DASTTreeParser.stg30 /** Templates for building ASTs during tree parsing.
56 retval.tree = (<ASTLabelType>)_first_0;
57 if ( adaptor.getParent(retval.tree)!=null && adaptor.isNil( adaptor.getParent(retval.tree) ) )
58 retval.tree = (<ASTLabelType>)adaptor.getParent(retval.tree);
63 /** match ^(root children) in tree parser; override here to
64 * add tree construction actions.
66 tree(root, actionsAfterRoot, children, nullableChildList,
79 if ( _first_<enclosingTreeLevel>==null ) _first_<enclosingTreeLevel> = <root.el.label>.tree;
[all...]
/external/chromium_org/v8/tools/
H A Dcodemap.js151 CodeMap.prototype.deleteAllCoveredNodes_ = function(tree, start, end) {
155 var node = tree.findGreatestLessThan(addr);
161 for (var i = 0, l = to_delete.length; i < l; ++i) tree.remove(to_delete[i]);
176 CodeMap.prototype.findInTree_ = function(tree, addr) {
177 var node = tree.findGreatestLessThan(addr);
/external/chromium-trace/trace-viewer/src/tracing/importer/v8/
H A Dcodemap.js137 CodeMap.prototype.deleteAllCoveredNodes_ = function(tree, start, end) {
141 var node = tree.findGreatestLessThan(addr);
147 for (var i = 0, l = to_delete.length; i < l; ++i) tree.remove(to_delete[i]);
162 CodeMap.prototype.findInTree_ = function(tree, addr) {
163 var node = tree.findGreatestLessThan(addr);
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/tree-parser/
H A Dbasic.rb21 tree grammar FlatListWalker;
37 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
44 example "simple tree" do
57 tree grammar SimpleTreeWalker;
73 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
80 example "flat vs tree decision" do
95 tree grammar FlatVsTreeDecisionWalker;
112 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
119 example "flat vs tree decision2" do
134 tree gramma
[all...]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/
H A DAST.stg32 <if(!TREE_PARSER)><! tree parser would already have imported !>
33 import org.antlr.runtime.tree.*;<\n>
55 <ASTLabelType> tree;
56 public function get tree():Object { return tree; }
122 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>stream_<rule.name>.add(<label>.tree);
128 <listLabel(elem=label+".tree",...)>
134 <if(backtracking)>if ( <actions.(actionScope).synpredgate> ) <endif>stream_<rule>.add(<label>.tree);
140 <listLabel(elem=label+".tree",...)>
166 <prevRuleRootRef()>.tree
[all...]
/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/chromium_org/content/browser/accessibility/
H A Dcross_platform_accessibility_browsertest.cc40 // Tell the renderer to send an accessibility tree, then wait for the
50 // Make sure each node in the tree has an unique id.
144 const ui::AXTree& tree = GetAXTree(); local
145 const ui::AXNode* root = tree.GetRoot();
147 // Check properties of the root element of the tree.
215 const ui::AXTree& tree = GetAXTree(); local
216 const ui::AXNode* root = tree.GetRoot();
247 const ui::AXTree& tree = GetAXTree(); local
248 const ui::AXNode* root = tree.GetRoot();
265 // In a WebKit accessibility render tree fo
277 const ui::AXTree& tree = GetAXTree(); local
326 const ui::AXTree& tree = GetAXTree(); local
348 const ui::AXTree& tree = GetAXTree(); local
399 const ui::AXTree& tree = GetAXTree(); local
427 const ui::AXTree& tree = GetAXTree(); local
490 const ui::AXTree& tree = GetAXTree(); local
[all...]
/external/chromium_org/third_party/WebKit/Source/core/page/
H A DPage.cpp91 for (Frame* frame = (*it)->mainFrame(); frame; frame = frame->tree().traverseNext()) {
235 for (Frame* frame = (*it)->mainFrame(); frame; frame = frame->tree().traverseNext()) {
243 for (Frame* frame = mainFrame(); frame; frame = frame->tree().traverseNext()) {
251 for (Frame* frame = mainFrame(); frame; frame = frame->tree().traverseNext()) {
281 for (Frame* frame = (*it)->mainFrame(); frame; frame = frame->tree().traverseNext()) {
303 ? curr->tree().traverseNextWithWrap(wrapFlag)
304 : curr->tree().traversePreviousWithWrap(wrapFlag);
331 for (Frame* frame = mainFrame(); frame; frame = frame->tree().traverseNext()) {
400 for (Frame* frame = page->m_mainFrame; frame; frame = frame->tree().traverseNext()) {
412 for (Frame* frame = page->m_mainFrame; frame; frame = frame->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/chromium_org/tools/binary_size/
H A Drun_binary_size_analysis.py142 Returns the number of added levels in tree. I.e. returns 2."""
193 # Find pre-existing node in tree, or update if it already exists
225 """Convert symbols into a path-based tree, calculating size information
262 tree = dirs
264 # Traverse the tree to the parent of the file node, creating as needed
267 if part not in tree['children']:
268 tree['children'][part] = {'children': {}, 'size': 0}
269 tree = tree['children'][part]
270 tree['siz
[all...]
/external/freetype/src/gzip/
H A Dinfcodes.c39 inflate_huft *tree; /* pointer into tree */ member in struct:inflate_codes_state::__anon21549::__anon21550
41 } code; /* if LEN or DIST, where in tree */
52 inflate_huft *ltree; /* literal/length/eob tree */
53 inflate_huft *dtree; /* distance tree */
118 c->sub.code.tree = c->ltree;
123 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
145 c->sub.code.tree = t + t->base;
164 c->sub.code.tree = c->dtree;
170 t = c->sub.code.tree
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/
H A DCPUProfileDataGrid.js39 this.tree = owningTree;
79 var target = this.tree.profileView.target();
80 var urlElement = this.tree.profileView._linkifier.linkifyScriptLocation(target, this.profileNode.scriptId, this.profileNode.url, lineNumber, columnNumber, "profile-node-file");
149 this.tree.profileView._dataGridNodeSelected(this);
155 this.tree.profileView._dataGridNodeDeselected(this);
240 return this.selfTime / this.tree.totalTime * 100.0;
245 return this.totalTime / this.tree.totalTime * 100.0;
260 // When focusing and collapsing we modify lots of nodes in the tree.
275 * When focusing and collapsing we modify lots of nodes in the tree.
358 var currentComparator = container.tree
[all...]
/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/elfutils/0.153/libdw/
H A Dlibdw_findcu.c144 void **tree = debug_types ? &dbg->tu_tree : &dbg->cu_tree; local
150 struct Dwarf_CU **found = tfind (&fake, tree, findcu_cb);
168 /* Add the new entry to the search tree. */
169 if (tsearch (newp, tree, findcu_cb) == NULL)
/external/libnl/lib/route/cls/
H A Dcgroup.c97 int rtnl_cgroup_set_ematch(struct rtnl_cls *cls, struct rtnl_ematch_tree *tree) argument
106 cg->cg_ematch = tree;
108 if (tree)
/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...]

Completed in 1704 milliseconds

<<11121314151617181920>>