# | Line 48 | Line 48 | public class LinkedBlockingDequeTest ext | |
---|---|---|
48 | ||
49 | /** | |
50 | * Returns a new deque of given size containing consecutive | |
51 | < | * Integers 0 ... n. |
51 | > | * Integers 0 ... n - 1. |
52 | */ | |
53 | private LinkedBlockingDeque<Integer> populatedDeque(int n) { | |
54 | LinkedBlockingDeque<Integer> q = | |
# | Line 59 | Line 59 | public class LinkedBlockingDequeTest ext | |
59 | assertFalse(q.isEmpty()); | |
60 | assertEquals(0, q.remainingCapacity()); | |
61 | assertEquals(n, q.size()); | |
62 | + | assertEquals((Integer) 0, q.peekFirst()); |
63 | + | assertEquals((Integer) (n - 1), q.peekLast()); |
64 | return q; | |
65 | } | |
66 |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |