306 |
|
modCount++; |
307 |
|
if (newSize > elementData.length) |
308 |
|
grow(newSize); |
309 |
< |
for (int i = newSize; i < elementCount; i++) |
310 |
< |
elementData[i] = null; |
311 |
< |
elementCount = newSize; |
309 |
> |
final Object[] es = elementData; |
310 |
> |
for (int to = elementCount, i = elementCount = newSize; i < to; i++) |
311 |
> |
es[i] = null; |
312 |
|
} |
313 |
|
|
314 |
|
/** |
585 |
|
modCount++; |
586 |
|
elementCount--; |
587 |
|
elementData[elementCount] = null; /* to let gc do its work */ |
588 |
+ |
// checkInvariants(); |
589 |
|
} |
590 |
|
|
591 |
|
/** |
676 |
|
* method (which is part of the {@link List} interface). |
677 |
|
*/ |
678 |
|
public synchronized void removeAllElements() { |
679 |
< |
// Let gc do its work |
680 |
< |
for (int i = 0; i < elementCount; i++) |
681 |
< |
elementData[i] = null; |
681 |
< |
|
679 |
> |
final Object[] es = elementData; |
680 |
> |
for (int to = elementCount, i = elementCount = 0; i < to; i++) |
681 |
> |
es[i] = null; |
682 |
|
modCount++; |
683 |
– |
elementCount = 0; |
683 |
|
} |
684 |
|
|
685 |
|
/** |
809 |
|
elementData = grow(); |
810 |
|
elementData[s] = e; |
811 |
|
elementCount = s + 1; |
812 |
+ |
// checkInvariants(); |
813 |
|
} |
814 |
|
|
815 |
|
/** |
878 |
|
numMoved); |
879 |
|
elementData[--elementCount] = null; // Let gc do its work |
880 |
|
|
881 |
+ |
// checkInvariants(); |
882 |
|
return oldValue; |
883 |
|
} |
884 |
|
|
934 |
|
elementData = grow(s + numNew); |
935 |
|
System.arraycopy(a, 0, elementData, s, numNew); |
936 |
|
elementCount = s + numNew; |
937 |
+ |
// checkInvariants(); |
938 |
|
return true; |
939 |
|
} |
940 |
|
} |
1007 |
|
int expectedModCount = modCount; |
1008 |
|
final Object[] es = elementData; |
1009 |
|
final int end = elementCount; |
1008 |
– |
final boolean modified; |
1010 |
|
int i; |
1011 |
|
// Optimize for initial run of survivors |
1012 |
|
for (i = 0; i < end && !filter.test(elementAt(es, i)); i++) |
1014 |
|
// Tolerate predicates that reentrantly access the collection for |
1015 |
|
// read (but writers still get CME), so traverse once to find |
1016 |
|
// elements to delete, a second pass to physically expunge. |
1017 |
< |
if (modified = (i < end)) { |
1017 |
< |
expectedModCount++; |
1018 |
< |
modCount++; |
1017 |
> |
if (i < end) { |
1018 |
|
final int beg = i; |
1019 |
|
final long[] deathRow = nBits(end - beg); |
1020 |
|
deathRow[0] = 1L; // set bit 0 |
1021 |
|
for (i = beg + 1; i < end; i++) |
1022 |
|
if (filter.test(elementAt(es, i))) |
1023 |
|
setBit(deathRow, i - beg); |
1024 |
+ |
if (modCount != expectedModCount) |
1025 |
+ |
throw new ConcurrentModificationException(); |
1026 |
+ |
expectedModCount++; |
1027 |
+ |
modCount++; |
1028 |
|
int w = beg; |
1029 |
|
for (i = beg; i < end; i++) |
1030 |
|
if (isClear(deathRow, i - beg)) |
1031 |
|
es[w++] = es[i]; |
1032 |
< |
Arrays.fill(es, elementCount = w, end, null); |
1032 |
> |
for (i = elementCount = w; i < end; i++) |
1033 |
> |
es[i] = null; |
1034 |
> |
// checkInvariants(); |
1035 |
> |
return true; |
1036 |
> |
} else { |
1037 |
> |
if (modCount != expectedModCount) |
1038 |
> |
throw new ConcurrentModificationException(); |
1039 |
> |
// checkInvariants(); |
1040 |
> |
return false; |
1041 |
|
} |
1031 |
– |
if (modCount != expectedModCount) |
1032 |
– |
throw new ConcurrentModificationException(); |
1033 |
– |
return modified; |
1042 |
|
} |
1043 |
|
|
1044 |
|
/** |
1079 |
|
numMoved); |
1080 |
|
System.arraycopy(a, 0, elementData, index, numNew); |
1081 |
|
elementCount = s + numNew; |
1082 |
+ |
// checkInvariants(); |
1083 |
|
return true; |
1084 |
|
} |
1085 |
|
|
1161 |
|
* (If {@code toIndex==fromIndex}, this operation has no effect.) |
1162 |
|
*/ |
1163 |
|
protected synchronized void removeRange(int fromIndex, int toIndex) { |
1155 |
– |
int numMoved = elementCount - toIndex; |
1156 |
– |
System.arraycopy(elementData, toIndex, elementData, fromIndex, |
1157 |
– |
numMoved); |
1158 |
– |
|
1159 |
– |
// Let gc do its work |
1164 |
|
modCount++; |
1165 |
< |
int newElementCount = elementCount - (toIndex-fromIndex); |
1166 |
< |
while (elementCount != newElementCount) |
1167 |
< |
elementData[--elementCount] = null; |
1165 |
> |
shiftTailOverGap(elementData, fromIndex, toIndex); |
1166 |
> |
// checkInvariants(); |
1167 |
> |
} |
1168 |
> |
|
1169 |
> |
/** Erases the gap from lo to hi, by sliding down following elements. */ |
1170 |
> |
private void shiftTailOverGap(Object[] es, int lo, int hi) { |
1171 |
> |
System.arraycopy(es, hi, es, lo, elementCount - hi); |
1172 |
> |
for (int to = elementCount, i = (elementCount -= hi - lo); i < to; i++) |
1173 |
> |
es[i] = null; |
1174 |
|
} |
1175 |
|
|
1176 |
|
/** |
1177 |
< |
* Save the state of the {@code Vector} instance to a stream (that |
1178 |
< |
* is, serialize it). |
1177 |
> |
* Saves the state of the {@code Vector} instance to a stream |
1178 |
> |
* (that is, serializes it). |
1179 |
|
* This method performs synchronization to ensure the consistency |
1180 |
|
* of the serialized data. |
1181 |
+ |
* |
1182 |
+ |
* @param s the stream |
1183 |
+ |
* @throws java.io.IOException if an I/O error occurs |
1184 |
|
*/ |
1185 |
|
private void writeObject(java.io.ObjectOutputStream s) |
1186 |
|
throws java.io.IOException { |
1363 |
|
action.accept(elementAt(es, i)); |
1364 |
|
if (modCount != expectedModCount) |
1365 |
|
throw new ConcurrentModificationException(); |
1366 |
+ |
// checkInvariants(); |
1367 |
|
} |
1368 |
|
|
1369 |
|
@Override |
1377 |
|
if (modCount != expectedModCount) |
1378 |
|
throw new ConcurrentModificationException(); |
1379 |
|
modCount++; |
1380 |
+ |
// checkInvariants(); |
1381 |
|
} |
1382 |
|
|
1383 |
|
@SuppressWarnings("unchecked") |
1385 |
|
public synchronized void sort(Comparator<? super E> c) { |
1386 |
|
final int expectedModCount = modCount; |
1387 |
|
Arrays.sort((E[]) elementData, 0, elementCount, c); |
1388 |
< |
if (modCount != expectedModCount) { |
1388 |
> |
if (modCount != expectedModCount) |
1389 |
|
throw new ConcurrentModificationException(); |
1375 |
– |
} |
1390 |
|
modCount++; |
1391 |
+ |
// checkInvariants(); |
1392 |
|
} |
1393 |
|
|
1394 |
|
/** |
1406 |
|
*/ |
1407 |
|
@Override |
1408 |
|
public Spliterator<E> spliterator() { |
1409 |
< |
return new VectorSpliterator<>(this, null, 0, -1, 0); |
1409 |
> |
return new VectorSpliterator(null, 0, -1, 0); |
1410 |
|
} |
1411 |
|
|
1412 |
|
/** Similar to ArrayList Spliterator */ |
1413 |
< |
static final class VectorSpliterator<E> implements Spliterator<E> { |
1399 |
< |
private final Vector<E> list; |
1413 |
> |
final class VectorSpliterator implements Spliterator<E> { |
1414 |
|
private Object[] array; |
1415 |
|
private int index; // current index, modified on advance/split |
1416 |
|
private int fence; // -1 until used; then one past last index |
1417 |
|
private int expectedModCount; // initialized when fence set |
1418 |
|
|
1419 |
|
/** Create new spliterator covering the given range */ |
1420 |
< |
VectorSpliterator(Vector<E> list, Object[] array, int origin, int fence, |
1420 |
> |
VectorSpliterator(Object[] array, int origin, int fence, |
1421 |
|
int expectedModCount) { |
1408 |
– |
this.list = list; |
1422 |
|
this.array = array; |
1423 |
|
this.index = origin; |
1424 |
|
this.fence = fence; |
1428 |
|
private int getFence() { // initialize on first use |
1429 |
|
int hi; |
1430 |
|
if ((hi = fence) < 0) { |
1431 |
< |
synchronized (list) { |
1432 |
< |
array = list.elementData; |
1433 |
< |
expectedModCount = list.modCount; |
1434 |
< |
hi = fence = list.elementCount; |
1431 |
> |
synchronized (Vector.this) { |
1432 |
> |
array = elementData; |
1433 |
> |
expectedModCount = modCount; |
1434 |
> |
hi = fence = elementCount; |
1435 |
|
} |
1436 |
|
} |
1437 |
|
return hi; |
1440 |
|
public Spliterator<E> trySplit() { |
1441 |
|
int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; |
1442 |
|
return (lo >= mid) ? null : |
1443 |
< |
new VectorSpliterator<>(list, array, lo, index = mid, |
1431 |
< |
expectedModCount); |
1443 |
> |
new VectorSpliterator(array, lo, index = mid, expectedModCount); |
1444 |
|
} |
1445 |
|
|
1446 |
|
@SuppressWarnings("unchecked") |
1451 |
|
if (getFence() > (i = index)) { |
1452 |
|
index = i + 1; |
1453 |
|
action.accept((E)array[i]); |
1454 |
< |
if (list.modCount != expectedModCount) |
1454 |
> |
if (modCount != expectedModCount) |
1455 |
|
throw new ConcurrentModificationException(); |
1456 |
|
return true; |
1457 |
|
} |
1460 |
|
|
1461 |
|
@SuppressWarnings("unchecked") |
1462 |
|
public void forEachRemaining(Consumer<? super E> action) { |
1451 |
– |
int i, hi; // hoist accesses and checks from loop |
1452 |
– |
Vector<E> lst; Object[] a; |
1463 |
|
if (action == null) |
1464 |
|
throw new NullPointerException(); |
1465 |
< |
if ((lst = list) != null) { |
1466 |
< |
if ((hi = fence) < 0) { |
1467 |
< |
synchronized (lst) { |
1468 |
< |
expectedModCount = lst.modCount; |
1469 |
< |
a = array = lst.elementData; |
1470 |
< |
hi = fence = lst.elementCount; |
1471 |
< |
} |
1462 |
< |
} |
1463 |
< |
else |
1464 |
< |
a = array; |
1465 |
< |
if (a != null && (i = index) >= 0 && (index = hi) <= a.length) { |
1466 |
< |
while (i < hi) |
1467 |
< |
action.accept((E) a[i++]); |
1468 |
< |
if (lst.modCount == expectedModCount) |
1469 |
< |
return; |
1470 |
< |
} |
1471 |
< |
} |
1472 |
< |
throw new ConcurrentModificationException(); |
1465 |
> |
final int hi = getFence(); |
1466 |
> |
final Object[] a = array; |
1467 |
> |
int i; |
1468 |
> |
for (i = index, index = hi; i < hi; i++) |
1469 |
> |
action.accept((E) a[i]); |
1470 |
> |
if (modCount != expectedModCount) |
1471 |
> |
throw new ConcurrentModificationException(); |
1472 |
|
} |
1473 |
|
|
1474 |
|
public long estimateSize() { |
1479 |
|
return Spliterator.ORDERED | Spliterator.SIZED | Spliterator.SUBSIZED; |
1480 |
|
} |
1481 |
|
} |
1482 |
+ |
|
1483 |
+ |
void checkInvariants() { |
1484 |
+ |
// assert elementCount >= 0; |
1485 |
+ |
// assert elementCount == elementData.length || elementData[elementCount] == null; |
1486 |
+ |
} |
1487 |
|
} |