jdk.util.concurrent.ConcurrentSkipListSet

Liking cljdoc? Tell your friends :D

Clojure only.

A scalable concurrent NavigableSet implementation based on a ConcurrentSkipListMap. The elements of the set are kept sorted according to their java.lang.natural ordering, 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 and spliterators are weakly consistent.

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, and so may report inaccurate results if this collection is modified during traversal. Additionally, the bulk operations addAll, removeAll, retainAll, containsAll, equals, and toArray 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.

A scalable concurrent NavigableSet implementation based on
a ConcurrentSkipListMap.  The elements of the set are kept
sorted according to their java.lang.natural ordering,
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 and spliterators are
weakly consistent.

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, and so may report
inaccurate results if this collection is modified during traversal.
Additionally, the bulk operations addAll,
removeAll, retainAll, containsAll,
equals, and toArray 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.

jdk.util.concurrent.ConcurrentSkipListSet

->concurrent-skip-list-setclj

addclj

ceilingclj

clearclj

cloneclj

comparatorclj

containsclj

descending-iteratorclj

descending-setclj

empty?clj

equalsclj

firstclj

floorclj

head-setclj

higherclj

iteratorclj

lastclj

lowerclj

poll-firstclj

poll-lastclj

removeclj

remove-allclj

sizeclj

spliteratorclj

sub-setclj

tail-setclj

->concurrent-skip-list-set^clj

add^clj

ceiling^clj

clear^clj

clone^clj

comparator^clj

contains^clj

descending-iterator^clj

descending-set^clj

empty?^clj

equals^clj

first^clj

floor^clj

head-set^clj

higher^clj

iterator^clj

last^clj

lower^clj

poll-first^clj

poll-last^clj

remove^clj

remove-all^clj

size^clj

spliterator^clj

sub-set^clj

tail-set^clj