Lines Matching refs:ts
40 TreeSet ts;
108 ts.add(new Integer(-8));
109 assertTrue("Failed to add Object", ts.contains(new Integer(-8)));
110 ts.add(objArray[0]);
111 assertTrue("Added existing element", ts.size() == objArray.length + 1);
122 s.addAll(ts);
123 assertTrue("Incorrect size after add", s.size() == ts.size());
124 Iterator i = ts.iterator();
135 ts.clear();
136 assertEquals("Returned non-zero size after clear", 0, ts.size());
137 assertTrue("Found element in cleared set", !ts.contains(objArray[0]));
145 TreeSet s = (TreeSet) ts.clone();
146 Iterator i = ts.iterator();
168 assertTrue("Returned false for valid Object", ts
170 assertTrue("Returned true for invalid Object", !ts
173 ts.contains(new Object());
188 ts.first() == objArray[0]);
197 Set s = ts.headSet(new Integer(100));
209 assertTrue("Non-Empty returned true", !ts.isEmpty());
218 s.addAll(ts);
219 Iterator i = ts.iterator();
233 ts.last() == objArray[objArray.length - 1]);
241 ts.remove(objArray[0]);
242 assertTrue("Failed to remove object", !ts.contains(objArray[0]));
244 ts.size() == objArray.length - 1);
246 ts.remove(new Object());
259 assertTrue("Returned incorrect size", ts.size() == objArray.length);
270 SortedSet aSubSet = ts.subSet(objArray[startPos], objArray[endPos]);
279 ts.subSet(objArray[3], objArray[0]);
293 Set s = ts.tailSet(new Integer(900));
337 ts = new TreeSet();
340 ts.add(x);