23 |
|
* Create a queue of given size containing consecutive |
24 |
|
* Integers 0 ... n. |
25 |
|
*/ |
26 |
< |
private LinkedList populatedQueue(int n) { |
27 |
< |
LinkedList q = new LinkedList(); |
26 |
> |
private LinkedList<Integer> populatedQueue(int n) { |
27 |
> |
LinkedList<Integer> q = new LinkedList<Integer>(); |
28 |
|
assertTrue(q.isEmpty()); |
29 |
|
for (int i = 0; i < n; ++i) |
30 |
|
assertTrue(q.offer(new Integer(i))); |
331 |
|
* toArray(a) contains all elements in FIFO order |
332 |
|
*/ |
333 |
|
public void testToArray2() { |
334 |
< |
LinkedList q = populatedQueue(SIZE); |
334 |
> |
LinkedList<Integer> q = populatedQueue(SIZE); |
335 |
|
Integer[] ints = new Integer[SIZE]; |
336 |
< |
assertSame(ints, q.toArray(ints)); |
336 |
> |
Integer[] array = q.toArray(ints); |
337 |
> |
assertSame(ints, array); |
338 |
|
for (int i = 0; i < ints.length; i++) |
339 |
|
assertSame(ints[i], q.poll()); |
340 |
|
} |