39 |
|
} |
40 |
|
|
41 |
|
public static Test suite() { |
42 |
+ |
class Implementation implements CollectionImplementation { |
43 |
+ |
public Class<?> klazz() { return DelayQueue.class; } |
44 |
+ |
public Collection emptyCollection() { return new DelayQueue(); } |
45 |
+ |
public Object makeElement(int i) { return new PDelay(i); } |
46 |
+ |
public boolean isConcurrent() { return true; } |
47 |
+ |
public boolean permitsNulls() { return false; } |
48 |
+ |
} |
49 |
|
return newTestSuite(DelayQueueTest.class, |
50 |
< |
new Generic().testSuite()); |
50 |
> |
new Generic().testSuite(), |
51 |
> |
CollectionTest.testSuite(new Implementation())); |
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; } |
54 |
< |
public int compareTo(PDelay other) { |
55 |
< |
int a = this.pseudodelay; |
56 |
< |
int b = other.pseudodelay; |
57 |
< |
return (a < b) ? -1 : (a > b) ? 1 : 0; |
58 |
< |
} |
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) && |
69 |
|
// suppress [overrides] javac warning |
70 |
|
public int hashCode() { return pseudodelay; } |
71 |
|
public long getDelay(TimeUnit ignore) { |
72 |
< |
return Integer.MIN_VALUE + pseudodelay; |
72 |
> |
return (long) Integer.MIN_VALUE + pseudodelay; |
73 |
|
} |
74 |
|
public String toString() { |
75 |
|
return String.valueOf(pseudodelay); |
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 |
|
} |
84 |
– |
public int compareTo(NanoDelay y) { |
85 |
– |
long i = trigger; |
86 |
– |
long j = y.trigger; |
87 |
– |
if (i < j) return -1; |
88 |
– |
if (i > j) return 1; |
89 |
– |
return 0; |
90 |
– |
} |
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) { |
93 |
< |
return equals((NanoDelay)other); |
94 |
< |
} |
99 |
< |
public boolean equals(NanoDelay other) { |
100 |
< |
return other.trigger == trigger; |
93 |
> |
return (other instanceof NanoDelay) && |
94 |
> |
this.trigger == ((NanoDelay)other).trigger; |
95 |
|
} |
96 |
|
|
97 |
|
// suppress [overrides] javac warning |
113 |
|
|
114 |
|
/** |
115 |
|
* Returns a new queue of given size containing consecutive |
116 |
< |
* PDelays 0 ... n. |
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) |
121 |
> |
for (int i = n - 1; i >= 0; i -= 2) |
122 |
|
assertTrue(q.offer(new PDelay(i))); |
123 |
|
for (int i = (n & 1); i < n; i += 2) |
124 |
|
assertTrue(q.offer(new PDelay(i))); |
125 |
|
assertFalse(q.isEmpty()); |
126 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
127 |
|
assertEquals(n, q.size()); |
128 |
+ |
assertEquals(new PDelay(0), q.peek()); |
129 |
|
return q; |
130 |
|
} |
131 |
|
|
161 |
|
*/ |
162 |
|
public void testConstructor5() { |
163 |
|
PDelay[] a = new PDelay[SIZE]; |
164 |
< |
for (int i = 0; i < SIZE-1; ++i) |
164 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
165 |
|
a[i] = new PDelay(i); |
166 |
|
try { |
167 |
|
new DelayQueue(Arrays.asList(a)); |
203 |
|
BlockingQueue q = populatedQueue(SIZE); |
204 |
|
for (int i = 0; i < SIZE; ++i) { |
205 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
206 |
< |
assertEquals(SIZE-i, q.size()); |
206 |
> |
assertEquals(SIZE - i, q.size()); |
207 |
|
assertTrue(q.remove() instanceof PDelay); |
208 |
|
} |
209 |
|
for (int i = 0; i < SIZE; ++i) { |
234 |
|
} |
235 |
|
|
236 |
|
/** |
237 |
< |
* addAll(this) throws IAE |
237 |
> |
* addAll(this) throws IllegalArgumentException |
238 |
|
*/ |
239 |
|
public void testAddAllSelf() { |
240 |
|
DelayQueue q = populatedQueue(SIZE); |
251 |
|
public void testAddAll3() { |
252 |
|
DelayQueue q = new DelayQueue(); |
253 |
|
PDelay[] a = new PDelay[SIZE]; |
254 |
< |
for (int i = 0; i < SIZE-1; ++i) |
254 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
255 |
|
a[i] = new PDelay(i); |
256 |
|
try { |
257 |
|
q.addAll(Arrays.asList(a)); |
265 |
|
public void testAddAll5() { |
266 |
|
PDelay[] empty = new PDelay[0]; |
267 |
|
PDelay[] ints = new PDelay[SIZE]; |
268 |
< |
for (int i = SIZE-1; i >= 0; --i) |
268 |
> |
for (int i = SIZE - 1; i >= 0; --i) |
269 |
|
ints[i] = new PDelay(i); |
270 |
|
DelayQueue q = new DelayQueue(); |
271 |
|
assertFalse(q.addAll(Arrays.asList(empty))); |
305 |
|
} |
306 |
|
|
307 |
|
/** |
308 |
< |
* timed offer does not time out |
308 |
> |
* Queue is unbounded, so timed offer never times out |
309 |
|
*/ |
310 |
|
public void testTimedOffer() throws InterruptedException { |
311 |
|
final DelayQueue q = new DelayQueue(); |
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())); |
348 |
– |
} |
343 |
|
|
344 |
|
Thread.currentThread().interrupt(); |
345 |
|
try { |
357 |
|
}}); |
358 |
|
|
359 |
|
await(pleaseInterrupt); |
360 |
< |
assertThreadStaysAlive(t); |
360 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING); |
361 |
|
t.interrupt(); |
362 |
|
awaitTermination(t); |
363 |
|
} |
406 |
|
*/ |
407 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
408 |
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
409 |
+ |
final DelayQueue q = populatedQueue(SIZE); |
410 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
411 |
|
public void realRun() throws InterruptedException { |
412 |
< |
DelayQueue q = populatedQueue(SIZE); |
413 |
< |
for (int i = 0; i < SIZE; ++i) { |
414 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll(SHORT_DELAY_MS, MILLISECONDS))); |
415 |
< |
} |
412 |
> |
long startTime = System.nanoTime(); |
413 |
> |
for (int i = 0; i < SIZE; i++) |
414 |
> |
assertEquals(new PDelay(i), |
415 |
> |
((PDelay)q.poll(LONG_DELAY_MS, MILLISECONDS))); |
416 |
|
|
417 |
|
Thread.currentThread().interrupt(); |
418 |
|
try { |
419 |
< |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
419 |
> |
q.poll(randomTimeout(), randomTimeUnit()); |
420 |
|
shouldThrow(); |
421 |
|
} catch (InterruptedException success) {} |
422 |
|
assertFalse(Thread.interrupted()); |
427 |
|
shouldThrow(); |
428 |
|
} catch (InterruptedException success) {} |
429 |
|
assertFalse(Thread.interrupted()); |
430 |
+ |
|
431 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
432 |
|
}}); |
433 |
|
|
434 |
|
await(pleaseInterrupt); |
435 |
< |
assertThreadStaysAlive(t); |
435 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
436 |
|
t.interrupt(); |
437 |
|
awaitTermination(t); |
438 |
+ |
checkEmpty(q); |
439 |
|
} |
440 |
|
|
441 |
|
/** |
540 |
|
assertTrue(changed); |
541 |
|
|
542 |
|
assertTrue(q.containsAll(p)); |
543 |
< |
assertEquals(SIZE-i, q.size()); |
543 |
> |
assertEquals(SIZE - i, q.size()); |
544 |
|
p.remove(); |
545 |
|
} |
546 |
|
} |
553 |
|
DelayQueue q = populatedQueue(SIZE); |
554 |
|
DelayQueue p = populatedQueue(i); |
555 |
|
assertTrue(q.removeAll(p)); |
556 |
< |
assertEquals(SIZE-i, q.size()); |
556 |
> |
assertEquals(SIZE - i, q.size()); |
557 |
|
for (int j = 0; j < i; ++j) { |
558 |
|
PDelay x = (PDelay)(p.remove()); |
559 |
|
assertFalse(q.contains(x)); |
566 |
|
*/ |
567 |
|
public void testToArray() throws InterruptedException { |
568 |
|
DelayQueue q = populatedQueue(SIZE); |
569 |
< |
Object[] o = q.toArray(); |
570 |
< |
Arrays.sort(o); |
571 |
< |
for (int i = 0; i < o.length; i++) |
572 |
< |
assertSame(o[i], q.take()); |
569 |
> |
Object[] a = q.toArray(); |
570 |
> |
assertSame(Object[].class, a.getClass()); |
571 |
> |
Arrays.sort(a); |
572 |
> |
for (Object o : a) |
573 |
> |
assertSame(o, q.take()); |
574 |
> |
assertTrue(q.isEmpty()); |
575 |
|
} |
576 |
|
|
577 |
|
/** |
583 |
|
PDelay[] array = q.toArray(ints); |
584 |
|
assertSame(ints, array); |
585 |
|
Arrays.sort(ints); |
586 |
< |
for (int i = 0; i < ints.length; i++) |
587 |
< |
assertSame(ints[i], q.remove()); |
586 |
> |
for (PDelay o : ints) |
587 |
> |
assertSame(o, q.remove()); |
588 |
> |
assertTrue(q.isEmpty()); |
589 |
|
} |
590 |
|
|
591 |
|
/** |
654 |
|
public void testPollInExecutor() { |
655 |
|
final DelayQueue q = new DelayQueue(); |
656 |
|
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
657 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
658 |
< |
executor.execute(new CheckedRunnable() { |
659 |
< |
public void realRun() throws InterruptedException { |
660 |
< |
assertNull(q.poll()); |
661 |
< |
threadsStarted.await(); |
662 |
< |
assertNotNull(q.poll(LONG_DELAY_MS, MILLISECONDS)); |
663 |
< |
checkEmpty(q); |
664 |
< |
}}); |
665 |
< |
|
666 |
< |
executor.execute(new CheckedRunnable() { |
667 |
< |
public void realRun() throws InterruptedException { |
668 |
< |
threadsStarted.await(); |
669 |
< |
q.put(new PDelay(1)); |
670 |
< |
}}); |
671 |
< |
|
672 |
< |
joinPool(executor); |
657 |
> |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
658 |
> |
try (PoolCleaner cleaner = cleaner(executor)) { |
659 |
> |
executor.execute(new CheckedRunnable() { |
660 |
> |
public void realRun() throws InterruptedException { |
661 |
> |
assertNull(q.poll()); |
662 |
> |
threadsStarted.await(); |
663 |
> |
assertNotNull(q.poll(LONG_DELAY_MS, MILLISECONDS)); |
664 |
> |
checkEmpty(q); |
665 |
> |
}}); |
666 |
> |
|
667 |
> |
executor.execute(new CheckedRunnable() { |
668 |
> |
public void realRun() throws InterruptedException { |
669 |
> |
threadsStarted.await(); |
670 |
> |
q.put(new PDelay(1)); |
671 |
> |
}}); |
672 |
> |
} |
673 |
|
} |
674 |
|
|
675 |
|
/** |
676 |
|
* Delayed actions do not occur until their delay elapses |
677 |
|
*/ |
678 |
|
public void testDelay() throws InterruptedException { |
679 |
< |
DelayQueue<NanoDelay> q = new DelayQueue<NanoDelay>(); |
679 |
> |
DelayQueue<NanoDelay> q = new DelayQueue<>(); |
680 |
|
for (int i = 0; i < SIZE; ++i) |
681 |
|
q.add(new NanoDelay(1000000L * (SIZE - i))); |
682 |
|
|
716 |
|
public void testTimedPollDelayed() throws InterruptedException { |
717 |
|
DelayQueue q = new DelayQueue(); |
718 |
|
q.add(new NanoDelay(LONG_DELAY_MS * 1000000L)); |
719 |
+ |
long startTime = System.nanoTime(); |
720 |
|
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
721 |
+ |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
722 |
|
} |
723 |
|
|
724 |
|
/** |
756 |
|
final DelayQueue q = populatedQueue(SIZE); |
757 |
|
Thread t = new Thread(new CheckedRunnable() { |
758 |
|
public void realRun() { |
759 |
< |
q.put(new PDelay(SIZE+1)); |
759 |
> |
q.put(new PDelay(SIZE + 1)); |
760 |
|
}}); |
761 |
|
|
762 |
|
t.start(); |
776 |
|
ArrayList l = new ArrayList(); |
777 |
|
q.drainTo(l, i); |
778 |
|
int k = (i < SIZE) ? i : SIZE; |
779 |
< |
assertEquals(SIZE-k, q.size()); |
779 |
> |
assertEquals(SIZE - k, q.size()); |
780 |
|
assertEquals(k, l.size()); |
781 |
|
} |
782 |
|
} |