public static class Object2ObjectSortedMaps.EmptySortedMap<K,V> extends Object2ObjectMaps.EmptyMap<K,V> implements Object2ObjectSortedMap<K,V>, java.io.Serializable, java.lang.Cloneable
This class may be useful to implement your own in case you subclass a type-specific sorted map.
Object2ObjectSortedMap.FastSortedEntrySet<K,V>
Object2ObjectMap.Entry<K,V>, Object2ObjectMap.FastEntrySet<K,V>
Modifier and Type | Method and Description |
---|---|
java.util.Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
ObjectSortedSet<java.util.Map.Entry<K,V>> |
entrySet()
Returns a sorted-set view of the mappings contained in this map.
|
K |
firstKey() |
Object2ObjectSortedMap<K,V> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey . |
ObjectSortedSet<K> |
keySet() |
K |
lastKey() |
ObjectSortedSet<Object2ObjectMap.Entry<K,V>> |
object2ObjectEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
Object2ObjectSortedMap<K,V> |
subMap(K from,
K to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Object2ObjectSortedMap<K,V> |
tailMap(K from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
clone, containsValue, equals, forEach, getOrDefault, hashCode, isEmpty, putAll, toString, values
clear, containsKey, defaultReturnValue, defaultReturnValue, get, size
values
clear, compute, computeIfAbsent, computeIfPresent, computeObjectIfAbsentPartial, containsKey, defaultReturnValue, defaultReturnValue, forEach, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace, size
andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort, get
public java.util.Comparator<? super K> comparator()
Object2ObjectSortedMap
comparator
in interface Object2ObjectSortedMap<K,V>
comparator
in interface java.util.SortedMap<K,V>
SortedMap.comparator()
public ObjectSortedSet<Object2ObjectMap.Entry<K,V>> object2ObjectEntrySet()
Object2ObjectMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Map.entrySet()
so that it returns an ObjectSet
of type-specific entries (the latter makes it possible to
access keys and values with type-specific methods).
object2ObjectEntrySet
in interface Object2ObjectMap<K,V>
object2ObjectEntrySet
in interface Object2ObjectSortedMap<K,V>
object2ObjectEntrySet
in class Object2ObjectMaps.EmptyMap<K,V>
Map.entrySet()
public ObjectSortedSet<java.util.Map.Entry<K,V>> entrySet()
entrySet
in interface Object2ObjectMap<K,V>
entrySet
in interface Object2ObjectSortedMap<K,V>
entrySet
in interface java.util.Map<K,V>
entrySet
in interface java.util.SortedMap<K,V>
Map.entrySet()
public ObjectSortedSet<K> keySet()
Object2ObjectMap
keySet
in interface Object2ObjectMap<K,V>
keySet
in interface Object2ObjectSortedMap<K,V>
keySet
in interface java.util.Map<K,V>
keySet
in interface java.util.SortedMap<K,V>
keySet
in class Object2ObjectMaps.EmptyMap<K,V>
Map.keySet()
public Object2ObjectSortedMap<K,V> subMap(K from, K to)
Object2ObjectSortedMap
fromKey
, inclusive, to toKey
, exclusive.public Object2ObjectSortedMap<K,V> headMap(K to)
Object2ObjectSortedMap
toKey
.public Object2ObjectSortedMap<K,V> tailMap(K from)
Object2ObjectSortedMap
fromKey
.