25 |
|
* Create a deque of given size containing consecutive |
26 |
|
* Integers 0 ... n. |
27 |
|
*/ |
28 |
< |
private ConcurrentLinkedDeque populatedDeque(int n) { |
29 |
< |
ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(); |
28 |
> |
private ConcurrentLinkedDeque<Integer> populatedDeque(int n) { |
29 |
> |
ConcurrentLinkedDeque<Integer> q = new ConcurrentLinkedDeque<Integer>(); |
30 |
|
assertTrue(q.isEmpty()); |
31 |
|
for (int i = 0; i < n; ++i) |
32 |
|
assertTrue(q.offer(new Integer(i))); |
648 |
|
* toArray(a) contains all elements in FIFO order |
649 |
|
*/ |
650 |
|
public void testToArray2() { |
651 |
< |
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
651 |
> |
ConcurrentLinkedDeque<Integer> q = populatedDeque(SIZE); |
652 |
|
Integer[] ints = new Integer[SIZE]; |
653 |
< |
assertSame(ints, q.toArray(ints)); |
653 |
> |
Integer[] array = q.toArray(ints); |
654 |
> |
assertSame(ints, array); |
655 |
|
for (int i = 0; i < ints.length; i++) |
656 |
|
assertSame(ints[i], q.poll()); |
657 |
|
} |