java.lang.Object | |
↳ | java.util.concurrent.CopyOnWriteArrayList<E> |
A thread-safe variant of ArrayList
in which all mutative
operations (add, set, and so on) are implemented by
making a fresh copy of the underlying array.
This is ordinarily too costly, but may be more efficient than alternatives when traversal operations vastly outnumber mutations, and is useful when you cannot or don't want to synchronize traversals, yet need to preclude interference among concurrent threads. The "snapshot" style iterator method uses a reference to the state of the array at the point that the iterator was created. This array never changes during the lifetime of the iterator, so interference is impossible and the iterator is guaranteed not to throw ConcurrentModificationException. The iterator will not reflect additions, removals, or changes to the list since the iterator was created. Element-changing operations on iterators themselves (remove, set, and add) are not supported. These methods throw UnsupportedOperationException.
All elements are permitted, including null.
Memory consistency effects: As with other concurrent
collections, actions in a thread prior to placing an object into a
CopyOnWriteArrayList
happen-before
actions subsequent to the access or removal of that element from
the CopyOnWriteArrayList
in another thread.
Public Constructors | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Creates an empty list.
| |||||||||||
Creates a list containing the elements of the specified
collection, in the order they are returned by the collection's
iterator.
| |||||||||||
Creates a list holding a copy of the given array.
|
Public Methods | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Inserts the specified element at the specified position in this
list.
| |||||||||||
Appends the specified element to the end of this list.
| |||||||||||
Inserts all of the elements in the specified collection into this
list, starting at the specified position.
| |||||||||||
Appends all of the elements in the specified collection to the end
of this list, in the order that they are returned by the specified
collection's iterator.
| |||||||||||
Appends all of the elements in the specified collection that
are not already contained in this list, to the end of
this list, in the order that they are returned by the
specified collection's iterator.
| |||||||||||
Append the element if not present.
| |||||||||||
Removes all of the elements from this list.
| |||||||||||
Returns a shallow copy of this list.
| |||||||||||
Returns true if this list contains the specified element.
| |||||||||||
Returns true if this list contains all of the elements of the
specified collection.
| |||||||||||
Compares the specified object with this list for equality.
| |||||||||||
Returns the element at the specified location in this
List . | |||||||||||
Returns the hash code value for this list.
| |||||||||||
Returns the index of the first occurrence of the specified element in
this list, searching forwards from index, or returns -1 if
the element is not found.
| |||||||||||
Searches this
List for the specified object and returns the index of the
first occurrence.
| |||||||||||
Returns true if this list contains no elements.
| |||||||||||
Returns an iterator over the elements in this list in proper sequence.
| |||||||||||
Returns the index of the last occurrence of the specified element in
this list, searching backwards from index, or returns -1 if
the element is not found.
| |||||||||||
Searches this
List for the specified object and returns the index of the
last occurrence.
| |||||||||||
Returns a
List iterator on the elements of this List .
The returned iterator provides a snapshot of the state of the list when the iterator was constructed. | |||||||||||
Returns a list iterator on the elements of this
List .
The returned iterator provides a snapshot of the state of the list when the iterator was constructed. | |||||||||||
Removes the element at the specified position in this list.
| |||||||||||
Removes the first occurrence of the specified element from this list,
if it is present.
| |||||||||||
Removes from this list all of its elements that are contained in
the specified collection.
| |||||||||||
Retains only the elements in this list that are contained in the
specified collection.
| |||||||||||
Replaces the element at the specified position in this list with the
specified element.
| |||||||||||
Returns the number of elements in this list.
| |||||||||||
Returns a view of the portion of this list between
fromIndex, inclusive, and toIndex, exclusive.
| |||||||||||
Returns an array containing all of the elements in this list in
proper sequence (from first to last element); the runtime type of
the returned array is that of the specified array.
| |||||||||||
Returns an array containing all of the elements in this list
in proper sequence (from first to last element).
| |||||||||||
Returns a string representation of this list.
|
[Expand]
Inherited Methods | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
From class java.lang.Object
| |||||||||||
From interface java.lang.Iterable
| |||||||||||
From interface java.util.Collection
| |||||||||||
From interface java.util.List
|
Creates a list containing the elements of the specified collection, in the order they are returned by the collection's iterator.
c | the collection of initially held elements |
---|
NullPointerException | if the specified collection is null |
---|
Creates a list holding a copy of the given array.
toCopyIn | the array (a copy of this array is used as the internal array) |
---|
NullPointerException | if the specified array is null |
---|
Inserts the specified element at the specified position in this list. Shifts the element currently at that position (if any) and any subsequent elements to the right (adds one to their indices).
index | the index at which to insert. |
---|---|
element | the object to add. |
IndexOutOfBoundsException |
---|
Appends the specified element to the end of this list.
e | element to be appended to this list |
---|
add(E)
)
Inserts all of the elements in the specified collection into this list, starting at the specified position. Shifts the element currently at that position (if any) and any subsequent elements to the right (increases their indices). The new elements will appear in this list in the order that they are returned by the specified collection's iterator.
index | index at which to insert the first element from the specified collection |
---|---|
c | collection containing elements to be added to this list |
IndexOutOfBoundsException | |
---|---|
NullPointerException | if the specified collection is null |
Appends all of the elements in the specified collection to the end of this list, in the order that they are returned by the specified collection's iterator.
c | collection containing elements to be added to this list |
---|
NullPointerException | if the specified collection is null |
---|
Appends all of the elements in the specified collection that are not already contained in this list, to the end of this list, in the order that they are returned by the specified collection's iterator.
c | collection containing elements to be added to this list |
---|
NullPointerException | if the specified collection is null |
---|
Append the element if not present.
e | element to be added to this list, if absent |
---|
Removes all of the elements from this list. The list will be empty after this call returns.
Returns a shallow copy of this list. (The elements themselves are not copied.)
Returns true if this list contains the specified element. More formally, returns true if and only if this list contains at least one element e such that (o==null ? e==null : o.equals(e)).
o | element whose presence in this list is to be tested |
---|
Returns true if this list contains all of the elements of the specified collection.
c | collection to be checked for containment in this list |
---|
NullPointerException | if the specified collection is null |
---|
Compares the specified object with this list for equality.
Returns true
if the specified object is the same object
as this object, or if it is also a List
and the sequence
of elements returned by an iterator
over the specified list is the same as the sequence returned by
an iterator over this list. The two sequences are considered to
be the same if they have the same length and corresponding
elements at the same position in the sequence are equal.
Two elements e1
and e2
are considered
equal if (e1==null ? e2==null : e1.equals(e2))
.
o | the object to be compared for equality with this list |
---|
true
if the specified object is equal to this list
Returns the element at the specified location in this List
.
index | the index of the element to return. |
---|
IndexOutOfBoundsException |
---|
Returns the hash code value for this list.
This implementation uses the definition in hashCode()
.
Returns the index of the first occurrence of the specified element in this list, searching forwards from index, or returns -1 if the element is not found. More formally, returns the lowest index i such that (i >= index && (e==null ? get(i)==null : e.equals(get(i)))), or -1 if there is no such index.
e | element to search for |
---|---|
index | index to start searching from |
IndexOutOfBoundsException | if the specified index is negative |
---|
Searches this List
for the specified object and returns the index of the
first occurrence.
o | the object to search for. |
---|
Returns true if this list contains no elements.
Returns an iterator over the elements in this list in proper sequence.
The returned iterator provides a snapshot of the state of the list when the iterator was constructed. No synchronization is needed while traversing the iterator. The iterator does NOT support the remove method.
Returns the index of the last occurrence of the specified element in this list, searching backwards from index, or returns -1 if the element is not found. More formally, returns the highest index i such that (i <= index && (e==null ? get(i)==null : e.equals(get(i)))), or -1 if there is no such index.
e | element to search for |
---|---|
index | index to start searching backwards from |
IndexOutOfBoundsException | if the specified index is greater than or equal to the current size of this list |
---|
Searches this List
for the specified object and returns the index of the
last occurrence.
o | the object to search for. |
---|
Returns a List
iterator on the elements of this List
. The elements are
iterated in the same order that they occur in the List
.
The returned iterator provides a snapshot of the state of the list when the iterator was constructed. No synchronization is needed while traversing the iterator. The iterator does NOT support the remove, set or add methods.
List
iterator on the elements of this List
Returns a list iterator on the elements of this List
. The elements are
iterated in the same order as they occur in the List
. The iteration
starts at the specified location.
The returned iterator provides a snapshot of the state of the list when the iterator was constructed. No synchronization is needed while traversing the iterator. The iterator does NOT support the remove, set or add methods.
index | the index at which to start the iteration. |
---|
List
.IndexOutOfBoundsException |
---|
Removes the element at the specified position in this list. Shifts any subsequent elements to the left (subtracts one from their indices). Returns the element that was removed from the list.
index | the index of the object to remove. |
---|
IndexOutOfBoundsException |
---|
Removes the first occurrence of the specified element from this list, if it is present. If this list does not contain the element, it is unchanged. More formally, removes the element with the lowest index i such that (o==null ? get(i)==null : o.equals(get(i))) (if such an element exists). Returns true if this list contained the specified element (or equivalently, if this list changed as a result of the call).
o | element to be removed from this list, if present |
---|
Removes from this list all of its elements that are contained in the specified collection. This is a particularly expensive operation in this class because of the need for an internal temporary array.
c | collection containing elements to be removed from this list |
---|
ClassCastException | if the class of an element of this list is incompatible with the specified collection (optional) |
---|---|
NullPointerException | if this list contains a null element and the specified collection does not permit null elements (optional), or if the specified collection is null |
Retains only the elements in this list that are contained in the specified collection. In other words, removes from this list all of its elements that are not contained in the specified collection.
c | collection containing elements to be retained in this list |
---|
ClassCastException | if the class of an element of this list is incompatible with the specified collection (optional) |
---|---|
NullPointerException | if this list contains a null element and the specified collection does not permit null elements (optional), or if the specified collection is null |
Replaces the element at the specified position in this list with the specified element.
index | the index at which to put the specified object. |
---|---|
element | the object to insert. |
IndexOutOfBoundsException |
---|
Returns the number of elements in this list.
Returns a view of the portion of this list between fromIndex, inclusive, and toIndex, exclusive. The returned list is backed by this list, so changes in the returned list are reflected in this list.
The semantics of the list returned by this method become undefined if the backing list (i.e., this list) is modified in any way other than via the returned list.
fromIndex | low endpoint (inclusive) of the subList |
---|---|
toIndex | high endpoint (exclusive) of the subList |
IndexOutOfBoundsException |
---|
Returns an array containing all of the elements in this list in proper sequence (from first to last element); the runtime type of the returned array is that of the specified array. If the list fits in the specified array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the specified array and the size of this list.
If this list fits in the specified array with room to spare (i.e., the array has more elements than this list), the element in the array immediately following the end of the list is set to null. (This is useful in determining the length of this list only if the caller knows that this list does not contain any null elements.)
Like the toArray()
method, this method acts as bridge between
array-based and collection-based APIs. Further, this method allows
precise control over the runtime type of the output array, and may,
under certain circumstances, be used to save allocation costs.
Suppose x is a list known to contain only strings. The following code can be used to dump the list into a newly allocated array of String:
String[] y = x.toArray(new String[0]);Note that toArray(new Object[0]) is identical in function to toArray().
a | the array into which the elements of the list are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purpose. |
---|
ArrayStoreException | if the runtime type of the specified array is not a supertype of the runtime type of every element in this list |
---|---|
NullPointerException | if the specified array is null |
Returns an array containing all of the elements in this list in proper sequence (from first to last element).
The returned array will be "safe" in that no references to it are maintained by this list. (In other words, this method must allocate a new array). The caller is thus free to modify the returned array.
This method acts as bridge between array-based and collection-based APIs.
Returns a string representation of this list. The string
representation consists of the string representations of the list's
elements in the order they are returned by its iterator, enclosed in
square brackets ("[]"). Adjacent elements are separated by
the characters ", " (comma and space). Elements are
converted to strings as by valueOf(Object)
.