public BTreeSet<V> subList(int fromIndex, int toIndex) { if (fromIndex < 0 || toIndex > size()) throw new IndexOutOfBoundsException(); return new BTreeRange<V>(tree, comparator, lowerBound + fromIndex, lowerBound + toIndex - 1); }
public BTreeSet<V> subList(int fromIndex, int toIndex) { if (fromIndex < 0 || toIndex > size()) throw new IndexOutOfBoundsException(); return new BTreeRange<V>(tree, comparator, lowerBound + fromIndex, lowerBound + toIndex - 1); }
public BTreeSet<V> subList(int fromIndex, int toIndex) { if (fromIndex < 0 || toIndex > size()) throw new IndexOutOfBoundsException(); return new BTreeDescRange<V>(new BTreeRange<V>(tree, comparator, upperBound - (toIndex - 1), upperBound - fromIndex)); }
@Override public BTreeSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) { return new BTreeRange<>(tree, comparator, fromElement, fromInclusive, toElement, toInclusive); }
@Override public NavigableSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) { return new BTreeRange<>(this, new BTreeRange<>(tree, comparator, fromElement, fromInclusive, toElement, toInclusive)); }
@Override public NavigableSet<V> tailSet(V fromElement, boolean inclusive) { return new BTreeRange<>(tree, comparator, fromElement, inclusive, null, true); }
@Override public BTreeSet<V> descendingSet() { return new BTreeRange<>(this); }
@Override public BTreeSet<V> descendingSet() { return new BTreeRange<V>(this.tree, this.comparator).descendingSet(); }
@Override public BTreeSet<V> tailSet(V fromElement, boolean inclusive) { return new BTreeRange<>(this, new BTreeRange<>(tree, comparator, fromElement, inclusive, null, true)); }
@Override public BTreeSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) { return new BTreeRange<>(tree, comparator, fromElement, fromInclusive, toElement, toInclusive); }
@Override public BTreeSet<V> descendingSet() { return new BTreeRange<>(this); }
@Override public BTreeSet<V> headSet(V toElement, boolean inclusive) { return new BTreeRange<>(this, new BTreeRange<>(tree, comparator, null, true, toElement, inclusive)); }
@Override public BTreeSet<V> tailSet(V fromElement, boolean inclusive) { return new BTreeRange<>(tree, comparator, fromElement, inclusive, null, true); }
@Override public BTreeSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) { return new BTreeRange<>(tree, comparator, fromElement, fromInclusive, toElement, toInclusive); }
@Override public BTreeSet<V> headSet(V toElement, boolean inclusive) { return new BTreeRange<>(this, new BTreeRange<>(tree, comparator, null, true, toElement, inclusive)); }
@Override public BTreeSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) { return new BTreeRange<>(this, new BTreeRange<>(tree, comparator, fromElement, fromInclusive, toElement, toInclusive)); }
@Override public BTreeSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) { return new BTreeRange<>(this, new BTreeRange<>(tree, comparator, fromElement, fromInclusive, toElement, toInclusive)); }
@Override public NavigableSet<V> descendingSet() { return new BTreeRange<>(this); } }
@Override public BTreeSet<V> tailSet(V fromElement, boolean inclusive) { return new BTreeRange<>(this, new BTreeRange<>(tree, comparator, fromElement, inclusive, null, true)); }
@Override public BTreeSet<V> tailSet(V fromElement, boolean inclusive) { return new BTreeRange<>(tree, comparator, fromElement, inclusive, null, true); }