# | Line 39 | Line 39 | public class ConcurrentLinkedDequeTest e | |
---|---|---|
39 | * Returns a new deque of given size containing consecutive | |
40 | * Integers 0 ... n - 1. | |
41 | */ | |
42 | < | private ConcurrentLinkedDeque<Integer> populatedDeque(int n) { |
42 | > | private static ConcurrentLinkedDeque<Integer> populatedDeque(int n) { |
43 | ConcurrentLinkedDeque<Integer> q = new ConcurrentLinkedDeque<>(); | |
44 | assertTrue(q.isEmpty()); | |
45 | for (int i = 0; i < n; ++i) |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |