1 |
|
/* |
2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
|
* Expert Group and released to the public domain, as explained at |
4 |
< |
* http://creativecommons.org/licenses/publicdomain |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
|
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
|
import junit.framework.*; |
10 |
< |
import java.util.*; |
10 |
> |
import java.util.Arrays; |
11 |
> |
import java.util.ArrayList; |
12 |
> |
import java.util.Iterator; |
13 |
> |
import java.util.NoSuchElementException; |
14 |
> |
import java.util.concurrent.BlockingQueue; |
15 |
> |
import java.util.concurrent.CountDownLatch; |
16 |
> |
import java.util.concurrent.Delayed; |
17 |
> |
import java.util.concurrent.DelayQueue; |
18 |
> |
import java.util.concurrent.Executors; |
19 |
> |
import java.util.concurrent.ExecutorService; |
20 |
> |
import java.util.concurrent.TimeUnit; |
21 |
|
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
12 |
– |
import java.util.concurrent.*; |
22 |
|
|
23 |
|
public class DelayQueueTest extends JSR166TestCase { |
24 |
+ |
|
25 |
+ |
public static class Generic extends BlockingQueueTest { |
26 |
+ |
protected BlockingQueue emptyCollection() { |
27 |
+ |
return new DelayQueue(); |
28 |
+ |
} |
29 |
+ |
protected PDelay makeElement(int i) { |
30 |
+ |
return new PDelay(i); |
31 |
+ |
} |
32 |
+ |
} |
33 |
+ |
|
34 |
|
public static void main(String[] args) { |
35 |
|
junit.textui.TestRunner.run(suite()); |
36 |
|
} |
37 |
|
|
38 |
|
public static Test suite() { |
39 |
< |
return new TestSuite(DelayQueueTest.class); |
39 |
> |
return newTestSuite(DelayQueueTest.class, |
40 |
> |
new Generic().testSuite()); |
41 |
|
} |
42 |
|
|
43 |
|
private static final int NOCAP = Integer.MAX_VALUE; |
49 |
|
*/ |
50 |
|
static class PDelay implements Delayed { |
51 |
|
int pseudodelay; |
52 |
< |
PDelay(int i) { pseudodelay = Integer.MIN_VALUE + i; } |
53 |
< |
public int compareTo(PDelay y) { |
54 |
< |
int i = pseudodelay; |
55 |
< |
int j = y.pseudodelay; |
56 |
< |
if (i < j) return -1; |
37 |
< |
if (i > j) return 1; |
38 |
< |
return 0; |
52 |
> |
PDelay(int i) { pseudodelay = i; } |
53 |
> |
public int compareTo(PDelay other) { |
54 |
> |
int a = this.pseudodelay; |
55 |
> |
int b = other.pseudodelay; |
56 |
> |
return (a < b) ? -1 : (a > b) ? 1 : 0; |
57 |
|
} |
40 |
– |
|
58 |
|
public int compareTo(Delayed y) { |
59 |
|
return compareTo((PDelay)y); |
60 |
|
} |
44 |
– |
|
61 |
|
public boolean equals(Object other) { |
62 |
< |
return equals((PDelay)other); |
63 |
< |
} |
48 |
< |
public boolean equals(PDelay other) { |
49 |
< |
return other.pseudodelay == pseudodelay; |
62 |
> |
return (other instanceof PDelay) && |
63 |
> |
this.pseudodelay == ((PDelay)other).pseudodelay; |
64 |
|
} |
51 |
– |
|
52 |
– |
|
65 |
|
public long getDelay(TimeUnit ignore) { |
66 |
< |
return pseudodelay; |
55 |
< |
} |
56 |
< |
public int intValue() { |
57 |
< |
return pseudodelay; |
66 |
> |
return Integer.MIN_VALUE + pseudodelay; |
67 |
|
} |
59 |
– |
|
68 |
|
public String toString() { |
69 |
|
return String.valueOf(pseudodelay); |
70 |
|
} |
71 |
|
} |
72 |
|
|
65 |
– |
|
73 |
|
/** |
74 |
|
* Delayed implementation that actually delays |
75 |
|
*/ |
111 |
|
} |
112 |
|
} |
113 |
|
|
107 |
– |
|
114 |
|
/** |
115 |
< |
* Create a queue of given size containing consecutive |
115 |
> |
* Returns a new queue of given size containing consecutive |
116 |
|
* PDelays 0 ... n. |
117 |
|
*/ |
118 |
< |
private DelayQueue populatedQueue(int n) { |
119 |
< |
DelayQueue q = new DelayQueue(); |
118 |
> |
private DelayQueue<PDelay> populatedQueue(int n) { |
119 |
> |
DelayQueue<PDelay> q = new DelayQueue<PDelay>(); |
120 |
|
assertTrue(q.isEmpty()); |
121 |
|
for (int i = n-1; i >= 0; i-=2) |
122 |
|
assertTrue(q.offer(new PDelay(i))); |
215 |
|
} |
216 |
|
|
217 |
|
/** |
212 |
– |
* offer(null) throws NPE |
213 |
– |
*/ |
214 |
– |
public void testOfferNull() { |
215 |
– |
try { |
216 |
– |
DelayQueue q = new DelayQueue(); |
217 |
– |
q.offer(null); |
218 |
– |
shouldThrow(); |
219 |
– |
} catch (NullPointerException success) {} |
220 |
– |
} |
221 |
– |
|
222 |
– |
/** |
223 |
– |
* add(null) throws NPE |
224 |
– |
*/ |
225 |
– |
public void testAddNull() { |
226 |
– |
try { |
227 |
– |
DelayQueue q = new DelayQueue(); |
228 |
– |
q.add(null); |
229 |
– |
shouldThrow(); |
230 |
– |
} catch (NullPointerException success) {} |
231 |
– |
} |
232 |
– |
|
233 |
– |
/** |
218 |
|
* offer non-null succeeds |
219 |
|
*/ |
220 |
|
public void testOffer() { |
235 |
|
} |
236 |
|
|
237 |
|
/** |
254 |
– |
* addAll(null) throws NPE |
255 |
– |
*/ |
256 |
– |
public void testAddAll1() { |
257 |
– |
try { |
258 |
– |
DelayQueue q = new DelayQueue(); |
259 |
– |
q.addAll(null); |
260 |
– |
shouldThrow(); |
261 |
– |
} catch (NullPointerException success) {} |
262 |
– |
} |
263 |
– |
|
264 |
– |
|
265 |
– |
/** |
238 |
|
* addAll(this) throws IAE |
239 |
|
*/ |
240 |
|
public void testAddAllSelf() { |
246 |
|
} |
247 |
|
|
248 |
|
/** |
277 |
– |
* addAll of a collection with null elements throws NPE |
278 |
– |
*/ |
279 |
– |
public void testAddAll2() { |
280 |
– |
try { |
281 |
– |
DelayQueue q = new DelayQueue(); |
282 |
– |
PDelay[] ints = new PDelay[SIZE]; |
283 |
– |
q.addAll(Arrays.asList(ints)); |
284 |
– |
shouldThrow(); |
285 |
– |
} catch (NullPointerException success) {} |
286 |
– |
} |
287 |
– |
|
288 |
– |
/** |
249 |
|
* addAll of a collection with any null elements throws NPE after |
250 |
|
* possibly adding some elements |
251 |
|
*/ |
276 |
|
} |
277 |
|
|
278 |
|
/** |
319 |
– |
* put(null) throws NPE |
320 |
– |
*/ |
321 |
– |
public void testPutNull() { |
322 |
– |
try { |
323 |
– |
DelayQueue q = new DelayQueue(); |
324 |
– |
q.put(null); |
325 |
– |
shouldThrow(); |
326 |
– |
} catch (NullPointerException success) {} |
327 |
– |
} |
328 |
– |
|
329 |
– |
/** |
279 |
|
* all elements successfully put are contained |
280 |
|
*/ |
281 |
< |
public void testPut() { |
282 |
< |
DelayQueue q = new DelayQueue(); |
283 |
< |
for (int i = 0; i < SIZE; ++i) { |
284 |
< |
PDelay I = new PDelay(i); |
285 |
< |
q.put(I); |
286 |
< |
assertTrue(q.contains(I)); |
287 |
< |
} |
288 |
< |
assertEquals(SIZE, q.size()); |
281 |
> |
public void testPut() { |
282 |
> |
DelayQueue q = new DelayQueue(); |
283 |
> |
for (int i = 0; i < SIZE; ++i) { |
284 |
> |
PDelay I = new PDelay(i); |
285 |
> |
q.put(I); |
286 |
> |
assertTrue(q.contains(I)); |
287 |
> |
} |
288 |
> |
assertEquals(SIZE, q.size()); |
289 |
|
} |
290 |
|
|
291 |
|
/** |
293 |
|
*/ |
294 |
|
public void testPutWithTake() throws InterruptedException { |
295 |
|
final DelayQueue q = new DelayQueue(); |
296 |
< |
Thread t = new Thread(new CheckedRunnable() { |
296 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
297 |
|
public void realRun() { |
298 |
|
q.put(new PDelay(0)); |
299 |
|
q.put(new PDelay(0)); |
301 |
|
q.put(new PDelay(0)); |
302 |
|
}}); |
303 |
|
|
304 |
< |
t.start(); |
305 |
< |
Thread.sleep(SHORT_DELAY_MS); |
357 |
< |
q.take(); |
358 |
< |
t.interrupt(); |
359 |
< |
t.join(); |
304 |
> |
awaitTermination(t); |
305 |
> |
assertEquals(4, q.size()); |
306 |
|
} |
307 |
|
|
308 |
|
/** |
310 |
|
*/ |
311 |
|
public void testTimedOffer() throws InterruptedException { |
312 |
|
final DelayQueue q = new DelayQueue(); |
313 |
< |
Thread t = new Thread(new CheckedRunnable() { |
313 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
314 |
|
public void realRun() throws InterruptedException { |
315 |
|
q.put(new PDelay(0)); |
316 |
|
q.put(new PDelay(0)); |
318 |
|
assertTrue(q.offer(new PDelay(0), LONG_DELAY_MS, MILLISECONDS)); |
319 |
|
}}); |
320 |
|
|
321 |
< |
t.start(); |
376 |
< |
Thread.sleep(SMALL_DELAY_MS); |
377 |
< |
t.interrupt(); |
378 |
< |
t.join(); |
321 |
> |
awaitTermination(t); |
322 |
|
} |
323 |
|
|
324 |
|
/** |
332 |
|
} |
333 |
|
|
334 |
|
/** |
392 |
– |
* take blocks interruptibly when empty |
393 |
– |
*/ |
394 |
– |
public void testTakeFromEmpty() throws InterruptedException { |
395 |
– |
final DelayQueue q = new DelayQueue(); |
396 |
– |
Thread t = new ThreadShouldThrow(InterruptedException.class) { |
397 |
– |
public void realRun() throws InterruptedException { |
398 |
– |
q.take(); |
399 |
– |
}}; |
400 |
– |
|
401 |
– |
t.start(); |
402 |
– |
Thread.sleep(SHORT_DELAY_MS); |
403 |
– |
t.interrupt(); |
404 |
– |
t.join(); |
405 |
– |
} |
406 |
– |
|
407 |
– |
/** |
335 |
|
* Take removes existing elements until empty, then blocks interruptibly |
336 |
|
*/ |
337 |
|
public void testBlockingTake() throws InterruptedException { |
338 |
|
final DelayQueue q = populatedQueue(SIZE); |
339 |
< |
Thread t = new Thread(new CheckedRunnable() { |
339 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
340 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
341 |
|
public void realRun() throws InterruptedException { |
342 |
|
for (int i = 0; i < SIZE; ++i) { |
343 |
|
assertEquals(new PDelay(i), ((PDelay)q.take())); |
344 |
|
} |
345 |
+ |
|
346 |
+ |
Thread.currentThread().interrupt(); |
347 |
+ |
try { |
348 |
+ |
q.take(); |
349 |
+ |
shouldThrow(); |
350 |
+ |
} catch (InterruptedException success) {} |
351 |
+ |
assertFalse(Thread.interrupted()); |
352 |
+ |
|
353 |
+ |
pleaseInterrupt.countDown(); |
354 |
|
try { |
355 |
|
q.take(); |
356 |
|
shouldThrow(); |
357 |
|
} catch (InterruptedException success) {} |
358 |
+ |
assertFalse(Thread.interrupted()); |
359 |
|
}}); |
360 |
|
|
361 |
< |
t.start(); |
362 |
< |
Thread.sleep(SHORT_DELAY_MS); |
361 |
> |
await(pleaseInterrupt); |
362 |
> |
assertThreadStaysAlive(t); |
363 |
|
t.interrupt(); |
364 |
< |
t.join(); |
364 |
> |
awaitTermination(t); |
365 |
|
} |
366 |
|
|
429 |
– |
|
367 |
|
/** |
368 |
|
* poll succeeds unless empty |
369 |
|
*/ |
376 |
|
} |
377 |
|
|
378 |
|
/** |
379 |
< |
* timed pool with zero timeout succeeds when non-empty, else times out |
379 |
> |
* timed poll with zero timeout succeeds when non-empty, else times out |
380 |
|
*/ |
381 |
|
public void testTimedPoll0() throws InterruptedException { |
382 |
|
DelayQueue q = populatedQueue(SIZE); |
387 |
|
} |
388 |
|
|
389 |
|
/** |
390 |
< |
* timed pool with nonzero timeout succeeds when non-empty, else times out |
390 |
> |
* timed poll with nonzero timeout succeeds when non-empty, else times out |
391 |
|
*/ |
392 |
|
public void testTimedPoll() throws InterruptedException { |
393 |
|
DelayQueue q = populatedQueue(SIZE); |
394 |
|
for (int i = 0; i < SIZE; ++i) { |
395 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll(SHORT_DELAY_MS, MILLISECONDS))); |
396 |
< |
} |
397 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
395 |
> |
long startTime = System.nanoTime(); |
396 |
> |
assertEquals(new PDelay(i), ((PDelay)q.poll(LONG_DELAY_MS, MILLISECONDS))); |
397 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
398 |
> |
} |
399 |
> |
long startTime = System.nanoTime(); |
400 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
401 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
402 |
> |
checkEmpty(q); |
403 |
|
} |
404 |
|
|
405 |
|
/** |
407 |
|
* returning timeout status |
408 |
|
*/ |
409 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
410 |
< |
Thread t = new Thread(new CheckedRunnable() { |
410 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
411 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
412 |
|
public void realRun() throws InterruptedException { |
413 |
|
DelayQueue q = populatedQueue(SIZE); |
414 |
|
for (int i = 0; i < SIZE; ++i) { |
415 |
|
assertEquals(new PDelay(i), ((PDelay)q.poll(SHORT_DELAY_MS, MILLISECONDS))); |
416 |
|
} |
417 |
+ |
|
418 |
+ |
Thread.currentThread().interrupt(); |
419 |
|
try { |
420 |
< |
q.poll(SMALL_DELAY_MS, MILLISECONDS); |
420 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
421 |
|
shouldThrow(); |
422 |
|
} catch (InterruptedException success) {} |
423 |
< |
}}); |
479 |
< |
|
480 |
< |
t.start(); |
481 |
< |
Thread.sleep(SHORT_DELAY_MS); |
482 |
< |
t.interrupt(); |
483 |
< |
t.join(); |
484 |
< |
} |
423 |
> |
assertFalse(Thread.interrupted()); |
424 |
|
|
425 |
< |
/** |
487 |
< |
* timed poll before a delayed offer fails; after offer succeeds; |
488 |
< |
* on interruption throws |
489 |
< |
*/ |
490 |
< |
public void testTimedPollWithOffer() throws InterruptedException { |
491 |
< |
final DelayQueue q = new DelayQueue(); |
492 |
< |
final PDelay pdelay = new PDelay(0); |
493 |
< |
Thread t = new Thread(new CheckedRunnable() { |
494 |
< |
public void realRun() throws InterruptedException { |
495 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
496 |
< |
assertSame(pdelay, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
425 |
> |
pleaseInterrupt.countDown(); |
426 |
|
try { |
427 |
|
q.poll(LONG_DELAY_MS, MILLISECONDS); |
428 |
|
shouldThrow(); |
429 |
|
} catch (InterruptedException success) {} |
430 |
+ |
assertFalse(Thread.interrupted()); |
431 |
|
}}); |
432 |
|
|
433 |
< |
t.start(); |
434 |
< |
Thread.sleep(SMALL_DELAY_MS); |
505 |
< |
assertTrue(q.offer(pdelay, SHORT_DELAY_MS, MILLISECONDS)); |
433 |
> |
await(pleaseInterrupt); |
434 |
> |
assertThreadStaysAlive(t); |
435 |
|
t.interrupt(); |
436 |
< |
t.join(); |
436 |
> |
awaitTermination(t); |
437 |
|
} |
438 |
|
|
510 |
– |
|
439 |
|
/** |
440 |
|
* peek returns next element, or null if empty |
441 |
|
*/ |
482 |
|
} |
483 |
|
|
484 |
|
/** |
557 |
– |
* remove(x) removes x and returns true if present |
558 |
– |
*/ |
559 |
– |
public void testRemoveElement() { |
560 |
– |
DelayQueue q = populatedQueue(SIZE); |
561 |
– |
for (int i = 1; i < SIZE; i+=2) { |
562 |
– |
assertTrue(q.remove(new PDelay(i))); |
563 |
– |
} |
564 |
– |
for (int i = 0; i < SIZE; i+=2) { |
565 |
– |
assertTrue(q.remove(new PDelay(i))); |
566 |
– |
assertFalse(q.remove(new PDelay(i+1))); |
567 |
– |
} |
568 |
– |
assertTrue(q.isEmpty()); |
569 |
– |
} |
570 |
– |
|
571 |
– |
/** |
485 |
|
* contains(x) reports true when elements added but not yet removed |
486 |
|
*/ |
487 |
|
public void testContains() { |
567 |
|
Object[] o = q.toArray(); |
568 |
|
Arrays.sort(o); |
569 |
|
for (int i = 0; i < o.length; i++) |
570 |
< |
assertEquals(o[i], q.take()); |
570 |
> |
assertSame(o[i], q.take()); |
571 |
|
} |
572 |
|
|
573 |
|
/** |
574 |
|
* toArray(a) contains all elements |
575 |
|
*/ |
576 |
< |
public void testToArray2() throws InterruptedException { |
577 |
< |
DelayQueue q = populatedQueue(SIZE); |
576 |
> |
public void testToArray2() { |
577 |
> |
DelayQueue<PDelay> q = populatedQueue(SIZE); |
578 |
|
PDelay[] ints = new PDelay[SIZE]; |
579 |
< |
ints = (PDelay[])q.toArray(ints); |
579 |
> |
PDelay[] array = q.toArray(ints); |
580 |
> |
assertSame(ints, array); |
581 |
|
Arrays.sort(ints); |
582 |
|
for (int i = 0; i < ints.length; i++) |
583 |
< |
assertEquals(ints[i], q.take()); |
670 |
< |
} |
671 |
< |
|
672 |
< |
|
673 |
< |
/** |
674 |
< |
* toArray(null) throws NPE |
675 |
< |
*/ |
676 |
< |
public void testToArray_BadArg() { |
677 |
< |
DelayQueue q = populatedQueue(SIZE); |
678 |
< |
try { |
679 |
< |
Object o[] = q.toArray(null); |
680 |
< |
shouldThrow(); |
681 |
< |
} catch (NullPointerException success) {} |
583 |
> |
assertSame(ints[i], q.remove()); |
584 |
|
} |
585 |
|
|
586 |
|
/** |
587 |
< |
* toArray with incompatible array type throws CCE |
587 |
> |
* toArray(incompatible array type) throws ArrayStoreException |
588 |
|
*/ |
589 |
|
public void testToArray1_BadArg() { |
590 |
|
DelayQueue q = populatedQueue(SIZE); |
591 |
|
try { |
592 |
< |
Object o[] = q.toArray(new String[10]); |
592 |
> |
q.toArray(new String[10]); |
593 |
|
shouldThrow(); |
594 |
|
} catch (ArrayStoreException success) {} |
595 |
|
} |
620 |
|
it.next(); |
621 |
|
it.remove(); |
622 |
|
it = q.iterator(); |
623 |
< |
assertEquals(it.next(), new PDelay(2)); |
624 |
< |
assertEquals(it.next(), new PDelay(3)); |
623 |
> |
assertEquals(new PDelay(2), it.next()); |
624 |
> |
assertEquals(new PDelay(3), it.next()); |
625 |
|
assertFalse(it.hasNext()); |
626 |
|
} |
627 |
|
|
726 |
– |
|
628 |
|
/** |
629 |
|
* toString contains toStrings of elements |
630 |
|
*/ |
631 |
|
public void testToString() { |
632 |
|
DelayQueue q = populatedQueue(SIZE); |
633 |
|
String s = q.toString(); |
634 |
< |
for (int i = 0; i < SIZE; ++i) { |
635 |
< |
assertTrue(s.indexOf(String.valueOf(Integer.MIN_VALUE+i)) >= 0); |
735 |
< |
} |
634 |
> |
for (Object e : q) |
635 |
> |
assertTrue(s.contains(e.toString())); |
636 |
|
} |
637 |
|
|
638 |
|
/** |
639 |
< |
* offer transfers elements across Executor tasks |
639 |
> |
* timed poll transfers elements across Executor tasks |
640 |
|
*/ |
641 |
|
public void testPollInExecutor() { |
642 |
|
final DelayQueue q = new DelayQueue(); |
643 |
+ |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
644 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
645 |
|
executor.execute(new CheckedRunnable() { |
646 |
|
public void realRun() throws InterruptedException { |
647 |
|
assertNull(q.poll()); |
648 |
< |
assertTrue(null != q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
649 |
< |
assertTrue(q.isEmpty()); |
648 |
> |
threadsStarted.await(); |
649 |
> |
assertTrue(null != q.poll(LONG_DELAY_MS, MILLISECONDS)); |
650 |
> |
checkEmpty(q); |
651 |
|
}}); |
652 |
|
|
653 |
|
executor.execute(new CheckedRunnable() { |
654 |
|
public void realRun() throws InterruptedException { |
655 |
< |
Thread.sleep(SHORT_DELAY_MS); |
655 |
> |
threadsStarted.await(); |
656 |
|
q.put(new PDelay(1)); |
657 |
|
}}); |
658 |
|
|
659 |
|
joinPool(executor); |
660 |
|
} |
661 |
|
|
760 |
– |
|
662 |
|
/** |
663 |
|
* Delayed actions do not occur until their delay elapses |
664 |
|
*/ |
665 |
|
public void testDelay() throws InterruptedException { |
666 |
< |
DelayQueue q = new DelayQueue(); |
667 |
< |
NanoDelay[] elements = new NanoDelay[SIZE]; |
668 |
< |
for (int i = 0; i < SIZE; ++i) { |
768 |
< |
elements[i] = new NanoDelay(1000000000L + 1000000L * (SIZE - i)); |
769 |
< |
} |
770 |
< |
for (int i = 0; i < SIZE; ++i) { |
771 |
< |
q.add(elements[i]); |
772 |
< |
} |
666 |
> |
DelayQueue<NanoDelay> q = new DelayQueue<NanoDelay>(); |
667 |
> |
for (int i = 0; i < SIZE; ++i) |
668 |
> |
q.add(new NanoDelay(1000000L * (SIZE - i))); |
669 |
|
|
670 |
|
long last = 0; |
671 |
|
for (int i = 0; i < SIZE; ++i) { |
672 |
< |
NanoDelay e = (NanoDelay)(q.take()); |
672 |
> |
NanoDelay e = q.take(); |
673 |
|
long tt = e.getTriggerTime(); |
674 |
< |
assertTrue(tt <= System.nanoTime()); |
674 |
> |
assertTrue(System.nanoTime() - tt >= 0); |
675 |
|
if (i != 0) |
676 |
|
assertTrue(tt >= last); |
677 |
|
last = tt; |
678 |
|
} |
679 |
+ |
assertTrue(q.isEmpty()); |
680 |
|
} |
681 |
|
|
682 |
|
/** |
685 |
|
public void testPeekDelayed() { |
686 |
|
DelayQueue q = new DelayQueue(); |
687 |
|
q.add(new NanoDelay(Long.MAX_VALUE)); |
688 |
< |
assert(q.peek() != null); |
688 |
> |
assertNotNull(q.peek()); |
689 |
|
} |
690 |
|
|
794 |
– |
|
691 |
|
/** |
692 |
|
* poll of a non-empty queue returns null if no expired elements. |
693 |
|
*/ |
703 |
|
public void testTimedPollDelayed() throws InterruptedException { |
704 |
|
DelayQueue q = new DelayQueue(); |
705 |
|
q.add(new NanoDelay(LONG_DELAY_MS * 1000000L)); |
706 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
811 |
< |
} |
812 |
< |
|
813 |
< |
/** |
814 |
< |
* drainTo(null) throws NPE |
815 |
< |
*/ |
816 |
< |
public void testDrainToNull() { |
817 |
< |
DelayQueue q = populatedQueue(SIZE); |
818 |
< |
try { |
819 |
< |
q.drainTo(null); |
820 |
< |
shouldThrow(); |
821 |
< |
} catch (NullPointerException success) {} |
822 |
< |
} |
823 |
< |
|
824 |
< |
/** |
825 |
< |
* drainTo(this) throws IAE |
826 |
< |
*/ |
827 |
< |
public void testDrainToSelf() { |
828 |
< |
DelayQueue q = populatedQueue(SIZE); |
829 |
< |
try { |
830 |
< |
q.drainTo(q); |
831 |
< |
shouldThrow(); |
832 |
< |
} catch (IllegalArgumentException success) {} |
706 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
707 |
|
} |
708 |
|
|
709 |
|
/** |
718 |
|
} |
719 |
|
ArrayList l = new ArrayList(); |
720 |
|
q.drainTo(l); |
721 |
< |
assertEquals(q.size(), 0); |
721 |
> |
assertEquals(0, q.size()); |
722 |
|
for (int i = 0; i < SIZE; ++i) |
723 |
< |
assertEquals(l.get(i), elems[i]); |
723 |
> |
assertEquals(elems[i], l.get(i)); |
724 |
|
q.add(elems[0]); |
725 |
|
q.add(elems[1]); |
726 |
|
assertFalse(q.isEmpty()); |
728 |
|
assertTrue(q.contains(elems[1])); |
729 |
|
l.clear(); |
730 |
|
q.drainTo(l); |
731 |
< |
assertEquals(q.size(), 0); |
732 |
< |
assertEquals(l.size(), 2); |
731 |
> |
assertEquals(0, q.size()); |
732 |
> |
assertEquals(2, l.size()); |
733 |
|
for (int i = 0; i < 2; ++i) |
734 |
< |
assertEquals(l.get(i), elems[i]); |
734 |
> |
assertEquals(elems[i], l.get(i)); |
735 |
|
} |
736 |
|
|
737 |
|
/** |
753 |
|
} |
754 |
|
|
755 |
|
/** |
756 |
< |
* drainTo(null, n) throws NPE |
883 |
< |
*/ |
884 |
< |
public void testDrainToNullN() { |
885 |
< |
DelayQueue q = populatedQueue(SIZE); |
886 |
< |
try { |
887 |
< |
q.drainTo(null, 0); |
888 |
< |
shouldThrow(); |
889 |
< |
} catch (NullPointerException success) {} |
890 |
< |
} |
891 |
< |
|
892 |
< |
/** |
893 |
< |
* drainTo(this, n) throws IAE |
894 |
< |
*/ |
895 |
< |
public void testDrainToSelfN() { |
896 |
< |
DelayQueue q = populatedQueue(SIZE); |
897 |
< |
try { |
898 |
< |
q.drainTo(q, 0); |
899 |
< |
shouldThrow(); |
900 |
< |
} catch (IllegalArgumentException success) {} |
901 |
< |
} |
902 |
< |
|
903 |
< |
/** |
904 |
< |
* drainTo(c, n) empties first max {n, size} elements of queue into c |
756 |
> |
* drainTo(c, n) empties first min(n, size) elements of queue into c |
757 |
|
*/ |
758 |
|
public void testDrainToN() { |
759 |
|
for (int i = 0; i < SIZE + 2; ++i) { |
760 |
|
DelayQueue q = populatedQueue(SIZE); |
761 |
|
ArrayList l = new ArrayList(); |
762 |
|
q.drainTo(l, i); |
763 |
< |
int k = (i < SIZE)? i : SIZE; |
764 |
< |
assertEquals(q.size(), SIZE-k); |
765 |
< |
assertEquals(l.size(), k); |
763 |
> |
int k = (i < SIZE) ? i : SIZE; |
764 |
> |
assertEquals(SIZE-k, q.size()); |
765 |
> |
assertEquals(k, l.size()); |
766 |
|
} |
767 |
|
} |
768 |
|
|
917 |
– |
|
769 |
|
} |