| /external/clang/test/SemaCXX/ |
| warn-self-comparisons.cpp | 3 void f(int (&array1)[2], int (&array2)[2]) {
4 if (array1 == array2) { } // no warning
|
| non-empty-class-size-zero.cpp | 6 int array1[0]; member in struct:X
|
| /external/clang/test/Lexer/ |
| utf8-char-literal.cpp | 4 int array1['?' != u'\xf1'? 1 : -1]; variable
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/js1_2/Array/ |
| general1.js | 41 var array1 = []; variable
43 array1.push(123); //array1 = [123]
44 array1.push("dog"); //array1 = [123,dog]
45 array1.push(-99); //array1 = [123,dog,-99]
46 array1.push("cat"); //array1 = [123,dog,-99,cat]
47 testcases[count++] = new TestCase( SECTION, "array1.pop()", array1.pop(),'cat')
[all...] |
| general2.js | 42 array1 = new Array();
46 // this for loop populates array1 and array2 as follows:
47 // array1 = [0,1,2,3,4,....,size - 2,size - 1]
51 array1.push(i);
55 // the following for loop reverses the order of array1 so
57 for (i = array1.length; i > 0; i--)
59 array3 = array1.slice(1,i);
60 array1.splice(1,i-1);
61 array1 = array3.concat(array1);
[all...] |
| /external/clang/test/Sema/ |
| self-comparison.c | 49 int array1[2]; local
55 return array1 == array1; // expected-warning{{self-comparison always evaluates to true}}
56 return array1 != array1; // expected-warning{{self-comparison always evaluates to false}}
57 return array1 < array1; // expected-warning{{self-comparison always evaluates to false}}
58 return array1 <= array1; // expected-warning{{self-comparison always evaluates to true}}
59 return array1 > array1; // expected-warning{{self-comparison always evaluates to false}
[all...] |
| constant-builtins-2.c | 55 int array1[__builtin_strlen("ab\0cd")]; variable
56 int array2[(sizeof(array1)/sizeof(int)) == 2? 1 : -1];
|
| vector-ops.c | 20 int array1[v2ua]; // expected-error{{size of array has non-integer type 'v2u'}} local
|
| /external/stlport/test/unit/ |
| insert_test.cpp | 33 char const* array1 [] = { "laurie", "jennifer", "leisa" }; local
36 deque<char const*> names(array1, array1 + 3);
49 copy(array1, array1 + 3, itd);
57 char const* array1 [] = { "laurie", "jennifer", "leisa" }; local
60 deque<char const*> names(array1, array1 + 3);
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| insert_test.cpp | 33 char const* array1 [] = { "laurie", "jennifer", "leisa" }; local
36 deque<char const*> names(array1, array1 + 3);
49 copy(array1, array1 + 3, itd);
57 char const* array1 [] = { "laurie", "jennifer", "leisa" }; local
60 deque<char const*> names(array1, array1 + 3);
|
| /ndk/tests/device/test-stlport/unit/ |
| insert_test.cpp | 33 char const* array1 [] = { "laurie", "jennifer", "leisa" }; local
36 deque<char const*> names(array1, array1 + 3);
49 copy(array1, array1 + 3, itd);
57 char const* array1 [] = { "laurie", "jennifer", "leisa" }; local
60 deque<char const*> names(array1, array1 + 3);
|
| /libcore/luni/src/test/java/org/apache/harmony/crypto/tests/javax/crypto/func/ |
| KeyGeneratorThread.java | 41 byte[] array1 = k.getEncoded();
45 for (int i = 0; i < array1.length; i++) {
46 if (array1[i] == array2[i]) {
50 if (matches > array1.length / 2) {
57 array1 = k.getEncoded();
62 for (int i = 0; i < array1.length; i++) {
63 if (array1[i] == array2[i]) {
|
| /packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
| NameDistance.java | 65 byte[] array1, array2;
69 array1 = bytes2;
72 array1 = bytes1;
75 int length1 = array1.length;
78 for (int i = 0; i < array1.length; i++) {
79 if (array1[i] != array2[i]) {
112 byte c1 = array1[i];
144 if (array1[i] != array2[j]) {
|
| /external/clang/test/CXX/basic/basic.scope/basic.scope.pdecl/ |
| p9.cpp | 13 int array1[X1<>::value? 1 : -1]; variable
|
| /external/clang/test/CXX/temp/temp.decls/temp.friend/ |
| p4.cpp | 21 int array1[sizeof(X2<float>)]; // expected-note{{instantiation of}} variable
|
| /external/clang/test/PCH/Inputs/ |
| arc.h | 18 typedef int array1[sizeof((__bridge CFTypeRef)CreateSomething())]; typedef
|
| /external/clang/test/SemaTemplate/ |
| instantiate-enum.cpp | 11 int array1[adder<long, 3, 4>::value == 7? 1 : -1]; variable
|
| instantiate-declref-ice.cpp | 20 int array1[X0<int>::value == sizeof(int)? 1 : -1]; variable
|
| instantiate-expr-5.cpp | 33 int array1[__builtin_offsetof(AnonymousUnion<T>, f) == 0? 1 : -1]; local
|
| /frameworks/base/core/java/com/android/internal/util/ |
| ArrayUtils.java | 77 * @param array1 the first byte array
82 public static boolean equals(byte[] array1, byte[] array2, int length) {
83 if (array1 == array2) {
86 if (array1 == null || array2 == null || array1.length < length || array2.length < length) {
90 if (array1[i] != array2[i]) {
|
| /sdk/sdkmanager/libs/sdklib/src/com/android/sdklib/util/ |
| ArrayUtils.java | 76 * @param array1 the first byte array
81 public static boolean equals(byte[] array1, byte[] array2, int length) {
82 if (array1 == array2) {
85 if (array1 == null || array2 == null || array1.length < length || array2.length < length) {
89 if (array1[i] != array2[i]) {
|
| /libcore/luni/src/main/java/java/util/ |
| Arrays.java | [all...] |
| /external/clang/test/CXX/temp/temp.decls/temp.class.spec/ |
| p6.cpp | 21 int array1[X0<int>::Inner0<int*>::value == 1? 1 : -1]; variable
75 int array1[Outer<int>::Inner<int, float>::value? -1 : 1]; member in namespace:rdar8651930
|
| /packages/apps/Contacts/src/com/android/contacts/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) {
64 int count1 = array1.length;
68 while (count1 > 0 && count2 > 0 && array1[count1 - 1] == array2[count2 - 1]) {
80 if (array1[i+j] != array2[j]) {
|
| /external/v8/test/mjsunit/regress/ |
| regress-swapelements.js | 37 var array1 = new Array(size);
41 array1.splice(0, 1);
48 array1[i] = new Item(i);
49 array1[i].toString = myToString;
51 array1.sort();
|
