| 589 |
|
public void testRemoveAfterForEachRemaining() { |
| 590 |
|
Collection c = impl.emptyCollection(); |
| 591 |
|
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
| 592 |
+ |
ArrayList copy = new ArrayList(); |
| 593 |
+ |
boolean ordered = c.spliterator().hasCharacteristics(Spliterator.ORDERED); |
| 594 |
|
testCollection: { |
| 595 |
|
int n = 3 + rnd.nextInt(2); |
| 596 |
< |
for (int i = 0; i < n; i++) c.add(impl.makeElement(i)); |
| 596 |
> |
for (int i = 0; i < n; i++) { |
| 597 |
> |
Object x = impl.makeElement(i); |
| 598 |
> |
c.add(x); |
| 599 |
> |
copy.add(x); |
| 600 |
> |
} |
| 601 |
|
Iterator it = c.iterator(); |
| 602 |
< |
assertTrue(it.hasNext()); |
| 603 |
< |
assertEquals(impl.makeElement(0), it.next()); |
| 604 |
< |
assertTrue(it.hasNext()); |
| 605 |
< |
assertEquals(impl.makeElement(1), it.next()); |
| 606 |
< |
it.forEachRemaining(e -> assertTrue(c.contains(e))); |
| 602 |
> |
if (ordered) { |
| 603 |
> |
if (rnd.nextBoolean()) assertTrue(it.hasNext()); |
| 604 |
> |
assertEquals(impl.makeElement(0), it.next()); |
| 605 |
> |
if (rnd.nextBoolean()) assertTrue(it.hasNext()); |
| 606 |
> |
assertEquals(impl.makeElement(1), it.next()); |
| 607 |
> |
} else { |
| 608 |
> |
if (rnd.nextBoolean()) assertTrue(it.hasNext()); |
| 609 |
> |
assertTrue(copy.contains(it.next())); |
| 610 |
> |
if (rnd.nextBoolean()) assertTrue(it.hasNext()); |
| 611 |
> |
assertTrue(copy.contains(it.next())); |
| 612 |
> |
} |
| 613 |
> |
it.forEachRemaining( |
| 614 |
> |
e -> { |
| 615 |
> |
assertTrue(c.contains(e)); |
| 616 |
> |
assertTrue(copy.contains(e));}); |
| 617 |
|
if (testImplementationDetails) { |
| 618 |
|
if (c instanceof java.util.concurrent.ArrayBlockingQueue) { |
| 619 |
|
assertIteratorExhausted(it); |
| 623 |
|
break testCollection; |
| 624 |
|
} |
| 625 |
|
assertEquals(n - 1, c.size()); |
| 626 |
< |
for (int i = 0; i < n - 1; i++) |
| 627 |
< |
assertTrue(c.contains(impl.makeElement(i))); |
| 628 |
< |
assertFalse(c.contains(impl.makeElement(n - 1))); |
| 626 |
> |
if (ordered) { |
| 627 |
> |
for (int i = 0; i < n - 1; i++) |
| 628 |
> |
assertTrue(c.contains(impl.makeElement(i))); |
| 629 |
> |
assertFalse(c.contains(impl.makeElement(n - 1))); |
| 630 |
> |
} |
| 631 |
|
} |
| 632 |
|
} |
| 633 |
|
} |
| 634 |
|
if (c instanceof Deque) { |
| 635 |
|
Deque d = (Deque) impl.emptyCollection(); |
| 636 |
+ |
assertTrue(ordered); |
| 637 |
|
int n = 3 + rnd.nextInt(2); |
| 638 |
|
for (int i = 0; i < n; i++) d.add(impl.makeElement(i)); |
| 639 |
|
Iterator it = d.descendingIterator(); |
