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