| /prebuilts/python/darwin-x86/2.7.5/share/pretty-printers/libstdcxx/gcc-4.8/ |
| printers.py | 274 nodes = self.head.type.fields ()
275 if len (nodes) == 1:
277 self.head = self.head.cast (nodes[0].type)
278 elif len (nodes) != 0:
286 nodes = self.head.type.fields ()
288 if len (nodes) == 0:
291 if len (nodes) != 2:
292 raise ValueError, "Cannot parse more than 2 nodes in a tuple tree."
298 impl = self.head.cast (nodes[1].type)
301 self.head = self.head.cast (nodes[0].type
[all...] |
| /prebuilts/python/linux-x86/2.7.5/share/pretty-printers/libstdcxx/gcc-4.8/ |
| printers.py | 274 nodes = self.head.type.fields ()
275 if len (nodes) == 1:
277 self.head = self.head.cast (nodes[0].type)
278 elif len (nodes) != 0:
286 nodes = self.head.type.fields ()
288 if len (nodes) == 0:
291 if len (nodes) != 2:
292 raise ValueError, "Cannot parse more than 2 nodes in a tuple tree."
298 impl = self.head.cast (nodes[1].type)
301 self.head = self.head.cast (nodes[0].type
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/tests/ |
| t053hetero.py | 87 nodes = antlr3.tree.CommonTreeNodeStream(r.tree)
88 nodes.setTokenStream(tStream)
89 walker = walkerCls(nodes)
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
| description_util.js | 91 * ancestor nodes. The ancestors are in order from the highest in the
94 * @param {Array.<Node>} ancestorsArray An array of ancestor nodes.
177 * ancestor nodes. The ancestors are in order from the highest in the
231 * that iterate over non-leaf nodes need this sort of description.
261 // nodes inside the current smart node and return their annotations.
302 * Returns the full descriptions of the child nodes that would be gotten by an
|
| /external/chromium_org/components/bookmarks/browser/ |
| bookmark_index_unittest.cc | 37 const NodeSet& nodes,
39 for (NodeSet::const_iterator it = nodes.begin(); it != nodes.end(); ++it) {
440 // Populate match nodes.
|
| /external/chromium_org/tools/binary_size/template/ |
| D3SymbolTreeMap.js | 176 this._currentNodes = this._layout.nodes(this._currentRoot);
216 // without breaking the data-to-ID bindings. New nodes get new IDs.
253 this._currentNodes = this._layout.nodes(this._currentRoot);
262 this._currentNodes = this._layout.nodes(this._currentRoot);
270 this._currentNodes = this._layout.nodes(this._currentRoot);
310 // Ignore nodes that don't match the filter, when present.
319 // Accept leaf nodes that passed the filter
347 totalAccepted + ' nodes retained (' +
350 this.__cloneState.rejected + ' nodes (and their children) ' +
352 this.__cloneState.pruned + ' nodes pruned because because no '
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| dottreegen.py | 59 " $nodes$\n" +
111 treeST.setAttribute("nodes", parentNodeST)
121 treeST.setAttribute("nodes", nodeST)
|
| /external/chromium_org/cc/resources/ |
| task_graph_runner.h | 80 Node::Vector nodes; member in struct:cc::TaskGraph
|
| task_graph_runner_unittest.cc | 90 new_graph.nodes.push_back(
96 new_graph.nodes.push_back(
|
| /external/chromium_org/cc/test/ |
| pixel_test.cc | 157 graph.nodes.push_back(
|
| /external/chromium_org/chrome/browser/sync/glue/ |
| bookmark_change_processor.h | 143 // Update transaction version of |model| and |nodes| to |new_version| if
148 const std::vector<const BookmarkNode*>& nodes);
195 // Remove all sync nodes, except the permanent nodes.
203 // Remove all the sync nodes associated with |node| and its children.
|
| /external/chromium_org/components/autofill/content/renderer/ |
| autofill_agent.h | 95 const blink::WebVector<blink::WebNode>& nodes);
|
| /external/chromium_org/content/browser/accessibility/ |
| browser_accessibility_manager.h | 223 // Update a set of nodes using data received from the renderer
225 bool UpdateNodes(const std::vector<ui::AXNodeData>& nodes);
|
| /external/chromium_org/net/disk_cache/blockfile/ |
| rankings.h | 101 CacheRankingsBlock* nodes[3]; // Nodes on the first three lists. member in struct:disk_cache::Rankings::Iterator
131 // Controls tracking of nodes used for enumerations.
173 // Checks the links between two consecutive nodes.
180 // Walks a list in the desired direction until the nodes |end1| or |end2| are
182 // and the addresses of the last nodes visited.
|
| /external/chromium_org/third_party/WebKit/Source/core/svg/ |
| SVGSVGElement.cpp | 381 WillBeHeapVector<RefPtrWillBeMember<Node> > nodes; local
390 return StaticNodeList::adopt(nodes);
397 nodes.append(element);
400 return StaticNodeList::adopt(nodes);
|
| /external/chromium_org/ui/gfx/geometry/ |
| r_tree_base.h | 8 // internal objects of an RTree, namely Nodes (internal nodes of the tree) and
32 typedef ScopedVector<NodeBase> Nodes;
37 // Protected data structure class for storing internal Nodes or leaves with
56 // Returns -1 for Records, or the height of this subtree for Nodes. The
63 // recursively on our parent so that ultimately all nodes up to the root
124 // this Node as its sole child. Valid to call only on root Nodes, meaning
125 // Nodes with |parent_| NULL. Note that ownership of this Node is
130 // the supplied list. Does not repair bounds upon completion. Nodes are
136 // nodes that have exceeded the maximum number of children during an Insert
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/ |
| btm_matcher.py | 5 leaves to the root of the AST and returns a set of nodes for further
6 matching. This reduces significantly the number of candidate nodes."""
33 self.nodes = [self.root]
86 automaton. Nodes are only checked once as the tree is
91 recheck the nodes
|
| fixer_util.py | 384 nodes = [node]
385 while nodes:
386 node = nodes.pop()
388 nodes.extend(node.children)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
| btm_matcher.py | 5 leaves to the root of the AST and returns a set of nodes for further
6 matching. This reduces significantly the number of candidate nodes."""
33 self.nodes = [self.root]
86 automaton. Nodes are only checked once as the tree is
91 recheck the nodes
|
| fixer_util.py | 384 nodes = [node]
385 while nodes:
386 node = nodes.pop()
388 nodes.extend(node.children)
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| MoveGesture.java | 385 // Make sure we aren't removing the same nodes that are being added
417 final List<INode> nodes = new ArrayList<INode>(); local
423 nodes.add(node);
428 // Select the newly dropped nodes:
429 // Find out which nodes were added, and look up their corresponding
432 // Don't use the indices to search for corresponding nodes yet, since a
435 if (!selectionManager.selectDropped(nodes, null /* indices */)) {
444 selectionManager.selectDropped(nodes, indices);
638 // We can't switch views/nodes when the mouse is captured
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| NodeSetDTM.java | 41 * nextNode() is called, in order that nodes can be added
92 // * @param nodelist List of Nodes to be made members of the new set.
106 * @param nodelist Set of Nodes to be made members of the new set.
122 * @param ni Iterator which yields Nodes to be made members of the new set.
138 * @param iterator Iterator which yields Nodes to be made members of the new set.
172 // Do not reorder or strip duplicate nodes from the given DOM nodelist
292 * hardcoded to show all nodes except EntityReference nodes, which have
306 * The filter object used to screen nodes. Filters are applied to
316 * not going to return all nodes selected by whatToShow
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/extensions/searchvox/ |
| search.js | 296 var nodes = document.querySelectorAll(selector);
297 for (var i = 0; i < nodes.length; i++) {
298 var node = nodes.item(i);
301 cvox.Search.results.push(nodes.item(i));
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/host/interface/ |
| mathjax_interface.js | 28 * Get MathML for all MathJax nodes that already exist by applying the callback
|
| /external/chromium_org/sync/internal_api/ |
| sync_rollback_manager_base.cc | 237 scoped_ptr<base::ListValue> nodes(
240 return nodes.Pass();
|
