public abstract class AbstractByte2ObjectSortedMap<V> extends AbstractByte2ObjectMap<V> implements Byte2ObjectSortedMap<V>
AbstractByte2ObjectMap.BasicEntry<V>, AbstractByte2ObjectMap.BasicEntrySet<V>
Byte2ObjectSortedMap.FastSortedEntrySet<V>
Byte2ObjectMap.Entry<V>, Byte2ObjectMap.FastEntrySet<V>
Modifier and Type | Method and Description |
---|---|
ByteSortedSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
ObjectCollection<V> |
values()
Returns a type-specific-set view of the values of this map.
|
containsKey, containsValue, equals, hashCode, isEmpty, putAll, toString
defaultReturnValue, defaultReturnValue
byte2ObjectEntrySet, comparator, entrySet, firstByteKey, firstKey, headMap, headMap, lastByteKey, lastKey, subMap, subMap, tailMap, tailMap
clear, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, containsKey, containsKey, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace, size
andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, apply, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort, get, put, remove
public ByteSortedSet 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 Byte2ObjectMap<V>
keySet
in interface Byte2ObjectSortedMap<V>
keySet
in interface java.util.Map<java.lang.Byte,V>
keySet
in interface java.util.SortedMap<java.lang.Byte,V>
keySet
in class AbstractByte2ObjectMap<V>
Map.keySet()
public ObjectCollection<V> 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 Byte2ObjectMap<V>
values
in interface Byte2ObjectSortedMap<V>
values
in interface java.util.Map<java.lang.Byte,V>
values
in interface java.util.SortedMap<java.lang.Byte,V>
values
in class AbstractByte2ObjectMap<V>
Map.values()