public static class Reference2ByteSortedMaps.SynchronizedSortedMap<K> extends Reference2ByteMaps.SynchronizedMap<K> implements Reference2ByteSortedMap<K>, Serializable
Reference2ByteSortedMap.FastSortedEntrySet<K>Reference2ByteMap.Entry<K>, Reference2ByteMap.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,Byte>> |
entrySet()
Deprecated.
Please use the corresponding type-specific method instead.
|
K |
firstKey() |
Reference2ByteSortedMap<K> |
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<Reference2ByteMap.Entry<K>> |
reference2ByteEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
Reference2ByteSortedMap<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. |
Reference2ByteSortedMap<K> |
tailMap(K from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
compute, computeByte, computeByteIfAbsent, computeByteIfAbsentPartial, computeByteIfPresent, computeIfAbsent, computeIfPresent, containsValue, containsValue, equals, forEach, getOrDefault, getOrDefault, hashCode, isEmpty, merge, mergeByte, putAll, putIfAbsent, putIfAbsent, remove, remove, replace, replace, replace, replace, replaceAll, valuesapply, applyAsInt, clear, containsKey, defaultReturnValue, defaultReturnValue, get, getByte, put, put, remove, removeByte, size, toStringvaluesclear, computeByte, computeByteIfAbsent, computeByteIfAbsentPartial, computeByteIfPresent, containsKey, containsValue, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, mergeByte, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace, sizeapplyAsInt, getByte, put, removeBytecompute, computeIfAbsent, computeIfPresent, equals, forEach, hashCode, isEmpty, putAll, replaceAllpublic Comparator<? super K> comparator()
Reference2ByteSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Reference2ByteSortedMap<K>comparator in interface SortedMap<K,Byte>SortedMap.comparator()public ObjectSortedSet<Reference2ByteMap.Entry<K>> reference2ByteEntrySet()
Reference2ByteMapThis 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).
reference2ByteEntrySet in interface Reference2ByteMap<K>reference2ByteEntrySet in interface Reference2ByteSortedMap<K>reference2ByteEntrySet in class Reference2ByteMaps.SynchronizedMap<K>Map.entrySet()@Deprecated public ObjectSortedSet<Map.Entry<K,Byte>> entrySet()
Note that this specification strengthens the one given in Map.entrySet().
entrySet in interface Reference2ByteMap<K>entrySet in interface Reference2ByteSortedMap<K>entrySet in interface Map<K,Byte>entrySet in interface SortedMap<K,Byte>entrySet in class Reference2ByteMaps.SynchronizedMap<K>Map.entrySet()public ReferenceSortedSet<K> keySet()
Reference2ByteMapNote that this specification strengthens the one given in Map.keySet().
keySet in interface Reference2ByteMap<K>keySet in interface Reference2ByteSortedMap<K>keySet in interface Map<K,Byte>keySet in interface SortedMap<K,Byte>keySet in class Reference2ByteMaps.SynchronizedMap<K>Map.keySet()public Reference2ByteSortedMap<K> subMap(K from, K to)
Reference2ByteSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Reference2ByteSortedMap<K>subMap in interface SortedMap<K,Byte>SortedMap.subMap(Object,Object)public Reference2ByteSortedMap<K> headMap(K to)
Reference2ByteSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Reference2ByteSortedMap<K>headMap in interface SortedMap<K,Byte>SortedMap.headMap(Object)public Reference2ByteSortedMap<K> tailMap(K from)
Reference2ByteSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Reference2ByteSortedMap<K>tailMap in interface SortedMap<K,Byte>SortedMap.tailMap(Object)