HomeSort by relevance Sort by last modified time
    Searched full:array2 (Results 1 - 25 of 86) 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/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));
list_test.cpp 58 int array2 [] = { 1, 4 }; local
61 list<int> l2(array2, array2 + 2);
98 int array2 [] = { 4, 9 }; local
101 list<int> l2(array2, array2 + 2);
151 int array2 [] = { 2, 4 }; local
154 list<int> l2(array2, array2 + 2);
  /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));
list_test.cpp 58 int array2 [] = { 1, 4 }; local
61 list<int> l2(array2, array2 + 2);
98 int array2 [] = { 4, 9 }; local
101 list<int> l2(array2, array2 + 2);
151 int array2 [] = { 2, 4 }; local
154 list<int> l2(array2, array2 + 2);
  /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));
list_test.cpp 58 int array2 [] = { 1, 4 }; local
61 list<int> l2(array2, array2 + 2);
98 int array2 [] = { 4, 9 }; local
101 list<int> l2(array2, array2 + 2);
151 int array2 [] = { 2, 4 }; local
154 list<int> l2(array2, array2 + 2);
  /external/clang/test/CodeGen/
debug-info-iv.c 5 static void test_indvars(int *Array1, int Array2[100][200]) {
7 Array1[1] = Array2[3][6] = 12345;
17 Array2[i][j/3] = Array2[i][i];
  /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/dbus/test/data/valid-messages/
recursive-types.message 70 LENGTH Array2
71 START_LENGTH Array2
87 END_LENGTH Array2
  /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/webkit/LayoutTests/fast/xpath/py-dom-xpath/
axes.html 11 function arraysAreEqual(array1, array2) {
13 if ( (!array1[0]) || (!array2[0]) ) { // If either is not an array
16 if (array1.length != array2.length) {
26 // Go through array2 - if same tag missing in "tagged" array, not equal
27 for (var i = 0; i < array2.length; i++) {
28 key = (typeof array2[i]) + "~" + array2[i];
31 // Subtract to keep track of # of appearances in array2
37 // number of times in array2, so the arrays are equal.
  /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/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/
ResizableIntArrayTests.java 35 int[] array2 = null, array3 = null; local
41 array2 = src.getPrimitiveArray();
49 assertSame("array after add " + i, array2, src.getPrimitiveArray());
109 final int[] array2 = src.getPrimitiveArray(); local
111 assertNotSame("array after reset", array, array2);
121 assertSame("array after add " + i, array2, src.getPrimitiveArray());
138 final int[] array2 = src.getPrimitiveArray(); local
140 assertNotSame("array after larger setLength", array, array2);
141 assertEquals("array length after larger setLength", largerLength, array2.length);
155 assertSame("array after smaller setLength", array2, array3)
192 final int[] array2 = dst.getPrimitiveArray(); local
    [all...]
  /external/clang/test/CXX/basic/basic.scope/basic.scope.pdecl/
p9.cpp 18 int array2[X2<>::value? 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
  /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
  /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]) {
  /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]) {
  /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

Completed in 639 milliseconds

1 2 3 4