@Override public BTreeSet<V> headSet(V toElement, boolean inclusive) { return super.tailSet(toElement, inclusive).descendingSet(); }
@Override public BTreeSet<V> tailSet(V fromElement, boolean inclusive) { return super.headSet(fromElement, inclusive).descendingSet(); }
@Override public BTreeSet<V> tailSet(V fromElement, boolean inclusive) { return super.headSet(fromElement, inclusive).descendingSet(); }
@Override public BTreeSet<V> headSet(V toElement, boolean inclusive) { return super.tailSet(toElement, inclusive).descendingSet(); }
@Override public BTreeSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) { return super.subSet(toElement, toInclusive, fromElement, fromInclusive).descendingSet(); }
@Override public BTreeSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) { return super.subSet(toElement, toInclusive, fromElement, fromInclusive).descendingSet(); }
@Override public BTreeSet<V> headSet(V toElement, boolean inclusive) { return super.tailSet(toElement, inclusive).descendingSet(); }
@Override public BTreeSet<V> tailSet(V fromElement, boolean inclusive) { return super.headSet(fromElement, inclusive).descendingSet(); }
@Override public BTreeSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) { return super.subSet(toElement, toInclusive, fromElement, fromInclusive).descendingSet(); }
@Override public BTreeSet<V> headSet(V toElement, boolean inclusive) { return super.tailSet(toElement, inclusive).descendingSet(); }
@Override public BTreeSet<V> subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive) { return super.subSet(toElement, toInclusive, fromElement, fromInclusive).descendingSet(); }
@Override public BTreeSet<V> tailSet(V fromElement, boolean inclusive) { return super.headSet(fromElement, inclusive).descendingSet(); }