41 |
|
} |
42 |
|
|
43 |
|
public static Test suite() { |
44 |
+ |
class Implementation implements CollectionImplementation { |
45 |
+ |
public Class<?> klazz() { return LinkedBlockingQueue.class; } |
46 |
+ |
public Collection emptyCollection() { return new LinkedBlockingQueue(); } |
47 |
+ |
public Object makeElement(int i) { return i; } |
48 |
+ |
public boolean isConcurrent() { return true; } |
49 |
+ |
public boolean permitsNulls() { return false; } |
50 |
+ |
} |
51 |
|
return newTestSuite(LinkedBlockingQueueTest.class, |
52 |
|
new Unbounded().testSuite(), |
53 |
< |
new Bounded().testSuite()); |
53 |
> |
new Bounded().testSuite(), |
54 |
> |
CollectionTest.testSuite(new Implementation())); |
55 |
|
} |
56 |
|
|
57 |
|
/** |
58 |
|
* Returns a new queue of given size containing consecutive |
59 |
< |
* Integers 0 ... n. |
59 |
> |
* Integers 0 ... n - 1. |
60 |
|
*/ |
61 |
< |
private LinkedBlockingQueue<Integer> populatedQueue(int n) { |
61 |
> |
private static LinkedBlockingQueue<Integer> populatedQueue(int n) { |
62 |
|
LinkedBlockingQueue<Integer> q = |
63 |
|
new LinkedBlockingQueue<Integer>(n); |
64 |
|
assertTrue(q.isEmpty()); |
67 |
|
assertFalse(q.isEmpty()); |
68 |
|
assertEquals(0, q.remainingCapacity()); |
69 |
|
assertEquals(n, q.size()); |
70 |
+ |
assertEquals((Integer) 0, q.peek()); |
71 |
|
return q; |
72 |
|
} |
73 |
|
|
292 |
|
}}); |
293 |
|
|
294 |
|
await(pleaseInterrupt); |
295 |
< |
assertThreadStaysAlive(t); |
295 |
> |
assertThreadBlocks(t, Thread.State.WAITING); |
296 |
|
t.interrupt(); |
297 |
|
awaitTermination(t); |
298 |
|
assertEquals(SIZE, q.size()); |
327 |
|
assertEquals(0, q.take()); |
328 |
|
|
329 |
|
await(pleaseInterrupt); |
330 |
< |
assertThreadStaysAlive(t); |
330 |
> |
assertThreadBlocks(t, Thread.State.WAITING); |
331 |
|
t.interrupt(); |
332 |
|
awaitTermination(t); |
333 |
|
assertEquals(0, q.remainingCapacity()); |
354 |
|
}}); |
355 |
|
|
356 |
|
await(pleaseInterrupt); |
357 |
< |
assertThreadStaysAlive(t); |
357 |
> |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
358 |
|
t.interrupt(); |
359 |
|
awaitTermination(t); |
360 |
|
} |
377 |
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
378 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
379 |
|
public void realRun() throws InterruptedException { |
380 |
< |
for (int i = 0; i < SIZE; ++i) { |
372 |
< |
assertEquals(i, q.take()); |
373 |
< |
} |
380 |
> |
for (int i = 0; i < SIZE; i++) assertEquals(i, q.take()); |
381 |
|
|
382 |
|
Thread.currentThread().interrupt(); |
383 |
|
try { |
395 |
|
}}); |
396 |
|
|
397 |
|
await(pleaseInterrupt); |
398 |
< |
assertThreadStaysAlive(t); |
398 |
> |
assertThreadBlocks(t, Thread.State.WAITING); |
399 |
|
t.interrupt(); |
400 |
|
awaitTermination(t); |
401 |
|
} |
447 |
|
final CountDownLatch aboutToWait = new CountDownLatch(1); |
448 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
449 |
|
public void realRun() throws InterruptedException { |
450 |
+ |
long startTime = System.nanoTime(); |
451 |
|
for (int i = 0; i < SIZE; ++i) { |
444 |
– |
long t0 = System.nanoTime(); |
452 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
446 |
– |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
453 |
|
} |
448 |
– |
long t0 = System.nanoTime(); |
454 |
|
aboutToWait.countDown(); |
455 |
|
try { |
456 |
< |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
456 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
457 |
|
shouldThrow(); |
458 |
|
} catch (InterruptedException success) { |
459 |
< |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
459 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
460 |
|
} |
461 |
|
}}); |
462 |
|
|
463 |
< |
aboutToWait.await(); |
464 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
463 |
> |
await(aboutToWait); |
464 |
> |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
465 |
|
t.interrupt(); |
466 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
466 |
> |
awaitTermination(t); |
467 |
|
checkEmpty(q); |
468 |
|
} |
469 |
|
|