| /hardware/ti/omap3/omx/ti_omx_config_parser/ |
| Android.mk | 23 $(PV_TOP)/nodes/pvmediaoutputnode/include \
24 $(PV_TOP)/nodes/pvdownloadmanagernode/config/opencore \
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| test_object_graph.py | 212 nodes = graph.nodes()
214 self.assertTrue(hasattr(nodes, 'next'))
216 self.assertTrue(hasattr(nodes, '__next__'))
217 self.assertTrue(hasattr(nodes, '__iter__'))
219 nodes = list(nodes)
220 self.assertEqual(len(nodes), 6)
221 self.assertTrue(n1 in nodes)
222 self.assertTrue(n2 in nodes)
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| ast.py | 129 tedious to fill in for generated nodes, so this helper adds these attributes
175 Yield all direct child nodes of *node*, that is, all fields that are nodes
176 and all items of fields that are lists of nodes.
205 Recursively yield all descendant nodes in the tree starting at *node*
207 only want to modify nodes in place and don't care about the context.
226 Per default the visitor functions for the nodes are ``'visit_'`` +
232 Don't use the `NodeVisitor` if you want to apply changes to nodes during
257 allows modification of nodes.
277 Keep in mind that if the node you're operating on has child nodes you mus
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| ast.py | 129 tedious to fill in for generated nodes, so this helper adds these attributes
175 Yield all direct child nodes of *node*, that is, all fields that are nodes
176 and all items of fields that are lists of nodes.
205 Recursively yield all descendant nodes in the tree starting at *node*
207 only want to modify nodes in place and don't care about the context.
226 Per default the visitor functions for the nodes are ``'visit_'`` +
232 Don't use the `NodeVisitor` if you want to apply changes to nodes during
257 allows modification of nodes.
277 Keep in mind that if the node you're operating on has child nodes you mus
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| ast.py | 129 tedious to fill in for generated nodes, so this helper adds these attributes
175 Yield all direct child nodes of *node*, that is, all fields that are nodes
176 and all items of fields that are lists of nodes.
205 Recursively yield all descendant nodes in the tree starting at *node*
207 only want to modify nodes in place and don't care about the context.
226 Per default the visitor functions for the nodes are ``'visit_'`` +
232 Don't use the `NodeVisitor` if you want to apply changes to nodes during
257 allows modification of nodes.
277 Keep in mind that if the node you're operating on has child nodes you mus
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| ast.py | 129 tedious to fill in for generated nodes, so this helper adds these attributes
175 Yield all direct child nodes of *node*, that is, all fields that are nodes
176 and all items of fields that are lists of nodes.
205 Recursively yield all descendant nodes in the tree starting at *node*
207 only want to modify nodes in place and don't care about the context.
226 Per default the visitor functions for the nodes are ``'visit_'`` +
232 Don't use the `NodeVisitor` if you want to apply changes to nodes during
257 allows modification of nodes.
277 Keep in mind that if the node you're operating on has child nodes you mus
[all...] |
| /cts/tests/core/runner/src/com/android/cts/core/runner/ |
| TestFilter.java | 60 * <p>It cannot filter out the non-leaf nodes in the hierarchy, i.e. {@link Suite} and
62 * the leaf nodes.
77 // Only filter leaf nodes. The description is for a test if and only if it is a leaf node.
78 // Non-leaf nodes must not be filtered out as that would prevent leaf nodes from being
|
| /external/libxml2/os400/libxmlrpg/ |
| c14n.rpgle | 34 * a) default attributes (if any) are added to all nodes
64 d nodes value like(xmlNodeSetPtr)
74 d nodes value like(xmlNodeSetPtr)
83 d nodes value like(xmlNodeSetPtr)
98 * Signature for a C14N callback on visible nodes
|
| /prebuilts/go/darwin-x86/test/bench/shootout/ |
| binary-tree-freelist.go | 70 nodes := make([]Node, 3<<uint(*n))
71 for i := 0; i < len(nodes)-1; i++ {
72 nodes[i].left = &nodes[i+1]
74 a.head = &nodes[0]
|
| /prebuilts/go/linux-x86/test/bench/shootout/ |
| binary-tree-freelist.go | 70 nodes := make([]Node, 3<<uint(*n))
71 for i := 0; i < len(nodes)-1; i++ {
72 nodes[i].left = &nodes[i+1]
74 a.head = &nodes[0]
|
| /external/autotest/client/cros/audio/ |
| cras_dbus_utils.py | 187 same. This happens when there is change in unplugged nodes,
205 logging.debug('nodes = %s', pprint.pformat(self._nodes))
230 logging.debug('Getting nodes.')
231 nodes = cras_utils.get_cras_nodes()
232 logging.debug('nodes = %s', pprint.pformat(nodes))
233 if self._ignore_redundant and self._nodes == nodes:
234 logging.debug('Nodes did not change. Ignore redundant signal')
277 """Error for unexpected nodes changed."""
282 """Waits for unexpected nodes changed signal in this blocking call
[all...] |
| /external/libgdx/extensions/gdx-bullet/src/com/badlogic/gdx/physics/bullet/ |
| Bullet.java | 121 public static <T extends Node> void getShapeParts (final Iterable<T> nodes, final Array<ShapePart> out, final int offset,
123 for (T node : nodes)
135 /** Obtain a {@link btCollisionShape} based on the specified nodes, which can be used for a static body but not for a dynamic
136 * body. Depending on the specified nodes the result will be either a {@link btBvhTriangleMeshShape} or a
138 * if multiple nodes use the same (mesh) part. The node transformation (translation and rotation) will be included, but scaling
140 * @param nodes The nodes for which to obtain a node, typically this would be: `model.nodes`.
142 public static btCollisionShape obtainStaticNodeShape (final Array<Node> nodes) {
143 getShapeParts(nodes, shapePartArray, 0, shapePartPool);
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib-dynload/ |
| parser.so | |
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| StringTrieBuilder.java | 91 // In either case we need to fix-up linear-match nodes (for their maximum length)
92 // and branch nodes (turning dynamic branch nodes into trees of
93 // runtime-equivalent nodes), but the HashMap/hashCode()/equals() are omitted for
94 // nodes other than final values.
109 // Then we call root.register() to turn it into a tree of nodes
125 nodes.clear();
142 Node oldNode=nodes.get(newNode);
148 oldNode=nodes.put(newNode, newNode);
164 Node oldNode=nodes.get(lookupFinalValueNode)
887 private HashMap<Node, Node> nodes=new HashMap<Node, Node>(); field in class:StringTrieBuilder
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| StringTrieBuilder.java | 93 // In either case we need to fix-up linear-match nodes (for their maximum length)
94 // and branch nodes (turning dynamic branch nodes into trees of
95 // runtime-equivalent nodes), but the HashMap/hashCode()/equals() are omitted for
96 // nodes other than final values.
111 // Then we call root.register() to turn it into a tree of nodes
127 nodes.clear();
144 Node oldNode=nodes.get(newNode);
150 oldNode=nodes.put(newNode, newNode);
166 Node oldNode=nodes.get(lookupFinalValueNode)
889 private HashMap<Node, Node> nodes=new HashMap<Node, Node>(); field in class:StringTrieBuilder
[all...] |
| /libcore/support/src/test/java/tests/resources/x509/ |
| create.sh | 25 openssl req -config "$DIR/default.cnf" -new -key "$DIR/privkey.pem" -nodes -batch > /tmp/cert-rsa-req.pem
40 openssl req -config "$DIR/default.cnf" -new -key "$DIR/privkey.pem" -nodes -batch | openssl x509 -extfile "$DIR/default.cnf" -extensions keyUsage_extraLong_cert -req -signkey "$DIR/privkey.pem" -outform d > "$DIR/cert-keyUsage-extraLong.der"
42 openssl req -config "$DIR/default.cnf" -new -key "$DIR/privkey.pem" -nodes -batch | openssl x509 -extfile "$DIR/default.cnf" -extensions extendedKeyUsage_cert -req -signkey "$DIR/privkey.pem" -outform d > "$DIR/cert-extendedKeyUsage.der"
44 openssl req -config "$DIR/default.cnf" -new -key "$DIR/privkey.pem" -nodes -batch | openssl x509 -extfile "$DIR/default.cnf" -extensions ca_cert -req -signkey "$DIR/privkey.pem" -outform d > "$DIR/cert-ca.der"
46 openssl req -config "$DIR/default.cnf" -new -key "$DIR/privkey.pem" -nodes -batch | openssl x509 -extfile "$DIR/default.cnf" -extensions userWithPathLen_cert -req -signkey "$DIR/privkey.pem" -outform d > "$DIR/cert-userWithPathLen.der"
48 openssl req -config "$DIR/default.cnf" -new -key "$DIR/privkey.pem" -nodes -batch | openssl x509 -extfile "$DIR/default.cnf" -extensions caWithPathLen_cert -req -signkey "$DIR/privkey.pem" -outform d > "$DIR/cert-caWithPathLen.der"
50 openssl req -config "$DIR/default.cnf" -new -key "$DIR/privkey.pem" -nodes -batch | openssl x509 -extfile "$DIR/default.cnf" -extensions alt_other_cert -req -signkey "$DIR/privkey.pem" -outform d > "$DIR/cert-alt-other.der"
52 openssl req -config "$DIR/default.cnf" -new -key "$DIR/privkey.pem" -nodes -batch | openssl x509 -extfile "$DIR/default.cnf" -extensions alt_email_cert -req -signkey "$DIR/privkey.pem" -outform d > "$DIR/cert-alt-email.der"
54 openssl req -config "$DIR/default.cnf" -new -key "$DIR/privkey.pem" -nodes -batch | openssl x509 -extfile "$DIR/default.cnf" -extensions alt_dns_cert -req -signkey "$DIR/privkey.pem" -outform d > "$DIR/cert-alt-dns.der"
56 openssl req -config "$DIR/default.cnf" -new -key "$DIR/privkey.pem" -nodes -batch | openssl x509 -extfile "$DIR/default.cnf" -extensions alt_dirname_cert -req -signkey "$DIR (…)
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeParser.java | 35 /** A parser for a stream of tree nodes. "tree grammars" result in a subclass
126 /** We have DOWN/UP nodes in the stream that have no line info; override.
147 /** Tree parsers parse nodes they usually have a token object as
163 * of nodes towards root of tree. For example, you might say context
166 * You can use "..." to mean zero-or-more nodes. "METHOD ... VARDEF"
194 String[] nodes = context.split("\\s+"); local
195 int ni = nodes.length-1;
198 if ( nodes[ni].equals("...") ) {
199 // walk upwards until we see nodes[ni-1] then continue walking
201 String goal = nodes[ni-1]
[all...] |
| /prebuilts/go/darwin-x86/src/go/ast/ |
| commentmap.go | 56 // nodeList returns the list of nodes of the AST n in source order.
100 // A nodeStack keeps track of nested nodes.
101 // A node lower on the stack lexically contains the nodes higher on the stack.
105 // push pops all nodes that appear lexically before n
113 // pop pops all nodes that appear lexically before pos
128 // of the comments list with the nodes of the AST specified by node.
158 nodes := nodeList(node)
159 nodes = append(nodes, nil) // append sentinel
165 pg Node // previous node group (enclosing nodes of "importance"
[all...] |
| /prebuilts/go/linux-x86/src/go/ast/ |
| commentmap.go | 56 // nodeList returns the list of nodes of the AST n in source order.
100 // A nodeStack keeps track of nested nodes.
101 // A node lower on the stack lexically contains the nodes higher on the stack.
105 // push pops all nodes that appear lexically before n
113 // pop pops all nodes that appear lexically before pos
128 // of the comments list with the nodes of the AST specified by node.
158 nodes := nodeList(node)
159 nodes = append(nodes, nil) // append sentinel
165 pg Node // previous node group (enclosing nodes of "importance"
[all...] |
| /external/boringssl/src/crypto/x509v3/ |
| pcy_tree.c | 119 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++)
121 node = sk_X509_POLICY_NODE_value(plev->nodes, i);
321 /* Iterate through all in nodes linking matches */
322 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++)
324 node = sk_X509_POLICY_NODE_value(last->nodes, i);
367 /* Look for matching nodes in previous level */
431 /* Locate unmatched nodes */
456 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++)
458 node = sk_X509_POLICY_NODE_value(last->nodes, i);
466 * nodes
[all...] |
| /frameworks/base/docs/html/training/wearables/data-layer/ |
| messages.jd | 37 nodes receive the messages. For example, in a voice transcription app that receives voice data on
44 connected nodes feature into consideration. If you don?t implement the changes, your messages may
56 <p>The following sections show you how to advertise device nodes that can process activity
57 requests, discover the nodes capable of fulfilling a requested need, and send messages to those
58 nodes.
96 <h3 id="RetrieveCapabilities">Retrieve the nodes with the required capabilities</h3>
98 <p>Initially, you can detect the capable nodes by calling the <a
101 The following example shows how to manually retrieve the results of reachable nodes with the
122 <p>To detect capable nodes as they connect to the wearable device, register a <a
125 The following example shows how to register the listener and retrieve the results of reachable nodes
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| CountersTable.java | 91 * Add a list of counted nodes that were built in backwards document
92 * order, or a list of counted nodes that are in forwards document
95 * @param flist Vector of nodes built in forwards document order
96 * @param blist Vector of nodes built in backwards document order
150 // In the loop below, we collect the nodes in backwards doc order, so
151 // we don't have to do inserts, but then we store the nodes in forwards
152 // document order, so we don't have to insert nodes into that list,
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/ |
| jsonresponse.py | 31 self.nodes = [('root', root_node)]
36 t = self.nodes[-1][1].startElement(name, attrs, self.connection)
39 self.nodes.append(t)
41 self.nodes.append((name, t))
44 self.nodes[-1][1].endElement(name, self.current_text, self.connection)
45 if self.nodes[-1][0] == name:
46 self.nodes.pop()
|
| /external/skia/src/core/ |
| SkRTree.cpp | 62 // This function parallels bulkLoad, but just counts how many nodes bulkLoad would allocate.
80 int nodes = 0; local
93 nodes++;
100 return nodes + CountNodes(nodes, aspectRatio);
117 // If the remainder isn't enough to fill a node, we'll add fewer nodes to other branches.
134 // if need be, omit some nodes to make up for remainder
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/representer/ |
| BaseRepresenter.java | 28 import org.yaml.snakeyaml.nodes.AnchorNode;
29 import org.yaml.snakeyaml.nodes.MappingNode;
30 import org.yaml.snakeyaml.nodes.Node;
31 import org.yaml.snakeyaml.nodes.NodeTuple;
32 import org.yaml.snakeyaml.nodes.ScalarNode;
33 import org.yaml.snakeyaml.nodes.SequenceNode;
34 import org.yaml.snakeyaml.nodes.Tag;
|
