23 |
|
} |
24 |
|
|
25 |
|
public static Test suite() { |
26 |
< |
return new TestSuite(ConcurrentLinkedQueueTest.class); |
26 |
> |
class Implementation implements CollectionImplementation { |
27 |
> |
public Class<?> klazz() { return ConcurrentLinkedQueue.class; } |
28 |
> |
public Collection emptyCollection() { return new ConcurrentLinkedQueue(); } |
29 |
> |
public Object makeElement(int i) { return i; } |
30 |
> |
public boolean isConcurrent() { return true; } |
31 |
> |
public boolean permitsNulls() { return false; } |
32 |
> |
} |
33 |
> |
return newTestSuite(ConcurrentLinkedQueueTest.class, |
34 |
> |
CollectionTest.testSuite(new Implementation())); |
35 |
|
} |
36 |
|
|
37 |
|
/** |
38 |
|
* Returns a new queue of given size containing consecutive |
39 |
< |
* Integers 0 ... n. |
39 |
> |
* Integers 0 ... n - 1. |
40 |
|
*/ |
41 |
|
private ConcurrentLinkedQueue<Integer> populatedQueue(int n) { |
42 |
< |
ConcurrentLinkedQueue<Integer> q = new ConcurrentLinkedQueue<Integer>(); |
42 |
> |
ConcurrentLinkedQueue<Integer> q = new ConcurrentLinkedQueue<>(); |
43 |
|
assertTrue(q.isEmpty()); |
44 |
|
for (int i = 0; i < n; ++i) |
45 |
|
assertTrue(q.offer(new Integer(i))); |
46 |
|
assertFalse(q.isEmpty()); |
47 |
|
assertEquals(n, q.size()); |
48 |
+ |
assertEquals((Integer) 0, q.peek()); |
49 |
|
return q; |
50 |
|
} |
51 |
|
|
298 |
|
assertTrue(q.contains(i)); |
299 |
|
assertTrue(q.remove(i)); |
300 |
|
assertFalse(q.contains(i)); |
301 |
< |
assertTrue(q.contains(i-1)); |
301 |
> |
assertTrue(q.contains(i - 1)); |
302 |
|
} |
303 |
|
for (int i = 0; i < SIZE; i += 2) { |
304 |
|
assertTrue(q.contains(i)); |
305 |
|
assertTrue(q.remove(i)); |
306 |
|
assertFalse(q.contains(i)); |
307 |
< |
assertFalse(q.remove(i+1)); |
308 |
< |
assertFalse(q.contains(i+1)); |
307 |
> |
assertFalse(q.remove(i + 1)); |
308 |
> |
assertFalse(q.contains(i + 1)); |
309 |
|
} |
310 |
|
assertTrue(q.isEmpty()); |
311 |
|
} |