22 |
|
} |
23 |
|
|
24 |
|
public static Test suite() { |
25 |
< |
return new TestSuite(ArrayDequeTest.class); |
25 |
> |
class Implementation implements CollectionImplementation { |
26 |
> |
public Class<?> klazz() { return ArrayDeque.class; } |
27 |
> |
public Collection emptyCollection() { return new ArrayDeque(); } |
28 |
> |
public Object makeElement(int i) { return i; } |
29 |
> |
public boolean isConcurrent() { return false; } |
30 |
> |
public boolean permitsNulls() { return false; } |
31 |
> |
} |
32 |
> |
return newTestSuite(ArrayDequeTest.class, |
33 |
> |
CollectionTest.testSuite(new Implementation())); |
34 |
|
} |
35 |
|
|
36 |
|
/** |
37 |
|
* Returns a new deque of given size containing consecutive |
38 |
< |
* Integers 0 ... n. |
38 |
> |
* Integers 0 ... n - 1. |
39 |
|
*/ |
40 |
|
private ArrayDeque<Integer> populatedDeque(int n) { |
41 |
|
ArrayDeque<Integer> q = new ArrayDeque<Integer>(); |
44 |
|
assertTrue(q.offerLast(new Integer(i))); |
45 |
|
assertFalse(q.isEmpty()); |
46 |
|
assertEquals(n, q.size()); |
47 |
+ |
assertEquals((Integer) 0, q.peekFirst()); |
48 |
+ |
assertEquals((Integer) (n - 1), q.peekLast()); |
49 |
|
return q; |
50 |
|
} |
51 |
|
|
540 |
|
*/ |
541 |
|
public void testRemoveFirstOccurrence() { |
542 |
|
ArrayDeque q = populatedDeque(SIZE); |
543 |
+ |
assertFalse(q.removeFirstOccurrence(null)); |
544 |
|
for (int i = 1; i < SIZE; i += 2) { |
545 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
546 |
|
} |
549 |
|
assertFalse(q.removeFirstOccurrence(new Integer(i + 1))); |
550 |
|
} |
551 |
|
assertTrue(q.isEmpty()); |
552 |
+ |
assertFalse(q.removeFirstOccurrence(null)); |
553 |
+ |
assertFalse(q.removeFirstOccurrence(42)); |
554 |
+ |
q = new ArrayDeque(); |
555 |
+ |
assertFalse(q.removeFirstOccurrence(null)); |
556 |
+ |
assertFalse(q.removeFirstOccurrence(42)); |
557 |
|
} |
558 |
|
|
559 |
|
/** |
561 |
|
*/ |
562 |
|
public void testRemoveLastOccurrence() { |
563 |
|
ArrayDeque q = populatedDeque(SIZE); |
564 |
+ |
assertFalse(q.removeLastOccurrence(null)); |
565 |
|
for (int i = 1; i < SIZE; i += 2) { |
566 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
567 |
|
} |
570 |
|
assertFalse(q.removeLastOccurrence(new Integer(i + 1))); |
571 |
|
} |
572 |
|
assertTrue(q.isEmpty()); |
573 |
+ |
assertFalse(q.removeLastOccurrence(null)); |
574 |
+ |
assertFalse(q.removeLastOccurrence(42)); |
575 |
+ |
q = new ArrayDeque(); |
576 |
+ |
assertFalse(q.removeLastOccurrence(null)); |
577 |
+ |
assertFalse(q.removeLastOccurrence(42)); |
578 |
|
} |
579 |
|
|
580 |
|
/** |