44 |
|
} |
45 |
|
|
46 |
|
/** |
47 |
< |
* Constructor throws IAE if capacity argument nonpositive |
47 |
> |
* Constructor throws IAE if capacity argument nonpositive |
48 |
|
*/ |
49 |
|
public void testConstructor2() { |
50 |
|
try { |
51 |
|
ArrayBlockingQueue q = new ArrayBlockingQueue(0); |
52 |
|
shouldThrow(); |
53 |
< |
} |
54 |
< |
catch (IllegalArgumentException success) {} |
53 |
> |
} catch (IllegalArgumentException success) {} |
54 |
|
} |
55 |
|
|
56 |
|
/** |
60 |
|
try { |
61 |
|
ArrayBlockingQueue q = new ArrayBlockingQueue(1, true, null); |
62 |
|
shouldThrow(); |
63 |
< |
} |
65 |
< |
catch (NullPointerException success) {} |
63 |
> |
} catch (NullPointerException success) {} |
64 |
|
} |
65 |
|
|
66 |
|
/** |
71 |
|
Integer[] ints = new Integer[SIZE]; |
72 |
|
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints)); |
73 |
|
shouldThrow(); |
74 |
< |
} |
77 |
< |
catch (NullPointerException success) {} |
74 |
> |
} catch (NullPointerException success) {} |
75 |
|
} |
76 |
|
|
77 |
|
/** |
84 |
|
ints[i] = new Integer(i); |
85 |
|
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints)); |
86 |
|
shouldThrow(); |
87 |
< |
} |
91 |
< |
catch (NullPointerException success) {} |
87 |
> |
} catch (NullPointerException success) {} |
88 |
|
} |
89 |
|
|
90 |
|
/** |
97 |
|
ints[i] = new Integer(i); |
98 |
|
ArrayBlockingQueue q = new ArrayBlockingQueue(1, false, Arrays.asList(ints)); |
99 |
|
shouldThrow(); |
100 |
< |
} |
105 |
< |
catch (IllegalArgumentException success) {} |
100 |
> |
} catch (IllegalArgumentException success) {} |
101 |
|
} |
102 |
|
|
103 |
|
/** |
104 |
|
* Queue contains all elements of collection used to initialize |
105 |
|
*/ |
106 |
|
public void testConstructor7() { |
107 |
< |
try { |
108 |
< |
Integer[] ints = new Integer[SIZE]; |
109 |
< |
for (int i = 0; i < SIZE; ++i) |
110 |
< |
ints[i] = new Integer(i); |
111 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, Arrays.asList(ints)); |
112 |
< |
for (int i = 0; i < SIZE; ++i) |
118 |
< |
assertEquals(ints[i], q.poll()); |
119 |
< |
} |
120 |
< |
finally {} |
107 |
> |
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 |
|
} |
114 |
|
|
115 |
|
/** |
152 |
|
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
153 |
|
q.offer(null); |
154 |
|
shouldThrow(); |
155 |
< |
} catch (NullPointerException success) { } |
155 |
> |
} catch (NullPointerException success) {} |
156 |
|
} |
157 |
|
|
158 |
|
/** |
163 |
|
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
164 |
|
q.add(null); |
165 |
|
shouldThrow(); |
166 |
< |
} catch (NullPointerException success) { } |
166 |
> |
} catch (NullPointerException success) {} |
167 |
|
} |
168 |
|
|
169 |
|
/** |
186 |
|
} |
187 |
|
assertEquals(0, q.remainingCapacity()); |
188 |
|
q.add(new Integer(SIZE)); |
189 |
< |
} catch (IllegalStateException success) { |
190 |
< |
} |
189 |
> |
shouldThrow(); |
190 |
> |
} catch (IllegalStateException success) {} |
191 |
|
} |
192 |
|
|
193 |
|
/** |
198 |
|
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
199 |
|
q.addAll(null); |
200 |
|
shouldThrow(); |
201 |
< |
} |
210 |
< |
catch (NullPointerException success) {} |
201 |
> |
} catch (NullPointerException success) {} |
202 |
|
} |
203 |
|
|
204 |
|
/** |
209 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
210 |
|
q.addAll(q); |
211 |
|
shouldThrow(); |
212 |
< |
} |
222 |
< |
catch (IllegalArgumentException success) {} |
212 |
> |
} catch (IllegalArgumentException success) {} |
213 |
|
} |
214 |
|
|
215 |
|
|
222 |
|
Integer[] ints = new Integer[SIZE]; |
223 |
|
q.addAll(Arrays.asList(ints)); |
224 |
|
shouldThrow(); |
225 |
< |
} |
236 |
< |
catch (NullPointerException success) {} |
225 |
> |
} catch (NullPointerException success) {} |
226 |
|
} |
227 |
|
/** |
228 |
|
* addAll of a collection with any null elements throws NPE after |
236 |
|
ints[i] = new Integer(i); |
237 |
|
q.addAll(Arrays.asList(ints)); |
238 |
|
shouldThrow(); |
239 |
< |
} |
251 |
< |
catch (NullPointerException success) {} |
239 |
> |
} catch (NullPointerException success) {} |
240 |
|
} |
241 |
|
/** |
242 |
|
* addAll throws ISE if not enough room |
249 |
|
ints[i] = new Integer(i); |
250 |
|
q.addAll(Arrays.asList(ints)); |
251 |
|
shouldThrow(); |
252 |
< |
} |
265 |
< |
catch (IllegalStateException success) {} |
252 |
> |
} catch (IllegalStateException success) {} |
253 |
|
} |
254 |
|
/** |
255 |
|
* Queue contains all elements, in traversal order, of successful addAll |
256 |
|
*/ |
257 |
|
public void testAddAll5() { |
258 |
< |
try { |
259 |
< |
Integer[] empty = new Integer[0]; |
260 |
< |
Integer[] ints = new Integer[SIZE]; |
261 |
< |
for (int i = 0; i < SIZE; ++i) |
262 |
< |
ints[i] = new Integer(i); |
263 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
264 |
< |
assertFalse(q.addAll(Arrays.asList(empty))); |
265 |
< |
assertTrue(q.addAll(Arrays.asList(ints))); |
266 |
< |
for (int i = 0; i < SIZE; ++i) |
280 |
< |
assertEquals(ints[i], q.poll()); |
281 |
< |
} |
282 |
< |
finally {} |
258 |
> |
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 |
|
} |
268 |
|
|
269 |
|
/** |
270 |
|
* put(null) throws NPE |
271 |
|
*/ |
272 |
< |
public void testPutNull() { |
272 |
> |
public void testPutNull() throws InterruptedException { |
273 |
|
try { |
274 |
|
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
275 |
|
q.put(null); |
276 |
|
shouldThrow(); |
277 |
< |
} |
294 |
< |
catch (NullPointerException success) { |
295 |
< |
} |
296 |
< |
catch (InterruptedException ie) { |
297 |
< |
unexpectedException(); |
298 |
< |
} |
277 |
> |
} catch (NullPointerException success) {} |
278 |
|
} |
279 |
|
|
280 |
|
/** |
281 |
|
* all elements successfully put are contained |
282 |
|
*/ |
283 |
< |
public void testPut() { |
284 |
< |
try { |
285 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
286 |
< |
for (int i = 0; i < SIZE; ++i) { |
287 |
< |
Integer I = new Integer(i); |
288 |
< |
q.put(I); |
310 |
< |
assertTrue(q.contains(I)); |
311 |
< |
} |
312 |
< |
assertEquals(0, q.remainingCapacity()); |
313 |
< |
} |
314 |
< |
catch (InterruptedException ie) { |
315 |
< |
unexpectedException(); |
283 |
> |
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 |
|
} |
290 |
+ |
assertEquals(0, q.remainingCapacity()); |
291 |
|
} |
292 |
|
|
293 |
|
/** |
294 |
|
* put blocks interruptibly if full |
295 |
|
*/ |
296 |
< |
public void testBlockingPut() { |
296 |
> |
public void testBlockingPut() throws InterruptedException { |
297 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
298 |
< |
Thread t = new Thread(new Runnable() { |
299 |
< |
public void run() { |
300 |
< |
int added = 0; |
301 |
< |
try { |
302 |
< |
for (int i = 0; i < SIZE; ++i) { |
303 |
< |
q.put(new Integer(i)); |
304 |
< |
++added; |
305 |
< |
} |
306 |
< |
q.put(new Integer(SIZE)); |
307 |
< |
threadShouldThrow(); |
308 |
< |
} catch (InterruptedException ie) { |
309 |
< |
threadAssertEquals(added, SIZE); |
310 |
< |
} |
311 |
< |
}}); |
312 |
< |
try { |
313 |
< |
t.start(); |
314 |
< |
Thread.sleep(MEDIUM_DELAY_MS); |
315 |
< |
t.interrupt(); |
342 |
< |
t.join(); |
343 |
< |
} |
344 |
< |
catch (InterruptedException ie) { |
345 |
< |
unexpectedException(); |
346 |
< |
} |
298 |
> |
Thread t = new Thread(new CheckedRunnable() { |
299 |
> |
public void realRun() throws InterruptedException { |
300 |
> |
for (int i = 0; i < SIZE; ++i) |
301 |
> |
q.put(i); |
302 |
> |
assertEquals(SIZE, q.size()); |
303 |
> |
assertEquals(0, q.remainingCapacity()); |
304 |
> |
try { |
305 |
> |
q.put(99); |
306 |
> |
shouldThrow(); |
307 |
> |
} catch (InterruptedException success) {} |
308 |
> |
}}); |
309 |
> |
|
310 |
> |
t.start(); |
311 |
> |
Thread.sleep(SHORT_DELAY_MS); |
312 |
> |
t.interrupt(); |
313 |
> |
t.join(); |
314 |
> |
assertEquals(SIZE, q.size()); |
315 |
> |
assertEquals(0, q.remainingCapacity()); |
316 |
|
} |
317 |
|
|
318 |
|
/** |
319 |
|
* put blocks waiting for take when full |
320 |
|
*/ |
321 |
< |
public void testPutWithTake() { |
321 |
> |
public void testPutWithTake() throws InterruptedException { |
322 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
323 |
< |
Thread t = new Thread(new Runnable() { |
324 |
< |
public void run() { |
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 |
< |
} catch (InterruptedException e) { |
337 |
< |
threadAssertTrue(added >= 2); |
338 |
< |
} |
339 |
< |
} |
340 |
< |
}); |
341 |
< |
try { |
342 |
< |
t.start(); |
343 |
< |
Thread.sleep(SHORT_DELAY_MS); |
344 |
< |
q.take(); |
345 |
< |
t.interrupt(); |
377 |
< |
t.join(); |
378 |
< |
} catch (Exception e) { |
379 |
< |
unexpectedException(); |
380 |
< |
} |
323 |
> |
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 |
> |
} catch (InterruptedException success) { |
337 |
> |
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 |
|
} |
347 |
|
|
348 |
|
/** |
349 |
|
* timed offer times out if full and elements not taken |
350 |
|
*/ |
351 |
< |
public void testTimedOffer() { |
351 |
> |
public void testTimedOffer() throws InterruptedException { |
352 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
353 |
< |
Thread t = new Thread(new Runnable() { |
354 |
< |
public void run() { |
355 |
< |
try { |
356 |
< |
q.put(new Object()); |
357 |
< |
q.put(new Object()); |
358 |
< |
threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, MILLISECONDS)); |
359 |
< |
q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
360 |
< |
threadShouldThrow(); |
361 |
< |
} catch (InterruptedException success) {} |
362 |
< |
} |
363 |
< |
}); |
364 |
< |
|
365 |
< |
try { |
366 |
< |
t.start(); |
367 |
< |
Thread.sleep(SHORT_DELAY_MS); |
403 |
< |
t.interrupt(); |
404 |
< |
t.join(); |
405 |
< |
} catch (Exception e) { |
406 |
< |
unexpectedException(); |
407 |
< |
} |
353 |
> |
Thread t = new Thread(new CheckedRunnable() { |
354 |
> |
public void realRun() throws InterruptedException { |
355 |
> |
q.put(new Object()); |
356 |
> |
q.put(new Object()); |
357 |
> |
assertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, MILLISECONDS)); |
358 |
> |
try { |
359 |
> |
q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
360 |
> |
shouldThrow(); |
361 |
> |
} catch (InterruptedException success) {} |
362 |
> |
}}); |
363 |
> |
|
364 |
> |
t.start(); |
365 |
> |
Thread.sleep(SHORT_DELAY_MS); |
366 |
> |
t.interrupt(); |
367 |
> |
t.join(); |
368 |
|
} |
369 |
|
|
370 |
|
/** |
371 |
|
* take retrieves elements in FIFO order |
372 |
|
*/ |
373 |
< |
public void testTake() { |
374 |
< |
try { |
375 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
376 |
< |
for (int i = 0; i < SIZE; ++i) { |
417 |
< |
assertEquals(i, ((Integer)q.take()).intValue()); |
418 |
< |
} |
419 |
< |
} catch (InterruptedException e) { |
420 |
< |
unexpectedException(); |
373 |
> |
public void testTake() throws InterruptedException { |
374 |
> |
ArrayBlockingQueue q = populatedQueue(SIZE); |
375 |
> |
for (int i = 0; i < SIZE; ++i) { |
376 |
> |
assertEquals(i, q.take()); |
377 |
|
} |
378 |
|
} |
379 |
|
|
380 |
|
/** |
381 |
|
* take blocks interruptibly when empty |
382 |
|
*/ |
383 |
< |
public void testTakeFromEmpty() { |
383 |
> |
public void testTakeFromEmpty() throws InterruptedException { |
384 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
385 |
< |
Thread t = new Thread(new Runnable() { |
386 |
< |
public void run() { |
387 |
< |
try { |
388 |
< |
q.take(); |
389 |
< |
threadShouldThrow(); |
390 |
< |
} catch (InterruptedException success) { } |
391 |
< |
} |
392 |
< |
}); |
393 |
< |
try { |
438 |
< |
t.start(); |
439 |
< |
Thread.sleep(SHORT_DELAY_MS); |
440 |
< |
t.interrupt(); |
441 |
< |
t.join(); |
442 |
< |
} catch (Exception e) { |
443 |
< |
unexpectedException(); |
444 |
< |
} |
385 |
> |
Thread t = new ThreadShouldThrow(InterruptedException.class) { |
386 |
> |
public void realRun() throws InterruptedException { |
387 |
> |
q.take(); |
388 |
> |
}}; |
389 |
> |
|
390 |
> |
t.start(); |
391 |
> |
Thread.sleep(SHORT_DELAY_MS); |
392 |
> |
t.interrupt(); |
393 |
> |
t.join(); |
394 |
|
} |
395 |
|
|
396 |
|
/** |
397 |
|
* Take removes existing elements until empty, then blocks interruptibly |
398 |
|
*/ |
399 |
< |
public void testBlockingTake() { |
400 |
< |
Thread t = new Thread(new Runnable() { |
401 |
< |
public void run() { |
402 |
< |
try { |
403 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
404 |
< |
for (int i = 0; i < SIZE; ++i) { |
405 |
< |
threadAssertEquals(i, ((Integer)q.take()).intValue()); |
406 |
< |
} |
407 |
< |
q.take(); |
408 |
< |
threadShouldThrow(); |
409 |
< |
} catch (InterruptedException success) { |
410 |
< |
} |
411 |
< |
}}); |
412 |
< |
try { |
413 |
< |
t.start(); |
414 |
< |
Thread.sleep(SHORT_DELAY_MS); |
415 |
< |
t.interrupt(); |
467 |
< |
t.join(); |
468 |
< |
} |
469 |
< |
catch (InterruptedException ie) { |
470 |
< |
unexpectedException(); |
471 |
< |
} |
399 |
> |
public void testBlockingTake() throws InterruptedException { |
400 |
> |
final ArrayBlockingQueue q = populatedQueue(SIZE); |
401 |
> |
Thread t = new Thread(new CheckedRunnable() { |
402 |
> |
public void realRun() throws InterruptedException { |
403 |
> |
for (int i = 0; i < SIZE; ++i) { |
404 |
> |
assertEquals(i, q.take()); |
405 |
> |
} |
406 |
> |
try { |
407 |
> |
q.take(); |
408 |
> |
shouldThrow(); |
409 |
> |
} catch (InterruptedException success) {} |
410 |
> |
}}); |
411 |
> |
|
412 |
> |
t.start(); |
413 |
> |
Thread.sleep(SHORT_DELAY_MS); |
414 |
> |
t.interrupt(); |
415 |
> |
t.join(); |
416 |
|
} |
417 |
|
|
418 |
|
|
422 |
|
public void testPoll() { |
423 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
424 |
|
for (int i = 0; i < SIZE; ++i) { |
425 |
< |
assertEquals(i, ((Integer)q.poll()).intValue()); |
425 |
> |
assertEquals(i, q.poll()); |
426 |
|
} |
427 |
|
assertNull(q.poll()); |
428 |
|
} |
430 |
|
/** |
431 |
|
* timed pool with zero timeout succeeds when non-empty, else times out |
432 |
|
*/ |
433 |
< |
public void testTimedPoll0() { |
434 |
< |
try { |
435 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
436 |
< |
for (int i = 0; i < SIZE; ++i) { |
493 |
< |
assertEquals(i, ((Integer)q.poll(0, MILLISECONDS)).intValue()); |
494 |
< |
} |
495 |
< |
assertNull(q.poll(0, MILLISECONDS)); |
496 |
< |
} catch (InterruptedException e) { |
497 |
< |
unexpectedException(); |
433 |
> |
public void testTimedPoll0() throws InterruptedException { |
434 |
> |
ArrayBlockingQueue q = populatedQueue(SIZE); |
435 |
> |
for (int i = 0; i < SIZE; ++i) { |
436 |
> |
assertEquals(i, q.poll(0, MILLISECONDS)); |
437 |
|
} |
438 |
+ |
assertNull(q.poll(0, MILLISECONDS)); |
439 |
|
} |
440 |
|
|
441 |
|
/** |
442 |
|
* timed pool with nonzero timeout succeeds when non-empty, else times out |
443 |
|
*/ |
444 |
< |
public void testTimedPoll() { |
445 |
< |
try { |
446 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
447 |
< |
for (int i = 0; i < SIZE; ++i) { |
508 |
< |
assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, MILLISECONDS)).intValue()); |
509 |
< |
} |
510 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
511 |
< |
} catch (InterruptedException e) { |
512 |
< |
unexpectedException(); |
444 |
> |
public void testTimedPoll() throws InterruptedException { |
445 |
> |
ArrayBlockingQueue q = populatedQueue(SIZE); |
446 |
> |
for (int i = 0; i < SIZE; ++i) { |
447 |
> |
assertEquals(i, q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
448 |
|
} |
449 |
+ |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
450 |
|
} |
451 |
|
|
452 |
|
/** |
453 |
|
* Interrupted timed poll throws InterruptedException instead of |
454 |
|
* returning timeout status |
455 |
|
*/ |
456 |
< |
public void testInterruptedTimedPoll() { |
457 |
< |
Thread t = new Thread(new Runnable() { |
458 |
< |
public void run() { |
459 |
< |
try { |
460 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
461 |
< |
for (int i = 0; i < SIZE; ++i) { |
462 |
< |
threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, MILLISECONDS)).intValue()); |
463 |
< |
} |
464 |
< |
threadAssertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
465 |
< |
} catch (InterruptedException success) { |
466 |
< |
} |
467 |
< |
}}); |
468 |
< |
try { |
469 |
< |
t.start(); |
470 |
< |
Thread.sleep(SHORT_DELAY_MS); |
471 |
< |
t.interrupt(); |
472 |
< |
t.join(); |
537 |
< |
} |
538 |
< |
catch (InterruptedException ie) { |
539 |
< |
unexpectedException(); |
540 |
< |
} |
456 |
> |
public void testInterruptedTimedPoll() throws InterruptedException { |
457 |
> |
Thread t = new Thread(new CheckedRunnable() { |
458 |
> |
public void realRun() throws InterruptedException { |
459 |
> |
ArrayBlockingQueue q = populatedQueue(SIZE); |
460 |
> |
for (int i = 0; i < SIZE; ++i) { |
461 |
> |
assertEquals(i, q.poll(SHORT_DELAY_MS, MILLISECONDS));; |
462 |
> |
} |
463 |
> |
try { |
464 |
> |
q.poll(SMALL_DELAY_MS, MILLISECONDS); |
465 |
> |
shouldThrow(); |
466 |
> |
} catch (InterruptedException success) {} |
467 |
> |
}}); |
468 |
> |
|
469 |
> |
t.start(); |
470 |
> |
Thread.sleep(SHORT_DELAY_MS); |
471 |
> |
t.interrupt(); |
472 |
> |
t.join(); |
473 |
|
} |
474 |
|
|
475 |
|
/** |
476 |
|
* timed poll before a delayed offer fails; after offer succeeds; |
477 |
|
* on interruption throws |
478 |
|
*/ |
479 |
< |
public void testTimedPollWithOffer() { |
479 |
> |
public void testTimedPollWithOffer() throws InterruptedException { |
480 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
481 |
< |
Thread t = new Thread(new Runnable() { |
482 |
< |
public void run() { |
483 |
< |
try { |
484 |
< |
threadAssertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
485 |
< |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
486 |
< |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
487 |
< |
threadShouldThrow(); |
488 |
< |
} catch (InterruptedException success) { } |
489 |
< |
} |
490 |
< |
}); |
491 |
< |
try { |
492 |
< |
t.start(); |
493 |
< |
Thread.sleep(SMALL_DELAY_MS); |
494 |
< |
assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS)); |
495 |
< |
t.interrupt(); |
564 |
< |
t.join(); |
565 |
< |
} catch (Exception e) { |
566 |
< |
unexpectedException(); |
567 |
< |
} |
481 |
> |
Thread t = new Thread(new CheckedRunnable() { |
482 |
> |
public void realRun() throws InterruptedException { |
483 |
> |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
484 |
> |
assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
485 |
> |
try { |
486 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
487 |
> |
shouldThrow(); |
488 |
> |
} catch (InterruptedException success) {} |
489 |
> |
}}); |
490 |
> |
|
491 |
> |
t.start(); |
492 |
> |
Thread.sleep(SMALL_DELAY_MS); |
493 |
> |
assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS)); |
494 |
> |
t.interrupt(); |
495 |
> |
t.join(); |
496 |
|
} |
497 |
|
|
498 |
|
|
502 |
|
public void testPeek() { |
503 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
504 |
|
for (int i = 0; i < SIZE; ++i) { |
505 |
< |
assertEquals(i, ((Integer)q.peek()).intValue()); |
506 |
< |
q.poll(); |
505 |
> |
assertEquals(i, q.peek()); |
506 |
> |
assertEquals(i, q.poll()); |
507 |
|
assertTrue(q.peek() == null || |
508 |
< |
i != ((Integer)q.peek()).intValue()); |
508 |
> |
!q.peek().equals(i)); |
509 |
|
} |
510 |
|
assertNull(q.peek()); |
511 |
|
} |
516 |
|
public void testElement() { |
517 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
518 |
|
for (int i = 0; i < SIZE; ++i) { |
519 |
< |
assertEquals(i, ((Integer)q.element()).intValue()); |
520 |
< |
q.poll(); |
519 |
> |
assertEquals(i, q.element()); |
520 |
> |
assertEquals(i, q.poll()); |
521 |
|
} |
522 |
|
try { |
523 |
|
q.element(); |
524 |
|
shouldThrow(); |
525 |
< |
} |
598 |
< |
catch (NoSuchElementException success) {} |
525 |
> |
} catch (NoSuchElementException success) {} |
526 |
|
} |
527 |
|
|
528 |
|
/** |
531 |
|
public void testRemove() { |
532 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
533 |
|
for (int i = 0; i < SIZE; ++i) { |
534 |
< |
assertEquals(i, ((Integer)q.remove()).intValue()); |
534 |
> |
assertEquals(i, q.remove()); |
535 |
|
} |
536 |
|
try { |
537 |
|
q.remove(); |
538 |
|
shouldThrow(); |
539 |
< |
} catch (NoSuchElementException success) { |
613 |
< |
} |
539 |
> |
} catch (NoSuchElementException success) {} |
540 |
|
} |
541 |
|
|
542 |
|
/** |
561 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
562 |
|
for (int i = 0; i < SIZE; ++i) { |
563 |
|
assertTrue(q.contains(new Integer(i))); |
564 |
< |
q.poll(); |
564 |
> |
assertEquals(i, q.poll()); |
565 |
|
assertFalse(q.contains(new Integer(i))); |
566 |
|
} |
567 |
|
} |
634 |
|
/** |
635 |
|
* toArray contains all elements |
636 |
|
*/ |
637 |
< |
public void testToArray() { |
637 |
> |
public void testToArray() throws InterruptedException { |
638 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
639 |
|
Object[] o = q.toArray(); |
714 |
– |
try { |
640 |
|
for (int i = 0; i < o.length; i++) |
641 |
|
assertEquals(o[i], q.take()); |
717 |
– |
} catch (InterruptedException e) { |
718 |
– |
unexpectedException(); |
719 |
– |
} |
642 |
|
} |
643 |
|
|
644 |
|
/** |
645 |
|
* toArray(a) contains all elements |
646 |
|
*/ |
647 |
< |
public void testToArray2() { |
647 |
> |
public void testToArray2() throws InterruptedException { |
648 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
649 |
|
Integer[] ints = new Integer[SIZE]; |
650 |
|
ints = (Integer[])q.toArray(ints); |
651 |
< |
try { |
652 |
< |
for (int i = 0; i < ints.length; i++) |
731 |
< |
assertEquals(ints[i], q.take()); |
732 |
< |
} catch (InterruptedException e) { |
733 |
< |
unexpectedException(); |
734 |
< |
} |
651 |
> |
for (int i = 0; i < ints.length; i++) |
652 |
> |
assertEquals(ints[i], q.take()); |
653 |
|
} |
654 |
|
|
655 |
|
/** |
656 |
|
* toArray(null) throws NPE |
657 |
|
*/ |
658 |
|
public void testToArray_BadArg() { |
659 |
+ |
ArrayBlockingQueue q = populatedQueue(SIZE); |
660 |
|
try { |
742 |
– |
ArrayBlockingQueue q = populatedQueue(SIZE); |
661 |
|
Object o[] = q.toArray(null); |
662 |
|
shouldThrow(); |
663 |
|
} catch (NullPointerException success) {} |
667 |
|
* toArray with incompatible array type throws CCE |
668 |
|
*/ |
669 |
|
public void testToArray1_BadArg() { |
670 |
+ |
ArrayBlockingQueue q = populatedQueue(SIZE); |
671 |
|
try { |
672 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
754 |
< |
Object o[] = q.toArray(new String[10] ); |
672 |
> |
Object o[] = q.toArray(new String[10]); |
673 |
|
shouldThrow(); |
674 |
< |
} catch (ArrayStoreException success) {} |
674 |
> |
} catch (ArrayStoreException success) {} |
675 |
|
} |
676 |
|
|
677 |
|
|
678 |
|
/** |
679 |
|
* iterator iterates through all elements |
680 |
|
*/ |
681 |
< |
public void testIterator() { |
681 |
> |
public void testIterator() throws InterruptedException { |
682 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
683 |
|
Iterator it = q.iterator(); |
684 |
< |
try { |
685 |
< |
while (it.hasNext()) { |
768 |
< |
assertEquals(it.next(), q.take()); |
769 |
< |
} |
770 |
< |
} catch (InterruptedException e) { |
771 |
< |
unexpectedException(); |
684 |
> |
while (it.hasNext()) { |
685 |
> |
assertEquals(it.next(), q.take()); |
686 |
|
} |
687 |
|
} |
688 |
|
|
718 |
|
|
719 |
|
int k = 0; |
720 |
|
for (Iterator it = q.iterator(); it.hasNext();) { |
721 |
< |
int i = ((Integer)(it.next())).intValue(); |
808 |
< |
assertEquals(++k, i); |
721 |
> |
assertEquals(++k, it.next()); |
722 |
|
} |
723 |
|
assertEquals(3, k); |
724 |
|
} |
731 |
|
q.add(one); |
732 |
|
q.add(two); |
733 |
|
q.add(three); |
734 |
< |
try { |
735 |
< |
for (Iterator it = q.iterator(); it.hasNext();) { |
736 |
< |
q.remove(); |
824 |
< |
it.next(); |
825 |
< |
} |
826 |
< |
} |
827 |
< |
catch (ConcurrentModificationException e) { |
828 |
< |
unexpectedException(); |
734 |
> |
for (Iterator it = q.iterator(); it.hasNext();) { |
735 |
> |
q.remove(); |
736 |
> |
it.next(); |
737 |
|
} |
738 |
|
assertEquals(0, q.size()); |
739 |
|
} |
759 |
|
q.add(one); |
760 |
|
q.add(two); |
761 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
762 |
< |
executor.execute(new Runnable() { |
763 |
< |
public void run() { |
762 |
> |
executor.execute(new CheckedRunnable() { |
763 |
> |
public void realRun() throws InterruptedException { |
764 |
|
threadAssertFalse(q.offer(three)); |
765 |
< |
try { |
766 |
< |
threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS)); |
767 |
< |
threadAssertEquals(0, q.remainingCapacity()); |
768 |
< |
} |
769 |
< |
catch (InterruptedException e) { |
770 |
< |
threadUnexpectedException(); |
771 |
< |
} |
772 |
< |
} |
773 |
< |
}); |
866 |
< |
|
867 |
< |
executor.execute(new Runnable() { |
868 |
< |
public void run() { |
869 |
< |
try { |
870 |
< |
Thread.sleep(SMALL_DELAY_MS); |
871 |
< |
threadAssertEquals(one, q.take()); |
872 |
< |
} |
873 |
< |
catch (InterruptedException e) { |
874 |
< |
threadUnexpectedException(); |
875 |
< |
} |
876 |
< |
} |
877 |
< |
}); |
765 |
> |
threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS)); |
766 |
> |
threadAssertEquals(0, q.remainingCapacity()); |
767 |
> |
}}); |
768 |
> |
|
769 |
> |
executor.execute(new CheckedRunnable() { |
770 |
> |
public void realRun() throws InterruptedException { |
771 |
> |
Thread.sleep(SMALL_DELAY_MS); |
772 |
> |
threadAssertEquals(one, q.take()); |
773 |
> |
}}); |
774 |
|
|
775 |
|
joinPool(executor); |
776 |
|
|
782 |
|
public void testPollInExecutor() { |
783 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
784 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
785 |
< |
executor.execute(new Runnable() { |
786 |
< |
public void run() { |
785 |
> |
executor.execute(new CheckedRunnable() { |
786 |
> |
public void realRun() throws InterruptedException { |
787 |
|
threadAssertNull(q.poll()); |
788 |
< |
try { |
789 |
< |
threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
790 |
< |
threadAssertTrue(q.isEmpty()); |
791 |
< |
} |
792 |
< |
catch (InterruptedException e) { |
793 |
< |
threadUnexpectedException(); |
794 |
< |
} |
795 |
< |
} |
796 |
< |
}); |
901 |
< |
|
902 |
< |
executor.execute(new Runnable() { |
903 |
< |
public void run() { |
904 |
< |
try { |
905 |
< |
Thread.sleep(SMALL_DELAY_MS); |
906 |
< |
q.put(one); |
907 |
< |
} |
908 |
< |
catch (InterruptedException e) { |
909 |
< |
threadUnexpectedException(); |
910 |
< |
} |
911 |
< |
} |
912 |
< |
}); |
788 |
> |
threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
789 |
> |
threadAssertTrue(q.isEmpty()); |
790 |
> |
}}); |
791 |
> |
|
792 |
> |
executor.execute(new CheckedRunnable() { |
793 |
> |
public void realRun() throws InterruptedException { |
794 |
> |
Thread.sleep(SMALL_DELAY_MS); |
795 |
> |
q.put(one); |
796 |
> |
}}); |
797 |
|
|
798 |
|
joinPool(executor); |
799 |
|
} |
801 |
|
/** |
802 |
|
* A deserialized serialized queue has same elements in same order |
803 |
|
*/ |
804 |
< |
public void testSerialization() { |
804 |
> |
public void testSerialization() throws Exception { |
805 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
806 |
|
|
807 |
< |
try { |
808 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
809 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
810 |
< |
out.writeObject(q); |
811 |
< |
out.close(); |
812 |
< |
|
813 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
814 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
815 |
< |
ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject(); |
816 |
< |
assertEquals(q.size(), r.size()); |
817 |
< |
while (!q.isEmpty()) |
934 |
< |
assertEquals(q.remove(), r.remove()); |
935 |
< |
} catch (Exception e) { |
936 |
< |
unexpectedException(); |
937 |
< |
} |
807 |
> |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
808 |
> |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
809 |
> |
out.writeObject(q); |
810 |
> |
out.close(); |
811 |
> |
|
812 |
> |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
813 |
> |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
814 |
> |
ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject(); |
815 |
> |
assertEquals(q.size(), r.size()); |
816 |
> |
while (!q.isEmpty()) |
817 |
> |
assertEquals(q.remove(), r.remove()); |
818 |
|
} |
819 |
|
|
820 |
|
/** |
825 |
|
try { |
826 |
|
q.drainTo(null); |
827 |
|
shouldThrow(); |
828 |
< |
} catch (NullPointerException success) { |
949 |
< |
} |
828 |
> |
} catch (NullPointerException success) {} |
829 |
|
} |
830 |
|
|
831 |
|
/** |
836 |
|
try { |
837 |
|
q.drainTo(q); |
838 |
|
shouldThrow(); |
839 |
< |
} catch (IllegalArgumentException success) { |
961 |
< |
} |
839 |
> |
} catch (IllegalArgumentException success) {} |
840 |
|
} |
841 |
|
|
842 |
|
/** |
866 |
|
/** |
867 |
|
* drainTo empties full queue, unblocking a waiting put. |
868 |
|
*/ |
869 |
< |
public void testDrainToWithActivePut() { |
869 |
> |
public void testDrainToWithActivePut() throws InterruptedException { |
870 |
|
final ArrayBlockingQueue q = populatedQueue(SIZE); |
871 |
< |
Thread t = new Thread(new Runnable() { |
872 |
< |
public void run() { |
873 |
< |
try { |
874 |
< |
q.put(new Integer(SIZE+1)); |
875 |
< |
} catch (InterruptedException ie) { |
876 |
< |
threadUnexpectedException(); |
877 |
< |
} |
878 |
< |
} |
879 |
< |
}); |
880 |
< |
try { |
881 |
< |
t.start(); |
882 |
< |
ArrayList l = new ArrayList(); |
883 |
< |
q.drainTo(l); |
1006 |
< |
assertTrue(l.size() >= SIZE); |
1007 |
< |
for (int i = 0; i < SIZE; ++i) |
1008 |
< |
assertEquals(l.get(i), new Integer(i)); |
1009 |
< |
t.join(); |
1010 |
< |
assertTrue(q.size() + l.size() >= SIZE); |
1011 |
< |
} catch (Exception e) { |
1012 |
< |
unexpectedException(); |
1013 |
< |
} |
871 |
> |
Thread t = new Thread(new CheckedRunnable() { |
872 |
> |
public void realRun() throws InterruptedException { |
873 |
> |
q.put(new Integer(SIZE+1)); |
874 |
> |
}}); |
875 |
> |
|
876 |
> |
t.start(); |
877 |
> |
ArrayList l = new ArrayList(); |
878 |
> |
q.drainTo(l); |
879 |
> |
assertTrue(l.size() >= SIZE); |
880 |
> |
for (int i = 0; i < SIZE; ++i) |
881 |
> |
assertEquals(l.get(i), new Integer(i)); |
882 |
> |
t.join(); |
883 |
> |
assertTrue(q.size() + l.size() >= SIZE); |
884 |
|
} |
885 |
|
|
886 |
|
/** |
891 |
|
try { |
892 |
|
q.drainTo(null, 0); |
893 |
|
shouldThrow(); |
894 |
< |
} catch (NullPointerException success) { |
1025 |
< |
} |
894 |
> |
} catch (NullPointerException success) {} |
895 |
|
} |
896 |
|
|
897 |
|
/** |
902 |
|
try { |
903 |
|
q.drainTo(q, 0); |
904 |
|
shouldThrow(); |
905 |
< |
} catch (IllegalArgumentException success) { |
1037 |
< |
} |
905 |
> |
} catch (IllegalArgumentException success) {} |
906 |
|
} |
907 |
|
|
908 |
|
/** |
924 |
|
} |
925 |
|
} |
926 |
|
|
1059 |
– |
|
927 |
|
} |