public static class Object2ReferenceSortedMaps.Singleton<K,V> extends Object2ReferenceMaps.Singleton<K,V> implements Object2ReferenceSortedMap<K,V>, Serializable, Cloneable
This class may be useful to implement your own in case you subclass a type-specific sorted map.
Object2ReferenceSortedMap.FastSortedEntrySet<K,V>Object2ReferenceMap.Entry<K,V>, Object2ReferenceMap.FastEntrySet<K,V>| Modifier and Type | Method and Description |
|---|---|
Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
ObjectSortedSet<Map.Entry<K,V>> |
entrySet()
Returns a set view of the mappings contained in this map.
|
K |
firstKey()
Returns the first (lowest) key currently in this map.
|
Object2ReferenceSortedMap<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()
Returns a
Set view of the keys contained in this map. |
K |
lastKey()
Returns the last (highest) key currently in this map.
|
ObjectSortedSet<Object2ReferenceMap.Entry<K,V>> |
object2ReferenceEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
Object2ReferenceSortedMap<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. |
Object2ReferenceSortedMap<K,V> |
tailMap(K from)
Returns a view of the portion of this sorted map whose keys are greater
than or equal to
fromKey. |
containsValue, equals, hashCode, isEmpty, putAll, toString, valuesclone, containsKey, get, sizedefaultReturnValue, defaultReturnValuevaluesclear, containsKey, defaultReturnValue, defaultReturnValue, put, remove, sizegetcompute, computeIfAbsent, computeIfPresent, containsValue, equals, forEach, get, getOrDefault, hashCode, isEmpty, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Comparator<? super K> comparator()
Object2ReferenceSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Object2ReferenceSortedMap<K,V>comparator in interface SortedMap<K,V>null if this map uses the natural ordering
of its keysSortedMap.comparator()public ObjectSortedSet<Object2ReferenceMap.Entry<K,V>> object2ReferenceEntrySet()
Object2ReferenceMap
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).
object2ReferenceEntrySet in interface Object2ReferenceMap<K,V>object2ReferenceEntrySet in interface Object2ReferenceSortedMap<K,V>object2ReferenceEntrySet in class Object2ReferenceMaps.Singleton<K,V>Map.entrySet()public ObjectSortedSet<Map.Entry<K,V>> entrySet()
Note that this specification strengthens the one given in
Map.entrySet().
entrySet in interface Object2ReferenceMap<K,V>entrySet in interface Object2ReferenceSortedMap<K,V>entrySet in interface Map<K,V>entrySet in interface SortedMap<K,V>entrySet in class Object2ReferenceMaps.Singleton<K,V>Map.entrySet()public ObjectSortedSet<K> keySet()
Object2ReferenceMapSet view of the keys contained in this map.
The set is backed by the map, so changes to the map are
reflected in the set, and vice-versa. If the map is modified
while an iteration over the set is in progress (except through
the iterator's own 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.
Note that this specification strengthens the one given in
Map.keySet().
keySet in interface Object2ReferenceMap<K,V>keySet in interface Object2ReferenceSortedMap<K,V>keySet in interface Map<K,V>keySet in interface SortedMap<K,V>keySet in class Object2ReferenceMaps.Singleton<K,V>Map.keySet()public Object2ReferenceSortedMap<K,V> subMap(K from, K to)
Object2ReferenceSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
subMap in interface Object2ReferenceSortedMap<K,V>subMap in interface SortedMap<K,V>from - low endpoint (inclusive) of the keys in the returned mapto - high endpoint (exclusive) of the keys in the returned mapfromKey, inclusive, to toKey, exclusiveSortedMap.subMap(Object,Object)public Object2ReferenceSortedMap<K,V> headMap(K to)
Object2ReferenceSortedMaptoKey.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
headMap in interface Object2ReferenceSortedMap<K,V>headMap in interface SortedMap<K,V>to - high endpoint (exclusive) of the keys in the returned maptoKeySortedMap.headMap(Object)public Object2ReferenceSortedMap<K,V> tailMap(K from)
Object2ReferenceSortedMapfromKey.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).
tailMap in interface Object2ReferenceSortedMap<K,V>tailMap in interface SortedMap<K,V>from - low endpoint (inclusive) of the keys in the returned mapfromKeySortedMap.tailMap(Object)public K firstKey()
java.util.SortedMap