- Type Parameters:
E
- the type of elements held in this set
- All Implemented Interfaces:
Serializable
,Iterable<E>
,Collection<E>
,Set<E>
Set
that uses an internal CopyOnWriteArrayList
for all of its operations. Thus, it shares the same basic properties:
- It is best suited for applications in which set sizes generally stay small, read-only operations vastly outnumber mutative operations, and you need to prevent interference among threads during traversal.
- It is thread-safe.
- Mutative operations (
add
,set
,remove
, etc.) are expensive since they usually entail copying the entire underlying array. - Iterators do not support the mutative
remove
operation. - Traversal via iterators is fast and cannot encounter interference from other threads. Iterators rely on unchanging snapshots of the array at the time the iterators were constructed.
Sample Usage. The following code sketch uses a copy-on-write set to maintain a set of Handler objects that perform some action upon state updates.
class Handler { void handle() { ... } }
class X {
private final CopyOnWriteArraySet<Handler> handlers
= new CopyOnWriteArraySet<>();
public void addHandler(Handler h) { handlers.add(h); }
private long internalState;
private synchronized void changeState() { internalState = ...; }
public void update() {
changeState();
for (Handler handler : handlers)
handler.handle();
}
}
This class is a member of the Java Collections Framework.
- Since:
- 1.5
- Author:
- Doug Lea
- See Also:
-
Constructor Summary
ConstructorDescriptionCreates an empty set.CopyOnWriteArraySet
(Collection<? extends E> c) Creates a set containing all of the elements of the specified collection. -
Method Summary
Modifier and TypeMethodDescriptionboolean
Adds the specified element to this set if it is not already present.boolean
addAll
(Collection<? extends E> c) Adds all of the elements in the specified collection to this set if they're not already present.void
clear()
Removes all of the elements from this set.boolean
Returnstrue
if this set contains the specified element.boolean
containsAll
(Collection<?> c) Returnstrue
if this set contains all of the elements of the specified collection.boolean
Compares the specified object with this set for equality.void
boolean
isEmpty()
Returnstrue
if this set contains no elements.iterator()
Returns an iterator over the elements contained in this set in the order in which these elements were added.boolean
Removes the specified element from this set if it is present.boolean
removeAll
(Collection<?> c) Removes from this set all of its elements that are contained in the specified collection.boolean
boolean
retainAll
(Collection<?> c) Retains only the elements in this set that are contained in the specified collection.int
size()
Returns the number of elements in this set.Returns aSpliterator
over the elements in this set in the order in which these elements were added.Object[]
toArray()
Returns an array containing all of the elements in this set.<T> T[]
toArray
(T[] a) Returns an array containing all of the elements in this set; the runtime type of the returned array is that of the specified array.Methods declared in class java.util.AbstractSet
hashCode
Methods declared in class java.util.AbstractCollection
toString
Methods declared in class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
Methods declared in interface java.util.Collection
parallelStream, stream, toArray
-
Constructor Details
-
CopyOnWriteArraySet
public CopyOnWriteArraySet()Creates an empty set. -
CopyOnWriteArraySet
Creates a set containing all of the elements of the specified collection.- Parameters:
c
- the collection of elements to initially contain- Throws:
NullPointerException
- if the specified collection is null
-
-
Method Details
-
size
public int size()Returns the number of elements in this set.- Specified by:
size
in interfaceCollection<E>
- Specified by:
size
in interfaceSet<E>
- Specified by:
size
in classAbstractCollection<E>
- Returns:
- the number of elements in this set
-
isEmpty
public boolean isEmpty()Returnstrue
if this set contains no elements.- Specified by:
isEmpty
in interfaceCollection<E>
- Specified by:
isEmpty
in interfaceSet<E>
- Overrides:
isEmpty
in classAbstractCollection<E>
- Returns:
true
if this set contains no elements
-
contains
Returnstrue
if this set contains the specified element. More formally, returnstrue
if and only if this set contains an elemente
such thatObjects.equals(o, e)
.- Specified by:
contains
in interfaceCollection<E>
- Specified by:
contains
in interfaceSet<E>
- Overrides:
contains
in classAbstractCollection<E>
- Parameters:
o
- element whose presence in this set is to be tested- Returns:
true
if this set contains the specified element
-
toArray
Returns an array containing all of the elements in this set. If this set makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order.The returned array will be "safe" in that no references to it are maintained by this set. (In other words, this method must allocate a new array even if this set is backed by an array). The caller is thus free to modify the returned array.
This method acts as bridge between array-based and collection-based APIs.
- Specified by:
toArray
in interfaceCollection<E>
- Specified by:
toArray
in interfaceSet<E>
- Overrides:
toArray
in classAbstractCollection<E>
- Returns:
- an array containing all the elements in this set
-
toArray
public <T> T[] toArray(T[] a) Returns an array containing all of the elements in this set; the runtime type of the returned array is that of the specified array. If the set 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 set.If this set fits in the specified array with room to spare (i.e., the array has more elements than this set), the element in the array immediately following the end of the set is set to
null
. (This is useful in determining the length of this set only if the caller knows that this set does not contain any null elements.)If this set makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order.
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 set known to contain only strings. The following code can be used to dump the set into a newly allocated array ofString
:String[] y = x.toArray(new String[0]);
toArray(new Object[0])
is identical in function totoArray()
.- Specified by:
toArray
in interfaceCollection<E>
- Specified by:
toArray
in interfaceSet<E>
- Overrides:
toArray
in classAbstractCollection<E>
- Parameters:
a
- the array into which the elements of this set are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purpose.- Returns:
- an array containing all the elements in this set
- Throws:
ArrayStoreException
- if the runtime type of the specified array is not a supertype of the runtime type of every element in this setNullPointerException
- if the specified array is null
-
clear
public void clear()Removes all of the elements from this set. The set will be empty after this call returns.- Specified by:
clear
in interfaceCollection<E>
- Specified by:
clear
in interfaceSet<E>
- Overrides:
clear
in classAbstractCollection<E>
-
remove
Removes the specified element from this set if it is present. More formally, removes an elemente
such thatObjects.equals(o, e)
, if this set contains such an element. Returnstrue
if this set contained the element (or equivalently, if this set changed as a result of the call). (This set will not contain the element once the call returns.)- Specified by:
remove
in interfaceCollection<E>
- Specified by:
remove
in interfaceSet<E>
- Overrides:
remove
in classAbstractCollection<E>
- Parameters:
o
- object to be removed from this set, if present- Returns:
true
if this set contained the specified element
-
add
Adds the specified element to this set if it is not already present. More formally, adds the specified elemente
to this set if the set contains no elemente2
such thatObjects.equals(e, e2)
. If this set already contains the element, the call leaves the set unchanged and returnsfalse
.- Specified by:
add
in interfaceCollection<E>
- Specified by:
add
in interfaceSet<E>
- Overrides:
add
in classAbstractCollection<E>
- Parameters:
e
- element to be added to this set- Returns:
true
if this set did not already contain the specified element
-
containsAll
Returnstrue
if this set contains all of the elements of the specified collection. If the specified collection is also a set, this method returnstrue
if it is a subset of this set.- Specified by:
containsAll
in interfaceCollection<E>
- Specified by:
containsAll
in interfaceSet<E>
- Overrides:
containsAll
in classAbstractCollection<E>
- Parameters:
c
- collection to be checked for containment in this set- Returns:
true
if this set contains all of the elements of the specified collection- Throws:
NullPointerException
- if the specified collection is null- See Also:
-
addAll
Adds all of the elements in the specified collection to this set if they're not already present. If the specified collection is also a set, theaddAll
operation effectively modifies this set so that its value is the union of the two sets. The behavior of this operation is undefined if the specified collection is modified while the operation is in progress.- Specified by:
addAll
in interfaceCollection<E>
- Specified by:
addAll
in interfaceSet<E>
- Overrides:
addAll
in classAbstractCollection<E>
- Parameters:
c
- collection containing elements to be added to this set- Returns:
true
if this set changed as a result of the call- Throws:
NullPointerException
- if the specified collection is null- See Also:
-
removeAll
Removes from this set all of its elements that are contained in the specified collection. If the specified collection is also a set, this operation effectively modifies this set so that its value is the asymmetric set difference of the two sets.- Specified by:
removeAll
in interfaceCollection<E>
- Specified by:
removeAll
in interfaceSet<E>
- Overrides:
removeAll
in classAbstractSet<E>
- Parameters:
c
- collection containing elements to be removed from this set- Returns:
true
if this set changed as a result of the call- Throws:
ClassCastException
- if the class of an element of this set is incompatible with the specified collection (optional)NullPointerException
- if this set contains a null element and the specified collection does not permit null elements (optional), or if the specified collection is null- See Also:
-
retainAll
Retains only the elements in this set that are contained in the specified collection. In other words, removes from this set all of its elements that are not contained in the specified collection. If the specified collection is also a set, this operation effectively modifies this set so that its value is the intersection of the two sets.- Specified by:
retainAll
in interfaceCollection<E>
- Specified by:
retainAll
in interfaceSet<E>
- Overrides:
retainAll
in classAbstractCollection<E>
- Parameters:
c
- collection containing elements to be retained in this set- Returns:
true
if this set changed as a result of the call- Throws:
ClassCastException
- if the class of an element of this set is incompatible with the specified collection (optional)NullPointerException
- if this set contains a null element and the specified collection does not permit null elements (optional), or if the specified collection is null- See Also:
-
iterator
Returns an iterator over the elements contained in this set in the order in which these elements were added.The returned iterator provides a snapshot of the state of the set when the iterator was constructed. No synchronization is needed while traversing the iterator. The iterator does NOT support the
remove
method. -
equals
Compares the specified object with this set for equality. Returnstrue
if the specified object is the same object as this object, or if it is also aSet
and the elements returned by an iterator over the specified set are the same as the elements returned by an iterator over this set. More formally, the two iterators are considered to return the same elements if they return the same number of elements and for every elemente1
returned by the iterator over the specified set, there is an elemente2
returned by the iterator over this set such thatObjects.equals(e1, e2)
.- Specified by:
equals
in interfaceCollection<E>
- Specified by:
equals
in interfaceSet<E>
- Overrides:
equals
in classAbstractSet<E>
- Parameters:
o
- object to be compared for equality with this set- Returns:
true
if the specified object is equal to this set
-
removeIf
- Specified by:
removeIf
in interfaceCollection<E>
- Throws:
NullPointerException
-
forEach
- Specified by:
forEach
in interfaceIterable<E>
- Throws:
NullPointerException
-
spliterator
Returns aSpliterator
over the elements in this set in the order in which these elements were added.The
Spliterator
reportsSpliterator.IMMUTABLE
,Spliterator.DISTINCT
,Spliterator.SIZED
, andSpliterator.SUBSIZED
.The spliterator provides a snapshot of the state of the set when the spliterator was constructed. No synchronization is needed while operating on the spliterator.
- Specified by:
spliterator
in interfaceCollection<E>
- Specified by:
spliterator
in interfaceIterable<E>
- Specified by:
spliterator
in interfaceSet<E>
- Returns:
- a
Spliterator
over the elements in this set - Since:
- 1.8
-