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; } |
62 |
< |
public int compareTo(PDelay other) { |
63 |
< |
int a = this.pseudodelay; |
64 |
< |
int b = other.pseudodelay; |
65 |
< |
return (a < b) ? -1 : (a > b) ? 1 : 0; |
66 |
< |
} |
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) && |
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 |
|
} |
92 |
– |
public int compareTo(NanoDelay y) { |
93 |
– |
long i = trigger; |
94 |
– |
long j = y.trigger; |
95 |
– |
if (i < j) return -1; |
96 |
– |
if (i > j) return 1; |
97 |
– |
return 0; |
98 |
– |
} |
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) { |
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))); |
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) { |
341 |
> |
for (int i = 0; i < SIZE; i++) |
342 |
|
assertEquals(new PDelay(i), ((PDelay)q.take())); |
355 |
– |
} |
343 |
|
|
344 |
|
Thread.currentThread().interrupt(); |
345 |
|
try { |
357 |
|
}}); |
358 |
|
|
359 |
|
await(pleaseInterrupt); |
360 |
< |
assertThreadStaysAlive(t); |
360 |
> |
assertThreadBlocks(t, Thread.State.WAITING); |
361 |
|
t.interrupt(); |
362 |
|
awaitTermination(t); |
363 |
|
} |
432 |
|
}}); |
433 |
|
|
434 |
|
await(pleaseInterrupt); |
435 |
< |
assertThreadStaysAlive(t); |
435 |
> |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
436 |
|
t.interrupt(); |
437 |
|
awaitTermination(t); |
438 |
|
checkEmpty(q); |
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 |
|
|
713 |
|
public void testTimedPollDelayed() throws InterruptedException { |
714 |
|
DelayQueue 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 |
|
/** |