| 29 |
|
* Create a queue of given size containing consecutive |
| 30 |
|
* Integers 0 ... n. |
| 31 |
|
*/ |
| 32 |
< |
private PriorityQueue populatedQueue(int n) { |
| 33 |
< |
PriorityQueue q = new PriorityQueue(n); |
| 32 |
> |
private PriorityQueue<Integer> populatedQueue(int n) { |
| 33 |
> |
PriorityQueue<Integer> q = new PriorityQueue<Integer>(n); |
| 34 |
|
assertTrue(q.isEmpty()); |
| 35 |
|
for (int i = n-1; i >= 0; i-=2) |
| 36 |
|
assertTrue(q.offer(new Integer(i))); |
| 408 |
|
Object[] o = q.toArray(); |
| 409 |
|
Arrays.sort(o); |
| 410 |
|
for (int i = 0; i < o.length; i++) |
| 411 |
< |
assertEquals(o[i], q.poll()); |
| 411 |
> |
assertSame(o[i], q.poll()); |
| 412 |
|
} |
| 413 |
|
|
| 414 |
|
/** |
| 415 |
|
* toArray(a) contains all elements |
| 416 |
|
*/ |
| 417 |
|
public void testToArray2() { |
| 418 |
< |
PriorityQueue q = populatedQueue(SIZE); |
| 418 |
> |
PriorityQueue<Integer> q = populatedQueue(SIZE); |
| 419 |
|
Integer[] ints = new Integer[SIZE]; |
| 420 |
< |
ints = (Integer[])q.toArray(ints); |
| 420 |
> |
Integer[] array = q.toArray(ints); |
| 421 |
> |
assertSame(ints, array); |
| 422 |
|
Arrays.sort(ints); |
| 423 |
|
for (int i = 0; i < ints.length; i++) |
| 424 |
< |
assertEquals(ints[i], q.poll()); |
| 424 |
> |
assertSame(ints[i], q.poll()); |
| 425 |
|
} |
| 426 |
|
|
| 427 |
|
/** |
