public class BTreeSet<V>
extends java.lang.Object
implements java.util.NavigableSet<V>, java.util.List<V>
| Modifier and Type | Class and Description | 
|---|---|
| static class  | BTreeSet.BTreeDescRange<V> | 
| static class  | BTreeSet.BTreeRange<V> | 
| static class  | BTreeSet.Builder<V> | 
| Modifier and Type | Field and Description | 
|---|---|
| protected java.util.Comparator<? super V> | comparator | 
| protected java.lang.Object[] | tree | 
| Constructor and Description | 
|---|
| BTreeSet(java.lang.Object[] tree,
        java.util.Comparator<? super V> comparator) | 
| Modifier and Type | Method and Description | 
|---|---|
| void | add(int index,
   V element) | 
| boolean | add(V v) | 
| boolean | addAll(java.util.Collection<? extends V> c) | 
| boolean | addAll(int index,
      java.util.Collection<? extends V> c) | 
| static <V> BTreeSet.Builder<V> | builder(java.util.Comparator<? super V> comparator) | 
| V | ceiling(V v) | 
| void | clear() | 
| java.util.Comparator<? super V> | comparator() | 
| boolean | contains(java.lang.Object o) | 
| boolean | containsAll(java.util.Collection<?> c) | 
| BTreeSearchIterator<V,V> | descendingIterator() | 
| BTreeSet<V> | descendingSet() | 
| static <V> BTreeSet<V> | empty(java.util.Comparator<? super V> comparator) | 
| V | first() | 
| 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. | 
| int | hashCode() | 
| java.util.SortedSet<V> | headSet(V toElement) | 
| 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() | 
| BTreeSearchIterator<V,V> | iterator() | 
| V | last() | 
| int | lastIndexOf(java.lang.Object o) | 
| java.util.ListIterator<V> | listIterator() | 
| java.util.ListIterator<V> | listIterator(int index) | 
| V | lower(V v) | 
| static <V extends java.lang.Comparable<V>> | of(java.util.Collection<V> sortedValues) | 
| static <V> BTreeSet<V> | of(java.util.Comparator<? super V> comparator,
  V value) | 
| static <V extends java.lang.Comparable<V>> | of(V value) | 
| V | pollFirst() | 
| V | pollLast() | 
| V | remove(int index) | 
| boolean | remove(java.lang.Object o) | 
| boolean | removeAll(java.util.Collection<?> c) | 
| boolean | retainAll(java.util.Collection<?> c) | 
| V | set(int index,
   V element) | 
| int | size() | 
| protected BTreeSearchIterator<V,V> | slice(BTree.Dir dir) | 
| java.util.Spliterator<V> | spliterator() | 
| BTreeSet<V> | subList(int fromIndex,
       int toIndex) | 
| BTreeSet<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) | 
| BTreeSet<V> | tailSet(V fromElement,
       boolean inclusive) | 
| java.lang.Object[] | toArray() | 
| <T> T[] | toArray(T[] a) | 
| <T> T[] | toArray(T[] a,
       int offset) | 
| java.lang.Object[] | tree() | 
| BTreeSet<V> | update(java.util.Collection<V> updateWith) | 
| static <V> BTreeSet<V> | wrap(java.lang.Object[] btree,
    java.util.Comparator<V> comparator) | 
protected final java.util.Comparator<? super V> comparator
protected final java.lang.Object[] tree
public BTreeSet(java.lang.Object[] tree,
                java.util.Comparator<? super V> comparator)
public java.util.Comparator<? super V> comparator()
comparator in interface java.util.SortedSet<V>protected BTreeSearchIterator<V,V> slice(BTree.Dir dir)
public java.lang.Object[] tree()
public int indexOf(java.lang.Object item)
indexOf in interface java.util.List<V>public V get(int index)
get in interface java.util.List<V>public int lastIndexOf(java.lang.Object o)
lastIndexOf in interface java.util.List<V>public BTreeSet<V> subList(int fromIndex, int toIndex)
subList in interface java.util.List<V>public int size()
public boolean isEmpty()
public BTreeSearchIterator<V,V> iterator()
public BTreeSearchIterator<V,V> descendingIterator()
descendingIterator in interface java.util.NavigableSet<V>public java.lang.Object[] toArray()
public <T> T[] toArray(T[] a)
public <T> T[] toArray(T[] a,
                       int offset)
public java.util.Spliterator<V> spliterator()
public BTreeSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive)
subSet in interface java.util.NavigableSet<V>public BTreeSet<V> headSet(V toElement, boolean inclusive)
headSet in interface java.util.NavigableSet<V>public BTreeSet<V> tailSet(V fromElement, boolean inclusive)
tailSet in interface java.util.NavigableSet<V>public BTreeSet<V> descendingSet()
descendingSet in interface java.util.NavigableSet<V>public boolean contains(java.lang.Object o)
public boolean containsAll(java.util.Collection<?> c)
public int hashCode()
public boolean addAll(java.util.Collection<? extends V> c)
public boolean addAll(int index,
                      java.util.Collection<? extends V> c)
addAll in interface java.util.List<V>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 java.util.ListIterator<V> listIterator()
listIterator in interface java.util.List<V>public java.util.ListIterator<V> listIterator(int index)
listIterator in interface java.util.List<V>public static <V> BTreeSet.Builder<V> builder(java.util.Comparator<? super V> comparator)
public static <V> BTreeSet<V> wrap(java.lang.Object[] btree, java.util.Comparator<V> comparator)
public static <V extends java.lang.Comparable<V>> BTreeSet<V> of(java.util.Collection<V> sortedValues)
public static <V extends java.lang.Comparable<V>> BTreeSet<V> of(V value)
public static <V> BTreeSet<V> empty(java.util.Comparator<? super V> comparator)
public static <V> BTreeSet<V> of(java.util.Comparator<? super V> comparator, V value)
Copyright © 2018 The Apache Software Foundation