public static class BTreeMapJava.KeySet<E>
Modifier and Type | Field and Description |
---|---|
BTreeMapJava.ConcurrentNavigableMap2<E,java.lang.Object> |
m |
Modifier and Type | Method and Description |
---|---|
boolean |
add() |
E |
ceiling() |
void |
clear() |
void |
close() |
java.util.Comparator<? super E> |
comparator() |
boolean |
contains() |
java.util.Iterator<E> |
descendingIterator() |
java.util.NavigableSet<E> |
descendingSet() |
boolean |
equals() |
E |
first() |
E |
floor() |
java.util.NavigableSet<E> |
headSet() |
java.util.NavigableSet<E> |
headSet() |
E |
higher() |
boolean |
isEmpty() |
java.util.Iterator<E> |
iterator() |
E |
last() |
E |
lower() |
E |
pollFirst() |
E |
pollLast() |
boolean |
remove() |
int |
size() |
long |
sizeLong() |
java.util.NavigableSet<E> |
subSet() |
java.util.NavigableSet<E> |
subSet() |
java.util.NavigableSet<E> |
tailSet() |
java.util.NavigableSet<E> |
tailSet() |
java.lang.Object[] |
toArray() |
<T> T[] |
toArray() |
public BTreeMapJava.ConcurrentNavigableMap2<E,java.lang.Object> m
public int size()
public long sizeLong()
public boolean isEmpty()
public boolean contains()
public boolean remove()
public void clear()
public E lower()
public E floor()
public E ceiling()
public E higher()
public java.util.Comparator<? super E> comparator()
public E first()
public E last()
public E pollFirst()
public E pollLast()
public java.util.Iterator<E> iterator()
public boolean equals()
public java.lang.Object[] toArray()
public <T> T[] toArray()
public java.util.Iterator<E> descendingIterator()
public java.util.NavigableSet<E> subSet()
public java.util.NavigableSet<E> headSet()
public java.util.NavigableSet<E> tailSet()
public java.util.NavigableSet<E> subSet()
public java.util.NavigableSet<E> headSet()
public java.util.NavigableSet<E> tailSet()
public java.util.NavigableSet<E> descendingSet()
public boolean add()
public void close()