| java.util.concurrent.ConcurrentSkipListSet
| ConcurrentSkipListSet | | public class ConcurrentSkipListSet extends AbstractSet implements NavigableSet<E>,Cloneable,java.io.Serializable(Code) | | A scalable concurrent
NavigableSet implementation based on
a
ConcurrentSkipListMap . The elements of the set are kept
sorted according to their
,
or by a
Comparator provided at set creation time, depending
on which constructor is used.
This implementation provides expected average log(n) time
cost for the contains, add, and remove
operations and their variants. Insertion, removal, and access
operations safely execute concurrently by multiple threads.
Iterators are weakly consistent, returning elements
reflecting the state of the set at some point at or since the
creation of the iterator. They do not throw
ConcurrentModificationException , and may proceed concurrently with
other operations. Ascending ordered views and their iterators are
faster than descending ones.
Beware that, unlike in most collections, the size
method is not a constant-time operation. Because of the
asynchronous nature of these sets, determining the current number
of elements requires a traversal of the elements. Additionally, the
bulk operations addAll, removeAll,
retainAll, and containsAll are not
guaranteed to be performed atomically. For example, an iterator
operating concurrently with an addAll operation might view
only some of the added elements.
This class and its iterators implement all of the
optional methods of the
Set and
Iterator interfaces. Like most other concurrent collection implementations,
this class does not permit the use of null elements,
because null arguments and return values cannot be reliably
distinguished from the absence of elements.
This class is a member of the
Java Collections Framework.
author:
Doug Lea<
Parameters:
E - > the type of elements maintained by this set
since:
1.6 |
| ConcurrentSkipListSet | | public ConcurrentSkipListSet()(Code) | | Constructs a new, empty set that orders its elements according to
their
.
|
| ConcurrentSkipListSet | | public ConcurrentSkipListSet(Comparator<? super E> comparator)(Code) | | Constructs a new, empty set that orders its elements according to
the specified comparator.
Parameters:
comparator - the comparator that will be used to order this set.If null, the of the elements will be used. |
| ConcurrentSkipListSet | | public ConcurrentSkipListSet(Collection<? extends E> c)(Code) | | Constructs a new set containing the elements in the specified
collection, that orders its elements according to their
.
Parameters:
c - The elements that will comprise the new set
throws:
ClassCastException - if the elements in c arenot Comparable, or are not mutually comparable
throws:
NullPointerException - if the specified collection or anyof its elements are null |
| ConcurrentSkipListSet | | public ConcurrentSkipListSet(SortedSet<E> s)(Code) | | Constructs a new set containing the same elements and using the
same ordering as the specified sorted set.
Parameters:
s - sorted set whose elements will comprise the new set
throws:
NullPointerException - if the specified sorted set or anyof its elements are null |
| add | | public boolean add(E e)(Code) | | 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.equals(e2).
If this set already contains the element, the call leaves the set
unchanged and returns false.
Parameters:
e - element to be added to this set true if this set did not already contain thespecified element
throws:
ClassCastException - if e cannot be comparedwith the elements currently in this set
throws:
NullPointerException - if the specified element is null |
| clear | | public void clear()(Code) | | Removes all of the elements from this set.
|
| clone | | public ConcurrentSkipListSet<E> clone()(Code) | | Returns a shallow copy of this ConcurrentSkipListSet
instance. (The elements themselves are not cloned.)
a shallow copy of this set |
| contains | | public boolean contains(Object o)(Code) | | 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.equals(e).
Parameters:
o - object to be checked for containment in this set true if this set contains the specified element
throws:
ClassCastException - if the specified element cannot becompared with the elements currently in this set
throws:
NullPointerException - if the specified element is null |
| descendingIterator | | public Iterator<E> descendingIterator()(Code) | | Returns an iterator over the elements in this set in descending order.
an iterator over the elements in this set in descending order |
| descendingSet | | public NavigableSet<E> descendingSet()(Code) | | Returns a reverse order view of the elements contained in this set.
The descending set is backed by this set, so changes to the set are
reflected in the descending set, and vice-versa.
The returned set has an ordering equivalent to
Collections.reverseOrder(Comparator) Collections.reverseOrder (comparator()).
The expression
s.descendingSet().descendingSet() returns a
view of
s essentially equivalent to
s .
a reverse order view of this set |
| equals | | public boolean equals(Object o)(Code) | | Compares the specified object with this set for equality. Returns
true if the specified object is also a set, the two sets
have the same size, and every member of the specified set is
contained in this set (or equivalently, every member of this set is
contained in the specified set). This definition ensures that the
equals method works properly across different implementations of the
set interface.
Parameters:
o - the object to be compared for equality with this set true if the specified object is equal to this set |
| isEmpty | | public boolean isEmpty()(Code) | | Returns true if this set contains no elements.
true if this set contains no elements |
| iterator | | public Iterator<E> iterator()(Code) | | Returns an iterator over the elements in this set in ascending order.
an iterator over the elements in this set in ascending order |
| pollFirst | | public E pollFirst()(Code) | | |
| pollLast | | public E pollLast()(Code) | | |
| remove | | public boolean remove(Object o)(Code) | | Removes the specified element from this set if it is present.
More formally, removes an element e such that
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.)
Parameters:
o - object to be removed from this set, if present true if this set contained the specified element
throws:
ClassCastException - if o cannot be comparedwith the elements currently in this set
throws:
NullPointerException - if the specified element is null |
| removeAll | | public boolean removeAll(Collection c)(Code) | | 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.
Parameters:
c - collection containing elements to be removed from this set true if this set changed as a result of the call
throws:
ClassCastException - if the types of one or more elements in thisset are incompatible with the specified collection
throws:
NullPointerException - if the specified collection or anyof its elements are null |
| size | | public int size()(Code) | | Returns the number of elements in this set. If this set
contains more than Integer.MAX_VALUE elements, it
returns Integer.MAX_VALUE.
Beware that, unlike in most collections, this method is
NOT a constant-time operation. Because of the
asynchronous nature of these sets, determining the current
number of elements requires traversing them all to count them.
Additionally, it is possible for the size to change during
execution of this method, in which case the returned result
will be inaccurate. Thus, this method is typically not very
useful in concurrent applications.
the number of elements in this set |
|
|