@GwtCompatible(serializable=true, emulated=true) public abstract class ImmutableSortedSet<E> extends ImmutableSet<E> implements NavigableSet<E>
SortedSet that stores its elements in a sorted array.
 Some instances are ordered by an explicit comparator, while others follow the
 natural sort ordering of their elements. Either way, null elements are not
 supported.
 Unlike Collections.unmodifiableSortedSet(java.util.SortedSet<T>), which is a view
 of a separate collection that can still change, an instance of ImmutableSortedSet contains its own private data and will never
 change. This class is convenient for public static final sets
 ("constant sets") and also lets you easily make a "defensive copy" of a set
 provided to your class by a caller.
 
The sets returned by the headSet(E), tailSet(E), and
 subSet(E, E) methods share the same array as the original set, preventing
 that array from being garbage collected. If this is a concern, the data may
 be copied into a correctly-sized array by calling copyOfSorted(java.util.SortedSet<E>).
 
Note on element equivalence: The ImmutableCollection.contains(Object),
 AbstractCollection.containsAll(Collection), and ImmutableSet.equals(Object)
 implementations must check whether a provided object is equivalent to an
 element in the collection. Unlike most collections, an
 ImmutableSortedSet doesn't use Object.equals(java.lang.Object) to determine if
 two elements are equivalent. Instead, with an explicit comparator, the
 following relation determines whether elements x and y are
 equivalent: 
   {(x, y) | comparator.compare(x, y) == 0}
 With natural ordering of elements, the following relation determines whether two elements are equivalent:
   {(x, y) | x.compareTo(y) == 0}
 Warning: Like most sets, an ImmutableSortedSet will not
 function correctly if an element is modified after being placed in the set.
 For this reason, and to avoid general confusion, it is strongly recommended
 to place only immutable objects into this collection.
 Note: Although this class is not final, it cannot be subclassed as it has no public or protected constructors. Thus, instances of this type are guaranteed to be immutable.
See the Guava User Guide article on immutable collections.
NavigableSet since 12.0)ImmutableSet, 
Serialized Form| Modifier and Type | Class and Description | 
|---|---|
| static class  | ImmutableSortedSet.Builder<E>A builder for creating immutable sorted set instances, especially  public static finalsets ("constant sets"), with a given comparator. | 
| Modifier and Type | Method and Description | 
|---|---|
| static <E> ImmutableSortedSet.Builder<E> | builder()Deprecated. 
 Use  naturalOrder(), which offers
     better type-safety. | 
| E | ceiling(E e)Returns the least element in this set greater than or equal to
 the given element, or  nullif there is no such element. | 
| Comparator<? super E> | comparator()Returns the comparator that orders the elements, which is
  Ordering.natural()when the natural ordering of the
 elements is used. | 
| static <E> ImmutableSortedSet<E> | copyOf(Collection<? extends E> elements)Returns an immutable sorted set containing the given elements sorted by
 their natural ordering. | 
| static <E> ImmutableSortedSet<E> | copyOf(Comparator<? super E> comparator,
            Collection<? extends E> elements)Returns an immutable sorted set containing the given elements sorted by
 the given  Comparator. | 
| static <E> ImmutableSortedSet<E> | copyOf(Comparator<? super E> comparator,
            Iterable<? extends E> elements)Returns an immutable sorted set containing the given elements sorted by
 the given  Comparator. | 
| static <E> ImmutableSortedSet<E> | copyOf(Comparator<? super E> comparator,
            Iterator<? extends E> elements)Returns an immutable sorted set containing the given elements sorted by
 the given  Comparator. | 
| static <E extends Comparable<? super E>>  | copyOf(E[] elements)Returns an immutable sorted set containing the given elements sorted by
 their natural ordering. | 
| static <E> ImmutableSortedSet<E> | copyOf(Iterable<? extends E> elements)Returns an immutable sorted set containing the given elements sorted by
 their natural ordering. | 
| static <E> ImmutableSortedSet<E> | copyOf(Iterator<? extends E> elements)Returns an immutable sorted set containing the given elements sorted by
 their natural ordering. | 
