Modifier and Type	Class and Description
pack-priv class	ReverseOrderSortedMapView.Submap Used for various submap views.
pack-priv static class	ReverseOrderSortedMapView.ViewEntry<K, V>

Modifier and Type	Field and Description
pack-priv final SortedMap<K, V>	base
pack-priv final Comparator<? super K>	cmp

Access	Constructor and Description
private	ReverseOrderSortedMapView(SortedMap<K, V> map)

Method Summary

Modifier and Type	Method and Description
public void	clear() Overrides java.util.AbstractMap.clear. Implements java.util.Map.clear. Removes all of the mappings from this map (optional operation).
public Comparator<? super K>	comparator() Implements java.util.SortedMap.comparator. Returns the comparator used to order the keys in this map, or `null` if this map uses the natural ordering of its keys.
public boolean	containsKey(Object key) Overrides java.util.AbstractMap.containsKey. Implements java.util.Map.containsKey. Returns `true` if this map contains a mapping for the specified key.
public boolean	containsValue(Object value) Overrides java.util.AbstractMap.containsValue. Implements java.util.Map.containsValue. Returns `true` if this map maps one or more keys to the specified value.
pack-priv static <K, V> Iterator<Map.Entry<K, V>>	descendingEntryIterator(SortedMap<K, V> map)
pack-priv static <K, V> Iterator<K>	descendingKeyIterator(SortedMap<K, V> map)
pack-priv static <K, V> Iterator<V>	descendingValueIterator(SortedMap<K, V> map)
public Set<Map.Entry<K, V>>	entrySet() Implements abstract java.util.AbstractMap.entrySet. Implements java.util.SortedMap.entrySet, java.util.Map.entrySet. Returns a `Set` view of the mappings contained in this map.
public Map.Entry<K, V>	firstEntry() Overrides default java.util.SequencedMap.firstEntry. Returns the first key-value mapping in this map, or `null` if the map is empty.
public K	firstKey() Implements java.util.SortedMap.firstKey. Returns the first (lowest) key currently in this map.
public V	get(Object key) Overrides java.util.AbstractMap.get. Implements java.util.Map.get. Returns the value to which the specified key is mapped, or `null` if this map contains no mapping for the key.
public SortedMap<K, V>	headMap(K toKey) Implements java.util.SortedMap.headMap. Returns a view of the portion of this map whose keys are strictly less than `toKey`.
public boolean	isEmpty() Overrides java.util.AbstractMap.isEmpty. Implements java.util.Map.isEmpty. Returns `true` if this map contains no key-value mappings.
public Set<K>	keySet() Overrides java.util.AbstractMap.keySet. Implements java.util.SortedMap.keySet, java.util.Map.keySet. Returns a `Set` view of the keys contained in this map.
public Map.Entry<K, V>	lastEntry() Overrides default java.util.SequencedMap.lastEntry. Returns the last key-value mapping in this map, or `null` if the map is empty.
public K	lastKey() Implements java.util.SortedMap.lastKey. Returns the last (highest) key currently in this map.
public static <K, V> SortedMap<K, V>	of(SortedMap<K, V> map)
public Map.Entry<K, V>	pollFirstEntry() Overrides default java.util.SequencedMap.pollFirstEntry. Removes and returns the first key-value mapping in this map, or `null` if the map is empty (optional operation).
public Map.Entry<K, V>	pollLastEntry() Overrides default java.util.SequencedMap.pollLastEntry. Removes and returns the last key-value mapping in this map, or `null` if the map is empty (optional operation).
public V	put(K key, V value) Overrides java.util.AbstractMap.put. Implements java.util.Map.put. Associates the specified value with the specified key in this map (optional operation).
public void	putAll(Map<? extends K, ? extends V> m) Overrides java.util.AbstractMap.putAll. Implements java.util.Map.putAll. Copies all of the mappings from the specified map to this map (optional operation).
public V	putFirst(K k, V v) Overrides default java.util.SortedMap.putFirst. Throws `UnsupportedOperationException`.
public V	putLast(K k, V v) Overrides default java.util.SortedMap.putLast. Throws `UnsupportedOperationException`.
public V	remove(Object key) Overrides java.util.AbstractMap.remove. Implements java.util.Map.remove. Removes the mapping for a key from this map if it is present (optional operation).
public SortedMap<K, V>	reversed() Overrides default java.util.SortedMap.reversed. Returns a reverse-ordered view of this map.
public int	size() Overrides java.util.AbstractMap.size. Implements java.util.Map.size. Returns the number of key-value mappings in this map.
public SortedMap<K, V>	subMap(K fromKey, K toKey) Implements java.util.SortedMap.subMap. Returns a view of the portion of this map whose keys range from `fromKey`, inclusive, to `toKey`, exclusive.
public SortedMap<K, V>	tailMap(K fromKey) Implements java.util.SortedMap.tailMap. Returns a view of the portion of this map whose keys are greater than or equal to `fromKey`.
public String	toString() Overrides java.util.AbstractMap.toString. Returns a string representation of this map.
pack-priv static <K, V> String	toString(Map<K, V> thisMap, Iterator<Map.Entry<K, V>> i)
public Collection<V>	values() Overrides java.util.AbstractMap.values. Implements java.util.SortedMap.values, java.util.Map.values. Returns a `Collection` view of the values contained in this map.

