| /external/chromium_org/ui/accessibility/ |
| ax_tree_serializer.h | 40 // AXTreeSerializer will avoid re-serializing nodes that do not change.
43 // update nodes 1 and 6 (and any children of node 6 recursively). It will
44 // assume that nodes 3, 4, and 5 are not modified unless you explicitly
60 // Throw out the internal state that keeps track of the nodes the client
123 // Walk the subtree rooted at |node| and return true if any nodes that
146 // A map from IDs to nodes in the client tree.
150 // In order to keep track of what nodes the client knows about, we keep a
230 // client tree, then call LeastCommonAncestor on those two nodes.
312 // to delete those nodes in our client tree so that
359 // 3. Update our internal data structure that keeps track of what nodes
[all...] |
| /external/chromium_org/v8/test/webkit/ |
| dfg-dead-unreachable-code-with-chain-of-dead-unchecked-nodes.js | 25 "Tests that code that is dead, unreachable, and contains a chain of nodes that use each other in an untyped way doesn't result in the IR getting corrupted."
|
| /external/chromium_org/webkit/data/test_shell/sort/ |
| sort.js | 275 var nodes = document.getElementsByTagName("li");
277 for (i = 0; i < nodes.length; i++) {
278 var name = nodes[i].id;
280 this.bars[j] = nodes[i];
|
| /external/llvm/utils/TableGen/ |
| DAGISelMatcher.h | 39 /// nodes.
84 MarkGlueResults, // Indicate which interior nodes have glue results.
157 /// we can move this matcher past all of the nodes in-between Other and this
169 // we always match a node against nodes with kinds that are greater or equal
720 /// MatchNumber - This is the recorded nodes slot that contains the node we
928 /// chains together with a token factor. The list of nodes are the nodes in th
[all...] |
| /prebuilts/tools/common/m2/repository/org/apache/maven/shared/maven-dependency-tree/1.2/ |
| maven-dependency-tree-1.2.jar | |
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| splay.js | 31 // JavaScript engine is at allocating nodes and reclaiming the memory
32 // used for old nodes. Because of the way splay trees work, the engine
113 // Replace a few nodes in the splay tree.
272 * @return {Array<*>} An array containing all the keys of tree's nodes.
301 // and right will always be nodes and we avoid special cases.
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/chromevox/injected/ |
| live_regions.js | 77 * Tracks nodes handled during mutation processing.
149 * track of nodes it's already spoken once.
328 // This includes aria-atomic, but also ARIA controls and other nodes
423 * describing atomic nodes or leaf nodes in the subtree rooted
|
| active_indicator.js | 255 * Move the indicator to surround the given nodes.
256 * @param {Array.<Node>} nodes The new targets of the indicator.
258 cvox.ActiveIndicator.prototype.syncToNodes = function(nodes) {
259 var clientRects = this.clientRectsFromNodes_(nodes);
261 this.lastSyncTarget_ = nodes;
365 * @param {Array.<Node>} nodes An array of nodes.
367 * those nodes.
370 cvox.ActiveIndicator.prototype.clientRectsFromNodes_ = function(nodes) {
372 for (var i = 0; i < nodes.length; ++i)
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
| v8-splay.js | 31 // JavaScript engine is at allocating nodes and reclaiming the memory
32 // used for old nodes. Because of the way splay trees work, the engine
107 // Replace a few nodes in the splay tree.
251 * @return {Array<*>} An array containing all the keys of tree's nodes.
280 // and right will always be nodes and we avoid special cases.
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
| v8-splay.js | 31 // JavaScript engine is at allocating nodes and reclaiming the memory
32 // used for old nodes. Because of the way splay trees work, the engine
107 // Replace a few nodes in the splay tree.
251 * @return {Array<*>} An array containing all the keys of tree's nodes.
280 // and right will always be nodes and we avoid special cases.
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
| v8-splay.js | 31 // JavaScript engine is at allocating nodes and reclaiming the memory
32 // used for old nodes. Because of the way splay trees work, the engine
108 // Replace a few nodes in the splay tree.
267 * @return {Array<*>} An array containing all the keys of tree's nodes.
296 // and right will always be nodes and we avoid special cases.
|
| /external/chromium_org/v8/benchmarks/ |
| splay.js | 31 // JavaScript engine is at allocating nodes and reclaiming the memory
32 // used for old nodes. Because of the way splay trees work, the engine
113 // Replace a few nodes in the splay tree.
272 * @return {Array<*>} An array containing all the keys of tree's nodes.
301 // and right will always be nodes and we avoid special cases.
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| transformer.py | 18 # Some fixes to try to have correct line number on almost all nodes
58 def asList(nodes):
60 for item in nodes:
84 if kind in nodes:
86 return nodes[kind](*args[1:])
88 print nodes[kind], len(args), args
275 assert isinstance(code.nodes[0], Discard)
276 del code.nodes[0]
311 assert isinstance(code.nodes[0], Discard)
312 del code.nodes[0
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| transformer.py | 18 # Some fixes to try to have correct line number on almost all nodes
58 def asList(nodes):
60 for item in nodes:
84 if kind in nodes:
86 return nodes[kind](*args[1:])
88 print nodes[kind], len(args), args
275 assert isinstance(code.nodes[0], Discard)
276 del code.nodes[0]
311 assert isinstance(code.nodes[0], Discard)
312 del code.nodes[0
[all...] |
| /frameworks/base/core/java/android/widget/ |
| RelativeLayout.java | 1638 final ArrayList<Node> nodes = mNodes; local
1717 final ArrayList<Node> nodes = mNodes; local
[all...] |
| /external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/ |
| gUnitExecutor.java | 500 // Walk resulting tree; create tree nodes stream first
501 CommonTreeNodeStream nodes; local
503 nodes = new CommonTreeNodeStream(customTreeAdaptor, tree);
506 nodes = new CommonTreeNodeStream(tree);
508 // AST nodes have payload that point into token stream
509 nodes.setTokenStream(tokens);
510 // Create a tree walker attached to the nodes stream
514 Object[] treeParArgs = new Object[]{nodes}; // assign value to tree parser's args
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| error.rb | 169 def extract_from_node_stream( nodes )
170 adaptor = nodes.adaptor
177 while prior_node = nodes.look( i )
494 the same as MismatchedToken, but used specifically for tree nodes.
573 3. An adaptor encountered a situation where multiple tree nodes have been
|
| /external/chromium_org/chrome/common/extensions/docs/examples/extensions/irc/servlet/jstemplate/ |
| jstemplate.js | 145 * suvives cloneNode() and thus cloned template nodes can share the
159 * The neutral cache entry. Used for all nodes that don't have any
160 * jst attributes. We still set the jsid attribute on those nodes so
177 * values. (For example when two different nodes in a template share the same
321 * - nodes are states
326 * - leaves are nodes which do not recurse.
435 * node, but doesn't create or destroy nodes, hence the name
478 * jstSelect_() for nodes that have a jsselect attribute so that the
862 * @return {Element|null} The DOM node of the template. (Only element nodes
891 * @return {Element} The DOM node of the template. (Only element nodes
[all...] |
| /external/chromium_org/third_party/jinja2/ |
| environment.py | 13 from jinja2 import nodes namespace
22 from jinja2.nodes import EvalContext
444 tree of nodes is used by the compiler to convert the template into
597 body = [nodes.Assign(nodes.Name('result', 'store'), expr, lineno=1)]
598 template = self.from_string(nodes.Template(body, lineno=1))
[all...] |
| /external/chromium_org/third_party/jstemplate/ |
| jstemplate.js | 131 * suvives cloneNode() and thus cloned template nodes can share the
145 * The neutral cache entry. Used for all nodes that don't have any
146 * jst attributes. We still set the jsid attribute on those nodes so
163 * values. (For example when two different nodes in a template share the same
303 * - nodes are states
308 * - leaves are nodes which do not recurse.
414 * node, but doesn't create or destroy nodes, hence the name
454 * jstSelect_() for nodes that have a jsselect attribute so that the
829 * @return {Element|null} The DOM node of the template. (Only element nodes
858 * @return {Element} The DOM node of the template. (Only element nodes
[all...] |
| /external/chromium_org/tools/idl_parser/ |
| idl_parser.py | 1045 nodes = self.yaccobj.parse(lexer=self.lexer) or []
1047 return IDLNode('File', filename, 0, 0, nodes + [name])
1071 nodes = []
1078 nodes.append(filenode)
1080 ast = IDLNode('AST', '__AST__', 0, 0, nodes)
|
| /build/tools/droiddoc/templates-pdk/assets/ |
| android-developer-docs.js | 536 var nodes = $("#header-tabs").find("."+lang);
537 for (i=0; i < nodes.length; i++) { // for each node in this language
538 var node = $(nodes[i]);
550 var nodes = $("#side-nav").find("."+lang);
551 for (i=0; i < nodes.length; i++) { // for each node in this language
552 var node = $(nodes[i]);
|
| /cts/tools/utils/ |
| DescriptionGenerator.java | 301 * Rebuild the document, merging empty suite nodes.
304 // merge empty suite nodes
345 * Get the unmuatable child nodes for specified node.
351 ArrayList<Node> nodes = new ArrayList<Node>(); local
355 nodes.add(nodelist.item(i));
358 return nodes;
363 * the existing suite nodes and do the real creation and append.
397 * Get the test suite child nodes of a specified element.
400 * @return The matched child nodes.
476 * Do the append, including creating test suite nodes and test case nodes, an
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| treewizard.py | 310 In order to create nodes and navigate, this class needs a TreeAdaptor.
313 iterating over the various nodes with a particular type.
370 """Walk the entire tree and make a node name to nodes mapping.
418 """Return a List of tree nodes with token type ttype"""
420 nodes = []
423 nodes.append(tree)
427 return nodes
466 all nodes of that type (this is faster than the pattern match).
524 on the various nodes and '.' (dot) as the node/subtree wildcard,
526 the labels pointing at the appropriate nodes. Return false i
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/tests/ |
| t051treeRewriteAST.py | 38 nodes = antlr3.tree.CommonTreeNodeStream(r.tree)
39 nodes.setTokenStream(tStream)
40 walker = walkerCls(nodes)
[all...] |
