# | Line 42 | Line 42 | public class PriorityQueueTest extends J | |
---|---|---|
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) |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |