HomeSort by relevance Sort by last modified time
    Searched defs:objArray (Results 26 - 33 of 33) sorted by null

12

  /libcore/luni/src/test/java/tests/api/java/util/
LinkedHashMapTest.java 42 Object[] objArray;
124 myMap.put(objArray2[counter], objArray[counter]);
253 for (int i = 0; i < objArray.length; i++)
255 .contains(objArray[i].toString()));
307 for (int i = 0; i < objArray.length; i++)
309 .contains(objArray[i]));
313 myLinkedHashMap.put(objArray2[i], objArray[i]);
509 hm.size() == (objArray.length + 2));
713 objArray = new Object[hmSize];
715 for (int i = 0; i < objArray.length; i++)
    [all...]
VectorTest.java 36 Object[] objArray;
119 myVector.size() == objArray.length);
120 for (int counter = 0; counter < objArray.length; counter++)
    [all...]
ArraysTest.java 41 Object[] objArray;
258 Arrays.binarySearch(objectArray, objArray[counter]) == counter);
285 objectArray[counter] = objArray[arraySize - counter - 1];
294 Arrays.binarySearch(objectArray, objArray[counter], comp) == arraySize
    [all...]
CollectionsTest.java 63 private Object[] objArray;
424 e.nextElement() == objArray[count++]);
426 count == objArray.length);
472 // assumes s, objArray are sorted
474 Collections.max(s) == objArray[objArray.length - 1]);
504 // assumes s, objArray are sorted
540 // assumes s, objArray are sorted
542 Collections.min(s) == objArray[0]);
571 // assumes s, objArray are sorte
    [all...]
  /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
CollectionsTest.java 72 static Object[] objArray;
76 objArray = new Object[1000];
78 for (int i = 0; i < objArray.length; i++) {
79 objArray[i] = new Integer(i);
402 objArray[count++]);
404 assertEquals("Enumeration missing elements: " + count, objArray.length,
440 // assumes s, objArray are sorted
442 objArray[objArray.length - 1]);
452 // assumes s, objArray are sorte
    [all...]
TreeMapTest.java 101 Object objArray[] = new Object[1000];
137 assertTrue("Map is incorrect size", myTreeMap.size() == objArray.length);
138 for (Object element : objArray) {
182 for (Object element : objArray) {
243 .containsValue(objArray[986]));
256 anEntrySet.size() == objArray.length);
419 ks.size() == objArray.length);
432 objArray[objArray.length - 1].toString()));
433 assertNotSame(objArray[objArray.length - 1].toString(), tm.lastKey())
    [all...]
ArraysTest.java 48 static Object[] objArray;
68 objArray = new Object[arraySize];
69 for (int i = 0; i < objArray.length; i++)
70 objArray[i] = new Integer(i);
270 Arrays.binarySearch(objectArray, objArray[counter]) == counter);
299 objectArray[counter] = objArray[arraySize - counter - 1];
308 Arrays.binarySearch(objectArray, objArray[counter], comp) == arraySize
    [all...]
TreeMapExtendTest.java 77 Object objArray[] = new Object[1000];
189 key = objArray[counter].toString();
203 key = objArray[100].toString();
215 key = objArray[109].toString();
229 key = objArray[counter].toString();
247 key = objArray[100].toString();
259 key = objArray[109].toString();
275 value = objArray[counter];
289 value = objArray[100];
301 value = objArray[109]
    [all...]

Completed in 1138 milliseconds

12