Package org.apache.cassandra.utils.btree
Class BTreeSet.BTreeRange<V>
- java.lang.Object
-
- org.apache.cassandra.utils.btree.BTreeSet<V>
-
- org.apache.cassandra.utils.btree.BTreeSet.BTreeRange<V>
-
- All Implemented Interfaces:
java.lang.Iterable<V>
,java.util.Collection<V>
,java.util.List<V>
,java.util.NavigableSet<V>
,java.util.Set<V>
,java.util.SortedSet<V>
- Direct Known Subclasses:
BTreeSet.BTreeDescRange
public static class BTreeSet.BTreeRange<V> extends BTreeSet<V>
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class org.apache.cassandra.utils.btree.BTreeSet
BTreeSet.BTreeDescRange<V>, BTreeSet.BTreeRange<V>, BTreeSet.Builder<V>
-
-
Field Summary
Fields Modifier and Type Field Description protected int
lowerBound
protected int
upperBound
-
Fields inherited from class org.apache.cassandra.utils.btree.BTreeSet
comparator, tree
-
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method 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)
-
Methods inherited from class org.apache.cassandra.utils.btree.BTreeSet
add, add, addAll, addAll, builder, builder, clear, comparator, contains, containsAll, copy, copy, 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, wrap
-
-
-
-
Method Detail
-
slice
protected BTreeSearchIterator<V,V> slice(BTree.Dir dir)
-
isEmpty
public boolean isEmpty()
-
size
public int size()
-
get
public V get(int index)
Description copied from class:BTreeSet
The converse of indexOf: provided an index between 0 and size, returns the i'th item, in set order.
-
indexOf
public int indexOf(java.lang.Object item)
Description copied from class:BTreeSet
The index of the item within the list, or its insertion point otherwise. i.e. binarySearch semantics
-
subSet
public BTreeSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive)
-
descendingSet
public BTreeSet<V> descendingSet()
- Specified by:
descendingSet
in interfacejava.util.NavigableSet<V>
- Overrides:
descendingSet
in classBTreeSet<V>
-
toArray
public <T> T[] toArray(T[] a)
-
-