6 |
|
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
– |
import junit.framework.*; |
10 |
– |
import java.util.*; |
9 |
|
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
10 |
< |
import java.util.concurrent.*; |
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; |
17 |
> |
import java.util.concurrent.CountDownLatch; |
18 |
> |
import java.util.concurrent.Delayed; |
19 |
> |
import java.util.concurrent.DelayQueue; |
20 |
> |
import java.util.concurrent.Executors; |
21 |
> |
import java.util.concurrent.ExecutorService; |
22 |
> |
import java.util.concurrent.TimeUnit; |
23 |
> |
|
24 |
> |
import junit.framework.Test; |
25 |
|
|
26 |
|
public class DelayQueueTest extends JSR166TestCase { |
27 |
+ |
|
28 |
+ |
public static class Generic extends BlockingQueueTest { |
29 |
+ |
protected BlockingQueue emptyCollection() { |
30 |
+ |
return new DelayQueue(); |
31 |
+ |
} |
32 |
+ |
protected PDelay makeElement(int i) { |
33 |
+ |
return new PDelay(i); |
34 |
+ |
} |
35 |
+ |
} |
36 |
+ |
|
37 |
|
public static void main(String[] args) { |
38 |
|
junit.textui.TestRunner.run(suite()); |
39 |
|
} |
40 |
|
|
41 |
|
public static Test suite() { |
42 |
< |
return new TestSuite(DelayQueueTest.class); |
42 |
> |
return newTestSuite(DelayQueueTest.class, |
43 |
> |
new Generic().testSuite()); |
44 |
|
} |
45 |
|
|
46 |
|
private static final int NOCAP = Integer.MAX_VALUE; |
52 |
|
*/ |
53 |
|
static class PDelay implements Delayed { |
54 |
|
int pseudodelay; |
55 |
< |
PDelay(int i) { pseudodelay = Integer.MIN_VALUE + i; } |
56 |
< |
public int compareTo(PDelay y) { |
57 |
< |
int i = pseudodelay; |
58 |
< |
int j = y.pseudodelay; |
59 |
< |
if (i < j) return -1; |
37 |
< |
if (i > j) return 1; |
38 |
< |
return 0; |
55 |
> |
PDelay(int i) { pseudodelay = i; } |
56 |
> |
public int compareTo(PDelay other) { |
57 |
> |
int a = this.pseudodelay; |
58 |
> |
int b = other.pseudodelay; |
59 |
> |
return (a < b) ? -1 : (a > b) ? 1 : 0; |
60 |
|
} |
40 |
– |
|
61 |
|
public int compareTo(Delayed y) { |
62 |
|
return compareTo((PDelay)y); |
63 |
|
} |
44 |
– |
|
64 |
|
public boolean equals(Object other) { |
65 |
< |
return equals((PDelay)other); |
66 |
< |
} |
48 |
< |
public boolean equals(PDelay other) { |
49 |
< |
return other.pseudodelay == pseudodelay; |
65 |
> |
return (other instanceof PDelay) && |
66 |
> |
this.pseudodelay == ((PDelay)other).pseudodelay; |
67 |
|
} |
68 |
< |
|
68 |
> |
// suppress [overrides] javac warning |
69 |
> |
public int hashCode() { return pseudodelay; } |
70 |
|
public long getDelay(TimeUnit ignore) { |
71 |
< |
return pseudodelay; |
71 |
> |
return Integer.MIN_VALUE + pseudodelay; |
72 |
|
} |
55 |
– |
public int intValue() { |
56 |
– |
return pseudodelay; |
57 |
– |
} |
58 |
– |
|
73 |
|
public String toString() { |
74 |
|
return String.valueOf(pseudodelay); |
75 |
|
} |
102 |
|
return other.trigger == trigger; |
103 |
|
} |
104 |
|
|
105 |
+ |
// suppress [overrides] javac warning |
106 |
+ |
public int hashCode() { return (int) trigger; } |
107 |
+ |
|
108 |
|
public long getDelay(TimeUnit unit) { |
109 |
|
long n = trigger - System.nanoTime(); |
110 |
|
return unit.convert(n, TimeUnit.NANOSECONDS); |
120 |
|
} |
121 |
|
|
122 |
|
/** |
123 |
< |
* Create a queue of given size containing consecutive |
123 |
> |
* Returns a new queue of given size containing consecutive |
124 |
|
* PDelays 0 ... n. |
125 |
|
*/ |
126 |
|
private DelayQueue<PDelay> populatedQueue(int n) { |
127 |
|
DelayQueue<PDelay> q = new DelayQueue<PDelay>(); |
128 |
|
assertTrue(q.isEmpty()); |
129 |
< |
for (int i = n-1; i >= 0; i-=2) |
129 |
> |
for (int i = n-1; i >= 0; i -= 2) |
130 |
|
assertTrue(q.offer(new PDelay(i))); |
131 |
< |
for (int i = (n & 1); i < n; i+=2) |
131 |
> |
for (int i = (n & 1); i < n; i += 2) |
132 |
|
assertTrue(q.offer(new PDelay(i))); |
133 |
|
assertFalse(q.isEmpty()); |
134 |
|
assertEquals(NOCAP, q.remainingCapacity()); |
148 |
|
*/ |
149 |
|
public void testConstructor3() { |
150 |
|
try { |
151 |
< |
DelayQueue q = new DelayQueue(null); |
151 |
> |
new DelayQueue(null); |
152 |
|
shouldThrow(); |
153 |
|
} catch (NullPointerException success) {} |
154 |
|
} |
159 |
|
public void testConstructor4() { |
160 |
|
try { |
161 |
|
PDelay[] ints = new PDelay[SIZE]; |
162 |
< |
DelayQueue q = new DelayQueue(Arrays.asList(ints)); |
162 |
> |
new DelayQueue(Arrays.asList(ints)); |
163 |
|
shouldThrow(); |
164 |
|
} catch (NullPointerException success) {} |
165 |
|
} |
172 |
|
PDelay[] ints = new PDelay[SIZE]; |
173 |
|
for (int i = 0; i < SIZE-1; ++i) |
174 |
|
ints[i] = new PDelay(i); |
175 |
< |
DelayQueue q = new DelayQueue(Arrays.asList(ints)); |
175 |
> |
new DelayQueue(Arrays.asList(ints)); |
176 |
|
shouldThrow(); |
177 |
|
} catch (NullPointerException success) {} |
178 |
|
} |
223 |
|
} |
224 |
|
|
225 |
|
/** |
209 |
– |
* offer(null) throws NPE |
210 |
– |
*/ |
211 |
– |
public void testOfferNull() { |
212 |
– |
try { |
213 |
– |
DelayQueue q = new DelayQueue(); |
214 |
– |
q.offer(null); |
215 |
– |
shouldThrow(); |
216 |
– |
} catch (NullPointerException success) {} |
217 |
– |
} |
218 |
– |
|
219 |
– |
/** |
220 |
– |
* add(null) throws NPE |
221 |
– |
*/ |
222 |
– |
public void testAddNull() { |
223 |
– |
try { |
224 |
– |
DelayQueue q = new DelayQueue(); |
225 |
– |
q.add(null); |
226 |
– |
shouldThrow(); |
227 |
– |
} catch (NullPointerException success) {} |
228 |
– |
} |
229 |
– |
|
230 |
– |
/** |
226 |
|
* offer non-null succeeds |
227 |
|
*/ |
228 |
|
public void testOffer() { |
243 |
|
} |
244 |
|
|
245 |
|
/** |
251 |
– |
* addAll(null) throws NPE |
252 |
– |
*/ |
253 |
– |
public void testAddAll1() { |
254 |
– |
try { |
255 |
– |
DelayQueue q = new DelayQueue(); |
256 |
– |
q.addAll(null); |
257 |
– |
shouldThrow(); |
258 |
– |
} catch (NullPointerException success) {} |
259 |
– |
} |
260 |
– |
|
261 |
– |
/** |
246 |
|
* addAll(this) throws IAE |
247 |
|
*/ |
248 |
|
public void testAddAllSelf() { |
254 |
|
} |
255 |
|
|
256 |
|
/** |
273 |
– |
* addAll of a collection with null elements throws NPE |
274 |
– |
*/ |
275 |
– |
public void testAddAll2() { |
276 |
– |
try { |
277 |
– |
DelayQueue q = new DelayQueue(); |
278 |
– |
PDelay[] ints = new PDelay[SIZE]; |
279 |
– |
q.addAll(Arrays.asList(ints)); |
280 |
– |
shouldThrow(); |
281 |
– |
} catch (NullPointerException success) {} |
282 |
– |
} |
283 |
– |
|
284 |
– |
/** |
257 |
|
* addAll of a collection with any null elements throws NPE after |
258 |
|
* possibly adding some elements |
259 |
|
*/ |
284 |
|
} |
285 |
|
|
286 |
|
/** |
315 |
– |
* put(null) throws NPE |
316 |
– |
*/ |
317 |
– |
public void testPutNull() { |
318 |
– |
try { |
319 |
– |
DelayQueue q = new DelayQueue(); |
320 |
– |
q.put(null); |
321 |
– |
shouldThrow(); |
322 |
– |
} catch (NullPointerException success) {} |
323 |
– |
} |
324 |
– |
|
325 |
– |
/** |
287 |
|
* all elements successfully put are contained |
288 |
|
*/ |
289 |
|
public void testPut() { |
290 |
|
DelayQueue q = new DelayQueue(); |
291 |
|
for (int i = 0; i < SIZE; ++i) { |
292 |
< |
PDelay I = new PDelay(i); |
293 |
< |
q.put(I); |
294 |
< |
assertTrue(q.contains(I)); |
292 |
> |
PDelay x = new PDelay(i); |
293 |
> |
q.put(x); |
294 |
> |
assertTrue(q.contains(x)); |
295 |
|
} |
296 |
|
assertEquals(SIZE, q.size()); |
297 |
|
} |
335 |
|
public void testTake() throws InterruptedException { |
336 |
|
DelayQueue q = populatedQueue(SIZE); |
337 |
|
for (int i = 0; i < SIZE; ++i) { |
338 |
< |
assertEquals(new PDelay(i), ((PDelay)q.take())); |
338 |
> |
assertEquals(new PDelay(i), q.take()); |
339 |
|
} |
340 |
|
} |
341 |
|
|
342 |
|
/** |
382 |
– |
* take blocks interruptibly when empty |
383 |
– |
*/ |
384 |
– |
public void testTakeFromEmptyBlocksInterruptibly() |
385 |
– |
throws InterruptedException { |
386 |
– |
final BlockingQueue q = new DelayQueue(); |
387 |
– |
final CountDownLatch threadStarted = new CountDownLatch(1); |
388 |
– |
Thread t = newStartedThread(new CheckedRunnable() { |
389 |
– |
public void realRun() { |
390 |
– |
threadStarted.countDown(); |
391 |
– |
try { |
392 |
– |
q.take(); |
393 |
– |
shouldThrow(); |
394 |
– |
} catch (InterruptedException success) {} |
395 |
– |
assertFalse(Thread.interrupted()); |
396 |
– |
}}); |
397 |
– |
|
398 |
– |
await(threadStarted); |
399 |
– |
assertThreadStaysAlive(t); |
400 |
– |
t.interrupt(); |
401 |
– |
awaitTermination(t); |
402 |
– |
} |
403 |
– |
|
404 |
– |
/** |
343 |
|
* Take removes existing elements until empty, then blocks interruptibly |
344 |
|
*/ |
345 |
|
public void testBlockingTake() throws InterruptedException { |
378 |
|
public void testPoll() { |
379 |
|
DelayQueue q = populatedQueue(SIZE); |
380 |
|
for (int i = 0; i < SIZE; ++i) { |
381 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll())); |
381 |
> |
assertEquals(new PDelay(i), q.poll()); |
382 |
|
} |
383 |
|
assertNull(q.poll()); |
384 |
|
} |
389 |
|
public void testTimedPoll0() throws InterruptedException { |
390 |
|
DelayQueue q = populatedQueue(SIZE); |
391 |
|
for (int i = 0; i < SIZE; ++i) { |
392 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll(0, MILLISECONDS))); |
392 |
> |
assertEquals(new PDelay(i), q.poll(0, MILLISECONDS)); |
393 |
|
} |
394 |
|
assertNull(q.poll(0, MILLISECONDS)); |
395 |
|
} |
400 |
|
public void testTimedPoll() throws InterruptedException { |
401 |
|
DelayQueue q = populatedQueue(SIZE); |
402 |
|
for (int i = 0; i < SIZE; ++i) { |
403 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll(SHORT_DELAY_MS, MILLISECONDS))); |
403 |
> |
long startTime = System.nanoTime(); |
404 |
> |
assertEquals(new PDelay(i), q.poll(LONG_DELAY_MS, MILLISECONDS)); |
405 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
406 |
|
} |
407 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
407 |
> |
long startTime = System.nanoTime(); |
408 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
409 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
410 |
> |
checkEmpty(q); |
411 |
|
} |
412 |
|
|
413 |
|
/** |
445 |
|
} |
446 |
|
|
447 |
|
/** |
505 |
– |
* timed poll before a delayed offer fails; after offer succeeds; |
506 |
– |
* on interruption throws |
507 |
– |
*/ |
508 |
– |
public void testTimedPollWithOffer() throws InterruptedException { |
509 |
– |
final DelayQueue q = new DelayQueue(); |
510 |
– |
final PDelay pdelay = new PDelay(0); |
511 |
– |
final CheckedBarrier barrier = new CheckedBarrier(2); |
512 |
– |
Thread t = newStartedThread(new CheckedRunnable() { |
513 |
– |
public void realRun() throws InterruptedException { |
514 |
– |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
515 |
– |
|
516 |
– |
barrier.await(); |
517 |
– |
assertSame(pdelay, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
518 |
– |
|
519 |
– |
Thread.currentThread().interrupt(); |
520 |
– |
try { |
521 |
– |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
522 |
– |
shouldThrow(); |
523 |
– |
} catch (InterruptedException success) {} |
524 |
– |
assertFalse(Thread.interrupted()); |
525 |
– |
|
526 |
– |
barrier.await(); |
527 |
– |
try { |
528 |
– |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
529 |
– |
shouldThrow(); |
530 |
– |
} catch (InterruptedException success) {} |
531 |
– |
assertFalse(Thread.interrupted()); |
532 |
– |
}}); |
533 |
– |
|
534 |
– |
barrier.await(); |
535 |
– |
long startTime = System.nanoTime(); |
536 |
– |
assertTrue(q.offer(pdelay, LONG_DELAY_MS, MILLISECONDS)); |
537 |
– |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
538 |
– |
|
539 |
– |
barrier.await(); |
540 |
– |
assertThreadStaysAlive(t); |
541 |
– |
t.interrupt(); |
542 |
– |
awaitTermination(t); |
543 |
– |
} |
544 |
– |
|
545 |
– |
/** |
448 |
|
* peek returns next element, or null if empty |
449 |
|
*/ |
450 |
|
public void testPeek() { |
451 |
|
DelayQueue q = populatedQueue(SIZE); |
452 |
|
for (int i = 0; i < SIZE; ++i) { |
453 |
< |
assertEquals(new PDelay(i), ((PDelay)q.peek())); |
454 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll())); |
453 |
> |
assertEquals(new PDelay(i), q.peek()); |
454 |
> |
assertEquals(new PDelay(i), q.poll()); |
455 |
|
if (q.isEmpty()) |
456 |
|
assertNull(q.peek()); |
457 |
|
else |
466 |
|
public void testElement() { |
467 |
|
DelayQueue q = populatedQueue(SIZE); |
468 |
|
for (int i = 0; i < SIZE; ++i) { |
469 |
< |
assertEquals(new PDelay(i), ((PDelay)q.element())); |
469 |
> |
assertEquals(new PDelay(i), q.element()); |
470 |
|
q.poll(); |
471 |
|
} |
472 |
|
try { |
481 |
|
public void testRemove() { |
482 |
|
DelayQueue q = populatedQueue(SIZE); |
483 |
|
for (int i = 0; i < SIZE; ++i) { |
484 |
< |
assertEquals(new PDelay(i), ((PDelay)q.remove())); |
484 |
> |
assertEquals(new PDelay(i), q.remove()); |
485 |
|
} |
486 |
|
try { |
487 |
|
q.remove(); |
490 |
|
} |
491 |
|
|
492 |
|
/** |
591 |
– |
* remove(x) removes x and returns true if present |
592 |
– |
*/ |
593 |
– |
public void testRemoveElement() { |
594 |
– |
DelayQueue q = populatedQueue(SIZE); |
595 |
– |
for (int i = 1; i < SIZE; i+=2) { |
596 |
– |
assertTrue(q.remove(new PDelay(i))); |
597 |
– |
} |
598 |
– |
for (int i = 0; i < SIZE; i+=2) { |
599 |
– |
assertTrue(q.remove(new PDelay(i))); |
600 |
– |
assertFalse(q.remove(new PDelay(i+1))); |
601 |
– |
} |
602 |
– |
assertTrue(q.isEmpty()); |
603 |
– |
} |
604 |
– |
|
605 |
– |
/** |
493 |
|
* contains(x) reports true when elements added but not yet removed |
494 |
|
*/ |
495 |
|
public void testContains() { |
561 |
|
assertTrue(q.removeAll(p)); |
562 |
|
assertEquals(SIZE-i, q.size()); |
563 |
|
for (int j = 0; j < i; ++j) { |
564 |
< |
PDelay I = (PDelay)(p.remove()); |
565 |
< |
assertFalse(q.contains(I)); |
564 |
> |
PDelay x = (PDelay)(p.remove()); |
565 |
> |
assertFalse(q.contains(x)); |
566 |
|
} |
567 |
|
} |
568 |
|
} |
592 |
|
} |
593 |
|
|
594 |
|
/** |
708 |
– |
* toArray(null) throws NullPointerException |
709 |
– |
*/ |
710 |
– |
public void testToArray_NullArg() { |
711 |
– |
DelayQueue q = populatedQueue(SIZE); |
712 |
– |
try { |
713 |
– |
q.toArray(null); |
714 |
– |
shouldThrow(); |
715 |
– |
} catch (NullPointerException success) {} |
716 |
– |
} |
717 |
– |
|
718 |
– |
/** |
595 |
|
* toArray(incompatible array type) throws ArrayStoreException |
596 |
|
*/ |
597 |
|
public void testToArray1_BadArg() { |
614 |
|
++i; |
615 |
|
} |
616 |
|
assertEquals(i, SIZE); |
617 |
+ |
assertIteratorExhausted(it); |
618 |
+ |
} |
619 |
+ |
|
620 |
+ |
/** |
621 |
+ |
* iterator of empty collection has no elements |
622 |
+ |
*/ |
623 |
+ |
public void testEmptyIterator() { |
624 |
+ |
assertIteratorExhausted(new DelayQueue().iterator()); |
625 |
|
} |
626 |
|
|
627 |
|
/** |
636 |
|
it.next(); |
637 |
|
it.remove(); |
638 |
|
it = q.iterator(); |
639 |
< |
assertEquals(it.next(), new PDelay(2)); |
640 |
< |
assertEquals(it.next(), new PDelay(3)); |
639 |
> |
assertEquals(new PDelay(2), it.next()); |
640 |
> |
assertEquals(new PDelay(3), it.next()); |
641 |
|
assertFalse(it.hasNext()); |
642 |
|
} |
643 |
|
|
647 |
|
public void testToString() { |
648 |
|
DelayQueue q = populatedQueue(SIZE); |
649 |
|
String s = q.toString(); |
650 |
< |
for (int i = 0; i < SIZE; ++i) { |
651 |
< |
assertTrue(s.contains(String.valueOf(Integer.MIN_VALUE+i))); |
768 |
< |
} |
650 |
> |
for (Object e : q) |
651 |
> |
assertTrue(s.contains(e.toString())); |
652 |
|
} |
653 |
|
|
654 |
|
/** |
662 |
|
public void realRun() throws InterruptedException { |
663 |
|
assertNull(q.poll()); |
664 |
|
threadsStarted.await(); |
665 |
< |
assertTrue(null != q.poll(LONG_DELAY_MS, MILLISECONDS)); |
665 |
> |
assertNotNull(q.poll(LONG_DELAY_MS, MILLISECONDS)); |
666 |
|
checkEmpty(q); |
667 |
|
}}); |
668 |
|
|
719 |
|
public void testTimedPollDelayed() throws InterruptedException { |
720 |
|
DelayQueue q = new DelayQueue(); |
721 |
|
q.add(new NanoDelay(LONG_DELAY_MS * 1000000L)); |
722 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
840 |
< |
} |
841 |
< |
|
842 |
< |
/** |
843 |
< |
* drainTo(null) throws NPE |
844 |
< |
*/ |
845 |
< |
public void testDrainToNull() { |
846 |
< |
DelayQueue q = populatedQueue(SIZE); |
847 |
< |
try { |
848 |
< |
q.drainTo(null); |
849 |
< |
shouldThrow(); |
850 |
< |
} catch (NullPointerException success) {} |
851 |
< |
} |
852 |
< |
|
853 |
< |
/** |
854 |
< |
* drainTo(this) throws IAE |
855 |
< |
*/ |
856 |
< |
public void testDrainToSelf() { |
857 |
< |
DelayQueue q = populatedQueue(SIZE); |
858 |
< |
try { |
859 |
< |
q.drainTo(q); |
860 |
< |
shouldThrow(); |
861 |
< |
} catch (IllegalArgumentException success) {} |
722 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
723 |
|
} |
724 |
|
|
725 |
|
/** |
734 |
|
} |
735 |
|
ArrayList l = new ArrayList(); |
736 |
|
q.drainTo(l); |
737 |
< |
assertEquals(q.size(), 0); |
737 |
> |
assertEquals(0, q.size()); |
738 |
|
for (int i = 0; i < SIZE; ++i) |
739 |
< |
assertEquals(l.get(i), elems[i]); |
739 |
> |
assertEquals(elems[i], l.get(i)); |
740 |
|
q.add(elems[0]); |
741 |
|
q.add(elems[1]); |
742 |
|
assertFalse(q.isEmpty()); |
744 |
|
assertTrue(q.contains(elems[1])); |
745 |
|
l.clear(); |
746 |
|
q.drainTo(l); |
747 |
< |
assertEquals(q.size(), 0); |
748 |
< |
assertEquals(l.size(), 2); |
747 |
> |
assertEquals(0, q.size()); |
748 |
> |
assertEquals(2, l.size()); |
749 |
|
for (int i = 0; i < 2; ++i) |
750 |
< |
assertEquals(l.get(i), elems[i]); |
750 |
> |
assertEquals(elems[i], l.get(i)); |
751 |
|
} |
752 |
|
|
753 |
|
/** |
769 |
|
} |
770 |
|
|
771 |
|
/** |
911 |
– |
* drainTo(null, n) throws NPE |
912 |
– |
*/ |
913 |
– |
public void testDrainToNullN() { |
914 |
– |
DelayQueue q = populatedQueue(SIZE); |
915 |
– |
try { |
916 |
– |
q.drainTo(null, 0); |
917 |
– |
shouldThrow(); |
918 |
– |
} catch (NullPointerException success) {} |
919 |
– |
} |
920 |
– |
|
921 |
– |
/** |
922 |
– |
* drainTo(this, n) throws IAE |
923 |
– |
*/ |
924 |
– |
public void testDrainToSelfN() { |
925 |
– |
DelayQueue q = populatedQueue(SIZE); |
926 |
– |
try { |
927 |
– |
q.drainTo(q, 0); |
928 |
– |
shouldThrow(); |
929 |
– |
} catch (IllegalArgumentException success) {} |
930 |
– |
} |
931 |
– |
|
932 |
– |
/** |
772 |
|
* drainTo(c, n) empties first min(n, size) elements of queue into c |
773 |
|
*/ |
774 |
|
public void testDrainToN() { |
777 |
|
ArrayList l = new ArrayList(); |
778 |
|
q.drainTo(l, i); |
779 |
|
int k = (i < SIZE) ? i : SIZE; |
780 |
< |
assertEquals(q.size(), SIZE-k); |
781 |
< |
assertEquals(l.size(), k); |
780 |
> |
assertEquals(SIZE-k, q.size()); |
781 |
> |
assertEquals(k, l.size()); |
782 |
|
} |
783 |
|
} |
784 |
|
|
785 |
+ |
/** |
786 |
+ |
* remove(null), contains(null) always return false |
787 |
+ |
*/ |
788 |
+ |
public void testNeverContainsNull() { |
789 |
+ |
Collection<?> q = populatedQueue(SIZE); |
790 |
+ |
assertFalse(q.contains(null)); |
791 |
+ |
assertFalse(q.remove(null)); |
792 |
+ |
} |
793 |
|
} |