Home
last modified time | relevance | path

Searched refs:N3 (Results 1 – 25 of 157) sorted by relevance

1234567

/external/llvm-project/llvm/unittests/ADT/
DDirectedGraphTest.cpp96 DGTestNode N1, N2, N3; in TEST() local
97 DGTestEdge E1(N1), E2(N2), E3(N3); in TEST()
102 EXPECT_TRUE(DG.addNode(N3)); in TEST()
109 EXPECT_TRUE(DG.connect(N2, N3, E3)); in TEST()
110 EXPECT_TRUE(DG.connect(N3, N1, E1)); in TEST()
120 EXPECT_FALSE(DG.connect(N3, N1, E1)); in TEST()
126 EXPECT_NE(DG.findNode(N3), DG.end()); in TEST()
141 DGTestNode N1, N2, N3; in TEST() local
142 DGTestEdge E1(N1), E2(N2), E3(N3); in TEST()
145 DG.addNode(N3); in TEST()
[all …]
DWaymarkingTest.cpp87 const int N3 = 3 * N; in TEST() local
88 int **volatile A = createArray(N3); in TEST()
93 fillWaymarks(A + N2, A + N3, 0); in TEST()
94 verifyArrayValues(A, N3); in TEST()
98 verifyFollowWaymarks(A + N2, N3 - N2); in TEST()
100 freeArray(A, N3); in TEST()
111 const int N3 = N / 3; in TEST() local
122 int T3 = tag(A[N3]); in TEST()
123 delete ref(A[N3]); in TEST()
124 A[N3] = new int(N3); in TEST()
[all …]
/external/guava/guava-tests/test/com/google/common/graph/
DGraphsTest.java41 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 …]
DEndpointPairTest.java37 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 …]
/external/guava/android/guava-tests/test/com/google/common/graph/
DGraphsTest.java41 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 …]
DEndpointPairTest.java37 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 …]
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
DStringSwitch.h119 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/angle/third_party/vulkan-deps/glslang/src/Test/baseResults/
Dhlsl.namespace.frag.out15 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 …]
Dhlsl.typeGraphCopy.vert.out81 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/deqp-deps/glslang/Test/baseResults/
Dhlsl.namespace.frag.out15 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 …]
Dhlsl.typeGraphCopy.vert.out81 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/
DStringSwitch.h116 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/
Dinstantiate-expr-2.cpp19 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()
Dinstantiate-call.cpp23 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/llvm-project/clang/test/SemaTemplate/
Dinstantiate-expr-2.cpp19 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()
Dinstantiate-call.cpp23 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/
Darmv4-mont.pl299 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/rust/crates/ring/crypto/fipsmodule/bn/asm/
Darmv4-mont.pl301 my ($N0,$N1,$N2,$N3)=map("d$_",(4..7));
350 vld1.32 {$N0-$N3}, [$nptr]!
366 vmlal.u32 @ACC[6],$Ni,${N3}[0]
368 vmlal.u32 @ACC[7],$Ni,${N3}[1]
414 vmlal.u32 @ACC[6],$Ni,${N3}[0]
416 vmlal.u32 @ACC[7],$Ni,${N3}[1]
478 vld1.32 {$N0-$N3},[$nptr]!
509 vmlal.u32 @ACC[6],$Ni,${N3}[0]
510 vmlal.u32 @ACC[7],$Ni,${N3}[1]
545 vmlal.u32 @ACC[6],$Ni,${N3}[0]
[all …]
/external/rust/crates/itertools/benches/
Dtuple_combinations.rs7 const N3: usize = 86; constant
35 for i in 0..N3 { in tuple_comb_for3()
36 for j in (i + 1)..N3 { in tuple_comb_for3()
37 for k in (j + 1)..N3 { in tuple_comb_for3()
85 for (i, j, k) in (0..N3).tuple_combinations() { in tuple_comb_c3()
Dcombinations.rs7 const N3: usize = 86; constant
36 for i in 0..N3 { in comb_for3()
37 for j in (i + 1)..N3 { in comb_for3()
38 for k in (j + 1)..N3 { in comb_for3()
86 for combo in (0..N3).combinations(3) { in comb_c3()
/external/llvm-project/clang/test/CodeCompletion/
Dusing.cpp2 namespace N3 { } namespace
5 class N3;
14 int N3; local
/external/clang/test/CodeCompletion/
Dusing.cpp2 namespace N3 { } namespace
5 class N3;
14 int N3; local
/external/deqp-deps/glslang/Test/
Dhlsl.namespace.frag11 namespace N3 {
22 return N1::getVec() + N2::getVec() + N2::N3::getVec() + N2::N3::C1::getVec() * N2::gf;
/external/angle/third_party/vulkan-deps/glslang/src/Test/
Dhlsl.namespace.frag11 namespace N3 {
22 return N1::getVec() + N2::getVec() + N2::N3::getVec() + N2::N3::C1::getVec() * N2::gf;
/external/speex/libspeexdsp/
Dpreprocess.c394 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 …]

1234567