public abstract class AbstractByte2ReferenceSortedMap<V> extends AbstractByte2ReferenceMap<V> implements Byte2ReferenceSortedMap<V>
AbstractByte2ReferenceMap.BasicEntry<V>Byte2ReferenceSortedMap.FastSortedEntrySet<V>Byte2ReferenceMap.Entry<V>, Byte2ReferenceMap.FastEntrySet<V>| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Map.Entry<Byte,V>> |
entrySet()
Returns a set view of the mappings contained in this map.
|
Byte |
firstKey()
Delegates to the corresponding type-specific method.
|
Byte2ReferenceSortedMap<V> |
headMap(Byte to)
Delegates to the corresponding type-specific method.
|
ByteSortedSet |
keySet()
Returns a type-specific-sorted-set view of the keys of this map.
|
Byte |
lastKey()
Delegates to the corresponding type-specific method.
|
Byte2ReferenceSortedMap<V> |
subMap(Byte from,
Byte to)
Delegates to the corresponding type-specific method.
|
Byte2ReferenceSortedMap<V> |
tailMap(Byte from)
Delegates to the corresponding type-specific method.
|
ReferenceCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map.
|
containsKey, containsValue, equals, hashCode, isEmpty, putAll, toStringclear, containsKey, defaultReturnValue, defaultReturnValue, get, put, put, remove, removebyte2ReferenceEntrySet, comparator, firstByteKey, headMap, lastByteKey, subMap, tailMapcontainsKey, defaultReturnValue, defaultReturnValue, get, put, removeclear, 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 Byte2ReferenceSortedMap<V> headMap(Byte to)
headMap in interface Byte2ReferenceSortedMap<V>headMap in interface SortedMap<Byte,V>SortedMap.headMap(Object)public Byte2ReferenceSortedMap<V> tailMap(Byte from)
tailMap in interface Byte2ReferenceSortedMap<V>tailMap in interface SortedMap<Byte,V>SortedMap.tailMap(Object)public Byte2ReferenceSortedMap<V> subMap(Byte from, Byte to)
subMap in interface Byte2ReferenceSortedMap<V>subMap in interface SortedMap<Byte,V>SortedMap.subMap(Object,Object)public Byte firstKey()
public Byte lastKey()
public ByteSortedSet 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 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 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 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()public ObjectSortedSet<Map.Entry<Byte,V>> entrySet()
Byte2ReferenceMapNote that this specification strengthens the one given in Map.entrySet().
entrySet in interface Byte2ReferenceMap<V>entrySet in interface Byte2ReferenceSortedMap<V>entrySet in interface Map<Byte,V>entrySet in interface SortedMap<Byte,V>entrySet in class AbstractByte2ReferenceMap<V>Map.entrySet()