--- jsr166/src/test/tck/ConcurrentSkipListSubSetTest.java 2017/08/04 03:30:21 1.37 +++ jsr166/src/test/tck/ConcurrentSkipListSubSetTest.java 2018/05/28 21:19:50 1.39 @@ -33,8 +33,7 @@ public class ConcurrentSkipListSubSetTes * Integers 0 ... n - 1. */ private static NavigableSet populatedSet(int n) { - ConcurrentSkipListSet q = - new ConcurrentSkipListSet(); + ConcurrentSkipListSet q = new ConcurrentSkipListSet<>(); assertTrue(q.isEmpty()); for (int i = n - 1; i >= 0; i -= 2) @@ -408,9 +407,11 @@ public class ConcurrentSkipListSubSetTes */ public void testToArray() { NavigableSet q = populatedSet(SIZE); - Object[] o = q.toArray(); - for (int i = 0; i < o.length; i++) - assertSame(o[i], q.pollFirst()); + Object[] a = q.toArray(); + assertSame(Object[].class, a.getClass()); + for (Object o : a) + assertSame(o, q.pollFirst()); + assertTrue(q.isEmpty()); } /** @@ -421,8 +422,9 @@ public class ConcurrentSkipListSubSetTes Integer[] ints = new Integer[SIZE]; Integer[] array = q.toArray(ints); assertSame(ints, array); - for (int i = 0; i < ints.length; i++) - assertSame(ints[i], q.pollFirst()); + for (Integer o : ints) + assertSame(o, q.pollFirst()); + assertTrue(q.isEmpty()); } /**