1 |
|
/* |
2 |
< |
* Written by members of JCP JSR-166 Expert Group and released to the |
3 |
< |
* public domain. Use, modify, and redistribute this code in any way |
4 |
< |
* without acknowledgement. Other contributors include Andrew Wright, |
5 |
< |
* Jeffrey Hayes, Pat Fischer, Mike Judd. |
2 |
> |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
> |
* Expert Group and released to the public domain, as explained at |
4 |
> |
* http://creativecommons.org/licenses/publicdomain |
5 |
> |
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
> |
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
|
import junit.framework.*; |
38 |
|
} |
39 |
|
|
40 |
|
/** |
41 |
< |
* |
41 |
> |
* A new queue has the indicated capacity, or Integer.MAX_VALUE if |
42 |
> |
* none given |
43 |
|
*/ |
44 |
|
public void testConstructor1() { |
45 |
|
assertEquals(SIZE, new LinkedBlockingQueue(SIZE).remainingCapacity()); |
46 |
+ |
assertEquals(Integer.MAX_VALUE, new LinkedBlockingQueue().remainingCapacity()); |
47 |
|
} |
48 |
|
|
49 |
|
/** |
50 |
< |
* |
50 |
> |
* Constructor throws IAE if capacity argument nonpositive |
51 |
|
*/ |
52 |
|
public void testConstructor2() { |
53 |
|
try { |
58 |
|
} |
59 |
|
|
60 |
|
/** |
61 |
< |
* |
61 |
> |
* Initializing from null Collection throws NPE |
62 |
|
*/ |
63 |
|
public void testConstructor3() { |
61 |
– |
|
64 |
|
try { |
65 |
|
LinkedBlockingQueue q = new LinkedBlockingQueue(null); |
66 |
|
shouldThrow(); |
69 |
|
} |
70 |
|
|
71 |
|
/** |
72 |
< |
* |
72 |
> |
* Initializing from Collection of null elements throws NPE |
73 |
|
*/ |
74 |
|
public void testConstructor4() { |
75 |
|
try { |
81 |
|
} |
82 |
|
|
83 |
|
/** |
84 |
< |
* |
84 |
> |
* Initializing from Collection with some null elements throws NPE |
85 |
|
*/ |
86 |
|
public void testConstructor5() { |
87 |
|
try { |
95 |
|
} |
96 |
|
|
97 |
|
/** |
98 |
< |
* |
98 |
> |
* Queue contains all elements of collection used to initialize |
99 |
|
*/ |
100 |
|
public void testConstructor6() { |
101 |
|
try { |
110 |
|
} |
111 |
|
|
112 |
|
/** |
113 |
< |
* |
113 |
> |
* Queue transitions from empty to full when elements added |
114 |
|
*/ |
115 |
|
public void testEmptyFull() { |
116 |
|
LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
125 |
|
} |
126 |
|
|
127 |
|
/** |
128 |
< |
* |
128 |
> |
* remainingCapacity decreases on add, increases on remove |
129 |
|
*/ |
130 |
|
public void testRemainingCapacity() { |
131 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
142 |
|
} |
143 |
|
|
144 |
|
/** |
145 |
< |
* |
145 |
> |
* offer(null) throws NPE |
146 |
|
*/ |
147 |
|
public void testOfferNull() { |
148 |
|
try { |
153 |
|
} |
154 |
|
|
155 |
|
/** |
156 |
< |
* |
156 |
> |
* add(null) throws NPE |
157 |
> |
*/ |
158 |
> |
public void testAddNull() { |
159 |
> |
try { |
160 |
> |
LinkedBlockingQueue q = new LinkedBlockingQueue(1); |
161 |
> |
q.add(null); |
162 |
> |
shouldThrow(); |
163 |
> |
} catch (NullPointerException success) { } |
164 |
> |
} |
165 |
> |
|
166 |
> |
/** |
167 |
> |
* Offer succeeds if not full; fails if full |
168 |
|
*/ |
169 |
|
public void testOffer() { |
170 |
|
LinkedBlockingQueue q = new LinkedBlockingQueue(1); |
173 |
|
} |
174 |
|
|
175 |
|
/** |
176 |
< |
* |
176 |
> |
* add succeeds if not full; throws ISE if full |
177 |
|
*/ |
178 |
|
public void testAdd() { |
179 |
|
try { |
188 |
|
} |
189 |
|
|
190 |
|
/** |
191 |
< |
* |
191 |
> |
* addAll(null) throws NPE |
192 |
|
*/ |
193 |
|
public void testAddAll1() { |
194 |
|
try { |
198 |
|
} |
199 |
|
catch (NullPointerException success) {} |
200 |
|
} |
201 |
+ |
|
202 |
|
/** |
203 |
< |
* |
203 |
> |
* addAll(this) throws IAE |
204 |
> |
*/ |
205 |
> |
public void testAddAllSelf() { |
206 |
> |
try { |
207 |
> |
LinkedBlockingQueue q = populatedQueue(SIZE); |
208 |
> |
q.addAll(q); |
209 |
> |
shouldThrow(); |
210 |
> |
} |
211 |
> |
catch (IllegalArgumentException success) {} |
212 |
> |
} |
213 |
> |
|
214 |
> |
/** |
215 |
> |
* addAll of a collection with null elements throws NPE |
216 |
|
*/ |
217 |
|
public void testAddAll2() { |
218 |
|
try { |
224 |
|
catch (NullPointerException success) {} |
225 |
|
} |
226 |
|
/** |
227 |
< |
* |
227 |
> |
* addAll of a collection with any null elements throws NPE after |
228 |
> |
* possibly adding some elements |
229 |
|
*/ |
230 |
|
public void testAddAll3() { |
231 |
|
try { |
239 |
|
catch (NullPointerException success) {} |
240 |
|
} |
241 |
|
/** |
242 |
< |
* |
242 |
> |
* addAll throws ISE if not enough room |
243 |
|
*/ |
244 |
|
public void testAddAll4() { |
245 |
|
try { |
253 |
|
catch (IllegalStateException success) {} |
254 |
|
} |
255 |
|
/** |
256 |
< |
* |
256 |
> |
* Queue contains all elements, in traversal order, of successful addAll |
257 |
|
*/ |
258 |
|
public void testAddAll5() { |
259 |
|
try { |
271 |
|
} |
272 |
|
|
273 |
|
/** |
274 |
< |
* |
274 |
> |
* put(null) throws NPE |
275 |
|
*/ |
276 |
|
public void testPutNull() { |
277 |
|
try { |
287 |
|
} |
288 |
|
|
289 |
|
/** |
290 |
< |
* |
290 |
> |
* all elements successfully put are contained |
291 |
|
*/ |
292 |
|
public void testPut() { |
293 |
|
try { |
305 |
|
} |
306 |
|
|
307 |
|
/** |
308 |
< |
* |
308 |
> |
* put blocks interruptibly if full |
309 |
|
*/ |
310 |
|
public void testBlockingPut() { |
311 |
|
Thread t = new Thread(new Runnable() { |
335 |
|
} |
336 |
|
|
337 |
|
/** |
338 |
< |
* |
338 |
> |
* put blocks waiting for take when full |
339 |
|
*/ |
340 |
|
public void testPutWithTake() { |
341 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
369 |
|
} |
370 |
|
|
371 |
|
/** |
372 |
< |
* |
372 |
> |
* timed offer times out if full and elements not taken |
373 |
|
*/ |
374 |
|
public void testTimedOffer() { |
375 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
396 |
|
} |
397 |
|
|
398 |
|
/** |
399 |
< |
* |
399 |
> |
* take retrieves elements in FIFO order |
400 |
|
*/ |
401 |
|
public void testTake() { |
402 |
|
try { |
410 |
|
} |
411 |
|
|
412 |
|
/** |
413 |
< |
* |
413 |
> |
* take blocks interruptibly when empty |
414 |
|
*/ |
415 |
|
public void testTakeFromEmpty() { |
416 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
433 |
|
} |
434 |
|
|
435 |
|
/** |
436 |
< |
* |
436 |
> |
* Take removes existing elements until empty, then blocks interruptibly |
437 |
|
*/ |
438 |
|
public void testBlockingTake() { |
439 |
|
Thread t = new Thread(new Runnable() { |
461 |
|
|
462 |
|
|
463 |
|
/** |
464 |
< |
* |
464 |
> |
* poll succeeds unless empty |
465 |
|
*/ |
466 |
|
public void testPoll() { |
467 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
472 |
|
} |
473 |
|
|
474 |
|
/** |
475 |
< |
* |
475 |
> |
* timed pool with zero timeout succeeds when non-empty, else times out |
476 |
|
*/ |
477 |
|
public void testTimedPoll0() { |
478 |
|
try { |
487 |
|
} |
488 |
|
|
489 |
|
/** |
490 |
< |
* |
490 |
> |
* timed pool with nonzero timeout succeeds when non-empty, else times out |
491 |
|
*/ |
492 |
|
public void testTimedPoll() { |
493 |
|
try { |
502 |
|
} |
503 |
|
|
504 |
|
/** |
505 |
< |
* |
505 |
> |
* Interrupted timed poll throws InterruptedException instead of |
506 |
> |
* returning timeout status |
507 |
|
*/ |
508 |
|
public void testInterruptedTimedPoll() { |
509 |
|
Thread t = new Thread(new Runnable() { |
529 |
|
} |
530 |
|
|
531 |
|
/** |
532 |
< |
* |
532 |
> |
* timed poll before a delayed offer fails; after offer succeeds; |
533 |
> |
* on interruption throws |
534 |
|
*/ |
535 |
|
public void testTimedPollWithOffer() { |
536 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
555 |
|
} |
556 |
|
} |
557 |
|
|
529 |
– |
|
558 |
|
/** |
559 |
< |
* |
559 |
> |
* peek returns next element, or null if empty |
560 |
|
*/ |
561 |
|
public void testPeek() { |
562 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
570 |
|
} |
571 |
|
|
572 |
|
/** |
573 |
< |
* |
573 |
> |
* element returns next element, or throws NSEE if empty |
574 |
|
*/ |
575 |
|
public void testElement() { |
576 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
586 |
|
} |
587 |
|
|
588 |
|
/** |
589 |
< |
* |
589 |
> |
* remove removes next element, or throws NSEE if empty |
590 |
|
*/ |
591 |
|
public void testRemove() { |
592 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
601 |
|
} |
602 |
|
|
603 |
|
/** |
604 |
< |
* |
604 |
> |
* remove(x) removes x and returns true if present |
605 |
|
*/ |
606 |
|
public void testRemoveElement() { |
607 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
616 |
|
} |
617 |
|
|
618 |
|
/** |
619 |
< |
* |
619 |
> |
* contains(x) reports true when elements added but not yet removed |
620 |
|
*/ |
621 |
|
public void testContains() { |
622 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
628 |
|
} |
629 |
|
|
630 |
|
/** |
631 |
< |
* |
631 |
> |
* clear removes all elements |
632 |
|
*/ |
633 |
|
public void testClear() { |
634 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
638 |
|
assertEquals(SIZE, q.remainingCapacity()); |
639 |
|
q.add(one); |
640 |
|
assertFalse(q.isEmpty()); |
641 |
+ |
assertTrue(q.contains(one)); |
642 |
|
q.clear(); |
643 |
|
assertTrue(q.isEmpty()); |
644 |
|
} |
645 |
|
|
646 |
|
/** |
647 |
< |
* |
647 |
> |
* containsAll(c) is true when c contains a subset of elements |
648 |
|
*/ |
649 |
|
public void testContainsAll() { |
650 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
658 |
|
} |
659 |
|
|
660 |
|
/** |
661 |
< |
* |
661 |
> |
* retainAll(c) retains only those elements of c and reports true if changed |
662 |
|
*/ |
663 |
|
public void testRetainAll() { |
664 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
677 |
|
} |
678 |
|
|
679 |
|
/** |
680 |
< |
* |
680 |
> |
* removeAll(c) removes only those elements of c and reports true if changed |
681 |
|
*/ |
682 |
|
public void testRemoveAll() { |
683 |
|
for (int i = 1; i < SIZE; ++i) { |
692 |
|
} |
693 |
|
} |
694 |
|
|
666 |
– |
|
695 |
|
/** |
696 |
< |
* |
696 |
> |
* toArray contains all elements |
697 |
|
*/ |
698 |
|
public void testToArray() { |
699 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
707 |
|
} |
708 |
|
|
709 |
|
/** |
710 |
< |
* |
710 |
> |
* toArray(a) contains all elements |
711 |
|
*/ |
712 |
|
public void testToArray2() { |
713 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
720 |
|
unexpectedException(); |
721 |
|
} |
722 |
|
} |
723 |
+ |
|
724 |
+ |
/** |
725 |
+ |
* toArray(null) throws NPE |
726 |
+ |
*/ |
727 |
+ |
public void testToArray_BadArg() { |
728 |
+ |
try { |
729 |
+ |
LinkedBlockingQueue q = populatedQueue(SIZE); |
730 |
+ |
Object o[] = q.toArray(null); |
731 |
+ |
shouldThrow(); |
732 |
+ |
} catch(NullPointerException success){} |
733 |
+ |
} |
734 |
+ |
|
735 |
+ |
/** |
736 |
+ |
* toArray with incompatible array type throws CCE |
737 |
+ |
*/ |
738 |
+ |
public void testToArray1_BadArg() { |
739 |
+ |
try { |
740 |
+ |
LinkedBlockingQueue q = populatedQueue(SIZE); |
741 |
+ |
Object o[] = q.toArray(new String[10] ); |
742 |
+ |
shouldThrow(); |
743 |
+ |
} catch(ArrayStoreException success){} |
744 |
+ |
} |
745 |
+ |
|
746 |
|
|
747 |
|
/** |
748 |
< |
* |
748 |
> |
* iterator iterates through all elements |
749 |
|
*/ |
750 |
|
public void testIterator() { |
751 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
760 |
|
} |
761 |
|
|
762 |
|
/** |
763 |
< |
* |
763 |
> |
* iterator.remove removes current element |
764 |
|
*/ |
765 |
< |
public void testIteratorOrdering() { |
715 |
< |
|
765 |
> |
public void testIteratorRemove () { |
766 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(3); |
767 |
+ |
q.add(two); |
768 |
+ |
q.add(one); |
769 |
+ |
q.add(three); |
770 |
|
|
771 |
+ |
Iterator it = q.iterator(); |
772 |
+ |
it.next(); |
773 |
+ |
it.remove(); |
774 |
+ |
|
775 |
+ |
it = q.iterator(); |
776 |
+ |
assertEquals(it.next(), one); |
777 |
+ |
assertEquals(it.next(), three); |
778 |
+ |
assertFalse(it.hasNext()); |
779 |
+ |
} |
780 |
+ |
|
781 |
+ |
|
782 |
+ |
/** |
783 |
+ |
* iterator ordering is FIFO |
784 |
+ |
*/ |
785 |
+ |
public void testIteratorOrdering() { |
786 |
+ |
final LinkedBlockingQueue q = new LinkedBlockingQueue(3); |
787 |
|
q.add(one); |
788 |
|
q.add(two); |
789 |
|
q.add(three); |
721 |
– |
|
790 |
|
assertEquals(0, q.remainingCapacity()); |
723 |
– |
|
791 |
|
int k = 0; |
792 |
|
for (Iterator it = q.iterator(); it.hasNext();) { |
793 |
|
int i = ((Integer)(it.next())).intValue(); |
794 |
|
assertEquals(++k, i); |
795 |
|
} |
729 |
– |
|
796 |
|
assertEquals(3, k); |
797 |
|
} |
798 |
|
|
799 |
|
/** |
800 |
< |
* |
800 |
> |
* Modifications do not cause iterators to fail |
801 |
|
*/ |
802 |
|
public void testWeaklyConsistentIteration () { |
737 |
– |
|
803 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(3); |
739 |
– |
|
804 |
|
q.add(one); |
805 |
|
q.add(two); |
806 |
|
q.add(three); |
743 |
– |
|
807 |
|
try { |
808 |
|
for (Iterator it = q.iterator(); it.hasNext();) { |
809 |
|
q.remove(); |
813 |
|
catch (ConcurrentModificationException e) { |
814 |
|
unexpectedException(); |
815 |
|
} |
753 |
– |
|
816 |
|
assertEquals(0, q.size()); |
817 |
|
} |
818 |
|
|
819 |
|
|
820 |
|
/** |
821 |
< |
* |
821 |
> |
* toString contains toStrings of elements |
822 |
|
*/ |
823 |
|
public void testToString() { |
824 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
830 |
|
|
831 |
|
|
832 |
|
/** |
833 |
< |
* |
833 |
> |
* offer transfers elements across Executor tasks |
834 |
|
*/ |
835 |
|
public void testOfferInExecutor() { |
774 |
– |
|
836 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
776 |
– |
|
837 |
|
q.add(one); |
838 |
|
q.add(two); |
779 |
– |
|
839 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
781 |
– |
|
840 |
|
executor.execute(new Runnable() { |
841 |
|
public void run() { |
842 |
|
threadAssertFalse(q.offer(three)); |
863 |
|
}); |
864 |
|
|
865 |
|
joinPool(executor); |
808 |
– |
|
866 |
|
} |
867 |
|
|
868 |
|
/** |
869 |
< |
* |
869 |
> |
* poll retrieves elements across Executor threads |
870 |
|
*/ |
871 |
|
public void testPollInExecutor() { |
815 |
– |
|
872 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
817 |
– |
|
873 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
819 |
– |
|
874 |
|
executor.execute(new Runnable() { |
875 |
|
public void run() { |
876 |
|
threadAssertNull(q.poll()); |
900 |
|
} |
901 |
|
|
902 |
|
/** |
903 |
< |
* |
903 |
> |
* A deserialized serialized queue has same elements in same order |
904 |
|
*/ |
905 |
|
public void testSerialization() { |
906 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
922 |
|
} |
923 |
|
} |
924 |
|
|
925 |
+ |
/** |
926 |
+ |
* drainTo(null) throws NPE |
927 |
+ |
*/ |
928 |
+ |
public void testDrainToNull() { |
929 |
+ |
LinkedBlockingQueue q = populatedQueue(SIZE); |
930 |
+ |
try { |
931 |
+ |
q.drainTo(null); |
932 |
+ |
shouldThrow(); |
933 |
+ |
} catch(NullPointerException success) { |
934 |
+ |
} |
935 |
+ |
} |
936 |
+ |
|
937 |
+ |
/** |
938 |
+ |
* drainTo(this) throws IAE |
939 |
+ |
*/ |
940 |
+ |
public void testDrainToSelf() { |
941 |
+ |
LinkedBlockingQueue q = populatedQueue(SIZE); |
942 |
+ |
try { |
943 |
+ |
q.drainTo(q); |
944 |
+ |
shouldThrow(); |
945 |
+ |
} catch(IllegalArgumentException success) { |
946 |
+ |
} |
947 |
+ |
} |
948 |
+ |
|
949 |
+ |
/** |
950 |
+ |
* drainTo(c) empties queue into another collection c |
951 |
+ |
*/ |
952 |
+ |
public void testDrainTo() { |
953 |
+ |
LinkedBlockingQueue q = populatedQueue(SIZE); |
954 |
+ |
ArrayList l = new ArrayList(); |
955 |
+ |
q.drainTo(l); |
956 |
+ |
assertEquals(q.size(), 0); |
957 |
+ |
assertEquals(l.size(), SIZE); |
958 |
+ |
for (int i = 0; i < SIZE; ++i) |
959 |
+ |
assertEquals(l.get(i), new Integer(i)); |
960 |
+ |
q.add(zero); |
961 |
+ |
q.add(one); |
962 |
+ |
assertFalse(q.isEmpty()); |
963 |
+ |
assertTrue(q.contains(zero)); |
964 |
+ |
assertTrue(q.contains(one)); |
965 |
+ |
l.clear(); |
966 |
+ |
q.drainTo(l); |
967 |
+ |
assertEquals(q.size(), 0); |
968 |
+ |
assertEquals(l.size(), 2); |
969 |
+ |
for (int i = 0; i < 2; ++i) |
970 |
+ |
assertEquals(l.get(i), new Integer(i)); |
971 |
+ |
} |
972 |
+ |
|
973 |
+ |
/** |
974 |
+ |
* drainTo empties full queue, unblocking a waiting put. |
975 |
+ |
*/ |
976 |
+ |
public void testDrainToWithActivePut() { |
977 |
+ |
final LinkedBlockingQueue q = populatedQueue(SIZE); |
978 |
+ |
Thread t = new Thread(new Runnable() { |
979 |
+ |
public void run() { |
980 |
+ |
try { |
981 |
+ |
q.put(new Integer(SIZE+1)); |
982 |
+ |
} catch (InterruptedException ie){ |
983 |
+ |
threadUnexpectedException(); |
984 |
+ |
} |
985 |
+ |
} |
986 |
+ |
}); |
987 |
+ |
try { |
988 |
+ |
t.start(); |
989 |
+ |
ArrayList l = new ArrayList(); |
990 |
+ |
q.drainTo(l); |
991 |
+ |
assertTrue(l.size() >= SIZE); |
992 |
+ |
for (int i = 0; i < SIZE; ++i) |
993 |
+ |
assertEquals(l.get(i), new Integer(i)); |
994 |
+ |
t.join(); |
995 |
+ |
assertTrue(q.size() + l.size() >= SIZE); |
996 |
+ |
} catch(Exception e){ |
997 |
+ |
unexpectedException(); |
998 |
+ |
} |
999 |
+ |
} |
1000 |
+ |
|
1001 |
+ |
/** |
1002 |
+ |
* drainTo(null, n) throws NPE |
1003 |
+ |
*/ |
1004 |
+ |
public void testDrainToNullN() { |
1005 |
+ |
LinkedBlockingQueue q = populatedQueue(SIZE); |
1006 |
+ |
try { |
1007 |
+ |
q.drainTo(null, 0); |
1008 |
+ |
shouldThrow(); |
1009 |
+ |
} catch(NullPointerException success) { |
1010 |
+ |
} |
1011 |
+ |
} |
1012 |
+ |
|
1013 |
+ |
/** |
1014 |
+ |
* drainTo(this, n) throws IAE |
1015 |
+ |
*/ |
1016 |
+ |
public void testDrainToSelfN() { |
1017 |
+ |
LinkedBlockingQueue q = populatedQueue(SIZE); |
1018 |
+ |
try { |
1019 |
+ |
q.drainTo(q, 0); |
1020 |
+ |
shouldThrow(); |
1021 |
+ |
} catch(IllegalArgumentException success) { |
1022 |
+ |
} |
1023 |
+ |
} |
1024 |
+ |
|
1025 |
+ |
/** |
1026 |
+ |
* drainTo(c, n) empties first max {n, size} elements of queue into c |
1027 |
+ |
*/ |
1028 |
+ |
public void testDrainToN() { |
1029 |
+ |
LinkedBlockingQueue q = new LinkedBlockingQueue(); |
1030 |
+ |
for (int i = 0; i < SIZE + 2; ++i) { |
1031 |
+ |
for(int j = 0; j < SIZE; j++) |
1032 |
+ |
assertTrue(q.offer(new Integer(j))); |
1033 |
+ |
ArrayList l = new ArrayList(); |
1034 |
+ |
q.drainTo(l, i); |
1035 |
+ |
int k = (i < SIZE)? i : SIZE; |
1036 |
+ |
assertEquals(l.size(), k); |
1037 |
+ |
assertEquals(q.size(), SIZE-k); |
1038 |
+ |
for (int j = 0; j < k; ++j) |
1039 |
+ |
assertEquals(l.get(j), new Integer(j)); |
1040 |
+ |
while (q.poll() != null) ; |
1041 |
+ |
} |
1042 |
+ |
} |
1043 |
+ |
|
1044 |
|
} |