42 |
|
* Returns a new queue of given size containing consecutive |
43 |
|
* Integers 0 ... n - 1. |
44 |
|
*/ |
45 |
< |
private PriorityQueue<Integer> populatedQueue(int n) { |
45 |
> |
private static PriorityQueue<Integer> populatedQueue(int n) { |
46 |
|
PriorityQueue<Integer> q = new PriorityQueue<>(n); |
47 |
|
assertTrue(q.isEmpty()); |
48 |
|
for (int i = n - 1; i >= 0; i -= 2) |
63 |
|
} |
64 |
|
|
65 |
|
/** |
66 |
< |
* Constructor throws IAE if capacity argument nonpositive |
66 |
> |
* Constructor throws IllegalArgumentException if capacity argument nonpositive |
67 |
|
*/ |
68 |
|
public void testConstructor2() { |
69 |
|
try { |
495 |
|
} |
496 |
|
|
497 |
|
/** |
498 |
< |
* A deserialized serialized queue has same elements |
498 |
> |
* A deserialized/reserialized queue has same elements |
499 |
|
*/ |
500 |
|
public void testSerialization() throws Exception { |
501 |
|
Queue x = populatedQueue(SIZE); |