Home
last modified time | relevance | path

Searched refs:arr2 (Results 1 – 25 of 79) sorted by relevance

1234

/external/libcxx/test/std/containers/sequences/list/list.cons/
Dinput_iterator.pass.cpp89 int arr2[] = {1, 101, 42}; in test_emplacable_concept() local
99 std::list<T> v(It(arr2), It(std::end(arr2))); in test_emplacable_concept()
117 std::list<T> v(It(arr2), It(std::end(arr2))); in test_emplacable_concept()
136 int arr2[] = {1, 101, 42}; in test_emplacable_concept_with_alloc() local
147 std::list<T> v(It(arr2), It(std::end(arr2)), a); in test_emplacable_concept_with_alloc()
166 std::list<T> v(It(arr2), It(std::end(arr2)), a); in test_emplacable_concept_with_alloc()
183 int arr2[] = {1, 101, 42}; in test_ctor_under_alloc() local
193 C v(It(arr2), It(std::end(arr2))); in test_ctor_under_alloc()
205 C v(It(arr2), It(std::end(arr2))); in test_ctor_under_alloc()
214 int arr2[] = {1, 101, 42}; in test_ctor_under_alloc_with_alloc() local
[all …]
/external/deqp/framework/delibs/decpp/
DdePoolArray.cpp90 PoolArray<int> arr2(&pool); in intArrayTest() local
91 arr2.resize(1500); in intArrayTest()
92 arr2.reserve(2000); in intArrayTest()
94 arr2[i] = i; in intArrayTest()
96 arr2.pushBack(i); in intArrayTest()
98 DE_TEST_ASSERT(arr2.size() == 5000); in intArrayTest()
101 int val = arr2[i]; in intArrayTest()
170 PoolArray<int, 32> arr2(&pool); in alignedIntArrayTest() local
171 arr2.resize(1500); in alignedIntArrayTest()
172 arr2.reserve(2000); in alignedIntArrayTest()
[all …]
/external/libcxx/test/libcxx/containers/sequences/vector/vector.cons/
Dconstruct_iter_iter.pass.cpp21 int arr2[] = {1, 101, 42}; in test_ctor_under_alloc() local
32 C v(arr2, arr2 + 3); in test_ctor_under_alloc()
46 C v(arr2, arr2 + 3); in test_ctor_under_alloc()
Dconstruct_iter_iter_alloc.pass.cpp22 int arr2[] = {1, 101, 42}; in test_ctor_under_alloc() local
34 C v(arr2, arr2 + 3, a); in test_ctor_under_alloc()
49 C v(arr2, arr2 + 3, a); in test_ctor_under_alloc()
/external/libcxx/test/std/containers/sequences/vector/vector.cons/
Dassign_iter_iter.pass.cpp31 int arr2[] = {1, 101, 42}; in test_emplaceable_concept() local
42 v.assign(It(arr2), It(std::end(arr2))); in test_emplaceable_concept()
59 v.assign(It(arr2), It(std::end(arr2))); in test_emplaceable_concept()
Dconstruct_iter_iter.pass.cpp82 int arr2[] = {1, 101, 42}; in emplaceable_concept_tests() local
91 std::vector<T> v(It(arr2), It(std::end(arr2))); in emplaceable_concept_tests()
106 std::vector<T> v(It(arr2), It(std::end(arr2))); in emplaceable_concept_tests()
121 int arr2[] = {1, 101, 42}; in test_ctor_under_alloc() local
131 C v(It(arr2), It(std::end(arr2))); in test_ctor_under_alloc()
Dconstruct_iter_iter_alloc.pass.cpp93 int arr2[] = {1, 101, 42}; in emplaceable_concept_tests() local
104 std::vector<T> v(It(arr2), It(std::end(arr2)), a); in emplaceable_concept_tests()
121 std::vector<T> v(It(arr2), It(std::end(arr2)), a); in emplaceable_concept_tests()
134 int arr2[] = {1, 101, 42}; in test_ctor_under_alloc() local
146 C v(It(arr2), It(std::end(arr2)), a); in test_ctor_under_alloc()
/external/jacoco/org.jacoco.core.test/src/org/jacoco/core/internal/analysis/
DStringPoolTest.java56 final String[] arr2 = pool.get(new String[0]); in testGetEmptyArray() local
59 assertSame(arr1, arr2); in testGetEmptyArray()
65 final String[] arr2 = pool.get(new String[] { new String("JaCoCo") }); in testGetArray() local
69 assertSame(arr1[0], arr2[0]); in testGetArray()
/external/pdfium/core/fpdfapi/parser/
Dcpdf_array_unittest.cpp98 std::unique_ptr<CPDF_Array> arr2 = ToArray(arr->Clone()); in TEST() local
99 ASSERT_EQ(arr->GetCount(), arr2->GetCount()); in TEST()
102 EXPECT_NE(arr->GetObjectAt(i), arr2->GetObjectAt(i)); in TEST()
103 EXPECT_EQ(arr->GetIntegerAt(i), arr2->GetIntegerAt(i)); in TEST()
133 std::unique_ptr<CPDF_Array> arr2 = ToArray(arr->CloneDirectObject()); in TEST() local
134 ASSERT_EQ(arr->GetCount(), arr2->GetCount()); in TEST()
138 CPDF_Array* arr2_elem = arr2->GetObjectAt(i)->AsArray(); in TEST()
168 arr2->GetObjectAt(i)->AsArray()->GetIntegerAt(j)); in TEST()
/external/libcxx/test/std/containers/sequences/deque/deque.cons/
Diter_iter_alloc.pass.cpp62 int arr2[] = {1, 101, 42}; in test_emplacable_concept() local
72 std::deque<T> v(It(arr2), It(std::end(arr2)), a); in test_emplacable_concept()
88 std::deque<T> v(It(arr2), It(std::end(arr2)), a); in test_emplacable_concept()
Diter_iter.pass.cpp73 int arr2[] = {1, 101, 42}; in test_emplacable_concept() local
82 std::deque<T> v(It(arr2), It(std::end(arr2))); in test_emplacable_concept()
97 std::deque<T> v(It(arr2), It(std::end(arr2))); in test_emplacable_concept()
Dassign_iter_iter.pass.cpp113 int arr2[] = {1, 101, 42}; in test_emplacable_concept() local
124 v.assign(It(arr2), It(std::end(arr2))); in test_emplacable_concept()
141 v.assign(It(arr2), It(std::end(arr2))); in test_emplacable_concept()
/external/llvm/test/Instrumentation/AddressSanitizer/
Dstack_layout.ll31 %arr2.ptr = bitcast [20 x i8]* %YYY to i8*
32 store volatile i8 0, i8* %arr2.ptr
52 %arr2.ptr = bitcast [55 x i8]* %BBB to i8*
53 store volatile i8 0, i8* %arr2.ptr
74 %arr2.ptr = bitcast [128 x i8]* %BBB to i8*
75 store volatile i8 0, i8* %arr2.ptr
/external/clang/test/CodeGenCXX/
Dtemplate-instantiation.cpp166 static const int arr2[]; member
175 template <typename T> const int S<T>::arr2[] = { 1, 2, kBar }; // no side effects member in PR10001::S<T>
177 template <typename T> const int S<T>::y = sizeof(arr2) / sizeof(arr2[0]);
/external/clang/test/Sema/
Ddesignated-initializers.c181 u_short arr2[3]; member
184 const union wibble wobble = { .arr2[0] = 0xffff,
185 .arr2[1] = 0xffff,
186 .arr2[2] = 0xffff };
188 const union wibble wobble2 = { .arr2 = {4, 5, 6}, 7 }; // expected-warning{{excess elements in unio…
/external/tensorflow/tensorflow/compiler/xla/
Darray2d_test.cc164 Array2D<int> arr2 = {{1, 2}, {3, 4}, {5, 6}, {7, 8}}; in TEST() local
165 EXPECT_TRUE(arr0 != arr2); in TEST()
166 EXPECT_FALSE(arr0 == arr2); in TEST()
167 EXPECT_TRUE(arr2 != arr0); in TEST()
168 EXPECT_FALSE(arr2 == arr0); in TEST()
/external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.array/
Dp3.cpp95 extern T arr2; in f()
96 extern int arr2[]; in f()
98 static_assert(sizeof(arr2) == 12, ""); in f()
101 static_assert(sizeof(arr2) == 13, ""); // expected-error {{failed}} in f()
/external/llvm/test/CodeGen/Thumb/
Dstack-access.ll23 %arr2 = alloca [1024 x i8], align 1
30 store [1024 x i8]* %arr2, [1024 x i8]** %p, align 4
95 %arr2 = alloca [224 x i32], align 4
109 %arr2idx1 = getelementptr inbounds [224 x i32], [224 x i32]* %arr2, i32 0, i32 0
112 ; %arr2 is in range, but this element of it is not
114 %arr2idx2 = getelementptr inbounds [224 x i32], [224 x i32]* %arr2, i32 0, i32 32
/external/eigen/test/
Devaluators.cpp250 ArrayXXd arr1(6,6), arr2(6,6); in test_evaluators() local
252 VERIFY_IS_APPROX_EVALUATOR(arr2, arr1); in test_evaluators()
257 arr2.resize(9,9); in test_evaluators()
258 VERIFY_IS_APPROX_EVALUATOR(arr2, arr1); in test_evaluators()
356 VERIFY_IS_APPROX_EVALUATOR(arr2, mat1.array()); in test_evaluators()
358 VERIFY_IS_APPROX_EVALUATOR(arr2, mat1.array() + 2); in test_evaluators()
361 arr2.matrix() = MatrixXd::Identity(6,6); in test_evaluators()
362 VERIFY_IS_APPROX(arr2, MatrixXd::Identity(6,6).array()); in test_evaluators()
365 VERIFY_IS_APPROX_EVALUATOR(arr2, arr1.reverse()); in test_evaluators()
366 VERIFY_IS_APPROX_EVALUATOR(arr2, arr1.colwise().reverse()); in test_evaluators()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/Instrumentation/AddressSanitizer/
Dstack_layout.ll35 %arr2.ptr = bitcast [20 x i8]* %YYY to i8*
36 store volatile i8 0, i8* %arr2.ptr
57 %arr2.ptr = bitcast [55 x i8]* %BBB to i8*
58 store volatile i8 0, i8* %arr2.ptr
80 %arr2.ptr = bitcast [128 x i8]* %BBB to i8*
81 store volatile i8 0, i8* %arr2.ptr
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/Thumb/
Dstack-access.ll23 %arr2 = alloca [1024 x i8], align 1
30 store volatile [1024 x i8]* %arr2, [1024 x i8]** %p, align 4
97 %arr2 = alloca [224 x i32], align 4
111 %arr2idx1 = getelementptr inbounds [224 x i32], [224 x i32]* %arr2, i32 0, i32 0
114 ; %arr2 is in range, but this element of it is not
118 %arr2idx2 = getelementptr inbounds [224 x i32], [224 x i32]* %arr2, i32 0, i32 32
/external/llvm/test/CodeGen/ARM/
Dmemfunc.ll139 %arr2 = alloca [9 x i8], align 1
140 %2 = bitcast [9 x i8]* %arr2 to i8*
178 %arr2 = alloca [7 x i8], align 1
179 %2 = bitcast [7 x i8]* %arr2 to i8*
217 %arr2 = alloca [9 x i8], align 1
218 %2 = getelementptr inbounds [9 x i8], [9 x i8]* %arr2, i32 0, i32 4
256 %arr2 = alloca [13 x i8], align 1
257 %2 = getelementptr inbounds [13 x i8], [13 x i8]* %arr2, i32 0, i32 1
295 %arr2 = alloca [13 x i8], align 1
296 %2 = getelementptr inbounds [13 x i8], [13 x i8]* %arr2, i32 0, i32 %i
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/ARM/
Dmemfunc.ll139 %arr2 = alloca [9 x i8], align 1
140 %2 = bitcast [9 x i8]* %arr2 to i8*
178 %arr2 = alloca [7 x i8], align 1
179 %2 = bitcast [7 x i8]* %arr2 to i8*
217 %arr2 = alloca [9 x i8], align 1
218 %2 = getelementptr inbounds [9 x i8], [9 x i8]* %arr2, i32 0, i32 4
256 %arr2 = alloca [13 x i8], align 1
257 %2 = getelementptr inbounds [13 x i8], [13 x i8]* %arr2, i32 0, i32 1
295 %arr2 = alloca [13 x i8], align 1
296 %2 = getelementptr inbounds [13 x i8], [13 x i8]* %arr2, i32 0, i32 %i
[all …]
/external/llvm/test/CodeGen/X86/
Dlea-opt.ll8 @arr2 = external global [65 x %struct.anon2], align 16
103 …%a = getelementptr inbounds [65 x %struct.anon2], [65 x %struct.anon2]* @arr2, i64 0, i64 %x, i32 2
105 …%b = getelementptr inbounds [65 x %struct.anon2], [65 x %struct.anon2]* @arr2, i64 0, i64 %x, i32 0
129 ; CHECK: leaq arr2+132([[REG1]]), [[REG2:%[a-z]+]]
130 ; CHECK: leaq arr2([[REG1]]), [[REG3:%[a-z]+]]
137 ; DISABLED: movl arr2+132([[REG1]]), {{.*}}
138 ; DISABLED: addl arr2([[REG1]]), {{.*}}
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/
DHashingTest.cpp150 const int arr2[] = { 3, 2, 1 }; in TEST() local
151 hash_code arr2_hash = hash_combine_range(begin(arr2), end(arr2)); in TEST()
352 const size_t arr2[] = { s1, s2, s3 }; in TEST() local
353 EXPECT_EQ(hash_combine_range(begin(arr2), end(arr2)), in TEST()

1234