| BTreeSet<V> | BTreeSet.Builder. build() | 
| BTreeSet<V> | BTreeSet. descendingSet() | 
| BTreeSet<V> | BTreeSet.BTreeRange. descendingSet() | 
| BTreeSet<V> | BTreeSet.BTreeDescRange. descendingSet() | 
| static <V> BTreeSet<V> | BTreeSet. empty(java.util.Comparator<? super V> comparator) | 
| BTreeSet<V> | BTreeSet. headSet(V toElement,
       boolean inclusive) | 
| BTreeSet<V> | BTreeSet.BTreeRange. headSet(V toElement,
       boolean inclusive) | 
| BTreeSet<V> | BTreeSet.BTreeDescRange. headSet(V toElement,
       boolean inclusive) | 
| static <V extends java.lang.Comparable<V>>BTreeSet<V>
 | BTreeSet. of(java.util.Collection<V> sortedValues) | 
| static <V> BTreeSet<V> | BTreeSet. of(java.util.Comparator<? super V> comparator,
  V value) | 
| static <V extends java.lang.Comparable<V>>BTreeSet<V>
 | BTreeSet. of(V value) | 
| BTreeSet<V> | BTreeSet. subList(int fromIndex,
       int toIndex) | 
| BTreeSet<V> | BTreeSet.BTreeRange. subList(int fromIndex,
       int toIndex) | 
| BTreeSet<V> | BTreeSet.BTreeDescRange. subList(int fromIndex,
       int toIndex) | 
| BTreeSet<V> | BTreeSet. subSet(V fromElement,
      boolean fromInclusive,
      V toElement,
      boolean toInclusive) | 
| BTreeSet<V> | BTreeSet.BTreeRange. subSet(V fromElement,
      boolean fromInclusive,
      V toElement,
      boolean toInclusive) | 
| BTreeSet<V> | BTreeSet.BTreeDescRange. subSet(V fromElement,
      boolean fromInclusive,
      V toElement,
      boolean toInclusive) | 
| BTreeSet<V> | BTreeSet. tailSet(V fromElement,
       boolean inclusive) | 
| BTreeSet<V> | BTreeSet.BTreeRange. tailSet(V fromElement,
       boolean inclusive) | 
| BTreeSet<V> | BTreeSet.BTreeDescRange. tailSet(V fromElement,
       boolean inclusive) | 
| BTreeSet<V> | BTreeSet. update(java.util.Collection<V> updateWith) | 
| static <V> BTreeSet<V> | BTreeSet. wrap(java.lang.Object[] btree,
    java.util.Comparator<V> comparator) |