public abstract class AbstractByte2ReferenceSortedMap<V> extends AbstractByte2ReferenceMap<V> implements Byte2ReferenceSortedMap<V>
AbstractByte2ReferenceMap.BasicEntry<V>, AbstractByte2ReferenceMap.BasicEntrySet<V>Byte2ReferenceSortedMap.FastSortedEntrySet<V>Byte2ReferenceMap.Entry<V>, Byte2ReferenceMap.FastEntrySet<V>| Modifier and Type | Method and Description |
|---|---|
ByteSortedSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
ReferenceCollection<V> |
values()
Returns a type-specific-set view of the values of this map.
|
containsKey, containsValue, equals, hashCode, isEmpty, putAll, toStringdefaultReturnValue, defaultReturnValuebyte2ReferenceEntrySet, comparator, entrySet, firstByteKey, firstKey, headMap, headMap, lastByteKey, lastKey, subMap, subMap, tailMap, tailMapclear, compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsKey, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace, sizeapply, get, put, removecontainsValue, equals, forEach, hashCode, isEmpty, putAll, replaceAllpublic 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 Byte2ReferenceMap<V>keySet in interface Byte2ReferenceSortedMap<V>keySet in interface Map<Byte,V>keySet in interface SortedMap<Byte,V>keySet in class AbstractByte2ReferenceMap<V>Map.keySet()public ReferenceCollection<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 Byte2ReferenceMap<V>values in interface Byte2ReferenceSortedMap<V>values in interface Map<Byte,V>values in interface SortedMap<Byte,V>values in class AbstractByte2ReferenceMap<V>Map.values()