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 |
+ |
* poll of a non-empty queue returns null if no expired elements. |
899 |
+ |
*/ |
900 |
+ |
public void testPollDelayed() { |
901 |
+ |
DelayQueue q = new DelayQueue(); |
902 |
+ |
q.add(new NanoDelay(Long.MAX_VALUE)); |
903 |
+ |
assertNull(q.poll()); |
904 |
+ |
} |
905 |
|
|
906 |
|
/** |
907 |
|
* drainTo(null) throws NPE |