[cvs] / jsr166 / src / test / tck / ArrayBlockingQueueTest.java Repository:
ViewVC logotype

Annotation of /jsr166/src/test/tck/ArrayBlockingQueueTest.java

Parent Directory Parent Directory | Revision Log Revision Log


Revision 1.77 - (view) (download)

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

Doug Lea
ViewVC Help
Powered by ViewVC 1.0.8