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