Works exactly the same way as SetTransformingSortedMap, but also implements NavigableMap as well.
| public | SetTransformingNavigableMap( Creates a new instance with the given set. |
| public | SetTransformingNavigableMap( Creates a new instance with the given set and comparator. |
| public Entry< | ceilingEntry( 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. |
| public K | ceilingKey( Returns the least key greater than or equal to the given key,
or null if there is no such key. |
| public NavigableSet< | Returns a reverse order NavigableSet view of the keys contained in this map. |
| public NavigableMap< | Returns a reverse order view of the mappings contained in this map. |
| public Entry< | Returns a key-value mapping associated with the least
key in this map, or null if the map is empty. |
| public K | firstKey() Returns the first (lowest) key currently in this map. |
| public Entry< | floorEntry( 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. |
| public K | floorKey( Returns the greatest key less than or equal to the given key,
or null if there is no such key. |
| public SortedMap< | headMap( Returns a view of the portion of this map whose keys are strictly less than toKey.
|
| public NavigableMap< | headMap( Returns a view of the portion of this map whose keys are less than (or
equal to, if inclusive is true) toKey. |
| public Entry< | higherEntry( Returns a key-value mapping associated with the least key
strictly greater than the given key, or null if there
is no such key. |
| public K | higherKey( Returns the least key strictly greater than the given key, or
null if there is no such key. |
| public Entry< | Returns a key-value mapping associated with the greatest
key in this map, or null if the map is empty. |
| public K | lastKey() Returns the last (highest) key currently in this map. |
| public Entry< | lowerEntry( Returns a key-value mapping associated with the greatest key
strictly less than the given key, or null if there is
no such key. |
| public K | lowerKey( Returns the greatest key strictly less than the given key, or
null if there is no such key. |
| public NavigableSet< | Returns a NavigableSet view of the keys contained in this map. |
| public Entry< | Removes and returns a key-value mapping associated with
the least key in this map, or null if the map is empty. |
| public Entry< | Removes and returns a key-value mapping associated with
the greatest key in this map, or null if the map is empty. |
| public SortedMap< | subMap( Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey,
exclusive.
|
| public NavigableMap< | subMap( Returns a view of the portion of this map whose keys range from
fromKey to toKey. |
| public SortedMap< | tailMap( Returns a view of the portion of this map whose keys are greater than or equal to fromKey.
|
| public NavigableMap< | tailMap( Returns a view of the portion of this map whose keys are greater than (or
equal to, if inclusive is true) fromKey. |
From: SetTransformingSortedMap< |
From: SetTransformingMap< |
From: SortedMap< |
From: AbstractMap< |
From: Map< |
From: Object |
null if
there is no such key.key, or null if there is no such keynull if there is no such key.key,
or null if there is no such key
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.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.
null if the map is empty.null if this map is emptynull if there
is no such key.key, or null if there is no such keynull if there is no such key.key,
or null if there is no such keytoKey.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.
Equivalent to headMap(toKey, false).
toKeyinclusive is true) 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.
true if the high endpoint
is to be included in the returned viewinclusive is true) toKeynull if there
is no such key.key,
or null if there is no such keynull if there is no such key.key,
or null if there is no such keynull if the map is empty.null if this map is emptynull if there is
no such key.key,
or null if there is no such keynull if there is no such key.key,
or null if there is no such keynull if the map is empty.null if this map is emptynull if the map is empty.null if this map is emptyfromKey, 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.
Equivalent to subMap(fromKey, true, toKey, false).
fromKey, inclusive, to toKey,
exclusivefromKey to toKey. If fromKey and
toKey are equal, the returned map is empty unless
fromInclusive and toInclusive are both true. 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 of its range, or to construct a
submap either of whose endpoints lie outside its range.
true if the low endpoint
is to be included in the returned viewtrue if the high endpoint
is to be included in the returned viewfromKey to toKeyfromKey.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.
Equivalent to tailMap(fromKey, true).
fromKeyinclusive is true) 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.
true if the low endpoint
is to be included in the returned viewinclusive is true) fromKey