|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectjava.util.AbstractCollection
java.util.AbstractSet
java.util.concurrent.CopyOnWriteArraySet
A Set that uses CopyOnWriteArrayList for all of its
operations. Thus, it shares the same basic properties:
Sample Usage. Probably the main application of copy-on-write sets are classes that maintain sets of Handler objects that must be multicasted to upon an update command. This is a classic case where you do not want to be holding a lock while sending a message, and where traversals normally vastly overwhelm additions.
class Handler { void handle(); ... }
class X {
private final CopyOnWriteArraySet handlers = new CopyOnWriteArraySet();
public void addHandler(Handler h) { handlers.add(h); }
private long internalState;
private synchronized void changeState() { internalState = ...; }
public void update() {
changeState();
Iterator it = handlers.iterator();
while (it.hasNext())
((Handler)(it.next()).handle();
}
}
CopyOnWriteArrayList,
Serialized Form| Constructor Summary | |
CopyOnWriteArraySet()
Constructs an empty set. |
|
CopyOnWriteArraySet(Collection<T> c)
Constructs a set containing all of the elements of the specified Collection. |
|
| Method Summary | ||
boolean |
add(E o)
Ensures that this collection contains the specified element (optional operation). |
|
boolean |
addAll(Collection<? extends E> c)
Adds all of the elements in the specified collection to this collection (optional operation). |
|
void |
clear()
Removes all of the elements from this collection (optional operation). |
|
boolean |
contains(java.lang.Object o)
Returns true if this collection contains the specified element. |
|
boolean |
containsAll(Collection<?> c)
Returns true if this collection contains all of the elements in the specified collection. |
|
boolean |
isEmpty()
Returns true if this collection contains no elements. |
|
abstract Iterator<E> |
iterator()
Returns an iterator over the elements contained in this collection. |
|
boolean |
remove(java.lang.Object o)
Removes a single instance of the specified element from this collection, if it is present (optional operation). |
|
boolean |
removeAll(Collection<?> c)
Removes from this set all of its elements that are contained in the specified collection (optional operation). |
|
boolean |
retainAll(Collection<?> c)
Retains only the elements in this collection that are contained in the specified collection (optional operation). |
|
abstract int |
size()
Returns the number of elements in this collection. |
|
java.lang.Object[] |
toArray()
Returns an array containing all of the elements in this collection. |
|
|
toArray(T[] a)
Returns an array containing all of the elements in this collection; the runtime type of the returned array is that of the specified array. |
|
| Methods inherited from class java.util.AbstractSet |
equals, hashCode |
| Methods inherited from class java.util.AbstractCollection |
toString |
| Methods inherited from class java.lang.Object |
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
public CopyOnWriteArraySet()
public CopyOnWriteArraySet(Collection<T> c)
c - the collection| Method Detail |
public int size()
AbstractCollection
size in interface Setsize in class AbstractCollectionpublic boolean isEmpty()
AbstractCollectionThis implementation returns size() == 0.
isEmpty in interface SetisEmpty in class AbstractCollectionpublic boolean contains(java.lang.Object o)
AbstractCollectionThis implementation iterates over the elements in the collection, checking each element in turn for equality with the specified element.
contains in interface Setcontains in class AbstractCollectiono - object to be checked for containment in this collection.
public java.lang.Object[] toArray()
AbstractCollectionThis implementation allocates the array to be returned, and iterates over the elements in the collection, storing each object reference in the next consecutive element of the array, starting with element 0.
toArray in interface SettoArray in class AbstractCollectionpublic <T> T[] toArray(T[] a)
AbstractCollectionIf the collection fits in the specified array with room to spare (i.e., the array has more elements than the collection), the element in the array immediately following the end of the collection is set to null. This is useful in determining the length of the collection only if the caller knows that the collection does not contain any null elements.)
If this collection makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order.
This implementation checks if the array is large enough to contain the collection; if not, it allocates a new array of the correct size and type (using reflection). Then, it iterates over the collection, storing each object reference in the next consecutive element of the array, starting with element 0. If the array is larger than the collection, a null is stored in the first location after the end of the collection.
toArray in interface SettoArray in class AbstractCollectiona - the array into which the elements of the collection are to
be stored, if it is big enough; otherwise, a new array of the
same runtime type is allocated for this purpose.
public void clear()
AbstractCollectionThis implementation iterates over this collection, removing each element using the Iterator.remove operation. Most implementations will probably choose to override this method for efficiency.
Note that this implementation will throw an UnsupportedOperationException if the iterator returned by this collection's iterator method does not implement the remove method and this collection is non-empty.
clear in interface Setclear in class AbstractCollectionpublic Iterator<E> iterator()
AbstractCollection
iterator in interface Setiterator in class AbstractCollectionpublic boolean remove(java.lang.Object o)
AbstractCollectionThis implementation iterates over the collection looking for the specified element. If it finds the element, it removes the element from the collection using the iterator's remove method.
Note that this implementation throws an UnsupportedOperationException if the iterator returned by this collection's iterator method does not implement the remove method and this collection contains the specified object.
remove in interface Setremove in class AbstractCollectiono - element to be removed from this collection, if present.
public boolean add(E o)
AbstractCollectionThis implementation always throws an UnsupportedOperationException.
add in interface Setadd in class AbstractCollectiono - element whose presence in this collection is to be ensured.
public boolean containsAll(Collection<?> c)
AbstractCollectionThis implementation iterates over the specified collection, checking each element returned by the iterator in turn to see if it's contained in this collection. If all elements are so contained true is returned, otherwise false.
containsAll in interface SetcontainsAll in class AbstractCollectionc - collection to be checked for containment in this collection.
AbstractCollection.contains(Object)public boolean addAll(Collection<? extends E> c)
AbstractCollectionThis implementation iterates over the specified collection, and adds each object returned by the iterator to this collection, in turn.
Note that this implementation will throw an UnsupportedOperationException unless add is overridden (assuming the specified collection is non-empty).
addAll in interface SetaddAll in class AbstractCollectionc - collection whose elements are to be added to this collection.
AbstractCollection.add(Object)public boolean removeAll(Collection<?> c)
AbstractSetThis implementation determines which is the smaller of this set and the specified collection, by invoking the size method on each. If this set has fewer elements, then the implementation iterates over this set, checking each element returned by the iterator in turn to see if it is contained in the specified collection. If it is so contained, it is removed from this set with the iterator's remove method. If the specified collection has fewer elements, then the implementation iterates over the specified collection, removing from this set each element returned by the iterator, using this set's remove method.
Note that this implementation will throw an UnsupportedOperationException if the iterator returned by the iterator method does not implement the remove method.
removeAll in interface SetremoveAll in class AbstractSetc - elements to be removed from this set.
AbstractCollection.remove(Object),
AbstractCollection.contains(Object)public boolean retainAll(Collection<?> c)
AbstractCollectionThis implementation iterates over this collection, checking each element returned by the iterator in turn to see if it's contained in the specified collection. If it's not so contained, it's removed from this collection with the iterator's remove method.
Note that this implementation will throw an UnsupportedOperationException if the iterator returned by the iterator method does not implement the remove method and this collection contains one or more elements not present in the specified collection.
retainAll in interface SetretainAll in class AbstractCollectionc - elements to be retained in this collection.
AbstractCollection.remove(Object),
AbstractCollection.contains(Object)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||