26 |
|
|
27 |
/** |
/** |
28 |
* Returns a new queue of given size containing consecutive |
* Returns a new queue of given size containing consecutive |
29 |
* Integers 0 ... n. |
* Integers 0 ... n - 1. |
30 |
*/ |
*/ |
31 |
private LinkedList<Integer> populatedQueue(int n) { |
private LinkedList<Integer> populatedQueue(int n) { |
32 |
LinkedList<Integer> q = new LinkedList<Integer>(); |
LinkedList<Integer> q = new LinkedList<Integer>(); |
35 |
assertTrue(q.offer(new Integer(i))); |
assertTrue(q.offer(new Integer(i))); |
36 |
assertFalse(q.isEmpty()); |
assertFalse(q.isEmpty()); |
37 |
assertEquals(n, q.size()); |
assertEquals(n, q.size()); |
38 |
|
assertEquals((Integer) 0, q.peekFirst()); |
39 |
|
assertEquals((Integer) (n - 1), q.peekLast()); |
40 |
return q; |
return q; |
41 |
} |
} |
42 |
|
|