30 |
|
} |
31 |
|
class ComparatorImplementation implements CollectionImplementation { |
32 |
|
public Class<?> klazz() { return PriorityQueue.class; } |
33 |
< |
public Collection emptyCollection() { return new PriorityQueue(new MyReverseComparator()); } |
33 |
> |
public Collection emptyCollection() { |
34 |
> |
return new PriorityQueue(new MyReverseComparator()); |
35 |
> |
} |
36 |
|
public Object makeElement(int i) { return i; } |
37 |
|
public boolean isConcurrent() { return false; } |
38 |
|
public boolean permitsNulls() { return false; } |
39 |
|
} |
40 |
< |
return newTestSuite(PriorityQueueTest.class, |
41 |
< |
CollectionTest.testSuite(new Implementation()), |
42 |
< |
CollectionTest.testSuite(new ComparatorImplementation())); |
40 |
> |
return newTestSuite( |
41 |
> |
PriorityQueueTest.class, |
42 |
> |
CollectionTest.testSuite(new Implementation()), |
43 |
> |
CollectionTest.testSuite(new ComparatorImplementation())); |
44 |
|
} |
45 |
|
|
46 |
|
static class MyReverseComparator implements Comparator, java.io.Serializable { |
436 |
|
*/ |
437 |
|
public void testToArray() { |
438 |
|
PriorityQueue q = populatedQueue(SIZE); |
439 |
< |
Object[] o = q.toArray(); |
440 |
< |
Arrays.sort(o); |
441 |
< |
for (int i = 0; i < o.length; i++) |
442 |
< |
assertSame(o[i], q.poll()); |
439 |
> |
Object[] a = q.toArray(); |
440 |
> |
assertSame(Object[].class, a.getClass()); |
441 |
> |
Arrays.sort(a); |
442 |
> |
for (Object o : a) |
443 |
> |
assertSame(o, q.poll()); |
444 |
> |
assertTrue(q.isEmpty()); |
445 |
|
} |
446 |
|
|
447 |
|
/** |
453 |
|
Integer[] array = q.toArray(ints); |
454 |
|
assertSame(ints, array); |
455 |
|
Arrays.sort(ints); |
456 |
< |
for (int i = 0; i < ints.length; i++) |
457 |
< |
assertSame(ints[i], q.poll()); |
456 |
> |
for (Integer o : ints) |
457 |
> |
assertSame(o, q.poll()); |
458 |
> |
assertTrue(q.isEmpty()); |
459 |
|
} |
460 |
|
|
461 |
|
/** |