70 |
|
* |
71 |
|
* <p>As of the Java 2 platform v1.2, this class was retrofitted to |
72 |
|
* implement the {@link List} interface, making it a member of the |
73 |
< |
* <a href="{@docRoot}/../technotes/guides/collections/index.html"> |
73 |
> |
* <a href="{@docRoot}/java/util/package-summary.html#CollectionsFramework"> |
74 |
|
* Java Collections Framework</a>. Unlike the new collection |
75 |
|
* implementations, {@code Vector} is synchronized. If a thread-safe |
76 |
|
* implementation is not needed, it is recommended to use {@link |
306 |
|
modCount++; |
307 |
|
if (newSize > elementData.length) |
308 |
|
grow(newSize); |
309 |
< |
for (int i = newSize; i < elementCount; i++) |
310 |
< |
elementData[i] = null; |
309 |
> |
final Object[] es = elementData; |
310 |
> |
for (int to = elementCount, i = newSize; i < to; i++) |
311 |
> |
es[i] = null; |
312 |
|
elementCount = newSize; |
313 |
|
} |
314 |
|
|
677 |
|
* method (which is part of the {@link List} interface). |
678 |
|
*/ |
679 |
|
public synchronized void removeAllElements() { |
680 |
< |
Arrays.fill(elementData, 0, elementCount, null); |
680 |
> |
final Object[] es = elementData; |
681 |
> |
for (int to = elementCount, i = elementCount = 0; i < to; i++) |
682 |
> |
es[i] = null; |
683 |
|
modCount++; |
681 |
– |
elementCount = 0; |
684 |
|
} |
685 |
|
|
686 |
|
/** |
986 |
|
return bulkRemove(e -> !c.contains(e)); |
987 |
|
} |
988 |
|
|
989 |
+ |
/** |
990 |
+ |
* @throws NullPointerException {@inheritDoc} |
991 |
+ |
*/ |
992 |
|
@Override |
993 |
|
public boolean removeIf(Predicate<? super E> filter) { |
994 |
|
Objects.requireNonNull(filter); |
1033 |
|
for (i = beg; i < end; i++) |
1034 |
|
if (isClear(deathRow, i - beg)) |
1035 |
|
es[w++] = es[i]; |
1036 |
< |
Arrays.fill(es, elementCount = w, end, null); |
1036 |
> |
for (i = elementCount = w; i < end; i++) |
1037 |
> |
es[i] = null; |
1038 |
|
// checkInvariants(); |
1039 |
|
return true; |
1040 |
|
} else { |
1165 |
|
* (If {@code toIndex==fromIndex}, this operation has no effect.) |
1166 |
|
*/ |
1167 |
|
protected synchronized void removeRange(int fromIndex, int toIndex) { |
1162 |
– |
final Object[] es = elementData; |
1163 |
– |
final int oldSize = elementCount; |
1164 |
– |
System.arraycopy(es, toIndex, es, fromIndex, oldSize - toIndex); |
1165 |
– |
|
1168 |
|
modCount++; |
1169 |
< |
Arrays.fill(es, elementCount -= (toIndex - fromIndex), oldSize, null); |
1169 |
> |
shiftTailOverGap(elementData, fromIndex, toIndex); |
1170 |
|
// checkInvariants(); |
1171 |
|
} |
1172 |
|
|
1173 |
+ |
/** Erases the gap from lo to hi, by sliding down following elements. */ |
1174 |
+ |
private void shiftTailOverGap(Object[] es, int lo, int hi) { |
1175 |
+ |
System.arraycopy(es, hi, es, lo, elementCount - hi); |
1176 |
+ |
for (int to = elementCount, i = (elementCount -= hi - lo); i < to; i++) |
1177 |
+ |
es[i] = null; |
1178 |
+ |
} |
1179 |
+ |
|
1180 |
|
/** |
1181 |
< |
* Save the state of the {@code Vector} instance to a stream (that |
1182 |
< |
* is, serialize it). |
1181 |
> |
* Saves the state of the {@code Vector} instance to a stream |
1182 |
> |
* (that is, serializes it). |
1183 |
|
* This method performs synchronization to ensure the consistency |
1184 |
|
* of the serialized data. |
1185 |
+ |
* |
1186 |
+ |
* @param s the stream |
1187 |
+ |
* @throws java.io.IOException if an I/O error occurs |
1188 |
|
*/ |
1189 |
|
private void writeObject(java.io.ObjectOutputStream s) |
1190 |
|
throws java.io.IOException { |
1357 |
|
} |
1358 |
|
} |
1359 |
|
|
1360 |
+ |
/** |
1361 |
+ |
* @throws NullPointerException {@inheritDoc} |
1362 |
+ |
*/ |
1363 |
|
@Override |
1364 |
|
public synchronized void forEach(Consumer<? super E> action) { |
1365 |
|
Objects.requireNonNull(action); |
1373 |
|
// checkInvariants(); |
1374 |
|
} |
1375 |
|
|
1376 |
+ |
/** |
1377 |
+ |
* @throws NullPointerException {@inheritDoc} |
1378 |
+ |
*/ |
1379 |
|
@Override |
1380 |
|
public synchronized void replaceAll(UnaryOperator<E> operator) { |
1381 |
|
Objects.requireNonNull(operator); |
1426 |
|
private int fence; // -1 until used; then one past last index |
1427 |
|
private int expectedModCount; // initialized when fence set |
1428 |
|
|
1429 |
< |
/** Create new spliterator covering the given range */ |
1429 |
> |
/** Creates new spliterator covering the given range. */ |
1430 |
|
VectorSpliterator(Object[] array, int origin, int fence, |
1431 |
|
int expectedModCount) { |
1432 |
|
this.array = array; |
1455 |
|
|
1456 |
|
@SuppressWarnings("unchecked") |
1457 |
|
public boolean tryAdvance(Consumer<? super E> action) { |
1458 |
+ |
Objects.requireNonNull(action); |
1459 |
|
int i; |
1441 |
– |
if (action == null) |
1442 |
– |
throw new NullPointerException(); |
1460 |
|
if (getFence() > (i = index)) { |
1461 |
|
index = i + 1; |
1462 |
|
action.accept((E)array[i]); |
1469 |
|
|
1470 |
|
@SuppressWarnings("unchecked") |
1471 |
|
public void forEachRemaining(Consumer<? super E> action) { |
1472 |
< |
if (action == null) |
1456 |
< |
throw new NullPointerException(); |
1472 |
> |
Objects.requireNonNull(action); |
1473 |
|
final int hi = getFence(); |
1474 |
|
final Object[] a = array; |
1475 |
|
int i; |