/** @since 12.0 */ @GwtIncompatible // NavigableSet @Override public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { return tailSetImpl(checkNotNull(fromElement), inclusive); }
/** @since 12.0 */ @GwtIncompatible // NavigableSet @Override public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { return tailSetImpl(checkNotNull(fromElement), inclusive); }
/** * A builder for creating immutable sorted set instances, especially {@code public static final} * sets ("constant sets"), with a given comparator. Example: * * <pre>{@code * public static final ImmutableSortedSet<Number> LUCKY_NUMBERS = * new ImmutableSortedSet.Builder<Number>(ODDS_FIRST_COMPARATOR) * .addAll(SINGLE_DIGIT_PRIMES) * .add(42) * .build(); * }</pre> * * <p>Builder instances can be reused; it is safe to call {@link #build} multiple times to build * multiple sets in series. Each set is a superset of the set created before it. * * @since 2.0 */ public static final class Builder<E> extends ImmutableSet.Builder<E> { private final Comparator<? super E> comparator; /** * Creates a new builder. The returned builder is equivalent to the builder generated by {@link * ImmutableSortedSet#orderedBy}. */ public Builder(Comparator<? super E> comparator) { this.comparator = checkNotNull(comparator); } /** * Adds {@code element} to the {@code ImmutableSortedSet}. If the {@code ImmutableSortedSet}
/** * {@inheritDoc} * * <p>This method returns a serializable {@code ImmutableSortedSet}. * * <p>The {@link SortedSet#tailSet} documentation states that a subset of a * subset throws an {@link IllegalArgumentException} if passed a * {@code fromElement} smaller than an earlier {@code fromElement}. However, * this method doesn't throw an exception in that situation, but instead keeps * the original {@code fromElement}. */ public ImmutableSortedSet<E> tailSet(E fromElement) { return tailSetImpl(checkNotNull(fromElement)); }
/** * {@inheritDoc} * * <p>This method returns a serializable {@code ImmutableSortedSet}. * * <p>The {@link SortedSet#tailSet} documentation states that a subset of a * subset throws an {@link IllegalArgumentException} if passed a * {@code fromElement} smaller than an earlier {@code fromElement}. However, * this method doesn't throw an exception in that situation, but instead keeps * the original {@code fromElement}. */ public ImmutableSortedSet<E> tailSet(E fromElement) { return tailSetImpl(checkNotNull(fromElement)); }
/** * {@inheritDoc} * * <p>This method returns a serializable {@code ImmutableSortedSet}. * * <p>The {@link SortedSet#tailSet} documentation states that a subset of a * subset throws an {@link IllegalArgumentException} if passed a * {@code fromElement} smaller than an earlier {@code fromElement}. However, * this method doesn't throw an exception in that situation, but instead keeps * the original {@code fromElement}. */ public ImmutableSortedSet<E> tailSet(E fromElement) { return tailSetImpl(checkNotNull(fromElement)); }
/** * {@inheritDoc} * * <p>This method returns a serializable {@code ImmutableSortedSet}. * * <p>The {@link SortedSet#tailSet} documentation states that a subset of a * subset throws an {@link IllegalArgumentException} if passed a * {@code fromElement} smaller than an earlier {@code fromElement}. However, * this method doesn't throw an exception in that situation, but instead keeps * the original {@code fromElement}. */ public ImmutableSortedSet<E> tailSet(E fromElement) { return tailSetImpl(checkNotNull(fromElement)); }
ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { return tailSetImpl(checkNotNull(fromElement), inclusive); }
/** * {@inheritDoc} * * <p>This method returns a serializable {@code ImmutableSortedSet}. * * <p>The {@link SortedSet#tailSet} documentation states that a subset of a * subset throws an {@link IllegalArgumentException} if passed a * {@code fromElement} smaller than an earlier {@code fromElement}. However, * this method doesn't throw an exception in that situation, but instead keeps * the original {@code fromElement}. */ public ImmutableSortedSet<E> tailSet(E fromElement) { return tailSetImpl(checkNotNull(fromElement)); }
/** * @since 12.0 */ @GwtIncompatible("NavigableSet") @Override public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { return tailSetImpl(checkNotNull(fromElement), inclusive); }
/** * @since 12.0 */ @GwtIncompatible("NavigableSet") @Override public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { return tailSetImpl(checkNotNull(fromElement), inclusive); }
/** @since 12.0 */ @GwtIncompatible // NavigableSet @Override public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { return tailSetImpl(checkNotNull(fromElement), inclusive); }
/** * @since 12.0 */ @GwtIncompatible("NavigableSet") @Override public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { return tailSetImpl(checkNotNull(fromElement), inclusive); }
/** * @since 12.0 */ @GwtIncompatible("NavigableSet") public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { return tailSetImpl(checkNotNull(fromElement), inclusive); }
/** * @since 12.0 */ @GwtIncompatible("NavigableSet") @Override public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { return tailSetImpl(checkNotNull(fromElement), inclusive); }
/** * @since 12.0 */ @GwtIncompatible("NavigableSet") @Override public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { return tailSetImpl(checkNotNull(fromElement), inclusive); }
/** * @since 12.0 */ @GwtIncompatible("NavigableSet") @Override public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { return tailSetImpl(checkNotNull(fromElement), inclusive); }
/** * @since 12.0 */ @GwtIncompatible("NavigableSet") @Override public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { return tailSetImpl(checkNotNull(fromElement), inclusive); }
/** @since 12.0 */ @GwtIncompatible // NavigableSet @Override public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { return tailSetImpl(checkNotNull(fromElement), inclusive); }