HomeSort by relevance Sort by last modified time
    Searched refs:arr1 (Results 1 - 25 of 149) sorted by null

1 2 3 4 5 6

  /frameworks/base/keystore/java/android/security/keystore/
ArrayUtils.java 39 public static byte[] concat(byte[] arr1, byte[] arr2) {
40 return concat(arr1, 0, (arr1 != null) ? arr1.length : 0,
44 public static byte[] concat(byte[] arr1, int offset1, int len1, byte[] arr2, int offset2,
49 return subarray(arr1, offset1, len1);
52 System.arraycopy(arr1, offset1, result, 0, len1);
70 public static int[] concat(int[] arr1, int[] arr2) {
71 if ((arr1 == null) || (arr1.length == 0))
    [all...]
  /external/jacoco/org.jacoco.core.test/src/org/jacoco/core/internal/analysis/
StringPoolTest.java 55 final String[] arr1 = pool.get(new String[0]); local
58 assertEquals(0, arr1.length);
59 assertSame(arr1, arr2);
64 final String[] arr1 = pool.get(new String[] { new String("JaCoCo") }); local
67 assertEquals(1, arr1.length);
68 assertEquals("JaCoCo", arr1[0]);
69 assertSame(arr1[0], arr2[0]);
  /frameworks/base/packages/WAPPushManager/tests/src/com/android/smspush/unitTests/
DataVerify.java 43 boolean arrayCompare(byte[] arr1, byte[] arr2) {
46 if (arr1 == null || arr2 == null) {
47 if (arr1 == null) {
48 Log.w(LOG_TAG, "arr1 is null");
55 if (arr1.length != arr2.length) {
59 for (i = 0; i < arr1.length; i++) {
60 if (arr1[i] != arr2[i]) return false;
  /external/libcxx/test/std/containers/sequences/vector/vector.cons/
assign_iter_iter.pass.cpp 30 int arr1[] = {42}; local
37 v.assign(It(arr1), It(std::end(arr1)));
53 v.assign(It(arr1), It(std::end(arr1)));
construct_iter_iter.pass.cpp 81 int arr1[] = {42}; local
87 std::vector<T> v(It(arr1), It(std::end(arr1)));
101 std::vector<T> v(It(arr1), It(std::end(arr1)));
120 int arr1[] = {42}; local
128 C v(It(arr1), It(std::end(arr1)));
141 C v(It(arr1), It(std::end(arr1)));
    [all...]
construct_iter_iter_alloc.pass.cpp 92 int arr1[] = {42}; local
100 std::vector<T> v(It(arr1), It(std::end(arr1)), a);
116 std::vector<T> v(It(arr1), It(std::end(arr1)), a);
133 int arr1[] = {42}; local
143 C v(It(arr1), It(std::end(arr1)), a);
158 C v(It(arr1), It(std::end(arr1)), a)
    [all...]
  /external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
p2.cpp 11 const int arr1[] = { 1, 2, 3, 4, 5 }; local
12 A<const int> a1 = f0(arr1);
  /external/libcxx/test/std/containers/sequences/list/list.cons/
input_iterator.pass.cpp 88 int arr1[] = {42}; local
94 std::list<T> v(It(arr1), It(std::end(arr1)));
112 std::list<T> v(It(arr1), It(std::end(arr1)));
135 int arr1[] = {42}; local
142 std::list<T> v(It(arr1), It(std::end(arr1)), a);
161 std::list<T> v(It(arr1), It(std::end(arr1)), a)
182 int arr1[] = {42}; local
215 int arr1[] = {42}; local
    [all...]
  /external/libcxx/test/std/containers/sequences/deque/deque.cons/
iter_iter_alloc.pass.cpp 61 int arr1[] = {42}; local
68 std::deque<T> v(It(arr1), It(std::end(arr1)), a);
83 std::deque<T> v(It(arr1), It(std::end(arr1)), a);
assign_iter_iter.pass.cpp 112 int arr1[] = {42}; local
119 v.assign(It(arr1), It(std::end(arr1)));
135 v.assign(It(arr1), It(std::end(arr1)));
iter_iter.pass.cpp 72 int arr1[] = {42}; local
78 std::deque<T> v(It(arr1), It(std::end(arr1)));
92 std::deque<T> v(It(arr1), It(std::end(arr1)));
  /external/llvm/unittests/ADT/
HashingTest.cpp 136 const int arr1[] = { 1, 2, 3 }; local
137 hash_code arr1_hash = hash_combine_range(begin(arr1), end(arr1));
139 EXPECT_EQ(arr1_hash, hash_combine_range(begin(arr1), end(arr1)));
141 const std::vector<int> vec(begin(arr1), end(arr1));
144 const std::list<int> list(begin(arr1), end(arr1));
147 const std::deque<int> deque(begin(arr1), end(arr1))
337 const int arr1[] = { i1, i2, i3, i4, i5, i6 }; local
    [all...]
  /external/clang/test/CodeGenCXX/
global-array-destruction.cpp 16 S arr1[3]; variable
  /external/clang/test/OpenMP/
target_parallel_for_simd_ast_print.cpp 65 T arr[N][10], arr1[N]; local
95 #pragma omp target parallel for simd default(none), private(argc,b) firstprivate(argv) shared (d) if(parallel:argc > 0) num_threads(N) proc_bind(master) reduction(+:c, arr1[argc]) reduction(max:e, arr[:N][0:10])
97 // CHECK: #pragma omp target parallel for simd default(none) private(argc,b) firstprivate(argv) shared(d) if(parallel: argc > 0) num_threads(N) proc_bind(master) reduction(+: c,arr1[argc]) reduction(max: e,arr[:N][0:10])
131 #pragma omp target parallel for simd map(arr1[0:10], i)
133 // CHECK: #pragma omp target parallel for simd map(tofrom: arr1[0:10],i)
155 #pragma omp target parallel for simd depend(in : argc, arr[i:argc], arr1[:])
157 // CHECK: #pragma omp target parallel for simd depend(in : argc,arr[i:argc],arr1[:])
179 #pragma omp target parallel for simd aligned(arr1:N-1)
181 // CHECK: #pragma omp target parallel for simd aligned(arr1: N - 1)
190 int arr[5][10], arr1[5] local
    [all...]
target_parallel_for_ast_print.cpp 65 T arr[N][10], arr1[N]; local
102 #pragma omp target parallel for default(none), private(argc,b) firstprivate(argv) shared (d) if (parallel:argc > 0) num_threads(N) proc_bind(master) reduction(+:c, arr1[argc]) reduction(max:e, arr[:N][0:10])
104 // CHECK-NEXT: #pragma omp target parallel for default(none) private(argc,b) firstprivate(argv) shared(d) if(parallel: argc > 0) num_threads(N) proc_bind(master) reduction(+: c,arr1[argc]) reduction(max: e,arr[:N][0:10])
132 #pragma omp target parallel for map(arr1[0:10], i)
133 // CHECK-NEXT: #pragma omp target parallel for map(tofrom: arr1[0:10],i)
152 #pragma omp target parallel for depend(in : argc, arr[i:argc], arr1[:])
153 // CHECK-NEXT: #pragma omp target parallel for depend(in : argc,arr[i:argc],arr1[:])
168 int arr[5][10], arr1[5]; local
189 #pragma omp target parallel for default(none), private(argc,b) firstprivate(argv) shared (d) if (parallel:argc > 0) num_threads(5) proc_bind(master) reduction(+:c, arr1[argc]) reduction(max:e, arr[:5][0:10])
191 // CHECK-NEXT: #pragma omp target parallel for default(none) private(argc,b) firstprivate(argv) shared(d) if(parallel: argc > 0) num_threads(5) proc_bind(master) reduction(+: c,arr1[argc]) reduction(max: e,arr[:5][0:10]
    [all...]
parallel_ast_print.cpp 143 T arr[C][10], arr1[C]; local
146 #pragma omp parallel default(none), private(argc,b) firstprivate(argv) shared (d) if (parallel:argc > 0) num_threads(C) copyin(S<T>::TS) proc_bind(master) reduction(+:c, arr1[argc]) reduction(max:e, arr[:C][0:10])
157 // CHECK-NEXT: int arr[5][10], arr1[5];
160 // CHECK-NEXT: #pragma omp parallel default(none) private(argc,b) firstprivate(argv) shared(d) if(parallel: argc > 0) num_threads(5) copyin(S<int>::TS) proc_bind(master) reduction(+: c,arr1[argc]) reduction(max: e,arr[:5][0:10])
168 // CHECK-NEXT: long arr[1][10], arr1[1];
171 // CHECK-NEXT: #pragma omp parallel default(none) private(argc,b) firstprivate(argv) shared(d) if(parallel: argc > 0) num_threads(1) copyin(S<long>::TS) proc_bind(master) reduction(+: c,arr1[argc]) reduction(max: e,arr[:1][0:10])
179 // CHECK-NEXT: T arr[C][10], arr1[C];
182 // CHECK-NEXT: #pragma omp parallel default(none) private(argc,b) firstprivate(argv) shared(d) if(parallel: argc > 0) num_threads(C) copyin(S<T>::TS) proc_bind(master) reduction(+: c,arr1[argc]) reduction(max: e,arr[:C][0:10])
194 int arr[10][argc], arr1[2]; local
201 #pragma omp parallel default(none), private(argc,b) firstprivate(argv) if (parallel: argc > 0) num_threads(ee) copyin(a) proc_bind(spread) reduction(| : c, d, arr1[argc]) reduction(* : e, arr[:10][0:argc]
    [all...]
  /art/benchmark/type-check/src/
TypeCheckBenchmark.java 19 Object[] arr = arr1;
55 Object[] arr = arr1;
132 Object[] arr1 = createArray(1); field in class:TypeCheckBenchmark
  /external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.array/
p3.cpp 93 extern int arr1[];
94 extern T arr1;
97 static_assert(sizeof(arr1) == 12, "");
  /external/clang/test/Sema/
vector-init.c 42 longlong2 arr1[2] = { test3_helper(), test3_helper() }; local
  /external/perf_data_converter/src/quipper/
test_utils.h 47 ArrayInputStream arr1(file1_contents.data(), file1_contents.size());
51 ASSERT_TRUE(TextFormat::Parse(&arr1, &proto1));
  /external/tensorflow/tensorflow/compiler/xla/
array2d_test.cc 158 Array2D<int> arr1 = {{1, 2}, {3, 4}, {5, 6}}; local
159 EXPECT_TRUE(arr0 == arr1);
160 EXPECT_FALSE(arr0 != arr1);
161 EXPECT_TRUE(arr1 == arr0);
162 EXPECT_FALSE(arr1 != arr0);
  /tools/apksig/src/main/java/com/android/apksig/internal/jar/
ManifestParser.java 207 private static byte[] concat(byte[] arr1, byte[] arr2, int offset2, int length2) {
208 byte[] result = new byte[arr1.length + length2];
209 System.arraycopy(arr1, 0, result, 0, arr1.length);
210 System.arraycopy(arr2, offset2, result, arr1.length, length2);
  /tools/apksig/src/test/java/com/android/apksig/internal/asn1/ber/
BerDataValueReaderTestBase.java 281 private static byte[] concat(byte[] arr1, byte[] arr2) {
282 byte[] result = new byte[arr1.length + arr2.length];
283 System.arraycopy(arr1, 0, result, 0, arr1.length);
284 System.arraycopy(arr2, 0, result, arr1.length, arr2.length);
  /frameworks/base/cmds/incident_helper/tests/
PageTypeInfoParser_test.cpp 64 int arr1[] = { 426, 279, 226, 1, 1, 1, 0, 0, 2, 2, 0}; local
66 mt1->add_free_pages_count(arr1[i]);
  /external/eigen/test/
evaluators.cpp 250 ArrayXXd arr1(6,6), arr2(6,6);
251 VERIFY_IS_APPROX_EVALUATOR(arr1, ArrayXXd::Constant(6,6, 3.0));
252 VERIFY_IS_APPROX_EVALUATOR(arr2, arr1);
258 VERIFY_IS_APPROX_EVALUATOR(arr2, arr1);
354 arr1.setRandom(6,6);
355 VERIFY_IS_APPROX_EVALUATOR(mat2, arr1.matrix());
357 VERIFY_IS_APPROX_EVALUATOR(mat2, (arr1 + 2).matrix());
359 mat2.array() = arr1 * arr1;
360 VERIFY_IS_APPROX(mat2, (arr1 * arr1).matrix())
    [all...]

Completed in 1627 milliseconds

1 2 3 4 5 6