public static class Reference2CharSortedMaps.EmptySortedMap<K> extends Reference2CharMaps.EmptyMap<K> implements Reference2CharSortedMap<K>, Serializable, Cloneable
This class may be useful to implement your own in case you subclass a type-specific sorted map.
Reference2CharSortedMap.FastSortedEntrySet<K>Reference2CharMap.Entry<K>, Reference2CharMap.FastEntrySet<K>| 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,Character>> |
entrySet()
Deprecated.
Please use the corresponding type-specific method
instead.
|
K |
firstKey()
Returns the first (lowest) key currently in this map.
|
Reference2CharSortedMap<K> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
ReferenceSortedSet<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<Reference2CharMap.Entry<K>> |
reference2CharEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
Reference2CharSortedMap<K> |
subMap(K from,
K to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Reference2CharSortedMap<K> |
tailMap(K from)
Returns a view of the portion of this sorted map whose keys are greater
than or equal to
fromKey. |
clone, containsValue, containsValue, equals, hashCode, isEmpty, putAll, toString, valuesclear, containsKey, defaultReturnValue, defaultReturnValue, getChar, sizevaluesclear, computeChar, computeCharIfAbsent, computeCharIfAbsentPartial, computeCharIfPresent, containsKey, containsValue, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, mergeChar, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace, sizeapplyAsInt, getChar, put, removeCharcompute, computeIfAbsent, computeIfPresent, equals, forEach, hashCode, isEmpty, putAll, replaceAllpublic Comparator<? super K> comparator()
Reference2CharSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Reference2CharSortedMap<K>comparator in interface SortedMap<K,Character>null if this map uses the natural ordering
of its keysSortedMap.comparator()public ObjectSortedSet<Reference2CharMap.Entry<K>> reference2CharEntrySet()
Reference2CharMap
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).
reference2CharEntrySet in interface Reference2CharMap<K>reference2CharEntrySet in interface Reference2CharSortedMap<K>reference2CharEntrySet in class Reference2CharMaps.EmptyMap<K>Map.entrySet()@Deprecated public ObjectSortedSet<Map.Entry<K,Character>> entrySet()
Note that this specification strengthens the one given in the corresponding type-specific unsorted map.
entrySet in interface Reference2CharMap<K>entrySet in interface Reference2CharSortedMap<K>entrySet in interface Map<K,Character>entrySet in interface SortedMap<K,Character>SortedMap.entrySet()public ReferenceSortedSet<K> keySet()
Reference2CharMapSet 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 Reference2CharMap<K>keySet in interface Reference2CharSortedMap<K>keySet in interface Map<K,Character>keySet in interface SortedMap<K,Character>keySet in class Reference2CharMaps.EmptyMap<K>Map.keySet()public Reference2CharSortedMap<K> subMap(K from, K to)
Reference2CharSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
subMap in interface Reference2CharSortedMap<K>subMap in interface SortedMap<K,Character>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 Reference2CharSortedMap<K> headMap(K to)
Reference2CharSortedMaptoKey.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
headMap in interface Reference2CharSortedMap<K>headMap in interface SortedMap<K,Character>to - high endpoint (exclusive) of the keys in the returned maptoKeySortedMap.headMap(Object)public Reference2CharSortedMap<K> tailMap(K from)
Reference2CharSortedMapfromKey.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).
tailMap in interface Reference2CharSortedMap<K>tailMap in interface SortedMap<K,Character>from - low endpoint (inclusive) of the keys in the returned mapfromKeySortedMap.tailMap(Object)public K firstKey()
java.util.SortedMap