| static <E> ImmutableSortedSet<E> | copyOfSorted(SortedSet<E> sortedSet)Returns an immutable sorted set containing the elements of a sorted set,
 sorted by the same  Comparator. | 
| abstract UnmodifiableIterator<E> | descendingIterator()Returns an iterator over the elements in this set, in descending order. | 
| ImmutableSortedSet<E> | descendingSet()Returns a reverse order view of the elements contained in this set. | 
| E | first()Returns the first (lowest) element currently in this set. | 
| E | floor(E e)Returns the greatest element in this set less than or equal to
 the given element, or  nullif there is no such element. | 
| ImmutableSortedSet<E> | headSet(E toElement)Returns a view of the portion of this set whose elements are
 strictly less than toElement. | 
| ImmutableSortedSet<E> | headSet(E toElement,
              boolean inclusive)Returns a view of the portion of this set whose elements are less than
 (or equal to, if  inclusiveis true)toElement. | 
| E | higher(E e)Returns the least element in this set strictly greater than the
 given element, or  nullif there is no such element. | 
| abstract UnmodifiableIterator<E> | iterator()Returns an unmodifiable iterator across the elements in this collection. | 
| E | last()Returns the last (highest) element currently in this set. | 
| E | lower(E e)Returns the greatest element in this set strictly less than the
 given element, or  nullif there is no such element. | 
| static <E extends Comparable<?>>  | naturalOrder()Returns a builder that creates immutable sorted sets whose elements are
 ordered by their natural ordering. | 
| static <E> ImmutableSortedSet<E> | of()Returns the empty immutable sorted set. | 
| static <E extends Comparable<? super E>>  | of(E element)Returns an immutable sorted set containing a single element. | 
| static <E extends Comparable<? super E>>  | of(E e1,
    E e2)Returns an immutable sorted set containing the given elements sorted by
 their natural ordering. | 
| static <E extends Comparable<? super E>>  | of(E e1,
    E e2,
    E e3)Returns an immutable sorted set containing the given elements sorted by
 their natural ordering. | 
| static <E extends Comparable<? super E>>  | of(E e1,
    E e2,
    E e3,
    E e4)Returns an immutable sorted set containing the given elements sorted by
 their natural ordering. | 
| static <E extends Comparable<? super E>>  | of(E e1,
    E e2,
    E e3,
    E e4,
    E e5)Returns an immutable sorted set containing the given elements sorted by
 their natural ordering. | 
| static <E extends Comparable<? super E>>  | of(E e1,
    E e2,
    E e3,
    E e4,
    E e5,
    E e6,
    E... remaining)Returns an immutable sorted set containing the given elements sorted by
 their natural ordering. | 
| static <E> ImmutableSortedSet.Builder<E> | orderedBy(Comparator<E> comparator)Returns a builder that creates immutable sorted sets with an explicit
 comparator. | 
| E | pollFirst()Deprecated. 
 Unsupported operation. | 
| E | pollLast()Deprecated. 
 Unsupported operation. | 
| static <E extends Comparable<?>>  | reverseOrder()Returns a builder that creates immutable sorted sets whose elements are
 ordered by the reverse of their natural ordering. | 
| ImmutableSortedSet<E> | subSet(E fromElement,
            boolean fromInclusive,
            E toElement,
            boolean toInclusive)Returns a view of the portion of this set whose elements range from
  fromElementtotoElement. | 
| ImmutableSortedSet<E> | subSet(E fromElement,
            E toElement)Returns a view of the portion of this set whose elements range
 from fromElement, inclusive, to toElement,
 exclusive. | 
| ImmutableSortedSet<E> | tailSet(E fromElement)Returns a view of the portion of this set whose elements are
 greater than or equal to fromElement. | 
| ImmutableSortedSet<E> | tailSet(E fromElement,
              boolean inclusive)Returns a view of the portion of this set whose elements are greater
 than (or equal to, if  inclusiveis true)fromElement. | 
equals, hashCodeadd, addAll, asList, clear, contains, remove, removeAll, retainAll, toArray, toArraycontainsAll, isEmpty, size, toStringpublic static <E> ImmutableSortedSet<E> of()
public static <E extends Comparable<? super E>> ImmutableSortedSet<E> of(E element)
public static <E extends Comparable<? super E>> ImmutableSortedSet<E> of(E e1, E e2)
Comparable.compareTo(T), only the first one specified is included.NullPointerException - if any element is nullpublic static <E extends Comparable<? super E>> ImmutableSortedSet<E> of(E e1, E e2, E e3)
Comparable.compareTo(T), only the first one specified is included.NullPointerException - if any element is nullpublic static <E extends Comparable<? super E>> ImmutableSortedSet<E> of(E e1, E e2, E e3, E e4)
Comparable.compareTo(T), only the first one specified is included.NullPointerException - if any element is nullpublic static <E extends Comparable<? super E>> ImmutableSortedSet<E> of(E e1, E e2, E e3, E e4, E e5)
Comparable.compareTo(T), only the first one specified is included.NullPointerException - if any element is nullpublic static <E extends Comparable<? super E>> ImmutableSortedSet<E> of(E e1, E e2, E e3, E e4, E e5, E e6, E... remaining)
Comparable.compareTo(T), only the first one specified is included.NullPointerException - if any element is nullpublic static <E extends Comparable<? super E>> ImmutableSortedSet<E> copyOf(E[] elements)
Comparable.compareTo(T), only the first one specified is included.NullPointerException - if any of elements is nullpublic static <E> ImmutableSortedSet<E> copyOf(Iterable<? extends E> elements)
compareTo(), only the first one specified is included. To create a
 copy of a SortedSet that preserves the comparator, call copyOfSorted(java.util.SortedSet<E>) instead. This method iterates over elements at most
 once.
 Note that if s is a Set<String>, then ImmutableSortedSet.copyOf(s) returns an ImmutableSortedSet<String>
 containing each of the strings in s, while ImmutableSortedSet.of(s) returns an ImmutableSortedSet<Set<String>> containing one element (the given set
 itself).
 
Despite the method name, this method attempts to avoid actually copying the data when it is safe to do so. The exact circumstances under which a copy will or will not be performed are undocumented and subject to change.
This method is not type-safe, as it may be called on elements that are not mutually comparable.
ClassCastException - if the elements are not mutually comparableNullPointerException - if any of elements is nullpublic static <E> ImmutableSortedSet<E> copyOf(Collection<? extends E> elements)
compareTo(), only the first one specified is included. To create a
 copy of a SortedSet that preserves the comparator, call
 copyOfSorted(java.util.SortedSet<E>) instead. This method iterates over elements
 at most once.
 Note that if s is a Set<String>, then
 ImmutableSortedSet.copyOf(s) returns an
 ImmutableSortedSet<String> containing each of the strings in
 s, while ImmutableSortedSet.of(s) returns an
 ImmutableSortedSet<Set<String>> containing one element (the given
 set itself).
 
Note: Despite what the method name suggests, if elements
 is an ImmutableSortedSet, it may be returned instead of a copy.
 
This method is not type-safe, as it may be called on elements that are not mutually comparable.
This method is safe to use even when elements is a synchronized
 or concurrent collection that is currently being modified by another
 thread.
ClassCastException - if the elements are not mutually comparableNullPointerException - if any of elements is nullpublic static <E> ImmutableSortedSet<E> copyOf(Iterator<? extends E> elements)
compareTo(), only the first one specified is included.
 This method is not type-safe, as it may be called on elements that are not mutually comparable.
ClassCastException - if the elements are not mutually comparableNullPointerException - if any of elements is nullpublic static <E> ImmutableSortedSet<E> copyOf(Comparator<? super E> comparator, Iterator<? extends E> elements)
Comparator. When multiple elements are equivalent
 according to compareTo(), only the first one specified is
 included.NullPointerException - if comparator or any of
     elements is nullpublic static <E> ImmutableSortedSet<E> copyOf(Comparator<? super E> comparator, Iterable<? extends E> elements)
Comparator. When multiple elements are equivalent
 according to compare(), only the first one specified is
 included. This method iterates over elements at most once.
 Despite the method name, this method attempts to avoid actually copying the data when it is safe to do so. The exact circumstances under which a copy will or will not be performed are undocumented and subject to change.
NullPointerException - if comparator or any of elements is nullpublic static <E> ImmutableSortedSet<E> copyOf(Comparator<? super E> comparator, Collection<? extends E> elements)
Comparator. When multiple elements are equivalent
 according to compareTo(), only the first one specified is
 included.
 Despite the method name, this method attempts to avoid actually copying the data when it is safe to do so. The exact circumstances under which a copy will or will not be performed are undocumented and subject to change.
This method is safe to use even when elements is a synchronized
 or concurrent collection that is currently being modified by another
 thread.
NullPointerException - if comparator or any of
     elements is nullpublic static <E> ImmutableSortedSet<E> copyOfSorted(SortedSet<E> sortedSet)
Comparator. That behavior differs from copyOf(Iterable), which always uses the natural ordering of the
 elements.
 Despite the method name, this method attempts to avoid actually copying the data when it is safe to do so. The exact circumstances under which a copy will or will not be performed are undocumented and subject to change.
This method is safe to use even when sortedSet is a synchronized
 or concurrent collection that is currently being modified by another
 thread.
NullPointerException - if sortedSet or any of its elements
     is nullpublic static <E> ImmutableSortedSet.Builder<E> orderedBy(Comparator<E> comparator)
SortedSet<Integer> with a
 Comparator<Number>, use the ImmutableSortedSet.Builder constructor instead.NullPointerException - if comparator is nullpublic static <E extends Comparable<?>> ImmutableSortedSet.Builder<E> reverseOrder()
public static <E extends Comparable<?>> ImmutableSortedSet.Builder<E> naturalOrder()
Ordering.natural() as the comparator. This method provides more
 type-safety than builder(), as it can be called only for classes
 that implement Comparable.public Comparator<? super E> comparator()
Ordering.natural() when the natural ordering of the
 elements is used. Note that its behavior is not consistent with
 SortedSet.comparator(), which returns null to indicate
 natural ordering.comparator in interface SortedSet<E>public abstract UnmodifiableIterator<E> iterator()
ImmutableCollectioniterator in interface Iterable<E>iterator in interface Collection<E>iterator in interface NavigableSet<E>iterator in interface Set<E>iterator in class ImmutableSet<E>public ImmutableSortedSet<E> headSet(E toElement)
The returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
Equivalent to headSet(toElement, false).
 
This method returns a serializable ImmutableSortedSet.
 
The SortedSet.headSet(E) documentation states that a subset of a
 subset throws an IllegalArgumentException if passed a
 toElement greater than an earlier toElement. However, this
 method doesn't throw an exception in that situation, but instead keeps the
 original toElement.
@GwtIncompatible(value="NavigableSet") public ImmutableSortedSet<E> headSet(E toElement, boolean inclusive)
java.util.NavigableSetinclusive is true) toElement.  The
 returned set is backed by this set, so changes in the returned set are
 reflected in this set, and vice-versa.  The returned set supports all
 optional set operations that this set supports.
 The returned set will throw an IllegalArgumentException
 on an attempt to insert an element outside its range.
headSet in interface NavigableSet<E>toElement - high endpoint of the returned setinclusive - true if the high endpoint
        is to be included in the returned viewinclusive is true) toElementpublic ImmutableSortedSet<E> subSet(E fromElement, E toElement)
The returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
Equivalent to subSet(fromElement, true, toElement, false).
 
This method returns a serializable ImmutableSortedSet.
 
The SortedSet.subSet(E, E) documentation states that a subset of a
 subset throws an IllegalArgumentException if passed a
 fromElement smaller than an earlier fromElement. However,
 this method doesn't throw an exception in that situation, but instead keeps
 the original fromElement. Similarly, this method keeps the
 original toElement, instead of throwing an exception, if passed a
 toElement greater than an earlier toElement.
