/external/clang/test/SemaCXX/ |
warn-self-comparisons.cpp | 4 void f(int (&array1)[2], int (&array2)[2]) { 5 if (array1 == array2) { } // no warning
|
non-empty-class-size-zero.cpp | 7 int array2[0]; member in struct:X
|
c99-variable-length-array-cxx11.cpp | 22 POD array2[N]; // expected-warning{{variable length arrays are a C99 feature}} local
|
/external/clang/test/Sema/ |
self-comparison.c | 50 int array2[2]; local 65 return array1 == array2; // expected-warning{{array comparison always evaluates to false}} 66 return array1 != array2; // expected-warning{{array comparison always evaluates to true}} 71 return array1 < array2; // expected-warning{{array comparison always evaluates to a constant}} 72 return array1 <= array2; // expected-warning{{array comparison always evaluates to a constant}} 73 return array1 > array2; // expected-warning{{array comparison always evaluates to a constant}} 74 return array1 >= array2; // expected-warning{{array comparison always evaluates to a constant}}
|
vector-ops.c | 21 int array2[17]; local 23 (void)(array2[v2ua]); // expected-error{{array subscript is not an integer}}
|
/external/stlport/test/unit/ |
insert_test.cpp | 34 char const* array2 [] = { "amanda", "saskia", "carrie" }; local 40 itd = copy(array2, array2 + 3, insert_iterator<deque <char const*> >(names, i)); 58 char const* array2 [] = { "amanda", "saskia", "carrie" }; local 62 copy(array2, array2 + 3, inserter(names, i));
|
/ndk/tests/device/test-gnustl-full/unit/ |
insert_test.cpp | 34 char const* array2 [] = { "amanda", "saskia", "carrie" }; local 40 itd = copy(array2, array2 + 3, insert_iterator<deque <char const*> >(names, i)); 58 char const* array2 [] = { "amanda", "saskia", "carrie" }; local 62 copy(array2, array2 + 3, inserter(names, i));
|
/ndk/tests/device/test-stlport/unit/ |
insert_test.cpp | 34 char const* array2 [] = { "amanda", "saskia", "carrie" }; local 40 itd = copy(array2, array2 + 3, insert_iterator<deque <char const*> >(names, i)); 58 char const* array2 [] = { "amanda", "saskia", "carrie" }; local 62 copy(array2, array2 + 3, inserter(names, i));
|
/art/compiler/utils/ |
dedupe_set_test.cc | 53 ByteArray* array2; local 60 array2 = deduplicator.Add(self, test1); 61 ASSERT_EQ(array2, array1); 62 ASSERT_EQ(test1, *array2);
|
/external/clang/test/CXX/basic/basic.scope/basic.scope.pdecl/ |
p9.cpp | 19 int array2[X2<>::value? 1 : -1]; variable
|
/libcore/luni/src/test/java/org/apache/harmony/crypto/tests/javax/crypto/func/ |
KeyGeneratorThread.java | 43 byte[] array2 = k.getEncoded(); 46 if (array1[i] == array2[i]) { 61 array2 = k.getEncoded(); 63 if (array1[i] == array2[i]) {
|
/packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/util/ |
NameDistance.java | 65 byte[] array1, array2; 68 array2 = bytes1; 71 array2 = bytes2; 79 if (array1[i] != array2[i]) { 97 int length2 = array2.length; 125 if (!mMatchFlags2[j] && c1 == array2[j]) { 144 if (array1[i] != array2[j]) {
|
/external/eigen/test/eigen2/ |
eigen2_map.cpp | 20 Scalar* array2 = ei_aligned_new<Scalar>(size); local 25 Map<VectorType>(array2, size) = Map<VectorType>(array1, size); 28 VectorType ma2 = Map<VectorType, Aligned>(array2, size); 34 ei_aligned_delete(array2, size); 47 Scalar* array2 = ei_aligned_new<Scalar>(size); local 48 for(int i = 0; i < size; i++) array2[i] = Scalar(1); 53 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>((const Scalar*)array1, rows, cols); // test non-const-correctness support in eigen2 56 MatrixType ma2 = Map<MatrixType, Aligned>(array2, rows, cols); 62 ei_aligned_delete(array2, size); 74 Scalar* array2 = ei_aligned_new<Scalar>(size) local [all...] |
/external/eigen/test/ |
map.cpp | 25 Scalar* array2 = internal::aligned_new<Scalar>(size); local 30 Map<VectorType, Aligned>(array2, size) = Map<VectorType,Aligned>(array1, size); 33 VectorType ma2 = Map<VectorType, Aligned>(array2, size); 43 internal::aligned_delete(array2, size); 57 Scalar* array2 = internal::aligned_new<Scalar>(size); local 58 for(int i = 0; i < size; i++) array2[i] = Scalar(1); 63 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>(array1, rows, cols); 66 MatrixType ma2 = Map<MatrixType, Aligned>(array2, rows, cols); 72 internal::aligned_delete(array2, size); 85 Scalar* array2 = internal::aligned_new<Scalar>(size) local [all...] |
/external/valgrind/main/drd/tests/ |
custom_alloc.c | 60 int* array2 __attribute__((unused)) = custom_alloc(sizeof(int) * 10); local 61 array2 = 0; // leak
|
/libcore/luni/src/main/java/java/util/ |
Arrays.java | [all...] |
/external/chromium_org/v8/test/mjsunit/regress/ |
regress-crbug-263276.js | 33 var array2 = []; variable 34 array2.bar = true; 42 bad(array2); // Length is now 1. 43 bad(array2); // Length is now 2. 45 bad(array2); // Length is now 3. 46 assertEquals(3, array2.length);
|
/external/clang/test/CXX/temp/temp.decls/temp.friend/ |
p4.cpp | 37 int array2[sizeof(X3<int>)]; variable
|
/external/clang/test/Preprocessor/ |
line-directive.c | 93 extern char array2[\
|
/external/clang/test/SemaTemplate/ |
instantiate-declref-ice.cpp | 25 int array2[X0<int>::value == sizeof(int)? 1 : -1]; variable
|
/frameworks/base/core/java/com/android/internal/util/ |
ArrayUtils.java | 77 * @param array2 the second byte array 81 public static boolean equals(byte[] array1, byte[] array2, int length) { 86 if (array1 == array2) { 89 if (array1 == null || array2 == null || array1.length < length || array2.length < length) { 93 if (array1[i] != array2[i]) {
|
/packages/apps/ContactsCommon/src/com/android/contacts/common/format/ |
FormatUtils.java | 57 * Finds the earliest point in array1 at which the first part of array2 matches. For example, 60 public static int overlapPoint(char[] array1, char[] array2) { 61 if (array1 == null || array2 == null) { 65 int count2 = array2.length; 68 while (count1 > 0 && count2 > 0 && array1[count1 - 1] == array2[count2 - 1]) { 80 if (array1[i+j] != array2[j]) {
|
/packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/utils/ |
ResizableIntArrayTests.java | 39 int[] array2 = null, array3 = null; local 45 array2 = src.getPrimitiveArray(); 53 assertSame("array after add " + i, array2, src.getPrimitiveArray()); 113 final int[] array2 = src.getPrimitiveArray(); local 115 assertNotSame("array after reset", array, array2); 125 assertSame("array after add " + i, array2, src.getPrimitiveArray()); 142 final int[] array2 = src.getPrimitiveArray(); local 144 assertNotSame("array after larger setLength", array, array2); 145 assertEquals("array length after larger setLength", largerLength, array2.length); 159 assertSame("array after smaller setLength", array2, array3) 196 final int[] array2 = dst.getPrimitiveArray(); local [all...] |
/external/clang/test/CXX/temp/temp.decls/temp.class.spec/temp.class.order/ |
p2.cpp | 17 int array2[X<0, 0, int>::value == 2? 1 : -1]; variable
|
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/ |
sfinae-1.cpp | 18 int array2[is_class<char[3]>::value? -1 : 1]; variable
|