1 |
|
/* |
2 |
|
* 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 |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
|
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
– |
|
9 |
|
import junit.framework.*; |
10 |
< |
import java.util.*; |
11 |
< |
import java.util.concurrent.*; |
10 |
> |
import java.util.Arrays; |
11 |
> |
import java.util.ArrayList; |
12 |
> |
import java.util.Collection; |
13 |
> |
import java.util.Iterator; |
14 |
> |
import java.util.NoSuchElementException; |
15 |
> |
import java.util.Queue; |
16 |
> |
import java.util.concurrent.ArrayBlockingQueue; |
17 |
> |
import java.util.concurrent.BlockingQueue; |
18 |
> |
import java.util.concurrent.CountDownLatch; |
19 |
> |
import java.util.concurrent.Executors; |
20 |
> |
import java.util.concurrent.ExecutorService; |
21 |
|
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
14 |
– |
import java.io.*; |
22 |
|
|
23 |
|
public class ArrayBlockingQueueTest extends JSR166TestCase { |
24 |
+ |
|
25 |
+ |
public static class Fair extends BlockingQueueTest { |
26 |
+ |
protected BlockingQueue emptyCollection() { |
27 |
+ |
return new ArrayBlockingQueue(SIZE, true); |
28 |
+ |
} |
29 |
+ |
} |
30 |
+ |
|
31 |
+ |
public static class NonFair extends BlockingQueueTest { |
32 |
+ |
protected BlockingQueue emptyCollection() { |
33 |
+ |
return new ArrayBlockingQueue(SIZE, false); |
34 |
+ |
} |
35 |
+ |
} |
36 |
+ |
|
37 |
|
public static void main(String[] args) { |
38 |
< |
junit.textui.TestRunner.run (suite()); |
38 |
> |
junit.textui.TestRunner.run(suite()); |
39 |
|
} |
40 |
+ |
|
41 |
|
public static Test suite() { |
42 |
< |
return new TestSuite(ArrayBlockingQueueTest.class); |
42 |
> |
return newTestSuite(ArrayBlockingQueueTest.class, |
43 |
> |
new Fair().testSuite(), |
44 |
> |
new NonFair().testSuite()); |
45 |
|
} |
46 |
|
|
47 |
|
/** |
48 |
< |
* Create a queue of given size containing consecutive |
48 |
> |
* Returns a new queue of given size containing consecutive |
49 |
|
* Integers 0 ... n. |
50 |
|
*/ |
51 |
< |
private ArrayBlockingQueue populatedQueue(int n) { |
52 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(n); |
51 |
> |
private ArrayBlockingQueue<Integer> populatedQueue(int n) { |
52 |
> |
ArrayBlockingQueue<Integer> q = new ArrayBlockingQueue<Integer>(n); |
53 |
|
assertTrue(q.isEmpty()); |
54 |
|
for (int i = 0; i < n; i++) |
55 |
|
assertTrue(q.offer(new Integer(i))); |
71 |
|
*/ |
72 |
|
public void testConstructor2() { |
73 |
|
try { |
74 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(0); |
74 |
> |
new ArrayBlockingQueue(0); |
75 |
|
shouldThrow(); |
76 |
|
} catch (IllegalArgumentException success) {} |
77 |
|
} |
81 |
|
*/ |
82 |
|
public void testConstructor3() { |
83 |
|
try { |
84 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(1, true, null); |
84 |
> |
new ArrayBlockingQueue(1, true, null); |
85 |
|
shouldThrow(); |
86 |
|
} catch (NullPointerException success) {} |
87 |
|
} |
90 |
|
* Initializing from Collection of null elements throws NPE |
91 |
|
*/ |
92 |
|
public void testConstructor4() { |
93 |
+ |
Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); |
94 |
|
try { |
95 |
< |
Integer[] ints = new Integer[SIZE]; |
72 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints)); |
95 |
> |
new ArrayBlockingQueue(SIZE, false, elements); |
96 |
|
shouldThrow(); |
97 |
|
} catch (NullPointerException success) {} |
98 |
|
} |
101 |
|
* Initializing from Collection with some null elements throws NPE |
102 |
|
*/ |
103 |
|
public void testConstructor5() { |
104 |
+ |
Integer[] ints = new Integer[SIZE]; |
105 |
+ |
for (int i = 0; i < SIZE-1; ++i) |
106 |
+ |
ints[i] = i; |
107 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
108 |
|
try { |
109 |
< |
Integer[] ints = new Integer[SIZE]; |
83 |
< |
for (int i = 0; i < SIZE-1; ++i) |
84 |
< |
ints[i] = new Integer(i); |
85 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints)); |
109 |
> |
new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints)); |
110 |
|
shouldThrow(); |
111 |
|
} catch (NullPointerException success) {} |
112 |
|
} |
115 |
|
* Initializing from too large collection throws IAE |
116 |
|
*/ |
117 |
|
public void testConstructor6() { |
118 |
+ |
Integer[] ints = new Integer[SIZE]; |
119 |
+ |
for (int i = 0; i < SIZE; ++i) |
120 |
+ |
ints[i] = i; |
121 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
122 |
|
try { |
123 |
< |
Integer[] ints = new Integer[SIZE]; |
96 |
< |
for (int i = 0; i < SIZE; ++i) |
97 |
< |
ints[i] = new Integer(i); |
98 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(1, false, Arrays.asList(ints)); |
123 |
> |
new ArrayBlockingQueue(SIZE - 1, false, elements); |
124 |
|
shouldThrow(); |
125 |
|
} catch (IllegalArgumentException success) {} |
126 |
|
} |
131 |
|
public void testConstructor7() { |
132 |
|
Integer[] ints = new Integer[SIZE]; |
133 |
|
for (int i = 0; i < SIZE; ++i) |
134 |
< |
ints[i] = new Integer(i); |
135 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, Arrays.asList(ints)); |
134 |
> |
ints[i] = i; |
135 |
> |
Collection<Integer> elements = Arrays.asList(ints); |
136 |
> |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, elements); |
137 |
|
for (int i = 0; i < SIZE; ++i) |
138 |
|
assertEquals(ints[i], q.poll()); |
139 |
|
} |
171 |
|
} |
172 |
|
|
173 |
|
/** |
148 |
– |
* offer(null) throws NPE |
149 |
– |
*/ |
150 |
– |
public void testOfferNull() { |
151 |
– |
try { |
152 |
– |
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
153 |
– |
q.offer(null); |
154 |
– |
shouldThrow(); |
155 |
– |
} catch (NullPointerException success) {} |
156 |
– |
} |
157 |
– |
|
158 |
– |
/** |
159 |
– |
* add(null) throws NPE |
160 |
– |
*/ |
161 |
– |
public void testAddNull() { |
162 |
– |
try { |
163 |
– |
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
164 |
– |
q.add(null); |
165 |
– |
shouldThrow(); |
166 |
– |
} catch (NullPointerException success) {} |
167 |
– |
} |
168 |
– |
|
169 |
– |
/** |
174 |
|
* Offer succeeds if not full; fails if full |
175 |
|
*/ |
176 |
|
public void testOffer() { |
195 |
|
} |
196 |
|
|
197 |
|
/** |
194 |
– |
* addAll(null) throws NPE |
195 |
– |
*/ |
196 |
– |
public void testAddAll1() { |
197 |
– |
try { |
198 |
– |
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
199 |
– |
q.addAll(null); |
200 |
– |
shouldThrow(); |
201 |
– |
} catch (NullPointerException success) {} |
202 |
– |
} |
203 |
– |
|
204 |
– |
/** |
198 |
|
* addAll(this) throws IAE |
199 |
|
*/ |
200 |
|
public void testAddAllSelf() { |
205 |
|
} catch (IllegalArgumentException success) {} |
206 |
|
} |
207 |
|
|
215 |
– |
|
216 |
– |
/** |
217 |
– |
* addAll of a collection with null elements throws NPE |
218 |
– |
*/ |
219 |
– |
public void testAddAll2() { |
220 |
– |
try { |
221 |
– |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
222 |
– |
Integer[] ints = new Integer[SIZE]; |
223 |
– |
q.addAll(Arrays.asList(ints)); |
224 |
– |
shouldThrow(); |
225 |
– |
} catch (NullPointerException success) {} |
226 |
– |
} |
208 |
|
/** |
209 |
|
* addAll of a collection with any null elements throws NPE after |
210 |
|
* possibly adding some elements |
219 |
|
shouldThrow(); |
220 |
|
} catch (NullPointerException success) {} |
221 |
|
} |
222 |
+ |
|
223 |
|
/** |
224 |
|
* addAll throws ISE if not enough room |
225 |
|
*/ |
233 |
|
shouldThrow(); |
234 |
|
} catch (IllegalStateException success) {} |
235 |
|
} |
236 |
+ |
|
237 |
|
/** |
238 |
|
* Queue contains all elements, in traversal order, of successful addAll |
239 |
|
*/ |
250 |
|
} |
251 |
|
|
252 |
|
/** |
270 |
– |
* put(null) throws NPE |
271 |
– |
*/ |
272 |
– |
public void testPutNull() throws InterruptedException { |
273 |
– |
try { |
274 |
– |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
275 |
– |
q.put(null); |
276 |
– |
shouldThrow(); |
277 |
– |
} catch (NullPointerException success) {} |
278 |
– |
} |
279 |
– |
|
280 |
– |
/** |
253 |
|
* all elements successfully put are contained |
254 |
|
*/ |
255 |
|
public void testPut() throws InterruptedException { |
267 |
|
*/ |
268 |
|
public void testBlockingPut() throws InterruptedException { |
269 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
270 |
< |
Thread t = new Thread(new CheckedRunnable() { |
270 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
271 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
272 |
|
public void realRun() throws InterruptedException { |
273 |
|
for (int i = 0; i < SIZE; ++i) |
274 |
|
q.put(i); |
275 |
|
assertEquals(SIZE, q.size()); |
276 |
|
assertEquals(0, q.remainingCapacity()); |
277 |
+ |
|
278 |
+ |
Thread.currentThread().interrupt(); |
279 |
+ |
try { |
280 |
+ |
q.put(99); |
281 |
+ |
shouldThrow(); |
282 |
+ |
} catch (InterruptedException success) {} |
283 |
+ |
assertFalse(Thread.interrupted()); |
284 |
+ |
|
285 |
+ |
pleaseInterrupt.countDown(); |
286 |
|
try { |
287 |
|
q.put(99); |
288 |
|
shouldThrow(); |
289 |
|
} catch (InterruptedException success) {} |
290 |
+ |
assertFalse(Thread.interrupted()); |
291 |
|
}}); |
292 |
|
|
293 |
< |
t.start(); |
294 |
< |
Thread.sleep(SHORT_DELAY_MS); |
293 |
> |
await(pleaseInterrupt); |
294 |
> |
assertThreadStaysAlive(t); |
295 |
|
t.interrupt(); |
296 |
< |
t.join(); |
296 |
> |
awaitTermination(t); |
297 |
|
assertEquals(SIZE, q.size()); |
298 |
|
assertEquals(0, q.remainingCapacity()); |
299 |
|
} |
300 |
|
|
301 |
|
/** |
302 |
< |
* put blocks waiting for take when full |
302 |
> |
* put blocks interruptibly waiting for take when full |
303 |
|
*/ |
304 |
|
public void testPutWithTake() throws InterruptedException { |
305 |
|
final int capacity = 2; |
306 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(capacity); |
307 |
< |
Thread t = new Thread(new CheckedRunnable() { |
307 |
> |
final CountDownLatch pleaseTake = new CountDownLatch(1); |
308 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
309 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
310 |
|
public void realRun() throws InterruptedException { |
311 |
< |
for (int i = 0; i < capacity + 1; i++) |
311 |
> |
for (int i = 0; i < capacity; i++) |
312 |
|
q.put(i); |
313 |
+ |
pleaseTake.countDown(); |
314 |
+ |
q.put(86); |
315 |
+ |
|
316 |
+ |
pleaseInterrupt.countDown(); |
317 |
|
try { |
318 |
|
q.put(99); |
319 |
|
shouldThrow(); |
320 |
|
} catch (InterruptedException success) {} |
321 |
+ |
assertFalse(Thread.interrupted()); |
322 |
|
}}); |
323 |
|
|
324 |
< |
t.start(); |
325 |
< |
Thread.sleep(SHORT_DELAY_MS); |
336 |
< |
assertEquals(q.remainingCapacity(), 0); |
324 |
> |
await(pleaseTake); |
325 |
> |
assertEquals(0, q.remainingCapacity()); |
326 |
|
assertEquals(0, q.take()); |
327 |
< |
Thread.sleep(SHORT_DELAY_MS); |
327 |
> |
|
328 |
> |
await(pleaseInterrupt); |
329 |
> |
assertThreadStaysAlive(t); |
330 |
|
t.interrupt(); |
331 |
< |
t.join(); |
332 |
< |
assertEquals(q.remainingCapacity(), 0); |
331 |
> |
awaitTermination(t); |
332 |
> |
assertEquals(0, q.remainingCapacity()); |
333 |
|
} |
334 |
|
|
335 |
|
/** |
337 |
|
*/ |
338 |
|
public void testTimedOffer() throws InterruptedException { |
339 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
340 |
< |
Thread t = new Thread(new CheckedRunnable() { |
340 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
341 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
342 |
|
public void realRun() throws InterruptedException { |
343 |
|
q.put(new Object()); |
344 |
|
q.put(new Object()); |
345 |
< |
assertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, MILLISECONDS)); |
345 |
> |
long startTime = System.nanoTime(); |
346 |
> |
assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS)); |
347 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
348 |
> |
pleaseInterrupt.countDown(); |
349 |
|
try { |
350 |
< |
q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
350 |
> |
q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS); |
351 |
|
shouldThrow(); |
352 |
|
} catch (InterruptedException success) {} |
353 |
|
}}); |
354 |
|
|
355 |
< |
t.start(); |
356 |
< |
Thread.sleep(SHORT_DELAY_MS); |
355 |
> |
await(pleaseInterrupt); |
356 |
> |
assertThreadStaysAlive(t); |
357 |
|
t.interrupt(); |
358 |
< |
t.join(); |
358 |
> |
awaitTermination(t); |
359 |
|
} |
360 |
|
|
361 |
|
/** |
369 |
|
} |
370 |
|
|
371 |
|
/** |
377 |
– |
* take blocks interruptibly when empty |
378 |
– |
*/ |
379 |
– |
public void testTakeFromEmpty() throws InterruptedException { |
380 |
– |
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
381 |
– |
Thread t = new ThreadShouldThrow(InterruptedException.class) { |
382 |
– |
public void realRun() throws InterruptedException { |
383 |
– |
q.take(); |
384 |
– |
}}; |
385 |
– |
|
386 |
– |
t.start(); |
387 |
– |
Thread.sleep(SHORT_DELAY_MS); |
388 |
– |
t.interrupt(); |
389 |
– |
t.join(); |
390 |
– |
} |
391 |
– |
|
392 |
– |
/** |
372 |
|
* Take removes existing elements until empty, then blocks interruptibly |
373 |
|
*/ |
374 |
|
public void testBlockingTake() throws InterruptedException { |
375 |
|
final ArrayBlockingQueue q = populatedQueue(SIZE); |
376 |
< |
Thread t = new Thread(new CheckedRunnable() { |
376 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
377 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
378 |
|
public void realRun() throws InterruptedException { |
379 |
|
for (int i = 0; i < SIZE; ++i) { |
380 |
|
assertEquals(i, q.take()); |
381 |
|
} |
382 |
+ |
|
383 |
+ |
Thread.currentThread().interrupt(); |
384 |
+ |
try { |
385 |
+ |
q.take(); |
386 |
+ |
shouldThrow(); |
387 |
+ |
} catch (InterruptedException success) {} |
388 |
+ |
assertFalse(Thread.interrupted()); |
389 |
+ |
|
390 |
+ |
pleaseInterrupt.countDown(); |
391 |
|
try { |
392 |
|
q.take(); |
393 |
|
shouldThrow(); |
394 |
|
} catch (InterruptedException success) {} |
395 |
+ |
assertFalse(Thread.interrupted()); |
396 |
|
}}); |
397 |
|
|
398 |
< |
t.start(); |
399 |
< |
Thread.sleep(SHORT_DELAY_MS); |
398 |
> |
await(pleaseInterrupt); |
399 |
> |
assertThreadStaysAlive(t); |
400 |
|
t.interrupt(); |
401 |
< |
t.join(); |
401 |
> |
awaitTermination(t); |
402 |
|
} |
403 |
|
|
414 |
– |
|
404 |
|
/** |
405 |
|
* poll succeeds unless empty |
406 |
|
*/ |
413 |
|
} |
414 |
|
|
415 |
|
/** |
416 |
< |
* timed pool with zero timeout succeeds when non-empty, else times out |
416 |
> |
* timed poll with zero timeout succeeds when non-empty, else times out |
417 |
|
*/ |
418 |
|
public void testTimedPoll0() throws InterruptedException { |
419 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
421 |
|
assertEquals(i, q.poll(0, MILLISECONDS)); |
422 |
|
} |
423 |
|
assertNull(q.poll(0, MILLISECONDS)); |
424 |
+ |
checkEmpty(q); |
425 |
|
} |
426 |
|
|
427 |
|
/** |
428 |
< |
* timed pool with nonzero timeout succeeds when non-empty, else times out |
428 |
> |
* timed poll with nonzero timeout succeeds when non-empty, else times out |
429 |
|
*/ |
430 |
|
public void testTimedPoll() throws InterruptedException { |
431 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
432 |
|
for (int i = 0; i < SIZE; ++i) { |
433 |
< |
assertEquals(i, q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
434 |
< |
} |
435 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
433 |
> |
long startTime = System.nanoTime(); |
434 |
> |
assertEquals(i, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
435 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
436 |
> |
} |
437 |
> |
long startTime = System.nanoTime(); |
438 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
439 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
440 |
> |
checkEmpty(q); |
441 |
|
} |
442 |
|
|
443 |
|
/** |
445 |
|
* returning timeout status |
446 |
|
*/ |
447 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
448 |
< |
Thread t = new Thread(new CheckedRunnable() { |
448 |
> |
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
449 |
> |
final CountDownLatch aboutToWait = new CountDownLatch(1); |
450 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
451 |
|
public void realRun() throws InterruptedException { |
455 |
– |
ArrayBlockingQueue q = populatedQueue(SIZE); |
452 |
|
for (int i = 0; i < SIZE; ++i) { |
453 |
< |
assertEquals(i, q.poll(SHORT_DELAY_MS, MILLISECONDS));; |
453 |
> |
long t0 = System.nanoTime(); |
454 |
> |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
455 |
> |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
456 |
|
} |
457 |
+ |
long t0 = System.nanoTime(); |
458 |
+ |
aboutToWait.countDown(); |
459 |
|
try { |
460 |
< |
q.poll(SMALL_DELAY_MS, MILLISECONDS); |
460 |
> |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
461 |
|
shouldThrow(); |
462 |
< |
} catch (InterruptedException success) {} |
463 |
< |
}}); |
464 |
< |
|
465 |
< |
t.start(); |
466 |
< |
Thread.sleep(SHORT_DELAY_MS); |
467 |
< |
t.interrupt(); |
468 |
< |
t.join(); |
469 |
< |
} |
470 |
< |
|
471 |
< |
/** |
472 |
< |
* timed poll before a delayed offer fails; after offer succeeds; |
473 |
< |
* on interruption throws |
474 |
< |
*/ |
475 |
< |
public void testTimedPollWithOffer() throws InterruptedException { |
476 |
< |
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
477 |
< |
Thread t = new Thread(new CheckedRunnable() { |
478 |
< |
public void realRun() throws InterruptedException { |
479 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
480 |
< |
assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
481 |
< |
try { |
482 |
< |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
483 |
< |
shouldThrow(); |
484 |
< |
} catch (InterruptedException success) {} |
462 |
> |
} catch (InterruptedException success) { |
463 |
> |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
464 |
> |
} |
465 |
|
}}); |
466 |
|
|
467 |
< |
t.start(); |
468 |
< |
Thread.sleep(SMALL_DELAY_MS); |
489 |
< |
assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS)); |
467 |
> |
aboutToWait.await(); |
468 |
> |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
469 |
|
t.interrupt(); |
470 |
< |
t.join(); |
470 |
> |
awaitTermination(t, MEDIUM_DELAY_MS); |
471 |
> |
checkEmpty(q); |
472 |
|
} |
473 |
|
|
494 |
– |
|
474 |
|
/** |
475 |
|
* peek returns next element, or null if empty |
476 |
|
*/ |
515 |
|
} |
516 |
|
|
517 |
|
/** |
539 |
– |
* remove(x) removes x and returns true if present |
540 |
– |
*/ |
541 |
– |
public void testRemoveElement() { |
542 |
– |
ArrayBlockingQueue q = populatedQueue(SIZE); |
543 |
– |
for (int i = 1; i < SIZE; i+=2) { |
544 |
– |
assertTrue(q.remove(new Integer(i))); |
545 |
– |
} |
546 |
– |
for (int i = 0; i < SIZE; i+=2) { |
547 |
– |
assertTrue(q.remove(new Integer(i))); |
548 |
– |
assertFalse(q.remove(new Integer(i+1))); |
549 |
– |
} |
550 |
– |
assertTrue(q.isEmpty()); |
551 |
– |
} |
552 |
– |
|
553 |
– |
/** |
518 |
|
* contains(x) reports true when elements added but not yet removed |
519 |
|
*/ |
520 |
|
public void testContains() { |
591 |
|
} |
592 |
|
} |
593 |
|
|
594 |
< |
/** |
595 |
< |
* toArray contains all elements |
632 |
< |
*/ |
633 |
< |
public void testToArray() throws InterruptedException { |
634 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
594 |
> |
void checkToArray(ArrayBlockingQueue q) { |
595 |
> |
int size = q.size(); |
596 |
|
Object[] o = q.toArray(); |
597 |
< |
for (int i = 0; i < o.length; i++) |
598 |
< |
assertEquals(o[i], q.take()); |
597 |
> |
assertEquals(size, o.length); |
598 |
> |
Iterator it = q.iterator(); |
599 |
> |
for (int i = 0; i < size; i++) { |
600 |
> |
Integer x = (Integer) it.next(); |
601 |
> |
assertEquals((Integer)o[0] + i, (int) x); |
602 |
> |
assertSame(o[i], x); |
603 |
> |
} |
604 |
|
} |
605 |
|
|
606 |
|
/** |
607 |
< |
* toArray(a) contains all elements |
607 |
> |
* toArray() contains all elements in FIFO order |
608 |
|
*/ |
609 |
< |
public void testToArray2() throws InterruptedException { |
610 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
611 |
< |
Integer[] ints = new Integer[SIZE]; |
612 |
< |
ints = (Integer[])q.toArray(ints); |
613 |
< |
for (int i = 0; i < ints.length; i++) |
614 |
< |
assertEquals(ints[i], q.take()); |
609 |
> |
public void testToArray() { |
610 |
> |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
611 |
> |
for (int i = 0; i < SIZE; i++) { |
612 |
> |
checkToArray(q); |
613 |
> |
q.add(i); |
614 |
> |
} |
615 |
> |
// Provoke wraparound |
616 |
> |
for (int i = 0; i < SIZE; i++) { |
617 |
> |
checkToArray(q); |
618 |
> |
assertEquals(i, q.poll()); |
619 |
> |
checkToArray(q); |
620 |
> |
q.add(SIZE+i); |
621 |
> |
} |
622 |
> |
for (int i = 0; i < SIZE; i++) { |
623 |
> |
checkToArray(q); |
624 |
> |
assertEquals(SIZE+i, q.poll()); |
625 |
> |
} |
626 |
> |
} |
627 |
> |
|
628 |
> |
void checkToArray2(ArrayBlockingQueue q) { |
629 |
> |
int size = q.size(); |
630 |
> |
Integer[] a1 = size == 0 ? null : new Integer[size-1]; |
631 |
> |
Integer[] a2 = new Integer[size]; |
632 |
> |
Integer[] a3 = new Integer[size+2]; |
633 |
> |
if (size > 0) Arrays.fill(a1, 42); |
634 |
> |
Arrays.fill(a2, 42); |
635 |
> |
Arrays.fill(a3, 42); |
636 |
> |
Integer[] b1 = size == 0 ? null : (Integer[]) q.toArray(a1); |
637 |
> |
Integer[] b2 = (Integer[]) q.toArray(a2); |
638 |
> |
Integer[] b3 = (Integer[]) q.toArray(a3); |
639 |
> |
assertSame(a2, b2); |
640 |
> |
assertSame(a3, b3); |
641 |
> |
Iterator it = q.iterator(); |
642 |
> |
for (int i = 0; i < size; i++) { |
643 |
> |
Integer x = (Integer) it.next(); |
644 |
> |
assertSame(b1[i], x); |
645 |
> |
assertEquals(b1[0] + i, (int) x); |
646 |
> |
assertSame(b2[i], x); |
647 |
> |
assertSame(b3[i], x); |
648 |
> |
} |
649 |
> |
assertNull(a3[size]); |
650 |
> |
assertEquals(42, (int) a3[size+1]); |
651 |
> |
if (size > 0) { |
652 |
> |
assertNotSame(a1, b1); |
653 |
> |
assertEquals(size, b1.length); |
654 |
> |
for (int i = 0; i < a1.length; i++) { |
655 |
> |
assertEquals(42, (int) a1[i]); |
656 |
> |
} |
657 |
> |
} |
658 |
|
} |
659 |
|
|
660 |
|
/** |
661 |
< |
* toArray(null) throws NPE |
661 |
> |
* toArray(a) contains all elements in FIFO order |
662 |
|
*/ |
663 |
< |
public void testToArray_BadArg() { |
664 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
665 |
< |
try { |
666 |
< |
Object o[] = q.toArray(null); |
667 |
< |
shouldThrow(); |
668 |
< |
} catch (NullPointerException success) {} |
663 |
> |
public void testToArray2() { |
664 |
> |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
665 |
> |
for (int i = 0; i < SIZE; i++) { |
666 |
> |
checkToArray2(q); |
667 |
> |
q.add(i); |
668 |
> |
} |
669 |
> |
// Provoke wraparound |
670 |
> |
for (int i = 0; i < SIZE; i++) { |
671 |
> |
checkToArray2(q); |
672 |
> |
assertEquals(i, q.poll()); |
673 |
> |
checkToArray2(q); |
674 |
> |
q.add(SIZE+i); |
675 |
> |
} |
676 |
> |
for (int i = 0; i < SIZE; i++) { |
677 |
> |
checkToArray2(q); |
678 |
> |
assertEquals(SIZE+i, q.poll()); |
679 |
> |
} |
680 |
|
} |
681 |
|
|
682 |
|
/** |
683 |
< |
* toArray with incompatible array type throws CCE |
683 |
> |
* toArray(incompatible array type) throws ArrayStoreException |
684 |
|
*/ |
685 |
|
public void testToArray1_BadArg() { |
686 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
687 |
|
try { |
688 |
< |
Object o[] = q.toArray(new String[10]); |
688 |
> |
q.toArray(new String[10]); |
689 |
|
shouldThrow(); |
690 |
|
} catch (ArrayStoreException success) {} |
691 |
|
} |
692 |
|
|
673 |
– |
|
693 |
|
/** |
694 |
|
* iterator iterates through all elements |
695 |
|
*/ |
704 |
|
/** |
705 |
|
* iterator.remove removes current element |
706 |
|
*/ |
707 |
< |
public void testIteratorRemove () { |
707 |
> |
public void testIteratorRemove() { |
708 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(3); |
709 |
|
q.add(two); |
710 |
|
q.add(one); |
741 |
|
/** |
742 |
|
* Modifications do not cause iterators to fail |
743 |
|
*/ |
744 |
< |
public void testWeaklyConsistentIteration () { |
744 |
> |
public void testWeaklyConsistentIteration() { |
745 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(3); |
746 |
|
q.add(one); |
747 |
|
q.add(two); |
753 |
|
assertEquals(0, q.size()); |
754 |
|
} |
755 |
|
|
737 |
– |
|
756 |
|
/** |
757 |
|
* toString contains toStrings of elements |
758 |
|
*/ |
760 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
761 |
|
String s = q.toString(); |
762 |
|
for (int i = 0; i < SIZE; ++i) { |
763 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
763 |
> |
assertTrue(s.contains(String.valueOf(i))); |
764 |
|
} |
765 |
|
} |
766 |
|
|
749 |
– |
|
767 |
|
/** |
768 |
|
* offer transfers elements across Executor tasks |
769 |
|
*/ |
772 |
|
q.add(one); |
773 |
|
q.add(two); |
774 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
775 |
+ |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
776 |
|
executor.execute(new CheckedRunnable() { |
777 |
|
public void realRun() throws InterruptedException { |
778 |
|
assertFalse(q.offer(three)); |
779 |
< |
assertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS)); |
779 |
> |
threadsStarted.await(); |
780 |
> |
assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS)); |
781 |
|
assertEquals(0, q.remainingCapacity()); |
782 |
|
}}); |
783 |
|
|
784 |
|
executor.execute(new CheckedRunnable() { |
785 |
|
public void realRun() throws InterruptedException { |
786 |
< |
Thread.sleep(SMALL_DELAY_MS); |
786 |
> |
threadsStarted.await(); |
787 |
> |
assertEquals(0, q.remainingCapacity()); |
788 |
|
assertSame(one, q.take()); |
789 |
|
}}); |
790 |
|
|
792 |
|
} |
793 |
|
|
794 |
|
/** |
795 |
< |
* poll retrieves elements across Executor threads |
795 |
> |
* timed poll retrieves elements across Executor threads |
796 |
|
*/ |
797 |
|
public void testPollInExecutor() { |
798 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
799 |
+ |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
800 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
801 |
|
executor.execute(new CheckedRunnable() { |
802 |
|
public void realRun() throws InterruptedException { |
803 |
|
assertNull(q.poll()); |
804 |
< |
assertSame(one, q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
805 |
< |
assertTrue(q.isEmpty()); |
804 |
> |
threadsStarted.await(); |
805 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
806 |
> |
checkEmpty(q); |
807 |
|
}}); |
808 |
|
|
809 |
|
executor.execute(new CheckedRunnable() { |
810 |
|
public void realRun() throws InterruptedException { |
811 |
< |
Thread.sleep(SMALL_DELAY_MS); |
811 |
> |
threadsStarted.await(); |
812 |
|
q.put(one); |
813 |
|
}}); |
814 |
|
|
819 |
|
* A deserialized serialized queue has same elements in same order |
820 |
|
*/ |
821 |
|
public void testSerialization() throws Exception { |
822 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
823 |
< |
|
802 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
803 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
804 |
< |
out.writeObject(q); |
805 |
< |
out.close(); |
806 |
< |
|
807 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
808 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
809 |
< |
ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject(); |
810 |
< |
assertEquals(q.size(), r.size()); |
811 |
< |
while (!q.isEmpty()) |
812 |
< |
assertEquals(q.remove(), r.remove()); |
813 |
< |
} |
822 |
> |
Queue x = populatedQueue(SIZE); |
823 |
> |
Queue y = serialClone(x); |
824 |
|
|
825 |
< |
/** |
826 |
< |
* drainTo(null) throws NPE |
827 |
< |
*/ |
828 |
< |
public void testDrainToNull() { |
829 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
830 |
< |
try { |
831 |
< |
q.drainTo(null); |
832 |
< |
shouldThrow(); |
833 |
< |
} catch (NullPointerException success) {} |
824 |
< |
} |
825 |
< |
|
826 |
< |
/** |
827 |
< |
* drainTo(this) throws IAE |
828 |
< |
*/ |
829 |
< |
public void testDrainToSelf() { |
830 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
831 |
< |
try { |
832 |
< |
q.drainTo(q); |
833 |
< |
shouldThrow(); |
834 |
< |
} catch (IllegalArgumentException success) {} |
825 |
> |
assertNotSame(x, y); |
826 |
> |
assertEquals(x.size(), y.size()); |
827 |
> |
assertEquals(x.toString(), y.toString()); |
828 |
> |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
829 |
> |
while (!x.isEmpty()) { |
830 |
> |
assertFalse(y.isEmpty()); |
831 |
> |
assertEquals(x.remove(), y.remove()); |
832 |
> |
} |
833 |
> |
assertTrue(y.isEmpty()); |
834 |
|
} |
835 |
|
|
836 |
|
/** |
840 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
841 |
|
ArrayList l = new ArrayList(); |
842 |
|
q.drainTo(l); |
843 |
< |
assertEquals(q.size(), 0); |
844 |
< |
assertEquals(l.size(), SIZE); |
843 |
> |
assertEquals(0, q.size()); |
844 |
> |
assertEquals(SIZE, l.size()); |
845 |
|
for (int i = 0; i < SIZE; ++i) |
846 |
|
assertEquals(l.get(i), new Integer(i)); |
847 |
|
q.add(zero); |
851 |
|
assertTrue(q.contains(one)); |
852 |
|
l.clear(); |
853 |
|
q.drainTo(l); |
854 |
< |
assertEquals(q.size(), 0); |
855 |
< |
assertEquals(l.size(), 2); |
854 |
> |
assertEquals(0, q.size()); |
855 |
> |
assertEquals(2, l.size()); |
856 |
|
for (int i = 0; i < 2; ++i) |
857 |
|
assertEquals(l.get(i), new Integer(i)); |
858 |
|
} |
878 |
|
} |
879 |
|
|
880 |
|
/** |
881 |
< |
* drainTo(null, n) throws NPE |
883 |
< |
*/ |
884 |
< |
public void testDrainToNullN() { |
885 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
886 |
< |
try { |
887 |
< |
q.drainTo(null, 0); |
888 |
< |
shouldThrow(); |
889 |
< |
} catch (NullPointerException success) {} |
890 |
< |
} |
891 |
< |
|
892 |
< |
/** |
893 |
< |
* drainTo(this, n) throws IAE |
894 |
< |
*/ |
895 |
< |
public void testDrainToSelfN() { |
896 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
897 |
< |
try { |
898 |
< |
q.drainTo(q, 0); |
899 |
< |
shouldThrow(); |
900 |
< |
} catch (IllegalArgumentException success) {} |
901 |
< |
} |
902 |
< |
|
903 |
< |
/** |
904 |
< |
* drainTo(c, n) empties first max {n, size} elements of queue into c |
881 |
> |
* drainTo(c, n) empties first min(n, size) elements of queue into c |
882 |
|
*/ |
883 |
|
public void testDrainToN() { |
884 |
|
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE*2); |
887 |
|
assertTrue(q.offer(new Integer(j))); |
888 |
|
ArrayList l = new ArrayList(); |
889 |
|
q.drainTo(l, i); |
890 |
< |
int k = (i < SIZE)? i : SIZE; |
891 |
< |
assertEquals(l.size(), k); |
892 |
< |
assertEquals(q.size(), SIZE-k); |
890 |
> |
int k = (i < SIZE) ? i : SIZE; |
891 |
> |
assertEquals(k, l.size()); |
892 |
> |
assertEquals(SIZE-k, q.size()); |
893 |
|
for (int j = 0; j < k; ++j) |
894 |
|
assertEquals(l.get(j), new Integer(j)); |
895 |
|
while (q.poll() != null) ; |
896 |
|
} |
897 |
|
} |
898 |
|
|
899 |
+ |
/** |
900 |
+ |
* remove(null), contains(null) always return false |
901 |
+ |
*/ |
902 |
+ |
public void testNeverContainsNull() { |
903 |
+ |
Collection<?>[] qs = { |
904 |
+ |
new ArrayBlockingQueue<Object>(10), |
905 |
+ |
populatedQueue(2), |
906 |
+ |
}; |
907 |
+ |
|
908 |
+ |
for (Collection<?> q : qs) { |
909 |
+ |
assertFalse(q.contains(null)); |
910 |
+ |
assertFalse(q.remove(null)); |
911 |
+ |
} |
912 |
+ |
} |
913 |
|
} |