115 |
|
* Returns a new queue of given size containing consecutive |
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))); |
674 |
|
* Delayed actions do not occur until their delay elapses |
675 |
|
*/ |
676 |
|
public void testDelay() throws InterruptedException { |
677 |
< |
DelayQueue<NanoDelay> q = new DelayQueue<NanoDelay>(); |
677 |
> |
DelayQueue<NanoDelay> q = new DelayQueue<>(); |
678 |
|
for (int i = 0; i < SIZE; ++i) |
679 |
|
q.add(new NanoDelay(1000000L * (SIZE - i))); |
680 |
|
|