ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/test/tck/LinkedTransferQueueTest.java
Revision: 1.50
Committed: Sat Nov 26 05:19:17 2011 UTC (12 years, 5 months ago) by jsr166
Branch: MAIN
Changes since 1.49: +8 -8 lines
Log Message:
assertEquals argument order

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