| /developers/build/prebuilts/gradle/DataLayer/Application/src/main/java/com/example/android/wearable/datalayer/ |
| MainActivity.java | 272 // Trigger an AsyncTask that will query for a list of connected nodes and send a
348 NodeApi.GetConnectedNodesResult nodes = local
351 for (Node node : nodes.getNodes()) {
420 Collection<String> nodes = getNodes(); local
421 for (String node : nodes) {
|
| /developers/samples/android/wearable/wear/DataLayer/Application/src/main/java/com/example/android/wearable/datalayer/ |
| MainActivity.java | 272 // Trigger an AsyncTask that will query for a list of connected nodes and send a
348 NodeApi.GetConnectedNodesResult nodes = local
351 for (Node node : nodes.getNodes()) {
420 Collection<String> nodes = getNodes(); local
421 for (String node : nodes) {
|
| /development/samples/browseable/DataLayer/Application/src/com.example.android.wearable.datalayer/ |
| MainActivity.java | 272 // Trigger an AsyncTask that will query for a list of connected nodes and send a
348 NodeApi.GetConnectedNodesResult nodes = local
351 for (Node node : nodes.getNodes()) {
420 Collection<String> nodes = getNodes(); local
421 for (String node : nodes) {
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3commontreenodestream.h | 68 /// i<0 indicates nodes in the past. So LT(-1) is previous node, but
80 /// Where is this stream pulling nodes from? This is not the name, but
85 /// What adaptor can tell me how to interpret/navigate nodes and
90 /// As we flatten the tree, we use UP, DOWN nodes to represent
91 /// the tree structure. When debugging we need unique nodes
94 /// navigation nodes. Default should be false;
100 /// Return the text of all nodes from start to stop, inclusive.
101 /// If the stream does not buffer all the nodes then it can still
108 /// Return the text of all nodes from start to stop, inclusive, into the
110 /// If the stream does not buffer all the nodes then it can stil
194 pANTLR3_VECTOR nodes; member in struct:ANTLR3_COMMON_TREE_NODE_STREAM_struct
[all...] |
| /external/opencv3/modules/ml/src/ |
| boost.cpp | 147 // traverse the tree and save all the nodes in depth-first order
152 node = &nodes[nidx];
159 for( pidx = node->parent; pidx >= 0 && nodes[pidx].right == nidx;
160 nidx = pidx, pidx = nodes[pidx].parent )
166 nidx = nodes[pidx].right;
438 FileNode nfn = (*it)["nodes"];
|
| tree.cpp | 128 nodes.clear();
263 int root = (int)nodes.size();
301 int nidx = (int)nodes.size();
302 nodes.push_back(node);
308 nodes[pidx].left = nidx;
313 nodes[pidx].right = nidx;
331 pidx = nodes[pidx].parent;
[all...] |
| /external/snakeyaml/src/test/java/examples/staticstate/ |
| StaticFieldsWrapperTest.java | 23 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/constructor/ |
| ClassTagsTest.java | 27 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue149/ |
| GlobalDirectivesTest.java | 26 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue306/ |
| UuidSupportTest.java | 22 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue67/ |
| NonAsciiCharsInClassNameTest.java | 22 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/representer/ |
| RepresenterTest.java | 22 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/v8/src/compiler/ |
| state-values-utils.h | 33 // ValueArray - array of nodes ({node} has to be nullptr).
50 Node* GetValuesNodeFromCache(Node** nodes, size_t count);
|
| /hardware/bsp/intel/peripheral/libmraa/src/ |
| doxy2swig.py | 108 nodes.
164 nodes = [(x.tagName, x) for x in node.childNodes
167 return dict(nodes)
179 pads before and after the nodes are processed. Defaults to
226 nodes = node.getElementsByTagName('sectiondef')
227 for n in nodes:
|
| /hardware/bsp/intel/peripheral/libupm/src/ |
| doxy2swig.py | 108 nodes.
164 nodes = [(x.tagName, x) for x in node.childNodes
167 return dict(nodes)
179 pads before and after the nodes are processed. Defaults to
226 nodes = node.getElementsByTagName('sectiondef')
227 for n in nodes:
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gre/ |
| NodeProxy.java | 79 * @param factory A {@link NodeFactory} to create unique children nodes.
202 List<INode> nodes = new ArrayList<INode>(uiChildren.size()); local
205 nodes.add(mFactory.create((UiViewElementNode) uiChild));
209 return nodes.toArray(new INode[nodes.size()]);
497 * If there are any pending changes in these nodes, apply them now
|
| /external/v8/test/cctest/compiler/ |
| test-node.cc | 81 // Check the use nodes actually have the node as inputs.
753 Node* nodes[] = { local
758 int max = static_cast<int>(arraysize(nodes));
763 last->AppendInput(graph.zone(), nodes[i]);
764 CheckInputs(last, nodes, i + 1);
767 if (j <= i) CHECK_USES(nodes[j], last);
768 if (j > i) CHECK_USES(nodes[j], NONE);
776 CheckInputs(last, nodes, i);
779 if (j < i) CHECK_USES(nodes[j], last);
780 if (j >= i) CHECK_USES(nodes[j], NONE)
[all...] |
| test-loop-analysis.cc | 923 Node** nodes = t.zone()->NewArray<Node*>(count * 4); local
938 nodes[i * 4 + 0] = loop;
939 nodes[i * 4 + 1] = phi;
940 nodes[i * 4 + 2] = branch;
941 nodes[i * 4 + 3] = if_true;
951 t.CheckLoop(nodes + i * 4, 2, nodes + i * 4 + 2, 2);
958 Node** nodes = t.zone()->NewArray<Node*>(count * 5); local
973 nodes[i * 5 + 0] = exit; // outside
974 nodes[i * 5 + 1] = loop; // heade
[all...] |
| /prebuilts/eclipse/mavenplugins/tycho/tycho-dependencies-m2repo/de/pdark/decentxml/1.3/ |
| decentxml-1.3.jar | |
| /prebuilts/python/darwin-x86/2.7.5/share/pretty-printers/libstdcxx/gcc-4.7/ |
| printers.py | 263 nodes = self.head.type.fields ()
264 if len (nodes) == 1:
266 self.head = self.head.cast (nodes[0].type)
267 elif len (nodes) != 0:
275 nodes = self.head.type.fields ()
277 if len (nodes) == 0:
280 if len (nodes) != 2:
281 raise ValueError, "Cannot parse more than 2 nodes in a tuple tree."
287 impl = self.head.cast (nodes[1].type)
290 self.head = self.head.cast (nodes[0].type
[all...] |
| /prebuilts/python/linux-x86/2.7.5/share/pretty-printers/libstdcxx/gcc-4.7/ |
| printers.py | 263 nodes = self.head.type.fields ()
264 if len (nodes) == 1:
266 self.head = self.head.cast (nodes[0].type)
267 elif len (nodes) != 0:
275 nodes = self.head.type.fields ()
277 if len (nodes) == 0:
280 if len (nodes) != 2:
281 raise ValueError, "Cannot parse more than 2 nodes in a tuple tree."
287 impl = self.head.cast (nodes[1].type)
290 self.head = self.head.cast (nodes[0].type
[all...] |
| /prebuilts/tools/common/m2/repository/de/pdark/decentxml/1.3/ |
| decentxml-1.3.jar | |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
| RFC3280CertPathUtilities.java | 1052 List nodes = policyNodes[k]; local
1441 List nodes = policyNodes[j]; local
1467 List nodes = policyNodes[i]; local
2514 List nodes = policyNodes[j]; local
2594 List nodes = policyNodes[j]; local
[all...] |
| /external/libxml2/ |
| c14n.c | 45 int nsCurEnd; /* number of nodes in the set */
50 xmlNodePtr *nodeTab; /* array of nodes in no particular order */
92 static int xmlC14NIsNodeInNodeset (xmlNodeSetPtr nodes,
255 xmlC14NIsNodeInNodeset(xmlNodeSetPtr nodes, xmlNodePtr node, xmlNodePtr parent) {
256 if((nodes != NULL) && (node != NULL)) {
258 return(xmlXPathNodeSetContains(nodes, node));
275 return(xmlXPathNodeSetContains(nodes, (xmlNodePtr)&ns));
573 * Consider a list L containing only namespace nodes in the
580 * namespace node in the node-set (default namespace nodes always
592 * ancestor nodes of each orphan element node for attributes in the xm
[all...] |
| /external/selinux/libsepol/cil/src/ |
| cil_resolve_ast.c | 391 result_node = result_datum->nodes->head->data;
419 attr_node = attr_datum->nodes->head->data;
504 a1_node = a1->datum.nodes->head->data;
508 a1_node = a1->datum.nodes->head->data;
546 type_node = type_datum->nodes->head->data;
608 result_node = result_datum->nodes->head->data;
807 user_node = user_datum->nodes->head->data;
860 user_node = user_datum->nodes->head->data;
911 user_node = user_datum->nodes->head->data;
938 user_node = user_datum->nodes->head->data
[all...] |
