985 |
|
return bulkRemove(e -> !c.contains(e)); |
986 |
|
} |
987 |
|
|
988 |
+ |
/** |
989 |
+ |
* @throws NullPointerException {@inheritDoc} |
990 |
+ |
*/ |
991 |
|
@Override |
992 |
|
public boolean removeIf(Predicate<? super E> filter) { |
993 |
|
Objects.requireNonNull(filter); |
1356 |
|
} |
1357 |
|
} |
1358 |
|
|
1359 |
+ |
/** |
1360 |
+ |
* @throws NullPointerException {@inheritDoc} |
1361 |
+ |
*/ |
1362 |
|
@Override |
1363 |
|
public synchronized void forEach(Consumer<? super E> action) { |
1364 |
|
Objects.requireNonNull(action); |
1372 |
|
// checkInvariants(); |
1373 |
|
} |
1374 |
|
|
1375 |
+ |
/** |
1376 |
+ |
* @throws NullPointerException {@inheritDoc} |
1377 |
+ |
*/ |
1378 |
|
@Override |
1379 |
|
public synchronized void replaceAll(UnaryOperator<E> operator) { |
1380 |
|
Objects.requireNonNull(operator); |
1425 |
|
private int fence; // -1 until used; then one past last index |
1426 |
|
private int expectedModCount; // initialized when fence set |
1427 |
|
|
1428 |
< |
/** Create new spliterator covering the given range */ |
1428 |
> |
/** Creates new spliterator covering the given range. */ |
1429 |
|
VectorSpliterator(Object[] array, int origin, int fence, |
1430 |
|
int expectedModCount) { |
1431 |
|
this.array = array; |
1454 |
|
|
1455 |
|
@SuppressWarnings("unchecked") |
1456 |
|
public boolean tryAdvance(Consumer<? super E> action) { |
1457 |
+ |
Objects.requireNonNull(action); |
1458 |
|
int i; |
1449 |
– |
if (action == null) |
1450 |
– |
throw new NullPointerException(); |
1459 |
|
if (getFence() > (i = index)) { |
1460 |
|
index = i + 1; |
1461 |
|
action.accept((E)array[i]); |
1468 |
|
|
1469 |
|
@SuppressWarnings("unchecked") |
1470 |
|
public void forEachRemaining(Consumer<? super E> action) { |
1471 |
< |
if (action == null) |
1464 |
< |
throw new NullPointerException(); |
1471 |
> |
Objects.requireNonNull(action); |
1472 |
|
final int hi = getFence(); |
1473 |
|
final Object[] a = array; |
1474 |
|
int i; |