1 |
|
/* |
2 |
< |
* Copyright (c) 1997, 2016, Oracle and/or its affiliates. All rights reserved. |
2 |
> |
* Copyright (c) 1997, 2018, Oracle and/or its affiliates. All rights reserved. |
3 |
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 |
|
* |
5 |
|
* This code is free software; you can redistribute it and/or modify it |
28 |
|
import java.util.function.Consumer; |
29 |
|
import java.util.function.Predicate; |
30 |
|
import java.util.function.UnaryOperator; |
31 |
+ |
import jdk.internal.misc.SharedSecrets; |
32 |
|
|
33 |
|
/** |
34 |
|
* Resizable-array implementation of the {@code List} interface. Implements |
92 |
|
* should be used only to detect bugs.</i> |
93 |
|
* |
94 |
|
* <p>This class is a member of the |
95 |
< |
* <a href="{@docRoot}/../technotes/guides/collections/index.html"> |
95 |
> |
* <a href="{@docRoot}/java/util/package-summary.html#CollectionsFramework"> |
96 |
|
* Java Collections Framework</a>. |
97 |
|
* |
98 |
|
* @param <E> the type of elements in this list |
516 |
|
*/ |
517 |
|
public E remove(int index) { |
518 |
|
Objects.checkIndex(index, size); |
519 |
+ |
final Object[] es = elementData; |
520 |
|
|
521 |
< |
modCount++; |
522 |
< |
E oldValue = elementData(index); |
521 |
< |
|
522 |
< |
int numMoved = size - index - 1; |
523 |
< |
if (numMoved > 0) |
524 |
< |
System.arraycopy(elementData, index+1, elementData, index, |
525 |
< |
numMoved); |
526 |
< |
elementData[--size] = null; // clear to let GC do its work |
521 |
> |
@SuppressWarnings("unchecked") E oldValue = (E) es[index]; |
522 |
> |
fastRemove(es, index); |
523 |
|
|
524 |
|
// checkInvariants(); |
525 |
|
return oldValue; |
539 |
|
* @return {@code true} if this list contained the specified element |
540 |
|
*/ |
541 |
|
public boolean remove(Object o) { |
542 |
< |
if (o == null) { |
543 |
< |
for (int index = 0; index < size; index++) |
544 |
< |
if (elementData[index] == null) { |
545 |
< |
fastRemove(index); |
546 |
< |
return true; |
547 |
< |
} |
548 |
< |
} else { |
549 |
< |
for (int index = 0; index < size; index++) |
550 |
< |
if (o.equals(elementData[index])) { |
551 |
< |
fastRemove(index); |
552 |
< |
return true; |
553 |
< |
} |
542 |
> |
final Object[] es = elementData; |
543 |
> |
final int size = this.size; |
544 |
> |
int i = 0; |
545 |
> |
found: { |
546 |
> |
if (o == null) { |
547 |
> |
for (; i < size; i++) |
548 |
> |
if (es[i] == null) |
549 |
> |
break found; |
550 |
> |
} else { |
551 |
> |
for (; i < size; i++) |
552 |
> |
if (o.equals(es[i])) |
553 |
> |
break found; |
554 |
> |
} |
555 |
> |
return false; |
556 |
|
} |
557 |
< |
return false; |
557 |
> |
fastRemove(es, i); |
558 |
> |
return true; |
559 |
|
} |
560 |
|
|
561 |
|
/** |
562 |
|
* Private remove method that skips bounds checking and does not |
563 |
|
* return the value removed. |
564 |
|
*/ |
565 |
< |
private void fastRemove(int index) { |
565 |
> |
private void fastRemove(Object[] es, int i) { |
566 |
|
modCount++; |
567 |
< |
int numMoved = size - index - 1; |
568 |
< |
if (numMoved > 0) |
569 |
< |
System.arraycopy(elementData, index+1, elementData, index, |
570 |
< |
numMoved); |
572 |
< |
elementData[--size] = null; // clear to let GC do its work |
567 |
> |
final int newSize; |
568 |
> |
if ((newSize = size - 1) > i) |
569 |
> |
System.arraycopy(es, i + 1, es, i, newSize - i); |
570 |
> |
es[size = newSize] = null; |
571 |
|
} |
572 |
|
|
573 |
|
/** |
746 |
|
final int from, final int end) { |
747 |
|
Objects.requireNonNull(c); |
748 |
|
final Object[] es = elementData; |
751 |
– |
final boolean modified; |
749 |
|
int r; |
750 |
|
// Optimize for initial run of survivors |
751 |
< |
for (r = from; r < end && c.contains(es[r]) == complement; r++) |
752 |
< |
; |
753 |
< |
if (modified = (r < end)) { |
754 |
< |
int w = r++; |
755 |
< |
try { |
756 |
< |
for (Object e; r < end; r++) |
757 |
< |
if (c.contains(e = es[r]) == complement) |
758 |
< |
es[w++] = e; |
759 |
< |
} catch (Throwable ex) { |
760 |
< |
// Preserve behavioral compatibility with AbstractCollection, |
761 |
< |
// even if c.contains() throws. |
762 |
< |
System.arraycopy(es, r, es, w, end - r); |
763 |
< |
w += end - r; |
764 |
< |
throw ex; |
765 |
< |
} finally { |
766 |
< |
modCount += end - w; |
767 |
< |
shiftTailOverGap(es, w, end); |
768 |
< |
} |
751 |
> |
for (r = from;; r++) { |
752 |
> |
if (r == end) |
753 |
> |
return false; |
754 |
> |
if (c.contains(es[r]) != complement) |
755 |
> |
break; |
756 |
> |
} |
757 |
> |
int w = r++; |
758 |
> |
try { |
759 |
> |
for (Object e; r < end; r++) |
760 |
> |
if (c.contains(e = es[r]) == complement) |
761 |
> |
es[w++] = e; |
762 |
> |
} catch (Throwable ex) { |
763 |
> |
// Preserve behavioral compatibility with AbstractCollection, |
764 |
> |
// even if c.contains() throws. |
765 |
> |
System.arraycopy(es, r, es, w, end - r); |
766 |
> |
w += end - r; |
767 |
> |
throw ex; |
768 |
> |
} finally { |
769 |
> |
modCount += end - w; |
770 |
> |
shiftTailOverGap(es, w, end); |
771 |
|
} |
772 |
|
// checkInvariants(); |
773 |
< |
return modified; |
773 |
> |
return true; |
774 |
|
} |
775 |
|
|
776 |
|
/** |
789 |
|
int expectedModCount = modCount; |
790 |
|
s.defaultWriteObject(); |
791 |
|
|
792 |
< |
// Write out size as capacity for behavioural compatibility with clone() |
792 |
> |
// Write out size as capacity for behavioral compatibility with clone() |
793 |
|
s.writeInt(size); |
794 |
|
|
795 |
|
// Write out all elements in the proper order. |
821 |
|
|
822 |
|
if (size > 0) { |
823 |
|
// like clone(), allocate array based upon size not capacity |
824 |
+ |
SharedSecrets.getJavaObjectInputStreamAccess().checkArray(s, Object[].class, size); |
825 |
|
Object[] elements = new Object[size]; |
826 |
|
|
827 |
|
// Read in all elements in the proper order. |
1122 |
|
return true; |
1123 |
|
} |
1124 |
|
|
1125 |
+ |
public void replaceAll(UnaryOperator<E> operator) { |
1126 |
+ |
root.replaceAllRange(operator, offset, offset + size); |
1127 |
+ |
} |
1128 |
+ |
|
1129 |
|
public boolean removeAll(Collection<?> c) { |
1130 |
|
return batchRemove(c, false); |
1131 |
|
} |
1153 |
|
return modified; |
1154 |
|
} |
1155 |
|
|
1156 |
+ |
public Object[] toArray() { |
1157 |
+ |
checkForComodification(); |
1158 |
+ |
return Arrays.copyOfRange(root.elementData, offset, offset + size); |
1159 |
+ |
} |
1160 |
+ |
|
1161 |
+ |
@SuppressWarnings("unchecked") |
1162 |
+ |
public <T> T[] toArray(T[] a) { |
1163 |
+ |
checkForComodification(); |
1164 |
+ |
if (a.length < size) |
1165 |
+ |
return (T[]) Arrays.copyOfRange( |
1166 |
+ |
root.elementData, offset, offset + size, a.getClass()); |
1167 |
+ |
System.arraycopy(root.elementData, offset, a, 0, size); |
1168 |
+ |
if (a.length > size) |
1169 |
+ |
a[size] = null; |
1170 |
+ |
return a; |
1171 |
+ |
} |
1172 |
+ |
|
1173 |
|
public Iterator<E> iterator() { |
1174 |
|
return listIterator(); |
1175 |
|
} |
1577 |
|
setBit(deathRow, i - beg); |
1578 |
|
if (modCount != expectedModCount) |
1579 |
|
throw new ConcurrentModificationException(); |
1559 |
– |
expectedModCount++; |
1580 |
|
modCount++; |
1581 |
|
int w = beg; |
1582 |
|
for (i = beg; i < end; i++) |
1595 |
|
|
1596 |
|
@Override |
1597 |
|
public void replaceAll(UnaryOperator<E> operator) { |
1598 |
+ |
replaceAllRange(operator, 0, size); |
1599 |
+ |
} |
1600 |
+ |
|
1601 |
+ |
private void replaceAllRange(UnaryOperator<E> operator, int i, int end) { |
1602 |
|
Objects.requireNonNull(operator); |
1603 |
|
final int expectedModCount = modCount; |
1604 |
|
final Object[] es = elementData; |
1605 |
< |
final int size = this.size; |
1582 |
< |
for (int i = 0; modCount == expectedModCount && i < size; i++) |
1605 |
> |
for (; modCount == expectedModCount && i < end; i++) |
1606 |
|
es[i] = operator.apply(elementAt(es, i)); |
1607 |
|
if (modCount != expectedModCount) |
1608 |
|
throw new ConcurrentModificationException(); |
1586 |
– |
modCount++; |
1609 |
|
// checkInvariants(); |
1610 |
|
} |
1611 |
|
|