14 |
|
|
15 |
|
public class LinkedBlockingQueueTest extends JSR166TestCase { |
16 |
|
|
17 |
+ |
public static class Unbounded extends BlockingQueueTest { |
18 |
+ |
protected BlockingQueue emptyCollection() { |
19 |
+ |
return new LinkedBlockingQueue(); |
20 |
+ |
} |
21 |
+ |
} |
22 |
+ |
|
23 |
+ |
public static class Bounded extends BlockingQueueTest { |
24 |
+ |
protected BlockingQueue emptyCollection() { |
25 |
+ |
return new LinkedBlockingQueue(20); |
26 |
+ |
} |
27 |
+ |
} |
28 |
+ |
|
29 |
|
public static void main(String[] args) { |
30 |
< |
junit.textui.TestRunner.run (suite()); |
30 |
> |
junit.textui.TestRunner.run(suite()); |
31 |
|
} |
32 |
|
|
33 |
|
public static Test suite() { |
34 |
< |
return new TestSuite(LinkedBlockingQueueTest.class); |
34 |
> |
return newTestSuite(LinkedBlockingQueueTest.class, |
35 |
> |
new Unbounded().testSuite(), |
36 |
> |
new Bounded().testSuite()); |
37 |
|
} |
38 |
|
|
39 |
|
|
41 |
|
* Create a queue of given size containing consecutive |
42 |
|
* Integers 0 ... n. |
43 |
|
*/ |
44 |
< |
private LinkedBlockingQueue populatedQueue(int n) { |
45 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(n); |
44 |
> |
private LinkedBlockingQueue<Integer> populatedQueue(int n) { |
45 |
> |
LinkedBlockingQueue<Integer> q = |
46 |
> |
new LinkedBlockingQueue<Integer>(n); |
47 |
|
assertTrue(q.isEmpty()); |
48 |
|
for (int i = 0; i < n; i++) |
49 |
|
assertTrue(q.offer(new Integer(i))); |
229 |
|
shouldThrow(); |
230 |
|
} catch (NullPointerException success) {} |
231 |
|
} |
232 |
+ |
|
233 |
|
/** |
234 |
|
* addAll of a collection with any null elements throws NPE after |
235 |
|
* possibly adding some elements |
244 |
|
shouldThrow(); |
245 |
|
} catch (NullPointerException success) {} |
246 |
|
} |
247 |
+ |
|
248 |
|
/** |
249 |
|
* addAll throws ISE if not enough room |
250 |
|
*/ |
258 |
|
shouldThrow(); |
259 |
|
} catch (IllegalStateException success) {} |
260 |
|
} |
261 |
+ |
|
262 |
|
/** |
263 |
|
* Queue contains all elements, in traversal order, of successful addAll |
264 |
|
*/ |
382 |
|
} |
383 |
|
|
384 |
|
/** |
367 |
– |
* take blocks interruptibly when empty |
368 |
– |
*/ |
369 |
– |
public void testTakeFromEmpty() throws InterruptedException { |
370 |
– |
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
371 |
– |
Thread t = new ThreadShouldThrow(InterruptedException.class) { |
372 |
– |
public void realRun() throws InterruptedException { |
373 |
– |
q.take(); |
374 |
– |
}}; |
375 |
– |
|
376 |
– |
t.start(); |
377 |
– |
Thread.sleep(SHORT_DELAY_MS); |
378 |
– |
t.interrupt(); |
379 |
– |
t.join(); |
380 |
– |
} |
381 |
– |
|
382 |
– |
/** |
385 |
|
* Take removes existing elements until empty, then blocks interruptibly |
386 |
|
*/ |
387 |
|
public void testBlockingTake() throws InterruptedException { |
415 |
|
} |
416 |
|
|
417 |
|
/** |
418 |
< |
* timed pool with zero timeout succeeds when non-empty, else times out |
418 |
> |
* timed poll with zero timeout succeeds when non-empty, else times out |
419 |
|
*/ |
420 |
|
public void testTimedPoll0() throws InterruptedException { |
421 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
426 |
|
} |
427 |
|
|
428 |
|
/** |
429 |
< |
* timed pool with nonzero timeout succeeds when non-empty, else times out |
429 |
> |
* timed poll with nonzero timeout succeeds when non-empty, else times out |
430 |
|
*/ |
431 |
|
public void testTimedPoll() throws InterruptedException { |
432 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
460 |
|
} |
461 |
|
|
462 |
|
/** |
461 |
– |
* timed poll before a delayed offer fails; after offer succeeds; |
462 |
– |
* on interruption throws |
463 |
– |
*/ |
464 |
– |
public void testTimedPollWithOffer() throws InterruptedException { |
465 |
– |
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
466 |
– |
Thread t = new Thread(new CheckedRunnable() { |
467 |
– |
public void realRun() throws InterruptedException { |
468 |
– |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
469 |
– |
assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
470 |
– |
try { |
471 |
– |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
472 |
– |
shouldThrow(); |
473 |
– |
} catch (InterruptedException success) {} |
474 |
– |
}}); |
475 |
– |
|
476 |
– |
t.start(); |
477 |
– |
Thread.sleep(SMALL_DELAY_MS); |
478 |
– |
assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS)); |
479 |
– |
t.interrupt(); |
480 |
– |
t.join(); |
481 |
– |
} |
482 |
– |
|
483 |
– |
/** |
463 |
|
* peek returns next element, or null if empty |
464 |
|
*/ |
465 |
|
public void testPeek() { |
508 |
|
public void testRemoveElement() { |
509 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
510 |
|
for (int i = 1; i < SIZE; i+=2) { |
511 |
< |
assertTrue(q.remove(new Integer(i))); |
511 |
> |
assertTrue(q.contains(i)); |
512 |
> |
assertTrue(q.remove(i)); |
513 |
> |
assertFalse(q.contains(i)); |
514 |
> |
assertTrue(q.contains(i-1)); |
515 |
|
} |
516 |
|
for (int i = 0; i < SIZE; i+=2) { |
517 |
< |
assertTrue(q.remove(new Integer(i))); |
518 |
< |
assertFalse(q.remove(new Integer(i+1))); |
517 |
> |
assertTrue(q.contains(i)); |
518 |
> |
assertTrue(q.remove(i)); |
519 |
> |
assertFalse(q.contains(i)); |
520 |
> |
assertFalse(q.remove(i+1)); |
521 |
> |
assertFalse(q.contains(i+1)); |
522 |
|
} |
523 |
|
assertTrue(q.isEmpty()); |
524 |
|
} |
614 |
|
} |
615 |
|
|
616 |
|
/** |
617 |
< |
* toArray contains all elements |
617 |
> |
* toArray contains all elements in FIFO order |
618 |
|
*/ |
619 |
< |
public void testToArray() throws InterruptedException { |
619 |
> |
public void testToArray() { |
620 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
621 |
|
Object[] o = q.toArray(); |
622 |
|
for (int i = 0; i < o.length; i++) |
623 |
< |
assertEquals(o[i], q.take()); |
623 |
> |
assertSame(o[i], q.poll()); |
624 |
|
} |
625 |
|
|
626 |
|
/** |
627 |
< |
* toArray(a) contains all elements |
627 |
> |
* toArray(a) contains all elements in FIFO order |
628 |
|
*/ |
629 |
|
public void testToArray2() throws InterruptedException { |
630 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
630 |
> |
LinkedBlockingQueue<Integer> q = populatedQueue(SIZE); |
631 |
|
Integer[] ints = new Integer[SIZE]; |
632 |
< |
ints = (Integer[])q.toArray(ints); |
632 |
> |
Integer[] array = q.toArray(ints); |
633 |
> |
assertSame(ints, array); |
634 |
|
for (int i = 0; i < ints.length; i++) |
635 |
< |
assertEquals(ints[i], q.take()); |
635 |
> |
assertSame(ints[i], q.poll()); |
636 |
|
} |
637 |
|
|
638 |
|
/** |
639 |
< |
* toArray(null) throws NPE |
639 |
> |
* toArray(null) throws NullPointerException |
640 |
|
*/ |
641 |
< |
public void testToArray_BadArg() { |
641 |
> |
public void testToArray_NullArg() { |
642 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
643 |
|
try { |
644 |
< |
Object o[] = q.toArray(null); |
644 |
> |
q.toArray(null); |
645 |
|
shouldThrow(); |
646 |
|
} catch (NullPointerException success) {} |
647 |
|
} |
648 |
|
|
649 |
|
/** |
650 |
< |
* toArray with incompatible array type throws CCE |
650 |
> |
* toArray(incompatible array type) throws ArrayStoreException |
651 |
|
*/ |
652 |
|
public void testToArray1_BadArg() { |
653 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
654 |
|
try { |
655 |
< |
Object o[] = q.toArray(new String[10]); |
655 |
> |
q.toArray(new String[10]); |
656 |
|
shouldThrow(); |
657 |
|
} catch (ArrayStoreException success) {} |
658 |
|
} |
672 |
|
/** |
673 |
|
* iterator.remove removes current element |
674 |
|
*/ |
675 |
< |
public void testIteratorRemove () { |
675 |
> |
public void testIteratorRemove() { |
676 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(3); |
677 |
|
q.add(two); |
678 |
|
q.add(one); |
708 |
|
/** |
709 |
|
* Modifications do not cause iterators to fail |
710 |
|
*/ |
711 |
< |
public void testWeaklyConsistentIteration () { |
711 |
> |
public void testWeaklyConsistentIteration() { |
712 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(3); |
713 |
|
q.add(one); |
714 |
|
q.add(two); |
887 |
|
} |
888 |
|
|
889 |
|
/** |
890 |
< |
* drainTo(c, n) empties first max {n, size} elements of queue into c |
890 |
> |
* drainTo(c, n) empties first min(n, size) elements of queue into c |
891 |
|
*/ |
892 |
|
public void testDrainToN() { |
893 |
|
LinkedBlockingQueue q = new LinkedBlockingQueue(); |
896 |
|
assertTrue(q.offer(new Integer(j))); |
897 |
|
ArrayList l = new ArrayList(); |
898 |
|
q.drainTo(l, i); |
899 |
< |
int k = (i < SIZE)? i : SIZE; |
899 |
> |
int k = (i < SIZE) ? i : SIZE; |
900 |
|
assertEquals(l.size(), k); |
901 |
|
assertEquals(q.size(), SIZE-k); |
902 |
|
for (int j = 0; j < k; ++j) |