6 |
|
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
< |
import junit.framework.*; |
10 |
< |
import java.util.Arrays; |
9 |
> |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
10 |
> |
|
11 |
|
import java.util.ArrayList; |
12 |
+ |
import java.util.Arrays; |
13 |
+ |
import java.util.Collection; |
14 |
|
import java.util.Iterator; |
15 |
|
import java.util.NoSuchElementException; |
16 |
|
import java.util.concurrent.BlockingQueue; |
20 |
|
import java.util.concurrent.Executors; |
21 |
|
import java.util.concurrent.ExecutorService; |
22 |
|
import java.util.concurrent.TimeUnit; |
23 |
< |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
23 |
> |
|
24 |
> |
import junit.framework.Test; |
25 |
|
|
26 |
|
public class DelayQueueTest extends JSR166TestCase { |
27 |
|
|
35 |
|
} |
36 |
|
|
37 |
|
public static void main(String[] args) { |
38 |
< |
junit.textui.TestRunner.run(suite()); |
38 |
> |
main(suite(), args); |
39 |
|
} |
40 |
|
|
41 |
|
public static Test suite() { |
43 |
|
new Generic().testSuite()); |
44 |
|
} |
45 |
|
|
43 |
– |
private static final int NOCAP = Integer.MAX_VALUE; |
44 |
– |
|
46 |
|
/** |
47 |
|
* A delayed implementation for testing. |
48 |
|
* Most tests use Pseudodelays, where delays are all elapsed |
94 |
|
} |
95 |
|
|
96 |
|
public boolean equals(Object other) { |
97 |
< |
return equals((NanoDelay)other); |
98 |
< |
} |
98 |
< |
public boolean equals(NanoDelay other) { |
99 |
< |
return other.trigger == trigger; |
97 |
> |
return (other instanceof NanoDelay) && |
98 |
> |
this.trigger == ((NanoDelay)other).trigger; |
99 |
|
} |
100 |
|
|
101 |
|
// suppress [overrides] javac warning |
117 |
|
|
118 |
|
/** |
119 |
|
* Returns a new queue of given size containing consecutive |
120 |
< |
* PDelays 0 ... n. |
120 |
> |
* PDelays 0 ... n - 1. |
121 |
|
*/ |
122 |
|
private DelayQueue<PDelay> populatedQueue(int n) { |
123 |
|
DelayQueue<PDelay> q = new DelayQueue<PDelay>(); |
124 |
|
assertTrue(q.isEmpty()); |
125 |
< |
for (int i = n-1; i >= 0; i-=2) |
125 |
> |
for (int i = n - 1; i >= 0; i -= 2) |
126 |
|
assertTrue(q.offer(new PDelay(i))); |
127 |
< |
for (int i = (n & 1); i < n; i+=2) |
127 |
> |
for (int i = (n & 1); i < n; i += 2) |
128 |
|
assertTrue(q.offer(new PDelay(i))); |
129 |
|
assertFalse(q.isEmpty()); |
130 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
130 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
131 |
|
assertEquals(n, q.size()); |
132 |
+ |
assertEquals(new PDelay(0), q.peek()); |
133 |
|
return q; |
134 |
|
} |
135 |
|
|
137 |
|
* A new queue has unbounded capacity |
138 |
|
*/ |
139 |
|
public void testConstructor1() { |
140 |
< |
assertEquals(NOCAP, new DelayQueue().remainingCapacity()); |
140 |
> |
assertEquals(Integer.MAX_VALUE, new DelayQueue().remainingCapacity()); |
141 |
|
} |
142 |
|
|
143 |
|
/** |
145 |
|
*/ |
146 |
|
public void testConstructor3() { |
147 |
|
try { |
148 |
< |
DelayQueue q = new DelayQueue(null); |
148 |
> |
new DelayQueue(null); |
149 |
|
shouldThrow(); |
150 |
|
} catch (NullPointerException success) {} |
151 |
|
} |
155 |
|
*/ |
156 |
|
public void testConstructor4() { |
157 |
|
try { |
158 |
< |
PDelay[] ints = new PDelay[SIZE]; |
159 |
< |
DelayQueue q = new DelayQueue(Arrays.asList(ints)); |
158 |
> |
new DelayQueue(Arrays.asList(new PDelay[SIZE])); |
159 |
|
shouldThrow(); |
160 |
|
} catch (NullPointerException success) {} |
161 |
|
} |
164 |
|
* Initializing from Collection with some null elements throws NPE |
165 |
|
*/ |
166 |
|
public void testConstructor5() { |
167 |
+ |
PDelay[] a = new PDelay[SIZE]; |
168 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
169 |
+ |
a[i] = new PDelay(i); |
170 |
|
try { |
171 |
< |
PDelay[] ints = new PDelay[SIZE]; |
170 |
< |
for (int i = 0; i < SIZE-1; ++i) |
171 |
< |
ints[i] = new PDelay(i); |
172 |
< |
DelayQueue q = new DelayQueue(Arrays.asList(ints)); |
171 |
> |
new DelayQueue(Arrays.asList(a)); |
172 |
|
shouldThrow(); |
173 |
|
} catch (NullPointerException success) {} |
174 |
|
} |
191 |
|
public void testEmpty() { |
192 |
|
DelayQueue q = new DelayQueue(); |
193 |
|
assertTrue(q.isEmpty()); |
194 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
194 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
195 |
|
q.add(new PDelay(1)); |
196 |
|
assertFalse(q.isEmpty()); |
197 |
|
q.add(new PDelay(2)); |
201 |
|
} |
202 |
|
|
203 |
|
/** |
204 |
< |
* remainingCapacity does not change when elements added or removed, |
206 |
< |
* but size does |
204 |
> |
* remainingCapacity() always returns Integer.MAX_VALUE |
205 |
|
*/ |
206 |
|
public void testRemainingCapacity() { |
207 |
< |
DelayQueue q = populatedQueue(SIZE); |
207 |
> |
BlockingQueue q = populatedQueue(SIZE); |
208 |
|
for (int i = 0; i < SIZE; ++i) { |
209 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
210 |
< |
assertEquals(SIZE-i, q.size()); |
211 |
< |
q.remove(); |
209 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
210 |
> |
assertEquals(SIZE - i, q.size()); |
211 |
> |
assertTrue(q.remove() instanceof PDelay); |
212 |
|
} |
213 |
|
for (int i = 0; i < SIZE; ++i) { |
214 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
214 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
215 |
|
assertEquals(i, q.size()); |
216 |
< |
q.add(new PDelay(i)); |
216 |
> |
assertTrue(q.add(new PDelay(i))); |
217 |
|
} |
218 |
|
} |
219 |
|
|
241 |
|
* addAll(this) throws IAE |
242 |
|
*/ |
243 |
|
public void testAddAllSelf() { |
244 |
+ |
DelayQueue q = populatedQueue(SIZE); |
245 |
|
try { |
247 |
– |
DelayQueue q = populatedQueue(SIZE); |
246 |
|
q.addAll(q); |
247 |
|
shouldThrow(); |
248 |
|
} catch (IllegalArgumentException success) {} |
253 |
|
* possibly adding some elements |
254 |
|
*/ |
255 |
|
public void testAddAll3() { |
256 |
+ |
DelayQueue q = new DelayQueue(); |
257 |
+ |
PDelay[] a = new PDelay[SIZE]; |
258 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
259 |
+ |
a[i] = new PDelay(i); |
260 |
|
try { |
261 |
< |
DelayQueue q = new DelayQueue(); |
260 |
< |
PDelay[] ints = new PDelay[SIZE]; |
261 |
< |
for (int i = 0; i < SIZE-1; ++i) |
262 |
< |
ints[i] = new PDelay(i); |
263 |
< |
q.addAll(Arrays.asList(ints)); |
261 |
> |
q.addAll(Arrays.asList(a)); |
262 |
|
shouldThrow(); |
263 |
|
} catch (NullPointerException success) {} |
264 |
|
} |
269 |
|
public void testAddAll5() { |
270 |
|
PDelay[] empty = new PDelay[0]; |
271 |
|
PDelay[] ints = new PDelay[SIZE]; |
272 |
< |
for (int i = SIZE-1; i >= 0; --i) |
272 |
> |
for (int i = SIZE - 1; i >= 0; --i) |
273 |
|
ints[i] = new PDelay(i); |
274 |
|
DelayQueue q = new DelayQueue(); |
275 |
|
assertFalse(q.addAll(Arrays.asList(empty))); |
284 |
|
public void testPut() { |
285 |
|
DelayQueue q = new DelayQueue(); |
286 |
|
for (int i = 0; i < SIZE; ++i) { |
287 |
< |
PDelay I = new PDelay(i); |
288 |
< |
q.put(I); |
289 |
< |
assertTrue(q.contains(I)); |
287 |
> |
PDelay x = new PDelay(i); |
288 |
> |
q.put(x); |
289 |
> |
assertTrue(q.contains(x)); |
290 |
|
} |
291 |
|
assertEquals(SIZE, q.size()); |
292 |
|
} |
330 |
|
public void testTake() throws InterruptedException { |
331 |
|
DelayQueue q = populatedQueue(SIZE); |
332 |
|
for (int i = 0; i < SIZE; ++i) { |
333 |
< |
assertEquals(new PDelay(i), ((PDelay)q.take())); |
333 |
> |
assertEquals(new PDelay(i), q.take()); |
334 |
|
} |
335 |
|
} |
336 |
|
|
373 |
|
public void testPoll() { |
374 |
|
DelayQueue q = populatedQueue(SIZE); |
375 |
|
for (int i = 0; i < SIZE; ++i) { |
376 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll())); |
376 |
> |
assertEquals(new PDelay(i), q.poll()); |
377 |
|
} |
378 |
|
assertNull(q.poll()); |
379 |
|
} |
384 |
|
public void testTimedPoll0() throws InterruptedException { |
385 |
|
DelayQueue q = populatedQueue(SIZE); |
386 |
|
for (int i = 0; i < SIZE; ++i) { |
387 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll(0, MILLISECONDS))); |
387 |
> |
assertEquals(new PDelay(i), q.poll(0, MILLISECONDS)); |
388 |
|
} |
389 |
|
assertNull(q.poll(0, MILLISECONDS)); |
390 |
|
} |
396 |
|
DelayQueue q = populatedQueue(SIZE); |
397 |
|
for (int i = 0; i < SIZE; ++i) { |
398 |
|
long startTime = System.nanoTime(); |
399 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll(LONG_DELAY_MS, MILLISECONDS))); |
399 |
> |
assertEquals(new PDelay(i), q.poll(LONG_DELAY_MS, MILLISECONDS)); |
400 |
|
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
401 |
|
} |
402 |
|
long startTime = System.nanoTime(); |
411 |
|
*/ |
412 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
413 |
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
414 |
+ |
final DelayQueue q = populatedQueue(SIZE); |
415 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
416 |
|
public void realRun() throws InterruptedException { |
417 |
< |
DelayQueue q = populatedQueue(SIZE); |
417 |
> |
long startTime = System.nanoTime(); |
418 |
|
for (int i = 0; i < SIZE; ++i) { |
419 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll(SHORT_DELAY_MS, MILLISECONDS))); |
419 |
> |
assertEquals(new PDelay(i), |
420 |
> |
((PDelay)q.poll(LONG_DELAY_MS, MILLISECONDS))); |
421 |
|
} |
422 |
|
|
423 |
|
Thread.currentThread().interrupt(); |
433 |
|
shouldThrow(); |
434 |
|
} catch (InterruptedException success) {} |
435 |
|
assertFalse(Thread.interrupted()); |
436 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
437 |
|
}}); |
438 |
|
|
439 |
|
await(pleaseInterrupt); |
440 |
|
assertThreadStaysAlive(t); |
441 |
|
t.interrupt(); |
442 |
|
awaitTermination(t); |
443 |
+ |
checkEmpty(q); |
444 |
|
} |
445 |
|
|
446 |
|
/** |
449 |
|
public void testPeek() { |
450 |
|
DelayQueue q = populatedQueue(SIZE); |
451 |
|
for (int i = 0; i < SIZE; ++i) { |
452 |
< |
assertEquals(new PDelay(i), ((PDelay)q.peek())); |
453 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll())); |
452 |
> |
assertEquals(new PDelay(i), q.peek()); |
453 |
> |
assertEquals(new PDelay(i), q.poll()); |
454 |
|
if (q.isEmpty()) |
455 |
|
assertNull(q.peek()); |
456 |
|
else |
465 |
|
public void testElement() { |
466 |
|
DelayQueue q = populatedQueue(SIZE); |
467 |
|
for (int i = 0; i < SIZE; ++i) { |
468 |
< |
assertEquals(new PDelay(i), ((PDelay)q.element())); |
468 |
> |
assertEquals(new PDelay(i), q.element()); |
469 |
|
q.poll(); |
470 |
|
} |
471 |
|
try { |
480 |
|
public void testRemove() { |
481 |
|
DelayQueue q = populatedQueue(SIZE); |
482 |
|
for (int i = 0; i < SIZE; ++i) { |
483 |
< |
assertEquals(new PDelay(i), ((PDelay)q.remove())); |
483 |
> |
assertEquals(new PDelay(i), q.remove()); |
484 |
|
} |
485 |
|
try { |
486 |
|
q.remove(); |
508 |
|
q.clear(); |
509 |
|
assertTrue(q.isEmpty()); |
510 |
|
assertEquals(0, q.size()); |
511 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
511 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
512 |
|
PDelay x = new PDelay(1); |
513 |
|
q.add(x); |
514 |
|
assertFalse(q.isEmpty()); |
545 |
|
assertTrue(changed); |
546 |
|
|
547 |
|
assertTrue(q.containsAll(p)); |
548 |
< |
assertEquals(SIZE-i, q.size()); |
548 |
> |
assertEquals(SIZE - i, q.size()); |
549 |
|
p.remove(); |
550 |
|
} |
551 |
|
} |
558 |
|
DelayQueue q = populatedQueue(SIZE); |
559 |
|
DelayQueue p = populatedQueue(i); |
560 |
|
assertTrue(q.removeAll(p)); |
561 |
< |
assertEquals(SIZE-i, q.size()); |
561 |
> |
assertEquals(SIZE - i, q.size()); |
562 |
|
for (int j = 0; j < i; ++j) { |
563 |
< |
PDelay I = (PDelay)(p.remove()); |
564 |
< |
assertFalse(q.contains(I)); |
563 |
> |
PDelay x = (PDelay)(p.remove()); |
564 |
> |
assertFalse(q.contains(x)); |
565 |
|
} |
566 |
|
} |
567 |
|
} |
613 |
|
++i; |
614 |
|
} |
615 |
|
assertEquals(i, SIZE); |
616 |
+ |
assertIteratorExhausted(it); |
617 |
+ |
} |
618 |
+ |
|
619 |
+ |
/** |
620 |
+ |
* iterator of empty collection has no elements |
621 |
+ |
*/ |
622 |
+ |
public void testEmptyIterator() { |
623 |
+ |
assertIteratorExhausted(new DelayQueue().iterator()); |
624 |
|
} |
625 |
|
|
626 |
|
/** |
656 |
|
public void testPollInExecutor() { |
657 |
|
final DelayQueue q = new DelayQueue(); |
658 |
|
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
659 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
660 |
< |
executor.execute(new CheckedRunnable() { |
661 |
< |
public void realRun() throws InterruptedException { |
662 |
< |
assertNull(q.poll()); |
663 |
< |
threadsStarted.await(); |
664 |
< |
assertNotNull(q.poll(LONG_DELAY_MS, MILLISECONDS)); |
665 |
< |
checkEmpty(q); |
666 |
< |
}}); |
667 |
< |
|
668 |
< |
executor.execute(new CheckedRunnable() { |
669 |
< |
public void realRun() throws InterruptedException { |
670 |
< |
threadsStarted.await(); |
671 |
< |
q.put(new PDelay(1)); |
672 |
< |
}}); |
673 |
< |
|
674 |
< |
joinPool(executor); |
659 |
> |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
660 |
> |
try (PoolCleaner cleaner = cleaner(executor)) { |
661 |
> |
executor.execute(new CheckedRunnable() { |
662 |
> |
public void realRun() throws InterruptedException { |
663 |
> |
assertNull(q.poll()); |
664 |
> |
threadsStarted.await(); |
665 |
> |
assertNotNull(q.poll(LONG_DELAY_MS, MILLISECONDS)); |
666 |
> |
checkEmpty(q); |
667 |
> |
}}); |
668 |
> |
|
669 |
> |
executor.execute(new CheckedRunnable() { |
670 |
> |
public void realRun() throws InterruptedException { |
671 |
> |
threadsStarted.await(); |
672 |
> |
q.put(new PDelay(1)); |
673 |
> |
}}); |
674 |
> |
} |
675 |
|
} |
676 |
|
|
677 |
|
/** |
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 |
|
} |
783 |
|
|
784 |
+ |
/** |
785 |
+ |
* remove(null), contains(null) always return false |
786 |
+ |
*/ |
787 |
+ |
public void testNeverContainsNull() { |
788 |
+ |
Collection<?> q = populatedQueue(SIZE); |
789 |
+ |
assertFalse(q.contains(null)); |
790 |
+ |
assertFalse(q.remove(null)); |
791 |
+ |
} |
792 |
|
} |