A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/ConcurrentSkipListSet.html below:

ConcurrentSkipListSet (Java Platform SE 7 )

Modifier and Type Method and Description boolean add(E e)

Adds the specified element to this set if it is not already present.

E ceiling(E e)

Returns the least element in this set greater than or equal to the given element, or null if there is no such element.

void clear()

Removes all of the elements from this set.

ConcurrentSkipListSet<E> clone()

Returns a shallow copy of this ConcurrentSkipListSet instance.

Comparator<? super E> comparator()

Returns the comparator used to order the elements in this set, or

null

if this set uses the

natural ordering

of its elements.

boolean contains(Object o)

Returns true if this set contains the specified element.

Iterator<E> descendingIterator()

Returns an iterator over the elements in this set in descending order.

NavigableSet<E> descendingSet()

Returns a reverse order view of the elements contained in this set.

boolean equals(Object o)

Compares the specified object with this set for equality.

E first()

Returns the first (lowest) element currently in this set.

E floor(E e)

Returns the greatest element in this set less than or equal to the given element, or null if there is no such element.

NavigableSet<E> headSet(E toElement)

Returns a view of the portion of this set whose elements are strictly less than toElement.

NavigableSet<E> headSet(E toElement, boolean inclusive)

Returns a view of the portion of this set whose elements are less than (or equal to, if inclusive is true) toElement.

E higher(E e)

Returns the least element in this set strictly greater than the given element, or null if there is no such element.

boolean isEmpty()

Returns true if this set contains no elements.

Iterator<E> iterator()

Returns an iterator over the elements in this set in ascending order.

E last()

Returns the last (highest) element currently in this set.

E lower(E e)

Returns the greatest element in this set strictly less than the given element, or null if there is no such element.

E pollFirst()

Retrieves and removes the first (lowest) element, or returns null if this set is empty.

E pollLast()

Retrieves and removes the last (highest) element, or returns null if this set is empty.

boolean remove(Object o)

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.

int size()

Returns the number of elements in this set.

NavigableSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive)

Returns a view of the portion of this set whose elements range from fromElement to toElement.

NavigableSet<E> subSet(E fromElement, E toElement)

Returns a view of the portion of this set whose elements range from fromElement, inclusive, to toElement, exclusive.

NavigableSet<E> tailSet(E fromElement)

Returns a view of the portion of this set whose elements are greater than or equal to fromElement.

NavigableSet<E> tailSet(E fromElement, boolean inclusive)

Returns a view of the portion of this set whose elements are greater than (or equal to, if inclusive is true) fromElement.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4