--- jsr166/src/test/tck/ArrayDequeTest.java 2016/10/30 21:07:27 1.52 +++ jsr166/src/test/tck/ArrayDequeTest.java 2019/12/16 21:16:09 1.58 @@ -8,7 +8,6 @@ import java.util.ArrayDeque; import java.util.Arrays; import java.util.Collection; -import java.util.Collections; import java.util.Deque; import java.util.Iterator; import java.util.NoSuchElementException; @@ -17,7 +16,6 @@ import java.util.Random; import java.util.concurrent.ThreadLocalRandom; import junit.framework.Test; -import junit.framework.TestSuite; public class ArrayDequeTest extends JSR166TestCase { public static void main(String[] args) { @@ -42,7 +40,7 @@ public class ArrayDequeTest extends JSR1 */ private static ArrayDeque populatedDeque(int n) { // Randomize various aspects of memory layout, including - // filled-to-capacity and wraparound. + // capacity slop and wraparound. final ArrayDeque q; ThreadLocalRandom rnd = ThreadLocalRandom.current(); switch (rnd.nextInt(6)) { @@ -572,14 +570,17 @@ public class ArrayDequeTest extends JSR1 * removeFirstOccurrence(x) removes x and returns true if present */ public void testRemoveFirstOccurrence() { - ArrayDeque q = populatedDeque(SIZE); + Deque q = populatedDeque(SIZE); assertFalse(q.removeFirstOccurrence(null)); for (int i = 1; i < SIZE; i += 2) { - assertTrue(q.removeFirstOccurrence(new Integer(i))); + assertTrue(q.removeFirstOccurrence(i)); + assertFalse(q.contains(i)); } for (int i = 0; i < SIZE; i += 2) { - assertTrue(q.removeFirstOccurrence(new Integer(i))); - assertFalse(q.removeFirstOccurrence(new Integer(i + 1))); + assertTrue(q.removeFirstOccurrence(i)); + assertFalse(q.removeFirstOccurrence(i + 1)); + assertFalse(q.contains(i)); + assertFalse(q.contains(i + 1)); } assertTrue(q.isEmpty()); assertFalse(q.removeFirstOccurrence(null)); @@ -593,14 +594,17 @@ public class ArrayDequeTest extends JSR1 * removeLastOccurrence(x) removes x and returns true if present */ public void testRemoveLastOccurrence() { - ArrayDeque q = populatedDeque(SIZE); + Deque q = populatedDeque(SIZE); assertFalse(q.removeLastOccurrence(null)); for (int i = 1; i < SIZE; i += 2) { - assertTrue(q.removeLastOccurrence(new Integer(i))); + assertTrue(q.removeLastOccurrence(i)); + assertFalse(q.contains(i)); } for (int i = 0; i < SIZE; i += 2) { - assertTrue(q.removeLastOccurrence(new Integer(i))); - assertFalse(q.removeLastOccurrence(new Integer(i + 1))); + assertTrue(q.removeLastOccurrence(i)); + assertFalse(q.removeLastOccurrence(i + 1)); + assertFalse(q.contains(i)); + assertFalse(q.contains(i + 1)); } assertTrue(q.isEmpty()); assertFalse(q.removeLastOccurrence(null)); @@ -707,7 +711,7 @@ public class ArrayDequeTest extends JSR1 Integer x = (Integer) it.next(); assertEquals(s + i, (int) x); for (Object[] a : as) - assertSame(a1[i], x); + assertSame(a[i], x); } } @@ -741,7 +745,7 @@ public class ArrayDequeTest extends JSR1 ArrayDeque l = new ArrayDeque(); l.add(new Object()); try { - l.toArray(null); + l.toArray((Object[])null); shouldThrow(); } catch (NullPointerException success) {} } @@ -908,7 +912,7 @@ public class ArrayDequeTest extends JSR1 } /** - * A deserialized serialized deque has same elements in same order + * A deserialized/reserialized deque has same elements in same order */ public void testSerialization() throws Exception { Queue x = populatedDeque(SIZE); @@ -917,6 +921,7 @@ public class ArrayDequeTest extends JSR1 assertNotSame(y, x); assertEquals(x.size(), y.size()); assertEquals(x.toString(), y.toString()); + assertEquals(Arrays.toString(x.toArray()), Arrays.toString(y.toArray())); assertTrue(Arrays.equals(x.toArray(), y.toArray())); while (!x.isEmpty()) { assertFalse(y.isEmpty());