Inherited from java.util.AbstractMap:: clone equals hashCode

Field Detail

base	back to summary
pack-priv final SortedMap<K, V> base

cmp	back to summary
pack-priv final Comparator<? super K> cmp

Constructor Detail

ReverseOrderSortedMapView	back to summary
private ReverseOrderSortedMapView(SortedMap<K, V> map)

Method Detail

clear	back to summary
public void clear() Overrides java.util.AbstractMap.clear. Implements java.util.Map.clear. Doc from java.util.Map.clear. Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.

clear

back to summary

public void clear()

Overrides java.util.AbstractMap.clear.

Implements java.util.Map.clear.

Doc from java.util.Map.clear.

Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.

comparator back to summary

comparator	back to summary
public Comparator<? super K> comparator() Implements java.util.SortedMap.comparator. Doc from java.util.SortedMap.comparator. Returns the comparator used to order the keys in this map, or `null` if this map uses the natural ordering of its keys.

public Comparator<? super K> comparator()

Implements java.util.SortedMap.comparator.

Doc from java.util.SortedMap.comparator.

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

containsKey back to summary

containsKey	back to summary
public boolean containsKey(Object key) Overrides java.util.AbstractMap.containsKey. Implements java.util.Map.containsKey. Doc from java.util.Map.containsKey. Returns `true` if this map contains a mapping for the specified key. More formally, returns `true` if and only if this map contains a mapping for a key `k` such that `Objects.equals(key, k)`. (There can be at most one such mapping.)

public boolean containsKey(Object key)

Overrides java.util.AbstractMap.containsKey.

Implements java.util.Map.containsKey.

Doc from java.util.Map.containsKey.

Returns true if this map contains a mapping for the specified key. More formally, returns true if and only if this map contains a mapping for a key k such that Objects.equals(key, k). (There can be at most one such mapping.)

containsValue back to summary

containsValue	back to summary
public boolean containsValue(Object value) Overrides java.util.AbstractMap.containsValue. Implements java.util.Map.containsValue. Doc from java.util.Map.containsValue. 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 `Objects.equals(value, v)`. This operation will probably require time linear in the map size for most implementations of the `Map` interface.

public boolean containsValue(Object value)

Overrides java.util.AbstractMap.containsValue.

Implements java.util.Map.containsValue.

Doc from java.util.Map.containsValue.

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 Objects.equals(value, v). This operation will probably require time linear in the map size for most implementations of the Map interface.

descendingEntryIterator	back to summary
pack-priv static <K, V> Iterator<Map.Entry<K, V>> descendingEntryIterator(SortedMap<K, V> map)

descendingKeyIterator	back to summary
pack-priv static <K, V> Iterator<K> descendingKeyIterator(SortedMap<K, V> map)

descendingValueIterator	back to summary
pack-priv static <K, V> Iterator<V> descendingValueIterator(SortedMap<K, V> map)

entrySet back to summary

