@Override ImmutableSortedSet<E> tailSetImpl(E fromElement) { return createSubset(findSubsetIndex(fromElement), toIndex); }
@Override ImmutableSortedSet<E> tailSetImpl(E fromElement) { return createSubset(findSubsetIndex(fromElement), toIndex); }
@Override ImmutableSortedSet<E> headSetImpl(E toElement) { return createSubset(fromIndex, findSubsetIndex(toElement)); }
@Override ImmutableSortedSet<E> headSetImpl(E toElement) { return createSubset(fromIndex, findSubsetIndex(toElement)); }
@Override ImmutableSortedSet<E> headSetImpl(E toElement) { return createSubset(fromIndex, findSubsetIndex(toElement)); }
@Override ImmutableSortedSet<E> headSetImpl(E toElement) { return createSubset(0, findSubsetIndex(toElement)); }
@Override ImmutableSortedSet<E> tailSetImpl(E fromElement) { return createSubset(findSubsetIndex(fromElement), toIndex); }
@Override ImmutableSortedSet<E> subSetImpl(E fromElement, E toElement) { return createSubset( findSubsetIndex(fromElement), findSubsetIndex(toElement)); }
@Override ImmutableSortedSet<E> subSetImpl(E fromElement, E toElement) { return createSubset( findSubsetIndex(fromElement), findSubsetIndex(toElement)); }
@Override ImmutableSortedSet<E> subSetImpl(E fromElement, E toElement) { return createSubset( findSubsetIndex(fromElement), findSubsetIndex(toElement)); }
@Override ImmutableSortedSet<E> subSetImpl(E fromElement, E toElement) { return createSubset( findSubsetIndex(fromElement), findSubsetIndex(toElement)); }
@Override ImmutableSortedSet<E> tailSetImpl(E fromElement) { return createSubset(findSubsetIndex(fromElement), size()); }
@Override ImmutableSortedSet<E> headSetImpl(E toElement, boolean inclusive) { int index; if (inclusive) { index = SortedLists.binarySearch( elements, checkNotNull(toElement), comparator(), FIRST_AFTER, NEXT_HIGHER); } else { index = SortedLists.binarySearch( elements, checkNotNull(toElement), comparator(), FIRST_PRESENT, NEXT_HIGHER); } return createSubset(0, index); }
@Override ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { int index; if (inclusive) { index = SortedLists.binarySearch( elements, checkNotNull(fromElement), comparator(), FIRST_PRESENT, NEXT_HIGHER); } else { index = SortedLists.binarySearch( elements, checkNotNull(fromElement), comparator(), FIRST_AFTER, NEXT_HIGHER); } return createSubset(index, size()); }