437 |
|
*/ |
438 |
|
public void testRemoveElement() { |
439 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
440 |
< |
for (int i = 1; i < SIZE; i+=2) { |
440 |
> |
for (int i = 1; i < SIZE; i += 2) { |
441 |
|
assertTrue(q.contains(i)); |
442 |
|
assertTrue(q.remove(i)); |
443 |
|
assertFalse(q.contains(i)); |
444 |
|
assertTrue(q.contains(i-1)); |
445 |
|
} |
446 |
< |
for (int i = 0; i < SIZE; i+=2) { |
446 |
> |
for (int i = 0; i < SIZE; i += 2) { |
447 |
|
assertTrue(q.contains(i)); |
448 |
|
assertTrue(q.remove(i)); |
449 |
|
assertFalse(q.contains(i)); |
547 |
|
*/ |
548 |
|
public void testRemoveFirstOccurrence() { |
549 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
550 |
< |
for (int i = 1; i < SIZE; i+=2) { |
550 |
> |
for (int i = 1; i < SIZE; i += 2) { |
551 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
552 |
|
} |
553 |
< |
for (int i = 0; i < SIZE; i+=2) { |
553 |
> |
for (int i = 0; i < SIZE; i += 2) { |
554 |
|
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
555 |
|
assertFalse(q.removeFirstOccurrence(new Integer(i+1))); |
556 |
|
} |
562 |
|
*/ |
563 |
|
public void testRemoveLastOccurrence() { |
564 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
565 |
< |
for (int i = 1; i < SIZE; i+=2) { |
565 |
> |
for (int i = 1; i < SIZE; i += 2) { |
566 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
567 |
|
} |
568 |
< |
for (int i = 0; i < SIZE; i+=2) { |
568 |
> |
for (int i = 0; i < SIZE; i += 2) { |
569 |
|
assertTrue(q.removeLastOccurrence(new Integer(i))); |
570 |
|
assertFalse(q.removeLastOccurrence(new Integer(i+1))); |
571 |
|
} |