public static final class BTreeMap.KeySet<E> extends AbstractSet<E> implements NavigableSet<E>, Closeable, Serializable
| Modifier and Type | Field and Description |
|---|---|
protected ConcurrentNavigableMap<E,Object> |
m |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(E k) |
E |
ceiling(E e) |
void |
clear() |
void |
close() |
Comparator<? super E> |
comparator() |
boolean |
contains(Object o) |
Iterator<E> |
descendingIterator() |
NavigableSet<E> |
descendingSet() |
boolean |
equals(Object o) |
E |
first() |
E |
floor(E e) |
NavigableSet<E> |
headSet(E toElement) |
NavigableSet<E> |
headSet(E toElement,
boolean inclusive) |
E |
higher(E e) |
boolean |
isEmpty() |
Iterator<E> |
iterator() |
E |
last() |
E |
lower(E e) |
E |
pollFirst() |
E |
pollLast() |
boolean |
remove(Object o) |
int |
size() |
long |
sizeLong() |
NavigableSet<E> |
subSet(E fromElement,
boolean fromInclusive,
E toElement,
boolean toInclusive) |
NavigableSet<E> |
subSet(E fromElement,
E toElement) |
NavigableSet<E> |
tailSet(E fromElement) |
NavigableSet<E> |
tailSet(E fromElement,
boolean inclusive) |
Object[] |
toArray() |
<T> T[] |
toArray(T[] a) |
hashCode, removeAlladdAll, containsAll, retainAll, toStringprotected final ConcurrentNavigableMap<E,Object> m
public int size()
size in interface Collection<E>size in interface Set<E>size in class AbstractCollection<E>public long sizeLong()
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)
lower in interface NavigableSet<E>public E floor(E e)
floor in interface NavigableSet<E>public E ceiling(E e)
ceiling in interface NavigableSet<E>public E higher(E e)
higher in interface NavigableSet<E>public Comparator<? super E> comparator()
comparator in interface SortedSet<E>public E pollFirst()
pollFirst in interface NavigableSet<E>public E pollLast()
pollLast in interface NavigableSet<E>public Iterator<E> iterator()
iterator in interface Iterable<E>iterator in interface Collection<E>iterator in interface NavigableSet<E>iterator in interface Set<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()
descendingIterator in interface NavigableSet<E>public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive)
subSet in interface NavigableSet<E>public NavigableSet<E> headSet(E toElement, boolean inclusive)
headSet in interface NavigableSet<E>public NavigableSet<E> tailSet(E fromElement, boolean inclusive)
tailSet in interface NavigableSet<E>public NavigableSet<E> subSet(E fromElement, E toElement)
public NavigableSet<E> headSet(E toElement)
public NavigableSet<E> tailSet(E fromElement)
public NavigableSet<E> descendingSet()
descendingSet in interface NavigableSet<E>public boolean add(E k)
add in interface Collection<E>add in interface Set<E>add in class AbstractCollection<E>public void close()
close in interface Closeableclose in interface AutoCloseableCopyright © 2015. All Rights Reserved.