ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/test/tck/LinkedTransferQueueTest.java
Revision: 1.41
Committed: Thu Nov 18 18:49:44 2010 UTC (13 years, 6 months ago) by jsr166
Branch: MAIN
Changes since 1.40: +2 -2 lines
Log Message:
testTryTransfer8

File Contents

# Content
1 /*
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 John Vint
6 */
7
8 import java.io.BufferedInputStream;
9 import java.io.BufferedOutputStream;
10 import java.io.ByteArrayInputStream;
11 import java.io.ByteArrayOutputStream;
12 import java.io.ObjectInputStream;
13 import java.io.ObjectOutputStream;
14 import java.util.ArrayList;
15 import java.util.Arrays;
16 import java.util.Iterator;
17 import java.util.List;
18 import java.util.NoSuchElementException;
19 import java.util.concurrent.*;
20 import static java.util.concurrent.TimeUnit.MILLISECONDS;
21 import static java.util.concurrent.TimeUnit.NANOSECONDS;
22 import junit.framework.Test;
23 import junit.framework.TestSuite;
24
25 @SuppressWarnings({"unchecked", "rawtypes"})
26 public class LinkedTransferQueueTest extends JSR166TestCase {
27
28 public static class Generic extends BlockingQueueTest {
29 protected BlockingQueue emptyCollection() {
30 return new LinkedTransferQueue();
31 }
32 }
33
34 public static void main(String[] args) {
35 junit.textui.TestRunner.run(suite());
36 }
37
38 public static Test suite() {
39 return newTestSuite(LinkedTransferQueueTest.class,
40 new Generic().testSuite());
41 }
42
43 void checkEmpty(BlockingQueue q) {
44 try {
45 assertTrue(q.isEmpty());
46 assertEquals(0, q.size());
47 assertNull(q.peek());
48 assertNull(q.poll());
49 assertNull(q.poll(0, MILLISECONDS));
50 assertEquals(q.toString(), "[]");
51 assertTrue(Arrays.equals(q.toArray(), new Object[0]));
52 assertFalse(q.iterator().hasNext());
53 try {
54 q.element();
55 shouldThrow();
56 } catch (NoSuchElementException success) {}
57 try {
58 q.iterator().next();
59 shouldThrow();
60 } catch (NoSuchElementException success) {}
61 try {
62 q.remove();
63 shouldThrow();
64 } catch (NoSuchElementException success) {}
65 } catch (InterruptedException ie) {
66 threadUnexpectedException(ie);
67 }
68 }
69
70 /**
71 * Constructor builds new queue with size being zero and empty
72 * being true
73 */
74 public void testConstructor1() {
75 assertEquals(0, new LinkedTransferQueue().size());
76 assertTrue(new LinkedTransferQueue().isEmpty());
77 }
78
79 /**
80 * Initializing constructor with null collection throws
81 * NullPointerException
82 */
83 public void testConstructor2() {
84 try {
85 new LinkedTransferQueue(null);
86 shouldThrow();
87 } catch (NullPointerException success) {}
88 }
89
90 /**
91 * Initializing from Collection of null elements throws
92 * NullPointerException
93 */
94 public void testConstructor3() {
95 try {
96 Integer[] ints = new Integer[SIZE];
97 new LinkedTransferQueue(Arrays.asList(ints));
98 shouldThrow();
99 } catch (NullPointerException success) {}
100 }
101
102 /**
103 * Initializing constructor with a collection containing some null elements
104 * throws NullPointerException
105 */
106 public void testConstructor4() {
107 try {
108 Integer[] ints = new Integer[SIZE];
109 for (int i = 0; i < SIZE - 1; ++i) {
110 ints[i] = i;
111 }
112 new LinkedTransferQueue(Arrays.asList(ints));
113 shouldThrow();
114 } catch (NullPointerException success) {}
115 }
116
117 /**
118 * Queue contains all elements of the collection it is initialized by
119 */
120 public void testConstructor5() {
121 Integer[] ints = new Integer[SIZE];
122 for (int i = 0; i < SIZE; ++i) {
123 ints[i] = i;
124 }
125 List intList = Arrays.asList(ints);
126 LinkedTransferQueue q
127 = new LinkedTransferQueue(intList);
128 assertEquals(q.size(), intList.size());
129 assertEquals(q.toString(), intList.toString());
130 assertTrue(Arrays.equals(q.toArray(),
131 intList.toArray()));
132 assertTrue(Arrays.equals(q.toArray(new Object[0]),
133 intList.toArray(new Object[0])));
134 assertTrue(Arrays.equals(q.toArray(new Object[SIZE]),
135 intList.toArray(new Object[SIZE])));
136 for (int i = 0; i < SIZE; ++i) {
137 assertEquals(ints[i], q.poll());
138 }
139 }
140
141 /**
142 * remainingCapacity() always returns Integer.MAX_VALUE
143 */
144 public void testRemainingCapacity() {
145 LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
146 for (int i = 0; i < SIZE; ++i) {
147 assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
148 assertEquals(SIZE - i, q.size());
149 q.remove();
150 }
151 for (int i = 0; i < SIZE; ++i) {
152 assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
153 assertEquals(i, q.size());
154 q.add(i);
155 }
156 }
157
158 /**
159 * offer(null) throws NullPointerException
160 */
161 public void testOfferNull() {
162 try {
163 LinkedTransferQueue q = new LinkedTransferQueue();
164 q.offer(null);
165 shouldThrow();
166 } catch (NullPointerException success) {}
167 }
168
169 /**
170 * add(null) throws NullPointerException
171 */
172 public void testAddNull() {
173 try {
174 LinkedTransferQueue q = new LinkedTransferQueue();
175 q.add(null);
176 shouldThrow();
177 } catch (NullPointerException success) {}
178 }
179
180 /**
181 * addAll(null) throws NullPointerException
182 */
183 public void testAddAll1() {
184 try {
185 LinkedTransferQueue q = new LinkedTransferQueue();
186 q.addAll(null);
187 shouldThrow();
188 } catch (NullPointerException success) {}
189 }
190
191 /**
192 * addAll(this) throws IllegalArgumentException
193 */
194 public void testAddAllSelf() {
195 try {
196 LinkedTransferQueue q = populatedQueue(SIZE);
197 q.addAll(q);
198 shouldThrow();
199 } catch (IllegalArgumentException success) {}
200 }
201
202 /**
203 * addAll of a collection with null elements throws NullPointerException
204 */
205 public void testAddAll2() {
206 try {
207 LinkedTransferQueue q = new LinkedTransferQueue();
208 Integer[] ints = new Integer[SIZE];
209 q.addAll(Arrays.asList(ints));
210 shouldThrow();
211 } catch (NullPointerException success) {}
212 }
213
214 /**
215 * addAll of a collection with any null elements throws
216 * NullPointerException after possibly adding some elements
217 */
218 public void testAddAll3() {
219 try {
220 LinkedTransferQueue q = new LinkedTransferQueue();
221 Integer[] ints = new Integer[SIZE];
222 for (int i = 0; i < SIZE - 1; ++i) {
223 ints[i] = i;
224 }
225 q.addAll(Arrays.asList(ints));
226 shouldThrow();
227 } catch (NullPointerException success) {}
228 }
229
230 /**
231 * Queue contains all elements, in traversal order, of successful addAll
232 */
233 public void testAddAll5() {
234 Integer[] empty = new Integer[0];
235 Integer[] ints = new Integer[SIZE];
236 for (int i = 0; i < SIZE; ++i) {
237 ints[i] = i;
238 }
239 LinkedTransferQueue q = new LinkedTransferQueue();
240 assertFalse(q.addAll(Arrays.asList(empty)));
241 assertTrue(q.addAll(Arrays.asList(ints)));
242 for (int i = 0; i < SIZE; ++i) {
243 assertEquals(ints[i], q.poll());
244 }
245 }
246
247 /**
248 * put(null) throws NullPointerException
249 */
250 public void testPutNull() throws InterruptedException {
251 try {
252 LinkedTransferQueue q = new LinkedTransferQueue();
253 q.put(null);
254 shouldThrow();
255 } catch (NullPointerException success) {}
256 }
257
258 /**
259 * all elements successfully put are contained
260 */
261 public void testPut() {
262 LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
263 for (int i = 0; i < SIZE; ++i) {
264 assertEquals(q.size(), i);
265 q.put(i);
266 assertTrue(q.contains(i));
267 }
268 }
269
270 /**
271 * take retrieves elements in FIFO order
272 */
273 public void testTake() throws InterruptedException {
274 LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
275 for (int i = 0; i < SIZE; ++i) {
276 assertEquals(i, (int) q.take());
277 }
278 }
279
280 /**
281 * take removes existing elements until empty, then blocks interruptibly
282 */
283 public void testBlockingTake() throws InterruptedException {
284 final BlockingQueue<Integer> q = populatedQueue(SIZE);
285 final CountDownLatch aboutToWait = new CountDownLatch(1);
286 Thread t = newStartedThread(new CheckedRunnable() {
287 public void realRun() throws InterruptedException {
288 for (int i = 0; i < SIZE; ++i) {
289 assertEquals(i, (int) q.take());
290 }
291 aboutToWait.countDown();
292 try {
293 q.take();
294 shouldThrow();
295 } catch (InterruptedException success) {}
296 }});
297
298 aboutToWait.await();
299 waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
300 t.interrupt();
301 awaitTermination(t, MEDIUM_DELAY_MS);
302 checkEmpty(q);
303 }
304
305 /**
306 * poll succeeds unless empty
307 */
308 public void testPoll() throws InterruptedException {
309 LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
310 for (int i = 0; i < SIZE; ++i) {
311 assertEquals(i, (int) q.poll());
312 }
313 assertNull(q.poll());
314 checkEmpty(q);
315 }
316
317 /**
318 * timed poll with zero timeout succeeds when non-empty, else times out
319 */
320 public void testTimedPoll0() throws InterruptedException {
321 LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
322 for (int i = 0; i < SIZE; ++i) {
323 assertEquals(i, (int) q.poll(0, MILLISECONDS));
324 }
325 assertNull(q.poll(0, MILLISECONDS));
326 checkEmpty(q);
327 }
328
329 /**
330 * timed poll with nonzero timeout succeeds when non-empty, else times out
331 */
332 public void testTimedPoll() throws InterruptedException {
333 LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
334 for (int i = 0; i < SIZE; ++i) {
335 long t0 = System.nanoTime();
336 assertEquals(i, (int) q.poll(SMALL_DELAY_MS, MILLISECONDS));
337 assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS);
338 }
339 long t0 = System.nanoTime();
340 assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
341 assertTrue(millisElapsedSince(t0) >= SHORT_DELAY_MS);
342 checkEmpty(q);
343 }
344
345 /**
346 * Interrupted timed poll throws InterruptedException instead of
347 * returning timeout status
348 */
349 public void testInterruptedTimedPoll() throws InterruptedException {
350 final BlockingQueue<Integer> q = populatedQueue(SIZE);
351 final CountDownLatch aboutToWait = new CountDownLatch(1);
352 Thread t = newStartedThread(new CheckedRunnable() {
353 public void realRun() throws InterruptedException {
354 for (int i = 0; i < SIZE; ++i) {
355 long t0 = System.nanoTime();
356 assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
357 assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS);
358 }
359 long t0 = System.nanoTime();
360 aboutToWait.countDown();
361 try {
362 q.poll(MEDIUM_DELAY_MS, MILLISECONDS);
363 shouldThrow();
364 } catch (InterruptedException success) {
365 assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS);
366 }
367 }});
368
369 aboutToWait.await();
370 waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
371 t.interrupt();
372 awaitTermination(t, MEDIUM_DELAY_MS);
373 checkEmpty(q);
374 }
375
376 /**
377 * timed poll after thread interrupted throws InterruptedException
378 * instead of returning timeout status
379 */
380 public void testTimedPollAfterInterrupt() throws InterruptedException {
381 final BlockingQueue<Integer> q = populatedQueue(SIZE);
382 Thread t = newStartedThread(new CheckedRunnable() {
383 public void realRun() throws InterruptedException {
384 Thread.currentThread().interrupt();
385 for (int i = 0; i < SIZE; ++i) {
386 long t0 = System.nanoTime();
387 assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
388 assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS);
389 }
390 try {
391 q.poll(MEDIUM_DELAY_MS, MILLISECONDS);
392 shouldThrow();
393 } catch (InterruptedException success) {}
394 }});
395
396 awaitTermination(t, MEDIUM_DELAY_MS);
397 checkEmpty(q);
398 }
399
400 /**
401 * peek returns next element, or null if empty
402 */
403 public void testPeek() throws InterruptedException {
404 LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
405 for (int i = 0; i < SIZE; ++i) {
406 assertEquals(i, (int) q.peek());
407 assertEquals(i, (int) q.poll());
408 assertTrue(q.peek() == null ||
409 i != (int) q.peek());
410 }
411 assertNull(q.peek());
412 checkEmpty(q);
413 }
414
415 /**
416 * element returns next element, or throws NoSuchElementException if empty
417 */
418 public void testElement() throws InterruptedException {
419 LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
420 for (int i = 0; i < SIZE; ++i) {
421 assertEquals(i, (int) q.element());
422 assertEquals(i, (int) q.poll());
423 }
424 try {
425 q.element();
426 shouldThrow();
427 } catch (NoSuchElementException success) {}
428 checkEmpty(q);
429 }
430
431 /**
432 * remove removes next element, or throws NoSuchElementException if empty
433 */
434 public void testRemove() throws InterruptedException {
435 LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
436 for (int i = 0; i < SIZE; ++i) {
437 assertEquals(i, (int) q.remove());
438 }
439 try {
440 q.remove();
441 shouldThrow();
442 } catch (NoSuchElementException success) {}
443 checkEmpty(q);
444 }
445
446 /**
447 * remove(x) removes x and returns true if present
448 */
449 public void testRemoveElement() throws InterruptedException {
450 LinkedTransferQueue q = populatedQueue(SIZE);
451 for (int i = 1; i < SIZE; i += 2) {
452 assertTrue(q.remove(i));
453 }
454 for (int i = 0; i < SIZE; i += 2) {
455 assertTrue(q.remove(i));
456 assertFalse(q.remove(i + 1));
457 }
458 checkEmpty(q);
459 }
460
461 /**
462 * An add following remove(x) succeeds
463 */
464 public void testRemoveElementAndAdd() throws InterruptedException {
465 LinkedTransferQueue q = new LinkedTransferQueue();
466 assertTrue(q.add(one));
467 assertTrue(q.add(two));
468 assertTrue(q.remove(one));
469 assertTrue(q.remove(two));
470 assertTrue(q.add(three));
471 assertSame(q.take(), three);
472 }
473
474 /**
475 * contains(x) reports true when elements added but not yet removed
476 */
477 public void testContains() {
478 LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
479 for (int i = 0; i < SIZE; ++i) {
480 assertTrue(q.contains(i));
481 assertEquals(i, (int) q.poll());
482 assertFalse(q.contains(i));
483 }
484 }
485
486 /**
487 * clear removes all elements
488 */
489 public void testClear() throws InterruptedException {
490 LinkedTransferQueue q = populatedQueue(SIZE);
491 q.clear();
492 checkEmpty(q);
493 assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
494 q.add(one);
495 assertFalse(q.isEmpty());
496 assertEquals(1, q.size());
497 assertTrue(q.contains(one));
498 q.clear();
499 checkEmpty(q);
500 }
501
502 /**
503 * containsAll(c) is true when c contains a subset of elements
504 */
505 public void testContainsAll() {
506 LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
507 LinkedTransferQueue<Integer> p = new LinkedTransferQueue<Integer>();
508 for (int i = 0; i < SIZE; ++i) {
509 assertTrue(q.containsAll(p));
510 assertFalse(p.containsAll(q));
511 p.add(i);
512 }
513 assertTrue(p.containsAll(q));
514 }
515
516 /**
517 * retainAll(c) retains only those elements of c and reports true
518 * if changed
519 */
520 public void testRetainAll() {
521 LinkedTransferQueue q = populatedQueue(SIZE);
522 LinkedTransferQueue p = populatedQueue(SIZE);
523 for (int i = 0; i < SIZE; ++i) {
524 boolean changed = q.retainAll(p);
525 if (i == 0) {
526 assertFalse(changed);
527 } else {
528 assertTrue(changed);
529 }
530 assertTrue(q.containsAll(p));
531 assertEquals(SIZE - i, q.size());
532 p.remove();
533 }
534 }
535
536 /**
537 * removeAll(c) removes only those elements of c and reports true
538 * if changed
539 */
540 public void testRemoveAll() {
541 for (int i = 1; i < SIZE; ++i) {
542 LinkedTransferQueue q = populatedQueue(SIZE);
543 LinkedTransferQueue p = populatedQueue(i);
544 assertTrue(q.removeAll(p));
545 assertEquals(SIZE - i, q.size());
546 for (int j = 0; j < i; ++j) {
547 assertFalse(q.contains(p.remove()));
548 }
549 }
550 }
551
552 /**
553 * toArray() contains all elements in FIFO order
554 */
555 public void testToArray() {
556 LinkedTransferQueue q = populatedQueue(SIZE);
557 Object[] o = q.toArray();
558 for (int i = 0; i < o.length; i++) {
559 assertSame(o[i], q.poll());
560 }
561 }
562
563 /**
564 * toArray(a) contains all elements in FIFO order
565 */
566 public void testToArray2() {
567 LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
568 Integer[] ints = new Integer[SIZE];
569 Integer[] array = q.toArray(ints);
570 assertSame(ints, array);
571 for (int i = 0; i < ints.length; i++) {
572 assertSame(ints[i], q.poll());
573 }
574 }
575
576 /**
577 * toArray(null) throws NullPointerException
578 */
579 public void testToArray_NullArg() {
580 LinkedTransferQueue q = populatedQueue(SIZE);
581 try {
582 q.toArray(null);
583 shouldThrow();
584 } catch (NullPointerException success) {}
585 }
586
587 /**
588 * toArray(incompatible array type) throws ArrayStoreException
589 */
590 public void testToArray1_BadArg() {
591 LinkedTransferQueue q = populatedQueue(SIZE);
592 try {
593 q.toArray(new String[10]);
594 shouldThrow();
595 } catch (ArrayStoreException success) {}
596 }
597
598 /**
599 * iterator iterates through all elements
600 */
601 public void testIterator() throws InterruptedException {
602 LinkedTransferQueue q = populatedQueue(SIZE);
603 Iterator it = q.iterator();
604 int i = 0;
605 while (it.hasNext()) {
606 assertEquals(it.next(), i++);
607 }
608 assertEquals(i, SIZE);
609 }
610
611 /**
612 * iterator.remove() removes current element
613 */
614 public void testIteratorRemove() {
615 final LinkedTransferQueue q = new LinkedTransferQueue();
616 q.add(two);
617 q.add(one);
618 q.add(three);
619
620 Iterator it = q.iterator();
621 it.next();
622 it.remove();
623
624 it = q.iterator();
625 assertSame(it.next(), one);
626 assertSame(it.next(), three);
627 assertFalse(it.hasNext());
628 }
629
630 /**
631 * iterator ordering is FIFO
632 */
633 public void testIteratorOrdering() {
634 final LinkedTransferQueue<Integer> q
635 = new LinkedTransferQueue<Integer>();
636 assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
637 q.add(one);
638 q.add(two);
639 q.add(three);
640 assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
641 int k = 0;
642 for (Integer n : q) {
643 assertEquals(++k, (int) n);
644 }
645 assertEquals(3, k);
646 }
647
648 /**
649 * Modifications do not cause iterators to fail
650 */
651 public void testWeaklyConsistentIteration() {
652 final LinkedTransferQueue q = new LinkedTransferQueue();
653 q.add(one);
654 q.add(two);
655 q.add(three);
656 for (Iterator it = q.iterator(); it.hasNext();) {
657 q.remove();
658 it.next();
659 }
660 assertEquals(0, q.size());
661 }
662
663 /**
664 * toString contains toStrings of elements
665 */
666 public void testToString() {
667 LinkedTransferQueue q = populatedQueue(SIZE);
668 String s = q.toString();
669 for (int i = 0; i < SIZE; ++i) {
670 assertTrue(s.indexOf(String.valueOf(i)) >= 0);
671 }
672 }
673
674 /**
675 * offer transfers elements across Executor tasks
676 */
677 public void testOfferInExecutor() {
678 final LinkedTransferQueue q = new LinkedTransferQueue();
679 final CountDownLatch threadsStarted = new CountDownLatch(2);
680 ExecutorService executor = Executors.newFixedThreadPool(2);
681
682 executor.execute(new CheckedRunnable() {
683 public void realRun() throws InterruptedException {
684 threadsStarted.countDown();
685 threadsStarted.await();
686 assertTrue(q.offer(one, MEDIUM_DELAY_MS, MILLISECONDS));
687 }});
688
689 executor.execute(new CheckedRunnable() {
690 public void realRun() throws InterruptedException {
691 threadsStarted.countDown();
692 threadsStarted.await();
693 assertSame(one, q.take());
694 checkEmpty(q);
695 }});
696
697 joinPool(executor);
698 }
699
700 /**
701 * timed poll retrieves elements across Executor threads
702 */
703 public void testPollInExecutor() {
704 final LinkedTransferQueue q = new LinkedTransferQueue();
705 final CountDownLatch threadsStarted = new CountDownLatch(2);
706 ExecutorService executor = Executors.newFixedThreadPool(2);
707
708 executor.execute(new CheckedRunnable() {
709 public void realRun() throws InterruptedException {
710 assertNull(q.poll());
711 threadsStarted.countDown();
712 threadsStarted.await();
713 assertSame(one, q.poll(SMALL_DELAY_MS, MILLISECONDS));
714 checkEmpty(q);
715 }});
716
717 executor.execute(new CheckedRunnable() {
718 public void realRun() throws InterruptedException {
719 threadsStarted.countDown();
720 threadsStarted.await();
721 q.put(one);
722 }});
723
724 joinPool(executor);
725 }
726
727 /**
728 * A deserialized serialized queue has same elements in same order
729 */
730 public void testSerialization() throws Exception {
731 LinkedTransferQueue q = populatedQueue(SIZE);
732
733 ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
734 ObjectOutputStream out
735 = new ObjectOutputStream(new BufferedOutputStream(bout));
736 out.writeObject(q);
737 out.close();
738
739 ByteArrayInputStream bin
740 = new ByteArrayInputStream(bout.toByteArray());
741 ObjectInputStream in
742 = new ObjectInputStream(new BufferedInputStream(bin));
743 LinkedTransferQueue r = (LinkedTransferQueue) in.readObject();
744
745 assertEquals(q.size(), r.size());
746 assertEquals(q.toString(), r.toString());
747 assertTrue(Arrays.equals(q.toArray(), r.toArray()));
748 while (!q.isEmpty()) {
749 assertEquals(q.remove(), r.remove());
750 }
751 }
752
753 /**
754 * drainTo(null) throws NullPointerException
755 */
756 public void testDrainToNull() {
757 LinkedTransferQueue q = populatedQueue(SIZE);
758 try {
759 q.drainTo(null);
760 shouldThrow();
761 } catch (NullPointerException success) {}
762 }
763
764 /**
765 * drainTo(this) throws IllegalArgumentException
766 */
767 public void testDrainToSelf() {
768 LinkedTransferQueue q = populatedQueue(SIZE);
769 try {
770 q.drainTo(q);
771 shouldThrow();
772 } catch (IllegalArgumentException success) {}
773 }
774
775 /**
776 * drainTo(c) empties queue into another collection c
777 */
778 public void testDrainTo() {
779 LinkedTransferQueue q = populatedQueue(SIZE);
780 ArrayList l = new ArrayList();
781 q.drainTo(l);
782 assertEquals(q.size(), 0);
783 assertEquals(l.size(), SIZE);
784 for (int i = 0; i < SIZE; ++i) {
785 assertEquals(l.get(i), i);
786 }
787 q.add(zero);
788 q.add(one);
789 assertFalse(q.isEmpty());
790 assertTrue(q.contains(zero));
791 assertTrue(q.contains(one));
792 l.clear();
793 q.drainTo(l);
794 assertEquals(q.size(), 0);
795 assertEquals(l.size(), 2);
796 for (int i = 0; i < 2; ++i) {
797 assertEquals(l.get(i), i);
798 }
799 }
800
801 /**
802 * drainTo(c) empties full queue, unblocking a waiting put.
803 */
804 public void testDrainToWithActivePut() throws InterruptedException {
805 final LinkedTransferQueue q = populatedQueue(SIZE);
806 Thread t = newStartedThread(new CheckedRunnable() {
807 public void realRun() {
808 q.put(SIZE + 1);
809 }});
810 ArrayList l = new ArrayList();
811 q.drainTo(l);
812 assertTrue(l.size() >= SIZE);
813 for (int i = 0; i < SIZE; ++i) {
814 assertEquals(l.get(i), i);
815 }
816 awaitTermination(t, MEDIUM_DELAY_MS);
817 assertTrue(q.size() + l.size() >= SIZE);
818 }
819
820 /**
821 * drainTo(null, n) throws NullPointerException
822 */
823 public void testDrainToNullN() {
824 LinkedTransferQueue q = populatedQueue(SIZE);
825 try {
826 q.drainTo(null, SIZE);
827 shouldThrow();
828 } catch (NullPointerException success) {}
829 }
830
831 /**
832 * drainTo(this, n) throws IllegalArgumentException
833 */
834 public void testDrainToSelfN() {
835 LinkedTransferQueue q = populatedQueue(SIZE);
836 try {
837 q.drainTo(q, SIZE);
838 shouldThrow();
839 } catch (IllegalArgumentException success) {}
840 }
841
842 /**
843 * drainTo(c, n) empties first min(n, size) elements of queue into c
844 */
845 public void testDrainToN() {
846 LinkedTransferQueue q = new LinkedTransferQueue();
847 for (int i = 0; i < SIZE + 2; ++i) {
848 for (int j = 0; j < SIZE; j++) {
849 assertTrue(q.offer(j));
850 }
851 ArrayList l = new ArrayList();
852 q.drainTo(l, i);
853 int k = (i < SIZE) ? i : SIZE;
854 assertEquals(l.size(), k);
855 assertEquals(q.size(), SIZE - k);
856 for (int j = 0; j < k; ++j) {
857 assertEquals(l.get(j), j);
858 }
859 while (q.poll() != null)
860 ;
861 }
862 }
863
864 /**
865 * timed poll() or take() increments the waiting consumer count;
866 * offer(e) decrements the waiting consumer count
867 */
868 public void testWaitingConsumer() throws InterruptedException {
869 final LinkedTransferQueue q = new LinkedTransferQueue();
870 assertEquals(q.getWaitingConsumerCount(), 0);
871 assertFalse(q.hasWaitingConsumer());
872 final CountDownLatch threadStarted = new CountDownLatch(1);
873
874 Thread t = newStartedThread(new CheckedRunnable() {
875 public void realRun() throws InterruptedException {
876 threadStarted.countDown();
877 assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
878 assertEquals(q.getWaitingConsumerCount(), 0);
879 assertFalse(q.hasWaitingConsumer());
880 }});
881
882 threadStarted.await();
883 waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
884 assertEquals(q.getWaitingConsumerCount(), 1);
885 assertTrue(q.hasWaitingConsumer());
886
887 assertTrue(q.offer(one));
888 assertEquals(q.getWaitingConsumerCount(), 0);
889 assertFalse(q.hasWaitingConsumer());
890
891 awaitTermination(t, MEDIUM_DELAY_MS);
892 }
893
894 /**
895 * transfer(null) throws NullPointerException
896 */
897 public void testTransfer1() throws InterruptedException {
898 try {
899 LinkedTransferQueue q = new LinkedTransferQueue();
900 q.transfer(null);
901 shouldThrow();
902 } catch (NullPointerException success) {}
903 }
904
905 /**
906 * transfer waits until a poll occurs. The transfered element
907 * is returned by this associated poll.
908 */
909 public void testTransfer2() throws InterruptedException {
910 final LinkedTransferQueue<Integer> q
911 = new LinkedTransferQueue<Integer>();
912 final CountDownLatch threadStarted = new CountDownLatch(1);
913
914 Thread t = newStartedThread(new CheckedRunnable() {
915 public void realRun() throws InterruptedException {
916 threadStarted.countDown();
917 q.transfer(five);
918 checkEmpty(q);
919 }});
920
921 threadStarted.await();
922 waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
923 assertEquals(1, q.size());
924 assertSame(five, q.poll());
925 checkEmpty(q);
926 awaitTermination(t, MEDIUM_DELAY_MS);
927 }
928
929 /**
930 * transfer waits until a poll occurs, and then transfers in fifo order
931 */
932 public void testTransfer3() throws InterruptedException {
933 final LinkedTransferQueue<Integer> q
934 = new LinkedTransferQueue<Integer>();
935
936 Thread first = newStartedThread(new CheckedRunnable() {
937 public void realRun() throws InterruptedException {
938 q.transfer(four);
939 assertTrue(!q.contains(four));
940 assertEquals(1, q.size());
941 }});
942
943 Thread interruptedThread = newStartedThread(
944 new CheckedInterruptedRunnable() {
945 public void realRun() throws InterruptedException {
946 while (q.isEmpty())
947 Thread.yield();
948 q.transfer(five);
949 }});
950
951 while (q.size() < 2)
952 Thread.yield();
953 assertEquals(2, q.size());
954 assertSame(four, q.poll());
955 first.join();
956 assertEquals(1, q.size());
957 interruptedThread.interrupt();
958 interruptedThread.join();
959 checkEmpty(q);
960 }
961
962 /**
963 * transfer waits until a poll occurs, at which point the polling
964 * thread returns the element
965 */
966 public void testTransfer4() throws InterruptedException {
967 final LinkedTransferQueue q = new LinkedTransferQueue();
968
969 Thread t = newStartedThread(new CheckedRunnable() {
970 public void realRun() throws InterruptedException {
971 q.transfer(four);
972 assertFalse(q.contains(four));
973 assertSame(three, q.poll());
974 }});
975
976 while (q.isEmpty())
977 Thread.yield();
978 assertFalse(q.isEmpty());
979 assertEquals(1, q.size());
980 assertTrue(q.offer(three));
981 assertSame(four, q.poll());
982 awaitTermination(t, MEDIUM_DELAY_MS);
983 }
984
985 /**
986 * transfer waits until a take occurs. The transfered element
987 * is returned by this associated take.
988 */
989 public void testTransfer5() throws InterruptedException {
990 final LinkedTransferQueue<Integer> q
991 = new LinkedTransferQueue<Integer>();
992
993 Thread t = newStartedThread(new CheckedRunnable() {
994 public void realRun() throws InterruptedException {
995 q.transfer(four);
996 checkEmpty(q);
997 }});
998
999 while (q.isEmpty())
1000 Thread.yield();
1001 assertFalse(q.isEmpty());
1002 assertEquals(1, q.size());
1003 assertSame(four, q.take());
1004 checkEmpty(q);
1005 awaitTermination(t, MEDIUM_DELAY_MS);
1006 }
1007
1008 /**
1009 * tryTransfer(null) throws NullPointerException
1010 */
1011 public void testTryTransfer1() {
1012 try {
1013 final LinkedTransferQueue q = new LinkedTransferQueue();
1014 q.tryTransfer(null);
1015 shouldThrow();
1016 } catch (NullPointerException success) {}
1017 }
1018
1019 /**
1020 * tryTransfer returns false and does not enqueue if there are no
1021 * consumers waiting to poll or take.
1022 */
1023 public void testTryTransfer2() throws InterruptedException {
1024 final LinkedTransferQueue q = new LinkedTransferQueue();
1025 assertFalse(q.tryTransfer(new Object()));
1026 assertFalse(q.hasWaitingConsumer());
1027 checkEmpty(q);
1028 }
1029
1030 /**
1031 * If there is a consumer waiting in timed poll, tryTransfer
1032 * returns true while successfully transfering object.
1033 */
1034 public void testTryTransfer3() throws InterruptedException {
1035 final Object hotPotato = new Object();
1036 final LinkedTransferQueue q = new LinkedTransferQueue();
1037
1038 Thread t = newStartedThread(new CheckedRunnable() {
1039 public void realRun() {
1040 while (! q.hasWaitingConsumer())
1041 Thread.yield();
1042 assertTrue(q.hasWaitingConsumer());
1043 checkEmpty(q);
1044 assertTrue(q.tryTransfer(hotPotato));
1045 }});
1046
1047 assertSame(hotPotato, q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
1048 checkEmpty(q);
1049 awaitTermination(t, MEDIUM_DELAY_MS);
1050 }
1051
1052 /**
1053 * If there is a consumer waiting in take, tryTransfer returns
1054 * true while successfully transfering object.
1055 */
1056 public void testTryTransfer4() throws InterruptedException {
1057 final Object hotPotato = new Object();
1058 final LinkedTransferQueue q = new LinkedTransferQueue();
1059
1060 Thread t = newStartedThread(new CheckedRunnable() {
1061 public void realRun() {
1062 while (! q.hasWaitingConsumer())
1063 Thread.yield();
1064 assertTrue(q.hasWaitingConsumer());
1065 checkEmpty(q);
1066 assertTrue(q.tryTransfer(hotPotato));
1067 }});
1068
1069 assertSame(q.take(), hotPotato);
1070 checkEmpty(q);
1071 awaitTermination(t, MEDIUM_DELAY_MS);
1072 }
1073
1074 /**
1075 * tryTransfer waits the amount given, and throws
1076 * InterruptedException when interrupted.
1077 */
1078 public void testTryTransfer5() throws InterruptedException {
1079 final LinkedTransferQueue q = new LinkedTransferQueue();
1080 final CountDownLatch threadStarted = new CountDownLatch(1);
1081 assertTrue(q.isEmpty());
1082
1083 Thread t = newStartedThread(new CheckedRunnable() {
1084 public void realRun() throws InterruptedException {
1085 long t0 = System.nanoTime();
1086 threadStarted.countDown();
1087 try {
1088 q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS);
1089 shouldThrow();
1090 } catch (InterruptedException success) {}
1091 assertTrue(millisElapsedSince(t0) >= SHORT_DELAY_MS);
1092 assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS);
1093 }});
1094
1095 threadStarted.await();
1096 while (q.isEmpty())
1097 Thread.yield();
1098 Thread.sleep(SHORT_DELAY_MS);
1099 t.interrupt();
1100 awaitTermination(t, MEDIUM_DELAY_MS);
1101 checkEmpty(q);
1102 }
1103
1104 /**
1105 * tryTransfer gives up after the timeout and returns false
1106 */
1107 public void testTryTransfer6() throws InterruptedException {
1108 final LinkedTransferQueue q = new LinkedTransferQueue();
1109
1110 Thread t = newStartedThread(new CheckedRunnable() {
1111 public void realRun() throws InterruptedException {
1112 long t0 = System.nanoTime();
1113 assertFalse(q.tryTransfer(new Object(),
1114 SHORT_DELAY_MS, MILLISECONDS));
1115 assertTrue(millisElapsedSince(t0) >= SHORT_DELAY_MS);
1116 checkEmpty(q);
1117 }});
1118
1119 awaitTermination(t, MEDIUM_DELAY_MS);
1120 checkEmpty(q);
1121 }
1122
1123 /**
1124 * tryTransfer waits for any elements previously in to be removed
1125 * before transfering to a poll or take
1126 */
1127 public void testTryTransfer7() throws InterruptedException {
1128 final LinkedTransferQueue q = new LinkedTransferQueue();
1129 assertTrue(q.offer(four));
1130
1131 Thread t = newStartedThread(new CheckedRunnable() {
1132 public void realRun() throws InterruptedException {
1133 assertTrue(q.tryTransfer(five, MEDIUM_DELAY_MS, MILLISECONDS));
1134 checkEmpty(q);
1135 }});
1136
1137 while (q.size() != 2)
1138 Thread.yield();
1139 assertEquals(2, q.size());
1140 assertSame(four, q.poll());
1141 assertSame(five, q.poll());
1142 checkEmpty(q);
1143 awaitTermination(t, MEDIUM_DELAY_MS);
1144 }
1145
1146 /**
1147 * tryTransfer attempts to enqueue into the queue and fails
1148 * returning false not enqueueing and the successive poll is null
1149 */
1150 public void testTryTransfer8() throws InterruptedException {
1151 final LinkedTransferQueue q = new LinkedTransferQueue();
1152 assertTrue(q.offer(four));
1153 assertEquals(1, q.size());
1154 long t0 = System.nanoTime();
1155 assertFalse(q.tryTransfer(five, SHORT_DELAY_MS, MILLISECONDS));
1156 assertTrue(millisElapsedSince(t0) >= SHORT_DELAY_MS);
1157 assertEquals(1, q.size());
1158 assertSame(four, q.poll());
1159 assertNull(q.poll());
1160 checkEmpty(q);
1161 }
1162
1163 private LinkedTransferQueue<Integer> populatedQueue(int n) {
1164 LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
1165 checkEmpty(q);
1166 for (int i = 0; i < n; i++) {
1167 assertEquals(i, q.size());
1168 assertTrue(q.offer(i));
1169 assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
1170 }
1171 assertFalse(q.isEmpty());
1172 return q;
1173 }
1174 }