public abstract class AbstractByte2IntSortedMap extends AbstractByte2IntMap implements Byte2IntSortedMap
| Modifier and Type | Class and Description |
|---|---|
protected class |
AbstractByte2IntSortedMap.KeySet
A wrapper exhibiting the keys of a map.
|
protected static class |
AbstractByte2IntSortedMap.KeySetIterator
A wrapper exhibiting a map iterator as an iterator on keys.
|
protected class |
AbstractByte2IntSortedMap.ValuesCollection
A wrapper exhibiting the values of a map.
|
protected static class |
AbstractByte2IntSortedMap.ValuesIterator
A wrapper exhibiting a map iterator as an iterator on values.
|
AbstractByte2IntMap.BasicEntry, AbstractByte2IntMap.BasicEntrySetByte2IntSortedMap.FastSortedEntrySetByte2IntMap.Entry, Byte2IntMap.FastEntrySetdefRetValue| Modifier | Constructor and Description |
|---|---|
protected |
AbstractByte2IntSortedMap() |
| Modifier and Type | Method and Description |
|---|---|
ByteSortedSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
IntCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsKey, containsValue, equals, hashCode, isEmpty, putAll, toStringdefaultReturnValue, defaultReturnValueclone, finalize, getClass, notify, notifyAll, wait, wait, waitbyte2IntEntrySet, comparator, entrySet, firstByteKey, firstKey, headMap, headMap, lastByteKey, lastKey, subMap, subMap, tailMap, tailMapclear, compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsKey, containsValue, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace, sizeapplyAsInt, get, put, removeandThen, compose, identitypublic 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 Byte2IntMapkeySet in interface Byte2IntSortedMapkeySet in interface Map<Byte,Integer>keySet in interface SortedMap<Byte,Integer>keySet in class AbstractByte2IntMapMap.keySet()public IntCollection 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 Byte2IntMapvalues in interface Byte2IntSortedMapvalues in interface Map<Byte,Integer>values in interface SortedMap<Byte,Integer>values in class AbstractByte2IntMapMap.values()Copyright © 2020. All rights reserved.