entrySet	back to summary
public Set<Map.Entry<K, V>> entrySet() Implements abstract java.util.AbstractMap.entrySet. Implements java.util.SortedMap.entrySet, java.util.Map.entrySet. Doc from java.util.SortedMap.entrySet. Returns a `Set` view of the mappings contained in this map. The set's iterator returns the entries in ascending key 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, or through the `setValue` operation on a map entry returned by the iterator) 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.

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

Implements abstract java.util.AbstractMap.entrySet.

Implements java.util.SortedMap.entrySet, java.util.Map.entrySet.

Doc from java.util.SortedMap.entrySet.

Returns a Set view of the mappings contained in this map. The set's iterator returns the entries in ascending key 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, or through the setValue operation on a map entry returned by the iterator) 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.

firstEntry back to summary

firstEntry	back to summary
public Map.Entry<K, V> firstEntry() Overrides default java.util.SequencedMap.firstEntry. Doc from java.util.SequencedMap.firstEntry. Returns the first key-value mapping in this map, or `null` if the map is empty.

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

Overrides default java.util.SequencedMap.firstEntry.

Doc from java.util.SequencedMap.firstEntry.

Returns the first key-value mapping in this map, or null if the map is empty.

firstKey	back to summary
public K firstKey() Implements java.util.SortedMap.firstKey. Doc from java.util.SortedMap.firstKey. Returns the first (lowest) key currently in this map.

firstKey

back to summary

public K firstKey()

Implements java.util.SortedMap.firstKey.

Doc from java.util.SortedMap.firstKey.

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

get back to summary

get	back to summary
public V get(Object key) Overrides java.util.AbstractMap.get. Implements java.util.Map.get. Doc from java.util.Map.get. Returns the value to which the specified key is mapped, or `null` if this map contains no mapping for the key. More formally, if this map contains a mapping from a key `k` to a value `v` such that `Objects.equals(key, k)`, then this method returns `v`; otherwise it returns `null`. (There can be at most one such mapping.) If this map permits null values, then a return value of `null` does not necessarily indicate that the map contains no mapping for the key; it's also possible that the map explicitly maps the key to `null`. The `containsKey` operation may be used to distinguish these two cases.

public V get(Object key)

Overrides java.util.AbstractMap.get.

Implements java.util.Map.get.

Doc from java.util.Map.get.

Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.

More formally, if this map contains a mapping from a key k to a value v such that Objects.equals(key, k), then this method returns v; otherwise it returns null. (There can be at most one such mapping.)

If this map permits null values, then a return value of null does not necessarily indicate that the map contains no mapping for the key; it's also possible that the map explicitly maps the key to null. The containsKey operation may be used to distinguish these two cases.

headMap back to summary

headMap	back to summary
public SortedMap<K, V> headMap(K toKey) Implements java.util.SortedMap.headMap. Doc from java.util.SortedMap.headMap. Returns a view of the portion of this map whose keys are strictly less than `toKey`. The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports. The returned map will throw an `IllegalArgumentException` on an attempt to insert a key outside its range.

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

Implements java.util.SortedMap.headMap.

Doc from java.util.SortedMap.headMap.

Returns a view of the portion of this map whose keys are strictly less than toKey. The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports.

The returned map will throw an IllegalArgumentException on an attempt to insert a key outside its range.

isEmpty back to summary

isEmpty	back to summary
public boolean isEmpty() Overrides java.util.AbstractMap.isEmpty. Implements java.util.Map.isEmpty. Doc from java.util.Map.isEmpty. Returns `true` if this map contains no key-value mappings.

public boolean isEmpty()

Overrides java.util.AbstractMap.isEmpty.

Implements java.util.Map.isEmpty.

Doc from java.util.Map.isEmpty.

Returns true if this map contains no key-value mappings.

keySet back to summary

keySet	back to summary
public Set<K> keySet() Overrides java.util.AbstractMap.keySet. Implements java.util.SortedMap.keySet, java.util.Map.keySet. Doc from java.util.SortedMap.keySet. Returns a `Set` 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.

public Set<K> keySet()

Overrides java.util.AbstractMap.keySet.

Implements java.util.SortedMap.keySet, java.util.Map.keySet.

Doc from java.util.SortedMap.keySet.

Returns a Set 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.

lastEntry back to summary

lastEntry	back to summary
public Map.Entry<K, V> lastEntry() Overrides default java.util.SequencedMap.lastEntry. Doc from java.util.SequencedMap.lastEntry. Returns the last key-value mapping in this map, or `null` if the map is empty.

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

