@GwtCompatible(emulated=true) final class RegularImmutableSortedMap<K,V> extends ImmutableSortedMap<K,V>
Modifier and Type | Class and Description |
---|---|
private class |
RegularImmutableSortedMap.EntrySet |
ImmutableSortedMap.Builder<K,V>
Modifier and Type | Field and Description |
---|---|
private RegularImmutableSortedSet<K> |
keySet |
private ImmutableList<V> |
valueList |
Constructor and Description |
---|
RegularImmutableSortedMap(RegularImmutableSortedSet<K> keySet,
ImmutableList<V> valueList) |
RegularImmutableSortedMap(RegularImmutableSortedSet<K> keySet,
ImmutableList<V> valueList,
ImmutableSortedMap<K,V> descendingMap) |
Modifier and Type | Method and Description |
---|---|
(package private) ImmutableSortedMap<K,V> |
createDescendingMap() |
(package private) ImmutableSet<java.util.Map.Entry<K,V>> |
createEntrySet() |
V |
get(java.lang.Object key) |
private ImmutableSortedMap<K,V> |
getSubMap(int fromIndex,
int toIndex) |
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 . |
ImmutableSortedSet<K> |
keySet()
Returns an immutable sorted set of the keys in this map.
|
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 . |
ImmutableCollection<V> |
values()
Returns an immutable collection of the values in this map, sorted by the
ordering of the corresponding keys.
|
ceilingEntry, ceilingKey, comparator, containsValue, copyOf, copyOf, copyOfSorted, descendingKeySet, descendingMap, emptyMap, entrySet, firstEntry, firstKey, floorEntry, floorKey, from, fromEntries, fromSortedEntries, headMap, higherEntry, higherKey, isPartialView, lastEntry, lastKey, lowerEntry, lowerKey, naturalOrder, navigableKeySet, of, of, of, of, of, of, orderedBy, pollFirstEntry, pollLastEntry, reverseOrder, size, subMap, subMap, tailMap, writeReplace
builder
asMultimap, checkNoConflict, clear, containsKey, createKeySet, entryOf, equals, hashCode, isEmpty, put, putAll, remove, toString
private final transient RegularImmutableSortedSet<K> keySet
private final transient ImmutableList<V> valueList
RegularImmutableSortedMap(RegularImmutableSortedSet<K> keySet, ImmutableList<V> valueList)
RegularImmutableSortedMap(RegularImmutableSortedSet<K> keySet, ImmutableList<V> valueList, ImmutableSortedMap<K,V> descendingMap)
ImmutableSet<java.util.Map.Entry<K,V>> createEntrySet()
createEntrySet
in class ImmutableMap<K,V>
public ImmutableSortedSet<K> keySet()
ImmutableSortedMap
public ImmutableCollection<V> values()
ImmutableSortedMap
public V get(@Nullable java.lang.Object key)
private ImmutableSortedMap<K,V> getSubMap(int fromIndex, int toIndex)
public ImmutableSortedMap<K,V> headMap(K toKey, boolean inclusive)
ImmutableSortedMap
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
.
public ImmutableSortedMap<K,V> tailMap(K fromKey, boolean inclusive)
ImmutableSortedMap
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
.
ImmutableSortedMap<K,V> createDescendingMap()
createDescendingMap
in class ImmutableSortedMap<K,V>