| /libcore/luni/src/test/java/tests/api/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;
|
| LinkedListTest.java | 36 Object[] objArray;
77 ll.get(51) == objArray[50] && (ll.get(52) == objArray[51]));
104 assertTrue("Manipulated elements < index", ll.get(i) == objArray[i]);
107 ll.get(i) == objArray[i - 50]);
110 ll.get(i) == objArray[i - 100]);
260 .contains(objArray[99]));
275 assertTrue("Returned incorrect element", ll.get(22) == objArray[22]);
289 objArray[0]));
306 objArray[objArray.length - 1]))
[all...] |
| HashSetTest.java | 37 Object[] objArray;
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[i] = new Integer(i)
[all...] |
| LinkedHashSetTest.java | 34 Object[] objArray;
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[i] = new Integer(i)
[all...] |
| ArrayListTest.java | 35 Object[] objArray;
71 ArrayList al = new ArrayList(Arrays.asList(objArray));
73 .size() == objArray.length);
74 for (int counter = 0; counter < objArray.length; counter++)
77 al.get(counter) == objArray[counter]);
96 alist.get(51) == objArray[50]
97 && (alist.get(52) == objArray[51]));
142 alist.get(i) == objArray[i]);
145 alist.get(i) == objArray[i - 50]);
148 alist.get(i) == objArray[i - 100])
[all...] |
| IdentityHashMapTest.java | 56 Object[] objArray;
98 myMap.put(objArray2[counter], objArray[counter]);
190 .containsValue(objArray[19]));
247 for (int i = 0; i < objArray.length; i++) {
357 m.remove(objArray[0]));
366 assertEquals("Returned incorrect size, ", (objArray.length + 2), hm
423 for (int i = 0; i < objArray.length; i++)
425 .contains(objArray[i]));
429 myIdentityHashMap.put(objArray2[i], objArray[i]);
431 values.remove(objArray[0])
[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/ |
| EmptyStackExceptionTest.java | 25 static Object[] objArray = new Object[10];
29 for (int counter = 0; counter < objArray.length; counter++)
30 objArray[counter] = new Integer(counter);
39 for (int counter = 0; counter < objArray.length + 1; counter++)
53 for (int counter = 0; counter < objArray.length; counter++)
54 s.push(objArray[counter]);
|
| TreeSetTest.java | 42 Object objArray[] = new Object[1000];
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[counter]))
[all...] |
| LinkedHashSetTest.java | 31 static Object[] objArray;
33 objArray = new Object[1000];
34 for (int i = 0; i < objArray.length; i++)
35 objArray[i] = new Integer(i);
84 LinkedHashSet hs2 = new LinkedHashSet(Arrays.asList(objArray));
85 for (int counter = 0; counter < objArray.length; counter++)
87 .contains(objArray[counter]));
89 .size() == objArray.length);
136 assertTrue("Returned false for valid object", hs.contains(objArray[90]));
200 assertTrue("Returned incorrect size", hs.size() == (objArray.length + 1))
[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...] |
| HashSetTest.java | 37 static Object[] objArray;
39 objArray = new Object[1000];
40 for (int i = 0; i < objArray.length; i++)
41 objArray[i] = new Integer(i);
90 HashSet hs2 = new HashSet(Arrays.asList(objArray));
91 for (int counter = 0; counter < objArray.length; counter++)
93 .contains(objArray[counter]));
95 hs2.size() == objArray.length);
140 assertTrue("Returned false for valid object", hs.contains(objArray[90]));
197 assertTrue("Returned incorrect size", hs.size() == (objArray.length + 1))
[all...] |
| LinkedListTest.java | 52 static Object[] objArray;
54 objArray = new Object[100];
55 for (int i = 0; i < objArray.length; i++)
56 objArray[i] = new Integer(i);
91 ll.get(51) == objArray[50] && (ll.get(52) == objArray[51]));
146 assertTrue("Manipulated elements < index", ll.get(i) == objArray[i]);
149 ll.get(i) == objArray[i - 50]);
152 ll.get(i) == objArray[i - 100]);
304 .contains(objArray[99]))
[all...] |
| IdentityHashMap2Test.java | 56 static Object[] objArray;
60 objArray = new Object[hmSize];
62 for (int i = 0; i < objArray.length; i++) {
63 objArray[i] = new Integer(i);
64 objArray2[i] = objArray[i].toString();
107 myMap.put(objArray2[counter], objArray[counter]);
201 .containsValue(objArray[19]));
258 for (int i = 0; i < objArray.length; i++) {
361 m.remove(objArray[0]));
370 assertEquals("Returned incorrect size, ", (objArray.length + 2), h
[all...] |
| ArrayListTest.java | 35 static Object[] objArray;
37 objArray = new Object[100];
38 for (int i = 0; i < objArray.length; i++)
39 objArray[i] = new Integer(i);
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]);
104 alist.get(51) == objArray[50]
105 && (alist.get(52) == objArray[51]))
[all...] |
| /art/test/019-wrong-array-type/src/ |
| Main.java | 24 Object[] objArray = strArray;
27 objArray[0] = new Integer(1);
|
| /dalvik/tests/019-wrong-array-type/src/ |
| Main.java | 24 Object[] objArray = strArray;
27 objArray[0] = new Integer(1);
|
| /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/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/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());
|
| /external/jmonkeyengine/engine/src/core/com/jme3/animation/ |
| CompactArray.java | 69 * @param objArray
71 public void add(T... objArray) {
72 if (objArray == null || objArray.length == 0) {
78 index = new int[objArray.length];
85 int[] tmp = new int[base + objArray.length];
88 //index = Arrays.copyOf(index, base+objArray.length);
90 for (int j = 0; j < objArray.length; j++) {
91 T obj = objArray[j];
190 * @param objArray
[all...] |
