| /external/guava/android/guava-tests/test/com/google/common/graph/ |
| D | GraphsTest.java | 41 private static final Integer N3 = 3; field in GraphsTest
69 directedGraph.putEdge(N1, N3); in transitiveClosure_directedGraph()
70 directedGraph.putEdge(N2, N3); in transitiveClosure_directedGraph()
76 expectedClosure.putEdge(N1, N3); in transitiveClosure_directedGraph()
78 expectedClosure.putEdge(N2, N3); in transitiveClosure_directedGraph()
79 expectedClosure.putEdge(N3, N3); in transitiveClosure_directedGraph()
90 undirectedGraph.putEdge(N1, N3); in transitiveClosure_undirectedGraph()
91 undirectedGraph.putEdge(N2, N3); in transitiveClosure_undirectedGraph()
97 expectedClosure.putEdge(N1, N3); in transitiveClosure_undirectedGraph()
99 expectedClosure.putEdge(N2, N3); in transitiveClosure_undirectedGraph()
[all …]
|
| D | EndpointPairTest.java | 37 private static final Integer N3 = 3; field in EndpointPairTest
125 directedGraph.putEdge(N1, N3); in endpointPair_directedGraph()
131 EndpointPair.ordered(N1, N3), in endpointPair_directedGraph()
141 undirectedGraph.putEdge(N1, N3); in endpointPair_undirectedGraph()
146 EndpointPair.unordered(N1, N3), in endpointPair_undirectedGraph()
157 directedNetwork.addEdge(N1, N3, E13); in endpointPair_directedNetwork()
163 EndpointPair.ordered(N1, N3), in endpointPair_directedNetwork()
174 undirectedNetwork.addEdge(N1, N3, E13); in endpointPair_undirectedNetwork()
179 EndpointPair.unordered(N1, N3), in endpointPair_undirectedNetwork()
221 assertThat(edges).doesNotContain(EndpointPair.unordered(N3, N4)); // nodes not in graph in endpointPair_undirected_contains()
[all …]
|
| D | ConfigurableSimpleUndirectedGraphTest.java | 132 assertTrue(graph.putEdge(N2, N3)); in addEdge_nodesNotInGraph()
133 assertThat(graph.nodes()).containsExactly(N1, N5, N4, N2, N3).inOrder(); in addEdge_nodesNotInGraph()
135 assertThat(graph.adjacentNodes(N2)).containsExactly(N3); in addEdge_nodesNotInGraph()
136 assertThat(graph.adjacentNodes(N3)).containsExactly(N2); in addEdge_nodesNotInGraph()
|
| D | ConfigurableSimpleDirectedGraphTest.java | 132 assertTrue(graph.putEdge(N2, N3)); in addEdge_nodesNotInGraph()
133 assertThat(graph.nodes()).containsExactly(N1, N5, N4, N2, N3).inOrder(); in addEdge_nodesNotInGraph()
135 assertThat(graph.successors(N2)).containsExactly(N3); in addEdge_nodesNotInGraph()
136 assertThat(graph.successors(N3)).isEmpty(); in addEdge_nodesNotInGraph()
|
| D | ConfigurableSimpleDirectedNetworkTest.java | 102 addEdge(N2, N3, E23); in adjacentEdges_checkReturnedSetMutability()
201 assertTrue(network.addEdge(N2, N3, E23)); in addEdge_nodesNotInGraph()
202 assertThat(network.nodes()).containsExactly(N1, N5, N4, N2, N3).inOrder(); in addEdge_nodesNotInGraph()
206 assertThat(network.edgesConnecting(N2, N3)).containsExactly(E23); in addEdge_nodesNotInGraph()
208 assertThat(network.edgesConnecting(N3, N2)).isEmpty(); in addEdge_nodesNotInGraph()
|
| D | ConfigurableSimpleUndirectedNetworkTest.java | 102 addEdge(N2, N3, E23); in adjacentEdges_checkReturnedSetMutability()
201 assertTrue(network.addEdge(N2, N3, E23)); in addEdge_nodesNotInGraph()
202 assertThat(network.nodes()).containsExactly(N1, N5, N4, N2, N3).inOrder(); in addEdge_nodesNotInGraph()
206 assertThat(network.edgesConnecting(N2, N3)).containsExactly(E23); in addEdge_nodesNotInGraph()
207 assertThat(network.edgesConnecting(N3, N2)).containsExactly(E23); in addEdge_nodesNotInGraph()
|
| /external/guava/guava-tests/test/com/google/common/graph/ |
| D | GraphsTest.java | 41 private static final Integer N3 = 3; field in GraphsTest
69 directedGraph.putEdge(N1, N3); in transitiveClosure_directedGraph()
70 directedGraph.putEdge(N2, N3); in transitiveClosure_directedGraph()
76 expectedClosure.putEdge(N1, N3); in transitiveClosure_directedGraph()
78 expectedClosure.putEdge(N2, N3); in transitiveClosure_directedGraph()
79 expectedClosure.putEdge(N3, N3); in transitiveClosure_directedGraph()
90 undirectedGraph.putEdge(N1, N3); in transitiveClosure_undirectedGraph()
91 undirectedGraph.putEdge(N2, N3); in transitiveClosure_undirectedGraph()
97 expectedClosure.putEdge(N1, N3); in transitiveClosure_undirectedGraph()
99 expectedClosure.putEdge(N2, N3); in transitiveClosure_undirectedGraph()
[all …]
|
| D | EndpointPairTest.java | 37 private static final Integer N3 = 3; field in EndpointPairTest
125 directedGraph.putEdge(N1, N3); in endpointPair_directedGraph()
131 EndpointPair.ordered(N1, N3), in endpointPair_directedGraph()
141 undirectedGraph.putEdge(N1, N3); in endpointPair_undirectedGraph()
146 EndpointPair.unordered(N1, N3), in endpointPair_undirectedGraph()
157 directedNetwork.addEdge(N1, N3, E13); in endpointPair_directedNetwork()
163 EndpointPair.ordered(N1, N3), in endpointPair_directedNetwork()
174 undirectedNetwork.addEdge(N1, N3, E13); in endpointPair_undirectedNetwork()
179 EndpointPair.unordered(N1, N3), in endpointPair_undirectedNetwork()
221 assertThat(edges).doesNotContain(EndpointPair.unordered(N3, N4)); // nodes not in graph in endpointPair_undirected_contains()
[all …]
|
| D | ConfigurableSimpleDirectedGraphTest.java | 132 assertTrue(graph.putEdge(N2, N3)); in addEdge_nodesNotInGraph()
133 assertThat(graph.nodes()).containsExactly(N1, N5, N4, N2, N3).inOrder(); in addEdge_nodesNotInGraph()
135 assertThat(graph.successors(N2)).containsExactly(N3); in addEdge_nodesNotInGraph()
136 assertThat(graph.successors(N3)).isEmpty(); in addEdge_nodesNotInGraph()
|
| D | ConfigurableSimpleUndirectedGraphTest.java | 132 assertTrue(graph.putEdge(N2, N3)); in addEdge_nodesNotInGraph()
133 assertThat(graph.nodes()).containsExactly(N1, N5, N4, N2, N3).inOrder(); in addEdge_nodesNotInGraph()
135 assertThat(graph.adjacentNodes(N2)).containsExactly(N3); in addEdge_nodesNotInGraph()
136 assertThat(graph.adjacentNodes(N3)).containsExactly(N2); in addEdge_nodesNotInGraph()
|
| D | ConfigurableSimpleDirectedNetworkTest.java | 102 addEdge(N2, N3, E23); in adjacentEdges_checkReturnedSetMutability()
201 assertTrue(network.addEdge(N2, N3, E23)); in addEdge_nodesNotInGraph()
202 assertThat(network.nodes()).containsExactly(N1, N5, N4, N2, N3).inOrder(); in addEdge_nodesNotInGraph()
206 assertThat(network.edgesConnecting(N2, N3)).containsExactly(E23); in addEdge_nodesNotInGraph()
208 assertThat(network.edgesConnecting(N3, N2)).isEmpty(); in addEdge_nodesNotInGraph()
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| D | StringSwitch.h | 119 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3>
122 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
127 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
130 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
135 template <unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4,
139 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
145 template <unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4,
149 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
155 template <unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4,
159 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
[all …]
|
| /external/deqp-deps/glslang/Test/baseResults/ |
| D | hlsl.namespace.frag.out | 15 0:12 Function Definition: N2::N3::getVec( ( temp 4-component vector of float)
20 0:15 Function Definition: N2::N3::C1::getVec( ( temp 4-component vector of float)
35 0:22 Function Call: N2::N3::getVec( ( temp 4-component vector of float)
37 0:22 Function Call: N2::N3::C1::getVec( ( temp 4-component vector of float)
68 0:12 Function Definition: N2::N3::getVec( ( temp 4-component vector of float)
73 0:15 Function Definition: N2::N3::C1::getVec( ( temp 4-component vector of float)
88 0:22 Function Call: N2::N3::getVec( ( temp 4-component vector of float)
90 0:22 Function Call: N2::N3::C1::getVec( ( temp 4-component vector of float)
118 Name 13 "N2::N3::getVec("
120 Name 19 "N2::N3::C1::getVec("
[all …]
|
| D | hlsl.typeGraphCopy.vert.out | 81 Name 13 "N3"
82 MemberName 13(N3) 0 "t1"
83 MemberName 13(N3) 1 "t2"
84 MemberName 13(N3) 2 "t3"
93 MemberDecorate 13(N3) 0 Offset 0
94 MemberDecorate 13(N3) 1 Offset 32
95 MemberDecorate 13(N3) 2 Offset 48
108 13(N3): TypeStruct 12(N2) 11(N1) 12(N2)
109 14($Global): TypeStruct 13(N3)
|
| /external/angle/third_party/glslang/src/Test/baseResults/ |
| D | hlsl.namespace.frag.out | 15 0:12 Function Definition: N2::N3::getVec( ( temp 4-component vector of float)
20 0:15 Function Definition: N2::N3::C1::getVec( ( temp 4-component vector of float)
35 0:22 Function Call: N2::N3::getVec( ( temp 4-component vector of float)
37 0:22 Function Call: N2::N3::C1::getVec( ( temp 4-component vector of float)
68 0:12 Function Definition: N2::N3::getVec( ( temp 4-component vector of float)
73 0:15 Function Definition: N2::N3::C1::getVec( ( temp 4-component vector of float)
88 0:22 Function Call: N2::N3::getVec( ( temp 4-component vector of float)
90 0:22 Function Call: N2::N3::C1::getVec( ( temp 4-component vector of float)
118 Name 13 "N2::N3::getVec("
120 Name 19 "N2::N3::C1::getVec("
[all …]
|
| D | hlsl.typeGraphCopy.vert.out | 81 Name 13 "N3"
82 MemberName 13(N3) 0 "t1"
83 MemberName 13(N3) 1 "t2"
84 MemberName 13(N3) 2 "t3"
93 MemberDecorate 13(N3) 0 Offset 0
94 MemberDecorate 13(N3) 1 Offset 32
95 MemberDecorate 13(N3) 2 Offset 48
108 13(N3): TypeStruct 12(N2) 11(N1) 12(N2)
109 14($Global): TypeStruct 13(N3)
|
| /external/llvm/include/llvm/ADT/ |
| D | StringSwitch.h | 116 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3>
119 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
125 (N3-1 == Str.size() && std::memcmp(S3, Str.data(), N3-1) == 0))) { in Cases()
132 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
135 const char (&S2)[N2], const char (&S3)[N3], in Cases() argument
141 (N3-1 == Str.size() && std::memcmp(S3, Str.data(), N3-1) == 0) || in Cases()
|
| /external/clang/test/SemaTemplate/ |
| D | instantiate-expr-2.cpp | 19 namespace N3 { namespace
38 namespace N3 { namespace
49 typedef N4::BinOpOverload<N3::Z, N3::Z>::type ZZ; in test_bin_op_overload()
53 namespace N3 { namespace
54 eight_bytes operator-(::N3::Z);
65 typedef N4::UnaryOpOverload<N3::Z>::type UZ; in test_unary_op_overload()
|
| D | instantiate-call.cpp | 23 namespace N3 { namespace
33 template struct N3::call_f0<int, char&>; // expected-note{{instantiation}}
34 template struct N3::call_f0<N1::X0, int&>;
48 template struct N3::call_f0<int, short&>; // expected-note{{instantiation}}
|
| /external/boringssl/src/crypto/fipsmodule/bn/asm/ |
| D | armv4-mont.pl | 299 my ($N0,$N1,$N2,$N3)=map("d$_",(4..7));
348 vld1.32 {$N0-$N3}, [$nptr]!
364 vmlal.u32 @ACC[6],$Ni,${N3}[0]
366 vmlal.u32 @ACC[7],$Ni,${N3}[1]
412 vmlal.u32 @ACC[6],$Ni,${N3}[0]
414 vmlal.u32 @ACC[7],$Ni,${N3}[1]
476 vld1.32 {$N0-$N3},[$nptr]!
507 vmlal.u32 @ACC[6],$Ni,${N3}[0]
508 vmlal.u32 @ACC[7],$Ni,${N3}[1]
543 vmlal.u32 @ACC[6],$Ni,${N3}[0]
[all …]
|
| /external/clang/test/CodeCompletion/ |
| D | using.cpp | 2 namespace N3 { } namespace
5 class N3;
14 int N3; local
|
| /external/angle/third_party/glslang/src/Test/ |
| D | hlsl.namespace.frag | 11 namespace N3 {
22 return N1::getVec() + N2::getVec() + N2::N3::getVec() + N2::N3::C1::getVec() * N2::gf;
|
| /external/deqp-deps/glslang/Test/ |
| D | hlsl.namespace.frag | 11 namespace N3 {
22 return N1::getVec() + N2::getVec() + N2::N3::getVec() + N2::N3::C1::getVec() * N2::gf;
|
| /external/speex/libspeexdsp/ |
| D | preprocess.c | 394 int N, N3, N4, M; in speex_preprocess_state_init() local
422 N3 = 2*N - st->frame_size; in speex_preprocess_state_init()
423 N4 = st->frame_size - N3; in speex_preprocess_state_init()
466 st->inbuf = (spx_word16_t*)speex_alloc(N3*sizeof(spx_word16_t)); in speex_preprocess_state_init()
467 st->outbuf = (spx_word16_t*)speex_alloc(N3*sizeof(spx_word16_t)); in speex_preprocess_state_init()
469 conj_window(st->window, 2*N3); in speex_preprocess_state_init()
470 for (i=2*N3;i<2*st->ps_size;i++) in speex_preprocess_state_init()
475 for (i=N3-1;i>=0;i--) in speex_preprocess_state_init()
477 st->window[i+N3+N4]=st->window[i+N3]; in speex_preprocess_state_init()
478 st->window[i+N3]=1; in speex_preprocess_state_init()
[all …]
|
| /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:…
|