# | Line 66 | Line 66 | public class PriorityBlockingQueueTest e | |
---|---|---|
66 | * Returns a new queue of given size containing consecutive | |
67 | * Integers 0 ... n - 1. | |
68 | */ | |
69 | < | private PriorityBlockingQueue<Integer> populatedQueue(int n) { |
69 | > | private static PriorityBlockingQueue<Integer> populatedQueue(int n) { |
70 | PriorityBlockingQueue<Integer> q = | |
71 | new PriorityBlockingQueue<Integer>(n); | |
72 | assertTrue(q.isEmpty()); |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |