# | Line 26 | Line 26 | public class ConcurrentLinkedDequeTest e | |
---|---|---|
26 | } | |
27 | ||
28 | /** | |
29 | < | * Create a deque of given size containing consecutive |
29 | > | * Returns a new deque of given size containing consecutive |
30 | * Integers 0 ... n. | |
31 | */ | |
32 | private ConcurrentLinkedDeque<Integer> populatedDeque(int n) { | |
# | Line 850 | Line 850 | public class ConcurrentLinkedDequeTest e | |
850 | Queue x = populatedDeque(SIZE); | |
851 | Queue y = serialClone(x); | |
852 | ||
853 | < | assertTrue(x != y); |
853 | > | assertNotSame(x, y); |
854 | assertEquals(x.size(), y.size()); | |
855 | assertEquals(x.toString(), y.toString()); | |
856 | assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |