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 Andrew Wright, Jeffrey Hayes, |
6 |
* Pat Fisher, Mike Judd. |
7 |
*/ |
8 |
|
9 |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
10 |
|
11 |
import java.util.ArrayList; |
12 |
import java.util.Arrays; |
13 |
import java.util.Collection; |
14 |
import java.util.Iterator; |
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.LinkedBlockingQueue; |
22 |
|
23 |
import junit.framework.Test; |
24 |
|
25 |
public class LinkedBlockingQueueTest extends JSR166TestCase { |
26 |
|
27 |
public static class Unbounded extends BlockingQueueTest { |
28 |
protected BlockingQueue emptyCollection() { |
29 |
return new LinkedBlockingQueue(); |
30 |
} |
31 |
} |
32 |
|
33 |
public static class Bounded extends BlockingQueueTest { |
34 |
protected BlockingQueue emptyCollection() { |
35 |
return new LinkedBlockingQueue(SIZE); |
36 |
} |
37 |
} |
38 |
|
39 |
public static void main(String[] args) { |
40 |
main(suite(), args); |
41 |
} |
42 |
|
43 |
public static Test suite() { |
44 |
class Implementation implements CollectionImplementation { |
45 |
public Class<?> klazz() { return LinkedBlockingQueue.class; } |
46 |
public Collection emptyCollection() { return new LinkedBlockingQueue(); } |
47 |
public Object makeElement(int i) { return i; } |
48 |
public boolean isConcurrent() { return true; } |
49 |
public boolean permitsNulls() { return false; } |
50 |
} |
51 |
return newTestSuite(LinkedBlockingQueueTest.class, |
52 |
new Unbounded().testSuite(), |
53 |
new Bounded().testSuite(), |
54 |
CollectionTest.testSuite(new Implementation())); |
55 |
} |
56 |
|
57 |
/** |
58 |
* Returns a new queue of given size containing consecutive |
59 |
* Integers 0 ... n - 1. |
60 |
*/ |
61 |
private static LinkedBlockingQueue<Integer> populatedQueue(int n) { |
62 |
LinkedBlockingQueue<Integer> q = |
63 |
new LinkedBlockingQueue<Integer>(n); |
64 |
assertTrue(q.isEmpty()); |
65 |
for (int i = 0; i < n; i++) |
66 |
assertTrue(q.offer(new Integer(i))); |
67 |
assertFalse(q.isEmpty()); |
68 |
assertEquals(0, q.remainingCapacity()); |
69 |
assertEquals(n, q.size()); |
70 |
assertEquals((Integer) 0, q.peek()); |
71 |
return q; |
72 |
} |
73 |
|
74 |
/** |
75 |
* A new queue has the indicated capacity, or Integer.MAX_VALUE if |
76 |
* none given |
77 |
*/ |
78 |
public void testConstructor1() { |
79 |
assertEquals(SIZE, new LinkedBlockingQueue(SIZE).remainingCapacity()); |
80 |
assertEquals(Integer.MAX_VALUE, new LinkedBlockingQueue().remainingCapacity()); |
81 |
} |
82 |
|
83 |
/** |
84 |
* Constructor throws IllegalArgumentException if capacity argument nonpositive |
85 |
*/ |
86 |
public void testConstructor2() { |
87 |
try { |
88 |
new LinkedBlockingQueue(0); |
89 |
shouldThrow(); |
90 |
} catch (IllegalArgumentException success) {} |
91 |
} |
92 |
|
93 |
/** |
94 |
* Initializing from null Collection throws NullPointerException |
95 |
*/ |
96 |
public void testConstructor3() { |
97 |
try { |
98 |
new LinkedBlockingQueue(null); |
99 |
shouldThrow(); |
100 |
} catch (NullPointerException success) {} |
101 |
} |
102 |
|
103 |
/** |
104 |
* Initializing from Collection of null elements throws NullPointerException |
105 |
*/ |
106 |
public void testConstructor4() { |
107 |
Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); |
108 |
try { |
109 |
new LinkedBlockingQueue(elements); |
110 |
shouldThrow(); |
111 |
} catch (NullPointerException success) {} |
112 |
} |
113 |
|
114 |
/** |
115 |
* Initializing from Collection with some null elements throws |
116 |
* NullPointerException |
117 |
*/ |
118 |
public void testConstructor5() { |
119 |
Integer[] ints = new Integer[SIZE]; |
120 |
for (int i = 0; i < SIZE - 1; ++i) |
121 |
ints[i] = new Integer(i); |
122 |
Collection<Integer> elements = Arrays.asList(ints); |
123 |
try { |
124 |
new LinkedBlockingQueue(elements); |
125 |
shouldThrow(); |
126 |
} catch (NullPointerException success) {} |
127 |
} |
128 |
|
129 |
/** |
130 |
* Queue contains all elements of collection used to initialize |
131 |
*/ |
132 |
public void testConstructor6() { |
133 |
Integer[] ints = new Integer[SIZE]; |
134 |
for (int i = 0; i < SIZE; ++i) |
135 |
ints[i] = new Integer(i); |
136 |
LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints)); |
137 |
for (int i = 0; i < SIZE; ++i) |
138 |
assertEquals(ints[i], q.poll()); |
139 |
} |
140 |
|
141 |
/** |
142 |
* Queue transitions from empty to full when elements added |
143 |
*/ |
144 |
public void testEmptyFull() { |
145 |
LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
146 |
assertTrue(q.isEmpty()); |
147 |
assertEquals("should have room for 2", 2, q.remainingCapacity()); |
148 |
q.add(one); |
149 |
assertFalse(q.isEmpty()); |
150 |
q.add(two); |
151 |
assertFalse(q.isEmpty()); |
152 |
assertEquals(0, q.remainingCapacity()); |
153 |
assertFalse(q.offer(three)); |
154 |
} |
155 |
|
156 |
/** |
157 |
* remainingCapacity decreases on add, increases on remove |
158 |
*/ |
159 |
public void testRemainingCapacity() { |
160 |
BlockingQueue q = populatedQueue(SIZE); |
161 |
for (int i = 0; i < SIZE; ++i) { |
162 |
assertEquals(i, q.remainingCapacity()); |
163 |
assertEquals(SIZE, q.size() + q.remainingCapacity()); |
164 |
assertEquals(i, q.remove()); |
165 |
} |
166 |
for (int i = 0; i < SIZE; ++i) { |
167 |
assertEquals(SIZE - i, q.remainingCapacity()); |
168 |
assertEquals(SIZE, q.size() + q.remainingCapacity()); |
169 |
assertTrue(q.add(i)); |
170 |
} |
171 |
} |
172 |
|
173 |
/** |
174 |
* Offer succeeds if not full; fails if full |
175 |
*/ |
176 |
public void testOffer() { |
177 |
LinkedBlockingQueue q = new LinkedBlockingQueue(1); |
178 |
assertTrue(q.offer(zero)); |
179 |
assertFalse(q.offer(one)); |
180 |
} |
181 |
|
182 |
/** |
183 |
* add succeeds if not full; throws IllegalStateException if full |
184 |
*/ |
185 |
public void testAdd() { |
186 |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
187 |
for (int i = 0; i < SIZE; ++i) |
188 |
assertTrue(q.add(new Integer(i))); |
189 |
assertEquals(0, q.remainingCapacity()); |
190 |
try { |
191 |
q.add(new Integer(SIZE)); |
192 |
shouldThrow(); |
193 |
} catch (IllegalStateException success) {} |
194 |
} |
195 |
|
196 |
/** |
197 |
* addAll(this) throws IllegalArgumentException |
198 |
*/ |
199 |
public void testAddAllSelf() { |
200 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
201 |
try { |
202 |
q.addAll(q); |
203 |
shouldThrow(); |
204 |
} catch (IllegalArgumentException success) {} |
205 |
} |
206 |
|
207 |
/** |
208 |
* addAll of a collection with any null elements throws NPE after |
209 |
* possibly adding some elements |
210 |
*/ |
211 |
public void testAddAll3() { |
212 |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
213 |
Integer[] ints = new Integer[SIZE]; |
214 |
for (int i = 0; i < SIZE - 1; ++i) |
215 |
ints[i] = new Integer(i); |
216 |
Collection<Integer> elements = Arrays.asList(ints); |
217 |
try { |
218 |
q.addAll(elements); |
219 |
shouldThrow(); |
220 |
} catch (NullPointerException success) {} |
221 |
} |
222 |
|
223 |
/** |
224 |
* addAll throws IllegalStateException if not enough room |
225 |
*/ |
226 |
public void testAddAll4() { |
227 |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE - 1); |
228 |
Integer[] ints = new Integer[SIZE]; |
229 |
for (int i = 0; i < SIZE; ++i) |
230 |
ints[i] = new Integer(i); |
231 |
Collection<Integer> elements = Arrays.asList(ints); |
232 |
try { |
233 |
q.addAll(elements); |
234 |
shouldThrow(); |
235 |
} catch (IllegalStateException success) {} |
236 |
} |
237 |
|
238 |
/** |
239 |
* Queue contains all elements, in traversal order, of successful addAll |
240 |
*/ |
241 |
public void testAddAll5() { |
242 |
Integer[] empty = new Integer[0]; |
243 |
Integer[] ints = new Integer[SIZE]; |
244 |
for (int i = 0; i < SIZE; ++i) |
245 |
ints[i] = new Integer(i); |
246 |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
247 |
assertFalse(q.addAll(Arrays.asList(empty))); |
248 |
assertTrue(q.addAll(Arrays.asList(ints))); |
249 |
for (int i = 0; i < SIZE; ++i) |
250 |
assertEquals(ints[i], q.poll()); |
251 |
} |
252 |
|
253 |
/** |
254 |
* all elements successfully put are contained |
255 |
*/ |
256 |
public void testPut() throws InterruptedException { |
257 |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
258 |
for (int i = 0; i < SIZE; ++i) { |
259 |
Integer x = new Integer(i); |
260 |
q.put(x); |
261 |
assertTrue(q.contains(x)); |
262 |
} |
263 |
assertEquals(0, q.remainingCapacity()); |
264 |
} |
265 |
|
266 |
/** |
267 |
* put blocks interruptibly if full |
268 |
*/ |
269 |
public void testBlockingPut() throws InterruptedException { |
270 |
final LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
271 |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
272 |
Thread t = newStartedThread(new CheckedRunnable() { |
273 |
public void realRun() throws InterruptedException { |
274 |
for (int i = 0; i < SIZE; ++i) |
275 |
q.put(i); |
276 |
assertEquals(SIZE, q.size()); |
277 |
assertEquals(0, q.remainingCapacity()); |
278 |
|
279 |
Thread.currentThread().interrupt(); |
280 |
try { |
281 |
q.put(99); |
282 |
shouldThrow(); |
283 |
} catch (InterruptedException success) {} |
284 |
assertFalse(Thread.interrupted()); |
285 |
|
286 |
pleaseInterrupt.countDown(); |
287 |
try { |
288 |
q.put(99); |
289 |
shouldThrow(); |
290 |
} catch (InterruptedException success) {} |
291 |
assertFalse(Thread.interrupted()); |
292 |
}}); |
293 |
|
294 |
await(pleaseInterrupt); |
295 |
assertThreadBlocks(t, Thread.State.WAITING); |
296 |
t.interrupt(); |
297 |
awaitTermination(t); |
298 |
assertEquals(SIZE, q.size()); |
299 |
assertEquals(0, q.remainingCapacity()); |
300 |
} |
301 |
|
302 |
/** |
303 |
* put blocks interruptibly waiting for take when full |
304 |
*/ |
305 |
public void testPutWithTake() throws InterruptedException { |
306 |
final int capacity = 2; |
307 |
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
308 |
final CountDownLatch pleaseTake = new CountDownLatch(1); |
309 |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
310 |
Thread t = newStartedThread(new CheckedRunnable() { |
311 |
public void realRun() throws InterruptedException { |
312 |
for (int i = 0; i < capacity; i++) |
313 |
q.put(i); |
314 |
pleaseTake.countDown(); |
315 |
q.put(86); |
316 |
|
317 |
Thread.currentThread().interrupt(); |
318 |
try { |
319 |
q.put(99); |
320 |
shouldThrow(); |
321 |
} catch (InterruptedException success) {} |
322 |
assertFalse(Thread.interrupted()); |
323 |
|
324 |
pleaseInterrupt.countDown(); |
325 |
try { |
326 |
q.put(99); |
327 |
shouldThrow(); |
328 |
} catch (InterruptedException success) {} |
329 |
assertFalse(Thread.interrupted()); |
330 |
}}); |
331 |
|
332 |
await(pleaseTake); |
333 |
assertEquals(0, q.remainingCapacity()); |
334 |
assertEquals(0, q.take()); |
335 |
|
336 |
await(pleaseInterrupt); |
337 |
assertThreadBlocks(t, Thread.State.WAITING); |
338 |
t.interrupt(); |
339 |
awaitTermination(t); |
340 |
assertEquals(0, q.remainingCapacity()); |
341 |
} |
342 |
|
343 |
/** |
344 |
* timed offer times out if full and elements not taken |
345 |
*/ |
346 |
public void testTimedOffer() { |
347 |
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
348 |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
349 |
Thread t = newStartedThread(new CheckedRunnable() { |
350 |
public void realRun() throws InterruptedException { |
351 |
q.put(new Object()); |
352 |
q.put(new Object()); |
353 |
long startTime = System.nanoTime(); |
354 |
assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS)); |
355 |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
356 |
pleaseInterrupt.countDown(); |
357 |
try { |
358 |
q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS); |
359 |
shouldThrow(); |
360 |
} catch (InterruptedException success) {} |
361 |
assertFalse(Thread.interrupted()); |
362 |
}}); |
363 |
|
364 |
await(pleaseInterrupt); |
365 |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
366 |
t.interrupt(); |
367 |
awaitTermination(t); |
368 |
} |
369 |
|
370 |
/** |
371 |
* take retrieves elements in FIFO order |
372 |
*/ |
373 |
public void testTake() throws InterruptedException { |
374 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
375 |
for (int i = 0; i < SIZE; ++i) { |
376 |
assertEquals(i, q.take()); |
377 |
} |
378 |
} |
379 |
|
380 |
/** |
381 |
* Take removes existing elements until empty, then blocks interruptibly |
382 |
*/ |
383 |
public void testBlockingTake() throws InterruptedException { |
384 |
final BlockingQueue q = populatedQueue(SIZE); |
385 |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
386 |
Thread t = newStartedThread(new CheckedRunnable() { |
387 |
public void realRun() throws InterruptedException { |
388 |
for (int i = 0; i < SIZE; i++) assertEquals(i, q.take()); |
389 |
|
390 |
Thread.currentThread().interrupt(); |
391 |
try { |
392 |
q.take(); |
393 |
shouldThrow(); |
394 |
} catch (InterruptedException success) {} |
395 |
assertFalse(Thread.interrupted()); |
396 |
|
397 |
pleaseInterrupt.countDown(); |
398 |
try { |
399 |
q.take(); |
400 |
shouldThrow(); |
401 |
} catch (InterruptedException success) {} |
402 |
assertFalse(Thread.interrupted()); |
403 |
}}); |
404 |
|
405 |
await(pleaseInterrupt); |
406 |
assertThreadBlocks(t, Thread.State.WAITING); |
407 |
t.interrupt(); |
408 |
awaitTermination(t); |
409 |
} |
410 |
|
411 |
/** |
412 |
* poll succeeds unless empty |
413 |
*/ |
414 |
public void testPoll() { |
415 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
416 |
for (int i = 0; i < SIZE; ++i) { |
417 |
assertEquals(i, q.poll()); |
418 |
} |
419 |
assertNull(q.poll()); |
420 |
} |
421 |
|
422 |
/** |
423 |
* timed poll with zero timeout succeeds when non-empty, else times out |
424 |
*/ |
425 |
public void testTimedPoll0() throws InterruptedException { |
426 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
427 |
for (int i = 0; i < SIZE; ++i) { |
428 |
assertEquals(i, q.poll(0, MILLISECONDS)); |
429 |
} |
430 |
assertNull(q.poll(0, MILLISECONDS)); |
431 |
} |
432 |
|
433 |
/** |
434 |
* timed poll with nonzero timeout succeeds when non-empty, else times out |
435 |
*/ |
436 |
public void testTimedPoll() throws InterruptedException { |
437 |
LinkedBlockingQueue<Integer> q = populatedQueue(SIZE); |
438 |
for (int i = 0; i < SIZE; ++i) { |
439 |
long startTime = System.nanoTime(); |
440 |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
441 |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
442 |
} |
443 |
long startTime = System.nanoTime(); |
444 |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
445 |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
446 |
checkEmpty(q); |
447 |
} |
448 |
|
449 |
/** |
450 |
* Interrupted timed poll throws InterruptedException instead of |
451 |
* returning timeout status |
452 |
*/ |
453 |
public void testInterruptedTimedPoll() throws InterruptedException { |
454 |
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
455 |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
456 |
Thread t = newStartedThread(new CheckedRunnable() { |
457 |
public void realRun() throws InterruptedException { |
458 |
long startTime = System.nanoTime(); |
459 |
for (int i = 0; i < SIZE; i++) |
460 |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
461 |
|
462 |
Thread.currentThread().interrupt(); |
463 |
try { |
464 |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
465 |
shouldThrow(); |
466 |
} catch (InterruptedException success) {} |
467 |
assertFalse(Thread.interrupted()); |
468 |
|
469 |
pleaseInterrupt.countDown(); |
470 |
try { |
471 |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
472 |
shouldThrow(); |
473 |
} catch (InterruptedException success) {} |
474 |
assertFalse(Thread.interrupted()); |
475 |
|
476 |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
477 |
}}); |
478 |
|
479 |
await(pleaseInterrupt); |
480 |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
481 |
t.interrupt(); |
482 |
awaitTermination(t); |
483 |
checkEmpty(q); |
484 |
} |
485 |
|
486 |
/** |
487 |
* peek returns next element, or null if empty |
488 |
*/ |
489 |
public void testPeek() { |
490 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
491 |
for (int i = 0; i < SIZE; ++i) { |
492 |
assertEquals(i, q.peek()); |
493 |
assertEquals(i, q.poll()); |
494 |
assertTrue(q.peek() == null || |
495 |
!q.peek().equals(i)); |
496 |
} |
497 |
assertNull(q.peek()); |
498 |
} |
499 |
|
500 |
/** |
501 |
* element returns next element, or throws NSEE if empty |
502 |
*/ |
503 |
public void testElement() { |
504 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
505 |
for (int i = 0; i < SIZE; ++i) { |
506 |
assertEquals(i, q.element()); |
507 |
assertEquals(i, q.poll()); |
508 |
} |
509 |
try { |
510 |
q.element(); |
511 |
shouldThrow(); |
512 |
} catch (NoSuchElementException success) {} |
513 |
} |
514 |
|
515 |
/** |
516 |
* remove removes next element, or throws NSEE if empty |
517 |
*/ |
518 |
public void testRemove() { |
519 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
520 |
for (int i = 0; i < SIZE; ++i) { |
521 |
assertEquals(i, q.remove()); |
522 |
} |
523 |
try { |
524 |
q.remove(); |
525 |
shouldThrow(); |
526 |
} catch (NoSuchElementException success) {} |
527 |
} |
528 |
|
529 |
/** |
530 |
* An add following remove(x) succeeds |
531 |
*/ |
532 |
public void testRemoveElementAndAdd() throws InterruptedException { |
533 |
LinkedBlockingQueue q = new LinkedBlockingQueue(); |
534 |
assertTrue(q.add(new Integer(1))); |
535 |
assertTrue(q.add(new Integer(2))); |
536 |
assertTrue(q.remove(new Integer(1))); |
537 |
assertTrue(q.remove(new Integer(2))); |
538 |
assertTrue(q.add(new Integer(3))); |
539 |
assertNotNull(q.take()); |
540 |
} |
541 |
|
542 |
/** |
543 |
* contains(x) reports true when elements added but not yet removed |
544 |
*/ |
545 |
public void testContains() { |
546 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
547 |
for (int i = 0; i < SIZE; ++i) { |
548 |
assertTrue(q.contains(new Integer(i))); |
549 |
q.poll(); |
550 |
assertFalse(q.contains(new Integer(i))); |
551 |
} |
552 |
} |
553 |
|
554 |
/** |
555 |
* clear removes all elements |
556 |
*/ |
557 |
public void testClear() { |
558 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
559 |
q.clear(); |
560 |
assertTrue(q.isEmpty()); |
561 |
assertEquals(0, q.size()); |
562 |
assertEquals(SIZE, q.remainingCapacity()); |
563 |
q.add(one); |
564 |
assertFalse(q.isEmpty()); |
565 |
assertTrue(q.contains(one)); |
566 |
q.clear(); |
567 |
assertTrue(q.isEmpty()); |
568 |
} |
569 |
|
570 |
/** |
571 |
* containsAll(c) is true when c contains a subset of elements |
572 |
*/ |
573 |
public void testContainsAll() { |
574 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
575 |
LinkedBlockingQueue p = new LinkedBlockingQueue(SIZE); |
576 |
for (int i = 0; i < SIZE; ++i) { |
577 |
assertTrue(q.containsAll(p)); |
578 |
assertFalse(p.containsAll(q)); |
579 |
p.add(new Integer(i)); |
580 |
} |
581 |
assertTrue(p.containsAll(q)); |
582 |
} |
583 |
|
584 |
/** |
585 |
* retainAll(c) retains only those elements of c and reports true if changed |
586 |
*/ |
587 |
public void testRetainAll() { |
588 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
589 |
LinkedBlockingQueue p = populatedQueue(SIZE); |
590 |
for (int i = 0; i < SIZE; ++i) { |
591 |
boolean changed = q.retainAll(p); |
592 |
if (i == 0) |
593 |
assertFalse(changed); |
594 |
else |
595 |
assertTrue(changed); |
596 |
|
597 |
assertTrue(q.containsAll(p)); |
598 |
assertEquals(SIZE - i, q.size()); |
599 |
p.remove(); |
600 |
} |
601 |
} |
602 |
|
603 |
/** |
604 |
* removeAll(c) removes only those elements of c and reports true if changed |
605 |
*/ |
606 |
public void testRemoveAll() { |
607 |
for (int i = 1; i < SIZE; ++i) { |
608 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
609 |
LinkedBlockingQueue p = populatedQueue(i); |
610 |
assertTrue(q.removeAll(p)); |
611 |
assertEquals(SIZE - i, q.size()); |
612 |
for (int j = 0; j < i; ++j) { |
613 |
Integer x = (Integer)(p.remove()); |
614 |
assertFalse(q.contains(x)); |
615 |
} |
616 |
} |
617 |
} |
618 |
|
619 |
/** |
620 |
* toArray contains all elements in FIFO order |
621 |
*/ |
622 |
public void testToArray() { |
623 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
624 |
Object[] o = q.toArray(); |
625 |
for (int i = 0; i < o.length; i++) |
626 |
assertSame(o[i], q.poll()); |
627 |
} |
628 |
|
629 |
/** |
630 |
* toArray(a) contains all elements in FIFO order |
631 |
*/ |
632 |
public void testToArray2() throws InterruptedException { |
633 |
LinkedBlockingQueue<Integer> q = populatedQueue(SIZE); |
634 |
Integer[] ints = new Integer[SIZE]; |
635 |
Integer[] array = q.toArray(ints); |
636 |
assertSame(ints, array); |
637 |
for (int i = 0; i < ints.length; i++) |
638 |
assertSame(ints[i], q.poll()); |
639 |
} |
640 |
|
641 |
/** |
642 |
* toArray(incompatible array type) throws ArrayStoreException |
643 |
*/ |
644 |
public void testToArray1_BadArg() { |
645 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
646 |
try { |
647 |
q.toArray(new String[10]); |
648 |
shouldThrow(); |
649 |
} catch (ArrayStoreException success) {} |
650 |
} |
651 |
|
652 |
/** |
653 |
* iterator iterates through all elements |
654 |
*/ |
655 |
public void testIterator() throws InterruptedException { |
656 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
657 |
Iterator it = q.iterator(); |
658 |
int i; |
659 |
for (i = 0; it.hasNext(); i++) |
660 |
assertTrue(q.contains(it.next())); |
661 |
assertEquals(i, SIZE); |
662 |
assertIteratorExhausted(it); |
663 |
|
664 |
it = q.iterator(); |
665 |
for (i = 0; it.hasNext(); i++) |
666 |
assertEquals(it.next(), q.take()); |
667 |
assertEquals(i, SIZE); |
668 |
assertIteratorExhausted(it); |
669 |
} |
670 |
|
671 |
/** |
672 |
* iterator of empty collection has no elements |
673 |
*/ |
674 |
public void testEmptyIterator() { |
675 |
assertIteratorExhausted(new LinkedBlockingQueue().iterator()); |
676 |
} |
677 |
|
678 |
/** |
679 |
* iterator.remove removes current element |
680 |
*/ |
681 |
public void testIteratorRemove() { |
682 |
final LinkedBlockingQueue q = new LinkedBlockingQueue(3); |
683 |
q.add(two); |
684 |
q.add(one); |
685 |
q.add(three); |
686 |
|
687 |
Iterator it = q.iterator(); |
688 |
it.next(); |
689 |
it.remove(); |
690 |
|
691 |
it = q.iterator(); |
692 |
assertSame(it.next(), one); |
693 |
assertSame(it.next(), three); |
694 |
assertFalse(it.hasNext()); |
695 |
} |
696 |
|
697 |
/** |
698 |
* iterator ordering is FIFO |
699 |
*/ |
700 |
public void testIteratorOrdering() { |
701 |
final LinkedBlockingQueue q = new LinkedBlockingQueue(3); |
702 |
q.add(one); |
703 |
q.add(two); |
704 |
q.add(three); |
705 |
assertEquals(0, q.remainingCapacity()); |
706 |
int k = 0; |
707 |
for (Iterator it = q.iterator(); it.hasNext();) { |
708 |
assertEquals(++k, it.next()); |
709 |
} |
710 |
assertEquals(3, k); |
711 |
} |
712 |
|
713 |
/** |
714 |
* Modifications do not cause iterators to fail |
715 |
*/ |
716 |
public void testWeaklyConsistentIteration() { |
717 |
final LinkedBlockingQueue q = new LinkedBlockingQueue(3); |
718 |
q.add(one); |
719 |
q.add(two); |
720 |
q.add(three); |
721 |
for (Iterator it = q.iterator(); it.hasNext();) { |
722 |
q.remove(); |
723 |
it.next(); |
724 |
} |
725 |
assertEquals(0, q.size()); |
726 |
} |
727 |
|
728 |
/** |
729 |
* toString contains toStrings of elements |
730 |
*/ |
731 |
public void testToString() { |
732 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
733 |
String s = q.toString(); |
734 |
for (int i = 0; i < SIZE; ++i) { |
735 |
assertTrue(s.contains(String.valueOf(i))); |
736 |
} |
737 |
} |
738 |
|
739 |
/** |
740 |
* offer transfers elements across Executor tasks |
741 |
*/ |
742 |
public void testOfferInExecutor() { |
743 |
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
744 |
q.add(one); |
745 |
q.add(two); |
746 |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
747 |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
748 |
try (PoolCleaner cleaner = cleaner(executor)) { |
749 |
executor.execute(new CheckedRunnable() { |
750 |
public void realRun() throws InterruptedException { |
751 |
assertFalse(q.offer(three)); |
752 |
threadsStarted.await(); |
753 |
assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS)); |
754 |
assertEquals(0, q.remainingCapacity()); |
755 |
}}); |
756 |
|
757 |
executor.execute(new CheckedRunnable() { |
758 |
public void realRun() throws InterruptedException { |
759 |
threadsStarted.await(); |
760 |
assertSame(one, q.take()); |
761 |
}}); |
762 |
} |
763 |
} |
764 |
|
765 |
/** |
766 |
* timed poll retrieves elements across Executor threads |
767 |
*/ |
768 |
public void testPollInExecutor() { |
769 |
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
770 |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
771 |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
772 |
try (PoolCleaner cleaner = cleaner(executor)) { |
773 |
executor.execute(new CheckedRunnable() { |
774 |
public void realRun() throws InterruptedException { |
775 |
assertNull(q.poll()); |
776 |
threadsStarted.await(); |
777 |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
778 |
checkEmpty(q); |
779 |
}}); |
780 |
|
781 |
executor.execute(new CheckedRunnable() { |
782 |
public void realRun() throws InterruptedException { |
783 |
threadsStarted.await(); |
784 |
q.put(one); |
785 |
}}); |
786 |
} |
787 |
} |
788 |
|
789 |
/** |
790 |
* A deserialized serialized queue has same elements in same order |
791 |
*/ |
792 |
public void testSerialization() throws Exception { |
793 |
Queue x = populatedQueue(SIZE); |
794 |
Queue y = serialClone(x); |
795 |
|
796 |
assertNotSame(x, y); |
797 |
assertEquals(x.size(), y.size()); |
798 |
assertEquals(x.toString(), y.toString()); |
799 |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
800 |
while (!x.isEmpty()) { |
801 |
assertFalse(y.isEmpty()); |
802 |
assertEquals(x.remove(), y.remove()); |
803 |
} |
804 |
assertTrue(y.isEmpty()); |
805 |
} |
806 |
|
807 |
/** |
808 |
* drainTo(c) empties queue into another collection c |
809 |
*/ |
810 |
public void testDrainTo() { |
811 |
LinkedBlockingQueue q = populatedQueue(SIZE); |
812 |
ArrayList l = new ArrayList(); |
813 |
q.drainTo(l); |
814 |
assertEquals(0, q.size()); |
815 |
assertEquals(SIZE, l.size()); |
816 |
for (int i = 0; i < SIZE; ++i) |
817 |
assertEquals(l.get(i), new Integer(i)); |
818 |
q.add(zero); |
819 |
q.add(one); |
820 |
assertFalse(q.isEmpty()); |
821 |
assertTrue(q.contains(zero)); |
822 |
assertTrue(q.contains(one)); |
823 |
l.clear(); |
824 |
q.drainTo(l); |
825 |
assertEquals(0, q.size()); |
826 |
assertEquals(2, l.size()); |
827 |
for (int i = 0; i < 2; ++i) |
828 |
assertEquals(l.get(i), new Integer(i)); |
829 |
} |
830 |
|
831 |
/** |
832 |
* drainTo empties full queue, unblocking a waiting put. |
833 |
*/ |
834 |
public void testDrainToWithActivePut() throws InterruptedException { |
835 |
final LinkedBlockingQueue q = populatedQueue(SIZE); |
836 |
Thread t = new Thread(new CheckedRunnable() { |
837 |
public void realRun() throws InterruptedException { |
838 |
q.put(new Integer(SIZE + 1)); |
839 |
}}); |
840 |
|
841 |
t.start(); |
842 |
ArrayList l = new ArrayList(); |
843 |
q.drainTo(l); |
844 |
assertTrue(l.size() >= SIZE); |
845 |
for (int i = 0; i < SIZE; ++i) |
846 |
assertEquals(l.get(i), new Integer(i)); |
847 |
t.join(); |
848 |
assertTrue(q.size() + l.size() >= SIZE); |
849 |
} |
850 |
|
851 |
/** |
852 |
* drainTo(c, n) empties first min(n, size) elements of queue into c |
853 |
*/ |
854 |
public void testDrainToN() { |
855 |
LinkedBlockingQueue q = new LinkedBlockingQueue(); |
856 |
for (int i = 0; i < SIZE + 2; ++i) { |
857 |
for (int j = 0; j < SIZE; j++) |
858 |
assertTrue(q.offer(new Integer(j))); |
859 |
ArrayList l = new ArrayList(); |
860 |
q.drainTo(l, i); |
861 |
int k = (i < SIZE) ? i : SIZE; |
862 |
assertEquals(k, l.size()); |
863 |
assertEquals(SIZE - k, q.size()); |
864 |
for (int j = 0; j < k; ++j) |
865 |
assertEquals(l.get(j), new Integer(j)); |
866 |
do {} while (q.poll() != null); |
867 |
} |
868 |
} |
869 |
|
870 |
/** |
871 |
* remove(null), contains(null) always return false |
872 |
*/ |
873 |
public void testNeverContainsNull() { |
874 |
Collection<?>[] qs = { |
875 |
new LinkedBlockingQueue<Object>(), |
876 |
populatedQueue(2), |
877 |
}; |
878 |
|
879 |
for (Collection<?> q : qs) { |
880 |
assertFalse(q.contains(null)); |
881 |
assertFalse(q.remove(null)); |
882 |
} |
883 |
} |
884 |
|
885 |
} |