HomeSort by relevance Sort by last modified time
    Searched refs:array1 (Results 1 - 24 of 24) sorted by null

  /external/webkit/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/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);
list_test.cpp 57 int array1 [] = { 9, 16, 36 }; local
60 list<int> l1(array1, array1 + 3);
97 int array1 [] = { 1, 16 }; local
100 list<int> l1(array1, array1 + 2);
150 int array1 [] = { 1, 3, 6, 7 }; local
153 list<int> l1(array1, array1 + 4);
set_test.cpp 77 int array1 [] = { 1, 3, 6, 7 }; local
78 s.insert(array1, array1 + 4);
125 int array1 [] = { 1, 3, 6, 7 }; local
126 set<int> s(array1, array1 + sizeof(array1) / sizeof(array1[0]));
vector_test.cpp 236 int array1 [] = { 1, 4, 25 }; local
239 vector<int> v(array1, array1 + 3);
  /dalvik/libcore/crypto/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]) {
  /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]) {
  /dalvik/libcore/luni/src/main/java/java/util/
Arrays.java     [all...]
  /packages/apps/Gallery3D/src/com/cooliris/media/
LongSparseArray.java 393 * @param array1
401 public static boolean equals(byte[] array1, byte[] array2, int length) {
402 if (array1 == array2) {
405 if (array1 == null || array2 == null || array1.length < length || array2.length < length) {
409 if (array1[i] != array2[i]) {
  /packages/apps/Email/tests/src/com/android/email/mail/
AddressUnitTests.java 559 private static boolean addressArrayEquals(Address[] array1, Address[] array2) {
560 if (array1.length != array2.length) {
563 for (int i = array1.length - 1; i >= 0; --i) {
564 if (!addressEquals(array1[i], array2[i])) {
  /dalvik/libcore/luni/src/test/java/tests/api/java/util/
EnumMapTest.java 476 Object[] array1 = new Object[10]; local
477 array1 = set.toArray();
478 assertEquals("Wrong length", 2, array1.length); //$NON-NLS-1$
483 array1 = new Object[10];
484 array1 = set.toArray(array1);
485 assertEquals("Wrong length", 10, array1.length); //$NON-NLS-1$
488 assertNull("Should be null", array1[2]); //$NON-NLS-1$
    [all...]
  /cts/tests/tests/content/src/android/content/res/cts/
ResourcesTest.java 626 int[]array1 = mResources.getIntArray(R.array.strings); local
629 checkArrayEqual(expectedArray1, array1);
634 private void checkArrayEqual(int[] array1, int[] array2) {
636 assertEquals(array1.length, array2.length);
637 for (int i = 0; i < array1.length; i++) {
638 assertEquals(array1[i], array2[i]);
  /external/icu4c/i18n/unicode/
dtfmtsym.h 666 * @param array1 one array to be compared with.
672 static UBool arrayCompare(const UnicodeString* array1,
  /external/dbus/dbus/
dbus-marshal-basic.c 1651 unsigned char array1[5] = { 3, 4, 0, 1, 9 }; local
    [all...]
  /external/icu4c/i18n/
dtfmtsym.cpp 429 DateFormatSymbols::arrayCompare(const UnicodeString* array1,
433 if (array1 == array2) return TRUE;
437 if (array1[count] != array2[count]) return FALSE;
    [all...]
  /external/gtest/test/
gtest_unittest.cc     [all...]
  /prebuilt/common/jfreechart/
jcommon-1.0.12.jar 
jfreechart-1.0.9.jar 
  /prebuilt/sdk/5/
android.jar 
  /prebuilt/sdk/7/
android.jar 
  /prebuilt/sdk/8/
android.jar 
  /prebuilt/common/ecj/
ecj.jar 

Completed in 727 milliseconds