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 - 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()); |
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) { |
373 |
< |
assertEquals(i, q.take()); |
374 |
< |
} |
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 |
|
} |