public static class BTreeSet.BTreeDescRange<V> extends BTreeSet.BTreeRange<V>
BTreeSet.BTreeDescRange<V>, BTreeSet.BTreeRange<V>, BTreeSet.Builder<V>
lowerBound, upperBound
comparator, tree
Modifier and Type | Method and Description |
---|---|
V |
ceiling(V v) |
java.util.Comparator<V> |
comparator() |
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.
|
V |
lower(V v) |
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,
int offset) |
isEmpty, size, toArray
add, add, addAll, addAll, builder, clear, 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
protected BTreeSearchIterator<V,V> slice(BTree.Dir dir)
slice
in class BTreeSet.BTreeRange<V>
public V higher(V v)
higher
in interface java.util.NavigableSet<V>
higher
in class BTreeSet.BTreeRange<V>
public V ceiling(V v)
ceiling
in interface java.util.NavigableSet<V>
ceiling
in class BTreeSet.BTreeRange<V>
public V floor(V v)
floor
in interface java.util.NavigableSet<V>
floor
in class BTreeSet.BTreeRange<V>
public V lower(V v)
lower
in interface java.util.NavigableSet<V>
lower
in class BTreeSet.BTreeRange<V>
public V get(int index)
BTreeSet
get
in interface java.util.List<V>
get
in class BTreeSet.BTreeRange<V>
public int indexOf(java.lang.Object item)
BTreeSet
indexOf
in interface java.util.List<V>
indexOf
in class BTreeSet.BTreeRange<V>
public BTreeSet<V> subList(int fromIndex, int toIndex)
subList
in interface java.util.List<V>
subList
in class BTreeSet.BTreeRange<V>
public BTreeSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive)
subSet
in interface java.util.NavigableSet<V>
subSet
in class BTreeSet.BTreeRange<V>
public BTreeSet<V> headSet(V toElement, boolean inclusive)
headSet
in interface java.util.NavigableSet<V>
headSet
in class BTreeSet.BTreeRange<V>
public BTreeSet<V> tailSet(V fromElement, boolean inclusive)
tailSet
in interface java.util.NavigableSet<V>
tailSet
in class BTreeSet.BTreeRange<V>
public BTreeSet<V> descendingSet()
descendingSet
in interface java.util.NavigableSet<V>
descendingSet
in class BTreeSet.BTreeRange<V>
public java.util.Comparator<V> comparator()
comparator
in interface java.util.SortedSet<V>
comparator
in class BTreeSet<V>
public <T> T[] toArray(T[] a, int offset)
toArray
in class BTreeSet.BTreeRange<V>
Copyright © 2009-2021 The Apache Software Foundation