21 |
|
} |
22 |
|
|
23 |
|
public static Test suite() { |
24 |
< |
return new TestSuite(LinkedListTest.class); |
24 |
> |
class Implementation implements CollectionImplementation { |
25 |
> |
public Class<?> klazz() { return LinkedList.class; } |
26 |
> |
public Collection emptyCollection() { return new LinkedList(); } |
27 |
> |
public Object makeElement(int i) { return i; } |
28 |
> |
public boolean isConcurrent() { return false; } |
29 |
> |
public boolean permitsNulls() { return true; } |
30 |
> |
} |
31 |
> |
class SubListImplementation extends Implementation { |
32 |
> |
public Collection emptyCollection() { |
33 |
> |
return new LinkedList().subList(0, 0); |
34 |
> |
} |
35 |
> |
} |
36 |
> |
return newTestSuite( |
37 |
> |
LinkedListTest.class, |
38 |
> |
CollectionTest.testSuite(new Implementation()), |
39 |
> |
CollectionTest.testSuite(new SubListImplementation())); |
40 |
|
} |
41 |
|
|
42 |
|
/** |
43 |
|
* Returns a new queue of given size containing consecutive |
44 |
< |
* Integers 0 ... n. |
44 |
> |
* Integers 0 ... n - 1. |
45 |
|
*/ |
46 |
|
private LinkedList<Integer> populatedQueue(int n) { |
47 |
< |
LinkedList<Integer> q = new LinkedList<Integer>(); |
47 |
> |
LinkedList<Integer> q = new LinkedList<>(); |
48 |
|
assertTrue(q.isEmpty()); |
49 |
|
for (int i = 0; i < n; ++i) |
50 |
|
assertTrue(q.offer(new Integer(i))); |
51 |
|
assertFalse(q.isEmpty()); |
52 |
|
assertEquals(n, q.size()); |
53 |
+ |
assertEquals((Integer) 0, q.peekFirst()); |
54 |
+ |
assertEquals((Integer) (n - 1), q.peekLast()); |
55 |
|
return q; |
56 |
|
} |
57 |
|
|