38 |
|
|
39 |
|
/** |
40 |
|
* Returns a new deque of given size containing consecutive |
41 |
< |
* Integers 0 ... n. |
41 |
> |
* Integers 0 ... n - 1. |
42 |
|
*/ |
43 |
|
private ConcurrentLinkedDeque<Integer> populatedDeque(int n) { |
44 |
< |
ConcurrentLinkedDeque<Integer> q = new ConcurrentLinkedDeque<Integer>(); |
44 |
> |
ConcurrentLinkedDeque<Integer> q = new ConcurrentLinkedDeque<>(); |
45 |
|
assertTrue(q.isEmpty()); |
46 |
|
for (int i = 0; i < n; ++i) |
47 |
|
assertTrue(q.offer(new Integer(i))); |
48 |
|
assertFalse(q.isEmpty()); |
49 |
|
assertEquals(n, q.size()); |
50 |
+ |
assertEquals((Integer) 0, q.peekFirst()); |
51 |
+ |
assertEquals((Integer) (n - 1), q.peekLast()); |
52 |
|
return q; |
53 |
|
} |
54 |
|
|