| /external/guava/android/guava-tests/test/com/google/common/graph/ |
| D | AbstractStandardUndirectedNetworkTest.java | 35 private static final EndpointPair<Integer> ENDPOINTS_N1N2 = EndpointPair.ordered(N1, N2);
36 private static final EndpointPair<Integer> ENDPOINTS_N2N1 = EndpointPair.ordered(N2, N1);
65 addNode(N1); in nodes_checkReturnedSetMutability()
78 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
86 addNode(N1); in incidentEdges_checkReturnedSetMutability()
87 Set<String> incidentEdges = network.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability()
92 addEdge(N1, N2, E12); in incidentEdges_checkReturnedSetMutability()
93 assertThat(network.incidentEdges(N1)).containsExactlyElementsIn(incidentEdges); in incidentEdges_checkReturnedSetMutability()
100 addNode(N1); in adjacentNodes_checkReturnedSetMutability()
101 Set<Integer> adjacentNodes = network.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability()
[all …]
|
| D | AbstractStandardDirectedGraphTest.java | 43 addNode(N1); in nodes_checkReturnedSetMutability()
53 addNode(N1); in adjacentNodes_checkReturnedSetMutability()
54 Set<Integer> adjacentNodes = graph.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability()
59 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
60 assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
72 predecessors.add(N1); in predecessors_checkReturnedSetMutability()
75 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
85 addNode(N1); in successors_checkReturnedSetMutability()
86 Set<Integer> successors = graph.successors(N1); in successors_checkReturnedSetMutability()
91 putEdge(N1, N2); in successors_checkReturnedSetMutability()
[all …]
|
| D | AbstractStandardUndirectedGraphTest.java | 54 addNode(N1); in nodes_checkReturnedSetMutability()
64 addNode(N1); in adjacentNodes_checkReturnedSetMutability()
65 Set<Integer> adjacentNodes = graph.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability()
70 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
71 assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
83 predecessors.add(N1); in predecessors_checkReturnedSetMutability()
86 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
96 addNode(N1); in successors_checkReturnedSetMutability()
97 Set<Integer> successors = graph.successors(N1); in successors_checkReturnedSetMutability()
102 putEdge(N1, N2); in successors_checkReturnedSetMutability()
[all …]
|
| D | AbstractStandardDirectedNetworkTest.java | 71 addNode(N1); in nodes_checkReturnedSetMutability()
86 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
96 addNode(N1); in incidentEdges_checkReturnedSetMutability()
97 Set<String> incidentEdges = network.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability()
102 addEdge(N1, N2, E12); in incidentEdges_checkReturnedSetMutability()
103 assertThat(network.incidentEdges(N1)).containsExactlyElementsIn(incidentEdges); in incidentEdges_checkReturnedSetMutability()
112 addNode(N1); in adjacentNodes_checkReturnedSetMutability()
113 Set<Integer> adjacentNodes = network.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability()
118 addEdge(N1, N2, E12); in adjacentNodes_checkReturnedSetMutability()
119 assertThat(network.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
[all …]
|
| D | GraphsTest.java | 39 private static final Integer N1 = 1; field in GraphsTest
68 directedGraph.putEdge(N1, N2); in transitiveClosure_directedGraph()
69 directedGraph.putEdge(N1, N3); in transitiveClosure_directedGraph()
74 expectedClosure.putEdge(N1, N1); in transitiveClosure_directedGraph()
75 expectedClosure.putEdge(N1, N2); in transitiveClosure_directedGraph()
76 expectedClosure.putEdge(N1, N3); in transitiveClosure_directedGraph()
89 undirectedGraph.putEdge(N1, N2); in transitiveClosure_undirectedGraph()
90 undirectedGraph.putEdge(N1, N3); in transitiveClosure_undirectedGraph()
95 expectedClosure.putEdge(N1, N1); in transitiveClosure_undirectedGraph()
96 expectedClosure.putEdge(N1, N2); in transitiveClosure_undirectedGraph()
[all …]
|
| D | EndpointPairTest.java | 35 private static final Integer N1 = 1; field in EndpointPairTest
123 directedGraph.putEdge(N1, N2); in endpointPair_directedGraph()
124 directedGraph.putEdge(N2, N1); in endpointPair_directedGraph()
125 directedGraph.putEdge(N1, N3); in endpointPair_directedGraph()
129 EndpointPair.ordered(N1, N2), in endpointPair_directedGraph()
130 EndpointPair.ordered(N2, N1), in endpointPair_directedGraph()
131 EndpointPair.ordered(N1, N3), in endpointPair_directedGraph()
139 undirectedGraph.putEdge(N1, N2); in endpointPair_undirectedGraph()
140 undirectedGraph.putEdge(N2, N1); // does nothing in endpointPair_undirectedGraph()
141 undirectedGraph.putEdge(N1, N3); in endpointPair_undirectedGraph()
[all …]
|
| D | AbstractGraphTest.java | 60 static final Integer N1 = 1; field in AbstractGraphTest
214 addNode(N1); in nodes_oneNode()
215 assertThat(graph.nodes()).containsExactly(N1); in nodes_oneNode()
225 putEdge(N1, N2); in adjacentNodes_oneEdge()
226 assertThat(graph.adjacentNodes(N1)).containsExactly(N2); in adjacentNodes_oneEdge()
227 assertThat(graph.adjacentNodes(N2)).containsExactly(N1); in adjacentNodes_oneEdge()
232 addNode(N1); in adjacentNodes_noAdjacentNodes()
233 assertThat(graph.adjacentNodes(N1)).isEmpty(); in adjacentNodes_noAdjacentNodes()
248 addNode(N1); in predecessors_noPredecessors()
249 assertThat(graph.predecessors(N1)).isEmpty(); in predecessors_noPredecessors()
[all …]
|
| D | DefaultNetworkImplementationsTest.java | 48 private static final Integer N1 = 1; field in DefaultNetworkImplementationsTest
83 network.addNode(N1); in edgesConnecting_disconnectedNodes()
85 assertThat(networkForTest.edgesConnecting(N1, N2)).isEmpty(); in edgesConnecting_disconnectedNodes()
90 network.addNode(N1); in edgesConnecting_nodesNotInGraph()
93 networkForTest.edgesConnecting(N1, NODE_NOT_IN_GRAPH); in edgesConnecting_nodesNotInGraph()
114 network.addNode(N1); in edgesConnecting_checkReturnedSetMutability()
116 Set<String> edgesConnecting = network.edgesConnecting(N1, N2); in edgesConnecting_checkReturnedSetMutability()
121 network.addEdge(N1, N2, E12); in edgesConnecting_checkReturnedSetMutability()
122 assertThat(networkForTest.edgesConnecting(N1, N2)).containsExactlyElementsIn(edgesConnecting); in edgesConnecting_checkReturnedSetMutability()
128 network.addEdge(N1, N2, E12); in edgesConnecting_oneEdge()
[all …]
|
| D | AbstractNetworkTest.java | 69 static final Integer N1 = 1; field in AbstractNetworkTest
379 addNode(N1); in nodes_oneNode()
380 assertThat(network.nodes()).containsExactly(N1); in nodes_oneNode()
390 addEdge(N1, N2, E12); in edges_oneEdge()
398 addNode(N1); in edges_noEdges()
405 addEdge(N1, N2, E12); in incidentEdges_oneEdge()
407 assertThat(network.incidentEdges(N1)).containsExactly(E12); in incidentEdges_oneEdge()
412 addNode(N1); in incidentEdges_isolatedNode()
413 assertThat(network.incidentEdges(N1)).isEmpty(); in incidentEdges_isolatedNode()
428 addEdge(N1, N2, E12); in incidentNodes_oneEdge()
[all …]
|
| /external/guava/guava-tests/test/com/google/common/graph/ |
| D | AbstractStandardDirectedGraphTest.java | 43 addNode(N1); in nodes_checkReturnedSetMutability()
53 addNode(N1); in adjacentNodes_checkReturnedSetMutability()
54 Set<Integer> adjacentNodes = graph.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability()
59 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
60 assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
72 predecessors.add(N1); in predecessors_checkReturnedSetMutability()
75 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
85 addNode(N1); in successors_checkReturnedSetMutability()
86 Set<Integer> successors = graph.successors(N1); in successors_checkReturnedSetMutability()
91 putEdge(N1, N2); in successors_checkReturnedSetMutability()
[all …]
|
| D | AbstractStandardUndirectedGraphTest.java | 54 addNode(N1); in nodes_checkReturnedSetMutability()
64 addNode(N1); in adjacentNodes_checkReturnedSetMutability()
65 Set<Integer> adjacentNodes = graph.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability()
70 putEdge(N1, N2); in adjacentNodes_checkReturnedSetMutability()
71 assertThat(graph.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
83 predecessors.add(N1); in predecessors_checkReturnedSetMutability()
86 putEdge(N1, N2); in predecessors_checkReturnedSetMutability()
96 addNode(N1); in successors_checkReturnedSetMutability()
97 Set<Integer> successors = graph.successors(N1); in successors_checkReturnedSetMutability()
102 putEdge(N1, N2); in successors_checkReturnedSetMutability()
[all …]
|
| D | AbstractStandardUndirectedNetworkTest.java | 36 private static final EndpointPair<Integer> ENDPOINTS_N1N2 = EndpointPair.ordered(N1, N2);
37 private static final EndpointPair<Integer> ENDPOINTS_N2N1 = EndpointPair.ordered(N2, N1);
66 addNode(N1); in nodes_checkReturnedSetMutability()
79 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
87 addNode(N1); in incidentEdges_checkReturnedSetMutability()
88 Set<String> incidentEdges = network.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability()
93 addEdge(N1, N2, E12); in incidentEdges_checkReturnedSetMutability()
94 assertThat(network.incidentEdges(N1)).containsExactlyElementsIn(incidentEdges); in incidentEdges_checkReturnedSetMutability()
101 addNode(N1); in adjacentNodes_checkReturnedSetMutability()
102 Set<Integer> adjacentNodes = network.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability()
[all …]
|
| D | AbstractStandardDirectedNetworkTest.java | 72 addNode(N1); in nodes_checkReturnedSetMutability()
87 addEdge(N1, N2, E12); in edges_checkReturnedSetMutability()
97 addNode(N1); in incidentEdges_checkReturnedSetMutability()
98 Set<String> incidentEdges = network.incidentEdges(N1); in incidentEdges_checkReturnedSetMutability()
103 addEdge(N1, N2, E12); in incidentEdges_checkReturnedSetMutability()
104 assertThat(network.incidentEdges(N1)).containsExactlyElementsIn(incidentEdges); in incidentEdges_checkReturnedSetMutability()
113 addNode(N1); in adjacentNodes_checkReturnedSetMutability()
114 Set<Integer> adjacentNodes = network.adjacentNodes(N1); in adjacentNodes_checkReturnedSetMutability()
119 addEdge(N1, N2, E12); in adjacentNodes_checkReturnedSetMutability()
120 assertThat(network.adjacentNodes(N1)).containsExactlyElementsIn(adjacentNodes); in adjacentNodes_checkReturnedSetMutability()
[all …]
|
| D | GraphsTest.java | 39 private static final Integer N1 = 1; field in GraphsTest
68 directedGraph.putEdge(N1, N2); in transitiveClosure_directedGraph()
69 directedGraph.putEdge(N1, N3); in transitiveClosure_directedGraph()
74 expectedClosure.putEdge(N1, N1); in transitiveClosure_directedGraph()
75 expectedClosure.putEdge(N1, N2); in transitiveClosure_directedGraph()
76 expectedClosure.putEdge(N1, N3); in transitiveClosure_directedGraph()
89 undirectedGraph.putEdge(N1, N2); in transitiveClosure_undirectedGraph()
90 undirectedGraph.putEdge(N1, N3); in transitiveClosure_undirectedGraph()
95 expectedClosure.putEdge(N1, N1); in transitiveClosure_undirectedGraph()
96 expectedClosure.putEdge(N1, N2); in transitiveClosure_undirectedGraph()
[all …]
|
| D | EndpointPairTest.java | 35 private static final Integer N1 = 1; field in EndpointPairTest
123 directedGraph.putEdge(N1, N2); in endpointPair_directedGraph()
124 directedGraph.putEdge(N2, N1); in endpointPair_directedGraph()
125 directedGraph.putEdge(N1, N3); in endpointPair_directedGraph()
129 EndpointPair.ordered(N1, N2), in endpointPair_directedGraph()
130 EndpointPair.ordered(N2, N1), in endpointPair_directedGraph()
131 EndpointPair.ordered(N1, N3), in endpointPair_directedGraph()
139 undirectedGraph.putEdge(N1, N2); in endpointPair_undirectedGraph()
140 undirectedGraph.putEdge(N2, N1); // does nothing in endpointPair_undirectedGraph()
141 undirectedGraph.putEdge(N1, N3); in endpointPair_undirectedGraph()
[all …]
|
| D | AbstractGraphTest.java | 60 static final Integer N1 = 1; field in AbstractGraphTest
214 addNode(N1); in nodes_oneNode()
215 assertThat(graph.nodes()).containsExactly(N1); in nodes_oneNode()
225 putEdge(N1, N2); in adjacentNodes_oneEdge()
226 assertThat(graph.adjacentNodes(N1)).containsExactly(N2); in adjacentNodes_oneEdge()
227 assertThat(graph.adjacentNodes(N2)).containsExactly(N1); in adjacentNodes_oneEdge()
232 addNode(N1); in adjacentNodes_noAdjacentNodes()
233 assertThat(graph.adjacentNodes(N1)).isEmpty(); in adjacentNodes_noAdjacentNodes()
248 addNode(N1); in predecessors_noPredecessors()
249 assertThat(graph.predecessors(N1)).isEmpty(); in predecessors_noPredecessors()
[all …]
|
| D | DefaultNetworkImplementationsTest.java | 48 private static final Integer N1 = 1; field in DefaultNetworkImplementationsTest
83 network.addNode(N1); in edgesConnecting_disconnectedNodes()
85 assertThat(networkForTest.edgesConnecting(N1, N2)).isEmpty(); in edgesConnecting_disconnectedNodes()
90 network.addNode(N1); in edgesConnecting_nodesNotInGraph()
93 networkForTest.edgesConnecting(N1, NODE_NOT_IN_GRAPH); in edgesConnecting_nodesNotInGraph()
114 network.addNode(N1); in edgesConnecting_checkReturnedSetMutability()
116 Set<String> edgesConnecting = network.edgesConnecting(N1, N2); in edgesConnecting_checkReturnedSetMutability()
121 network.addEdge(N1, N2, E12); in edgesConnecting_checkReturnedSetMutability()
122 assertThat(networkForTest.edgesConnecting(N1, N2)).containsExactlyElementsIn(edgesConnecting); in edgesConnecting_checkReturnedSetMutability()
128 network.addEdge(N1, N2, E12); in edgesConnecting_oneEdge()
[all …]
|
| D | AbstractNetworkTest.java | 69 static final Integer N1 = 1; field in AbstractNetworkTest
386 addNode(N1); in nodes_oneNode()
387 assertThat(network.nodes()).containsExactly(N1); in nodes_oneNode()
397 addEdge(N1, N2, E12); in edges_oneEdge()
405 addNode(N1); in edges_noEdges()
412 addEdge(N1, N2, E12); in incidentEdges_oneEdge()
414 assertThat(network.incidentEdges(N1)).containsExactly(E12); in incidentEdges_oneEdge()
419 addNode(N1); in incidentEdges_isolatedNode()
420 assertThat(network.incidentEdges(N1)).isEmpty(); in incidentEdges_isolatedNode()
435 addEdge(N1, N2, E12); in incidentNodes_oneEdge()
[all …]
|
| /external/llvm-project/libcxx/test/std/numerics/numarray/template.valarray/valarray.members/ |
| D | shift.pass.cpp | 26 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
27 std::valarray<T> v1(a1, N1); in main()
29 assert(v2.size() == N1); in main()
30 for (unsigned i = 0; i < N1; ++i) in main()
37 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
38 std::valarray<T> v1(a1, N1); in main()
40 assert(v2.size() == N1); in main()
41 for (unsigned i = 0; i < N1; ++i) in main()
48 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
49 std::valarray<T> v1(a1, N1); in main()
[all …]
|
| D | cshift.pass.cpp | 26 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
27 std::valarray<T> v1(a1, N1); in main()
29 assert(v2.size() == N1); in main()
30 for (unsigned i = 0; i < N1; ++i) in main()
37 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
38 std::valarray<T> v1(a1, N1); in main()
40 assert(v2.size() == N1); in main()
41 for (unsigned i = 0; i < N1; ++i) in main()
48 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
49 std::valarray<T> v1(a1, N1); in main()
[all …]
|
| /external/libcxx/test/std/numerics/numarray/template.valarray/valarray.members/ |
| D | cshift.pass.cpp | 25 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
26 std::valarray<T> v1(a1, N1); in main()
28 assert(v2.size() == N1); in main()
29 for (unsigned i = 0; i < N1; ++i) in main()
36 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
37 std::valarray<T> v1(a1, N1); in main()
39 assert(v2.size() == N1); in main()
40 for (unsigned i = 0; i < N1; ++i) in main()
47 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
48 std::valarray<T> v1(a1, N1); in main()
[all …]
|
| D | shift.pass.cpp | 25 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
26 std::valarray<T> v1(a1, N1); in main()
28 assert(v2.size() == N1); in main()
29 for (unsigned i = 0; i < N1; ++i) in main()
36 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
37 std::valarray<T> v1(a1, N1); in main()
39 assert(v2.size() == N1); in main()
40 for (unsigned i = 0; i < N1; ++i) in main()
47 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
48 std::valarray<T> v1(a1, N1); in main()
[all …]
|
| /external/llvm-project/llvm/unittests/ADT/ |
| D | DirectedGraphTest.cpp | 96 DGTestNode N1, N2, N3; in TEST() local
97 DGTestEdge E1(N1), E2(N2), E3(N3); in TEST()
100 EXPECT_TRUE(DG.addNode(N1)); in TEST()
105 EXPECT_FALSE(DG.addNode(N1)); in TEST()
108 EXPECT_TRUE(DG.connect(N1, N2, E2)); in TEST()
110 EXPECT_TRUE(DG.connect(N3, N1, E1)); in TEST()
120 EXPECT_FALSE(DG.connect(N3, N1, E1)); in TEST()
134 EXPECT_TRUE(DG.findIncomingEdgesToNode(N1, EL)); in TEST()
141 DGTestNode N1, N2, N3; in TEST() local
142 DGTestEdge E1(N1), E2(N2), E3(N3); in TEST()
[all …]
|
| /external/guava/guava/src/com/google/common/graph/ |
| D | GraphBuilder.java | 108 public <N1 extends N> ImmutableGraph.Builder<N1> immutable() { in immutable()
109 GraphBuilder<N1> castBuilder = cast(); in immutable()
140 public <N1 extends N> GraphBuilder<N1> nodeOrder(ElementOrder<N1> nodeOrder) { in nodeOrder()
141 GraphBuilder<N1> newBuilder = cast(); in nodeOrder()
159 public <N1 extends N> GraphBuilder<N1> incidentEdgeOrder(ElementOrder<N1> incidentEdgeOrder) { in incidentEdgeOrder()
166 GraphBuilder<N1> newBuilder = cast(); in incidentEdgeOrder()
172 public <N1 extends N> MutableGraph<N1> build() { in build()
173 return new StandardMutableGraph<N1>(this); in build()
186 private <N1 extends N> GraphBuilder<N1> cast() { in cast()
187 return (GraphBuilder<N1>) this; in cast()
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | GraphBuilder.java | 108 public <N1 extends N> ImmutableGraph.Builder<N1> immutable() { in immutable()
109 GraphBuilder<N1> castBuilder = cast(); in immutable()
140 public <N1 extends N> GraphBuilder<N1> nodeOrder(ElementOrder<N1> nodeOrder) { in nodeOrder()
141 GraphBuilder<N1> newBuilder = cast(); in nodeOrder()
159 public <N1 extends N> GraphBuilder<N1> incidentEdgeOrder(ElementOrder<N1> incidentEdgeOrder) { in incidentEdgeOrder()
166 GraphBuilder<N1> newBuilder = cast(); in incidentEdgeOrder()
172 public <N1 extends N> MutableGraph<N1> build() { in build()
173 return new StandardMutableGraph<N1>(this); in build()
186 private <N1 extends N> GraphBuilder<N1> cast() { in cast()
187 return (GraphBuilder<N1>) this; in cast()
|