Overrides default java.util.SequencedMap.lastEntry.

Doc from java.util.SequencedMap.lastEntry.

Returns the last key-value mapping in this map, or null if the map is empty.

lastKey	back to summary
public K lastKey() Implements java.util.SortedMap.lastKey. Doc from java.util.SortedMap.lastKey. Returns the last (highest) key currently in this map.

lastKey

back to summary

public K lastKey()

Implements java.util.SortedMap.lastKey.

Doc from java.util.SortedMap.lastKey.

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

of	back to summary
public static <K, V> SortedMap<K, V> of(SortedMap<K, V> map)

pollFirstEntry back to summary

pollFirstEntry	back to summary
public Map.Entry<K, V> pollFirstEntry() Overrides default java.util.SequencedMap.pollFirstEntry. Doc from java.util.SequencedMap.pollFirstEntry. Removes and returns the first key-value mapping in this map, or `null` if the map is empty (optional operation).

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

Overrides default java.util.SequencedMap.pollFirstEntry.

Doc from java.util.SequencedMap.pollFirstEntry.

Removes and returns the first key-value mapping in this map, or null if the map is empty (optional operation).

pollLastEntry back to summary

pollLastEntry	back to summary
public Map.Entry<K, V> pollLastEntry() Overrides default java.util.SequencedMap.pollLastEntry. Doc from java.util.SequencedMap.pollLastEntry. Removes and returns the last key-value mapping in this map, or `null` if the map is empty (optional operation).

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

Overrides default java.util.SequencedMap.pollLastEntry.

Doc from java.util.SequencedMap.pollLastEntry.

Removes and returns the last key-value mapping in this map, or null if the map is empty (optional operation).

put back to summary

put	back to summary
public V put(K key, V value) Overrides java.util.AbstractMap.put. Implements java.util.Map.put. Doc from java.util.Map.put. Associates the specified value with the specified key in this map (optional operation). If the map previously contained a mapping for the key, the old value is replaced by the specified value. (A map `m` is said to contain a mapping for a key `k` if and only if `m.containsKey(k)` would return `true`.)

public V put(K key, V value)

Overrides java.util.AbstractMap.put.

Implements java.util.Map.put.

Doc from java.util.Map.put.

Associates the specified value with the specified key in this map (optional operation). If the map previously contained a mapping for the key, the old value is replaced by the specified value. (A map m is said to contain a mapping for a key k if and only if m.containsKey(k) would return true.)

putAll back to summary

putAll	back to summary
public void putAll(Map<? extends K, ? extends V> m) Overrides java.util.AbstractMap.putAll. Implements java.util.Map.putAll. Doc from java.util.Map.putAll. Copies all of the mappings from the specified map to this map (optional operation). The effect of this call is equivalent to that of calling `put(k, v)` on this map once for each mapping from key `k` to value `v` in the specified map. The behavior of this operation is undefined if the specified map is modified while the operation is in progress. If the specified map has a defined encounter order, processing of its mappings generally occurs in that order.

public void putAll(Map<? extends K, ? extends V> m)

Overrides java.util.AbstractMap.putAll.

Implements java.util.Map.putAll.

Doc from java.util.Map.putAll.

Copies all of the mappings from the specified map to this map (optional operation). The effect of this call is equivalent to that of calling put(k, v) on this map once for each mapping from key k to value v in the specified map. The behavior of this operation is undefined if the specified map is modified while the operation is in progress. If the specified map has a defined encounter order, processing of its mappings generally occurs in that order.

putFirst back to summary

putFirst	back to summary
public V putFirst(K k, V v) Overrides default java.util.SortedMap.putFirst. Doc from java.util.SortedMap.putFirst. Throws `UnsupportedOperationException`. The encounter order induced by this map's comparison method determines the position of mappings, so explicit positioning is not supported.

public V putFirst(K k, V v)

Overrides default java.util.SortedMap.putFirst.

Doc from java.util.SortedMap.putFirst.

Throws UnsupportedOperationException. The encounter order induced by this map's comparison method determines the position of mappings, so explicit positioning is not supported.

putLast back to summary

