Lines Matching defs:objArray
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]));
106 anotherTreeSet.first() == objArray[objArray.length - 1]);
116 ts.add(objArray[0]);
117 assertTrue("Added existing element", ts.size() == objArray.length + 1);
143 assertTrue("Found element in cleared set", !ts.contains(objArray[0]));
175 .contains(objArray[objArray.length / 2]));
194 ts.first() == objArray[0]);
206 assertTrue("Returned incorrect set", s.contains(objArray[i]));
226 Set as = new HashSet(Arrays.asList(objArray));
239 ts.last() == objArray[objArray.length - 1]);
247 ts.remove(objArray[0]);
248 assertTrue("Failed to remove object", !ts.contains(objArray[0]));
250 ts.size() == objArray.length - 1);
265 assertTrue("Returned incorrect size", ts.size() == objArray.length);
274 final int startPos = objArray.length / 4;
275 final int endPos = 3 * objArray.length / 4;
276 SortedSet aSubSet = ts.subSet(objArray[startPos], objArray[endPos]);
281 aSubSet.contains(objArray[counter]));
285 ts.subSet(objArray[3], objArray[0]);
301 for (int i = 900; i < objArray.length; i++)
302 assertTrue("Returned incorrect set", s.contains(objArray[i]));
355 for (int i = 0; i < objArray.length; i++) {
356 Object x = objArray[i] = new Integer(i);