| /art/test/019-wrong-array-type/src/ |
| Main.java | 24 Object[] objArray = strArray;
27 objArray[0] = new Integer(1);
|
| /external/apache-harmony/support/src/test/java/tests/support/ |
| Support_UnmodifiableCollectionTest.java | 92 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());
|
| Support_UnmodifiableMapTest.java | 143 Object[] objArray;
144 objArray = keySet.toArray();
148 objArray[counter] == it.next());
152 objArray = new Object[100];
153 keySet.toArray(objArray);
157 objArray[counter] == it.next());
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| EmptyStackExceptionTest.java | 25 Object[] objArray = new Object[10];
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;
|
| HashSetTest.java | 43 Object[] objArray;
91 HashSet hs2 = new HashSet(Arrays.asList(objArray));
92 for (int counter = 0; counter < objArray.length; counter++)
94 .contains(objArray[counter]));
96 hs2.size() == objArray.length);
148 assertTrue("Returned false for valid object", hs.contains(objArray[90]));
206 assertTrue("Returned incorrect size", hs.size() == (objArray.length + 1));
286 objArray = new Object[1000];
287 for (int i = 0; i < objArray.length; i++) {
288 objArray[i] = new Integer(i)
[all...] |
| LinkedHashSetTest.java | 40 Object[] objArray;
101 LinkedHashSet hs2 = new LinkedHashSet(Arrays.asList(objArray));
102 for (int counter = 0; counter < objArray.length; counter++)
104 .contains(objArray[counter]));
106 .size() == objArray.length);
160 assertTrue("Returned false for valid object", hs.contains(objArray[90]));
224 assertTrue("Returned incorrect size", hs.size() == (objArray.length + 1));
359 objArray = new Object[1000];
360 for (int i = 0; i < objArray.length; i++)
361 objArray[i] = new Integer(i)
[all...] |
| TreeSetTest.java | 48 Object objArray[] = new Object[1000];
63 TreeSet myTreeSet = new TreeSet(Arrays.asList(objArray));
65 myTreeSet.size() == objArray.length);
66 for (int counter = 0; counter < objArray.length; counter++)
68 .contains(objArray[counter]));
95 for (int i = 0; i < objArray.length; i++)
96 myTreeSet.add(objArray[i]);
99 anotherTreeSet.size() == objArray.length);
100 for (int counter = 0; counter < objArray.length; counter++)
102 anotherTreeSet.contains(objArray[counter]))
[all...] |
| IdentityHashMap2Test.java | 50 private Object[] objArray;
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[0])
[all...] |
| ArrayListTest.java | 41 Object[] objArray;
79 ArrayList al = new ArrayList(Arrays.asList(objArray));
81 .size() == objArray.length);
82 for (int counter = 0; counter < objArray.length; counter++)
85 al.get(counter) == objArray[counter]);
110 alist.get(51) == objArray[50]
111 && (alist.get(52) == objArray[51]));
120 assertEquals(alist.get(1), objArray[0]);
121 assertEquals(alist.get(2), objArray[1]);
170 assertEquals(alist.get(size - 2), objArray[size - 2])
[all...] |
| HashMapTest.java | 99 Object[] objArray;
161 myMap.put(objArray2[counter], objArray[counter]);
359 for (int i = 0; i < objArray.length; i++)
361 .contains(objArray[i].toString()));
589 hm.size() == (objArray.length + 2));
600 for (int i = 0; i < objArray.length; i++)
602 .contains(objArray[i]));
606 myHashMap.put(objArray2[i], objArray[i]);
927 objArray = new Object[hmSize];
929 for (int i = 0; i < objArray.length; i++)
[all...] |
| IdentityHashMapTest.java | 61 Object[] objArray;
103 myMap.put(objArray2[counter], objArray[counter]);
195 .containsValue(objArray[19]));
252 for (int i = 0; i < objArray.length; i++) {
374 m.remove(objArray[0]));
397 assertEquals("Returned incorrect size, ", (objArray.length + 2), hm
466 objArray = new Object[hmSize];
468 for (int i = 0; i < objArray.length; i++) {
469 objArray[i] = new Integer(i);
471 objArray2[i] = new String(objArray[i].toString())
[all...] |
| LinkedHashMapTest.java | 48 Object[] objArray;
130 myMap.put(objArray2[counter], objArray[counter]);
259 for (int i = 0; i < objArray.length; i++)
261 .contains(objArray[i].toString()));
313 for (int i = 0; i < objArray.length; i++)
315 .contains(objArray[i]));
319 myLinkedHashMap.put(objArray2[i], objArray[i]);
515 hm.size() == (objArray.length + 2));
[all...] |
| LinkedListTest.java | 57 Object[] objArray;
98 ll.get(51) == objArray[50] && (ll.get(52) == objArray[51]));
153 assertTrue("Manipulated elements < index", ll.get(i) == objArray[i]);
156 ll.get(i) == objArray[i - 50]);
159 ll.get(i) == objArray[i - 100]);
325 .contains(objArray[99]));
340 assertTrue("Returned incorrect element", ll.get(22) == objArray[22]);
356 assertEquals("Returned incorrect first element", ll.peek(), objArray[0]);
357 assertEquals("Peek remove the head (first element) of this list", ll.getFirst(), objArray[0])
[all...] |
| VectorTest.java | 44 Object[] objArray;
134 myVector.size() == objArray.length);
135 for (int counter = 0; counter < objArray.length; counter++)
[all...] |
| TreeMapTest.java | 92 Object objArray[] = new Object[1000];
128 assertTrue("Map is incorrect size", myTreeMap.size() == objArray.length);
129 for (Object element : objArray) {
173 for (Object element : objArray) {
234 .containsValue(objArray[986]));
247 anEntrySet.size() == objArray.length);
410 ks.size() == objArray.length);
423 objArray[objArray.length - 1].toString()));
424 assertNotSame(objArray[objArray.length - 1].toString(), tm.lastKey())
[all...] |
| CollectionsTest.java | 73 private Integer[] objArray;
406 objArray[count++]);
408 assertEquals("Enumeration missing elements: " + count, objArray.length,
450 // assumes s, objArray are sorted
452 objArray[objArray.length - 1]);
478 // assumes s, objArray are sorted
490 // assumes s, objArray are sorted
492 objArray[0]);
498 // assumes s, objArray are sorte
[all...] |
| /libcore/support/src/test/java/tests/support/ |
| Support_UnmodifiableCollectionTest.java | 92 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());
|
| /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/utils/ |
| JsonUtilsTests.java | 29 final List<Object> objArray = Arrays.asList(objs);
30 final String str = JsonUtils.listToJsonStr(objArray);
|
| /external/mockftpserver/MockFtpServer/src/test/java/org/mockftpserver/test/ |
| AbstractTestCase.java | 177 protected static Object[] objArray(Object o) {
|
| /external/mockftpserver/branches/1.x_Branch/src/test/java/org/mockftpserver/test/ |
| AbstractTest.java | 169 protected static Object[] objArray(Object o) {
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| OldListIteratorTest.java | 29 static Object[] objArray;
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.length - 1; i > -1 ; i--)
[all...] |
| OldTreeSetTest.java | 33 Object objArray[] = new Object[1000];
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[objArray.length - 1])
[all...] |
| OldTreeMapTest.java | 81 Object objArray[] = new Object[1000];
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[counter]))
[all...] |
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/format/ |
| TestMessageFormat.java | [all...] |
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/ |
| TestMessageFormat.java | [all...] |
