| /external/libxml2/result/scripts/ |
| set4 | 2 Set contains 1 nodes:
|
| /external/libxml2/test/XInclude/docs/ |
| nodes.xml | 2 <!-- Simple test of including a set of nodes from an XML document -->
|
| nodes2.xml | 2 <!-- Simple test of including a set of nodes from an XML document -->
|
| nodes3.xml | 2 <!-- Simple test of including a set of nodes from an XML document -->
|
| /external/llvm/test/Verifier/ |
| SelfReferential.ll | 2 ; CHECK: Only PHI nodes may reference their own value
|
| token1.ll | 9 ; CHECK: PHI nodes cannot have token type!
|
| /external/selinux/libsepol/src/ |
| node_internal.h | 5 #include <sepol/nodes.h>
|
| /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/parser/ |
| Node.java | 5 /* All AST nodes must implement this interface. It provides basic
7 between nodes. */
12 node. It indicates that child nodes can now be added to it. */
15 /** This method is called after all the child nodes have been
|
| JJTAddressListParserState.java | 6 private java.util.Stack<Node> nodes; field in class:JJTAddressListParserState
9 private int sp; // number of nodes on stack
14 nodes = new java.util.Stack<Node>();
30 nodes.removeAllElements();
39 return nodes.elementAt(0);
44 nodes.push(n);
54 return nodes.pop();
59 return nodes.peek();
85 children. That number of nodes are popped from the stack and
102 the nodes that have been pushed since the node was opened ar
[all...] |
| /packages/services/Car/car_product/sepolicy/ |
| device.te | 4 #device type for gss device nodes, ie /dev/gss
|
| /packages/services/Telephony/src/org/apache/james/mime4j/field/address/parser/ |
| Node.java | 5 /* All AST nodes must implement this interface. It provides basic
7 between nodes. */
12 node. It indicates that child nodes can now be added to it. */
15 /** This method is called after all the child nodes have been
|
| JJTAddressListParserState.java | 6 private java.util.Stack<Node> nodes; field in class:JJTAddressListParserState
9 private int sp; // number of nodes on stack
14 nodes = new java.util.Stack<Node>();
30 nodes.removeAllElements();
39 return nodes.elementAt(0);
44 nodes.push(n);
54 return nodes.pop();
59 return nodes.peek();
85 children. That number of nodes are popped from the stack and
102 the nodes that have been pushed since the node was opened ar
[all...] |
| /external/libxml2/result/XPath/tests/ |
| mixedpat | 5 Set contains 1 nodes:
14 Set contains 2 nodes:
27 Set contains 2 nodes:
40 Set contains 2 nodes:
53 Set contains 3 nodes:
70 Set contains 4 nodes:
88 Set contains 4 nodes:
|
| chaptersbase | 5 Set contains 1 nodes:
17 Set contains 1 nodes:
29 Set contains 1 nodes:
35 Set contains 6 nodes:
61 Set contains 1 nodes:
67 Set contains 1 nodes:
74 Set contains 3 nodes:
84 Set contains 6 nodes:
95 Set contains 5 nodes:
120 Set contains 5 nodes
[all...] |
| simpleabbr | 5 Set contains 1 nodes:
17 Set contains 1 nodes:
23 Set contains 1 nodes:
29 Set contains 2 nodes:
36 Set contains 1 nodes:
45 Set contains 2 nodes:
54 Set contains 2 nodes:
63 Set contains 2 nodes:
72 Set contains 1 nodes:
79 Set contains 1 nodes
[all...] |
| langsimple | 5 Set contains 9 nodes:
37 Set contains 2 nodes:
50 Set contains 0 nodes:
55 Set contains 0 nodes:
60 Set contains 0 nodes:
|
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTopologicalSort.java | 53 List nodes = g.sort(); local
54 String result = nodes.toString();
67 List nodes = g.sort(); local
68 String result = nodes.toString();
81 List nodes = g.sort(); local
82 String result = nodes.toString();
95 List nodes = g.sort(); local
96 String result = nodes.toString();
109 List nodes = g.sort(); local
110 String result = nodes.toString()
[all...] |
| /external/opencv3/3rdparty/jinja2/ |
| meta.py | 12 from jinja2 import nodes
72 for node in ast.find_all((nodes.Extends, nodes.FromImport, nodes.Import,
73 nodes.Include)):
74 if not isinstance(node.template, nodes.Const):
76 if isinstance(node.template, (nodes.Tuple, nodes.List)):
80 if isinstance(template_name, nodes.Const):
96 elif isinstance(node, nodes.Include) and
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRStreamEnumerator.m | 52 nodes = n;
60 return i < [nodes count];
67 if (current < [nodes count])
69 return [nodes objectAtIndex:current];
76 @synthesize nodes;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/ |
| NodeTupleTest.java | 16 package org.yaml.snakeyaml.nodes;
28 assertEquals("Nodes must be provided.", e.getMessage());
38 assertEquals("Nodes must be provided.", e.getMessage());
47 "<NodeTuple keyNode=<org.yaml.snakeyaml.nodes.ScalarNode (tag=tag:yaml.org,2002:str, value=key1)>; valueNode=<org.yaml.snakeyaml.nodes.ScalarNode (tag=tag:yaml.org,2002:str, value=value1)>>",
|
| /external/v8/src/compiler/ |
| node-cache.h | 26 // A cache for nodes based on a key. Useful for implementing canonicalization of
27 // nodes such as constants, parameters, etc.
46 // Appends all nodes from this cache to {nodes}.
47 void GetCachedNodes(ZoneVector<Node*>* nodes);
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/ |
| patcomp.py | 101 nodes = node.children
102 if len(nodes) >= 3 and nodes[1].type == token.EQUAL:
103 name = nodes[0].value
104 nodes = nodes[2:]
106 if len(nodes) >= 2 and nodes[-1].type == self.syms.Repeater:
107 repeat = nodes[-1]
108 nodes = nodes[:-1
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/ |
| patcomp.py | 101 nodes = node.children
102 if len(nodes) >= 3 and nodes[1].type == token.EQUAL:
103 name = nodes[0].value
104 nodes = nodes[2:]
106 if len(nodes) >= 2 and nodes[-1].type == self.syms.Repeater:
107 repeat = nodes[-1]
108 nodes = nodes[:-1
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/ |
| patcomp.py | 101 nodes = node.children
102 if len(nodes) >= 3 and nodes[1].type == token.EQUAL:
103 name = nodes[0].value
104 nodes = nodes[2:]
106 if len(nodes) >= 2 and nodes[-1].type == self.syms.Repeater:
107 repeat = nodes[-1]
108 nodes = nodes[:-1
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
| patcomp.py | 101 nodes = node.children
102 if len(nodes) >= 3 and nodes[1].type == token.EQUAL:
103 name = nodes[0].value
104 nodes = nodes[2:]
106 if len(nodes) >= 2 and nodes[-1].type == self.syms.Repeater:
107 repeat = nodes[-1]
108 nodes = nodes[:-1
[all...] |