putLast	back to summary
public V putLast(K k, V v) Overrides default java.util.SortedMap.putLast. Doc from java.util.SortedMap.putLast. Throws `UnsupportedOperationException`. The encounter order induced by this map's comparison method determines the position of mappings, so explicit positioning is not supported.

public V putLast(K k, V v)

Overrides default java.util.SortedMap.putLast.

Doc from java.util.SortedMap.putLast.

Throws UnsupportedOperationException. The encounter order induced by this map's comparison method determines the position of mappings, so explicit positioning is not supported.

remove back to summary

remove	back to summary
public V remove(Object key) Overrides java.util.AbstractMap.remove. Implements java.util.Map.remove. Doc from java.util.Map.remove. Removes the mapping for a key from this map if it is present (optional operation). More formally, if this map contains a mapping from key `k` to value `v` such that `Objects.equals(key, k)`, that mapping is removed. (The map can contain at most one such mapping.) Returns the value to which this map previously associated the key, or `null` if the map contained no mapping for the key. If this map permits null values, then a return value of `null` does not necessarily indicate that the map contained no mapping for the key; it's also possible that the map explicitly mapped the key to `null`. The map will not contain a mapping for the specified key once the call returns.

public V remove(Object key)

Overrides java.util.AbstractMap.remove.

Implements java.util.Map.remove.

Doc from java.util.Map.remove.

Removes the mapping for a key from this map if it is present (optional operation). More formally, if this map contains a mapping from key k to value v such that Objects.equals(key, k), that mapping is removed. (The map can contain at most one such mapping.)

Returns the value to which this map previously associated the key, or null if the map contained no mapping for the key.

If this map permits null values, then a return value of null does not necessarily indicate that the map contained no mapping for the key; it's also possible that the map explicitly mapped the key to null.

The map will not contain a mapping for the specified key once the call returns.

reversed	back to summary
public SortedMap<K, V> reversed() Overrides default java.util.SortedMap.reversed. Doc from java.util.SortedMap.reversed. Returns a reverse-ordered view of this map. The encounter order of mappings in the returned view is the inverse of the encounter order of mappings in this map. The reverse ordering affects all order-sensitive operations, including those on the view collections of the returned view. If the implementation permits modifications to this view, the modifications "write through" to the underlying map. Changes to the underlying map might or might not be visible in this reversed view, depending upon the implementation.

reversed

back to summary

public SortedMap<K, V> reversed()

Overrides default java.util.SortedMap.reversed.

Doc from java.util.SortedMap.reversed.

Returns a reverse-ordered view of this map. The encounter order of mappings in the returned view is the inverse of the encounter order of mappings in this map. The reverse ordering affects all order-sensitive operations, including those on the view collections of the returned view. If the implementation permits modifications to this view, the modifications "write through" to the underlying map. Changes to the underlying map might or might not be visible in this reversed view, depending upon the implementation.

size back to summary

size	back to summary
public int size() Overrides java.util.AbstractMap.size. Implements java.util.Map.size. Doc from java.util.Map.size. Returns the number of key-value mappings in this map. If the map contains more than `Integer.MAX_VALUE` elements, returns `Integer.MAX_VALUE`.

public int size()

Overrides java.util.AbstractMap.size.

Implements java.util.Map.size.

Doc from java.util.Map.size.

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

subMap back to summary

subMap	back to summary
public SortedMap<K, V> subMap(K fromKey, K toKey) Implements java.util.SortedMap.subMap. Doc from java.util.SortedMap.subMap. Returns a view of the portion of this map whose keys range from `fromKey`, inclusive, to `toKey`, exclusive. (If `fromKey` and `toKey` are equal, the returned map is empty.) The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports. The returned map will throw an `IllegalArgumentException` on an attempt to insert a key outside its range.

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

Implements java.util.SortedMap.subMap.

Doc from java.util.SortedMap.subMap.

Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive. (If fromKey and toKey are equal, the returned map is empty.) The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports.

The returned map will throw an IllegalArgumentException on an attempt to insert a key outside its range.

tailMap back to summary

tailMap	back to summary
public SortedMap<K, V> tailMap(K fromKey) Implements java.util.SortedMap.tailMap. Doc from java.util.SortedMap.tailMap. Returns a view of the portion of this map whose keys are greater than or equal to `fromKey`. The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports. The returned map will throw an `IllegalArgumentException` on an attempt to insert a key outside its range.

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

