87 |
|
public void testSize() { |
88 |
|
LinkedList q = populatedQueue(SIZE); |
89 |
|
for (int i = 0; i < SIZE; ++i) { |
90 |
< |
assertEquals(SIZE-i, q.size()); |
90 |
> |
assertEquals(SIZE - i, q.size()); |
91 |
|
q.remove(); |
92 |
|
} |
93 |
|
for (int i = 0; i < SIZE; ++i) { |
309 |
|
assertTrue(changed); |
310 |
|
|
311 |
|
assertTrue(q.containsAll(p)); |
312 |
< |
assertEquals(SIZE-i, q.size()); |
312 |
> |
assertEquals(SIZE - i, q.size()); |
313 |
|
p.remove(); |
314 |
|
} |
315 |
|
} |
322 |
|
LinkedList q = populatedQueue(SIZE); |
323 |
|
LinkedList p = populatedQueue(i); |
324 |
|
assertTrue(q.removeAll(p)); |
325 |
< |
assertEquals(SIZE-i, q.size()); |
325 |
> |
assertEquals(SIZE - i, q.size()); |
326 |
|
for (int j = 0; j < i; ++j) { |
327 |
|
Integer x = (Integer)(p.remove()); |
328 |
|
assertFalse(q.contains(x)); |
547 |
|
*/ |
548 |
|
public void testPollLast() { |
549 |
|
LinkedList q = populatedQueue(SIZE); |
550 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
550 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
551 |
|
assertEquals(i, q.pollLast()); |
552 |
|
} |
553 |
|
assertNull(q.pollLast()); |
572 |
|
*/ |
573 |
|
public void testPeekLast() { |
574 |
|
LinkedList q = populatedQueue(SIZE); |
575 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
575 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
576 |
|
assertEquals(i, q.peekLast()); |
577 |
|
assertEquals(i, q.pollLast()); |
578 |
|
assertTrue(q.peekLast() == null || |
598 |
|
*/ |
599 |
|
public void testLastElement() { |
600 |
|
LinkedList q = populatedQueue(SIZE); |
601 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
601 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
602 |
|
assertEquals(i, q.getLast()); |
603 |
|
assertEquals(i, q.pollLast()); |
604 |
|
} |