| /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/testng/src/main/java/org/testng/internal/ |
| Yaml.java | 10 import org.yaml.snakeyaml.nodes.Node;
11 import org.yaml.snakeyaml.nodes.NodeId;
12 import org.yaml.snakeyaml.nodes.ScalarNode;
|
| /external/testng/src/main/java/org/testng/xml/dom/ |
| XDom.java | 53 NodeList nodes = m_document.getChildNodes(); local
54 for (int i = 0; i < nodes.getLength(); i++) {
55 Node item = nodes.item(i);
|
| /external/v8/test/cctest/compiler/ |
| graph-builder-tester.h | 221 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; local
222 return MakeNode(op, arraysize(nodes), nodes);
|
| /build/kati/ |
| dep.cc | 303 void Build(vector<Symbol> targets, vector<DepNode*>* nodes) {
336 nodes->push_back(n);
658 vector<DepNode*>* nodes) {
661 db.Build(targets, nodes);
|
| /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-trace/catapult/third_party/html5lib-python/html5lib/treewalkers/ |
| etree.py | 27 to avoid using recursion, returns "nodes" as tuples with the following
|
| /external/chromium-trace/catapult/third_party/vinn/third_party/parse5/test/ |
| test_utils.js | 162 function serializeNodeList(nodes, indent) {
165 nodes.forEach(function (node) {
|
| /external/libgdx/gdx/src/com/badlogic/gdx/graphics/g3d/utils/ |
| ModelBuilder.java | 96 model.nodes.add(node);
107 node.id = "node" + model.nodes.size;
111 /** Adds the nodes of the specified model to a new node of the model being build. After this method the given model can no
113 * @return The newly created node containing the nodes of the given model. */
117 node.addChildren(model.nodes);
360 * it's nodes. This will make the model responsible for disposing all referenced meshes. */
365 for (final Node node : model.nodes)
|
| /external/libgdx/tests/gdx-tests/src/com/badlogic/gdx/tests/g3d/ |
| LightsTest.java | 52 lightModel.nodes.get(0).parts.get(0).setRenderable(pLight = new Renderable());
|
| /external/pdfium/xfa/src/fxfa/src/parser/ |
| xfa_script_imp.h | 44 virtual void AddNodesOfRunScript(const CXFA_NodeArray& nodes);
|
| /external/selinux/libsepol/cil/src/ |
| cil_post.c | 68 struct cil_tree_node *n = d->nodes->head->data;
344 if (class->datum.nodes->head->data == node) {
345 // Multiple nodes can point to the same datum. Only count once.
352 if (type->datum.nodes->head->data == node) {
353 // Multiple nodes can point to the same datum. Only count once.
362 if (attr->datum.nodes->head->data == node) {
363 // Multiple nodes can point to the same datum. Only count once.
371 if (role->datum.nodes->head->data == node) {
372 // Multiple nodes can point to the same datum. Only count once.
380 if (user->datum.nodes->head->data == node)
[all...] |
| /external/selinux/sepolgen/src/sepolgen/ |
| output.py | 174 for node in module.nodes():
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
| Tag.java | 16 package org.yaml.snakeyaml.nodes;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/constructor/ |
| TypeSafeCollectionsTest.java | 28 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/ruby/ |
| RubyTest.java | 25 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/v8/src/compiler/ |
| js-graph.h | 121 // Create a control node that serves as dependency for dead nodes.
133 void GetCachedNodes(NodeVector* nodes);
|
| /prebuilts/gdb/darwin-x86/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/gdb/linux-x86/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/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
|