Implements java.util.SortedMap.tailMap.

Doc from java.util.SortedMap.tailMap.

Returns a view of the portion of this map whose keys are greater than or equal to fromKey. The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports.

The returned map will throw an IllegalArgumentException on an attempt to insert a key outside its range.

toString back to summary

toString	back to summary
public String toString() Overrides java.util.AbstractMap.toString. Doc from java.util.AbstractMap.toString. Returns a string representation of this map. The string representation consists of a list of key-value mappings in the order returned by the map's `entrySet` view's iterator, enclosed in braces (`"{}"`). Adjacent mappings are separated by the characters `", "` (comma and space). Each key-value mapping is rendered as the key followed by an equals sign (`"="`) followed by the associated value. Keys and values are converted to strings as by `String#valueOf(Object)`.

public String toString()

Overrides java.util.AbstractMap.toString.

Doc from java.util.AbstractMap.toString.

Returns a string representation of this map. The string representation consists of a list of key-value mappings in the order returned by the map's entrySet view's iterator, enclosed in braces ("{}"). Adjacent mappings are separated by the characters ", " (comma and space). Each key-value mapping is rendered as the key followed by an equals sign ("=") followed by the associated value. Keys and values are converted to strings as by String#valueOf(Object).

toString	back to summary
pack-priv static <K, V> String toString(Map<K, V> thisMap, Iterator<Map.Entry<K, V>> i)

values back to summary

values	back to summary
public Collection<V> values() Overrides java.util.AbstractMap.values. Implements java.util.SortedMap.values, java.util.Map.values. Doc from java.util.SortedMap.values. Returns a `Collection` view of the values contained in this map. The collection's iterator returns the values in ascending order of the corresponding keys. The collection is backed by the map, so changes to the map are reflected in the collection, and vice-versa. If the map is modified while an iteration over the collection is in progress (except through the iterator's own `remove` operation), the results of the iteration are undefined. The collection supports element removal, which removes the corresponding mapping from the map, via the `Iterator.remove`, `Collection.remove`, `removeAll`, `retainAll` and `clear` operations. It does not support the `add` or `addAll` operations.

public Collection<V> values()

Overrides java.util.AbstractMap.values.

Implements java.util.SortedMap.values, java.util.Map.values.

Doc from java.util.SortedMap.values.

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

java.util back to summary

pack-priv Class ReverseOrderSortedMapView.Submap

Class Inheritance

extends AbstractMap<K, V>
implements SortedMap<K, V>

java.lang.Object
java.util.AbstractMap
java.util.ReverseOrderSortedMapView.Submap

All Implemented Interfaces

java.util.SortedMap, java.util.SequencedMap, java.util.Map

Used for various submap views. We can't use the base SortedMap's subMap, because of the asymmetry between from-inclusive and to-exclusive.

Field Summary

Modifier and Type	Field and Description
pack-priv final K	head
pack-priv final K	tail

Inherited from java.util.AbstractMap:: keySet values

Constructor Summary

Access	Constructor and Description
pack-priv	Submap(K head, K tail)

Method Summary

Modifier and Type	Method and Description
pack-priv boolean	aboveHead(K k)
pack-priv boolean	belowTail(K k)
public Comparator<? super K>	comparator() Implements java.util.SortedMap.comparator. Returns the comparator used to order the keys in this map, or `null` if this map uses the natural ordering of its keys.
pack-priv Iterator<Map.Entry<K, V>>	entryIterator()
public Set<Map.Entry<K, V>>	entrySet() Implements abstract java.util.AbstractMap.entrySet. Implements java.util.SortedMap.entrySet, java.util.Map.entrySet. Returns a `Set` view of the mappings contained in this map.
public K	firstKey() Implements java.util.SortedMap.firstKey. Returns the first (lowest) key currently in this map.
public SortedMap<K, V>	headMap(K to) Implements java.util.SortedMap.headMap. Returns a view of the portion of this map whose keys are strictly less than `toKey`.
public K	lastKey() Implements java.util.SortedMap.lastKey. Returns the last (highest) key currently in this map.
public V	put(K key, V value) Overrides java.util.AbstractMap.put. Implements java.util.Map.put. Associates the specified value with the specified key in this map (optional operation).
public V	remove(Object o) Overrides java.util.AbstractMap.remove. Implements java.util.Map.remove. Removes the mapping for a key from this map if it is present (optional operation).
public int	size() Overrides java.util.AbstractMap.size. Implements java.util.Map.size. Returns the number of key-value mappings in this map.
public SortedMap<K, V>	subMap(K from, K to) Implements java.util.SortedMap.subMap. Returns a view of the portion of this map whose keys range from `fromKey`, inclusive, to `toKey`, exclusive.
public SortedMap<K, V>	tailMap(K from) Implements java.util.SortedMap.tailMap. Returns a view of the portion of this map whose keys are greater than or equal to `fromKey`.
public String	toString() Overrides java.util.AbstractMap.toString. Returns a string representation of this map.

