ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/test/tck/TreeSetTest.java
(Generate patch)

Comparing jsr166/src/test/tck/TreeSetTest.java (file contents):
Revision 1.49 by dl, Tue Jan 26 13:33:06 2021 UTC vs.
Revision 1.50 by jsr166, Wed Jan 27 01:57:25 2021 UTC

# Line 54 | Line 54 | public class TreeSetTest extends JSR166T
54       * Returns a new set of first 5 ints.
55       */
56      private static TreeSet<Item> set5() {
57 <        TreeSet<Item> q = new TreeSet<Item>();
57 >        TreeSet<Item> q = new TreeSet<>();
58          assertTrue(q.isEmpty());
59          q.add(one);
60          q.add(two);
# Line 109 | Line 109 | public class TreeSetTest extends JSR166T
109       */
110      public void testConstructor6() {
111          Item[] items = defaultItems;
112 <        TreeSet<Item> q = new TreeSet<Item>(Arrays.asList(items));
112 >        TreeSet<Item> q = new TreeSet<>(Arrays.asList(items));
113          for (int i = 0; i < SIZE; ++i)
114              mustEqual(items[i], q.pollFirst());
115      }
# Line 120 | Line 120 | public class TreeSetTest extends JSR166T
120      public void testConstructor7() {
121          MyReverseComparator cmp = new MyReverseComparator();
122          @SuppressWarnings("unchecked")
123 <        TreeSet<Item> q = new TreeSet<Item>(cmp);
123 >        TreeSet<Item> q = new TreeSet<>(cmp);
124          mustEqual(cmp, q.comparator());
125          Item[] items = defaultItems;
126          q.addAll(Arrays.asList(items));
# Line 132 | Line 132 | public class TreeSetTest extends JSR166T
132       * isEmpty is true before add, false after
133       */
134      public void testEmpty() {
135 <        TreeSet<Item> q = new TreeSet<Item>();
135 >        TreeSet<Item> q = new TreeSet<>();
136          assertTrue(q.isEmpty());
137          q.add(one);
138          assertFalse(q.isEmpty());
# Line 172 | Line 172 | public class TreeSetTest extends JSR166T
172       * Add of comparable element succeeds
173       */
174      public void testAdd() {
175 <        TreeSet<Item> q = new TreeSet<Item>();
175 >        TreeSet<Item> q = new TreeSet<>();
176          assertTrue(q.add(zero));
177          assertTrue(q.add(one));
178      }
# Line 181 | Line 181 | public class TreeSetTest extends JSR166T
181       * Add of duplicate element fails
182       */
183      public void testAddDup() {
184 <        TreeSet<Item> q = new TreeSet<Item>();
184 >        TreeSet<Item> q = new TreeSet<>();
185          assertTrue(q.add(zero));
186          assertFalse(q.add(zero));
187      }
# Line 190 | Line 190 | public class TreeSetTest extends JSR166T
190       * Add of non-Comparable throws CCE
191       */
192      public void testAddNonComparable() {
193 <        TreeSet<Object> q = new TreeSet<Object>();
193 >        TreeSet<Object> q = new TreeSet<>();
194          try {
195              q.add(new Object());
196              q.add(new Object());
# Line 202 | Line 202 | public class TreeSetTest extends JSR166T
202       * addAll(null) throws NPE
203       */
204      public void testAddAll1() {
205 <        TreeSet<Item> q = new TreeSet<Item>();
205 >        TreeSet<Item> q = new TreeSet<>();
206          try {
207              q.addAll(null);
208              shouldThrow();
# Line 213 | Line 213 | public class TreeSetTest extends JSR166T
213       * addAll of a collection with null elements throws NPE
214       */
215      public void testAddAll2() {
216 <        TreeSet<Item> q = new TreeSet<Item>();
216 >        TreeSet<Item> q = new TreeSet<>();
217          Item[] items = new Item[2];
218          try {
219              q.addAll(Arrays.asList(items));
# Line 226 | Line 226 | public class TreeSetTest extends JSR166T
226       * possibly adding some elements
227       */
228      public void testAddAll3() {
229 <        TreeSet<Item> q = new TreeSet<Item>();
229 >        TreeSet<Item> q = new TreeSet<>();
230          Item[] items = new Item[2];
231          items[0] = zero;
232          try {
# Line 241 | Line 241 | public class TreeSetTest extends JSR166T
241      public void testAddAll5() {
242          Item[] empty = new Item[0];
243          Item[] items = defaultItems;
244 <        TreeSet<Item> q = new TreeSet<Item>();
244 >        TreeSet<Item> q = new TreeSet<>();
245          assertFalse(q.addAll(Arrays.asList(empty)));
246          assertTrue(q.addAll(Arrays.asList(items)));
247          for (int i = 0; i < SIZE; ++i)
# Line 322 | Line 322 | public class TreeSetTest extends JSR166T
322       */
323      public void testContainsAll() {
324          TreeSet<Item> q = populatedSet(SIZE);
325 <        TreeSet<Item> p = new TreeSet<Item>();
325 >        TreeSet<Item> p = new TreeSet<>();
326          for (int i = 0; i < SIZE; ++i) {
327              assertTrue(q.containsAll(p));
328              assertFalse(p.containsAll(q));
# Line 486 | Line 486 | public class TreeSetTest extends JSR166T
486       * iterator.remove removes current element
487       */
488      public void testIteratorRemove() {
489 <        final TreeSet<Item> q = new TreeSet<Item>();
489 >        final TreeSet<Item> q = new TreeSet<>();
490          q.add(two);
491          q.add(one);
492          q.add(three);
# Line 675 | Line 675 | public class TreeSetTest extends JSR166T
675       */
676      public void testAddAll_idempotent() throws Exception {
677          Set<Item> x = populatedSet(SIZE);
678 <        Set<Item> y = new TreeSet<Item>(x);
678 >        Set<Item> y = new TreeSet<>(x);
679          y.addAll(x);
680          mustEqual(x, y);
681          mustEqual(y, x);

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines