HomeSort by relevance Sort by last modified time
    Searched full:arr2 (Results 1 - 25 of 69) sorted by null

1 2 3

  /frameworks/base/keystore/java/android/security/keystore/
ArrayUtils.java 39 public static byte[] concat(byte[] arr1, byte[] arr2) {
41 arr2, 0, (arr2 != null) ? arr2.length : 0);
44 public static byte[] concat(byte[] arr1, int offset1, int len1, byte[] arr2, int offset2,
47 return subarray(arr2, offset2, len2);
53 System.arraycopy(arr2, offset2, result, len1, len2);
70 public static int[] concat(int[] arr1, int[] arr2) {
72 return arr2;
73 } else if ((arr2 == null) || (arr2.length == 0))
    [all...]
  /external/libweave/third_party/libuweave/src/
crypto_utils.c 8 const uint8_t* arr2,
12 diff |= arr1[i] ^ arr2[i];
crypto_utils.h 19 const uint8_t* arr2,
  /external/jacoco/org.jacoco.core.test/src/org/jacoco/core/internal/analysis/
StringPoolTest.java 56 final String[] arr2 = pool.get(new String[0]); local
59 assertSame(arr1, arr2);
65 final String[] arr2 = pool.get(new String[] { new String("JaCoCo") }); local
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) {
50 Log.w(LOG_TAG, "arr2 is null");
55 if (arr1.length != arr2.length) {
60 if (arr1[i] != arr2[i]) return false;
  /external/deqp/framework/delibs/decpp/
dePoolArray.cpp 90 PoolArray<int> arr2(&pool);
91 arr2.resize(1500);
92 arr2.reserve(2000);
94 arr2[i] = i;
96 arr2.pushBack(i);
98 DE_TEST_ASSERT(arr2.size() == 5000);
101 int val = arr2[i];
170 PoolArray<int, 32> arr2(&pool);
171 arr2.resize(1500);
172 arr2.reserve(2000)
    [all...]
  /external/llvm/test/CodeGen/Thumb/
stack-access.ll 23 %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/llvm/test/Instrumentation/AddressSanitizer/
stack_layout.ll 31 %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
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
Collections2Test.java 342 Object[] arr2 = new Object[20]; local
343 for (int i = 0; i < arr2.length; i++) {
344 arr2[i] = new Integer(100 + i);
349 Collections.addAll(c2, arr2);
351 c1.add(arr2[10]);
357 Collections.addAll(c2, arr2);
359 c1.add(arr2[10]);
365 Collections.addAll(c2, arr2);
367 c1.add(arr2[10]);
373 Collections.addAll(c2, arr2);
    [all...]
  /external/v8/test/mjsunit/
array-concat.js 201 var arr2 = [1,3]; variable
202 var r1 = [].concat(arr1, arr2); // [,2,1,3]
207 arr2.push("X");
210 var r2 = [].concat(arr1, arr2); // [undefined,2,1,3,"X"]
214 arr2.length = 2;
216 arr2[500000] = "X";
219 var r3 = [].concat(arr1, arr2); // [undefined,2,1,3,"X"]
  /external/valgrind/memcheck/tests/
origin6-fp.c 85 double r, **arr, **arr2, **arr3; local
88 arr2 = do3x3smooth( arr, nArr );
89 arr3 = do3x3smooth( arr2, nArr-2 );
  /external/llvm/test/CodeGen/ARM/
memfunc.ll 137 %arr2 = alloca [9 x i8], align 1
138 %2 = bitcast [9 x i8]* %arr2 to i8*
176 %arr2 = alloca [7 x i8], align 1
177 %2 = bitcast [7 x i8]* %arr2 to i8*
215 %arr2 = alloca [9 x i8], align 1
216 %2 = getelementptr inbounds [9 x i8], [9 x i8]* %arr2, i32 0, i32 4
254 %arr2 = alloca [13 x i8], align 1
255 %2 = getelementptr inbounds [13 x i8], [13 x i8]* %arr2, i32 0, i32 1
293 %arr2 = alloca [13 x i8], align 1
294 %2 = getelementptr inbounds [13 x i8], [13 x i8]* %arr2, i32 0, i32 %
    [all...]
  /external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.array/
p3.cpp 95 extern T arr2;
96 extern int arr2[];
98 static_assert(sizeof(arr2) == 12, "");
101 static_assert(sizeof(arr2) == 13, ""); // expected-error {{failed}}
  /external/clang/test/CodeGenCXX/
template-instantiation.cpp 166 static const int arr2[]; member in struct:PR10001::S
175 template <typename T> const int S<T>::arr2[] = { 1, 2, kBar }; // no side effects member in class:PR10001::S
177 template <typename T> const int S<T>::y = sizeof(arr2) / sizeof(arr2[0]);
  /external/clang/test/Sema/
vector-init.c 43 short4 arr2[2] = { test3_helper(), test3_helper() }; // expected-error 2 {{initializing 'short4' (vector of 4 'short' values) with an expression of incompatible type 'short8' (vector of 8 'short' values)}} local
designated-initializers.c 181 u_short arr2[3]; member in union:wibble
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 union initializer}}
  /external/clang/test/SemaObjC/
enum-fixed-type.m 33 int arr2[(sizeof(__typeof__(IntegerEnum)) == sizeof(__typeof__(long)))? 1 : -1];
  /external/llvm/test/CodeGen/AArch64/
arm64-alloca-frame-pointer-offset.ll 13 %arr2 = alloca [32 x i32], align 4
  /external/llvm/test/CodeGen/X86/
lea-opt.ll 7 @arr2 = external global [65 x %struct.anon2], align 16
95 %a = getelementptr inbounds [65 x %struct.anon2], [65 x %struct.anon2]* @arr2, i64 0, i64 %x, i32 2
97 %b = getelementptr inbounds [65 x %struct.anon2], [65 x %struct.anon2]* @arr2, i64 0, i64 %x, i32 0
119 ; CHECK: leaq arr2+132([[REG1]]), [[REG2:%[a-z]+]]
120 ; CHECK: leaq arr2([[REG1]]), [[REG3:%[a-z]+]]
  /libcore/luni/src/test/java/libcore/java/util/
OldCollectionsTest.java 515 Object[] arr2 = new Object[20]; local
516 for (int i = 0; i < arr2.length; i++) {
517 arr2[i] = new Integer(100 + i);
522 Collections.addAll(c2, arr2);
524 c1.add(arr2[10]);
530 Collections.addAll(c2, arr2);
532 c1.add(arr2[10]);
538 Collections.addAll(c2, arr2);
540 c1.add(arr2[10]);
546 Collections.addAll(c2, arr2);
    [all...]
  /external/clang/test/CXX/temp/temp.decls/temp.variadic/
sizeofpack.cpp 23 array<3> arr2 = make_array1<int>(1,array<5>(),0.1); local
45 array<2> arr2 = AAA<int, int>::make_array<int>(1,2); local
  /cts/tests/tests/util/src/android/util/cts/
EventLogTest.java 93 Object[] arr2 = (Object[]) events.get(2).getData(); local
94 assertEquals(2, arr2.length);
95 assertEquals(12345, arr2[0]);
96 assertEquals(max - 2 - 5 - 5, ((String) arr2[1]).length());
  /prebuilts/go/darwin-x86/test/bench/shootout/
k-nucleotide-parallel.go 129 var arr1, arr2 kNucArray
136 arr2 = sortedArray(count(str, 2))
152 printKnucs(arr2)
  /prebuilts/go/linux-x86/test/bench/shootout/
k-nucleotide-parallel.go 129 var arr1, arr2 kNucArray
136 arr2 = sortedArray(count(str, 2))
152 printKnucs(arr2)
  /external/opencv/cxcore/src/
cxmatrix.cpp 190 arrtype* arr2 = arr; \
195 arrtype t0 = arr2[0]; \
197 arr2[0] = t1; \
200 arr2++; \
203 while( arr2 != arr3 ); \
218 arrtype* arr2 = arr; \
221 for( ; arr2!=arr3; arr2+=3, \
224 arrtype t0 = arr2[0]; \
226 arr2[0] = t1;
    [all...]

Completed in 2416 milliseconds

1 2 3