[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.89 - (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 : jsr166 1.89 Thread.currentThread().interrupt();
366 :     try {
367 :     q.put(99);
368 :     shouldThrow();
369 :     } catch (InterruptedException success) {}
370 :     assertFalse(Thread.interrupted());
371 :    
372 : jsr166 1.47 pleaseInterrupt.countDown();
373 : jsr166 1.17 try {
374 : jsr166 1.27 q.put(99);
375 :     shouldThrow();
376 :     } catch (InterruptedException success) {}
377 : jsr166 1.47 assertFalse(Thread.interrupted());
378 : jsr166 1.17 }});
379 :    
380 : jsr166 1.47 await(pleaseTake);
381 : jsr166 1.51 assertEquals(0, q.remainingCapacity());
382 : jsr166 1.27 assertEquals(0, q.take());
383 : jsr166 1.47
384 :     await(pleaseInterrupt);
385 : jsr166 1.83 assertThreadBlocks(t, Thread.State.WAITING);
386 : jsr166 1.17 t.interrupt();
387 : jsr166 1.47 awaitTermination(t);
388 : jsr166 1.51 assertEquals(0, q.remainingCapacity());
389 : dl 1.1 }
390 :    
391 : dl 1.4 /**
392 : dl 1.5 * timed offer times out if full and elements not taken
393 : dl 1.4 */
394 : jsr166 1.17 public void testTimedOffer() throws InterruptedException {
395 : dl 1.1 final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
396 : jsr166 1.46 final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
397 :     Thread t = newStartedThread(new CheckedRunnable() {
398 : jsr166 1.17 public void realRun() throws InterruptedException {
399 :     q.put(new Object());
400 :     q.put(new Object());
401 : jsr166 1.46 long startTime = System.nanoTime();
402 :     assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
403 :     assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
404 :     pleaseInterrupt.countDown();
405 : jsr166 1.24 try {
406 : jsr166 1.46 q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
407 : jsr166 1.24 shouldThrow();
408 :     } catch (InterruptedException success) {}
409 : jsr166 1.87 assertFalse(Thread.interrupted());
410 : jsr166 1.24 }});
411 : jsr166 1.17
412 : jsr166 1.46 await(pleaseInterrupt);
413 : jsr166 1.84 assertThreadBlocks(t, Thread.State.TIMED_WAITING);
414 : jsr166 1.17 t.interrupt();
415 : jsr166 1.46 awaitTermination(t);
416 : dl 1.1 }
417 :    
418 : dl 1.4 /**
419 : dl 1.5 * take retrieves elements in FIFO order
420 : dl 1.4 */
421 : jsr166 1.17 public void testTake() throws InterruptedException {
422 :     ArrayBlockingQueue q = populatedQueue(SIZE);
423 :     for (int i = 0; i < SIZE; ++i) {
424 : jsr166 1.25 assertEquals(i, q.take());
425 : jsr166 1.15 }
426 : dl 1.1 }
427 :    
428 : dl 1.4 /**
429 : dl 1.5 * Take removes existing elements until empty, then blocks interruptibly
430 : dl 1.4 */
431 : jsr166 1.17 public void testBlockingTake() throws InterruptedException {
432 : jsr166 1.25 final ArrayBlockingQueue q = populatedQueue(SIZE);
433 : jsr166 1.47 final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
434 :     Thread t = newStartedThread(new CheckedRunnable() {
435 : jsr166 1.17 public void realRun() throws InterruptedException {
436 : jsr166 1.82 for (int i = 0; i < SIZE; i++) assertEquals(i, q.take());
437 : jsr166 1.47
438 :     Thread.currentThread().interrupt();
439 :     try {
440 :     q.take();
441 :     shouldThrow();
442 :     } catch (InterruptedException success) {}
443 :     assertFalse(Thread.interrupted());
444 :    
445 :     pleaseInterrupt.countDown();
446 : jsr166 1.25 try {
447 :     q.take();
448 :     shouldThrow();
449 :     } catch (InterruptedException success) {}
450 : jsr166 1.47 assertFalse(Thread.interrupted());
451 : jsr166 1.25 }});
452 : jsr166 1.17
453 : jsr166 1.47 await(pleaseInterrupt);
454 : jsr166 1.82 assertThreadBlocks(t, Thread.State.WAITING);
455 : jsr166 1.25 t.interrupt();
456 : jsr166 1.47 awaitTermination(t);
457 : dl 1.1 }
458 :    
459 : dl 1.4 /**
460 : dl 1.5 * poll succeeds unless empty
461 : dl 1.4 */
462 :     public void testPoll() {
463 : dl 1.3 ArrayBlockingQueue q = populatedQueue(SIZE);
464 :     for (int i = 0; i < SIZE; ++i) {
465 : jsr166 1.25 assertEquals(i, q.poll());
466 : dl 1.1 }
467 : jsr166 1.15 assertNull(q.poll());
468 : dl 1.1 }
469 :    
470 : dl 1.4 /**
471 : jsr166 1.37 * timed poll with zero timeout succeeds when non-empty, else times out
472 : dl 1.4 */
473 : jsr166 1.17 public void testTimedPoll0() throws InterruptedException {
474 :     ArrayBlockingQueue q = populatedQueue(SIZE);
475 :     for (int i = 0; i < SIZE; ++i) {
476 : jsr166 1.25 assertEquals(i, q.poll(0, MILLISECONDS));
477 : jsr166 1.15 }
478 : jsr166 1.17 assertNull(q.poll(0, MILLISECONDS));
479 : jsr166 1.47 checkEmpty(q);
480 : dl 1.1 }
481 :    
482 : dl 1.4 /**
483 : jsr166 1.37 * timed poll with nonzero timeout succeeds when non-empty, else times out
484 : dl 1.4 */
485 : jsr166 1.17 public void testTimedPoll() throws InterruptedException {
486 :     ArrayBlockingQueue q = populatedQueue(SIZE);
487 :     for (int i = 0; i < SIZE; ++i) {
488 : jsr166 1.47 long startTime = System.nanoTime();
489 :     assertEquals(i, q.poll(LONG_DELAY_MS, MILLISECONDS));
490 :     assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
491 :     }
492 :     long startTime = System.nanoTime();
493 :     assertNull(q.poll(timeoutMillis(), MILLISECONDS));
494 :     assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
495 :     checkEmpty(q);
496 : dl 1.1 }
497 :    
498 : dl 1.4 /**
499 : dl 1.5 * Interrupted timed poll throws InterruptedException instead of
500 :     * returning timeout status
501 : dl 1.4 */
502 : jsr166 1.17 public void testInterruptedTimedPoll() throws InterruptedException {
503 : jsr166 1.42 final BlockingQueue<Integer> q = populatedQueue(SIZE);
504 : jsr166 1.86 final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
505 : jsr166 1.42 Thread t = newStartedThread(new CheckedRunnable() {
506 : jsr166 1.17 public void realRun() throws InterruptedException {
507 : jsr166 1.70 long startTime = System.nanoTime();
508 : jsr166 1.88 for (int i = 0; i < SIZE; i++)
509 : jsr166 1.70 assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
510 : jsr166 1.88
511 :     Thread.currentThread().interrupt();
512 :     try {
513 :     q.poll(LONG_DELAY_MS, MILLISECONDS);
514 :     shouldThrow();
515 :     } catch (InterruptedException success) {}
516 :     assertFalse(Thread.interrupted());
517 : jsr166 1.86
518 :     pleaseInterrupt.countDown();
519 : jsr166 1.21 try {
520 : jsr166 1.70 q.poll(LONG_DELAY_MS, MILLISECONDS);
521 : jsr166 1.22 shouldThrow();
522 : jsr166 1.86 } catch (InterruptedException success) {}
523 :     assertFalse(Thread.interrupted());
524 :    
525 :     assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
526 : jsr166 1.21 }});
527 : jsr166 1.17
528 : jsr166 1.86 await(pleaseInterrupt);
529 : jsr166 1.85 assertThreadBlocks(t, Thread.State.TIMED_WAITING);
530 : jsr166 1.17 t.interrupt();
531 : jsr166 1.70 awaitTermination(t);
532 : jsr166 1.42 checkEmpty(q);
533 : dl 1.1 }
534 :    
535 : dl 1.4 /**
536 : dl 1.5 * peek returns next element, or null if empty
537 : dl 1.4 */
538 :     public void testPeek() {
539 : dl 1.3 ArrayBlockingQueue q = populatedQueue(SIZE);
540 :     for (int i = 0; i < SIZE; ++i) {
541 : jsr166 1.26 assertEquals(i, q.peek());
542 :     assertEquals(i, q.poll());
543 : dl 1.1 assertTrue(q.peek() == null ||
544 : jsr166 1.26 !q.peek().equals(i));
545 : dl 1.1 }
546 : jsr166 1.15 assertNull(q.peek());
547 : dl 1.1 }
548 :    
549 : dl 1.4 /**
550 : dl 1.5 * element returns next element, or throws NSEE if empty
551 : dl 1.4 */
552 :     public void testElement() {
553 : dl 1.3 ArrayBlockingQueue q = populatedQueue(SIZE);
554 :     for (int i = 0; i < SIZE; ++i) {
555 : jsr166 1.26 assertEquals(i, q.element());
556 :     assertEquals(i, q.poll());
557 : dl 1.1 }
558 :     try {
559 :     q.element();
560 : dl 1.4 shouldThrow();
561 : jsr166 1.17 } catch (NoSuchElementException success) {}
562 : dl 1.1 }
563 :    
564 : dl 1.4 /**
565 : dl 1.5 * remove removes next element, or throws NSEE if empty
566 : dl 1.4 */
567 :     public void testRemove() {
568 : dl 1.3 ArrayBlockingQueue q = populatedQueue(SIZE);
569 :     for (int i = 0; i < SIZE; ++i) {
570 : jsr166 1.26 assertEquals(i, q.remove());
571 : dl 1.1 }
572 :     try {
573 :     q.remove();
574 : dl 1.4 shouldThrow();
575 : jsr166 1.17 } catch (NoSuchElementException success) {}
576 : dl 1.1 }
577 :    
578 : dl 1.4 /**
579 : dl 1.5 * contains(x) reports true when elements added but not yet removed
580 : dl 1.4 */
581 :     public void testContains() {
582 : jsr166 1.79 int size = ThreadLocalRandom.current().nextInt(1, SIZE);
583 :     ArrayBlockingQueue q = populatedQueue(size, size, 2 * size, false);
584 :     assertFalse(q.contains(null));
585 :     for (int i = 0; i < size; ++i) {
586 : dl 1.1 assertTrue(q.contains(new Integer(i)));
587 : jsr166 1.26 assertEquals(i, q.poll());
588 : dl 1.1 assertFalse(q.contains(new Integer(i)));
589 :     }
590 :     }
591 :    
592 : dl 1.4 /**
593 : dl 1.5 * clear removes all elements
594 : dl 1.4 */
595 :     public void testClear() {
596 : jsr166 1.81 int size = ThreadLocalRandom.current().nextInt(1, 5);
597 :     ArrayBlockingQueue q = populatedQueue(size, size, 2 * size, false);
598 :     int capacity = size + q.remainingCapacity();
599 : dl 1.1 q.clear();
600 :     assertTrue(q.isEmpty());
601 :     assertEquals(0, q.size());
602 : jsr166 1.81 assertEquals(capacity, q.remainingCapacity());
603 : dl 1.3 q.add(one);
604 : dl 1.1 assertFalse(q.isEmpty());
605 : dl 1.11 assertTrue(q.contains(one));
606 : dl 1.1 q.clear();
607 :     assertTrue(q.isEmpty());
608 :     }
609 :    
610 : dl 1.4 /**
611 : dl 1.5 * containsAll(c) is true when c contains a subset of elements
612 : dl 1.4 */
613 :     public void testContainsAll() {
614 : dl 1.3 ArrayBlockingQueue q = populatedQueue(SIZE);
615 :     ArrayBlockingQueue p = new ArrayBlockingQueue(SIZE);
616 :     for (int i = 0; i < SIZE; ++i) {
617 : dl 1.1 assertTrue(q.containsAll(p));
618 :     assertFalse(p.containsAll(q));
619 :     p.add(new Integer(i));
620 :     }
621 :     assertTrue(p.containsAll(q));
622 :     }
623 :    
624 : dl 1.4 /**
625 : dl 1.5 * retainAll(c) retains only those elements of c and reports true if changed
626 : dl 1.4 */
627 :     public void testRetainAll() {
628 : dl 1.3 ArrayBlockingQueue q = populatedQueue(SIZE);
629 :     ArrayBlockingQueue p = populatedQueue(SIZE);
630 :     for (int i = 0; i < SIZE; ++i) {
631 : dl 1.1 boolean changed = q.retainAll(p);
632 :     if (i == 0)
633 :     assertFalse(changed);
634 :     else
635 :     assertTrue(changed);
636 :    
637 :     assertTrue(q.containsAll(p));
638 : jsr166 1.66 assertEquals(SIZE - i, q.size());
639 : dl 1.1 p.remove();
640 :     }
641 :     }
642 :    
643 : dl 1.4 /**
644 : dl 1.5 * removeAll(c) removes only those elements of c and reports true if changed
645 : dl 1.4 */
646 :     public void testRemoveAll() {
647 : dl 1.3 for (int i = 1; i < SIZE; ++i) {
648 :     ArrayBlockingQueue q = populatedQueue(SIZE);
649 :     ArrayBlockingQueue p = populatedQueue(i);
650 : dl 1.1 assertTrue(q.removeAll(p));
651 : jsr166 1.66 assertEquals(SIZE - i, q.size());
652 : dl 1.1 for (int j = 0; j < i; ++j) {
653 : jsr166 1.60 Integer x = (Integer)(p.remove());
654 :     assertFalse(q.contains(x));
655 : dl 1.1 }
656 :     }
657 :     }
658 :    
659 : jsr166 1.74 void checkToArray(ArrayBlockingQueue<Integer> q) {
660 : jsr166 1.55 int size = q.size();
661 : jsr166 1.74 Object[] a1 = q.toArray();
662 :     assertEquals(size, a1.length);
663 :     Integer[] a2 = q.toArray(new Integer[0]);
664 :     assertEquals(size, a2.length);
665 :     Integer[] a3 = q.toArray(new Integer[Math.max(0, size - 1)]);
666 :     assertEquals(size, a3.length);
667 :     Integer[] a4 = new Integer[size];
668 :     assertSame(a4, q.toArray(a4));
669 :     Integer[] a5 = new Integer[size + 1];
670 :     Arrays.fill(a5, 42);
671 :     assertSame(a5, q.toArray(a5));
672 :     Integer[] a6 = new Integer[size + 2];
673 :     Arrays.fill(a6, 42);
674 :     assertSame(a6, q.toArray(a6));
675 :     Object[][] as = { a1, a2, a3, a4, a5, a6 };
676 :     for (Object[] a : as) {
677 :     if (a.length > size) assertNull(a[size]);
678 :     if (a.length > size + 1) assertEquals(42, a[size + 1]);
679 :     }
680 : jsr166 1.55 Iterator it = q.iterator();
681 : jsr166 1.74 Integer s = q.peek();
682 : jsr166 1.55 for (int i = 0; i < size; i++) {
683 :     Integer x = (Integer) it.next();
684 : jsr166 1.74 assertEquals(s + i, (int) x);
685 :     for (Object[] a : as)
686 :     assertSame(a1[i], x);
687 : jsr166 1.55 }
688 :     }
689 :    
690 : dl 1.4 /**
691 : jsr166 1.74 * toArray() and toArray(a) contain all elements in FIFO order
692 : dl 1.4 */
693 : jsr166 1.40 public void testToArray() {
694 : jsr166 1.74 final ThreadLocalRandom rnd = ThreadLocalRandom.current();
695 :     final int size = rnd.nextInt(6);
696 :     final int capacity = Math.max(1, size + rnd.nextInt(size + 1));
697 :     ArrayBlockingQueue<Integer> q = new ArrayBlockingQueue<>(capacity);
698 :     for (int i = 0; i < size; i++) {
699 : jsr166 1.55 checkToArray(q);
700 :     q.add(i);
701 :     }
702 :     // Provoke wraparound
703 : jsr166 1.74 int added = size * 2;
704 :     for (int i = 0; i < added; i++) {
705 : jsr166 1.55 checkToArray(q);
706 : jsr166 1.74 assertEquals((Integer) i, q.poll());
707 :     q.add(size + i);
708 : jsr166 1.55 }
709 : jsr166 1.74 for (int i = 0; i < size; i++) {
710 : jsr166 1.55 checkToArray(q);
711 : jsr166 1.74 assertEquals((Integer) (added + i), q.poll());
712 : jsr166 1.55 }
713 : dl 1.1 }
714 : dl 1.6
715 :     /**
716 : jsr166 1.38 * toArray(incompatible array type) throws ArrayStoreException
717 : dl 1.6 */
718 : jsr166 1.74 public void testToArray_incompatibleArrayType() {
719 : jsr166 1.26 ArrayBlockingQueue q = populatedQueue(SIZE);
720 : jsr166 1.15 try {
721 : jsr166 1.38 q.toArray(new String[10]);
722 : jsr166 1.15 shouldThrow();
723 : jsr166 1.18 } catch (ArrayStoreException success) {}
724 : jsr166 1.74 try {
725 :     q.toArray(new String[0]);
726 :     shouldThrow();
727 :     } catch (ArrayStoreException success) {}
728 : dl 1.6 }
729 :    
730 : dl 1.4 /**
731 : dl 1.5 * iterator iterates through all elements
732 : dl 1.4 */
733 : jsr166 1.17 public void testIterator() throws InterruptedException {
734 : dl 1.3 ArrayBlockingQueue q = populatedQueue(SIZE);
735 : jsr166 1.15 Iterator it = q.iterator();
736 : jsr166 1.61 int i;
737 :     for (i = 0; it.hasNext(); i++)
738 :     assertTrue(q.contains(it.next()));
739 :     assertEquals(i, SIZE);
740 :     assertIteratorExhausted(it);
741 :    
742 :     it = q.iterator();
743 :     for (i = 0; it.hasNext(); i++)
744 : jsr166 1.17 assertEquals(it.next(), q.take());
745 : jsr166 1.61 assertEquals(i, SIZE);
746 :     assertIteratorExhausted(it);
747 :     }
748 :    
749 :     /**
750 :     * iterator of empty collection has no elements
751 :     */
752 :     public void testEmptyIterator() {
753 :     assertIteratorExhausted(new ArrayBlockingQueue(SIZE).iterator());
754 : dl 1.1 }
755 :    
756 : dl 1.4 /**
757 : dl 1.5 * iterator.remove removes current element
758 :     */
759 : jsr166 1.29 public void testIteratorRemove() {
760 : dl 1.5 final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
761 :     q.add(two);
762 :     q.add(one);
763 :     q.add(three);
764 :    
765 :     Iterator it = q.iterator();
766 :     it.next();
767 :     it.remove();
768 : jsr166 1.12
769 : dl 1.5 it = q.iterator();
770 : jsr166 1.28 assertSame(it.next(), one);
771 :     assertSame(it.next(), three);
772 : dl 1.5 assertFalse(it.hasNext());
773 :     }
774 :    
775 :     /**
776 :     * iterator ordering is FIFO
777 : dl 1.4 */
778 : dl 1.1 public void testIteratorOrdering() {
779 :     final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
780 : dl 1.3 q.add(one);
781 :     q.add(two);
782 :     q.add(three);
783 : dl 1.1
784 :     assertEquals("queue should be full", 0, q.remainingCapacity());
785 :    
786 :     int k = 0;
787 :     for (Iterator it = q.iterator(); it.hasNext();) {
788 : jsr166 1.26 assertEquals(++k, it.next());
789 : dl 1.1 }
790 : dl 1.4 assertEquals(3, k);
791 : dl 1.1 }
792 :    
793 : dl 1.4 /**
794 : dl 1.5 * Modifications do not cause iterators to fail
795 : dl 1.4 */
796 : jsr166 1.29 public void testWeaklyConsistentIteration() {
797 : dl 1.1 final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
798 : dl 1.3 q.add(one);
799 :     q.add(two);
800 :     q.add(three);
801 : jsr166 1.17 for (Iterator it = q.iterator(); it.hasNext();) {
802 :     q.remove();
803 :     it.next();
804 : dl 1.1 }
805 : dl 1.4 assertEquals(0, q.size());
806 : dl 1.1 }
807 :    
808 : dl 1.4 /**
809 : dl 1.5 * toString contains toStrings of elements
810 : dl 1.4 */
811 :     public void testToString() {
812 : dl 1.3 ArrayBlockingQueue q = populatedQueue(SIZE);
813 : dl 1.1 String s = q.toString();
814 : dl 1.3 for (int i = 0; i < SIZE; ++i) {
815 : jsr166 1.47 assertTrue(s.contains(String.valueOf(i)));
816 : dl 1.1 }
817 : jsr166 1.12 }
818 : dl 1.1
819 : dl 1.4 /**
820 : dl 1.5 * offer transfers elements across Executor tasks
821 : dl 1.4 */
822 : dl 1.1 public void testOfferInExecutor() {
823 :     final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
824 : dl 1.3 q.add(one);
825 :     q.add(two);
826 : jsr166 1.47 final CheckedBarrier threadsStarted = new CheckedBarrier(2);
827 : jsr166 1.68 final ExecutorService executor = Executors.newFixedThreadPool(2);
828 :     try (PoolCleaner cleaner = cleaner(executor)) {
829 :     executor.execute(new CheckedRunnable() {
830 :     public void realRun() throws InterruptedException {
831 :     assertFalse(q.offer(three));
832 :     threadsStarted.await();
833 :     assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
834 :     assertEquals(0, q.remainingCapacity());
835 :     }});
836 :    
837 :     executor.execute(new CheckedRunnable() {
838 :     public void realRun() throws InterruptedException {
839 :     threadsStarted.await();
840 :     assertEquals(0, q.remainingCapacity());
841 :     assertSame(one, q.take());
842 :     }});
843 :     }
844 : dl 1.1 }
845 :    
846 : dl 1.4 /**
847 : jsr166 1.47 * timed poll retrieves elements across Executor threads
848 : dl 1.4 */
849 : dl 1.1 public void testPollInExecutor() {
850 :     final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
851 : jsr166 1.47 final CheckedBarrier threadsStarted = new CheckedBarrier(2);
852 : jsr166 1.68 final ExecutorService executor = Executors.newFixedThreadPool(2);
853 :     try (PoolCleaner cleaner = cleaner(executor)) {
854 :     executor.execute(new CheckedRunnable() {
855 :     public void realRun() throws InterruptedException {
856 :     assertNull(q.poll());
857 :     threadsStarted.await();
858 :     assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
859 :     checkEmpty(q);
860 :     }});
861 :    
862 :     executor.execute(new CheckedRunnable() {
863 :     public void realRun() throws InterruptedException {
864 :     threadsStarted.await();
865 :     q.put(one);
866 :     }});
867 :     }
868 : dl 1.1 }
869 : dl 1.2
870 : dl 1.4 /**
871 : dl 1.5 * A deserialized serialized queue has same elements in same order
872 : dl 1.4 */
873 : jsr166 1.17 public void testSerialization() throws Exception {
874 : jsr166 1.49 Queue x = populatedQueue(SIZE);
875 :     Queue y = serialClone(x);
876 : dl 1.2
877 : jsr166 1.56 assertNotSame(x, y);
878 : jsr166 1.49 assertEquals(x.size(), y.size());
879 :     assertEquals(x.toString(), y.toString());
880 :     assertTrue(Arrays.equals(x.toArray(), y.toArray()));
881 :     while (!x.isEmpty()) {
882 :     assertFalse(y.isEmpty());
883 :     assertEquals(x.remove(), y.remove());
884 :     }
885 :     assertTrue(y.isEmpty());
886 : dl 1.6 }
887 :    
888 :     /**
889 :     * drainTo(c) empties queue into another collection c
890 : jsr166 1.12 */
891 : dl 1.6 public void testDrainTo() {
892 :     ArrayBlockingQueue q = populatedQueue(SIZE);
893 :     ArrayList l = new ArrayList();
894 :     q.drainTo(l);
895 : jsr166 1.51 assertEquals(0, q.size());
896 :     assertEquals(SIZE, l.size());
897 : jsr166 1.12 for (int i = 0; i < SIZE; ++i)
898 : dl 1.6 assertEquals(l.get(i), new Integer(i));
899 : dl 1.11 q.add(zero);
900 :     q.add(one);
901 :     assertFalse(q.isEmpty());
902 :     assertTrue(q.contains(zero));
903 :     assertTrue(q.contains(one));
904 :     l.clear();
905 :     q.drainTo(l);
906 : jsr166 1.51 assertEquals(0, q.size());
907 :     assertEquals(2, l.size());
908 : jsr166 1.12 for (int i = 0; i < 2; ++i)
909 : dl 1.11 assertEquals(l.get(i), new Integer(i));
910 : dl 1.6 }
911 :    
912 :     /**
913 :     * drainTo empties full queue, unblocking a waiting put.
914 : jsr166 1.12 */
915 : jsr166 1.17 public void testDrainToWithActivePut() throws InterruptedException {
916 : dl 1.6 final ArrayBlockingQueue q = populatedQueue(SIZE);
917 : jsr166 1.17 Thread t = new Thread(new CheckedRunnable() {
918 :     public void realRun() throws InterruptedException {
919 : jsr166 1.66 q.put(new Integer(SIZE + 1));
920 : jsr166 1.17 }});
921 :    
922 :     t.start();
923 :     ArrayList l = new ArrayList();
924 :     q.drainTo(l);
925 :     assertTrue(l.size() >= SIZE);
926 :     for (int i = 0; i < SIZE; ++i)
927 :     assertEquals(l.get(i), new Integer(i));
928 :     t.join();
929 :     assertTrue(q.size() + l.size() >= SIZE);
930 : dl 1.6 }
931 :    
932 :     /**
933 : jsr166 1.34 * drainTo(c, n) empties first min(n, size) elements of queue into c
934 : jsr166 1.12 */
935 : dl 1.6 public void testDrainToN() {
936 : jsr166 1.66 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE * 2);
937 : dl 1.6 for (int i = 0; i < SIZE + 2; ++i) {
938 : jsr166 1.13 for (int j = 0; j < SIZE; j++)
939 : dl 1.11 assertTrue(q.offer(new Integer(j)));
940 : dl 1.6 ArrayList l = new ArrayList();
941 :     q.drainTo(l, i);
942 : jsr166 1.35 int k = (i < SIZE) ? i : SIZE;
943 : jsr166 1.52 assertEquals(k, l.size());
944 : jsr166 1.66 assertEquals(SIZE - k, q.size());
945 : jsr166 1.12 for (int j = 0; j < k; ++j)
946 : dl 1.6 assertEquals(l.get(j), new Integer(j));
947 : jsr166 1.59 do {} while (q.poll() != null);
948 : dl 1.2 }
949 :     }
950 :    
951 : jsr166 1.57 /**
952 :     * remove(null), contains(null) always return false
953 :     */
954 :     public void testNeverContainsNull() {
955 :     Collection<?>[] qs = {
956 : jsr166 1.80 populatedQueue(0, 1, 10, false),
957 :     populatedQueue(2, 2, 10, true),
958 : jsr166 1.57 };
959 :    
960 :     for (Collection<?> q : qs) {
961 :     assertFalse(q.contains(null));
962 :     assertFalse(q.remove(null));
963 :     }
964 :     }
965 : dl 1.1 }

Doug Lea
ViewVC Help
Powered by ViewVC 1.0.8