| Added Methods |
(Entry<K, V>) ceilingEntry(K)
|
|
K ceilingKey(K)
|
|
ImmutableSortedSet<K> descendingKeySet()
|
|
(ImmutableSortedMap<K, V>) descendingMap()
|
|
(Entry<K, V>) firstEntry()
|
|
(Entry<K, V>) floorEntry(K)
|
|
K floorKey(K)
|
|
(ImmutableSortedMap<K, V>) headMap(K, boolean)
|
This method returns a {@code ImmutableSortedMap}, consisting of the entries
whose keys are less than (or equal to, if {@code inclusive}) {@code toKey}. |
(Entry<K, V>) higherEntry(K)
|
|
K higherKey(K)
|
|
(Entry<K, V>) lastEntry()
|
|
(Entry<K, V>) lowerEntry(K)
|
|
K lowerKey(K)
|
|
ImmutableSortedSet<K> navigableKeySet()
|
|
(Entry<K, V>) pollFirstEntry()
|
|
(Entry<K, V>) pollLastEntry()
|
|
(ImmutableSortedMap<K, V>) subMap(K, boolean, K, boolean)
|
This method returns a {@code ImmutableSortedMap}, consisting of the entries
whose keys ranges from {@code fromKey} to {@code toKey}, inclusive or
exclusive as indicated by the boolean flags. |
(ImmutableSortedMap<K, V>) tailMap(K, boolean)
|
This method returns a {@code ImmutableSortedMap}, consisting of the entries
whose keys are greater than (or equal to, if {@code inclusive})
{@code fromKey}. |