| 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))); |
| 587 |
|
Object[] o = q.toArray(); |
| 588 |
|
Arrays.sort(o); |
| 589 |
|
for (int i = 0; i < o.length; i++) |
| 590 |
< |
assertEquals(o[i], q.take()); |
| 590 |
> |
assertSame(o[i], q.take()); |
| 591 |
|
} |
| 592 |
|
|
| 593 |
|
/** |
| 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 |
< |
ints = (Integer[])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 |
< |
assertEquals(ints[i], q.take()); |
| 603 |
> |
assertSame(ints[i], q.take()); |
| 604 |
|
} |
| 605 |
|
|
| 606 |
|
/** |
