| /external/guava/guava-tests/test/com/google/common/graph/ |
| D | GraphsTest.java | 42 private static final Integer N4 = 4; field in GraphsTest
71 directedGraph.addNode(N4); in transitiveClosure_directedGraph()
80 expectedClosure.putEdge(N4, N4); in transitiveClosure_directedGraph()
92 undirectedGraph.addNode(N4); in transitiveClosure_undirectedGraph()
101 expectedClosure.putEdge(N4, N4); in transitiveClosure_undirectedGraph()
111 directedGraph.putEdge(N3, N4); in transitiveClosure_directedPathGraph()
117 expectedClosure.putEdge(N1, N4); in transitiveClosure_directedPathGraph()
120 expectedClosure.putEdge(N2, N4); in transitiveClosure_directedPathGraph()
122 expectedClosure.putEdge(N3, N4); in transitiveClosure_directedPathGraph()
123 expectedClosure.putEdge(N4, N4); in transitiveClosure_directedPathGraph()
[all …]
|
| D | EndpointPairTest.java | 38 private static final Integer N4 = 4; field in EndpointPairTest
126 directedGraph.putEdge(N4, N4); in endpointPair_directedGraph()
132 EndpointPair.ordered(N4, N4)); in endpointPair_directedGraph()
142 undirectedGraph.putEdge(N4, N4); in endpointPair_undirectedGraph()
147 EndpointPair.unordered(N4, N4)); in endpointPair_undirectedGraph()
158 directedNetwork.addEdge(N4, N4, E44); in endpointPair_directedNetwork()
164 EndpointPair.ordered(N4, N4)); in endpointPair_directedNetwork()
175 undirectedNetwork.addEdge(N4, N4, E44); in endpointPair_undirectedNetwork()
180 EndpointPair.unordered(N4, N4)); in endpointPair_undirectedNetwork()
221 assertThat(edges).doesNotContain(EndpointPair.unordered(N3, N4)); // nodes not in graph in endpointPair_undirected_contains()
[all …]
|
| D | AbstractGraphTest.java | 63 static final Integer N4 = 4; field in AbstractGraphTest
372 putEdge(N4, N1); in removeNode_existingNode()
375 assertThat(graph.nodes()).containsExactly(N2, N4); in removeNode_existingNode()
377 assertThat(graph.adjacentNodes(N4)).isEmpty(); in removeNode_existingNode()
441 putEdge(N1, N4); in removeEdge_oneOfMany()
443 assertThat(graph.adjacentNodes(N1)).containsExactly(N2, N4); in removeEdge_oneOfMany()
|
| D | AbstractStandardDirectedGraphTest.java | 186 putEdge(N4, N1); in predecessors_selfLoop()
187 assertThat(graph.predecessors(N1)).containsExactly(N1, N4); in predecessors_selfLoop()
227 putEdge(N4, N1); in inDegree_selfLoop()
386 assertTrue(graphAsMutableGraph.putEdge(N4, N1)); in putEdge_nodesNotInGraph()
388 assertThat(graph.nodes()).containsExactly(N1, N5, N4, N2, N3).inOrder(); in putEdge_nodesNotInGraph()
392 assertThat(graph.successors(N4)).containsExactly(N1); in putEdge_nodesNotInGraph()
|
| D | AbstractStandardDirectedNetworkTest.java | 419 addEdge(N4, N1, E41); in inEdges_selfLoop()
439 addEdge(N4, N1, E41); in predecessors_selfLoop()
440 assertThat(network.predecessors(N1)).containsExactly(N1, N4); in predecessors_selfLoop()
485 addEdge(N4, N1, E41); in inDegree_selfLoop()
533 networkAsMutableNetwork.addEdge(N4, N5, E12); in addEdge_existingEdgeBetweenDifferentNodes()
609 assertTrue(networkAsMutableNetwork.addEdge(N4, N1, E41)); in addEdge_nodesNotInGraph()
611 assertThat(network.nodes()).containsExactly(N1, N5, N4, N2, N3); in addEdge_nodesNotInGraph()
614 assertThat(network.edgesConnecting(N4, N1)).containsExactly(E41); in addEdge_nodesNotInGraph()
|
| /external/guava/android/guava-tests/test/com/google/common/graph/ |
| D | GraphsTest.java | 42 private static final Integer N4 = 4; field in GraphsTest
71 directedGraph.addNode(N4); in transitiveClosure_directedGraph()
80 expectedClosure.putEdge(N4, N4); in transitiveClosure_directedGraph()
92 undirectedGraph.addNode(N4); in transitiveClosure_undirectedGraph()
101 expectedClosure.putEdge(N4, N4); in transitiveClosure_undirectedGraph()
111 directedGraph.putEdge(N3, N4); in transitiveClosure_directedPathGraph()
117 expectedClosure.putEdge(N1, N4); in transitiveClosure_directedPathGraph()
120 expectedClosure.putEdge(N2, N4); in transitiveClosure_directedPathGraph()
122 expectedClosure.putEdge(N3, N4); in transitiveClosure_directedPathGraph()
123 expectedClosure.putEdge(N4, N4); in transitiveClosure_directedPathGraph()
[all …]
|
| D | EndpointPairTest.java | 38 private static final Integer N4 = 4; field in EndpointPairTest
126 directedGraph.putEdge(N4, N4); in endpointPair_directedGraph()
132 EndpointPair.ordered(N4, N4)); in endpointPair_directedGraph()
142 undirectedGraph.putEdge(N4, N4); in endpointPair_undirectedGraph()
147 EndpointPair.unordered(N4, N4)); in endpointPair_undirectedGraph()
158 directedNetwork.addEdge(N4, N4, E44); in endpointPair_directedNetwork()
164 EndpointPair.ordered(N4, N4)); in endpointPair_directedNetwork()
175 undirectedNetwork.addEdge(N4, N4, E44); in endpointPair_undirectedNetwork()
180 EndpointPair.unordered(N4, N4)); in endpointPair_undirectedNetwork()
221 assertThat(edges).doesNotContain(EndpointPair.unordered(N3, N4)); // nodes not in graph in endpointPair_undirected_contains()
[all …]
|
| D | AbstractGraphTest.java | 63 static final Integer N4 = 4; field in AbstractGraphTest
372 putEdge(N4, N1); in removeNode_existingNode()
375 assertThat(graph.nodes()).containsExactly(N2, N4); in removeNode_existingNode()
377 assertThat(graph.adjacentNodes(N4)).isEmpty(); in removeNode_existingNode()
441 putEdge(N1, N4); in removeEdge_oneOfMany()
443 assertThat(graph.adjacentNodes(N1)).containsExactly(N2, N4); in removeEdge_oneOfMany()
|
| D | AbstractStandardDirectedGraphTest.java | 186 putEdge(N4, N1); in predecessors_selfLoop()
187 assertThat(graph.predecessors(N1)).containsExactly(N1, N4); in predecessors_selfLoop()
227 putEdge(N4, N1); in inDegree_selfLoop()
386 assertTrue(graphAsMutableGraph.putEdge(N4, N1)); in putEdge_nodesNotInGraph()
388 assertThat(graph.nodes()).containsExactly(N1, N5, N4, N2, N3).inOrder(); in putEdge_nodesNotInGraph()
392 assertThat(graph.successors(N4)).containsExactly(N1); in putEdge_nodesNotInGraph()
|
| /external/libopus/celt/arm/ |
| D | celt_mdct_ne10.c | 51 int N, N2, N4; in clt_mdct_forward_neon() local
67 N4 = N>>2; in clt_mdct_forward_neon()
70 ALLOC(f2, N4, kiss_fft_cpx); in clt_mdct_forward_neon()
93 for(;i<N4-((overlap+3)>>2);i++) in clt_mdct_forward_neon()
101 for(;i<N4;i++) in clt_mdct_forward_neon()
116 for(i=0;i<N4;i++) in clt_mdct_forward_neon()
122 t1 = t[N4+i]; in clt_mdct_forward_neon()
143 for(i=0;i<N4;i++) in clt_mdct_forward_neon()
146 yr = S_MUL(fp->i,t[N4+i]) - S_MUL(fp->r,t[i]); in clt_mdct_forward_neon()
147 yi = S_MUL(fp->r,t[N4+i]) + S_MUL(fp->i,t[i]); in clt_mdct_forward_neon()
[all …]
|
| /external/libopus/celt/mips/ |
| D | mdct_mipsr1.h | 64 int N, N2, N4; in clt_mdct_forward() local
89 N4 = N>>2; in clt_mdct_forward()
92 ALLOC(f2, N4, kiss_fft_cpx); in clt_mdct_forward()
115 for(;i<N4-((overlap+3)>>2);i++) in clt_mdct_forward()
123 for(;i<N4;i++) in clt_mdct_forward()
138 for(i=0;i<N4;i++) in clt_mdct_forward()
144 t1 = t[N4+i]; in clt_mdct_forward()
170 for(i=0;i<N4;i++) in clt_mdct_forward()
173 yr = S_MUL_SUB(fp->i,t[N4+i] , fp->r,t[i]); in clt_mdct_forward()
174 yi = S_MUL_ADD(fp->r,t[N4+i] ,fp->i,t[i]); in clt_mdct_forward()
[all …]
|
| /external/llvm-project/llvm/unittests/ADT/ |
| D | WaymarkingTest.cpp | 112 const int N4 = N / 4; in TEST() local
129 int T4 = tag(A[N4]); in TEST()
130 delete ref(A[N4]); in TEST()
131 A[N4] = new int(N4); in TEST()
132 fillWaymarks(A + N4, A + N4 + 1, N4); in TEST()
133 verifyArrayValues(A, N4, N4 + 1); in TEST()
134 EXPECT_EQ(T4, tag(A[N4])); in TEST()
|
| D | DirectedGraphTest.cpp | 129 DGTestNode N4; in TEST() local
130 EXPECT_EQ(DG.findNode(N4), DG.end()); in TEST()
249 DGTestNode N1, N2, N3, N4; in TEST() local
250 DGTestEdge E1(N1), E2(N2), E3(N3), E4(N4); in TEST()
254 DG.addNode(N4); in TEST()
258 DG.connect(N3, N4, E4); in TEST()
282 EXPECT_TRUE(SCC.count(&N4) == 1); in TEST()
291 EXPECT_TRUE(SCC.count(&N4) == 0); in TEST()
|
| /external/libopus/celt/ |
| D | mdct.c | 123 int N, N2, N4; in clt_mdct_forward_c() local
146 N4 = N>>2; in clt_mdct_forward_c()
149 ALLOC(f2, N4, kiss_fft_cpx); in clt_mdct_forward_c()
172 for(;i<N4-((overlap+3)>>2);i++) in clt_mdct_forward_c()
180 for(;i<N4;i++) in clt_mdct_forward_c()
195 for(i=0;i<N4;i++) in clt_mdct_forward_c()
201 t1 = t[N4+i]; in clt_mdct_forward_c()
225 for(i=0;i<N4;i++) in clt_mdct_forward_c()
228 yr = S_MUL(fp->i,t[N4+i]) - S_MUL(fp->r,t[i]); in clt_mdct_forward_c()
229 yi = S_MUL(fp->r,t[N4+i]) + S_MUL(fp->i,t[i]); in clt_mdct_forward_c()
[all …]
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| D | StringSwitch.h | 127 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
131 const char (&S4)[N4], const T& Value) { in Cases() argument
135 template <unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4,
140 const char (&S4)[N4], const char (&S5)[N5], in Cases() argument
145 template <unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4,
150 const char (&S4)[N4], const char (&S5)[N5], in Cases() argument
155 template <unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4,
160 const char (&S4)[N4], const char (&S5)[N5], in Cases() argument
166 template <unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4,
171 const char (&S4)[N4], const char (&S5)[N5], in Cases() argument
[all …]
|
| /external/rust/crates/itertools/benches/ |
| D | tuple_combinations.rs | 8 const N4: usize = 41; constant
49 for i in 0..N4 { in tuple_comb_for4()
50 for j in (i + 1)..N4 { in tuple_comb_for4()
51 for k in (j + 1)..N4 { in tuple_comb_for4()
52 for l in (k + 1)..N4 { in tuple_comb_for4()
95 for (i, j, k, l) in (0..N4).tuple_combinations() { in tuple_comb_c4()
|
| D | combinations.rs | 8 const N4: usize = 41; constant
50 for i in 0..N4 { in comb_for4()
51 for j in (i + 1)..N4 { in comb_for4()
52 for k in (j + 1)..N4 { in comb_for4()
53 for l in (k + 1)..N4 { in comb_for4()
96 for combo in (0..N4).combinations(4) { in comb_c4()
|
| /external/clang/test/SemaTemplate/ |
| D | instantiate-expr-2.cpp | 25 namespace N4 { namespace
43 typedef N4::BinOpOverload<N1::X, N2::Y>::type XY; in test_bin_op_overload()
45 typedef N4::BinOpOverload<N1::X, N1::X>::type XX; in test_bin_op_overload()
47 typedef N4::BinOpOverload<N2::Y, N2::Y>::type YY; in test_bin_op_overload()
49 typedef N4::BinOpOverload<N3::Z, N3::Z>::type ZZ; in test_bin_op_overload()
57 namespace N4 { namespace
65 typedef N4::UnaryOpOverload<N3::Z>::type UZ; in test_unary_op_overload()
|
| D | instantiate-call.cpp | 37 namespace N4 { namespace
46 template struct N4::call_f0<int, short&>;
47 template struct N4::call_f0<N1::X0, int&>;
|
| /external/llvm-project/clang/test/SemaTemplate/ |
| D | instantiate-expr-2.cpp | 25 namespace N4 { namespace
43 typedef N4::BinOpOverload<N1::X, N2::Y>::type XY; in test_bin_op_overload()
45 typedef N4::BinOpOverload<N1::X, N1::X>::type XX; in test_bin_op_overload()
47 typedef N4::BinOpOverload<N2::Y, N2::Y>::type YY; in test_bin_op_overload()
49 typedef N4::BinOpOverload<N3::Z, N3::Z>::type ZZ; in test_bin_op_overload()
57 namespace N4 { namespace
65 typedef N4::UnaryOpOverload<N3::Z>::type UZ; in test_unary_op_overload()
|
| D | instantiate-call.cpp | 37 namespace N4 { namespace
46 template struct N4::call_f0<int, short&>;
47 template struct N4::call_f0<N1::X0, int&>;
|
| /external/google-fruit/include/fruit/impl/meta/ |
| D | numeric_operations.h | 48 template <typename N0, typename N1, typename N2, typename N3, typename N4, typename... Ints>
49 struct apply<N0, N1, N2, N3, N4, Ints...> {
50 …using type = Int<N0::value + N1::value + N2::value + N3::value + N4::value + apply<Ints...>::type:…
|
| /external/llvm/include/llvm/ADT/ |
| D | StringSwitch.h | 132 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
136 const char (&S4)[N4], const T& Value) { in Cases() argument
142 (N4-1 == Str.size() && std::memcmp(S4, Str.data(), N4-1) == 0))) { in Cases()
|
| /external/clang/test/CodeGen/ |
| D | xcore-stringtype.c | 135 struct SB{int:4; int:2; int N4:4; int N2:2; unsigned int:4; signed int:4; member
164 union UB{int:4; int:2; int N4:4; int N2:2; unsigned int:4; signed int:4; member
|
| /external/llvm-project/clang/test/CodeGen/ |
| D | xcore-stringtype.c | 135 struct SB{int:4; int:2; int N4:4; int N2:2; unsigned int:4; signed int:4; member
164 union UB{int:4; int:2; int N4:4; int N2:2; unsigned int:4; signed int:4; member
|