| 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) { |
| 62 |
|
LinkedBlockingQueue<Integer> q = |
| 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 |
|
|
