public static class Reference2ReferenceSortedMaps.EmptySortedMap<K,V> extends Reference2ReferenceMaps.EmptyMap<K,V> implements Reference2ReferenceSortedMap<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.
Reference2ReferenceSortedMap.FastSortedEntrySet<K,V>
Reference2ReferenceMap.Entry<K,V>, Reference2ReferenceMap.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() |
Reference2ReferenceSortedMap<K,V> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey . |
ReferenceSortedSet<K> |
keySet() |
K |
lastKey() |
ObjectSortedSet<Reference2ReferenceMap.Entry<K,V>> |
reference2ReferenceEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
Reference2ReferenceSortedMap<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. |
Reference2ReferenceSortedMap<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, computeReferenceIfAbsentPartial, 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()
Reference2ReferenceSortedMap
comparator
in interface Reference2ReferenceSortedMap<K,V>
comparator
in interface java.util.SortedMap<K,V>
SortedMap.comparator()
public ObjectSortedSet<Reference2ReferenceMap.Entry<K,V>> reference2ReferenceEntrySet()
Reference2ReferenceMap
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).
reference2ReferenceEntrySet
in interface Reference2ReferenceMap<K,V>
reference2ReferenceEntrySet
in interface Reference2ReferenceSortedMap<K,V>
reference2ReferenceEntrySet
in class Reference2ReferenceMaps.EmptyMap<K,V>
Map.entrySet()
public ObjectSortedSet<java.util.Map.Entry<K,V>> entrySet()
entrySet
in interface Reference2ReferenceMap<K,V>
entrySet
in interface Reference2ReferenceSortedMap<K,V>
entrySet
in interface java.util.Map<K,V>
entrySet
in interface java.util.SortedMap<K,V>
Map.entrySet()
public ReferenceSortedSet<K> keySet()
Reference2ReferenceMap
keySet
in interface Reference2ReferenceMap<K,V>
keySet
in interface Reference2ReferenceSortedMap<K,V>
keySet
in interface java.util.Map<K,V>
keySet
in interface java.util.SortedMap<K,V>
keySet
in class Reference2ReferenceMaps.EmptyMap<K,V>
Map.keySet()
public Reference2ReferenceSortedMap<K,V> subMap(K from, K to)
Reference2ReferenceSortedMap
fromKey
, inclusive, to toKey
, exclusive.public Reference2ReferenceSortedMap<K,V> headMap(K to)
Reference2ReferenceSortedMap
toKey
.public Reference2ReferenceSortedMap<K,V> tailMap(K from)
Reference2ReferenceSortedMap
fromKey
.