public class Short2ByteRBTreeMap extends AbstractShort2ByteSortedMap 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.
AbstractShort2ByteMap.BasicEntryShort2ByteSortedMap.FastSortedEntrySetShort2ByteMap.FastEntrySet| Constructor and Description |
|---|
Short2ByteRBTreeMap()
Creates a new empty tree map.
|
Short2ByteRBTreeMap(Comparator<? super Short> c)
Creates a new empty tree map with the given comparator.
|
Short2ByteRBTreeMap(Map<? extends Short,? extends Byte> m)
Creates a new tree map copying a given map.
|
Short2ByteRBTreeMap(short[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Short2ByteRBTreeMap(short[] k,
byte[] v,
Comparator<? super Short> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Short2ByteRBTreeMap(Short2ByteMap m)
Creates a new tree map copying a given map.
|
Short2ByteRBTreeMap(Short2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Short2ByteRBTreeMap(SortedMap<Short,Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Short2ByteRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
ShortComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(short k)
Checks whether the given value is contained in
AbstractShort2ByteMap.keySet(). |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractShort2ByteMap.values(). |
short |
firstShortKey() |
byte |
get(short k)
Returns the value to which the given key is mapped.
|
Short2ByteSortedMap |
headMap(short to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
ShortSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
short |
lastShortKey() |
byte |
put(short k,
byte v)
Adds a pair to the map.
|
Byte |
put(Short ok,
Byte ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
Byte |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
byte |
remove(short k)
Removes the mapping with the given key.
|
ObjectSortedSet<Short2ByteMap.Entry> |
short2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Short2ByteSortedMap |
subMap(short from,
short to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Short2ByteSortedMap |
tailMap(short from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
ByteCollection |
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 Short2ByteRBTreeMap()
public Short2ByteRBTreeMap(Comparator<? super Short> c)
c - a (possibly type-specific) comparator.public Short2ByteRBTreeMap(Map<? extends Short,? extends Byte> m)
m - a Map to be copied into the new tree map.public Short2ByteRBTreeMap(SortedMap<Short,Byte> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Short2ByteRBTreeMap(Short2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Short2ByteRBTreeMap(Short2ByteSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Short2ByteRBTreeMap(short[] k,
byte[] v,
Comparator<? super Short> 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 Short2ByteRBTreeMap(short[] k,
byte[] 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 byte put(short k,
byte v)
Short2ByteFunctionput in interface Short2ByteFunctionput in class AbstractShort2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public byte remove(short k)
Short2ByteFunctionremove in interface Short2ByteFunctionremove in class AbstractShort2ByteFunctionk - the key.Function.remove(Object)public Byte put(Short ok, Byte ov)
AbstractShort2ByteFunctionnull 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 Byte remove(Object ok)
AbstractShort2ByteFunctionnull 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(byte v)
AbstractShort2ByteMapAbstractShort2ByteMap.values().containsValue in interface Short2ByteMapcontainsValue in class AbstractShort2ByteMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(short k)
AbstractShort2ByteMapAbstractShort2ByteMap.keySet().containsKey in interface Short2ByteFunctioncontainsKey in class AbstractShort2ByteMapFunction.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 byte get(short k)
Short2ByteFunctionget in interface Short2ByteFunctionk - the key.Function.get(Object)public short firstShortKey()
firstShortKey in interface Short2ByteSortedMapSortedMap.firstKey()public short lastShortKey()
lastShortKey in interface Short2ByteSortedMapSortedMap.lastKey()public ObjectSortedSet<Short2ByteMap.Entry> short2ByteEntrySet()
Short2ByteSortedMapshort2ByteEntrySet in interface Short2ByteMapshort2ByteEntrySet in interface Short2ByteSortedMapShort2ByteSortedMap.entrySet()public ShortSortedSet 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 Short2ByteMapkeySet in interface Short2ByteSortedMapkeySet in interface Map<Short,Byte>keySet in interface SortedMap<Short,Byte>keySet in class AbstractShort2ByteSortedMapMap.keySet()public ByteCollection 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 Short2ByteMapvalues in interface Short2ByteSortedMapvalues in interface Map<Short,Byte>values in interface SortedMap<Short,Byte>values in class AbstractShort2ByteSortedMapMap.values()public ShortComparator comparator()
Short2ByteSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Short2ByteSortedMapcomparator in interface SortedMap<Short,Byte>SortedMap.comparator()public Short2ByteSortedMap headMap(short to)
Short2ByteSortedMaptoKey.headMap in interface Short2ByteSortedMapSortedMap.headMap(Object)public Short2ByteSortedMap tailMap(short from)
Short2ByteSortedMapfromKey.tailMap in interface Short2ByteSortedMapSortedMap.tailMap(Object)public Short2ByteSortedMap subMap(short from, short to)
Short2ByteSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Short2ByteSortedMapSortedMap.subMap(Object,Object)public Short2ByteRBTreeMap 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.