49 |
|
* Create a queue of given size containing consecutive |
50 |
|
* Integers 0 ... n. |
51 |
|
*/ |
52 |
< |
private PriorityBlockingQueue populatedQueue(int n) { |
53 |
< |
PriorityBlockingQueue q = new PriorityBlockingQueue(n); |
52 |
> |
private PriorityBlockingQueue<Integer> populatedQueue(int n) { |
53 |
> |
PriorityBlockingQueue<Integer> q = |
54 |
> |
new PriorityBlockingQueue<Integer>(n); |
55 |
|
assertTrue(q.isEmpty()); |
56 |
|
for (int i = n-1; i >= 0; i-=2) |
57 |
|
assertTrue(q.offer(new Integer(i))); |
594 |
|
* toArray(a) contains all elements |
595 |
|
*/ |
596 |
|
public void testToArray2() throws InterruptedException { |
597 |
< |
PriorityBlockingQueue q = populatedQueue(SIZE); |
597 |
> |
PriorityBlockingQueue<Integer> q = populatedQueue(SIZE); |
598 |
|
Integer[] ints = new Integer[SIZE]; |
599 |
< |
assertSame(ints, q.toArray(ints)); |
599 |
> |
Integer[] array = q.toArray(ints); |
600 |
> |
assertSame(ints, array); |
601 |
|
Arrays.sort(ints); |
602 |
|
for (int i = 0; i < ints.length; i++) |
603 |
|
assertSame(ints[i], q.take()); |