| /development/samples/browseable/DataLayer/Wearable/res/values/ |
| strings.xml | 23 <string name="connected_nodes">Nodes: %1$s</string>
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/ |
| ITreeNodeStreamFixture.cs | 73 /// Test a tree with four nodes - ^(101 ^(102 103) 104)
196 // stream has 7 real + 6 nav nodes
233 // stream has 7 real + 6 nav nodes
280 // stream has 7 real + 6 nav nodes
321 // stream has 7 real + 6 nav nodes
349 // stream has 7 real + 6 nav nodes
374 // stream has 9 real + 8 nav nodes
421 // stream has 9 real + 8 nav nodes
480 // stream has 9 real + 8 nav nodes
592 /// Use Consume() to advance N nodes into lookahead. Then use LT(
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeWizard.java | 42 * In order to create nodes and navigate, this class needs a TreeAdaptor.
45 * iterating over the various nodes with a particular type.
107 * nodes such as function definition nodes (you'll want to seek
109 * dynamic searches; i.e., go find me all PLUS nodes.
167 /** Walk the entire tree and make a node name to nodes mapping.
199 /** Return a List of tree nodes with token type ttype */
201 final List nodes = new ArrayList(); local
204 nodes.add(t);
207 return nodes;
[all...] |
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| CommonTreeAdaptor.js | 7 * To get your parser to build nodes of a different type, override
34 /** Tell me how to create a token for use with imaginary token nodes.
42 * Tell me how to create a token for use with imaginary token nodes.
65 * Only works with Tree nodes. For rules that match nothing,
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRTreeWizard.m | 190 * nodes such as function definition nodes (you'll want to seek
192 * dynamic searches; i.e., go find me all PLUS nodes.
312 /** Walk the entire tree and make a node name to nodes mapping.
347 /** Return a List of tree nodes with token type ttype */
351 final List nodes = new ArrayList();
354 [nodes addObject t];
358 AMutableArray *nodes = [AMutableArray arrayWithCapacity:100];
359 ANTLRVisitor *contextVisitor = [ANTLRVisitor newANTLRVisitor:3 Actor:self Object:(id)nodes Object:nil];
361 return nodes;
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/unittests/ |
| testdottreegen.py | 32 " $nodes$\n" +
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| ElemCopy.java | 73 * <p>The namespace nodes of the current node are automatically
77 * the content is instantiated only for nodes of types that can have
78 * attributes or children (i.e. root nodes and element nodes).</p>
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMAxisIterNodeList.java | 33 * intended to be a general purpose "list of nodes" API and is
42 * <li>If there are several Text nodes in logical succession (ie,
97 * <code>index</code> is greater than or equal to the number of nodes in
129 * The number of nodes in the list. The range of valid child node indices
|
| DTMChildIterNodeList.java | 30 * intended to be a general purpose "list of nodes" API and is
39 * <li>If there are several Text nodes in logical succession (ie,
88 * <code>index</code> is greater than or equal to the number of nodes in
107 * The number of nodes in the list. The range of valid child node indices
|
| DTMNodeIterator.java | 33 * DTMNodeIterator which returns DOM nodes.
39 * <li>If there are several Text nodes in logical succession (ie,
107 * of entity reference nodes are visible to the iterator.
116 /** Return a handle to the filter used to screen nodes.
|
| DTMNodeList.java | 31 * intended to be a general purpose "list of nodes" API and is
40 * <li>If there are several Text nodes in logical succession (ie,
100 * <code>index</code> is greater than or equal to the number of nodes in
121 * The number of nodes in the list. The range of valid child node indices
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| DOMOrder.java | 25 * Nodes that implement this index can return a document order index.
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| ReverseAxesWalker.java | 115 * the nodes searched, but, for the moment, this case is probably
185 * Get the number of nodes in this node list. The function is probably ill
191 * @return the number of nodes in this node list.
234 * Returns true if all the nodes in the iteration well be returned in document
|
| WalkingIteratorSorted.java | 28 * This class iterates over set of nodes that needs to be sorted.
35 // /** True if the nodes will be found in document order */
38 /** True if the nodes will be found in document order, and this can
76 * Returns true if all the nodes in the iteration well be returned in document
|
| /external/autotest/puppylab/ |
| CoreClusterTemplate | 18 puppet.manifest_file = "nodes.pp"
|
| /external/autotest/server/site_tests/audio_AudioNodeSwitch/ |
| control | 22 This test remotely tests audio nodes selection.
|
| control.HDMI_JACK_USB | 22 This test remotely tests audio nodes selection.
|
| control.HDMI_USB | 22 This test remotely tests audio nodes selection.
|
| control.JACK_HDMI | 22 This test remotely tests audio nodes selection.
|
| control.JACK_USB | 22 This test remotely tests audio nodes selection.
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| __init__.py | 71 This will print the nodes in some breadth first order::
84 Node 1 is at 0 hops since it is the starting node, nodes 2,3 are 1 hop away ...
85 node 8 is 5 hops away. To find the shortest distance between two nodes you
90 It will print the nodes on one (if there are more) the shortest paths::
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| test_altgraph.py | 35 # diplay the hops and hop numbers between nodes
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| changelog.rst | 70 - Added ``altgraph.ObjectGraph.ObjectGraph.nodes``, a method
71 yielding all nodes in an object graph.
95 no longer create the edge when one of the nodes doesn't
139 one of the nodes is not present in the graph. The method
|
| graphstat.rst | 20 is, when *limits* is ``(4, 10)`` only nodes with between 4
|
| /external/chromium-trace/catapult/third_party/html5lib-python/html5lib/treewalkers/ |
| lxmletree.py | 130 assert key in ("text", "tail"), "Text nodes are text or tail, found %s" % key
169 assert not isinstance(node, tuple), "Text nodes have no children"
180 assert key in ("text", "tail"), "Text nodes are text or tail, found %s" % key
196 assert key in ("text", "tail"), "Text nodes are text or tail, found %s" % key
|
