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 |
|
/** |
55 |
< |
* A delayed implementation for testing. |
56 |
< |
* Most tests use Pseudodelays, where delays are all elapsed |
55 |
> |
* A fake Delayed implementation for testing. |
56 |
> |
* Most tests use PDelays, where delays are all elapsed |
57 |
|
* (so, no blocking solely for delays) but are still ordered |
58 |
|
*/ |
59 |
|
static class PDelay implements Delayed { |
60 |
< |
int pseudodelay; |
61 |
< |
PDelay(int i) { pseudodelay = i; } |
54 |
< |
public int compareTo(PDelay other) { |
55 |
< |
int a = this.pseudodelay; |
56 |
< |
int b = other.pseudodelay; |
57 |
< |
return (a < b) ? -1 : (a > b) ? 1 : 0; |
58 |
< |
} |
60 |
> |
final int pseudodelay; |
61 |
> |
PDelay(int pseudodelay) { this.pseudodelay = pseudodelay; } |
62 |
|
public int compareTo(Delayed y) { |
63 |
< |
return compareTo((PDelay)y); |
63 |
> |
return Integer.compare(this.pseudodelay, ((PDelay)y).pseudodelay); |
64 |
|
} |
65 |
|
public boolean equals(Object other) { |
66 |
|
return (other instanceof PDelay) && |
69 |
|
// suppress [overrides] javac warning |
70 |
|
public int hashCode() { return pseudodelay; } |
71 |
|
public long getDelay(TimeUnit ignore) { |
72 |
< |
return Integer.MIN_VALUE + pseudodelay; |
72 |
> |
return (long) Integer.MIN_VALUE + pseudodelay; |
73 |
|
} |
74 |
|
public String toString() { |
75 |
|
return String.valueOf(pseudodelay); |
80 |
|
* Delayed implementation that actually delays |
81 |
|
*/ |
82 |
|
static class NanoDelay implements Delayed { |
83 |
< |
long trigger; |
83 |
> |
final long trigger; |
84 |
|
NanoDelay(long i) { |
85 |
|
trigger = System.nanoTime() + i; |
86 |
|
} |
84 |
– |
public int compareTo(NanoDelay y) { |
85 |
– |
long i = trigger; |
86 |
– |
long j = y.trigger; |
87 |
– |
if (i < j) return -1; |
88 |
– |
if (i > j) return 1; |
89 |
– |
return 0; |
90 |
– |
} |
87 |
|
|
88 |
|
public int compareTo(Delayed y) { |
89 |
< |
return compareTo((NanoDelay)y); |
89 |
> |
return Long.compare(trigger, ((NanoDelay)y).trigger); |
90 |
|
} |
91 |
|
|
92 |
|
public boolean equals(Object other) { |
113 |
|
|
114 |
|
/** |
115 |
|
* Returns a new queue of given size containing consecutive |
116 |
< |
* PDelays 0 ... n. |
116 |
> |
* PDelays 0 ... n - 1. |
117 |
|
*/ |
118 |
< |
private DelayQueue<PDelay> populatedQueue(int n) { |
119 |
< |
DelayQueue<PDelay> q = new DelayQueue<PDelay>(); |
118 |
> |
private static DelayQueue<PDelay> populatedQueue(int n) { |
119 |
> |
DelayQueue<PDelay> q = new DelayQueue<>(); |
120 |
|
assertTrue(q.isEmpty()); |
121 |
|
for (int i = n - 1; i >= 0; i -= 2) |
122 |
|
assertTrue(q.offer(new PDelay(i))); |
123 |
|
for (int i = (n & 1); i < n; i += 2) |
124 |
|
assertTrue(q.offer(new PDelay(i))); |
125 |
|
assertFalse(q.isEmpty()); |
126 |
< |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
127 |
< |
assertEquals(n, q.size()); |
126 |
> |
mustEqual(Integer.MAX_VALUE, q.remainingCapacity()); |
127 |
> |
mustEqual(n, q.size()); |
128 |
> |
mustEqual(new PDelay(0), q.peek()); |
129 |
|
return q; |
130 |
|
} |
131 |
|
|
133 |
|
* A new queue has unbounded capacity |
134 |
|
*/ |
135 |
|
public void testConstructor1() { |
136 |
< |
assertEquals(Integer.MAX_VALUE, new DelayQueue().remainingCapacity()); |
136 |
> |
mustEqual(Integer.MAX_VALUE, new DelayQueue<PDelay>().remainingCapacity()); |
137 |
|
} |
138 |
|
|
139 |
|
/** |
141 |
|
*/ |
142 |
|
public void testConstructor3() { |
143 |
|
try { |
144 |
< |
new DelayQueue(null); |
144 |
> |
new DelayQueue<PDelay>(null); |
145 |
|
shouldThrow(); |
146 |
|
} catch (NullPointerException success) {} |
147 |
|
} |
151 |
|
*/ |
152 |
|
public void testConstructor4() { |
153 |
|
try { |
154 |
< |
new DelayQueue(Arrays.asList(new PDelay[SIZE])); |
154 |
> |
new DelayQueue<PDelay>(Arrays.asList(new PDelay[SIZE])); |
155 |
|
shouldThrow(); |
156 |
|
} catch (NullPointerException success) {} |
157 |
|
} |
164 |
|
for (int i = 0; i < SIZE - 1; ++i) |
165 |
|
a[i] = new PDelay(i); |
166 |
|
try { |
167 |
< |
new DelayQueue(Arrays.asList(a)); |
167 |
> |
new DelayQueue<PDelay>(Arrays.asList(a)); |
168 |
|
shouldThrow(); |
169 |
|
} catch (NullPointerException success) {} |
170 |
|
} |
173 |
|
* Queue contains all elements of collection used to initialize |
174 |
|
*/ |
175 |
|
public void testConstructor6() { |
176 |
< |
PDelay[] ints = new PDelay[SIZE]; |
176 |
> |
PDelay[] items = new PDelay[SIZE]; |
177 |
|
for (int i = 0; i < SIZE; ++i) |
178 |
< |
ints[i] = new PDelay(i); |
179 |
< |
DelayQueue q = new DelayQueue(Arrays.asList(ints)); |
178 |
> |
items[i] = new PDelay(i); |
179 |
> |
DelayQueue<PDelay> q = new DelayQueue<>(Arrays.asList(items)); |
180 |
|
for (int i = 0; i < SIZE; ++i) |
181 |
< |
assertEquals(ints[i], q.poll()); |
181 |
> |
mustEqual(items[i], q.poll()); |
182 |
|
} |
183 |
|
|
184 |
|
/** |
185 |
|
* isEmpty is true before add, false after |
186 |
|
*/ |
187 |
|
public void testEmpty() { |
188 |
< |
DelayQueue q = new DelayQueue(); |
188 |
> |
DelayQueue<PDelay> q = new DelayQueue<>(); |
189 |
|
assertTrue(q.isEmpty()); |
190 |
< |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
190 |
> |
mustEqual(Integer.MAX_VALUE, q.remainingCapacity()); |
191 |
|
q.add(new PDelay(1)); |
192 |
|
assertFalse(q.isEmpty()); |
193 |
|
q.add(new PDelay(2)); |
200 |
|
* remainingCapacity() always returns Integer.MAX_VALUE |
201 |
|
*/ |
202 |
|
public void testRemainingCapacity() { |
203 |
< |
BlockingQueue q = populatedQueue(SIZE); |
203 |
> |
BlockingQueue<PDelay> q = populatedQueue(SIZE); |
204 |
|
for (int i = 0; i < SIZE; ++i) { |
205 |
< |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
206 |
< |
assertEquals(SIZE - i, q.size()); |
205 |
> |
mustEqual(Integer.MAX_VALUE, q.remainingCapacity()); |
206 |
> |
mustEqual(SIZE - i, q.size()); |
207 |
|
assertTrue(q.remove() instanceof PDelay); |
208 |
|
} |
209 |
|
for (int i = 0; i < SIZE; ++i) { |
210 |
< |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
211 |
< |
assertEquals(i, q.size()); |
210 |
> |
mustEqual(Integer.MAX_VALUE, q.remainingCapacity()); |
211 |
> |
mustEqual(i, q.size()); |
212 |
|
assertTrue(q.add(new PDelay(i))); |
213 |
|
} |
214 |
|
} |
217 |
|
* offer non-null succeeds |
218 |
|
*/ |
219 |
|
public void testOffer() { |
220 |
< |
DelayQueue q = new DelayQueue(); |
220 |
> |
DelayQueue<PDelay> q = new DelayQueue<>(); |
221 |
|
assertTrue(q.offer(new PDelay(0))); |
222 |
|
assertTrue(q.offer(new PDelay(1))); |
223 |
|
} |
226 |
|
* add succeeds |
227 |
|
*/ |
228 |
|
public void testAdd() { |
229 |
< |
DelayQueue q = new DelayQueue(); |
229 |
> |
DelayQueue<PDelay> q = new DelayQueue<>(); |
230 |
|
for (int i = 0; i < SIZE; ++i) { |
231 |
< |
assertEquals(i, q.size()); |
231 |
> |
mustEqual(i, q.size()); |
232 |
|
assertTrue(q.add(new PDelay(i))); |
233 |
|
} |
234 |
|
} |
235 |
|
|
236 |
|
/** |
237 |
< |
* addAll(this) throws IAE |
237 |
> |
* addAll(this) throws IllegalArgumentException |
238 |
|
*/ |
239 |
|
public void testAddAllSelf() { |
240 |
< |
DelayQueue q = populatedQueue(SIZE); |
240 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
241 |
|
try { |
242 |
|
q.addAll(q); |
243 |
|
shouldThrow(); |
249 |
|
* possibly adding some elements |
250 |
|
*/ |
251 |
|
public void testAddAll3() { |
252 |
< |
DelayQueue q = new DelayQueue(); |
252 |
> |
DelayQueue<PDelay> q = new DelayQueue<>(); |
253 |
|
PDelay[] a = new PDelay[SIZE]; |
254 |
|
for (int i = 0; i < SIZE - 1; ++i) |
255 |
|
a[i] = new PDelay(i); |
264 |
|
*/ |
265 |
|
public void testAddAll5() { |
266 |
|
PDelay[] empty = new PDelay[0]; |
267 |
< |
PDelay[] ints = new PDelay[SIZE]; |
267 |
> |
PDelay[] items = new PDelay[SIZE]; |
268 |
|
for (int i = SIZE - 1; i >= 0; --i) |
269 |
< |
ints[i] = new PDelay(i); |
270 |
< |
DelayQueue q = new DelayQueue(); |
269 |
> |
items[i] = new PDelay(i); |
270 |
> |
DelayQueue<PDelay> q = new DelayQueue<>(); |
271 |
|
assertFalse(q.addAll(Arrays.asList(empty))); |
272 |
< |
assertTrue(q.addAll(Arrays.asList(ints))); |
272 |
> |
assertTrue(q.addAll(Arrays.asList(items))); |
273 |
|
for (int i = 0; i < SIZE; ++i) |
274 |
< |
assertEquals(ints[i], q.poll()); |
274 |
> |
mustEqual(items[i], q.poll()); |
275 |
|
} |
276 |
|
|
277 |
|
/** |
278 |
|
* all elements successfully put are contained |
279 |
|
*/ |
280 |
|
public void testPut() { |
281 |
< |
DelayQueue q = new DelayQueue(); |
281 |
> |
DelayQueue<PDelay> q = new DelayQueue<>(); |
282 |
|
for (int i = 0; i < SIZE; ++i) { |
283 |
|
PDelay x = new PDelay(i); |
284 |
|
q.put(x); |
285 |
|
assertTrue(q.contains(x)); |
286 |
|
} |
287 |
< |
assertEquals(SIZE, q.size()); |
287 |
> |
mustEqual(SIZE, q.size()); |
288 |
|
} |
289 |
|
|
290 |
|
/** |
291 |
|
* put doesn't block waiting for take |
292 |
|
*/ |
293 |
|
public void testPutWithTake() throws InterruptedException { |
294 |
< |
final DelayQueue q = new DelayQueue(); |
294 |
> |
final DelayQueue<PDelay> q = new DelayQueue<>(); |
295 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
296 |
|
public void realRun() { |
297 |
|
q.put(new PDelay(0)); |
301 |
|
}}); |
302 |
|
|
303 |
|
awaitTermination(t); |
304 |
< |
assertEquals(4, q.size()); |
304 |
> |
mustEqual(4, q.size()); |
305 |
|
} |
306 |
|
|
307 |
|
/** |
308 |
< |
* timed offer does not time out |
308 |
> |
* Queue is unbounded, so timed offer never times out |
309 |
|
*/ |
310 |
|
public void testTimedOffer() throws InterruptedException { |
311 |
< |
final DelayQueue q = new DelayQueue(); |
311 |
> |
final DelayQueue<PDelay> q = new DelayQueue<>(); |
312 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
313 |
|
public void realRun() throws InterruptedException { |
314 |
|
q.put(new PDelay(0)); |
324 |
|
* take retrieves elements in priority order |
325 |
|
*/ |
326 |
|
public void testTake() throws InterruptedException { |
327 |
< |
DelayQueue q = populatedQueue(SIZE); |
327 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
328 |
|
for (int i = 0; i < SIZE; ++i) { |
329 |
< |
assertEquals(new PDelay(i), q.take()); |
329 |
> |
mustEqual(new PDelay(i), q.take()); |
330 |
|
} |
331 |
|
} |
332 |
|
|
334 |
|
* Take removes existing elements until empty, then blocks interruptibly |
335 |
|
*/ |
336 |
|
public void testBlockingTake() throws InterruptedException { |
337 |
< |
final DelayQueue q = populatedQueue(SIZE); |
337 |
> |
final DelayQueue<PDelay> q = populatedQueue(SIZE); |
338 |
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
339 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
340 |
|
public void realRun() throws InterruptedException { |
341 |
< |
for (int i = 0; i < SIZE; ++i) { |
342 |
< |
assertEquals(new PDelay(i), ((PDelay)q.take())); |
346 |
< |
} |
341 |
> |
for (int i = 0; i < SIZE; i++) |
342 |
> |
mustEqual(new PDelay(i), q.take()); |
343 |
|
|
344 |
|
Thread.currentThread().interrupt(); |
345 |
|
try { |
357 |
|
}}); |
358 |
|
|
359 |
|
await(pleaseInterrupt); |
360 |
< |
assertThreadStaysAlive(t); |
360 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING); |
361 |
|
t.interrupt(); |
362 |
|
awaitTermination(t); |
363 |
|
} |
366 |
|
* poll succeeds unless empty |
367 |
|
*/ |
368 |
|
public void testPoll() { |
369 |
< |
DelayQueue q = populatedQueue(SIZE); |
369 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
370 |
|
for (int i = 0; i < SIZE; ++i) { |
371 |
< |
assertEquals(new PDelay(i), q.poll()); |
371 |
> |
mustEqual(new PDelay(i), q.poll()); |
372 |
|
} |
373 |
|
assertNull(q.poll()); |
374 |
|
} |
377 |
|
* timed poll with zero timeout succeeds when non-empty, else times out |
378 |
|
*/ |
379 |
|
public void testTimedPoll0() throws InterruptedException { |
380 |
< |
DelayQueue q = populatedQueue(SIZE); |
380 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
381 |
|
for (int i = 0; i < SIZE; ++i) { |
382 |
< |
assertEquals(new PDelay(i), q.poll(0, MILLISECONDS)); |
382 |
> |
mustEqual(new PDelay(i), q.poll(0, MILLISECONDS)); |
383 |
|
} |
384 |
|
assertNull(q.poll(0, MILLISECONDS)); |
385 |
|
} |
388 |
|
* timed poll with nonzero timeout succeeds when non-empty, else times out |
389 |
|
*/ |
390 |
|
public void testTimedPoll() throws InterruptedException { |
391 |
< |
DelayQueue q = populatedQueue(SIZE); |
391 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
392 |
|
for (int i = 0; i < SIZE; ++i) { |
393 |
|
long startTime = System.nanoTime(); |
394 |
< |
assertEquals(new PDelay(i), q.poll(LONG_DELAY_MS, MILLISECONDS)); |
394 |
> |
mustEqual(new PDelay(i), q.poll(LONG_DELAY_MS, MILLISECONDS)); |
395 |
|
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
396 |
|
} |
397 |
|
long startTime = System.nanoTime(); |
406 |
|
*/ |
407 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
408 |
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
409 |
< |
final DelayQueue q = populatedQueue(SIZE); |
409 |
> |
final DelayQueue<PDelay> q = populatedQueue(SIZE); |
410 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
411 |
|
public void realRun() throws InterruptedException { |
412 |
< |
long startTime = System.nanoTime(); |
413 |
< |
for (int i = 0; i < SIZE; ++i) { |
414 |
< |
assertEquals(new PDelay(i), |
419 |
< |
((PDelay)q.poll(LONG_DELAY_MS, MILLISECONDS))); |
420 |
< |
} |
412 |
> |
for (int i = 0; i < SIZE; i++) |
413 |
> |
mustEqual(new PDelay(i), |
414 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS)); |
415 |
|
|
416 |
|
Thread.currentThread().interrupt(); |
417 |
|
try { |
418 |
< |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
418 |
> |
q.poll(randomTimeout(), randomTimeUnit()); |
419 |
|
shouldThrow(); |
420 |
|
} catch (InterruptedException success) {} |
421 |
|
assertFalse(Thread.interrupted()); |
422 |
|
|
423 |
|
pleaseInterrupt.countDown(); |
424 |
|
try { |
425 |
< |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
425 |
> |
q.poll(LONGER_DELAY_MS, MILLISECONDS); |
426 |
|
shouldThrow(); |
427 |
|
} catch (InterruptedException success) {} |
428 |
|
assertFalse(Thread.interrupted()); |
435 |
– |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
429 |
|
}}); |
430 |
|
|
431 |
|
await(pleaseInterrupt); |
432 |
< |
assertThreadStaysAlive(t); |
432 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
433 |
|
t.interrupt(); |
434 |
|
awaitTermination(t); |
435 |
|
checkEmpty(q); |
439 |
|
* peek returns next element, or null if empty |
440 |
|
*/ |
441 |
|
public void testPeek() { |
442 |
< |
DelayQueue q = populatedQueue(SIZE); |
442 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
443 |
|
for (int i = 0; i < SIZE; ++i) { |
444 |
< |
assertEquals(new PDelay(i), q.peek()); |
445 |
< |
assertEquals(new PDelay(i), q.poll()); |
444 |
> |
mustEqual(new PDelay(i), q.peek()); |
445 |
> |
mustEqual(new PDelay(i), q.poll()); |
446 |
|
if (q.isEmpty()) |
447 |
|
assertNull(q.peek()); |
448 |
|
else |
455 |
|
* element returns next element, or throws NSEE if empty |
456 |
|
*/ |
457 |
|
public void testElement() { |
458 |
< |
DelayQueue q = populatedQueue(SIZE); |
458 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
459 |
|
for (int i = 0; i < SIZE; ++i) { |
460 |
< |
assertEquals(new PDelay(i), q.element()); |
460 |
> |
mustEqual(new PDelay(i), q.element()); |
461 |
|
q.poll(); |
462 |
|
} |
463 |
|
try { |
470 |
|
* remove removes next element, or throws NSEE if empty |
471 |
|
*/ |
472 |
|
public void testRemove() { |
473 |
< |
DelayQueue q = populatedQueue(SIZE); |
473 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
474 |
|
for (int i = 0; i < SIZE; ++i) { |
475 |
< |
assertEquals(new PDelay(i), q.remove()); |
475 |
> |
mustEqual(new PDelay(i), q.remove()); |
476 |
|
} |
477 |
|
try { |
478 |
|
q.remove(); |
484 |
|
* contains(x) reports true when elements added but not yet removed |
485 |
|
*/ |
486 |
|
public void testContains() { |
487 |
< |
DelayQueue q = populatedQueue(SIZE); |
487 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
488 |
|
for (int i = 0; i < SIZE; ++i) { |
489 |
|
assertTrue(q.contains(new PDelay(i))); |
490 |
|
q.poll(); |
496 |
|
* clear removes all elements |
497 |
|
*/ |
498 |
|
public void testClear() { |
499 |
< |
DelayQueue q = populatedQueue(SIZE); |
499 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
500 |
|
q.clear(); |
501 |
|
assertTrue(q.isEmpty()); |
502 |
< |
assertEquals(0, q.size()); |
503 |
< |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
502 |
> |
mustEqual(0, q.size()); |
503 |
> |
mustEqual(Integer.MAX_VALUE, q.remainingCapacity()); |
504 |
|
PDelay x = new PDelay(1); |
505 |
|
q.add(x); |
506 |
|
assertFalse(q.isEmpty()); |
513 |
|
* containsAll(c) is true when c contains a subset of elements |
514 |
|
*/ |
515 |
|
public void testContainsAll() { |
516 |
< |
DelayQueue q = populatedQueue(SIZE); |
517 |
< |
DelayQueue p = new DelayQueue(); |
516 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
517 |
> |
DelayQueue<PDelay> p = new DelayQueue<>(); |
518 |
|
for (int i = 0; i < SIZE; ++i) { |
519 |
|
assertTrue(q.containsAll(p)); |
520 |
|
assertFalse(p.containsAll(q)); |
527 |
|
* retainAll(c) retains only those elements of c and reports true if changed |
528 |
|
*/ |
529 |
|
public void testRetainAll() { |
530 |
< |
DelayQueue q = populatedQueue(SIZE); |
531 |
< |
DelayQueue p = populatedQueue(SIZE); |
530 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
531 |
> |
DelayQueue<PDelay> p = populatedQueue(SIZE); |
532 |
|
for (int i = 0; i < SIZE; ++i) { |
533 |
|
boolean changed = q.retainAll(p); |
534 |
|
if (i == 0) |
537 |
|
assertTrue(changed); |
538 |
|
|
539 |
|
assertTrue(q.containsAll(p)); |
540 |
< |
assertEquals(SIZE - i, q.size()); |
540 |
> |
mustEqual(SIZE - i, q.size()); |
541 |
|
p.remove(); |
542 |
|
} |
543 |
|
} |
547 |
|
*/ |
548 |
|
public void testRemoveAll() { |
549 |
|
for (int i = 1; i < SIZE; ++i) { |
550 |
< |
DelayQueue q = populatedQueue(SIZE); |
551 |
< |
DelayQueue p = populatedQueue(i); |
550 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
551 |
> |
DelayQueue<PDelay> p = populatedQueue(i); |
552 |
|
assertTrue(q.removeAll(p)); |
553 |
< |
assertEquals(SIZE - i, q.size()); |
553 |
> |
mustEqual(SIZE - i, q.size()); |
554 |
|
for (int j = 0; j < i; ++j) { |
555 |
< |
PDelay x = (PDelay)(p.remove()); |
563 |
< |
assertFalse(q.contains(x)); |
555 |
> |
assertFalse(q.contains(p.remove())); |
556 |
|
} |
557 |
|
} |
558 |
|
} |
561 |
|
* toArray contains all elements |
562 |
|
*/ |
563 |
|
public void testToArray() throws InterruptedException { |
564 |
< |
DelayQueue q = populatedQueue(SIZE); |
565 |
< |
Object[] o = q.toArray(); |
566 |
< |
Arrays.sort(o); |
567 |
< |
for (int i = 0; i < o.length; i++) |
568 |
< |
assertSame(o[i], q.take()); |
564 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
565 |
> |
Object[] a = q.toArray(); |
566 |
> |
assertSame(Object[].class, a.getClass()); |
567 |
> |
Arrays.sort(a); |
568 |
> |
for (Object o : a) |
569 |
> |
assertSame(o, q.take()); |
570 |
> |
assertTrue(q.isEmpty()); |
571 |
|
} |
572 |
|
|
573 |
|
/** |
575 |
|
*/ |
576 |
|
public void testToArray2() { |
577 |
|
DelayQueue<PDelay> q = populatedQueue(SIZE); |
578 |
< |
PDelay[] ints = new PDelay[SIZE]; |
579 |
< |
PDelay[] array = q.toArray(ints); |
580 |
< |
assertSame(ints, array); |
581 |
< |
Arrays.sort(ints); |
582 |
< |
for (int i = 0; i < ints.length; i++) |
583 |
< |
assertSame(ints[i], q.remove()); |
578 |
> |
PDelay[] items = new PDelay[SIZE]; |
579 |
> |
PDelay[] array = q.toArray(items); |
580 |
> |
assertSame(items, array); |
581 |
> |
Arrays.sort(items); |
582 |
> |
for (PDelay o : items) |
583 |
> |
assertSame(o, q.remove()); |
584 |
> |
assertTrue(q.isEmpty()); |
585 |
|
} |
586 |
|
|
587 |
|
/** |
588 |
|
* toArray(incompatible array type) throws ArrayStoreException |
589 |
|
*/ |
590 |
< |
public void testToArray1_BadArg() { |
591 |
< |
DelayQueue q = populatedQueue(SIZE); |
590 |
> |
@SuppressWarnings("CollectionToArraySafeParameter") |
591 |
> |
public void testToArray_incompatibleArrayType() { |
592 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
593 |
|
try { |
594 |
|
q.toArray(new String[10]); |
595 |
|
shouldThrow(); |
600 |
|
* iterator iterates through all elements |
601 |
|
*/ |
602 |
|
public void testIterator() { |
603 |
< |
DelayQueue q = populatedQueue(SIZE); |
603 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
604 |
|
int i = 0; |
605 |
< |
Iterator it = q.iterator(); |
605 |
> |
Iterator<PDelay> it = q.iterator(); |
606 |
|
while (it.hasNext()) { |
607 |
|
assertTrue(q.contains(it.next())); |
608 |
|
++i; |
609 |
|
} |
610 |
< |
assertEquals(i, SIZE); |
610 |
> |
mustEqual(i, SIZE); |
611 |
|
assertIteratorExhausted(it); |
612 |
|
} |
613 |
|
|
615 |
|
* iterator of empty collection has no elements |
616 |
|
*/ |
617 |
|
public void testEmptyIterator() { |
618 |
< |
assertIteratorExhausted(new DelayQueue().iterator()); |
618 |
> |
assertIteratorExhausted(new DelayQueue<PDelay>().iterator()); |
619 |
|
} |
620 |
|
|
621 |
|
/** |
622 |
|
* iterator.remove removes current element |
623 |
|
*/ |
624 |
|
public void testIteratorRemove() { |
625 |
< |
final DelayQueue q = new DelayQueue(); |
625 |
> |
final DelayQueue<PDelay> q = new DelayQueue<>(); |
626 |
|
q.add(new PDelay(2)); |
627 |
|
q.add(new PDelay(1)); |
628 |
|
q.add(new PDelay(3)); |
629 |
< |
Iterator it = q.iterator(); |
629 |
> |
Iterator<PDelay> it = q.iterator(); |
630 |
|
it.next(); |
631 |
|
it.remove(); |
632 |
|
it = q.iterator(); |
633 |
< |
assertEquals(new PDelay(2), it.next()); |
634 |
< |
assertEquals(new PDelay(3), it.next()); |
633 |
> |
mustEqual(new PDelay(2), it.next()); |
634 |
> |
mustEqual(new PDelay(3), it.next()); |
635 |
|
assertFalse(it.hasNext()); |
636 |
|
} |
637 |
|
|
639 |
|
* toString contains toStrings of elements |
640 |
|
*/ |
641 |
|
public void testToString() { |
642 |
< |
DelayQueue q = populatedQueue(SIZE); |
642 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
643 |
|
String s = q.toString(); |
644 |
|
for (Object e : q) |
645 |
|
assertTrue(s.contains(e.toString())); |
649 |
|
* timed poll transfers elements across Executor tasks |
650 |
|
*/ |
651 |
|
public void testPollInExecutor() { |
652 |
< |
final DelayQueue q = new DelayQueue(); |
652 |
> |
final DelayQueue<PDelay> q = new DelayQueue<>(); |
653 |
|
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
654 |
|
final ExecutorService executor = Executors.newFixedThreadPool(2); |
655 |
|
try (PoolCleaner cleaner = cleaner(executor)) { |
673 |
|
* Delayed actions do not occur until their delay elapses |
674 |
|
*/ |
675 |
|
public void testDelay() throws InterruptedException { |
676 |
< |
DelayQueue<NanoDelay> q = new DelayQueue<NanoDelay>(); |
676 |
> |
DelayQueue<NanoDelay> q = new DelayQueue<>(); |
677 |
|
for (int i = 0; i < SIZE; ++i) |
678 |
|
q.add(new NanoDelay(1000000L * (SIZE - i))); |
679 |
|
|
693 |
|
* peek of a non-empty queue returns non-null even if not expired |
694 |
|
*/ |
695 |
|
public void testPeekDelayed() { |
696 |
< |
DelayQueue q = new DelayQueue(); |
696 |
> |
DelayQueue<NanoDelay> q = new DelayQueue<>(); |
697 |
|
q.add(new NanoDelay(Long.MAX_VALUE)); |
698 |
|
assertNotNull(q.peek()); |
699 |
|
} |
702 |
|
* poll of a non-empty queue returns null if no expired elements. |
703 |
|
*/ |
704 |
|
public void testPollDelayed() { |
705 |
< |
DelayQueue q = new DelayQueue(); |
705 |
> |
DelayQueue<NanoDelay> q = new DelayQueue<>(); |
706 |
|
q.add(new NanoDelay(Long.MAX_VALUE)); |
707 |
|
assertNull(q.poll()); |
708 |
|
} |
711 |
|
* timed poll of a non-empty queue returns null if no expired elements. |
712 |
|
*/ |
713 |
|
public void testTimedPollDelayed() throws InterruptedException { |
714 |
< |
DelayQueue q = new DelayQueue(); |
714 |
> |
DelayQueue<NanoDelay> q = new DelayQueue<>(); |
715 |
|
q.add(new NanoDelay(LONG_DELAY_MS * 1000000L)); |
716 |
+ |
long startTime = System.nanoTime(); |
717 |
|
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
718 |
+ |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
719 |
|
} |
720 |
|
|
721 |
|
/** |
722 |
|
* drainTo(c) empties queue into another collection c |
723 |
|
*/ |
724 |
|
public void testDrainTo() { |
725 |
< |
DelayQueue q = new DelayQueue(); |
725 |
> |
DelayQueue<PDelay> q = new DelayQueue<>(); |
726 |
|
PDelay[] elems = new PDelay[SIZE]; |
727 |
|
for (int i = 0; i < SIZE; ++i) { |
728 |
|
elems[i] = new PDelay(i); |
729 |
|
q.add(elems[i]); |
730 |
|
} |
731 |
< |
ArrayList l = new ArrayList(); |
731 |
> |
ArrayList<PDelay> l = new ArrayList<>(); |
732 |
|
q.drainTo(l); |
733 |
< |
assertEquals(0, q.size()); |
733 |
> |
mustEqual(0, q.size()); |
734 |
|
for (int i = 0; i < SIZE; ++i) |
735 |
< |
assertEquals(elems[i], l.get(i)); |
735 |
> |
mustEqual(elems[i], l.get(i)); |
736 |
|
q.add(elems[0]); |
737 |
|
q.add(elems[1]); |
738 |
|
assertFalse(q.isEmpty()); |
740 |
|
assertTrue(q.contains(elems[1])); |
741 |
|
l.clear(); |
742 |
|
q.drainTo(l); |
743 |
< |
assertEquals(0, q.size()); |
744 |
< |
assertEquals(2, l.size()); |
743 |
> |
mustEqual(0, q.size()); |
744 |
> |
mustEqual(2, l.size()); |
745 |
|
for (int i = 0; i < 2; ++i) |
746 |
< |
assertEquals(elems[i], l.get(i)); |
746 |
> |
mustEqual(elems[i], l.get(i)); |
747 |
|
} |
748 |
|
|
749 |
|
/** |
750 |
|
* drainTo empties queue |
751 |
|
*/ |
752 |
|
public void testDrainToWithActivePut() throws InterruptedException { |
753 |
< |
final DelayQueue q = populatedQueue(SIZE); |
753 |
> |
final DelayQueue<PDelay> q = populatedQueue(SIZE); |
754 |
|
Thread t = new Thread(new CheckedRunnable() { |
755 |
|
public void realRun() { |
756 |
|
q.put(new PDelay(SIZE + 1)); |
757 |
|
}}); |
758 |
|
|
759 |
|
t.start(); |
760 |
< |
ArrayList l = new ArrayList(); |
760 |
> |
ArrayList<PDelay> l = new ArrayList<>(); |
761 |
|
q.drainTo(l); |
762 |
|
assertTrue(l.size() >= SIZE); |
763 |
|
t.join(); |
769 |
|
*/ |
770 |
|
public void testDrainToN() { |
771 |
|
for (int i = 0; i < SIZE + 2; ++i) { |
772 |
< |
DelayQueue q = populatedQueue(SIZE); |
773 |
< |
ArrayList l = new ArrayList(); |
772 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
773 |
> |
ArrayList<PDelay> l = new ArrayList<>(); |
774 |
|
q.drainTo(l, i); |
775 |
|
int k = (i < SIZE) ? i : SIZE; |
776 |
< |
assertEquals(SIZE - k, q.size()); |
777 |
< |
assertEquals(k, l.size()); |
776 |
> |
mustEqual(SIZE - k, q.size()); |
777 |
> |
mustEqual(k, l.size()); |
778 |
|
} |
779 |
|
} |
780 |
|
|