public static class BTreeSet.BTreeRange<V> extends BTreeSet<V>
BTreeSet.BTreeDescRange<V>, BTreeSet.BTreeRange<V>, BTreeSet.Builder<V>
Modifier and Type | Field and Description |
---|---|
protected int |
lowerBound |
protected int |
upperBound |
comparator, tree
Modifier and Type | Method and Description |
---|---|
V |
ceiling(V v) |
BTreeSet<V> |
descendingSet() |
V |
floor(V v) |
V |
get(int index)
The converse of indexOf: provided an index between 0 and size, returns the i'th item, in set order.
|
BTreeSet<V> |
headSet(V toElement,
boolean inclusive) |
V |
higher(V v) |
int |
indexOf(java.lang.Object item)
The index of the item within the list, or its insertion point otherwise.
|
boolean |
isEmpty() |
V |
lower(V v) |
int |
size() |
protected BTreeSearchIterator<V,V> |
slice(BTree.Dir dir) |
BTreeSet<V> |
subList(int fromIndex,
int toIndex) |
BTreeSet<V> |
subSet(V fromElement,
boolean fromInclusive,
V toElement,
boolean toInclusive) |
BTreeSet<V> |
tailSet(V fromElement,
boolean inclusive) |
<T> T[] |
toArray(T[] a) |
<T> T[] |
toArray(T[] a,
int offset) |
add, add, addAll, addAll, builder, clear, comparator, contains, containsAll, descendingIterator, empty, first, hashCode, headSet, iterator, last, lastIndexOf, listIterator, listIterator, of, of, of, pollFirst, pollLast, remove, remove, removeAll, retainAll, set, spliterator, subSet, tailSet, toArray, tree, update, wrap
public boolean isEmpty()
public int size()
public V get(int index)
BTreeSet
public int indexOf(java.lang.Object item)
BTreeSet
public BTreeSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive)
public BTreeSet<V> descendingSet()
descendingSet
in interface java.util.NavigableSet<V>
descendingSet
in class BTreeSet<V>
public <T> T[] toArray(T[] a)
Copyright © 2016 The Apache Software Foundation