# | Line 30 | Line 30 | public class PriorityQueueTest extends J | |
---|---|---|
30 | } | |
31 | ||
32 | /** | |
33 | < | * Creates a queue of given size containing consecutive |
33 | > | * Returns a new queue of given size containing consecutive |
34 | * Integers 0 ... n. | |
35 | */ | |
36 | private PriorityQueue<Integer> populatedQueue(int n) { | |
# | Line 485 | Line 485 | public class PriorityQueueTest extends J | |
485 | Queue x = populatedQueue(SIZE); | |
486 | Queue y = serialClone(x); | |
487 | ||
488 | < | assertTrue(x != y); |
488 | > | assertNotSame(x, y); |
489 | assertEquals(x.size(), y.size()); | |
490 | while (!x.isEmpty()) { | |
491 | assertFalse(y.isEmpty()); |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |