1 |
|
/* |
2 |
< |
* Copyright 1994-2007 Sun Microsystems, Inc. All Rights Reserved. |
2 |
> |
* Copyright (c) 1994, 2013, 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 |
6 |
|
* under the terms of the GNU General Public License version 2 only, as |
7 |
< |
* published by the Free Software Foundation. Sun designates this |
7 |
> |
* published by the Free Software Foundation. Oracle designates this |
8 |
|
* particular file as subject to the "Classpath" exception as provided |
9 |
< |
* by Sun in the LICENSE file that accompanied this code. |
9 |
> |
* by Oracle in the LICENSE file that accompanied this code. |
10 |
|
* |
11 |
|
* This code is distributed in the hope that it will be useful, but WITHOUT |
12 |
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
18 |
|
* 2 along with this work; if not, write to the Free Software Foundation, |
19 |
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
20 |
|
* |
21 |
< |
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
22 |
< |
* CA 95054 USA or visit www.sun.com if you need additional information or |
23 |
< |
* have any questions. |
21 |
> |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
22 |
> |
* or visit www.oracle.com if you need additional information or have any |
23 |
> |
* questions. |
24 |
|
*/ |
25 |
|
|
26 |
|
package java.util; |
27 |
|
|
28 |
+ |
import java.util.function.Consumer; |
29 |
+ |
import java.util.function.Predicate; |
30 |
+ |
import java.util.function.UnaryOperator; |
31 |
+ |
|
32 |
|
/** |
33 |
|
* The {@code Vector} class implements a growable array of |
34 |
|
* objects. Like an array, it contains components that can be |
45 |
|
* capacity of a vector before inserting a large number of |
46 |
|
* components; this reduces the amount of incremental reallocation. |
47 |
|
* |
48 |
< |
* <p><a name="fail-fast"/> |
48 |
> |
* <p id="fail-fast"> |
49 |
|
* The iterators returned by this class's {@link #iterator() iterator} and |
50 |
|
* {@link #listIterator(int) listIterator} methods are <em>fail-fast</em>: |
51 |
|
* if the vector is structurally modified at any time after the iterator is |
56 |
|
* concurrent modification, the iterator fails quickly and cleanly, rather |
57 |
|
* than risking arbitrary, non-deterministic behavior at an undetermined |
58 |
|
* time in the future. The {@link Enumeration Enumerations} returned by |
59 |
< |
* the {@link #elements() elements} method are <em>not</em> fail-fast. |
59 |
> |
* the {@link #elements() elements} method are <em>not</em> fail-fast; if the |
60 |
> |
* Vector is structurally modified at any time after the enumeration is |
61 |
> |
* created then the results of enumerating are undefined. |
62 |
|
* |
63 |
|
* <p>Note that the fail-fast behavior of an iterator cannot be guaranteed |
64 |
|
* as it is, generally speaking, impossible to make any hard guarantees in the |
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"> Java |
74 |
< |
* Collections Framework</a>. Unlike the new collection |
75 |
< |
* implementations, {@code Vector} is synchronized. |
73 |
> |
* <a href="{@docRoot}/../technotes/guides/collections/index.html"> |
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 |
77 |
> |
* ArrayList} in place of {@code Vector}. |
78 |
> |
* |
79 |
> |
* @param <E> Type of component elements |
80 |
|
* |
81 |
|
* @author Lee Boynton |
82 |
|
* @author Jonathan Payne |
73 |
– |
* @version %I%, %G% |
83 |
|
* @see Collection |
75 |
– |
* @see List |
76 |
– |
* @see ArrayList |
84 |
|
* @see LinkedList |
85 |
< |
* @since JDK1.0 |
85 |
> |
* @since 1.0 |
86 |
|
*/ |
87 |
|
public class Vector<E> |
88 |
|
extends AbstractList<E> |
174 |
|
public Vector(Collection<? extends E> c) { |
175 |
|
elementData = c.toArray(); |
176 |
|
elementCount = elementData.length; |
177 |
< |
// c.toArray might (incorrectly) not return Object[] (see 6260652) |
177 |
> |
// defend against c.toArray (incorrectly) not returning Object[] |
178 |
> |
// (see e.g. https://bugs.openjdk.java.net/browse/JDK-6260652) |
179 |
|
if (elementData.getClass() != Object[].class) |
180 |
|
elementData = Arrays.copyOf(elementData, elementCount, Object[].class); |
181 |
|
} |
231 |
|
* @param minCapacity the desired minimum capacity |
232 |
|
*/ |
233 |
|
public synchronized void ensureCapacity(int minCapacity) { |
234 |
< |
modCount++; |
235 |
< |
ensureCapacityHelper(minCapacity); |
234 |
> |
if (minCapacity > 0) { |
235 |
> |
modCount++; |
236 |
> |
if (minCapacity > elementData.length) |
237 |
> |
grow(minCapacity); |
238 |
> |
} |
239 |
|
} |
240 |
|
|
241 |
|
/** |
242 |
< |
* This implements the unsynchronized semantics of ensureCapacity. |
243 |
< |
* Synchronized methods in this class can internally call this |
244 |
< |
* method for ensuring capacity without incurring the cost of an |
245 |
< |
* extra synchronization. |
242 |
> |
* The maximum size of array to allocate (unless necessary). |
243 |
> |
* Some VMs reserve some header words in an array. |
244 |
> |
* Attempts to allocate larger arrays may result in |
245 |
> |
* OutOfMemoryError: Requested array size exceeds VM limit |
246 |
> |
*/ |
247 |
> |
private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8; |
248 |
> |
|
249 |
> |
/** |
250 |
> |
* Increases the capacity to ensure that it can hold at least the |
251 |
> |
* number of elements specified by the minimum capacity argument. |
252 |
|
* |
253 |
< |
* @see #ensureCapacity(int) |
253 |
> |
* @param minCapacity the desired minimum capacity |
254 |
> |
* @throws OutOfMemoryError if minCapacity is less than zero |
255 |
|
*/ |
256 |
< |
private void ensureCapacityHelper(int minCapacity) { |
256 |
> |
private Object[] grow(int minCapacity) { |
257 |
> |
return elementData = Arrays.copyOf(elementData, |
258 |
> |
newCapacity(minCapacity)); |
259 |
> |
} |
260 |
> |
|
261 |
> |
private Object[] grow() { |
262 |
> |
return grow(elementCount + 1); |
263 |
> |
} |
264 |
> |
|
265 |
> |
/** |
266 |
> |
* Returns a capacity at least as large as the given minimum capacity. |
267 |
> |
* Will not return a capacity greater than MAX_ARRAY_SIZE unless |
268 |
> |
* the given minimum capacity is greater than MAX_ARRAY_SIZE. |
269 |
> |
* |
270 |
> |
* @param minCapacity the desired minimum capacity |
271 |
> |
* @throws OutOfMemoryError if minCapacity is less than zero |
272 |
> |
*/ |
273 |
> |
private int newCapacity(int minCapacity) { |
274 |
> |
// overflow-conscious code |
275 |
|
int oldCapacity = elementData.length; |
276 |
< |
if (minCapacity > oldCapacity) { |
277 |
< |
Object[] oldData = elementData; |
278 |
< |
int newCapacity = (capacityIncrement > 0) ? |
279 |
< |
(oldCapacity + capacityIncrement) : (oldCapacity * 2); |
280 |
< |
if (newCapacity < minCapacity) { |
281 |
< |
newCapacity = minCapacity; |
282 |
< |
} |
283 |
< |
elementData = Arrays.copyOf(elementData, newCapacity); |
284 |
< |
} |
276 |
> |
int newCapacity = oldCapacity + ((capacityIncrement > 0) ? |
277 |
> |
capacityIncrement : oldCapacity); |
278 |
> |
if (newCapacity - minCapacity <= 0) { |
279 |
> |
if (minCapacity < 0) // overflow |
280 |
> |
throw new OutOfMemoryError(); |
281 |
> |
return minCapacity; |
282 |
> |
} |
283 |
> |
return (newCapacity - MAX_ARRAY_SIZE <= 0) |
284 |
> |
? newCapacity |
285 |
> |
: hugeCapacity(minCapacity); |
286 |
> |
} |
287 |
> |
|
288 |
> |
private static int hugeCapacity(int minCapacity) { |
289 |
> |
if (minCapacity < 0) // overflow |
290 |
> |
throw new OutOfMemoryError(); |
291 |
> |
return (minCapacity > MAX_ARRAY_SIZE) ? |
292 |
> |
Integer.MAX_VALUE : |
293 |
> |
MAX_ARRAY_SIZE; |
294 |
|
} |
295 |
|
|
296 |
|
/** |
304 |
|
*/ |
305 |
|
public synchronized void setSize(int newSize) { |
306 |
|
modCount++; |
307 |
< |
if (newSize > elementCount) { |
308 |
< |
ensureCapacityHelper(newSize); |
309 |
< |
} else { |
310 |
< |
for (int i = newSize ; i < elementCount ; i++) { |
311 |
< |
elementData[i] = null; |
267 |
< |
} |
268 |
< |
} |
269 |
< |
elementCount = newSize; |
307 |
> |
if (newSize > elementData.length) |
308 |
> |
grow(newSize); |
309 |
> |
final Object[] es = elementData; |
310 |
> |
for (int to = elementCount, i = elementCount = newSize; i < to; i++) |
311 |
> |
es[i] = null; |
312 |
|
} |
313 |
|
|
314 |
|
/** |
346 |
|
* Returns an enumeration of the components of this vector. The |
347 |
|
* returned {@code Enumeration} object will generate all items in |
348 |
|
* this vector. The first item generated is the item at index {@code 0}, |
349 |
< |
* then the item at index {@code 1}, and so on. |
349 |
> |
* then the item at index {@code 1}, and so on. If the vector is |
350 |
> |
* structurally modified while enumerating over the elements then the |
351 |
> |
* results of enumerating are undefined. |
352 |
|
* |
353 |
|
* @return an enumeration of the components of this vector |
354 |
|
* @see Iterator |
376 |
|
* Returns {@code true} if this vector contains the specified element. |
377 |
|
* More formally, returns {@code true} if and only if this vector |
378 |
|
* contains at least one element {@code e} such that |
379 |
< |
* <tt>(o==null ? e==null : o.equals(e))</tt>. |
379 |
> |
* {@code Objects.equals(o, e)}. |
380 |
|
* |
381 |
|
* @param o element whose presence in this vector is to be tested |
382 |
|
* @return {@code true} if this vector contains the specified element |
389 |
|
* Returns the index of the first occurrence of the specified element |
390 |
|
* in this vector, or -1 if this vector does not contain the element. |
391 |
|
* More formally, returns the lowest index {@code i} such that |
392 |
< |
* <tt>(o==null ? get(i)==null : o.equals(get(i)))</tt>, |
392 |
> |
* {@code Objects.equals(o, get(i))}, |
393 |
|
* or -1 if there is no such index. |
394 |
|
* |
395 |
|
* @param o element to search for |
405 |
|
* this vector, searching forwards from {@code index}, or returns -1 if |
406 |
|
* the element is not found. |
407 |
|
* More formally, returns the lowest index {@code i} such that |
408 |
< |
* <tt>(i >= index && (o==null ? get(i)==null : o.equals(get(i))))</tt>, |
408 |
> |
* {@code (i >= index && Objects.equals(o, get(i)))}, |
409 |
|
* or -1 if there is no such index. |
410 |
|
* |
411 |
|
* @param o element to search for |
433 |
|
* Returns the index of the last occurrence of the specified element |
434 |
|
* in this vector, or -1 if this vector does not contain the element. |
435 |
|
* More formally, returns the highest index {@code i} such that |
436 |
< |
* <tt>(o==null ? get(i)==null : o.equals(get(i)))</tt>, |
436 |
> |
* {@code Objects.equals(o, get(i))}, |
437 |
|
* or -1 if there is no such index. |
438 |
|
* |
439 |
|
* @param o element to search for |
449 |
|
* this vector, searching backwards from {@code index}, or returns -1 if |
450 |
|
* the element is not found. |
451 |
|
* More formally, returns the highest index {@code i} such that |
452 |
< |
* <tt>(i <= index && (o==null ? get(i)==null : o.equals(get(i))))</tt>, |
452 |
> |
* {@code (i <= index && Objects.equals(o, get(i)))}, |
453 |
|
* or -1 if there is no such index. |
454 |
|
* |
455 |
|
* @param o element to search for |
513 |
|
* Returns the last component of the vector. |
514 |
|
* |
515 |
|
* @return the last component of the vector, i.e., the component at index |
516 |
< |
* <code>size() - 1</code>. |
516 |
> |
* {@code size() - 1} |
517 |
|
* @throws NoSuchElementException if this vector is empty |
518 |
|
*/ |
519 |
|
public synchronized E lastElement() { |
571 |
|
* ({@code index < 0 || index >= size()}) |
572 |
|
*/ |
573 |
|
public synchronized void removeElementAt(int index) { |
530 |
– |
modCount++; |
574 |
|
if (index >= elementCount) { |
575 |
|
throw new ArrayIndexOutOfBoundsException(index + " >= " + |
576 |
|
elementCount); |
582 |
|
if (j > 0) { |
583 |
|
System.arraycopy(elementData, index + 1, elementData, index, j); |
584 |
|
} |
585 |
+ |
modCount++; |
586 |
|
elementCount--; |
587 |
|
elementData[elementCount] = null; /* to let gc do its work */ |
588 |
+ |
// checkInvariants(); |
589 |
|
} |
590 |
|
|
591 |
|
/** |
612 |
|
* ({@code index < 0 || index > size()}) |
613 |
|
*/ |
614 |
|
public synchronized void insertElementAt(E obj, int index) { |
570 |
– |
modCount++; |
615 |
|
if (index > elementCount) { |
616 |
|
throw new ArrayIndexOutOfBoundsException(index |
617 |
|
+ " > " + elementCount); |
618 |
|
} |
619 |
< |
ensureCapacityHelper(elementCount + 1); |
620 |
< |
System.arraycopy(elementData, index, elementData, index + 1, elementCount - index); |
619 |
> |
modCount++; |
620 |
> |
final int s = elementCount; |
621 |
> |
Object[] elementData = this.elementData; |
622 |
> |
if (s == elementData.length) |
623 |
> |
elementData = grow(); |
624 |
> |
System.arraycopy(elementData, index, |
625 |
> |
elementData, index + 1, |
626 |
> |
s - index); |
627 |
|
elementData[index] = obj; |
628 |
< |
elementCount++; |
628 |
> |
elementCount = s + 1; |
629 |
|
} |
630 |
|
|
631 |
|
/** |
641 |
|
*/ |
642 |
|
public synchronized void addElement(E obj) { |
643 |
|
modCount++; |
644 |
< |
ensureCapacityHelper(elementCount + 1); |
595 |
< |
elementData[elementCount++] = obj; |
644 |
> |
add(obj, elementData, elementCount); |
645 |
|
} |
646 |
|
|
647 |
|
/** |
676 |
|
* method (which is part of the {@link List} interface). |
677 |
|
*/ |
678 |
|
public synchronized void removeAllElements() { |
679 |
+ |
final Object[] es = elementData; |
680 |
+ |
for (int to = elementCount, i = elementCount = 0; i < to; i++) |
681 |
+ |
es[i] = null; |
682 |
|
modCount++; |
631 |
– |
// Let gc do its work |
632 |
– |
for (int i = 0; i < elementCount; i++) |
633 |
– |
elementData[i] = null; |
634 |
– |
|
635 |
– |
elementCount = 0; |
683 |
|
} |
684 |
|
|
685 |
|
/** |
692 |
|
public synchronized Object clone() { |
693 |
|
try { |
694 |
|
@SuppressWarnings("unchecked") |
695 |
< |
Vector<E> v = (Vector<E>) super.clone(); |
695 |
> |
Vector<E> v = (Vector<E>) super.clone(); |
696 |
|
v.elementData = Arrays.copyOf(elementData, elementCount); |
697 |
|
v.modCount = 0; |
698 |
|
return v; |
699 |
|
} catch (CloneNotSupportedException e) { |
700 |
|
// this shouldn't happen, since we are Cloneable |
701 |
< |
throw new InternalError(); |
701 |
> |
throw new InternalError(e); |
702 |
|
} |
703 |
|
} |
704 |
|
|
726 |
|
* of the Vector <em>only</em> if the caller knows that the Vector |
727 |
|
* does not contain any null elements.) |
728 |
|
* |
729 |
+ |
* @param <T> type of array elements. The same type as {@code <E>} or a |
730 |
+ |
* supertype of {@code <E>}. |
731 |
|
* @param a the array into which the elements of the Vector are to |
732 |
|
* be stored, if it is big enough; otherwise, a new array of the |
733 |
|
* same runtime type is allocated for this purpose. |
734 |
|
* @return an array containing the elements of the Vector |
735 |
< |
* @throws ArrayStoreException if the runtime type of a is not a supertype |
736 |
< |
* of the runtime type of every element in this Vector |
735 |
> |
* @throws ArrayStoreException if the runtime type of a, {@code <T>}, is not |
736 |
> |
* a supertype of the runtime type, {@code <E>}, of every element in this |
737 |
> |
* Vector |
738 |
|
* @throws NullPointerException if the given array is null |
739 |
|
* @since 1.2 |
740 |
|
*/ |
758 |
|
return (E) elementData[index]; |
759 |
|
} |
760 |
|
|
761 |
+ |
@SuppressWarnings("unchecked") |
762 |
+ |
static <E> E elementAt(Object[] es, int index) { |
763 |
+ |
return (E) es[index]; |
764 |
+ |
} |
765 |
+ |
|
766 |
|
/** |
767 |
|
* Returns the element at the specified position in this Vector. |
768 |
|
* |
800 |
|
} |
801 |
|
|
802 |
|
/** |
803 |
+ |
* This helper method split out from add(E) to keep method |
804 |
+ |
* bytecode size under 35 (the -XX:MaxInlineSize default value), |
805 |
+ |
* which helps when add(E) is called in a C1-compiled loop. |
806 |
+ |
*/ |
807 |
+ |
private void add(E e, Object[] elementData, int s) { |
808 |
+ |
if (s == elementData.length) |
809 |
+ |
elementData = grow(); |
810 |
+ |
elementData[s] = e; |
811 |
+ |
elementCount = s + 1; |
812 |
+ |
// checkInvariants(); |
813 |
+ |
} |
814 |
+ |
|
815 |
+ |
/** |
816 |
|
* Appends the specified element to the end of this Vector. |
817 |
|
* |
818 |
|
* @param e element to be appended to this Vector |
821 |
|
*/ |
822 |
|
public synchronized boolean add(E e) { |
823 |
|
modCount++; |
824 |
< |
ensureCapacityHelper(elementCount + 1); |
757 |
< |
elementData[elementCount++] = e; |
824 |
> |
add(e, elementData, elementCount); |
825 |
|
return true; |
826 |
|
} |
827 |
|
|
829 |
|
* Removes the first occurrence of the specified element in this Vector |
830 |
|
* If the Vector does not contain the element, it is unchanged. More |
831 |
|
* formally, removes the element with the lowest index i such that |
832 |
< |
* {@code (o==null ? get(i)==null : o.equals(get(i)))} (if such |
832 |
> |
* {@code Objects.equals(o, get(i))} (if such |
833 |
|
* an element exists). |
834 |
|
* |
835 |
|
* @param o element to be removed from this Vector, if present |
860 |
|
* Shifts any subsequent elements to the left (subtracts one from their |
861 |
|
* indices). Returns the element that was removed from the Vector. |
862 |
|
* |
796 |
– |
* @throws ArrayIndexOutOfBoundsException if the index is out of range |
797 |
– |
* ({@code index < 0 || index >= size()}) |
863 |
|
* @param index the index of the element to be removed |
864 |
|
* @return element that was removed |
865 |
+ |
* @throws ArrayIndexOutOfBoundsException if the index is out of range |
866 |
+ |
* ({@code index < 0 || index >= size()}) |
867 |
|
* @since 1.2 |
868 |
|
*/ |
869 |
|
public synchronized E remove(int index) { |
878 |
|
numMoved); |
879 |
|
elementData[--elementCount] = null; // Let gc do its work |
880 |
|
|
881 |
+ |
// checkInvariants(); |
882 |
|
return oldValue; |
883 |
|
} |
884 |
|
|
921 |
|
* @throws NullPointerException if the specified collection is null |
922 |
|
* @since 1.2 |
923 |
|
*/ |
924 |
< |
public synchronized boolean addAll(Collection<? extends E> c) { |
857 |
< |
modCount++; |
924 |
> |
public boolean addAll(Collection<? extends E> c) { |
925 |
|
Object[] a = c.toArray(); |
926 |
+ |
modCount++; |
927 |
|
int numNew = a.length; |
928 |
< |
ensureCapacityHelper(elementCount + numNew); |
929 |
< |
System.arraycopy(a, 0, elementData, elementCount, numNew); |
930 |
< |
elementCount += numNew; |
931 |
< |
return numNew != 0; |
928 |
> |
if (numNew == 0) |
929 |
> |
return false; |
930 |
> |
synchronized (this) { |
931 |
> |
Object[] elementData = this.elementData; |
932 |
> |
final int s = elementCount; |
933 |
> |
if (numNew > elementData.length - s) |
934 |
> |
elementData = grow(s + numNew); |
935 |
> |
System.arraycopy(a, 0, elementData, s, numNew); |
936 |
> |
elementCount = s + numNew; |
937 |
> |
// checkInvariants(); |
938 |
> |
return true; |
939 |
> |
} |
940 |
|
} |
941 |
|
|
942 |
|
/** |
947 |
|
* @return true if this Vector changed as a result of the call |
948 |
|
* @throws ClassCastException if the types of one or more elements |
949 |
|
* in this vector are incompatible with the specified |
950 |
< |
* collection (optional) |
950 |
> |
* collection |
951 |
> |
* (<a href="Collection.html#optional-restrictions">optional</a>) |
952 |
|
* @throws NullPointerException if this vector contains one or more null |
953 |
|
* elements and the specified collection does not support null |
954 |
< |
* elements (optional), or if the specified collection is null |
954 |
> |
* elements |
955 |
> |
* (<a href="Collection.html#optional-restrictions">optional</a>), |
956 |
> |
* or if the specified collection is null |
957 |
|
* @since 1.2 |
958 |
|
*/ |
959 |
< |
public synchronized boolean removeAll(Collection<?> c) { |
960 |
< |
return super.removeAll(c); |
959 |
> |
public boolean removeAll(Collection<?> c) { |
960 |
> |
Objects.requireNonNull(c); |
961 |
> |
return bulkRemove(e -> c.contains(e)); |
962 |
|
} |
963 |
|
|
964 |
|
/** |
971 |
|
* @return true if this Vector changed as a result of the call |
972 |
|
* @throws ClassCastException if the types of one or more elements |
973 |
|
* in this vector are incompatible with the specified |
974 |
< |
* collection (optional) |
974 |
> |
* collection |
975 |
> |
* (<a href="Collection.html#optional-restrictions">optional</a>) |
976 |
|
* @throws NullPointerException if this vector contains one or more null |
977 |
|
* elements and the specified collection does not support null |
978 |
< |
* elements (optional), or if the specified collection is null |
978 |
> |
* elements |
979 |
> |
* (<a href="Collection.html#optional-restrictions">optional</a>), |
980 |
> |
* or if the specified collection is null |
981 |
|
* @since 1.2 |
982 |
|
*/ |
983 |
< |
public synchronized boolean retainAll(Collection<?> c) { |
984 |
< |
return super.retainAll(c); |
983 |
> |
public boolean retainAll(Collection<?> c) { |
984 |
> |
Objects.requireNonNull(c); |
985 |
> |
return bulkRemove(e -> !c.contains(e)); |
986 |
> |
} |
987 |
> |
|
988 |
> |
@Override |
989 |
> |
public boolean removeIf(Predicate<? super E> filter) { |
990 |
> |
Objects.requireNonNull(filter); |
991 |
> |
return bulkRemove(filter); |
992 |
> |
} |
993 |
> |
|
994 |
> |
// A tiny bit set implementation |
995 |
> |
|
996 |
> |
private static long[] nBits(int n) { |
997 |
> |
return new long[((n - 1) >> 6) + 1]; |
998 |
> |
} |
999 |
> |
private static void setBit(long[] bits, int i) { |
1000 |
> |
bits[i >> 6] |= 1L << i; |
1001 |
> |
} |
1002 |
> |
private static boolean isClear(long[] bits, int i) { |
1003 |
> |
return (bits[i >> 6] & (1L << i)) == 0; |
1004 |
> |
} |
1005 |
> |
|
1006 |
> |
private synchronized boolean bulkRemove(Predicate<? super E> filter) { |
1007 |
> |
int expectedModCount = modCount; |
1008 |
> |
final Object[] es = elementData; |
1009 |
> |
final int end = elementCount; |
1010 |
> |
int i; |
1011 |
> |
// Optimize for initial run of survivors |
1012 |
> |
for (i = 0; i < end && !filter.test(elementAt(es, i)); i++) |
1013 |
> |
; |
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 (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 |
> |
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 |
> |
} |
1042 |
|
} |
1043 |
|
|
1044 |
|
/** |
1059 |
|
* @since 1.2 |
1060 |
|
*/ |
1061 |
|
public synchronized boolean addAll(int index, Collection<? extends E> c) { |
922 |
– |
modCount++; |
1062 |
|
if (index < 0 || index > elementCount) |
1063 |
|
throw new ArrayIndexOutOfBoundsException(index); |
1064 |
|
|
1065 |
|
Object[] a = c.toArray(); |
1066 |
+ |
modCount++; |
1067 |
|
int numNew = a.length; |
1068 |
< |
ensureCapacityHelper(elementCount + numNew); |
1068 |
> |
if (numNew == 0) |
1069 |
> |
return false; |
1070 |
> |
Object[] elementData = this.elementData; |
1071 |
> |
final int s = elementCount; |
1072 |
> |
if (numNew > elementData.length - s) |
1073 |
> |
elementData = grow(s + numNew); |
1074 |
|
|
1075 |
< |
int numMoved = elementCount - index; |
1075 |
> |
int numMoved = s - index; |
1076 |
|
if (numMoved > 0) |
1077 |
< |
System.arraycopy(elementData, index, elementData, index + numNew, |
1077 |
> |
System.arraycopy(elementData, index, |
1078 |
> |
elementData, index + numNew, |
1079 |
|
numMoved); |
934 |
– |
|
1080 |
|
System.arraycopy(a, 0, elementData, index, numNew); |
1081 |
< |
elementCount += numNew; |
1082 |
< |
return numNew != 0; |
1081 |
> |
elementCount = s + numNew; |
1082 |
> |
// checkInvariants(); |
1083 |
> |
return true; |
1084 |
|
} |
1085 |
|
|
1086 |
|
/** |
1088 |
|
* true if and only if the specified Object is also a List, both Lists |
1089 |
|
* have the same size, and all corresponding pairs of elements in the two |
1090 |
|
* Lists are <em>equal</em>. (Two elements {@code e1} and |
1091 |
< |
* {@code e2} are <em>equal</em> if {@code (e1==null ? e2==null : |
1092 |
< |
* e1.equals(e2))}.) In other words, two Lists are defined to be |
1091 |
> |
* {@code e2} are <em>equal</em> if {@code Objects.equals(e1, e2)}.) |
1092 |
> |
* In other words, two Lists are defined to be |
1093 |
|
* equal if they contain the same elements in the same order. |
1094 |
|
* |
1095 |
|
* @param o the Object to be compared for equality with this Vector |
1162 |
|
*/ |
1163 |
|
protected synchronized void removeRange(int fromIndex, int toIndex) { |
1164 |
|
modCount++; |
1165 |
< |
int numMoved = elementCount - toIndex; |
1166 |
< |
System.arraycopy(elementData, toIndex, elementData, fromIndex, |
1167 |
< |
numMoved); |
1165 |
> |
shiftTailOverGap(elementData, fromIndex, toIndex); |
1166 |
> |
// checkInvariants(); |
1167 |
> |
} |
1168 |
|
|
1169 |
< |
// Let gc do its work |
1170 |
< |
int newElementCount = elementCount - (toIndex-fromIndex); |
1171 |
< |
while (elementCount != newElementCount) |
1172 |
< |
elementData[--elementCount] = null; |
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). This method is present merely for synchronization. |
1179 |
< |
* It just calls the default writeObject method. |
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 synchronized void writeObject(java.io.ObjectOutputStream s) |
1186 |
< |
throws java.io.IOException |
1187 |
< |
{ |
1188 |
< |
s.defaultWriteObject(); |
1185 |
> |
private void writeObject(java.io.ObjectOutputStream s) |
1186 |
> |
throws java.io.IOException { |
1187 |
> |
final java.io.ObjectOutputStream.PutField fields = s.putFields(); |
1188 |
> |
final Object[] data; |
1189 |
> |
synchronized (this) { |
1190 |
> |
fields.put("capacityIncrement", capacityIncrement); |
1191 |
> |
fields.put("elementCount", elementCount); |
1192 |
> |
data = elementData.clone(); |
1193 |
> |
} |
1194 |
> |
fields.put("elementData", data); |
1195 |
> |
s.writeFields(); |
1196 |
|
} |
1197 |
|
|
1198 |
|
/** |
1273 |
|
lastRet = -1; |
1274 |
|
} |
1275 |
|
|
1276 |
+ |
@Override |
1277 |
+ |
public void forEachRemaining(Consumer<? super E> action) { |
1278 |
+ |
Objects.requireNonNull(action); |
1279 |
+ |
synchronized (Vector.this) { |
1280 |
+ |
final int size = elementCount; |
1281 |
+ |
int i = cursor; |
1282 |
+ |
if (i >= size) { |
1283 |
+ |
return; |
1284 |
+ |
} |
1285 |
+ |
final Object[] es = elementData; |
1286 |
+ |
if (i >= es.length) |
1287 |
+ |
throw new ConcurrentModificationException(); |
1288 |
+ |
while (i < size && modCount == expectedModCount) |
1289 |
+ |
action.accept(elementAt(es, i++)); |
1290 |
+ |
// update once at end of iteration to reduce heap write traffic |
1291 |
+ |
cursor = i; |
1292 |
+ |
lastRet = i - 1; |
1293 |
+ |
checkForComodification(); |
1294 |
+ |
} |
1295 |
+ |
} |
1296 |
+ |
|
1297 |
|
final void checkForComodification() { |
1298 |
|
if (modCount != expectedModCount) |
1299 |
|
throw new ConcurrentModificationException(); |
1352 |
|
lastRet = -1; |
1353 |
|
} |
1354 |
|
} |
1355 |
+ |
|
1356 |
+ |
@Override |
1357 |
+ |
public synchronized void forEach(Consumer<? super E> action) { |
1358 |
+ |
Objects.requireNonNull(action); |
1359 |
+ |
final int expectedModCount = modCount; |
1360 |
+ |
final Object[] es = elementData; |
1361 |
+ |
final int size = elementCount; |
1362 |
+ |
for (int i = 0; modCount == expectedModCount && i < size; i++) |
1363 |
+ |
action.accept(elementAt(es, i)); |
1364 |
+ |
if (modCount != expectedModCount) |
1365 |
+ |
throw new ConcurrentModificationException(); |
1366 |
+ |
// checkInvariants(); |
1367 |
+ |
} |
1368 |
+ |
|
1369 |
+ |
@Override |
1370 |
+ |
public synchronized void replaceAll(UnaryOperator<E> operator) { |
1371 |
+ |
Objects.requireNonNull(operator); |
1372 |
+ |
final int expectedModCount = modCount; |
1373 |
+ |
final Object[] es = elementData; |
1374 |
+ |
final int size = elementCount; |
1375 |
+ |
for (int i = 0; modCount == expectedModCount && i < size; i++) |
1376 |
+ |
es[i] = operator.apply(elementAt(es, i)); |
1377 |
+ |
if (modCount != expectedModCount) |
1378 |
+ |
throw new ConcurrentModificationException(); |
1379 |
+ |
modCount++; |
1380 |
+ |
// checkInvariants(); |
1381 |
+ |
} |
1382 |
+ |
|
1383 |
+ |
@SuppressWarnings("unchecked") |
1384 |
+ |
@Override |
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) |
1389 |
+ |
throw new ConcurrentModificationException(); |
1390 |
+ |
modCount++; |
1391 |
+ |
// checkInvariants(); |
1392 |
+ |
} |
1393 |
+ |
|
1394 |
+ |
/** |
1395 |
+ |
* Creates a <em><a href="Spliterator.html#binding">late-binding</a></em> |
1396 |
+ |
* and <em>fail-fast</em> {@link Spliterator} over the elements in this |
1397 |
+ |
* list. |
1398 |
+ |
* |
1399 |
+ |
* <p>The {@code Spliterator} reports {@link Spliterator#SIZED}, |
1400 |
+ |
* {@link Spliterator#SUBSIZED}, and {@link Spliterator#ORDERED}. |
1401 |
+ |
* Overriding implementations should document the reporting of additional |
1402 |
+ |
* characteristic values. |
1403 |
+ |
* |
1404 |
+ |
* @return a {@code Spliterator} over the elements in this list |
1405 |
+ |
* @since 1.8 |
1406 |
+ |
*/ |
1407 |
+ |
@Override |
1408 |
+ |
public Spliterator<E> spliterator() { |
1409 |
+ |
return new VectorSpliterator(null, 0, -1, 0); |
1410 |
+ |
} |
1411 |
+ |
|
1412 |
+ |
/** Similar to ArrayList Spliterator */ |
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(Object[] array, int origin, int fence, |
1421 |
+ |
int expectedModCount) { |
1422 |
+ |
this.array = array; |
1423 |
+ |
this.index = origin; |
1424 |
+ |
this.fence = fence; |
1425 |
+ |
this.expectedModCount = expectedModCount; |
1426 |
+ |
} |
1427 |
+ |
|
1428 |
+ |
private int getFence() { // initialize on first use |
1429 |
+ |
int hi; |
1430 |
+ |
if ((hi = fence) < 0) { |
1431 |
+ |
synchronized (Vector.this) { |
1432 |
+ |
array = elementData; |
1433 |
+ |
expectedModCount = modCount; |
1434 |
+ |
hi = fence = elementCount; |
1435 |
+ |
} |
1436 |
+ |
} |
1437 |
+ |
return hi; |
1438 |
+ |
} |
1439 |
+ |
|
1440 |
+ |
public Spliterator<E> trySplit() { |
1441 |
+ |
int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; |
1442 |
+ |
return (lo >= mid) ? null : |
1443 |
+ |
new VectorSpliterator(array, lo, index = mid, expectedModCount); |
1444 |
+ |
} |
1445 |
+ |
|
1446 |
+ |
@SuppressWarnings("unchecked") |
1447 |
+ |
public boolean tryAdvance(Consumer<? super E> action) { |
1448 |
+ |
int i; |
1449 |
+ |
if (action == null) |
1450 |
+ |
throw new NullPointerException(); |
1451 |
+ |
if (getFence() > (i = index)) { |
1452 |
+ |
index = i + 1; |
1453 |
+ |
action.accept((E)array[i]); |
1454 |
+ |
if (modCount != expectedModCount) |
1455 |
+ |
throw new ConcurrentModificationException(); |
1456 |
+ |
return true; |
1457 |
+ |
} |
1458 |
+ |
return false; |
1459 |
+ |
} |
1460 |
+ |
|
1461 |
+ |
@SuppressWarnings("unchecked") |
1462 |
+ |
public void forEachRemaining(Consumer<? super E> action) { |
1463 |
+ |
if (action == null) |
1464 |
+ |
throw new NullPointerException(); |
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() { |
1475 |
+ |
return getFence() - index; |
1476 |
+ |
} |
1477 |
+ |
|
1478 |
+ |
public int characteristics() { |
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 |
|
} |