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

Doug Lea
ViewVC Help
Powered by ViewVC 1.0.8