237 |
|
*/ |
238 |
|
public void testRemoveElement() { |
239 |
|
LinkedList q = populatedQueue(SIZE); |
240 |
< |
for (int i = 1; i < SIZE; i+=2) { |
240 |
> |
for (int i = 1; i < SIZE; i += 2) { |
241 |
|
assertTrue(q.contains(i)); |
242 |
|
assertTrue(q.remove((Integer)i)); |
243 |
|
assertFalse(q.contains(i)); |
244 |
|
assertTrue(q.contains(i-1)); |
245 |
|
} |
246 |
< |
for (int i = 0; i < SIZE; i+=2) { |
246 |
> |
for (int i = 0; i < SIZE; i += 2) { |
247 |
|
assertTrue(q.contains(i)); |
248 |
|
assertTrue(q.remove((Integer)i)); |
249 |
|
assertFalse(q.contains(i)); |
606 |
|
*/ |
607 |
|
public void testRemoveFirstOccurrence() { |
608 |
|
LinkedList q = populatedQueue(SIZE); |
609 |
< |
for (int i = 1; i < SIZE; i+=2) { |
609 |
> |
for (int i = 1; i < SIZE; i += 2) { |
610 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
611 |
|
} |
612 |
< |
for (int i = 0; i < SIZE; i+=2) { |
612 |
> |
for (int i = 0; i < SIZE; i += 2) { |
613 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
614 |
|
assertFalse(q.removeFirstOccurrence(new Integer(i+1))); |
615 |
|
} |
621 |
|
*/ |
622 |
|
public void testRemoveLastOccurrence() { |
623 |
|
LinkedList q = populatedQueue(SIZE); |
624 |
< |
for (int i = 1; i < SIZE; i+=2) { |
624 |
> |
for (int i = 1; i < SIZE; i += 2) { |
625 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
626 |
|
} |
627 |
< |
for (int i = 0; i < SIZE; i+=2) { |
627 |
> |
for (int i = 0; i < SIZE; i += 2) { |
628 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
629 |
|
assertFalse(q.removeLastOccurrence(new Integer(i+1))); |
630 |
|
} |