[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.85 - (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 : jsr166 1.78 for (int i = 0; i < SIZE; i++) assertTrue(q.add((Integer) i));
235 : jsr166 1.63 assertEquals(0, q.remainingCapacity());
236 : jsr166 1.15 try {
237 : jsr166 1.78 q.add((Integer) SIZE);
238 : jsr166 1.17 shouldThrow();
239 :     } catch (IllegalStateException success) {}
240 : dl 1.1 }
241 :    
242 : dl 1.4 /**
243 : dl 1.6 * addAll(this) throws IAE
244 :     */
245 :     public void testAddAllSelf() {
246 : jsr166 1.63 ArrayBlockingQueue q = populatedQueue(SIZE);
247 : dl 1.6 try {
248 :     q.addAll(q);
249 :     shouldThrow();
250 : jsr166 1.17 } catch (IllegalArgumentException success) {}
251 : dl 1.6 }
252 :    
253 : dl 1.4 /**
254 : dl 1.5 * addAll of a collection with any null elements throws NPE after
255 :     * possibly adding some elements
256 : dl 1.4 */
257 :     public void testAddAll3() {
258 : jsr166 1.63 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
259 :     Integer[] ints = new Integer[SIZE];
260 : jsr166 1.66 for (int i = 0; i < SIZE - 1; ++i)
261 : jsr166 1.63 ints[i] = new Integer(i);
262 : dl 1.1 try {
263 :     q.addAll(Arrays.asList(ints));
264 : dl 1.4 shouldThrow();
265 : jsr166 1.17 } catch (NullPointerException success) {}
266 : dl 1.1 }
267 : jsr166 1.30
268 : dl 1.4 /**
269 : dl 1.5 * addAll throws ISE if not enough room
270 : dl 1.4 */
271 : jsr166 1.78 public void testAddAll_insufficientSpace() {
272 : jsr166 1.80 int size = ThreadLocalRandom.current().nextInt(1, SIZE);
273 : jsr166 1.78 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 : dl 1.1 try {
280 : jsr166 1.78 q = populatedQueue(0, size, size, false);
281 :     q.addAll(Collections.nCopies(size + 1, 42));
282 : dl 1.4 shouldThrow();
283 : jsr166 1.17 } catch (IllegalStateException success) {}
284 : dl 1.1 }
285 : jsr166 1.30
286 : dl 1.4 /**
287 : dl 1.5 * Queue contains all elements, in traversal order, of successful addAll
288 : dl 1.4 */
289 :     public void testAddAll5() {
290 : jsr166 1.17 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 : dl 1.1 }
300 :    
301 : dl 1.4 /**
302 : dl 1.5 * all elements successfully put are contained
303 : dl 1.4 */
304 : jsr166 1.17 public void testPut() throws InterruptedException {
305 :     ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
306 :     for (int i = 0; i < SIZE; ++i) {
307 : jsr166 1.60 Integer x = new Integer(i);
308 :     q.put(x);
309 :     assertTrue(q.contains(x));
310 : dl 1.1 }
311 : jsr166 1.17 assertEquals(0, q.remainingCapacity());
312 : dl 1.1 }
313 :    
314 : dl 1.4 /**
315 : dl 1.5 * put blocks interruptibly if full
316 : dl 1.4 */
317 : jsr166 1.17 public void testBlockingPut() throws InterruptedException {
318 : dl 1.10 final ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
319 : jsr166 1.47 final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
320 :     Thread t = newStartedThread(new CheckedRunnable() {
321 : jsr166 1.25 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 : jsr166 1.47
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 : jsr166 1.17 try {
336 : jsr166 1.25 q.put(99);
337 :     shouldThrow();
338 :     } catch (InterruptedException success) {}
339 : jsr166 1.47 assertFalse(Thread.interrupted());
340 : jsr166 1.25 }});
341 : jsr166 1.17
342 : jsr166 1.47 await(pleaseInterrupt);
343 : jsr166 1.84 assertThreadBlocks(t, Thread.State.WAITING);
344 : jsr166 1.17 t.interrupt();
345 : jsr166 1.47 awaitTermination(t);
346 : jsr166 1.25 assertEquals(SIZE, q.size());
347 :     assertEquals(0, q.remainingCapacity());
348 : dl 1.1 }
349 :    
350 : dl 1.4 /**
351 : jsr166 1.47 * put blocks interruptibly waiting for take when full
352 : dl 1.4 */
353 : jsr166 1.17 public void testPutWithTake() throws InterruptedException {
354 : jsr166 1.27 final int capacity = 2;
355 :     final ArrayBlockingQueue q = new ArrayBlockingQueue(capacity);
356 : jsr166 1.47 final CountDownLatch pleaseTake = new CountDownLatch(1);
357 :     final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
358 :     Thread t = newStartedThread(new CheckedRunnable() {
359 : jsr166 1.27 public void realRun() throws InterruptedException {
360 : jsr166 1.47 for (int i = 0; i < capacity; i++)
361 : jsr166 1.27 q.put(i);
362 : jsr166 1.47 pleaseTake.countDown();
363 :     q.put(86);
364 :    
365 :     pleaseInterrupt.countDown();
366 : jsr166 1.17 try {
367 : jsr166 1.27 q.put(99);
368 :     shouldThrow();
369 :     } catch (InterruptedException success) {}
370 : jsr166 1.47 assertFalse(Thread.interrupted());
371 : jsr166 1.17 }});
372 :    
373 : jsr166 1.47 await(pleaseTake);
374 : jsr166 1.51 assertEquals(0, q.remainingCapacity());
375 : jsr166 1.27 assertEquals(0, q.take());
376 : jsr166 1.47
377 :     await(pleaseInterrupt);
378 : jsr166 1.83 assertThreadBlocks(t, Thread.State.WAITING);
379 : jsr166 1.17 t.interrupt();
380 : jsr166 1.47 awaitTermination(t);
381 : jsr166 1.51 assertEquals(0, q.remainingCapacity());
382 : dl 1.1 }
383 :    
384 : dl 1.4 /**
385 : dl 1.5 * timed offer times out if full and elements not taken
386 : dl 1.4 */
387 : jsr166 1.17 public void testTimedOffer() throws InterruptedException {
388 : dl 1.1 final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
389 : jsr166 1.46 final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
390 :     Thread t = newStartedThread(new CheckedRunnable() {
391 : jsr166 1.17 public void realRun() throws InterruptedException {
392 :     q.put(new Object());
393 :     q.put(new Object());
394 : jsr166 1.46 long startTime = System.nanoTime();
395 :     assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
396 :     assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
397 :     pleaseInterrupt.countDown();
398 : jsr166 1.24 try {
399 : jsr166 1.46 q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
400 : jsr166 1.24 shouldThrow();
401 :     } catch (InterruptedException success) {}
402 :     }});
403 : jsr166 1.17
404 : jsr166 1.46 await(pleaseInterrupt);
405 : jsr166 1.84 assertThreadBlocks(t, Thread.State.TIMED_WAITING);
406 : jsr166 1.17 t.interrupt();
407 : jsr166 1.46 awaitTermination(t);
408 : dl 1.1 }
409 :    
410 : dl 1.4 /**
411 : dl 1.5 * take retrieves elements in FIFO order
412 : dl 1.4 */
413 : jsr166 1.17 public void testTake() throws InterruptedException {
414 :     ArrayBlockingQueue q = populatedQueue(SIZE);
415 :     for (int i = 0; i < SIZE; ++i) {
416 : jsr166 1.25 assertEquals(i, q.take());
417 : jsr166 1.15 }
418 : dl 1.1 }
419 :    
420 : dl 1.4 /**
421 : dl 1.5 * Take removes existing elements until empty, then blocks interruptibly
422 : dl 1.4 */
423 : jsr166 1.17 public void testBlockingTake() throws InterruptedException {
424 : jsr166 1.25 final ArrayBlockingQueue q = populatedQueue(SIZE);
425 : jsr166 1.47 final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
426 :     Thread t = newStartedThread(new CheckedRunnable() {
427 : jsr166 1.17 public void realRun() throws InterruptedException {
428 : jsr166 1.82 for (int i = 0; i < SIZE; i++) assertEquals(i, q.take());
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 : jsr166 1.82 assertThreadBlocks(t, Thread.State.WAITING);
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.85 assertThreadBlocks(t, Thread.State.TIMED_WAITING);
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 : jsr166 1.79 int size = ThreadLocalRandom.current().nextInt(1, SIZE);
567 :     ArrayBlockingQueue q = populatedQueue(size, size, 2 * size, false);
568 :     assertFalse(q.contains(null));
569 :     for (int i = 0; i < size; ++i) {
570 : dl 1.1 assertTrue(q.contains(new Integer(i)));
571 : jsr166 1.26 assertEquals(i, q.poll());
572 : dl 1.1 assertFalse(q.contains(new Integer(i)));
573 :     }
574 :     }
575 :    
576 : dl 1.4 /**
577 : dl 1.5 * clear removes all elements
578 : dl 1.4 */
579 :     public void testClear() {
580 : jsr166 1.81 int size = ThreadLocalRandom.current().nextInt(1, 5);
581 :     ArrayBlockingQueue q = populatedQueue(size, size, 2 * size, false);
582 :     int capacity = size + q.remainingCapacity();
583 : dl 1.1 q.clear();
584 :     assertTrue(q.isEmpty());
585 :     assertEquals(0, q.size());
586 : jsr166 1.81 assertEquals(capacity, q.remainingCapacity());
587 : dl 1.3 q.add(one);
588 : dl 1.1 assertFalse(q.isEmpty());
589 : dl 1.11 assertTrue(q.contains(one));
590 : dl 1.1 q.clear();
591 :     assertTrue(q.isEmpty());
592 :     }
593 :    
594 : dl 1.4 /**
595 : dl 1.5 * containsAll(c) is true when c contains a subset of elements
596 : dl 1.4 */
597 :     public void testContainsAll() {
598 : dl 1.3 ArrayBlockingQueue q = populatedQueue(SIZE);
599 :     ArrayBlockingQueue p = new ArrayBlockingQueue(SIZE);
600 :     for (int i = 0; i < SIZE; ++i) {
601 : dl 1.1 assertTrue(q.containsAll(p));
602 :     assertFalse(p.containsAll(q));
603 :     p.add(new Integer(i));
604 :     }
605 :     assertTrue(p.containsAll(q));
606 :     }
607 :    
608 : dl 1.4 /**
609 : dl 1.5 * retainAll(c) retains only those elements of c and reports true if changed
610 : dl 1.4 */
611 :     public void testRetainAll() {
612 : dl 1.3 ArrayBlockingQueue q = populatedQueue(SIZE);
613 :     ArrayBlockingQueue p = populatedQueue(SIZE);
614 :     for (int i = 0; i < SIZE; ++i) {
615 : dl 1.1 boolean changed = q.retainAll(p);
616 :     if (i == 0)
617 :     assertFalse(changed);
618 :     else
619 :     assertTrue(changed);
620 :    
621 :     assertTrue(q.containsAll(p));
622 : jsr166 1.66 assertEquals(SIZE - i, q.size());
623 : dl 1.1 p.remove();
624 :     }
625 :     }
626 :    
627 : dl 1.4 /**
628 : dl 1.5 * removeAll(c) removes only those elements of c and reports true if changed
629 : dl 1.4 */
630 :     public void testRemoveAll() {
631 : dl 1.3 for (int i = 1; i < SIZE; ++i) {
632 :     ArrayBlockingQueue q = populatedQueue(SIZE);
633 :     ArrayBlockingQueue p = populatedQueue(i);
634 : dl 1.1 assertTrue(q.removeAll(p));
635 : jsr166 1.66 assertEquals(SIZE - i, q.size());
636 : dl 1.1 for (int j = 0; j < i; ++j) {
637 : jsr166 1.60 Integer x = (Integer)(p.remove());
638 :     assertFalse(q.contains(x));
639 : dl 1.1 }
640 :     }
641 :     }
642 :    
643 : jsr166 1.74 void checkToArray(ArrayBlockingQueue<Integer> q) {
644 : jsr166 1.55 int size = q.size();
645 : jsr166 1.74 Object[] a1 = q.toArray();
646 :     assertEquals(size, a1.length);
647 :     Integer[] a2 = q.toArray(new Integer[0]);
648 :     assertEquals(size, a2.length);
649 :     Integer[] a3 = q.toArray(new Integer[Math.max(0, size - 1)]);
650 :     assertEquals(size, a3.length);
651 :     Integer[] a4 = new Integer[size];
652 :     assertSame(a4, q.toArray(a4));
653 :     Integer[] a5 = new Integer[size + 1];
654 :     Arrays.fill(a5, 42);
655 :     assertSame(a5, q.toArray(a5));
656 :     Integer[] a6 = new Integer[size + 2];
657 :     Arrays.fill(a6, 42);
658 :     assertSame(a6, q.toArray(a6));
659 :     Object[][] as = { a1, a2, a3, a4, a5, a6 };
660 :     for (Object[] a : as) {
661 :     if (a.length > size) assertNull(a[size]);
662 :     if (a.length > size + 1) assertEquals(42, a[size + 1]);
663 :     }
664 : jsr166 1.55 Iterator it = q.iterator();
665 : jsr166 1.74 Integer s = q.peek();
666 : jsr166 1.55 for (int i = 0; i < size; i++) {
667 :     Integer x = (Integer) it.next();
668 : jsr166 1.74 assertEquals(s + i, (int) x);
669 :     for (Object[] a : as)
670 :     assertSame(a1[i], x);
671 : jsr166 1.55 }
672 :     }
673 :    
674 : dl 1.4 /**
675 : jsr166 1.74 * toArray() and toArray(a) contain all elements in FIFO order
676 : dl 1.4 */
677 : jsr166 1.40 public void testToArray() {
678 : jsr166 1.74 final ThreadLocalRandom rnd = ThreadLocalRandom.current();
679 :     final int size = rnd.nextInt(6);
680 :     final int capacity = Math.max(1, size + rnd.nextInt(size + 1));
681 :     ArrayBlockingQueue<Integer> q = new ArrayBlockingQueue<>(capacity);
682 :     for (int i = 0; i < size; i++) {
683 : jsr166 1.55 checkToArray(q);
684 :     q.add(i);
685 :     }
686 :     // Provoke wraparound
687 : jsr166 1.74 int added = size * 2;
688 :     for (int i = 0; i < added; i++) {
689 : jsr166 1.55 checkToArray(q);
690 : jsr166 1.74 assertEquals((Integer) i, q.poll());
691 :     q.add(size + i);
692 : jsr166 1.55 }
693 : jsr166 1.74 for (int i = 0; i < size; i++) {
694 : jsr166 1.55 checkToArray(q);
695 : jsr166 1.74 assertEquals((Integer) (added + i), q.poll());
696 : jsr166 1.55 }
697 : dl 1.1 }
698 : dl 1.6
699 :     /**
700 : jsr166 1.38 * toArray(incompatible array type) throws ArrayStoreException
701 : dl 1.6 */
702 : jsr166 1.74 public void testToArray_incompatibleArrayType() {
703 : jsr166 1.26 ArrayBlockingQueue q = populatedQueue(SIZE);
704 : jsr166 1.15 try {
705 : jsr166 1.38 q.toArray(new String[10]);
706 : jsr166 1.15 shouldThrow();
707 : jsr166 1.18 } catch (ArrayStoreException success) {}
708 : jsr166 1.74 try {
709 :     q.toArray(new String[0]);
710 :     shouldThrow();
711 :     } catch (ArrayStoreException success) {}
712 : dl 1.6 }
713 :    
714 : dl 1.4 /**
715 : dl 1.5 * iterator iterates through all elements
716 : dl 1.4 */
717 : jsr166 1.17 public void testIterator() throws InterruptedException {
718 : dl 1.3 ArrayBlockingQueue q = populatedQueue(SIZE);
719 : jsr166 1.15 Iterator it = q.iterator();
720 : jsr166 1.61 int i;
721 :     for (i = 0; it.hasNext(); i++)
722 :     assertTrue(q.contains(it.next()));
723 :     assertEquals(i, SIZE);
724 :     assertIteratorExhausted(it);
725 :    
726 :     it = q.iterator();
727 :     for (i = 0; it.hasNext(); i++)
728 : jsr166 1.17 assertEquals(it.next(), q.take());
729 : jsr166 1.61 assertEquals(i, SIZE);
730 :     assertIteratorExhausted(it);
731 :     }
732 :    
733 :     /**
734 :     * iterator of empty collection has no elements
735 :     */
736 :     public void testEmptyIterator() {
737 :     assertIteratorExhausted(new ArrayBlockingQueue(SIZE).iterator());
738 : dl 1.1 }
739 :    
740 : dl 1.4 /**
741 : dl 1.5 * iterator.remove removes current element
742 :     */
743 : jsr166 1.29 public void testIteratorRemove() {
744 : dl 1.5 final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
745 :     q.add(two);
746 :     q.add(one);
747 :     q.add(three);
748 :    
749 :     Iterator it = q.iterator();
750 :     it.next();
751 :     it.remove();
752 : jsr166 1.12
753 : dl 1.5 it = q.iterator();
754 : jsr166 1.28 assertSame(it.next(), one);
755 :     assertSame(it.next(), three);
756 : dl 1.5 assertFalse(it.hasNext());
757 :     }
758 :    
759 :     /**
760 :     * iterator ordering is FIFO
761 : dl 1.4 */
762 : dl 1.1 public void testIteratorOrdering() {
763 :     final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
764 : dl 1.3 q.add(one);
765 :     q.add(two);
766 :     q.add(three);
767 : dl 1.1
768 :     assertEquals("queue should be full", 0, q.remainingCapacity());
769 :    
770 :     int k = 0;
771 :     for (Iterator it = q.iterator(); it.hasNext();) {
772 : jsr166 1.26 assertEquals(++k, it.next());
773 : dl 1.1 }
774 : dl 1.4 assertEquals(3, k);
775 : dl 1.1 }
776 :    
777 : dl 1.4 /**
778 : dl 1.5 * Modifications do not cause iterators to fail
779 : dl 1.4 */
780 : jsr166 1.29 public void testWeaklyConsistentIteration() {
781 : dl 1.1 final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
782 : dl 1.3 q.add(one);
783 :     q.add(two);
784 :     q.add(three);
785 : jsr166 1.17 for (Iterator it = q.iterator(); it.hasNext();) {
786 :     q.remove();
787 :     it.next();
788 : dl 1.1 }
789 : dl 1.4 assertEquals(0, q.size());
790 : dl 1.1 }
791 :    
792 : dl 1.4 /**
793 : dl 1.5 * toString contains toStrings of elements
794 : dl 1.4 */
795 :     public void testToString() {
796 : dl 1.3 ArrayBlockingQueue q = populatedQueue(SIZE);
797 : dl 1.1 String s = q.toString();
798 : dl 1.3 for (int i = 0; i < SIZE; ++i) {
799 : jsr166 1.47 assertTrue(s.contains(String.valueOf(i)));
800 : dl 1.1 }
801 : jsr166 1.12 }
802 : dl 1.1
803 : dl 1.4 /**
804 : dl 1.5 * offer transfers elements across Executor tasks
805 : dl 1.4 */
806 : dl 1.1 public void testOfferInExecutor() {
807 :     final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
808 : dl 1.3 q.add(one);
809 :     q.add(two);
810 : jsr166 1.47 final CheckedBarrier threadsStarted = new CheckedBarrier(2);
811 : jsr166 1.68 final ExecutorService executor = Executors.newFixedThreadPool(2);
812 :     try (PoolCleaner cleaner = cleaner(executor)) {
813 :     executor.execute(new CheckedRunnable() {
814 :     public void realRun() throws InterruptedException {
815 :     assertFalse(q.offer(three));
816 :     threadsStarted.await();
817 :     assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
818 :     assertEquals(0, q.remainingCapacity());
819 :     }});
820 :    
821 :     executor.execute(new CheckedRunnable() {
822 :     public void realRun() throws InterruptedException {
823 :     threadsStarted.await();
824 :     assertEquals(0, q.remainingCapacity());
825 :     assertSame(one, q.take());
826 :     }});
827 :     }
828 : dl 1.1 }
829 :    
830 : dl 1.4 /**
831 : jsr166 1.47 * timed poll retrieves elements across Executor threads
832 : dl 1.4 */
833 : dl 1.1 public void testPollInExecutor() {
834 :     final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
835 : jsr166 1.47 final CheckedBarrier threadsStarted = new CheckedBarrier(2);
836 : jsr166 1.68 final ExecutorService executor = Executors.newFixedThreadPool(2);
837 :     try (PoolCleaner cleaner = cleaner(executor)) {
838 :     executor.execute(new CheckedRunnable() {
839 :     public void realRun() throws InterruptedException {
840 :     assertNull(q.poll());
841 :     threadsStarted.await();
842 :     assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
843 :     checkEmpty(q);
844 :     }});
845 :    
846 :     executor.execute(new CheckedRunnable() {
847 :     public void realRun() throws InterruptedException {
848 :     threadsStarted.await();
849 :     q.put(one);
850 :     }});
851 :     }
852 : dl 1.1 }
853 : dl 1.2
854 : dl 1.4 /**
855 : dl 1.5 * A deserialized serialized queue has same elements in same order
856 : dl 1.4 */
857 : jsr166 1.17 public void testSerialization() throws Exception {
858 : jsr166 1.49 Queue x = populatedQueue(SIZE);
859 :     Queue y = serialClone(x);
860 : dl 1.2
861 : jsr166 1.56 assertNotSame(x, y);
862 : jsr166 1.49 assertEquals(x.size(), y.size());
863 :     assertEquals(x.toString(), y.toString());
864 :     assertTrue(Arrays.equals(x.toArray(), y.toArray()));
865 :     while (!x.isEmpty()) {
866 :     assertFalse(y.isEmpty());
867 :     assertEquals(x.remove(), y.remove());
868 :     }
869 :     assertTrue(y.isEmpty());
870 : dl 1.6 }
871 :    
872 :     /**
873 :     * drainTo(c) empties queue into another collection c
874 : jsr166 1.12 */
875 : dl 1.6 public void testDrainTo() {
876 :     ArrayBlockingQueue q = populatedQueue(SIZE);
877 :     ArrayList l = new ArrayList();
878 :     q.drainTo(l);
879 : jsr166 1.51 assertEquals(0, q.size());
880 :     assertEquals(SIZE, l.size());
881 : jsr166 1.12 for (int i = 0; i < SIZE; ++i)
882 : dl 1.6 assertEquals(l.get(i), new Integer(i));
883 : dl 1.11 q.add(zero);
884 :     q.add(one);
885 :     assertFalse(q.isEmpty());
886 :     assertTrue(q.contains(zero));
887 :     assertTrue(q.contains(one));
888 :     l.clear();
889 :     q.drainTo(l);
890 : jsr166 1.51 assertEquals(0, q.size());
891 :     assertEquals(2, l.size());
892 : jsr166 1.12 for (int i = 0; i < 2; ++i)
893 : dl 1.11 assertEquals(l.get(i), new Integer(i));
894 : dl 1.6 }
895 :    
896 :     /**
897 :     * drainTo empties full queue, unblocking a waiting put.
898 : jsr166 1.12 */
899 : jsr166 1.17 public void testDrainToWithActivePut() throws InterruptedException {
900 : dl 1.6 final ArrayBlockingQueue q = populatedQueue(SIZE);
901 : jsr166 1.17 Thread t = new Thread(new CheckedRunnable() {
902 :     public void realRun() throws InterruptedException {
903 : jsr166 1.66 q.put(new Integer(SIZE + 1));
904 : jsr166 1.17 }});
905 :    
906 :     t.start();
907 :     ArrayList l = new ArrayList();
908 :     q.drainTo(l);
909 :     assertTrue(l.size() >= SIZE);
910 :     for (int i = 0; i < SIZE; ++i)
911 :     assertEquals(l.get(i), new Integer(i));
912 :     t.join();
913 :     assertTrue(q.size() + l.size() >= SIZE);
914 : dl 1.6 }
915 :    
916 :     /**
917 : jsr166 1.34 * drainTo(c, n) empties first min(n, size) elements of queue into c
918 : jsr166 1.12 */
919 : dl 1.6 public void testDrainToN() {
920 : jsr166 1.66 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE * 2);
921 : dl 1.6 for (int i = 0; i < SIZE + 2; ++i) {
922 : jsr166 1.13 for (int j = 0; j < SIZE; j++)
923 : dl 1.11 assertTrue(q.offer(new Integer(j)));
924 : dl 1.6 ArrayList l = new ArrayList();
925 :     q.drainTo(l, i);
926 : jsr166 1.35 int k = (i < SIZE) ? i : SIZE;
927 : jsr166 1.52 assertEquals(k, l.size());
928 : jsr166 1.66 assertEquals(SIZE - k, q.size());
929 : jsr166 1.12 for (int j = 0; j < k; ++j)
930 : dl 1.6 assertEquals(l.get(j), new Integer(j));
931 : jsr166 1.59 do {} while (q.poll() != null);
932 : dl 1.2 }
933 :     }
934 :    
935 : jsr166 1.57 /**
936 :     * remove(null), contains(null) always return false
937 :     */
938 :     public void testNeverContainsNull() {
939 :     Collection<?>[] qs = {
940 : jsr166 1.80 populatedQueue(0, 1, 10, false),
941 :     populatedQueue(2, 2, 10, true),
942 : jsr166 1.57 };
943 :    
944 :     for (Collection<?> q : qs) {
945 :     assertFalse(q.contains(null));
946 :     assertFalse(q.remove(null));
947 :     }
948 :     }
949 : dl 1.1 }

Doug Lea
ViewVC Help
Powered by ViewVC 1.0.8