26 |
|
|
27 |
|
/** |
28 |
|
* Returns a new queue of given size containing consecutive |
29 |
< |
* Integers 0 ... n. |
29 |
> |
* Integers 0 ... n - 1. |
30 |
|
*/ |
31 |
|
private LinkedList<Integer> populatedQueue(int n) { |
32 |
|
LinkedList<Integer> q = new LinkedList<Integer>(); |
35 |
|
assertTrue(q.offer(new Integer(i))); |
36 |
|
assertFalse(q.isEmpty()); |
37 |
|
assertEquals(n, q.size()); |
38 |
+ |
assertEquals((Integer) 0, q.peekFirst()); |
39 |
+ |
assertEquals((Integer) (n - 1), q.peekLast()); |
40 |
|
return q; |
41 |
|
} |
42 |
|
|
89 |
|
public void testSize() { |
90 |
|
LinkedList q = populatedQueue(SIZE); |
91 |
|
for (int i = 0; i < SIZE; ++i) { |
92 |
< |
assertEquals(SIZE-i, q.size()); |
92 |
> |
assertEquals(SIZE - i, q.size()); |
93 |
|
q.remove(); |
94 |
|
} |
95 |
|
for (int i = 0; i < SIZE; ++i) { |
245 |
|
assertTrue(q.contains(i)); |
246 |
|
assertTrue(q.remove((Integer)i)); |
247 |
|
assertFalse(q.contains(i)); |
248 |
< |
assertTrue(q.contains(i-1)); |
248 |
> |
assertTrue(q.contains(i - 1)); |
249 |
|
} |
250 |
|
for (int i = 0; i < SIZE; i += 2) { |
251 |
|
assertTrue(q.contains(i)); |
252 |
|
assertTrue(q.remove((Integer)i)); |
253 |
|
assertFalse(q.contains(i)); |
254 |
< |
assertFalse(q.remove((Integer)(i+1))); |
255 |
< |
assertFalse(q.contains(i+1)); |
254 |
> |
assertFalse(q.remove((Integer)(i + 1))); |
255 |
> |
assertFalse(q.contains(i + 1)); |
256 |
|
} |
257 |
|
assertTrue(q.isEmpty()); |
258 |
|
} |
311 |
|
assertTrue(changed); |
312 |
|
|
313 |
|
assertTrue(q.containsAll(p)); |
314 |
< |
assertEquals(SIZE-i, q.size()); |
314 |
> |
assertEquals(SIZE - i, q.size()); |
315 |
|
p.remove(); |
316 |
|
} |
317 |
|
} |
324 |
|
LinkedList q = populatedQueue(SIZE); |
325 |
|
LinkedList p = populatedQueue(i); |
326 |
|
assertTrue(q.removeAll(p)); |
327 |
< |
assertEquals(SIZE-i, q.size()); |
327 |
> |
assertEquals(SIZE - i, q.size()); |
328 |
|
for (int j = 0; j < i; ++j) { |
329 |
|
Integer x = (Integer)(p.remove()); |
330 |
|
assertFalse(q.contains(x)); |
549 |
|
*/ |
550 |
|
public void testPollLast() { |
551 |
|
LinkedList q = populatedQueue(SIZE); |
552 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
552 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
553 |
|
assertEquals(i, q.pollLast()); |
554 |
|
} |
555 |
|
assertNull(q.pollLast()); |
574 |
|
*/ |
575 |
|
public void testPeekLast() { |
576 |
|
LinkedList q = populatedQueue(SIZE); |
577 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
577 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
578 |
|
assertEquals(i, q.peekLast()); |
579 |
|
assertEquals(i, q.pollLast()); |
580 |
|
assertTrue(q.peekLast() == null || |
600 |
|
*/ |
601 |
|
public void testLastElement() { |
602 |
|
LinkedList q = populatedQueue(SIZE); |
603 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
603 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
604 |
|
assertEquals(i, q.getLast()); |
605 |
|
assertEquals(i, q.pollLast()); |
606 |
|
} |
621 |
|
} |
622 |
|
for (int i = 0; i < SIZE; i += 2) { |
623 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
624 |
< |
assertFalse(q.removeFirstOccurrence(new Integer(i+1))); |
624 |
> |
assertFalse(q.removeFirstOccurrence(new Integer(i + 1))); |
625 |
|
} |
626 |
|
assertTrue(q.isEmpty()); |
627 |
|
} |
636 |
|
} |
637 |
|
for (int i = 0; i < SIZE; i += 2) { |
638 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
639 |
< |
assertFalse(q.removeLastOccurrence(new Integer(i+1))); |
639 |
> |
assertFalse(q.removeLastOccurrence(new Integer(i + 1))); |
640 |
|
} |
641 |
|
assertTrue(q.isEmpty()); |
642 |
|
} |