# | Line 36 | Line 36 | public class ConcurrentLinkedQueueTest e | |
---|---|---|
36 | ||
37 | /** | |
38 | * Returns a new queue of given size containing consecutive | |
39 | < | * Integers 0 ... n. |
39 | > | * Integers 0 ... n - 1. |
40 | */ | |
41 | private ConcurrentLinkedQueue<Integer> populatedQueue(int n) { | |
42 | ConcurrentLinkedQueue<Integer> q = new ConcurrentLinkedQueue<Integer>(); | |
# | Line 45 | Line 45 | public class ConcurrentLinkedQueueTest e | |
45 | assertTrue(q.offer(new Integer(i))); | |
46 | assertFalse(q.isEmpty()); | |
47 | assertEquals(n, q.size()); | |
48 | + | assertEquals((Integer) 0, q.peek()); |
49 | return q; | |
50 | } | |
51 |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |