com.google.common.collect

Class ImmutableSortedMap<K,V>

java.lang.Object

com.google.common.collect.ImmutableMap<K,V>

com.google.common.collect.ImmutableSortedMap<K,V>

All Implemented Interfaces:

Serializable, Map<K,V>, NavigableMap<K,V>, SortedMap<K,V>

@GwtCompatible(serializable=true,
               emulated=true)
public abstract class ImmutableSortedMap<K,V>
extends ImmutableMap<K,V>
implements NavigableMap<K,V>

An immutable SortedMap. Does not permit null keys or values.

Unlike Collections.unmodifiableSortedMap(java.util.SortedMap<K, ? extends V>), which is a view of a separate map which can still change, an instance of ImmutableSortedMap contains its own data and will never change. ImmutableSortedMap is convenient for public static final maps ("constant maps") and also lets you easily make a "defensive copy" of a map provided to your class by a caller.

Note: Although this class is not final, it cannot be subclassed as it has no public or protected constructors. Thus, instances of this class are guaranteed to be immutable.

See the Guava User Guide article on immutable collections.

Since:

2.0 (imported from Google Collections Library; implements NavigableMap since 12.0)

Author:

Jared Levy, Louis Wasserman

See Also:

Serialized Form

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	ImmutableSortedMap.Builder<K,V> A builder for creating immutable sorted map instances, especially public static final maps ("constant maps").

Nested classes/interfaces inherited from interface java.util.Map

Map.Entry<K,V>

Method Summary

Methods

Modifier and Type	Method and Description
static <K,V> ImmutableSortedMap.Builder<K,V>	builder() Deprecated. Use naturalOrder(), which offers better type-safety.
Map.Entry<K,V>	ceilingEntry(K key) Returns a key-value mapping associated with the least key greater than or equal to the given key, or null if there is no such key.
K	ceilingKey(K key) Returns the least key greater than or equal to the given key, or null if there is no such key.
Comparator<? super K>	comparator() Returns the comparator that orders the keys, which is Ordering.natural() when the natural ordering of the keys is used.
boolean	containsValue(Object value) Returns true if this map maps one or more keys to the specified value.
static <K,V> ImmutableSortedMap<K,V>	copyOf(Map<? extends K,? extends V> map) Returns an immutable map containing the same entries as map, sorted by the natural ordering of the keys.
static <K,V> ImmutableSortedMap<K,V>	copyOf(Map<? extends K,? extends V> map, Comparator<? super K> comparator) Returns an immutable map containing the same entries as map, with keys sorted by the provided comparator.
static <K,V> ImmutableSortedMap<K,V>	copyOfSorted(SortedMap<K,? extends V> map) Returns an immutable map containing the same entries as the provided sorted map, with the same ordering.
ImmutableSortedSet<K>	descendingKeySet() Returns a reverse order NavigableSet view of the keys contained in this map.
ImmutableSortedMap<K,V>	descendingMap() Returns a reverse order view of the mappings contained in this map.
ImmutableSet<Map.Entry<K,V>>	entrySet() Returns an immutable set of the mappings in this map, sorted by the key ordering.
Map.Entry<K,V>	firstEntry() Returns a key-value mapping associated with the least key in this map, or null if the map is empty.
K	firstKey() Returns the first (lowest) key currently in this map.
Map.Entry<K,V>	floorEntry(K key) Returns a key-value mapping associated with the greatest key less than or equal to the given key, or null if there is no such key.
K	floorKey(K key) Returns the greatest key less than or equal to the given key, or null if there is no such key.
ImmutableSortedMap<K,V>	headMap(K toKey) This method returns a ImmutableSortedMap, consisting of the entries whose keys are less than toKey.
abstract ImmutableSortedMap<K,V>	headMap(K toKey, boolean inclusive) This method returns a ImmutableSortedMap, consisting of the entries whose keys are less than (or equal to, if inclusive) toKey.
Map.Entry<K,V>	higherEntry(K key) Returns a key-value mapping associated with the least key strictly greater than the given key, or null if there is no such key.
K	higherKey(K key) Returns the least key strictly greater than the given key, or null if there is no such key.
abstract ImmutableSortedSet<K>	keySet() Returns an immutable sorted set of the keys in this map.
Map.Entry<K,V>	lastEntry() Returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.
K	lastKey() Returns the last (highest) key currently in this map.
Map.Entry<K,V>	lowerEntry(K key) Returns a key-value mapping associated with the greatest key strictly less than the given key, or null if there is no such key.
K	lowerKey(K key) Returns the greatest key strictly less than the given key, or null if there is no such key.
static <K extends Comparable<?>,V> ImmutableSortedMap.Builder<K,V>	naturalOrder() Returns a builder that creates immutable sorted maps whose keys are ordered by their natural ordering.
ImmutableSortedSet<K>	navigableKeySet() Returns a NavigableSet view of the keys contained in this map.
static <K,V> ImmutableSortedMap<K,V>	of() Returns the empty sorted map.
static <K extends Comparable<? super K>,V> ImmutableSortedMap<K,V>	of(K k1, V v1) Returns an immutable map containing a single entry.
static <K extends Comparable<? super K>,V> ImmutableSortedMap<K,V>	of(K k1, V v1, K k2, V v2) Returns an immutable sorted map containing the given entries, sorted by the natural ordering of their keys.
static <K extends Comparable<? super K>,V> ImmutableSortedMap<K,V>	of(K k1, V v1, K k2, V v2, K k3, V v3) Returns an immutable sorted map containing the given entries, sorted by the natural ordering of their keys.
static <K extends Comparable<? super K>,V> ImmutableSortedMap<K,V>	of(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) Returns an immutable sorted map containing the given entries, sorted by the natural ordering of their keys.
static <K extends Comparable<? super K>,V> ImmutableSortedMap<K,V>	of(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) Returns an immutable sorted map containing the given entries, sorted by the natural ordering of their keys.
static <K,V> ImmutableSortedMap.Builder<K,V>	orderedBy(Comparator<K> comparator) Returns a builder that creates immutable sorted maps with an explicit comparator.
Map.Entry<K,V>	pollFirstEntry() Deprecated. Unsupported operation.
Map.Entry<K,V>	pollLastEntry() Deprecated. Unsupported operation.
static <K extends Comparable<?>,V> ImmutableSortedMap.Builder<K,V>	reverseOrder() Returns a builder that creates immutable sorted maps whose keys are ordered by the reverse of their natural ordering.
int	size() Returns the number of key-value mappings in this map.
ImmutableSortedMap<K,V>	subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) This method returns a ImmutableSortedMap, consisting of the entries whose keys ranges from fromKey to toKey, inclusive or exclusive as indicated by the boolean flags.
ImmutableSortedMap<K,V>	subMap(K fromKey, K toKey) This method returns a ImmutableSortedMap, consisting of the entries whose keys ranges from fromKey, inclusive, to toKey, exclusive.
ImmutableSortedMap<K,V>	tailMap(K fromKey) This method returns a ImmutableSortedMap, consisting of the entries whose keys are greater than or equals to fromKey.
abstract ImmutableSortedMap<K,V>	tailMap(K fromKey, boolean inclusive) This method returns a ImmutableSortedMap, consisting of the entries whose keys are greater than (or equal to, if inclusive) fromKey.
abstract ImmutableCollection<V>	values() Returns an immutable collection of the values in this map, sorted by the ordering of the corresponding keys.

Methods inherited from class com.google.common.collect.ImmutableMap

asMultimap, clear, containsKey, equals, get, hashCode, isEmpty, put, putAll, remove, toString

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Map

clear, containsKey, equals, get, hashCode, isEmpty, put, putAll, remove

Method Detail

of

public static <K,V> ImmutableSortedMap<K,V> of()

Returns the empty sorted map.

of

public static <K extends Comparable<? super K>,V> ImmutableSortedMap<K,V> of(K k1,
                                                             V v1)

Returns an immutable map containing a single entry.

of

public static <K extends Comparable<? super K>,V> ImmutableSortedMap<K,V> of(K k1,
                                                             V v1,
                                                             K k2,
                                                             V v2)

Returns an immutable sorted map containing the given entries, sorted by the natural ordering of their keys.

Throws:

IllegalArgumentException - if the two keys are equal according to their natural ordering

of

public static <K extends Comparable<? super K>,V> ImmutableSortedMap<K,V> of(K k1,
                                                             V v1,
                                                             K k2,
                                                             V v2,
                                                             K k3,
                                                             V v3)

Returns an immutable sorted map containing the given entries, sorted by the natural ordering of their keys.

Throws:

IllegalArgumentException - if any two keys are equal according to their natural ordering

of

public static <K extends Comparable<? super K>,V> ImmutableSortedMap<K,V> of(K k1,
                                                             V v1,
                                                             K k2,
                                                             V v2,
                                                             K k3,
                                                             V v3,
                                                             K k4,
                                                             V v4)

Returns an immutable sorted map containing the given entries, sorted by the natural ordering of their keys.

Throws:

IllegalArgumentException - if any two keys are equal according to their natural ordering

of

public static <K extends Comparable<? super K>,V> ImmutableSortedMap<K,V> of(K k1,
                                                             V v1,
                                                             K k2,
                                                             V v2,
                                                             K k3,
                                                             V v3,
                                                             K k4,
                                                             V v4,
                                                             K k5,
                                                             V v5)

Returns an immutable sorted map containing the given entries, sorted by the natural ordering of their keys.

Throws:

IllegalArgumentException - if any two keys are equal according to their natural ordering

copyOf

public static <K,V> ImmutableSortedMap<K,V> copyOf(Map<? extends K,? extends V> map)

Returns an immutable map containing the same entries as map, sorted by the natural ordering of the keys.

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 a map with keys that are not mutually comparable.

Throws:

ClassCastException - if the keys in map are not mutually comparable

NullPointerException - if any key or value in map is null

IllegalArgumentException - if any two keys are equal according to their natural ordering

copyOf

public static <K,V> ImmutableSortedMap<K,V> copyOf(Map<? extends K,? extends V> map,
                                   Comparator<? super K> comparator)

Returns an immutable map containing the same entries as map, with keys sorted by the provided comparator.

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.

Throws:

NullPointerException - if any key or value in map is null

IllegalArgumentException - if any two keys are equal according to the comparator

copyOfSorted

public static <K,V> ImmutableSortedMap<K,V> copyOfSorted(SortedMap<K,? extends V> map)

Returns an immutable map containing the same entries as the provided sorted map, with the same ordering.

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.

Throws:

NullPointerException - if any key or value in map is null

naturalOrder

public static <K extends Comparable<?>,V> ImmutableSortedMap.Builder<K,V> naturalOrder()

Returns a builder that creates immutable sorted maps whose keys are ordered by their natural ordering. The sorted maps use Ordering.natural() as the comparator.

orderedBy

public static <K,V> ImmutableSortedMap.Builder<K,V> orderedBy(Comparator<K> comparator)

Returns a builder that creates immutable sorted maps with an explicit comparator. If the comparator has a more general type than the map's keys, such as creating a SortedMap<Integer, String> with a Comparator<Number>, use the ImmutableSortedMap.Builder constructor instead.

Throws:

NullPointerException - if comparator is null

reverseOrder

public static <K extends Comparable<?>,V> ImmutableSortedMap.Builder<K,V> reverseOrder()

Returns a builder that creates immutable sorted maps whose keys are ordered by the reverse of their natural ordering.

size

public int size()

Description copied from interface: java.util.Map

Returns the number of key-value mappings in this map. If the map contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

Specified by:

size in interface Map<K,V>

Returns:

the number of key-value mappings in this map

containsValue

public boolean containsValue(@Nullable
                    Object value)

Description copied from interface: java.util.Map

Returns true if this map maps one or more keys to the specified value. More formally, returns true if and only if this map contains at least one mapping to a value v such that (value==null ? v==null : value.equals(v)). This operation will probably require time linear in the map size for most implementations of the Map interface.

Specified by:

containsValue in interface Map<K,V>

Overrides:

containsValue in class ImmutableMap<K,V>

Parameters:

value - value whose presence in this map is to be tested

Returns:

true if this map maps one or more keys to the specified value

entrySet

public ImmutableSet<Map.Entry<K,V>> entrySet()

Returns an immutable set of the mappings in this map, sorted by the key ordering.

Specified by:

entrySet in interface Map<K,V>

Specified by:

entrySet in interface SortedMap<K,V>

Overrides:

entrySet in class ImmutableMap<K,V>

Returns:

a set view of the mappings contained in this map

keySet

public abstract ImmutableSortedSet<K> keySet()

Returns an immutable sorted set of the keys in this map.

Specified by:

keySet in interface Map<K,V>

Specified by:

keySet in interface SortedMap<K,V>

Overrides:

keySet in class ImmutableMap<K,V>

Returns:

a set view of the keys contained in this map

values

public abstract ImmutableCollection<V> values()

Returns an immutable collection of the values in this map, sorted by the ordering of the corresponding keys.

Specified by:

values in interface Map<K,V>

Specified by:

values in interface SortedMap<K,V>

Overrides:

values in class ImmutableMap<K,V>

Returns:

a collection view of the values contained in this map

comparator

public Comparator<? super K> comparator()

Returns the comparator that orders the keys, which is Ordering.natural() when the natural ordering of the keys is used. Note that its behavior is not consistent with TreeMap.comparator(), which returns null to indicate natural ordering.

Specified by:

comparator in interface SortedMap<K,V>

Returns:

the comparator used to order the keys in this map, or null if this map uses the natural ordering of its keys

firstKey

public K firstKey()

Description copied from interface: java.util.SortedMap

Returns the first (lowest) key currently in this map.

Specified by:

firstKey in interface SortedMap<K,V>

Returns:

the first (lowest) key currently in this map

lastKey

public K lastKey()

Description copied from interface: java.util.SortedMap

Returns the last (highest) key currently in this map.

Specified by:

lastKey in interface SortedMap<K,V>

Returns:

the last (highest) key currently in this map

headMap

public ImmutableSortedMap<K,V> headMap(K toKey)

This method returns a ImmutableSortedMap, consisting of the entries whose keys are less than toKey.

The SortedMap.headMap(K) documentation states that a submap of a submap throws an IllegalArgumentException if passed a toKey greater than an earlier toKey. However, this method doesn't throw an exception in that situation, but instead keeps the original toKey.

Specified by:

headMap in interface NavigableMap<K,V>

Specified by:

headMap in interface SortedMap<K,V>

Parameters:

toKey - high endpoint (exclusive) of the keys in the returned map

Returns:

a view of the portion of this map whose keys are strictly less than toKey

headMap

public abstract ImmutableSortedMap<K,V> headMap(K toKey,
                              boolean inclusive)

This method returns a ImmutableSortedMap, consisting of the entries whose keys are less than (or equal to, if inclusive) toKey.

The SortedMap.headMap(K) documentation states that a submap of a submap throws an IllegalArgumentException if passed a toKey greater than an earlier toKey. However, this method doesn't throw an exception in that situation, but instead keeps the original toKey.

Specified by:

headMap in interface NavigableMap<K,V>

Parameters:

toKey - high endpoint of the keys in the returned map

inclusive - true if the high endpoint is to be included in the returned view

Returns:

a view of the portion of this map whose keys are less than (or equal to, if inclusive is true) toKey

Since:

12.0

subMap

public ImmutableSortedMap<K,V> subMap(K fromKey,
                             K toKey)

This method returns a ImmutableSortedMap, consisting of the entries whose keys ranges from fromKey, inclusive, to toKey, exclusive.

The SortedMap.subMap(K, K) documentation states that a submap of a submap throws an IllegalArgumentException if passed a fromKey less than an earlier fromKey. However, this method doesn't throw an exception in that situation, but instead keeps the original fromKey. Similarly, this method keeps the original toKey, instead of throwing an exception, if passed a toKey greater than an earlier toKey.

Specified by:

subMap in interface NavigableMap<K,V>

Specified by:

subMap in interface SortedMap<K,V>

Parameters:

fromKey - low endpoint (inclusive) of the keys in the returned map

toKey - high endpoint (exclusive) of the keys in the returned map

Returns:

a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive

subMap

public ImmutableSortedMap<K,V> subMap(K fromKey,
                             boolean fromInclusive,
                             K toKey,
                             boolean toInclusive)

This method returns a ImmutableSortedMap, consisting of the entries whose keys ranges from fromKey to toKey, inclusive or exclusive as indicated by the boolean flags.

The SortedMap.subMap(K, K) documentation states that a submap of a submap throws an IllegalArgumentException if passed a fromKey less than an earlier fromKey. However, this method doesn't throw an exception in that situation, but instead keeps the original fromKey. Similarly, this method keeps the original toKey, instead of throwing an exception, if passed a toKey greater than an earlier toKey.

Specified by:

subMap in interface NavigableMap<K,V>

Parameters:

fromKey - low endpoint of the keys in the returned map

fromInclusive - true if the low endpoint is to be included in the returned view

toKey - high endpoint of the keys in the returned map

toInclusive - true if the high endpoint is to be included in the returned view

Returns:

a view of the portion of this map whose keys range from fromKey to toKey

Since:

12.0

tailMap

public ImmutableSortedMap<K,V> tailMap(K fromKey)

This method returns a ImmutableSortedMap, consisting of the entries whose keys are greater than or equals to fromKey.

The SortedMap.tailMap(K) documentation states that a submap of a submap throws an IllegalArgumentException if passed a fromKey less than an earlier fromKey. However, this method doesn't throw an exception in that situation, but instead keeps the original fromKey.

Specified by:

tailMap in interface NavigableMap<K,V>

Specified by:

tailMap in interface SortedMap<K,V>

Parameters:

fromKey - low endpoint (inclusive) of the keys in the returned map

Returns:

a view of the portion of this map whose keys are greater than or equal to fromKey

tailMap

public abstract ImmutableSortedMap<K,V> tailMap(K fromKey,
                              boolean inclusive)

This method returns a ImmutableSortedMap, consisting of the entries whose keys are greater than (or equal to, if inclusive) fromKey.

The SortedMap.tailMap(K) documentation states that a submap of a submap throws an IllegalArgumentException if passed a fromKey less than an earlier fromKey. However, this method doesn't throw an exception in that situation, but instead keeps the original fromKey.

Specified by:

tailMap in interface NavigableMap<K,V>

Parameters:

fromKey - low endpoint of the keys in the returned map

inclusive - true if the low endpoint is to be included in the returned view

Returns:

a view of the portion of this map whose keys are greater than (or equal to, if inclusive is true) fromKey

Since:

12.0

lowerEntry

public Map.Entry<K,V> lowerEntry(K key)

Description copied from interface: java.util.NavigableMap

Returns a key-value mapping associated with the greatest key strictly less than the given key, or null if there is no such key.

Specified by:

lowerEntry in interface NavigableMap<K,V>

Parameters:

key - the key

Returns:

an entry with the greatest key less than key, or null if there is no such key

lowerKey

public K lowerKey(K key)

Description copied from interface: java.util.NavigableMap

Returns the greatest key strictly less than the given key, or null if there is no such key.

Specified by:

lowerKey in interface NavigableMap<K,V>

Parameters:

key - the key

Returns:

the greatest key less than key, or null if there is no such key

floorEntry

public Map.Entry<K,V> floorEntry(K key)

Description copied from interface: java.util.NavigableMap

Returns a key-value mapping associated with the greatest key less than or equal to the given key, or null if there is no such key.

Specified by:

floorEntry in interface NavigableMap<K,V>

Parameters:

key - the key

Returns:

an entry with the greatest key less than or equal to key, or null if there is no such key

floorKey

public K floorKey(K key)

Description copied from interface: java.util.NavigableMap

Returns the greatest key less than or equal to the given key, or null if there is no such key.

Specified by:

floorKey in interface NavigableMap<K,V>

Parameters:

key - the key

Returns:

the greatest key less than or equal to key, or null if there is no such key

ceilingEntry

public Map.Entry<K,V> ceilingEntry(K key)

Description copied from interface: java.util.NavigableMap

Returns a key-value mapping associated with the least key greater than or equal to the given key, or null if there is no such key.

Specified by:

ceilingEntry in interface NavigableMap<K,V>

Parameters:

key - the key

Returns:

an entry with the least key greater than or equal to key, or null if there is no such key

ceilingKey

public K ceilingKey(K key)

Description copied from interface: java.util.NavigableMap

Returns the least key greater than or equal to the given key, or null if there is no such key.

Specified by:

ceilingKey in interface NavigableMap<K,V>

Parameters:

key - the key

Returns:

the least key greater than or equal to key, or null if there is no such key

higherEntry

public Map.Entry<K,V> higherEntry(K key)

Description copied from interface: java.util.NavigableMap

Returns a key-value mapping associated with the least key strictly greater than the given key, or null if there is no such key.

Specified by:

higherEntry in interface NavigableMap<K,V>

Parameters:

key - the key

Returns:

an entry with the least key greater than key, or null if there is no such key

higherKey

public K higherKey(K key)

Description copied from interface: java.util.NavigableMap

Returns the least key strictly greater than the given key, or null if there is no such key.

Specified by:

higherKey in interface NavigableMap<K,V>

Parameters:

key - the key

Returns:

the least key greater than key, or null if there is no such key

firstEntry

public Map.Entry<K,V> firstEntry()

Description copied from interface: java.util.NavigableMap

Returns a key-value mapping associated with the least key in this map, or null if the map is empty.

Specified by:

firstEntry in interface NavigableMap<K,V>

Returns:

an entry with the least key, or null if this map is empty

lastEntry

public Map.Entry<K,V> lastEntry()

Description copied from interface: java.util.NavigableMap

Returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.

Specified by:

lastEntry in interface NavigableMap<K,V>

Returns:

an entry with the greatest key, or null if this map is empty

pollFirstEntry

@Deprecated
public final Map.Entry<K,V> pollFirstEntry()

Deprecated. Unsupported operation.

Guaranteed to throw an exception and leave the map unmodified.

Specified by:

pollFirstEntry in interface NavigableMap<K,V>

Returns:

the removed first entry of this map, or null if this map is empty

Throws:

UnsupportedOperationException - always

pollLastEntry

@Deprecated
public final Map.Entry<K,V> pollLastEntry()

Deprecated. Unsupported operation.

Guaranteed to throw an exception and leave the map unmodified.

Specified by:

pollLastEntry in interface NavigableMap<K,V>

Returns:

the removed last entry of this map, or null if this map is empty

Throws:

UnsupportedOperationException - always

descendingMap

public ImmutableSortedMap<K,V> descendingMap()

Description copied from interface: java.util.NavigableMap

Returns a reverse order view of the mappings contained in this map. The descending map is backed by this map, so changes to the map are reflected in the descending map, and vice-versa. If either map is modified while an iteration over a collection view of either map is in progress (except through the iterator's own remove operation), the results of the iteration are undefined.

The returned map has an ordering equivalent to Collections.reverseOrder(comparator()). The expression m.descendingMap().descendingMap() returns a view of m essentially equivalent to m.

Specified by:

descendingMap in interface NavigableMap<K,V>

Returns:

a reverse order view of this map

navigableKeySet

public ImmutableSortedSet<K> navigableKeySet()

Description copied from interface: java.util.NavigableMap

Returns a NavigableSet view of the keys contained in this map. The set's iterator returns the keys in ascending order. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own remove operation), the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll, and clear operations. It does not support the add or addAll operations.

Specified by:

navigableKeySet in interface NavigableMap<K,V>

Returns:

a navigable set view of the keys in this map

descendingKeySet

public ImmutableSortedSet<K> descendingKeySet()

Description copied from interface: java.util.NavigableMap

Returns a reverse order NavigableSet view of the keys contained in this map. The set's iterator returns the keys in descending order. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own remove operation), the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll, and clear operations. It does not support the add or addAll operations.

Specified by:

descendingKeySet in interface NavigableMap<K,V>

Returns:

a reverse order navigable set view of the keys in this map

builder

@Deprecated
public static <K,V> ImmutableSortedMap.Builder<K,V> builder()

Deprecated. Use naturalOrder(), which offers better type-safety.

Not supported. Use naturalOrder(), which offers better type-safety, instead. This method exists only to hide ImmutableMap.builder() from consumers of ImmutableSortedMap.

Throws:

UnsupportedOperationException - always