public abstract class AbstractReference2ByteSortedMap<K> extends AbstractReference2ByteMap<K> implements Reference2ByteSortedMap<K>
AbstractReference2ByteMap.BasicEntry<K>, AbstractReference2ByteMap.BasicEntrySet<K>
Reference2ByteSortedMap.FastSortedEntrySet<K>
Reference2ByteMap.Entry<K>, Reference2ByteMap.FastEntrySet<K>
Modifier and Type | Method and Description |
---|---|
ReferenceSortedSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
ByteCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsKey, containsValue, equals, hashCode, isEmpty, putAll, toString
defaultReturnValue, defaultReturnValue
comparator, entrySet, headMap, reference2ByteEntrySet, subMap, tailMap
clear, computeByte, computeByteIfAbsent, computeByteIfAbsentPartial, computeByteIfPresent, computeIfAbsent, computeIfAbsent, containsKey, containsValue, containsValue, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, merge, mergeByte, mergeByte, mergeByte, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace, size
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsInt, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort, getByte, put, removeByte
public ReferenceSortedSet<K> keySet()
The view is backed by the set returned by Map.entrySet()
. Note that
no attempt is made at caching the result of this method, as this would
require adding some attributes that lightweight implementations would
not need. Subclasses may easily override this policy by calling
this method and caching the result, but implementors are encouraged to
write more efficient ad-hoc implementations.
The view is backed by the sorted set returned by Map.entrySet()
. Note that
no attempt is made at caching the result of this method, as this would
require adding some attributes that lightweight implementations would
not need. Subclasses may easily override this policy by calling
this method and caching the result, but implementors are encouraged to
write more efficient ad-hoc implementations.
keySet
in interface Reference2ByteMap<K>
keySet
in interface Reference2ByteSortedMap<K>
keySet
in interface java.util.Map<K,java.lang.Byte>
keySet
in interface java.util.SortedMap<K,java.lang.Byte>
keySet
in class AbstractReference2ByteMap<K>
Map.keySet()
public ByteCollection values()
The view is backed by the set returned by Map.entrySet()
. Note that
no attempt is made at caching the result of this method, as this would
require adding some attributes that lightweight implementations would
not need. Subclasses may easily override this policy by calling
this method and caching the result, but implementors are encouraged to
write more efficient ad-hoc implementations.
The view is backed by the sorted set returned by Map.entrySet()
. Note that
no attempt is made at caching the result of this method, as this would
require adding some attributes that lightweight implementations would
not need. Subclasses may easily override this policy by calling
this method and caching the result, but implementors are encouraged to
write more efficient ad-hoc implementations.
values
in interface Reference2ByteMap<K>
values
in interface Reference2ByteSortedMap<K>
values
in interface java.util.Map<K,java.lang.Byte>
values
in interface java.util.SortedMap<K,java.lang.Byte>
values
in class AbstractReference2ByteMap<K>
Map.values()