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

1 2 3 4

  /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 7 int array2[0]; member in struct:X
  /external/webkit/Source/JavaScriptCore/tests/mozilla/js1_2/Array/
general2.js 43 array2 = [];
46 // this for loop populates array1 and array2 as follows:
48 // array2 = [size - 1, size - 2,...,4,3,2,1,0]
52 array2.push(size - 1 - i);
56 // that it should be similarly ordered to array2
65 // and array2
69 array2.unshift(array2.pop());
72 testcases[count++] = new TestCase( SECTION, "Array.push,pop,shift,unshift,slice,splice", true,String(array1) == String(array2));
74 array2.sort()
    [all...]
  /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}}
constant-builtins-2.c 56 int array2[(sizeof(array1)/sizeof(int)) == 2? 1 : -1]; variable
vector-init.c 13 float4 array2[2] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, variable
  /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));
  /external/clang/test/CXX/basic/basic.scope/basic.scope.pdecl/
p9.cpp 18 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]) {
  /sdk/sdkmanager/libs/sdklib/src/com/android/sdklib/util/
ArrayUtils.java 77 * @param array2 the second 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]) {
  /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/clang/test/Preprocessor/
line-directive.c 87 extern char array2[\
  /external/clang/test/SemaTemplate/
instantiate-declref-ice.cpp 24 int array2[X0<int>::value == sizeof(int)? 1 : -1]; variable
instantiate-expr-5.cpp 34 int array2[__builtin_offsetof(AnonymousUnion<int>, f) == 0? 1 : -1]; local
  /external/valgrind/main/memcheck/tests/
custom_alloc.c 66 int* array2 __attribute__((unused)) = custom_alloc(sizeof(int) * 10); local
67 array2 = 0; // leak
  /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) {
82 if (array1 == array2) {
85 if (array1 == null || array2 == null || array1.length < length || array2.length < length) {
89 if (array1[i] != array2[i]) {
  /packages/apps/Contacts/src/com/android/contacts/format/
FormatUtils.java 59 * Finds the earliest point in array1 at which the first part of array2 matches. For example,
62 public static int overlapPoint(char[] array1, char[] array2) {
63 if (array1 == null || array2 == null) {
67 int count2 = array2.length;
70 while (count1 > 0 && count2 > 0 && array1[count1 - 1] == array2[count2 - 1]) {
82 if (array1[i+j] != array2[j]) {
  /external/astl/tests/
test_algorithm.cpp 108 char array2[1] = { '\0' }; local
111 std::fill_n(array2, 1, sc);
112 EXPECT_TRUE(array2[0] == 1 );
  /external/clang/test/CXX/temp/temp.decls/temp.class.spec/temp.class.order/
p2.cpp 16 int array2[X<0, 0, int>::value == 2? 1 : -1]; variable
  /external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/
sfinae-1.cpp 17 int array2[is_class<char[3]>::value? -1 : 1]; variable

Completed in 1426 milliseconds

1 2 3 4