java.util.concurrent
class CopyOnWriteArraySet

java.lang.Object java.util.AbstractCollection java.util.AbstractSet java.util.concurrent.CopyOnWriteArraySet

All Implemented Interfaces:

Serializable, Collection, Set

Most common way to construct:

CopyOnWriteArraySet empty = new CopyOnWriteArraySet();

Based on 33 examples

public class CopyOnWriteArraySet
extends AbstractSet
implements Serializable

A {@link java.util.Set} that uses an internal {@link 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<Handler>();
    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.

CopyOnWriteArraySet

public CopyOnWriteArraySet()

Creates an empty set.

CopyOnWriteArraySet

public CopyOnWriteArraySet(Collection c)

Creates a set containing all of the elements of the specified collection.

Parameters:

c - the collection of elements to initially contain

add

public boolean add(Object e)

Adds the specified element to this set if it is not already present. More formally, adds the specified element e to this set if the set contains no element e2 such that (e==null ? e2==null : e.equals(e2)). If this set already contains the element, the call leaves the set unchanged and returns false.

Overrides:

add in class AbstractCollection

Parameters:

e - element to be added to this set

Returns:

true if this set did not already contain the specified element

addAll

public boolean addAll(Collection c)

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, the addAll 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.

Overrides:

addAll in class AbstractCollection

Parameters:

c - collection containing elements to be added to this set

Returns:

true if this set changed as a result of the call

clear

public void clear()

Removes all of the elements from this set. The set will be empty after this call returns.

Overrides:

clear in class AbstractCollection

contains

public boolean contains(Object o)

Returns true if this set contains the specified element. More formally, returns true if and only if this set contains an element e such that (o==null ? e==null : o.equals(e)).

Overrides:

contains in class AbstractCollection

Parameters:

o - element whose presence in this set is to be tested

Returns:

true if this set contains the specified element

containsAll

public boolean containsAll(Collection c)

Returns true if this set contains all of the elements of the specified collection. If the specified collection is also a set, this method returns true if it is a subset of this set.

Overrides:

containsAll in class AbstractCollection

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

equals

public boolean equals(Object o)

Compares the specified object with this set for equality. Returns {@code true} if the specified object is the same object as this object, or if it is also a {@link Set} and the elements returned by an {@linkplain List#iterator() 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 element {@code e1} returned by the iterator over the specified set, there is an element {@code e2} returned by the iterator over this set such that {@code (e1==null ? e2==null : e1.equals(e2))}.

Overrides:

equals in class AbstractSet

Parameters:

o - object to be compared for equality with this set

Returns:

{@code true} if the specified object is equal to this set

isEmpty

public boolean isEmpty()

Returns true if this set contains no elements.

Overrides:

isEmpty in class AbstractCollection

Returns:

true if this set contains no elements

iterator

public Iterator 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.

Overrides:

iterator in class AbstractCollection

Returns:

an iterator over the elements in this set

remove

public boolean remove(Object o)

Removes the specified element from this set if it is present. More formally, removes an element e such that (o==null ? e==null : o.equals(e)), if this set contains such an element. Returns true 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.)

Overrides:

remove in class AbstractCollection

Parameters:

o - object to be removed from this set, if present

Returns:

true if this set contained the specified element

removeAll

public boolean removeAll(Collection c)

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.

Overrides:

removeAll in class AbstractSet

Parameters:

c - collection containing elements to be removed from this set

Returns:

true if this set changed as a result of the call

retainAll

public boolean retainAll(Collection c)

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.

Overrides:

retainAll in class AbstractCollection

Parameters:

c - collection containing elements to be retained in this set

Returns:

true if this set changed as a result of the call

size

public int size()

Returns the number of elements in this set.

Overrides:

size in class AbstractCollection

Returns:

the number of elements in this set

toArray

public Object[] 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.

Overrides:

toArray in class AbstractCollection

Returns:

an array containing all the elements in this set

toArray

public Object[] toArray(Object[] 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 {@link #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 of String:

     String[] y = x.toArray(new String[0]);

Note that toArray(new Object[0]) is identical in function to toArray().

Overrides:

toArray in class AbstractCollection

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