Inherited from java.util.AbstractMap:: clear clone containsKey containsValue equals get hashCode isEmpty keySet putAll values

Field Detail

head	back to summary
pack-priv final K head

tail	back to summary
pack-priv final K tail

Constructor Detail

Submap	back to summary
pack-priv Submap(K head, K tail)

Method Detail

aboveHead	back to summary
pack-priv boolean aboveHead(K k)

belowTail	back to summary
pack-priv boolean belowTail(K k)

comparator back to summary

comparator	back to summary
public Comparator<? super K> comparator() Implements java.util.SortedMap.comparator. Doc from java.util.SortedMap.comparator. Returns the comparator used to order the keys in this map, or `null` if this map uses the natural ordering of its keys.

public Comparator<? super K> comparator()

Implements java.util.SortedMap.comparator.

Doc from java.util.SortedMap.comparator.

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

entryIterator	back to summary
pack-priv Iterator<Map.Entry<K, V>> entryIterator()

entrySet back to summary

entrySet	back to summary
public Set<Map.Entry<K, V>> entrySet() Implements abstract java.util.AbstractMap.entrySet. Implements java.util.SortedMap.entrySet, java.util.Map.entrySet. Doc from java.util.SortedMap.entrySet. Returns a `Set` view of the mappings contained in this map. The set's iterator returns the entries in ascending key 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, or through the `setValue` operation on a map entry returned by the iterator) 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.

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

Implements abstract java.util.AbstractMap.entrySet.

Implements java.util.SortedMap.entrySet, java.util.Map.entrySet.

Doc from java.util.SortedMap.entrySet.

firstKey	back to summary
public K firstKey() Implements java.util.SortedMap.firstKey. Doc from java.util.SortedMap.firstKey. Returns the first (lowest) key currently in this map.

firstKey

back to summary

public K firstKey()

Implements java.util.SortedMap.firstKey.

Doc from java.util.SortedMap.firstKey.

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

headMap back to summary

public SortedMap<K, V> headMap(K to)

Implements java.util.SortedMap.headMap.

Doc from java.util.SortedMap.headMap.

The returned map will throw an IllegalArgumentException on an attempt to insert a key outside its range.

lastKey

back to summary

public K lastKey()

Implements java.util.SortedMap.lastKey.

Doc from java.util.SortedMap.lastKey.

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

put back to summary

public V put(K key, V value)

Overrides java.util.AbstractMap.put.

Implements java.util.Map.put.

Doc from java.util.Map.put.

remove back to summary

public V remove(Object o)

Overrides java.util.AbstractMap.remove.

Implements java.util.Map.remove.

Doc from java.util.Map.remove.

Returns the value to which this map previously associated the key, or null if the map contained no mapping for the key.

The map will not contain a mapping for the specified key once the call returns.

size back to summary

public int size()

Overrides java.util.AbstractMap.size.

Implements java.util.Map.size.

Doc from java.util.Map.size.

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

subMap back to summary

public SortedMap<K, V> subMap(K from, K to)

Implements java.util.SortedMap.subMap.

Doc from java.util.SortedMap.subMap.

The returned map will throw an IllegalArgumentException on an attempt to insert a key outside its range.

tailMap back to summary

public SortedMap<K, V> tailMap(K from)

Implements java.util.SortedMap.tailMap.

