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()); |
38 |
> |
main(suite(), args); |
39 |
|
} |
40 |
|
|
41 |
|
public static Test suite() { |
42 |
< |
return new TestSuite(DelayQueueTest.class); |
42 |
> |
return newTestSuite(DelayQueueTest.class, |
43 |
> |
new Generic().testSuite()); |
44 |
|
} |
45 |
|
|
23 |
– |
private static final int NOCAP = Integer.MAX_VALUE; |
24 |
– |
|
46 |
|
/** |
47 |
|
* A delayed implementation for testing. |
48 |
|
* Most tests use Pseudodelays, where delays are all elapsed |
50 |
|
*/ |
51 |
|
static class PDelay implements Delayed { |
52 |
|
int pseudodelay; |
53 |
< |
PDelay(int i) { pseudodelay = Integer.MIN_VALUE + i; } |
54 |
< |
public int compareTo(PDelay y) { |
55 |
< |
int i = pseudodelay; |
56 |
< |
int j = y.pseudodelay; |
57 |
< |
if (i < j) return -1; |
37 |
< |
if (i > j) return 1; |
38 |
< |
return 0; |
53 |
> |
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 |
|
} |
40 |
– |
|
59 |
|
public int compareTo(Delayed y) { |
60 |
|
return compareTo((PDelay)y); |
61 |
|
} |
44 |
– |
|
62 |
|
public boolean equals(Object other) { |
63 |
< |
return equals((PDelay)other); |
64 |
< |
} |
48 |
< |
public boolean equals(PDelay other) { |
49 |
< |
return other.pseudodelay == pseudodelay; |
63 |
> |
return (other instanceof PDelay) && |
64 |
> |
this.pseudodelay == ((PDelay)other).pseudodelay; |
65 |
|
} |
66 |
< |
|
66 |
> |
// suppress [overrides] javac warning |
67 |
> |
public int hashCode() { return pseudodelay; } |
68 |
|
public long getDelay(TimeUnit ignore) { |
69 |
< |
return pseudodelay; |
54 |
< |
} |
55 |
< |
public int intValue() { |
56 |
< |
return pseudodelay; |
69 |
> |
return Integer.MIN_VALUE + pseudodelay; |
70 |
|
} |
58 |
– |
|
71 |
|
public String toString() { |
72 |
|
return String.valueOf(pseudodelay); |
73 |
|
} |
100 |
|
return other.trigger == trigger; |
101 |
|
} |
102 |
|
|
103 |
+ |
// suppress [overrides] javac warning |
104 |
+ |
public int hashCode() { return (int) trigger; } |
105 |
+ |
|
106 |
|
public long getDelay(TimeUnit unit) { |
107 |
|
long n = trigger - System.nanoTime(); |
108 |
|
return unit.convert(n, TimeUnit.NANOSECONDS); |
118 |
|
} |
119 |
|
|
120 |
|
/** |
121 |
< |
* Create a queue of given size containing consecutive |
121 |
> |
* Returns a new queue of given size containing consecutive |
122 |
|
* PDelays 0 ... n. |
123 |
|
*/ |
124 |
|
private DelayQueue<PDelay> populatedQueue(int n) { |
125 |
|
DelayQueue<PDelay> q = new DelayQueue<PDelay>(); |
126 |
|
assertTrue(q.isEmpty()); |
127 |
< |
for (int i = n-1; i >= 0; i-=2) |
127 |
> |
for (int i = n-1; i >= 0; i -= 2) |
128 |
|
assertTrue(q.offer(new PDelay(i))); |
129 |
< |
for (int i = (n & 1); i < n; i+=2) |
129 |
> |
for (int i = (n & 1); i < n; i += 2) |
130 |
|
assertTrue(q.offer(new PDelay(i))); |
131 |
|
assertFalse(q.isEmpty()); |
132 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
132 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
133 |
|
assertEquals(n, q.size()); |
134 |
|
return q; |
135 |
|
} |
138 |
|
* A new queue has unbounded capacity |
139 |
|
*/ |
140 |
|
public void testConstructor1() { |
141 |
< |
assertEquals(NOCAP, new DelayQueue().remainingCapacity()); |
141 |
> |
assertEquals(Integer.MAX_VALUE, new DelayQueue().remainingCapacity()); |
142 |
|
} |
143 |
|
|
144 |
|
/** |
146 |
|
*/ |
147 |
|
public void testConstructor3() { |
148 |
|
try { |
149 |
< |
DelayQueue q = new DelayQueue(null); |
149 |
> |
new DelayQueue(null); |
150 |
|
shouldThrow(); |
151 |
|
} catch (NullPointerException success) {} |
152 |
|
} |
157 |
|
public void testConstructor4() { |
158 |
|
try { |
159 |
|
PDelay[] ints = new PDelay[SIZE]; |
160 |
< |
DelayQueue q = new DelayQueue(Arrays.asList(ints)); |
160 |
> |
new DelayQueue(Arrays.asList(ints)); |
161 |
|
shouldThrow(); |
162 |
|
} catch (NullPointerException success) {} |
163 |
|
} |
170 |
|
PDelay[] ints = new PDelay[SIZE]; |
171 |
|
for (int i = 0; i < SIZE-1; ++i) |
172 |
|
ints[i] = new PDelay(i); |
173 |
< |
DelayQueue q = new DelayQueue(Arrays.asList(ints)); |
173 |
> |
new DelayQueue(Arrays.asList(ints)); |
174 |
|
shouldThrow(); |
175 |
|
} catch (NullPointerException success) {} |
176 |
|
} |
193 |
|
public void testEmpty() { |
194 |
|
DelayQueue q = new DelayQueue(); |
195 |
|
assertTrue(q.isEmpty()); |
196 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
196 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
197 |
|
q.add(new PDelay(1)); |
198 |
|
assertFalse(q.isEmpty()); |
199 |
|
q.add(new PDelay(2)); |
203 |
|
} |
204 |
|
|
205 |
|
/** |
206 |
< |
* remainingCapacity does not change when elements added or removed, |
192 |
< |
* but size does |
206 |
> |
* remainingCapacity() always returns Integer.MAX_VALUE |
207 |
|
*/ |
208 |
|
public void testRemainingCapacity() { |
209 |
< |
DelayQueue q = populatedQueue(SIZE); |
209 |
> |
BlockingQueue q = populatedQueue(SIZE); |
210 |
|
for (int i = 0; i < SIZE; ++i) { |
211 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
211 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
212 |
|
assertEquals(SIZE-i, q.size()); |
213 |
< |
q.remove(); |
213 |
> |
assertTrue(q.remove() instanceof PDelay); |
214 |
|
} |
215 |
|
for (int i = 0; i < SIZE; ++i) { |
216 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
216 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
217 |
|
assertEquals(i, q.size()); |
218 |
< |
q.add(new PDelay(i)); |
218 |
> |
assertTrue(q.add(new PDelay(i))); |
219 |
|
} |
220 |
|
} |
221 |
|
|
222 |
|
/** |
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 |
– |
/** |
223 |
|
* offer non-null succeeds |
224 |
|
*/ |
225 |
|
public void testOffer() { |
240 |
|
} |
241 |
|
|
242 |
|
/** |
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 |
– |
/** |
243 |
|
* addAll(this) throws IAE |
244 |
|
*/ |
245 |
|
public void testAddAllSelf() { |
251 |
|
} |
252 |
|
|
253 |
|
/** |
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 |
– |
/** |
254 |
|
* addAll of a collection with any null elements throws NPE after |
255 |
|
* possibly adding some elements |
256 |
|
*/ |
281 |
|
} |
282 |
|
|
283 |
|
/** |
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 |
– |
/** |
284 |
|
* all elements successfully put are contained |
285 |
|
*/ |
286 |
|
public void testPut() { |
287 |
|
DelayQueue q = new DelayQueue(); |
288 |
|
for (int i = 0; i < SIZE; ++i) { |
289 |
< |
PDelay I = new PDelay(i); |
290 |
< |
q.put(I); |
291 |
< |
assertTrue(q.contains(I)); |
289 |
> |
PDelay x = new PDelay(i); |
290 |
> |
q.put(x); |
291 |
> |
assertTrue(q.contains(x)); |
292 |
|
} |
293 |
|
assertEquals(SIZE, q.size()); |
294 |
|
} |
332 |
|
public void testTake() throws InterruptedException { |
333 |
|
DelayQueue q = populatedQueue(SIZE); |
334 |
|
for (int i = 0; i < SIZE; ++i) { |
335 |
< |
assertEquals(new PDelay(i), ((PDelay)q.take())); |
335 |
> |
assertEquals(new PDelay(i), q.take()); |
336 |
|
} |
337 |
|
} |
338 |
|
|
339 |
|
/** |
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 |
– |
/** |
340 |
|
* Take removes existing elements until empty, then blocks interruptibly |
341 |
|
*/ |
342 |
|
public void testBlockingTake() throws InterruptedException { |
375 |
|
public void testPoll() { |
376 |
|
DelayQueue q = populatedQueue(SIZE); |
377 |
|
for (int i = 0; i < SIZE; ++i) { |
378 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll())); |
378 |
> |
assertEquals(new PDelay(i), q.poll()); |
379 |
|
} |
380 |
|
assertNull(q.poll()); |
381 |
|
} |
386 |
|
public void testTimedPoll0() throws InterruptedException { |
387 |
|
DelayQueue q = populatedQueue(SIZE); |
388 |
|
for (int i = 0; i < SIZE; ++i) { |
389 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll(0, MILLISECONDS))); |
389 |
> |
assertEquals(new PDelay(i), q.poll(0, MILLISECONDS)); |
390 |
|
} |
391 |
|
assertNull(q.poll(0, MILLISECONDS)); |
392 |
|
} |
398 |
|
DelayQueue q = populatedQueue(SIZE); |
399 |
|
for (int i = 0; i < SIZE; ++i) { |
400 |
|
long startTime = System.nanoTime(); |
401 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll(LONG_DELAY_MS, MILLISECONDS))); |
401 |
> |
assertEquals(new PDelay(i), q.poll(LONG_DELAY_MS, MILLISECONDS)); |
402 |
|
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
403 |
|
} |
404 |
|
long startTime = System.nanoTime(); |
442 |
|
} |
443 |
|
|
444 |
|
/** |
510 |
– |
* timed poll before a delayed offer fails; after offer succeeds; |
511 |
– |
* on interruption throws |
512 |
– |
*/ |
513 |
– |
public void testTimedPollWithOffer() throws InterruptedException { |
514 |
– |
final DelayQueue q = new DelayQueue(); |
515 |
– |
final PDelay pdelay = new PDelay(0); |
516 |
– |
final CheckedBarrier barrier = new CheckedBarrier(2); |
517 |
– |
Thread t = newStartedThread(new CheckedRunnable() { |
518 |
– |
public void realRun() throws InterruptedException { |
519 |
– |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
520 |
– |
|
521 |
– |
barrier.await(); |
522 |
– |
assertSame(pdelay, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
523 |
– |
|
524 |
– |
Thread.currentThread().interrupt(); |
525 |
– |
try { |
526 |
– |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
527 |
– |
shouldThrow(); |
528 |
– |
} catch (InterruptedException success) {} |
529 |
– |
assertFalse(Thread.interrupted()); |
530 |
– |
|
531 |
– |
barrier.await(); |
532 |
– |
try { |
533 |
– |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
534 |
– |
shouldThrow(); |
535 |
– |
} catch (InterruptedException success) {} |
536 |
– |
assertFalse(Thread.interrupted()); |
537 |
– |
}}); |
538 |
– |
|
539 |
– |
barrier.await(); |
540 |
– |
long startTime = System.nanoTime(); |
541 |
– |
assertTrue(q.offer(pdelay, LONG_DELAY_MS, MILLISECONDS)); |
542 |
– |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
543 |
– |
|
544 |
– |
barrier.await(); |
545 |
– |
assertThreadStaysAlive(t); |
546 |
– |
t.interrupt(); |
547 |
– |
awaitTermination(t); |
548 |
– |
} |
549 |
– |
|
550 |
– |
/** |
445 |
|
* peek returns next element, or null if empty |
446 |
|
*/ |
447 |
|
public void testPeek() { |
448 |
|
DelayQueue q = populatedQueue(SIZE); |
449 |
|
for (int i = 0; i < SIZE; ++i) { |
450 |
< |
assertEquals(new PDelay(i), ((PDelay)q.peek())); |
451 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll())); |
450 |
> |
assertEquals(new PDelay(i), q.peek()); |
451 |
> |
assertEquals(new PDelay(i), q.poll()); |
452 |
|
if (q.isEmpty()) |
453 |
|
assertNull(q.peek()); |
454 |
|
else |
463 |
|
public void testElement() { |
464 |
|
DelayQueue q = populatedQueue(SIZE); |
465 |
|
for (int i = 0; i < SIZE; ++i) { |
466 |
< |
assertEquals(new PDelay(i), ((PDelay)q.element())); |
466 |
> |
assertEquals(new PDelay(i), q.element()); |
467 |
|
q.poll(); |
468 |
|
} |
469 |
|
try { |
478 |
|
public void testRemove() { |
479 |
|
DelayQueue q = populatedQueue(SIZE); |
480 |
|
for (int i = 0; i < SIZE; ++i) { |
481 |
< |
assertEquals(new PDelay(i), ((PDelay)q.remove())); |
481 |
> |
assertEquals(new PDelay(i), q.remove()); |
482 |
|
} |
483 |
|
try { |
484 |
|
q.remove(); |
487 |
|
} |
488 |
|
|
489 |
|
/** |
596 |
– |
* remove(x) removes x and returns true if present |
597 |
– |
*/ |
598 |
– |
public void testRemoveElement() { |
599 |
– |
DelayQueue q = populatedQueue(SIZE); |
600 |
– |
for (int i = 1; i < SIZE; i+=2) { |
601 |
– |
assertTrue(q.remove(new PDelay(i))); |
602 |
– |
} |
603 |
– |
for (int i = 0; i < SIZE; i+=2) { |
604 |
– |
assertTrue(q.remove(new PDelay(i))); |
605 |
– |
assertFalse(q.remove(new PDelay(i+1))); |
606 |
– |
} |
607 |
– |
assertTrue(q.isEmpty()); |
608 |
– |
} |
609 |
– |
|
610 |
– |
/** |
490 |
|
* contains(x) reports true when elements added but not yet removed |
491 |
|
*/ |
492 |
|
public void testContains() { |
506 |
|
q.clear(); |
507 |
|
assertTrue(q.isEmpty()); |
508 |
|
assertEquals(0, q.size()); |
509 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
509 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
510 |
|
PDelay x = new PDelay(1); |
511 |
|
q.add(x); |
512 |
|
assertFalse(q.isEmpty()); |
558 |
|
assertTrue(q.removeAll(p)); |
559 |
|
assertEquals(SIZE-i, q.size()); |
560 |
|
for (int j = 0; j < i; ++j) { |
561 |
< |
PDelay I = (PDelay)(p.remove()); |
562 |
< |
assertFalse(q.contains(I)); |
561 |
> |
PDelay x = (PDelay)(p.remove()); |
562 |
> |
assertFalse(q.contains(x)); |
563 |
|
} |
564 |
|
} |
565 |
|
} |
589 |
|
} |
590 |
|
|
591 |
|
/** |
713 |
– |
* toArray(null) throws NullPointerException |
714 |
– |
*/ |
715 |
– |
public void testToArray_NullArg() { |
716 |
– |
DelayQueue q = populatedQueue(SIZE); |
717 |
– |
try { |
718 |
– |
q.toArray(null); |
719 |
– |
shouldThrow(); |
720 |
– |
} catch (NullPointerException success) {} |
721 |
– |
} |
722 |
– |
|
723 |
– |
/** |
592 |
|
* toArray(incompatible array type) throws ArrayStoreException |
593 |
|
*/ |
594 |
|
public void testToArray1_BadArg() { |
611 |
|
++i; |
612 |
|
} |
613 |
|
assertEquals(i, SIZE); |
614 |
+ |
assertIteratorExhausted(it); |
615 |
+ |
} |
616 |
+ |
|
617 |
+ |
/** |
618 |
+ |
* iterator of empty collection has no elements |
619 |
+ |
*/ |
620 |
+ |
public void testEmptyIterator() { |
621 |
+ |
assertIteratorExhausted(new DelayQueue().iterator()); |
622 |
|
} |
623 |
|
|
624 |
|
/** |
633 |
|
it.next(); |
634 |
|
it.remove(); |
635 |
|
it = q.iterator(); |
636 |
< |
assertEquals(it.next(), new PDelay(2)); |
637 |
< |
assertEquals(it.next(), new PDelay(3)); |
636 |
> |
assertEquals(new PDelay(2), it.next()); |
637 |
> |
assertEquals(new PDelay(3), it.next()); |
638 |
|
assertFalse(it.hasNext()); |
639 |
|
} |
640 |
|
|
644 |
|
public void testToString() { |
645 |
|
DelayQueue q = populatedQueue(SIZE); |
646 |
|
String s = q.toString(); |
647 |
< |
for (int i = 0; i < SIZE; ++i) { |
648 |
< |
assertTrue(s.contains(String.valueOf(Integer.MIN_VALUE+i))); |
773 |
< |
} |
647 |
> |
for (Object e : q) |
648 |
> |
assertTrue(s.contains(e.toString())); |
649 |
|
} |
650 |
|
|
651 |
|
/** |
659 |
|
public void realRun() throws InterruptedException { |
660 |
|
assertNull(q.poll()); |
661 |
|
threadsStarted.await(); |
662 |
< |
assertTrue(null != q.poll(LONG_DELAY_MS, MILLISECONDS)); |
662 |
> |
assertNotNull(q.poll(LONG_DELAY_MS, MILLISECONDS)); |
663 |
|
checkEmpty(q); |
664 |
|
}}); |
665 |
|
|
720 |
|
} |
721 |
|
|
722 |
|
/** |
848 |
– |
* drainTo(null) throws NPE |
849 |
– |
*/ |
850 |
– |
public void testDrainToNull() { |
851 |
– |
DelayQueue q = populatedQueue(SIZE); |
852 |
– |
try { |
853 |
– |
q.drainTo(null); |
854 |
– |
shouldThrow(); |
855 |
– |
} catch (NullPointerException success) {} |
856 |
– |
} |
857 |
– |
|
858 |
– |
/** |
859 |
– |
* drainTo(this) throws IAE |
860 |
– |
*/ |
861 |
– |
public void testDrainToSelf() { |
862 |
– |
DelayQueue q = populatedQueue(SIZE); |
863 |
– |
try { |
864 |
– |
q.drainTo(q); |
865 |
– |
shouldThrow(); |
866 |
– |
} catch (IllegalArgumentException success) {} |
867 |
– |
} |
868 |
– |
|
869 |
– |
/** |
723 |
|
* drainTo(c) empties queue into another collection c |
724 |
|
*/ |
725 |
|
public void testDrainTo() { |
731 |
|
} |
732 |
|
ArrayList l = new ArrayList(); |
733 |
|
q.drainTo(l); |
734 |
< |
assertEquals(q.size(), 0); |
734 |
> |
assertEquals(0, q.size()); |
735 |
|
for (int i = 0; i < SIZE; ++i) |
736 |
< |
assertEquals(l.get(i), elems[i]); |
736 |
> |
assertEquals(elems[i], l.get(i)); |
737 |
|
q.add(elems[0]); |
738 |
|
q.add(elems[1]); |
739 |
|
assertFalse(q.isEmpty()); |
741 |
|
assertTrue(q.contains(elems[1])); |
742 |
|
l.clear(); |
743 |
|
q.drainTo(l); |
744 |
< |
assertEquals(q.size(), 0); |
745 |
< |
assertEquals(l.size(), 2); |
744 |
> |
assertEquals(0, q.size()); |
745 |
> |
assertEquals(2, l.size()); |
746 |
|
for (int i = 0; i < 2; ++i) |
747 |
< |
assertEquals(l.get(i), elems[i]); |
747 |
> |
assertEquals(elems[i], l.get(i)); |
748 |
|
} |
749 |
|
|
750 |
|
/** |
766 |
|
} |
767 |
|
|
768 |
|
/** |
916 |
– |
* drainTo(null, n) throws NPE |
917 |
– |
*/ |
918 |
– |
public void testDrainToNullN() { |
919 |
– |
DelayQueue q = populatedQueue(SIZE); |
920 |
– |
try { |
921 |
– |
q.drainTo(null, 0); |
922 |
– |
shouldThrow(); |
923 |
– |
} catch (NullPointerException success) {} |
924 |
– |
} |
925 |
– |
|
926 |
– |
/** |
927 |
– |
* drainTo(this, n) throws IAE |
928 |
– |
*/ |
929 |
– |
public void testDrainToSelfN() { |
930 |
– |
DelayQueue q = populatedQueue(SIZE); |
931 |
– |
try { |
932 |
– |
q.drainTo(q, 0); |
933 |
– |
shouldThrow(); |
934 |
– |
} catch (IllegalArgumentException success) {} |
935 |
– |
} |
936 |
– |
|
937 |
– |
/** |
769 |
|
* drainTo(c, n) empties first min(n, size) elements of queue into c |
770 |
|
*/ |
771 |
|
public void testDrainToN() { |
774 |
|
ArrayList l = new ArrayList(); |
775 |
|
q.drainTo(l, i); |
776 |
|
int k = (i < SIZE) ? i : SIZE; |
777 |
< |
assertEquals(q.size(), SIZE-k); |
778 |
< |
assertEquals(l.size(), k); |
777 |
> |
assertEquals(SIZE-k, q.size()); |
778 |
> |
assertEquals(k, l.size()); |
779 |
|
} |
780 |
|
} |
781 |
|
|
782 |
+ |
/** |
783 |
+ |
* remove(null), contains(null) always return false |
784 |
+ |
*/ |
785 |
+ |
public void testNeverContainsNull() { |
786 |
+ |
Collection<?> q = populatedQueue(SIZE); |
787 |
+ |
assertFalse(q.contains(null)); |
788 |
+ |
assertFalse(q.remove(null)); |
789 |
+ |
} |
790 |
|
} |