39 |
|
} |
40 |
|
|
41 |
|
public static Test suite() { |
42 |
+ |
class Implementation implements CollectionImplementation { |
43 |
+ |
public Class<?> klazz() { return DelayQueue.class; } |
44 |
+ |
public Collection emptyCollection() { return new DelayQueue(); } |
45 |
+ |
public Object makeElement(int i) { return new PDelay(i); } |
46 |
+ |
public boolean isConcurrent() { return true; } |
47 |
+ |
public boolean permitsNulls() { return false; } |
48 |
+ |
} |
49 |
|
return newTestSuite(DelayQueueTest.class, |
50 |
< |
new Generic().testSuite()); |
50 |
> |
new Generic().testSuite(), |
51 |
> |
CollectionTest.testSuite(new Implementation())); |
52 |
|
} |
53 |
|
|
54 |
|
/** |
125 |
|
|
126 |
|
/** |
127 |
|
* Returns a new queue of given size containing consecutive |
128 |
< |
* PDelays 0 ... n. |
128 |
> |
* PDelays 0 ... n - 1. |
129 |
|
*/ |
130 |
|
private DelayQueue<PDelay> populatedQueue(int n) { |
131 |
|
DelayQueue<PDelay> q = new DelayQueue<PDelay>(); |
137 |
|
assertFalse(q.isEmpty()); |
138 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
139 |
|
assertEquals(n, q.size()); |
140 |
+ |
assertEquals(new PDelay(0), q.peek()); |
141 |
|
return q; |
142 |
|
} |
143 |
|
|