59 |
|
* Integers 0 ... n - 1. |
60 |
|
*/ |
61 |
|
private static LinkedBlockingQueue<Integer> populatedQueue(int n) { |
62 |
< |
LinkedBlockingQueue<Integer> q = |
63 |
< |
new LinkedBlockingQueue<Integer>(n); |
62 |
> |
LinkedBlockingQueue<Integer> q = new LinkedBlockingQueue<>(n); |
63 |
|
assertTrue(q.isEmpty()); |
64 |
|
for (int i = 0; i < n; i++) |
65 |
|
assertTrue(q.offer(new Integer(i))); |
629 |
|
*/ |
630 |
|
public void testToArray() { |
631 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
632 |
< |
Object[] o = q.toArray(); |
633 |
< |
for (int i = 0; i < o.length; i++) |
634 |
< |
assertSame(o[i], q.poll()); |
632 |
> |
Object[] a = q.toArray(); |
633 |
> |
assertSame(Object[].class, a.getClass()); |
634 |
> |
for (Object o : a) |
635 |
> |
assertSame(o, q.poll()); |
636 |
> |
assertTrue(q.isEmpty()); |
637 |
|
} |
638 |
|
|
639 |
|
/** |
644 |
|
Integer[] ints = new Integer[SIZE]; |
645 |
|
Integer[] array = q.toArray(ints); |
646 |
|
assertSame(ints, array); |
647 |
< |
for (int i = 0; i < ints.length; i++) |
648 |
< |
assertSame(ints[i], q.poll()); |
647 |
> |
for (Integer o : ints) |
648 |
> |
assertSame(o, q.poll()); |
649 |
> |
assertTrue(q.isEmpty()); |
650 |
|
} |
651 |
|
|
652 |
|
/** |