| /external/libxml2/result/scripts/ |
| set3 | 2 Set contains 1 nodes:
6 Set contains 2 nodes:
|
| /libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/ |
| NodeTest.java | 38 @DataProvider(name = "nodes")
48 List<Node<Integer>> nodes = new ArrayList<>(); local
49 nodes.add(Nodes.node(array));
50 nodes.add(Nodes.node(Arrays.asList(array)));
51 nodes.add(degenerateTree(Arrays.asList(array).iterator()));
52 nodes.add(tree(Arrays.asList(array), l -> Nodes.node(l.toArray(new Integer[l.size()]))));
53 nodes.add(tree(Arrays.asList(array), l -> Nodes.node(l)))
[all...] |
| DoubleNodeTest.java | 38 @DataProvider(name = "nodes")
48 List<Node<Double>> nodes = new ArrayList<>(); local
50 nodes.add(Nodes.node(array));
51 nodes.add(degenerateTree(Spliterators.iterator(Arrays.spliterator(array))));
52 nodes.add(tree(toList(array), l -> Nodes.node(toDoubleArray(l))));
53 nodes.add(fill(array, Nodes.doubleBuilder(array.length)));
54 nodes.add(fill(array, Nodes.doubleBuilder()))
[all...] |
| IntNodeTest.java | 38 @DataProvider(name = "nodes")
48 List<Node<Integer>> nodes = new ArrayList<>(); local
50 nodes.add(Nodes.node(array));
51 nodes.add(degenerateTree(Spliterators.iterator(Arrays.spliterator(array))));
52 nodes.add(tree(toList(array), l -> Nodes.node(toIntArray(l))));
53 nodes.add(fill(array, Nodes.intBuilder(array.length)));
54 nodes.add(fill(array, Nodes.intBuilder()))
[all...] |
| LongNodeTest.java | 38 @DataProvider(name = "nodes")
48 List<Node<Long>> nodes = new ArrayList<>(); local
50 nodes.add(Nodes.node(array));
51 nodes.add(degenerateTree(Spliterators.iterator(Arrays.spliterator(array))));
52 nodes.add(tree(toList(array), l -> Nodes.node(toLongArray(l))));
53 nodes.add(fill(array, Nodes.longBuilder(array.length)));
54 nodes.add(fill(array, Nodes.longBuilder()))
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/ |
| Main.java | 15 CommonTreeNodeStream nodes = new CommonTreeNodeStream(r0); local
16 nodes.setTokenStream(tokens);
17 LangDumpDecl walker = new LangDumpDecl(nodes);
|
| /external/autotest/server/site_tests/audio_AudioNodeSwitch/ |
| audio_AudioNodeSwitch.py | 5 """This is a server side audio nodes s test using the Chameleon board."""
25 audio nodes switch correctly.
37 """Checks default audio nodes for devices with onboard audio support."""
73 def switch_nodes_and_check_volume(self, nodes):
74 """Switches between nodes and check the node volumes.
76 @param nodes: A list of node types to check.
79 if len(nodes) == 1:
80 self.check_active_node_volume(nodes[0])
81 for node in nodes:
82 # Switch nodes and check their volume
[all...] |
| /external/libgdx/tests/gdx-tests-android/assets/data/g3d/materials/ |
| fur01.g3dj | 19 "nodes": [],
|
| grass01.g3dj | 19 "nodes": [],
|
| mirror01.g3dj | 13 "nodes": [],
|
| plastic01.g3dj | 19 "nodes": [],
|
| /external/llvm/test/Linker/Inputs/ |
| unique-fwd-decl-order.ll | 3 ; These nodes are intentionally in the opposite order from the test-driver.
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeIterator.java | 36 /** Return a node stream from a doubly-linked tree whose nodes
39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
47 // navigation nodes to return during walk and at end
52 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
55 protected FastQueue nodes; field in class:TreeIterator
65 nodes = new FastQueue();
74 nodes.clear();
79 if ( nodes!=null && nodes.size()>0 ) return true
[all...] |
| /external/v8/test/unittests/compiler/ |
| node-cache-unittest.cc | 35 Node* nodes[arraysize(constants)]; local
40 *cache.Find(zone(), k) = nodes[i] = node;
45 EXPECT_EQ(nodes[i], *cache.Find(zone(), k));
53 Node** nodes = zone()->NewArray<Node*>(kSize); local
57 nodes[i] = graph()->NewNode(common()->Int32Constant(v));
58 *cache.Find(zone(), v) = nodes[i];
66 EXPECT_EQ(nodes[i], *pos);
91 Node** nodes = zone()->NewArray<Node*>(kSize); local
95 nodes[i] = graph()->NewNode(common()->Int32Constant(i));
96 *cache.Find(zone(), v) = nodes[i]
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| graphutil.rst | 13 with *node_num* nodes randomly connected by *edge_num* edges.
26 will have *steps*growth_n um* nodes and a scale free (powerlaw)
29 Starting with a fully connected graph with *growth_num* nodes
30 at every step *growth_num* nodes are added to the graph and are connected
31 to existing nodes with a probability proportional to the degree of these
32 existing nodes.
42 apply all filter functions in *filters* on the node data of the nodes
47 * *visited*: the set of visited nodes
49 * *removes*: the list of nodes where the node data doesn't match
53 node is not in *removes* and one of the nodes that is connecte
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeIterator.cs | 36 /** Return a node stream from a doubly-linked tree whose nodes
39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
47 // navigation nodes to return during walk and at end
52 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
55 protected Queue<object> nodes; field in class:Antlr.Runtime.Tree.TreeIterator
65 nodes = new Queue<object>();
95 nodes.Enqueue(eof);
100 if (nodes != null && nodes.Count > 0)
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| TreeIterator.cs | 37 /** Return a node stream from a doubly-linked tree whose nodes
40 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
50 // navigation nodes to return during walk and at end
55 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
58 protected Queue<object> nodes; field in class:Antlr.Runtime.Tree.TreeIterator
70 nodes = new Queue<object>();
105 nodes.Enqueue( eof );
112 if ( nodes != null && nodes.Count > 0
[all...] |
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| CommonTreeNodeStream.js | 1 /** A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.
3 * This node stream sucks all nodes out of the tree specified in
6 * includes pointers to DOWN and UP and EOF nodes.
30 /** Reuse same DOWN, UP navigation nodes unless this is true */
33 /** The index into the nodes list of the current node (next node
34 * to consume). If -1, nodes array not filled yet.
41 this.nodes = []; //new ArrayList(initialBufferSize);
57 nodes = this.nodes,
[all...] |
| /external/mesa3d/src/mesa/program/ |
| register_allocate.c | 34 * edges in the graph between nodes that interfere (can't be allocated
41 * That likely causes other nodes to become trivially colorable as well.
43 * Then during the "select" process, nodes are popped off of that
118 * List of which nodes this node interferes with. This should be
150 struct ra_node *nodes; member in struct:ra_graph
151 unsigned int count; /**< count of nodes. */
298 g->nodes[n1].adjacency[n2] = GL_TRUE;
299 g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2;
300 g->nodes[n1].adjacency_count++
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRTreeIterator.m | 53 nodes = [[ANTLRFastQueue newANTLRFastQueue] retain];
71 nodes = [[ANTLRFastQueue newANTLRFastQueue] retain];
87 nodes = [[ANTLRFastQueue newANTLRFastQueue] retain];
101 if ( nodes ) [nodes release];
114 [nodes clear];
122 if ( nodes && [nodes size] > 0) {
140 [nodes addObject:eof];
146 if ( nodes && [nodes size] > 0 )
[all...] |
| /external/libxml2/doc/examples/ |
| xpath2.c | 28 static void update_xpath_nodes(xmlNodeSetPtr nodes, const xmlChar * value);
79 * Parses input XML file, evaluates XPath expression and update the nodes
118 /* update selected nodes */
138 * @nodes: the nodes set.
141 * Prints the @nodes content to @output.
144 update_xpath_nodes(xmlNodeSetPtr nodes, const xmlChar* value) {
149 size = (nodes) ? nodes->nodeNr : 0;
152 * NOTE: the nodes are processed in reverse order, i.e. reverse documen
[all...] |
| /external/libxml2/result/XPath/tests/ |
| vidbase | 5 Set contains 1 nodes:
14 Set contains 1 nodes:
23 Set contains 4 nodes:
32 Set contains 4 nodes:
41 Set contains 1 nodes:
|
| /external/llvm/test/CodeGen/X86/ |
| 2014-05-30-CombineAddNSW.ll | 7 ; actually generate two different nodes.
12 ; needs to keep the add + sub nodes, because the two nodes result as different
13 ; nodes and so cannot assume that the subtraction of the two nodes
|
| /external/autotest/server/site_tests/audio_InternalCardNodes/ |
| control | 9 PURPOSE = "Remotely controlled audio test checking audio nodes created for internal card."
10 CRITERIA = "This test will fail if the plugged nodes are not expected."
21 This test remotely tests plugged audio nodes for internal cards.
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| GraphUtil.py | 13 Generates and returns a :py:class:`~altgraph.Graph.Graph` instance with *node_num* nodes
27 nodes = range(node_num)
29 for node in nodes:
33 head = random.choice(nodes)
34 tail = random.choice(nodes)
53 Generates and returns a :py:class:`~altgraph.Graph.Graph` instance that will have *steps* \* *growth_num* nodes
54 and a scale free (powerlaw) connectivity. Starting with a fully connected graph with *growth_num* nodes
55 at every step *growth_num* nodes are added to the graph and are connected to existing nodes with
56 a probability proportional to the degree of these existing nodes
[all...] |