Doc from java.util.SortedMap.tailMap.

The returned map will throw an IllegalArgumentException on an attempt to insert a key outside its range.

toString back to summary

public String toString()

Overrides java.util.AbstractMap.toString.

Doc from java.util.AbstractMap.toString.

java.util back to summary

pack-priv Class ReverseOrderSortedMapView.ViewEntry<K, V>

Class Inheritance

extends Object
implements Map.Entry<K, V>

java.lang.Object
java.util.ReverseOrderSortedMapView.ViewEntry

All Implemented Interfaces

java.util.Map.Entry

Field Summary

Modifier and Type	Field and Description
pack-priv final K	key
pack-priv final Map<K, V>	map
pack-priv final V	value

Constructor Summary

Access	Constructor and Description
pack-priv	ViewEntry(Map<K, V> map, K key, V value)

Method Summary

Modifier and Type	Method and Description
public boolean	equals(Object o) Overrides java.lang.Object.equals. Implements java.util.Map.Entry.equals. Compares the specified object with this entry for equality.
public K	getKey() Implements java.util.Map.Entry.getKey. Returns the key corresponding to this entry.
public V	getValue() Implements java.util.Map.Entry.getValue. Returns the value corresponding to this entry.
public int	hashCode() Overrides java.lang.Object.hashCode. Implements java.util.Map.Entry.hashCode. Returns the hash code value for this map entry.
public V	setValue(V newValue) Implements java.util.Map.Entry.setValue. Replaces the value corresponding to this entry with the specified value (optional operation).
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.

Inherited from java.lang.Object:: clone finalize getClass notify notifyAll wait wait wait

Field Detail

key	back to summary
pack-priv final K key

map	back to summary
pack-priv final Map<K, V> map

value	back to summary
pack-priv final V value

Constructor Detail

ViewEntry	back to summary
pack-priv ViewEntry(Map<K, V> map, K key, V value)

Method Detail

equals back to summary

public boolean equals(Object o)

Overrides java.lang.Object.equals.

Implements java.util.Map.Entry.equals.

Doc from java.util.Map.Entry.equals.

Compares the specified object with this entry for equality. Returns true if the given object is also a map entry and the two entries represent the same mapping. More formally, two entries e1 and e2 represent the same mapping if

    (e1.getKey()==null ?
     e2.getKey()==null : e1.getKey().equals(e2.getKey()))  &&
    (e1.getValue()==null ?
     e2.getValue()==null : e1.getValue().equals(e2.getValue()))

This ensures that the equals method works properly across different implementations of the Map.Entry interface.

getKey

back to summary

public K getKey()

Implements java.util.Map.Entry.getKey.

Doc from java.util.Map.Entry.getKey.

Returns the key corresponding to this entry.

getValue back to summary

public V getValue()

Implements java.util.Map.Entry.getValue.

Doc from java.util.Map.Entry.getValue.

Returns the value corresponding to this entry. If the mapping has been removed from the backing map (by the iterator's remove operation), the results of this call are undefined.

hashCode back to summary

public int hashCode()

Overrides java.lang.Object.hashCode.

Implements java.util.Map.Entry.hashCode.

Doc from java.util.Map.Entry.hashCode.

Returns the hash code value for this map entry. The hash code of a map entry e is defined to be:

    (e.getKey()==null   ? 0 : e.getKey().hashCode()) ^
    (e.getValue()==null ? 0 : e.getValue().hashCode())

This ensures that e1.equals(e2) implies that e1.hashCode()==e2.hashCode() for any two Entries e1 and e2, as required by the general contract of Object.hashCode.

setValue back to summary

public V setValue(V newValue)

Implements java.util.Map.Entry.setValue.

Doc from java.util.Map.Entry.setValue.

Replaces the value corresponding to this entry with the specified value (optional operation). (Writes through to the map.) The behavior of this call is undefined if the mapping has already been removed from the map (by the iterator's remove operation).

toString back to summary

public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object. Satisfying this method's contract implies a non-null result must be returned.

pack-priv Class ReverseOrderSortedMapView<K, V>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

pack-priv Class ReverseOrderSortedMapView.Submap

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

pack-priv Class ReverseOrderSortedMapView.ViewEntry<K, V>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail