java.util.AbstractCollection<E>
java.util.AbstractSet<E>
net.sf.beanlib.util.concurrent.ConcurrentSkipListMap.KeySet<E>
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Object
static final class ConcurrentSkipListMap.KeySet<E>
| Field Summary | |
|---|---|
private ConcurrentNavigableMap<E,Object> |
m
|
| Constructor Summary | |
|---|---|
ConcurrentSkipListMap.KeySet(ConcurrentNavigableMap<E,Object> map)
|
|
| Method Summary | ||
|---|---|---|
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()
|
|
Comparator<? super E> |
comparator()
|
|
boolean |
contains(Object o)
|
|
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)
|
|
E |
first()
|
|
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)
|
|
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()
|
|
Iterator<E> |
iterator()
Returns an iterator over the elements in this set, in ascending order. |
|
E |
last()
|
|
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)
|
|
int |
size()
|
|
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)
|
|
NavigableSet<E> |
tailSet(E 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. |
|
Object[] |
toArray()
|
|
|
toArray(T[] a)
|
|
| Methods inherited from class java.util.AbstractSet |
|---|
hashCode, removeAll |
| Methods inherited from class java.util.AbstractCollection |
|---|
add, addAll, containsAll, retainAll, toString |
| Methods inherited from class java.lang.Object |
|---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface java.util.Set |
|---|
add, addAll, containsAll, hashCode, removeAll, retainAll |
| Field Detail |
|---|
private final ConcurrentNavigableMap<E,Object> m
| Constructor Detail |
|---|
ConcurrentSkipListMap.KeySet(ConcurrentNavigableMap<E,Object> map)
| Method Detail |
|---|
public int size()
size in interface Collection<E>size in interface Set<E>size in class AbstractCollection<E>public boolean isEmpty()
isEmpty in interface Collection<E>isEmpty in interface Set<E>isEmpty in class AbstractCollection<E>public boolean contains(Object o)
contains in interface Collection<E>contains in interface Set<E>contains in class AbstractCollection<E>public boolean remove(Object o)
remove in interface Collection<E>remove in interface Set<E>remove in class AbstractCollection<E>public void clear()
clear in interface Collection<E>clear in interface Set<E>clear in class AbstractCollection<E>public E lower(E e)
NavigableSetnull if there is no such element.
lower in interface NavigableSet<E>e - the value to match
e,
or null if there is no such elementpublic E floor(E e)
NavigableSetnull if there is no such element.
floor in interface NavigableSet<E>e - the value to match
e,
or null if there is no such elementpublic E ceiling(E e)
NavigableSetnull if there is no such element.
ceiling in interface NavigableSet<E>e - the value to match
e,
or null if there is no such elementpublic E higher(E e)
NavigableSetnull if there is no such element.
higher in interface NavigableSet<E>e - the value to match
e,
or null if there is no such elementpublic Comparator<? super E> comparator()
comparator in interface SortedSet<E>public E first()
first in interface SortedSet<E>public E last()
last in interface SortedSet<E>public E pollFirst()
NavigableSetnull if this set is empty.
pollFirst in interface NavigableSet<E>null if this set is emptypublic E pollLast()
NavigableSetnull if this set is empty.
pollLast in interface NavigableSet<E>null if this set is emptypublic Iterator<E> iterator()
NavigableSet
iterator in interface Iterable<E>iterator in interface Collection<E>iterator in interface Set<E>iterator in interface NavigableSet<E>iterator in class AbstractCollection<E>public boolean equals(Object o)
equals in interface Collection<E>equals in interface Set<E>equals in class AbstractSet<E>public Object[] toArray()
toArray in interface Collection<E>toArray in interface Set<E>toArray in class AbstractCollection<E>public <T> T[] toArray(T[] a)
toArray in interface Collection<E>toArray in interface Set<E>toArray in class AbstractCollection<E>public Iterator<E> descendingIterator()
NavigableSetdescendingSet().iterator().
descendingIterator in interface NavigableSet<E>
public NavigableSet<E> subSet(E fromElement,
boolean fromInclusive,
E toElement,
boolean toInclusive)
NavigableSetfromElement to toElement. If fromElement and
toElement are equal, the returned set is empty unless fromExclusive and toExclusive are both true. The returned set
is backed by this set, so changes in the returned set are reflected in
this set, and vice-versa. The returned set supports all optional set
operations that this set supports.
The returned set will throw an IllegalArgumentException
on an attempt to insert an element outside its range.
subSet in interface NavigableSet<E>fromElement - low endpoint of the returned setfromInclusive - true if the low endpoint
is to be included in the returned viewtoElement - high endpoint of the returned settoInclusive - true if the high endpoint
is to be included in the returned view
fromElement, inclusive, to toElement, exclusive
public NavigableSet<E> headSet(E toElement,
boolean inclusive)
NavigableSetinclusive is true) toElement. The
returned set is backed by this set, so changes in the returned set are
reflected in this set, and vice-versa. The returned set supports all
optional set operations that this set supports.
The returned set will throw an IllegalArgumentException
on an attempt to insert an element outside its range.
headSet in interface NavigableSet<E>toElement - high endpoint of the returned setinclusive - true if the high endpoint
is to be included in the returned view
inclusive is true) toElement
public NavigableSet<E> tailSet(E fromElement,
boolean inclusive)
NavigableSetinclusive is true) fromElement.
The returned set is backed by this set, so changes in the returned set
are reflected in this set, and vice-versa. The returned set supports
all optional set operations that this set supports.
The returned set will throw an IllegalArgumentException
on an attempt to insert an element outside its range.
tailSet in interface NavigableSet<E>fromElement - low endpoint of the returned setinclusive - true if the low endpoint
is to be included in the returned view
fromElement
public NavigableSet<E> subSet(E fromElement,
E toElement)
NavigableSetEquivalent to subSet(fromElement, true, toElement, false).
subSet in interface SortedSet<E>subSet in interface NavigableSet<E>public NavigableSet<E> headSet(E toElement)
NavigableSetEquivalent to headSet(toElement, false).
headSet in interface SortedSet<E>headSet in interface NavigableSet<E>public NavigableSet<E> tailSet(E fromElement)
NavigableSetEquivalent to tailSet(fromElement, true).
tailSet in interface SortedSet<E>tailSet in interface NavigableSet<E>public NavigableSet<E> descendingSet()
NavigableSetremove operation), the results of
the iteration are undefined.
The returned set has an ordering equivalent to
Collections.reverseOrder(comparator()).
The expression s.descendingSet().descendingSet() returns a
view of s essentially equivalent to s.
descendingSet in interface NavigableSet<E>
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||