public static class Object2ReferenceSortedMaps.EmptySortedMap<K,V> extends Object2ReferenceMaps.EmptyMap<K,V> implements Object2ReferenceSortedMap<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.
Object2ReferenceSortedMap.FastSortedEntrySet<K,V>
Object2ReferenceMap.Entry<K,V>, Object2ReferenceMap.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() |
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() |
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 . |
clone, containsValue, equals, hashCode, isEmpty, putAll, toString, values
clear, containsKey, defaultReturnValue, defaultReturnValue, get, size
put, remove
values
defaultReturnValue, defaultReturnValue
public java.util.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 java.util.SortedMap<K,V>
SortedMap.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 Object2ReferenceMap.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.EmptyMap<K,V>
Object2ReferenceMap.entrySet()
public ObjectSortedSet<java.util.Map.Entry<K,V>> entrySet()
Object2ReferenceMap
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 java.util.Map<K,V>
entrySet
in interface java.util.SortedMap<K,V>
entrySet
in class Object2ReferenceMaps.EmptyMap<K,V>
Map.entrySet()
public ObjectSortedSet<K> keySet()
Object2ReferenceMap
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 java.util.Map<K,V>
keySet
in interface java.util.SortedMap<K,V>
keySet
in class Object2ReferenceMaps.EmptyMap<K,V>
Map.keySet()
public Object2ReferenceSortedMap<K,V> subMap(K from, K to)
Object2ReferenceSortedMap
fromKey
, inclusive, to toKey
, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object)
.
public Object2ReferenceSortedMap<K,V> headMap(K to)
Object2ReferenceSortedMap
toKey
.
Note that this specification strengthens the one given in SortedMap.headMap(Object)
.
public Object2ReferenceSortedMap<K,V> tailMap(K from)
Object2ReferenceSortedMap
fromKey
.
Note that this specification strengthens the one given in SortedMap.tailMap(Object)
.