subSet in interface NavigableSet<E>subSet in interface SortedSet<E>fromElement - low endpoint (inclusive) of the returned settoElement - high endpoint (exclusive) of the returned set@GwtIncompatible(value="NavigableSet") public ImmutableSortedSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive)
java.util.NavigableSetfromElement to toElement.  If fromElement and
 toElement are equal, the returned set is empty unless fromInclusive and toInclusive are both true.  The returned set
 is backed by this set, so changes in the returned set are reflected in
 this set, and vice-versa.  The returned set supports all optional set
 operations that this set supports.
 The returned set will throw an IllegalArgumentException
 on an attempt to insert an element outside its range.
subSet in interface NavigableSet<E>fromElement - low endpoint of the returned setfromInclusive - true if the low endpoint
        is to be included in the returned viewtoElement - high endpoint of the returned settoInclusive - true if the high endpoint
        is to be included in the returned viewfromElement, inclusive, to toElement, exclusivepublic ImmutableSortedSet<E> tailSet(E fromElement)
The returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
Equivalent to tailSet(fromElement, true).
 
This method returns a serializable ImmutableSortedSet.
 
The SortedSet.tailSet(E) documentation states that a subset of a
 subset throws an IllegalArgumentException if passed a
 fromElement smaller than an earlier fromElement. However,
 this method doesn't throw an exception in that situation, but instead keeps
 the original fromElement.
@GwtIncompatible(value="NavigableSet") public ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive)
java.util.NavigableSetinclusive is true) fromElement.
 The returned set is backed by this set, so changes in the returned set
 are reflected in this set, and vice-versa.  The returned set supports
 all optional set operations that this set supports.
 The returned set will throw an IllegalArgumentException
 on an attempt to insert an element outside its range.
tailSet in interface NavigableSet<E>fromElement - low endpoint of the returned setinclusive - true if the low endpoint
        is to be included in the returned viewfromElement@GwtIncompatible(value="NavigableSet") public E lower(E e)
java.util.NavigableSetnull if there is no such element.lower in interface NavigableSet<E>e - the value to matche,
         or null if there is no such element@GwtIncompatible(value="NavigableSet") public E floor(E e)
java.util.NavigableSetnull if there is no such element.floor in interface NavigableSet<E>e - the value to matche,
         or null if there is no such element@GwtIncompatible(value="NavigableSet") public E ceiling(E e)
java.util.NavigableSetnull if there is no such element.ceiling in interface NavigableSet<E>e - the value to matche,
         or null if there is no such element@GwtIncompatible(value="NavigableSet") public E higher(E e)
java.util.NavigableSetnull if there is no such element.higher in interface NavigableSet<E>e - the value to matche,
         or null if there is no such elementpublic E first()
java.util.SortedSetpublic E last()
java.util.SortedSet@Deprecated @GwtIncompatible(value="NavigableSet") public final E pollFirst()
pollFirst in interface NavigableSet<E>null if this set is emptyUnsupportedOperationException - always@Deprecated @GwtIncompatible(value="NavigableSet") public final E pollLast()
pollLast in interface NavigableSet<E>null if this set is emptyUnsupportedOperationException - always@GwtIncompatible(value="NavigableSet") public ImmutableSortedSet<E> descendingSet()
java.util.NavigableSetremove operation), the results of
 the iteration are undefined.
 The returned set has an ordering equivalent to
 Collections.reverseOrder(comparator()).
 The expression s.descendingSet().descendingSet() returns a
 view of s essentially equivalent to s.
descendingSet in interface NavigableSet<E>@GwtIncompatible(value="NavigableSet") public abstract UnmodifiableIterator<E> descendingIterator()
java.util.NavigableSetdescendingSet().iterator().descendingIterator in interface NavigableSet<E>@Deprecated public static <E> ImmutableSortedSet.Builder<E> builder()
naturalOrder(), which offers
     better type-safety.naturalOrder(), which offers
 better type-safety, instead. This method exists only to hide
 ImmutableSet.builder() from consumers of ImmutableSortedSet.UnsupportedOperationException - alwaysCopyright © 2010-2013. All Rights Reserved.