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

Doug Lea
ViewVC Help
Powered by ViewVC 1.0.8