ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/test/tck/LinkedTransferQueueTest.java
Revision: 1.76
Committed: Sun May 14 00:48:20 2017 UTC (7 years ago) by jsr166
Branch: MAIN
Changes since 1.75: +6 -3 lines
Log Message:
improve testInterruptedTimedPoll

File Contents

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