Searched refs:objArray (Results 1 - 19 of 19) sorted by relevance

/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DEmptyStackExceptionTest.java25 Object[] objArray = new Object[10]; field in class:EmptyStackExceptionTest
34 for (int counter = 0; counter < objArray.length + 1; counter++)
47 for (int counter = 0; counter < objArray.length; counter++) {
48 objArray[counter] = new Integer(counter);
52 for (int counter = 0; counter < objArray.length; counter++) {
53 s.push(objArray[counter]);
62 objArray = null;
H A DTreeSetTest.java42 Object objArray[] = new Object[1000]; field in class:TreeSetTest
57 TreeSet myTreeSet = new TreeSet(Arrays.asList(objArray));
59 myTreeSet.size() == objArray.length);
60 for (int counter = 0; counter < objArray.length; counter++)
62 .contains(objArray[counter]));
89 for (int i = 0; i < objArray.length; i++)
90 myTreeSet.add(objArray[i]);
93 anotherTreeSet.size() == objArray.length);
94 for (int counter = 0; counter < objArray.length; counter++)
96 anotherTreeSet.contains(objArray[counte
[all...]
H A DHashSetTest.java37 Object[] objArray; field in class:HashSetTest
85 HashSet hs2 = new HashSet(Arrays.asList(objArray));
86 for (int counter = 0; counter < objArray.length; counter++)
88 .contains(objArray[counter]));
90 hs2.size() == objArray.length);
142 assertTrue("Returned false for valid object", hs.contains(objArray[90]));
200 assertTrue("Returned incorrect size", hs.size() == (objArray.length + 1));
221 objArray = new Object[1000];
222 for (int i = 0; i < objArray.length; i++) {
223 objArray[
[all...]
H A DTreeMapTest.java90 Object objArray[] = new Object[1000]; field in class:TreeMapTest
126 assertTrue("Map is incorrect size", myTreeMap.size() == objArray.length);
127 for (Object element : objArray) {
171 for (Object element : objArray) {
232 .containsValue(objArray[986]));
245 anEntrySet.size() == objArray.length);
408 ks.size() == objArray.length);
421 objArray[objArray.length - 1].toString()));
422 assertNotSame(objArray[objArra
[all...]
H A DLinkedListTest.java52 Object[] objArray; field in class:LinkedListTest
93 ll.get(51) == objArray[50] && (ll.get(52) == objArray[51]));
148 assertTrue("Manipulated elements < index", ll.get(i) == objArray[i]);
151 ll.get(i) == objArray[i - 50]);
154 ll.get(i) == objArray[i - 100]);
320 .contains(objArray[99]));
335 assertTrue("Returned incorrect element", ll.get(22) == objArray[22]);
351 assertEquals("Returned incorrect first element", ll.peek(), objArray[0]);
352 assertEquals("Peek remove the head (first element) of this list", ll.getFirst(), objArray[
[all...]
H A DLinkedHashSetTest.java34 Object[] objArray; field in class:LinkedHashSetTest
95 LinkedHashSet hs2 = new LinkedHashSet(Arrays.asList(objArray));
96 for (int counter = 0; counter < objArray.length; counter++)
98 .contains(objArray[counter]));
100 .size() == objArray.length);
154 assertTrue("Returned false for valid object", hs.contains(objArray[90]));
218 assertTrue("Returned incorrect size", hs.size() == (objArray.length + 1));
333 objArray = new Object[1000];
334 for (int i = 0; i < objArray.length; i++)
335 objArray[
[all...]
H A DIdentityHashMap2Test.java50 private Object[] objArray; field in class:IdentityHashMap2Test
93 myMap.put(objArray2[counter], objArray[counter]);
202 .containsValue(objArray[19]));
258 for (int i = 0; i < objArray.length; i++) {
362 m.remove(objArray[0]));
371 assertEquals("Returned incorrect size, ", (objArray.length), hm.size());
427 for (int i = 0; i < objArray.length; i++)
429 .contains(objArray[i]));
433 myIdentityHashMap.put(objArray2[i], objArray[i]);
435 values.remove(objArray[
[all...]
H A DArrayListTest.java35 Object[] objArray; field in class:ArrayListTest
73 ArrayList al = new ArrayList(Arrays.asList(objArray));
75 .size() == objArray.length);
76 for (int counter = 0; counter < objArray.length; counter++)
79 al.get(counter) == objArray[counter]);
104 alist.get(51) == objArray[50]
105 && (alist.get(52) == objArray[51]));
114 assertEquals(alist.get(1), objArray[0]);
115 assertEquals(alist.get(2), objArray[1]);
164 assertEquals(alist.get(size - 2), objArray[siz
[all...]
H A DCollectionsTest.java72 private Integer[] objArray; field in class:CollectionsTest
405 objArray[count++]);
407 assertEquals("Enumeration missing elements: " + count, objArray.length,
449 // assumes s, objArray are sorted
451 objArray[objArray.length - 1]);
477 // assumes s, objArray are sorted
489 // assumes s, objArray are sorted
491 objArray[0]);
497 // assumes s, objArray ar
[all...]
H A DHashMapTest.java94 Object[] objArray; field in class:HashMapTest
156 myMap.put(objArray2[counter], objArray[counter]);
354 for (int i = 0; i < objArray.length; i++)
356 .contains(objArray[i].toString()));
584 hm.size() == (objArray.length + 2));
595 for (int i = 0; i < objArray.length; i++)
597 .contains(objArray[i]));
601 myHashMap.put(objArray2[i], objArray[i]);
712 objArray = new Object[hmSize];
714 for (int i = 0; i < objArray
[all...]
H A DLinkedHashMapTest.java42 Object[] objArray; field in class:LinkedHashMapTest
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
[all...]
H A DTreeMapExtendTest.java75 Object objArray[] = new Object[1000]; field in class:TreeMapExtendTest
187 key = objArray[counter].toString();
201 key = objArray[100].toString();
213 key = objArray[109].toString();
227 key = objArray[counter].toString();
245 key = objArray[100].toString();
257 key = objArray[109].toString();
273 value = objArray[counter];
287 value = objArray[100];
299 value = objArray[10
[all...]
H A DIdentityHashMapTest.java57 Object[] objArray; field in class:IdentityHashMapTest
99 myMap.put(objArray2[counter], objArray[counter]);
191 .containsValue(objArray[19]));
248 for (int i = 0; i < objArray.length; i++) {
370 m.remove(objArray[0]));
393 assertEquals("Returned incorrect size, ", (objArray.length + 2), hm
462 objArray = new Object[hmSize];
464 for (int i = 0; i < objArray.length; i++) {
465 objArray[i] = new Integer(i);
467 objArray2[i] = new String(objArray[
[all...]
H A DArraysTest.java48 Object[] objArray; field in class:ArraysTest
265 Arrays.binarySearch(objectArray, objArray[counter]) == counter);
294 objectArray[counter] = objArray[arraySize - counter - 1];
303 Arrays.binarySearch(objectArray, objArray[counter], comp) == arraySize
2505 objArray = new Object[arraySize];
2506 for (int i = 0; i < objArray.length; i++)
2507 objArray[i] = new Integer(i);
2526 objectArray[counter] = objArray[counter];
3016 Arrays.binarySearch(objectArray, counter, arraySize, objArray[counter]) == counter);
3083 objectArray[counter] = objArray[arraySiz
[all...]
H A DVectorTest.java34 Object[] objArray; field in class:VectorTest
124 myVector.size() == objArray.length);
125 for (int counter = 0; counter < objArray.length; counter++)
1255 assertTrue("Returned incorrect array", Arrays.equals(objArray, tVector
1394 objArray = new Object[100];
1396 objArray[i] = "Test " + i;
/libcore/luni/src/test/java/libcore/java/util/
H A DOldListIteratorTest.java29 static Object[] objArray; field in class:OldListIteratorTest
31 objArray = new Object[100];
32 for (int i = 0; i < objArray.length; i++)
33 objArray[i] = new Integer(i);
37 for (int i = 0; i < objArray.length; i++) {
45 for (int i = 0; i < objArray.length; i++) {
46 assertTrue(objArray[i].equals(l.next()));
106 for (int i = 0; i < objArray.length; i++) {
130 for (int i = 0; i < objArray.length; i++) {
147 for (int i = objArray
[all...]
H A DOldTreeSetTest.java33 Object objArray[] = new Object[1000]; field in class:OldTreeSetTest
37 TreeSet myTreeSet = new TreeSet(Arrays.asList(objArray));
39 myTreeSet.size() == objArray.length);
40 for (int counter = 0; counter < objArray.length; counter++)
42 .contains(objArray[counter]));
76 ts.add(objArray[0]);
77 assertTrue("Added existing element", ts.size() == objArray.length + 1);
123 ts.first() == objArray[0]);
140 assertTrue("Returned incorrect set", s.contains(objArray[i]));
168 ts.last() == objArray[objArra
[all...]
H A DOldTreeMapTest.java81 Object objArray[] = new Object[1000]; field in class:OldTreeMapTest
108 assertTrue("Map is incorrect size", myTreeMap.size() == objArray.length);
109 for (Object element : objArray) {
292 objArray[objArray.length - 1].toString()));
349 for (Object element : objArray) {
396 SortedMap subMap = tm.subMap(objArray[100].toString(), objArray[109]
401 objArray[counter].toString()).equals(objArray[counte
[all...]
/libcore/support/src/test/java/tests/support/
H A DSupport_UnmodifiableCollectionTest.java92 Object[] objArray;
93 objArray = col.toArray();
97 objArray[counter] == it.next());
101 objArray = new Object[100];
102 col.toArray(objArray);
106 objArray[counter] == it.next());

Completed in 377 milliseconds