22 |
|
main(suite(), args); |
23 |
|
} |
24 |
|
public static Test suite() { |
25 |
< |
return new TestSuite(PriorityQueueTest.class); |
25 |
> |
class Implementation implements CollectionImplementation { |
26 |
> |
public Class<?> klazz() { return PriorityQueue.class; } |
27 |
> |
public Collection emptyCollection() { return new PriorityQueue(); } |
28 |
> |
public Object makeElement(int i) { return i; } |
29 |
> |
public boolean isConcurrent() { return false; } |
30 |
> |
public boolean permitsNulls() { return false; } |
31 |
> |
} |
32 |
> |
return newTestSuite(PriorityQueueTest.class, |
33 |
> |
CollectionTest.testSuite(new Implementation())); |
34 |
|
} |
35 |
|
|
36 |
|
static class MyReverseComparator implements Comparator { |
44 |
|
* Integers 0 ... n - 1. |
45 |
|
*/ |
46 |
|
private PriorityQueue<Integer> populatedQueue(int n) { |
47 |
< |
PriorityQueue<Integer> q = new PriorityQueue<Integer>(n); |
47 |
> |
PriorityQueue<Integer> q = new PriorityQueue<>(n); |
48 |
|
assertTrue(q.isEmpty()); |
49 |
|
for (int i = n - 1; i >= 0; i -= 2) |
50 |
|
assertTrue(q.offer(new Integer(i))); |