# | Line 38 | Line 38 | public class ConcurrentLinkedDequeTest e | |
---|---|---|
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>(); | |
# | Line 47 | Line 47 | public class ConcurrentLinkedDequeTest e | |
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 |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |