# | Line 55 | Line 55 | public class PriorityBlockingQueueTest e | |
---|---|---|
55 | } | |
56 | ||
57 | /** | |
58 | < | * Create a queue of given size containing consecutive |
58 | > | * Returns a new queue of given size containing consecutive |
59 | * Integers 0 ... n. | |
60 | */ | |
61 | private PriorityBlockingQueue<Integer> populatedQueue(int n) { | |
# | Line 644 | Line 644 | public class PriorityBlockingQueueTest e | |
644 | Queue x = populatedQueue(SIZE); | |
645 | Queue y = serialClone(x); | |
646 | ||
647 | < | assertTrue(x != y); |
647 | > | assertNotSame(x, y); |
648 | assertEquals(x.size(), y.size()); | |
649 | while (!x.isEmpty()) { | |
650 | assertFalse(y.isEmpty()); |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |