public abstract class AbstractReference2ByteSortedMap<K> extends AbstractReference2ByteMap<K> implements Reference2ByteSortedMap<K>
AbstractReference2ByteMap.BasicEntry<K>Reference2ByteSortedMap.FastSortedEntrySet<K>Reference2ByteMap.Entry<K>, Reference2ByteMap.FastEntrySet<K>| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Map.Entry<K,Byte>> |
entrySet()
Returns a set view of the mappings contained in this map.
|
ReferenceSortedSet<K> |
keySet()
Returns a type-specific-sorted-set view of the keys of this map.
|
ByteCollection |
values()
Returns a type-specific collection view of the values contained in this
map.
|
containsKey, containsValue, containsValue, equals, hashCode, isEmpty, putAll, toStringclear, defaultReturnValue, defaultReturnValue, get, put, put, remove, removeBytecomparator, headMap, reference2ByteEntrySet, subMap, tailMapcontainsValuedefaultReturnValue, defaultReturnValue, getByte, put, removeByteclear, containsKey, get, put, remove, sizeclear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, sizepublic ReferenceSortedSet<K> keySet()
The view is backed by the sorted set returned by 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 Map<K,Byte>keySet in interface SortedMap<K,Byte>keySet in class AbstractReference2ByteMap<K>Map.keySet()public ByteCollection values()
The view is backed by the sorted set returned by 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 Map<K,Byte>values in interface SortedMap<K,Byte>values in class AbstractReference2ByteMap<K>Map.values()public ObjectSortedSet<Map.Entry<K,Byte>> entrySet()
Reference2ByteMap
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 AbstractReference2ByteMap<K>Map.entrySet()