public class BTreeSet<V>
extends java.lang.Object
implements java.util.NavigableSet<V>
Modifier and Type | Class and Description |
---|---|
static class |
BTreeSet.BTreeDescRange<V> |
static class |
BTreeSet.BTreeRange<V> |
Modifier and Type | Field and Description |
---|---|
protected java.util.Comparator<V> |
comparator |
protected java.lang.Object[] |
tree |
Constructor and Description |
---|
BTreeSet(java.lang.Object[] tree,
java.util.Comparator<V> comparator) |
Modifier and Type | Method and Description |
---|---|
boolean |
add(V v) |
boolean |
addAll(java.util.Collection<? extends V> c) |
V |
ceiling(V v) |
void |
clear() |
java.util.Comparator<? super V> |
comparator() |
boolean |
contains(java.lang.Object o) |
boolean |
containsAll(java.util.Collection<?> c) |
java.util.Iterator<V> |
descendingIterator() |
java.util.NavigableSet<V> |
descendingSet() |
V |
first() |
V |
floor(V v) |
java.util.SortedSet<V> |
headSet(V toElement) |
java.util.NavigableSet<V> |
headSet(V toElement,
boolean inclusive) |
V |
higher(V v) |
boolean |
isEmpty() |
java.util.Iterator<V> |
iterator() |
V |
last() |
V |
lower(V v) |
V |
pollFirst() |
V |
pollLast() |
boolean |
remove(java.lang.Object o) |
boolean |
removeAll(java.util.Collection<?> c) |
boolean |
retainAll(java.util.Collection<?> c) |
int |
size() |
protected Cursor<V,V> |
slice(boolean forwards,
boolean permitInversion) |
java.util.NavigableSet<V> |
subSet(V fromElement,
boolean fromInclusive,
V toElement,
boolean toInclusive) |
java.util.SortedSet<V> |
subSet(V fromElement,
V toElement) |
java.util.SortedSet<V> |
tailSet(V fromElement) |
java.util.NavigableSet<V> |
tailSet(V fromElement,
boolean inclusive) |
java.lang.Object[] |
toArray() |
<T> T[] |
toArray(T[] a) |
BTreeSet<V> |
update(java.util.Collection<V> updateWith,
boolean isSorted) |
protected final java.util.Comparator<V> comparator
protected final java.lang.Object[] tree
public BTreeSet(java.lang.Object[] tree, java.util.Comparator<V> comparator)
public java.util.Comparator<? super V> comparator()
comparator
in interface java.util.SortedSet<V>
public int size()
public boolean isEmpty()
public java.util.Iterator<V> iterator()
public java.util.Iterator<V> descendingIterator()
descendingIterator
in interface java.util.NavigableSet<V>
public java.lang.Object[] toArray()
public <T> T[] toArray(T[] a)
public java.util.NavigableSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive)
subSet
in interface java.util.NavigableSet<V>
public java.util.NavigableSet<V> headSet(V toElement, boolean inclusive)
headSet
in interface java.util.NavigableSet<V>
public java.util.NavigableSet<V> tailSet(V fromElement, boolean inclusive)
tailSet
in interface java.util.NavigableSet<V>
public boolean addAll(java.util.Collection<? extends V> c)
public boolean retainAll(java.util.Collection<?> c)
public boolean removeAll(java.util.Collection<?> c)
public void clear()
public boolean add(V v)
public boolean remove(java.lang.Object o)
public boolean contains(java.lang.Object o)
public boolean containsAll(java.util.Collection<?> c)
Copyright © 2015 The Apache Software Foundation