public class Byte2ShortRBTreeMap extends AbstractByte2ShortSortedMap implements Serializable, Cloneable
The iterators provided by the views of this class are type-specific
bidirectional
iterators. Moreover, the iterator returned by iterator() can be
safely cast to a type-specific list
iterator.
AbstractByte2ShortMap.BasicEntryByte2ShortSortedMap.FastSortedEntrySetByte2ShortMap.FastEntrySet| Constructor and Description |
|---|
Byte2ShortRBTreeMap()
Creates a new empty tree map.
|
Byte2ShortRBTreeMap(byte[] k,
short[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Byte2ShortRBTreeMap(byte[] k,
short[] v,
Comparator<? super Byte> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Byte2ShortRBTreeMap(Byte2ShortMap m)
Creates a new tree map copying a given map.
|
Byte2ShortRBTreeMap(Byte2ShortSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Byte2ShortRBTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2ShortRBTreeMap(Map<? extends Byte,? extends Short> m)
Creates a new tree map copying a given map.
|
Byte2ShortRBTreeMap(SortedMap<Byte,Short> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
short |
addTo(byte k,
short incr)
Adds an increment to value currently associated with a key.
|
ObjectSortedSet<Byte2ShortMap.Entry> |
byte2ShortEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Byte2ShortRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
ByteComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
boolean |
containsKey(byte k)
Checks whether the given value is contained in
AbstractByte2ShortMap.keySet(). |
boolean |
containsValue(short v)
Checks whether the given value is contained in
AbstractByte2ShortMap.values(). |
byte |
firstByteKey() |
short |
get(byte k)
Returns the value to which the given key is mapped.
|
Byte2ShortSortedMap |
headMap(byte to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
boolean |
isEmpty() |
ByteSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this
map.
|
byte |
lastByteKey() |
short |
put(byte k,
short v)
Adds a pair to the map.
|
Short |
put(Byte ok,
Short ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
short |
remove(byte k)
Removes the mapping with the given key.
|
Short |
remove(Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Byte2ShortSortedMap |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Byte2ShortSortedMap |
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater
than or equal to
fromKey. |
ShortCollection |
values()
Returns a type-specific collection view of the values contained in this
map.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Byte2ShortRBTreeMap()
public Byte2ShortRBTreeMap(Comparator<? super Byte> c)
c - a (possibly type-specific) comparator.public Byte2ShortRBTreeMap(Map<? extends Byte,? extends Short> m)
m - a Map to be copied into the new tree map.public Byte2ShortRBTreeMap(SortedMap<Byte,Short> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Byte2ShortRBTreeMap(Byte2ShortMap m)
m - a type-specific map to be copied into the new tree map.public Byte2ShortRBTreeMap(Byte2ShortSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Byte2ShortRBTreeMap(byte[] k,
short[] v,
Comparator<? super Byte> c)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.c - a (possibly type-specific) comparator.IllegalArgumentException - if k and v have different lengths.public Byte2ShortRBTreeMap(byte[] k,
short[] v)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.IllegalArgumentException - if k and v have different lengths.public short addTo(byte k,
short incr)
Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
k - the key.incr - the increment.public short put(byte k,
short v)
Byte2ShortFunctionput in interface Byte2ShortFunctionput in class AbstractByte2ShortFunctionk - the key.v - the value.Function.put(Object,Object)public short remove(byte k)
Byte2ShortFunctionremove in interface Byte2ShortFunctionremove in class AbstractByte2ShortFunctionk - the key.Function.remove(Object)@Deprecated public Short put(Byte ok, Short ov)
null on a missing key.
This method must check whether the provided key is in the map using
containsKey(). Thus, it probes the map twice.
Implementors of subclasses should override it with a more efficient
method.
@Deprecated public Short remove(Object ok)
null on a missing key.
This method must check whether the provided key is in the map using
containsKey(). Thus, it probes the map twice.
Implementors of subclasses should override it with a more efficient
method.
public boolean containsValue(short v)
AbstractByte2ShortMapAbstractByte2ShortMap.values().containsValue in interface Byte2ShortMapcontainsValue in class AbstractByte2ShortMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(byte k)
AbstractByte2ShortMapAbstractByte2ShortMap.keySet().containsKey in interface Byte2ShortFunctioncontainsKey in class AbstractByte2ShortMapFunction.containsKey(Object)public int size()
FunctionMost function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
public boolean isEmpty()
public short get(byte k)
Byte2ShortFunctionget in interface Byte2ShortFunctionk - the key.Function.get(Object)public byte firstByteKey()
firstByteKey in interface Byte2ShortSortedMapSortedMap.firstKey()public byte lastByteKey()
lastByteKey in interface Byte2ShortSortedMapSortedMap.lastKey()public ObjectSortedSet<Byte2ShortMap.Entry> byte2ShortEntrySet()
Byte2ShortSortedMapbyte2ShortEntrySet in interface Byte2ShortMapbyte2ShortEntrySet in interface Byte2ShortSortedMapByte2ShortSortedMap.entrySet()public ByteSortedSet keySet()
In addition to the semantics of Map.keySet(), you can
safely cast the set returned by this call to a type-specific sorted set
interface.
keySet in interface Byte2ShortMapkeySet in interface Byte2ShortSortedMapkeySet in interface Map<Byte,Short>keySet in interface SortedMap<Byte,Short>keySet in class AbstractByte2ShortSortedMapMap.keySet()public ShortCollection values()
In addition to the semantics of Map.values(), you can
safely cast the collection returned by this call to a type-specific
collection interface.
values in interface Byte2ShortMapvalues in interface Byte2ShortSortedMapvalues in interface Map<Byte,Short>values in interface SortedMap<Byte,Short>values in class AbstractByte2ShortSortedMapMap.values()public ByteComparator comparator()
Byte2ShortSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Byte2ShortSortedMapcomparator in interface SortedMap<Byte,Short>SortedMap.comparator()public Byte2ShortSortedMap headMap(byte to)
Byte2ShortSortedMaptoKey.headMap in interface Byte2ShortSortedMapSortedMap.headMap(Object)public Byte2ShortSortedMap tailMap(byte from)
Byte2ShortSortedMapfromKey.tailMap in interface Byte2ShortSortedMapSortedMap.tailMap(Object)public Byte2ShortSortedMap subMap(byte from, byte to)
Byte2ShortSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Byte2ShortSortedMapSortedMap.subMap(Object,Object)public Byte2ShortRBTreeMap clone()
This method performs a deep copy of this tree map; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.