public static class Reference2ReferenceSortedMaps.SynchronizedSortedMap<K,V> extends Reference2ReferenceMaps.SynchronizedMap<K,V> implements Reference2ReferenceSortedMap<K,V>, java.io.Serializable
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 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()
Note that this specification strengthens the one given in
Map.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. |
compute, computeIfPresent, containsValue, equals, forEach, getOrDefault, hashCode, isEmpty, merge, putAll, putIfAbsent, remove, replace, replace, replaceAll, valuesapply, clear, containsKey, defaultReturnValue, defaultReturnValue, get, put, remove, size, toStringvaluesclear, containsKey, defaultReturnValue, defaultReturnValue, put, remove, sizegetpublic java.util.Comparator<? super K> comparator()
Reference2ReferenceSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
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.SynchronizedMap<K,V>Map.entrySet()public ObjectSortedSet<java.util.Map.Entry<K,V>> entrySet()
Note that this specification strengthens the one given in
Map.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>entrySet in class Reference2ReferenceMaps.SynchronizedMap<K,V>Map.entrySet()public ReferenceSortedSet<K> keySet()
Reference2ReferenceMap
Note that this specification strengthens the one given in
Map.keySet().
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.SynchronizedMap<K,V>Map.keySet()public Reference2ReferenceSortedMap<K,V> subMap(K from, K to)
Reference2ReferenceSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
public Reference2ReferenceSortedMap<K,V> headMap(K to)
Reference2ReferenceSortedMaptoKey.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
public Reference2ReferenceSortedMap<K,V> tailMap(K from)
Reference2ReferenceSortedMapfromKey.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).