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