592 |
|
for (int i = 0; i < SIZE; ++i) { |
593 |
|
assertEquals(new PDelay(i), ((PDelay)q.peek())); |
594 |
|
q.poll(); |
595 |
< |
assertTrue(q.peek() == null || |
596 |
< |
i != ((PDelay)q.peek()).intValue()); |
595 |
> |
if (q.isEmpty()) |
596 |
> |
assertNull(q.peek()); |
597 |
> |
else |
598 |
> |
assertTrue(i != ((PDelay)q.peek()).intValue()); |
599 |
|
} |
600 |
|
assertNull(q.peek()); |
601 |
|
} |
885 |
|
} |
886 |
|
} |
887 |
|
|
888 |
+ |
/** |
889 |
+ |
* peek of a non-empty queue returns non-null even if not expired |
890 |
+ |
*/ |
891 |
+ |
public void testPeekDelayed() { |
892 |
+ |
DelayQueue q = new DelayQueue(); |
893 |
+ |
q.add(new NanoDelay(Long.MAX_VALUE)); |
894 |
+ |
assert(q.peek() != null); |
895 |
+ |
} |
896 |
+ |
|
897 |
+ |
|
898 |
+ |
/** |
899 |
+ |
* poll of a non-empty queue returns null if no expired elements. |
900 |
+ |
*/ |
901 |
+ |
public void testPollDelayed() { |
902 |
+ |
DelayQueue q = new DelayQueue(); |
903 |
+ |
q.add(new NanoDelay(Long.MAX_VALUE)); |
904 |
+ |
assertNull(q.poll()); |
905 |
+ |
} |
906 |
+ |
|
907 |
+ |
/** |
908 |
+ |
* timed poll of a non-empty queue returns null if no expired elements. |
909 |
+ |
*/ |
910 |
+ |
public void testTimedPollDelayed() { |
911 |
+ |
DelayQueue q = new DelayQueue(); |
912 |
+ |
q.add(new NanoDelay(Long.MAX_VALUE)); |
913 |
+ |
try { |
914 |
+ |
assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
915 |
+ |
} catch (Exception ex) { |
916 |
+ |
unexpectedException(); |
917 |
+ |
} |
918 |
+ |
} |
919 |
|
|
920 |
|
/** |
921 |
|
* drainTo(null) throws NPE |