public class Object2ShortRBTreeMap<K> extends AbstractObject2ShortSortedMap<K> 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.
AbstractObject2ShortMap.BasicEntry<K>Object2ShortSortedMap.FastSortedEntrySet<K>Object2ShortMap.FastEntrySet<K>| Constructor and Description |
|---|
Object2ShortRBTreeMap()
Creates a new empty tree map.
|
Object2ShortRBTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator.
|
Object2ShortRBTreeMap(K[] k,
short[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Object2ShortRBTreeMap(K[] k,
short[] v,
Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Object2ShortRBTreeMap(Map<? extends K,? extends Short> m)
Creates a new tree map copying a given map.
|
Object2ShortRBTreeMap(Object2ShortMap<? extends K> m)
Creates a new tree map copying a given map.
|
Object2ShortRBTreeMap(Object2ShortSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Object2ShortRBTreeMap(SortedMap<K,Short> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
short |
addTo(K k,
short incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Object2ShortRBTreeMap<K> |
clone()
Returns a deep copy of this tree map.
|
Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in
AbstractObject2ShortMap.keySet(). |
boolean |
containsValue(short v)
Checks whether the given value is contained in
AbstractObject2ShortMap.values(). |
K |
firstKey() |
Short |
get(Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
short |
getShort(Object k)
Returns the value to which the given key is mapped.
|
Object2ShortSortedMap<K> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
boolean |
isEmpty() |
ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this
map.
|
K |
lastKey() |
ObjectSortedSet<Object2ShortMap.Entry<K>> |
object2ShortEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
short |
put(K k,
short v)
Adds a pair to the map.
|
Short |
put(K ok,
Short ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
Short |
remove(Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
short |
removeShort(Object k)
Removes the mapping with the given key.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Object2ShortSortedMap<K> |
subMap(K from,
K to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Object2ShortSortedMap<K> |
tailMap(K 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.
|
entrySetcontainsValue, equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuedefaultReturnValue, defaultReturnValuecompute, computeIfAbsent, computeIfPresent, containsValue, equals, forEach, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Object2ShortRBTreeMap()
public Object2ShortRBTreeMap(Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2ShortRBTreeMap(Map<? extends K,? extends Short> m)
m - a Map to be copied into the new tree map.public Object2ShortRBTreeMap(SortedMap<K,Short> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Object2ShortRBTreeMap(Object2ShortMap<? extends K> m)
m - a type-specific map to be copied into the new tree map.public Object2ShortRBTreeMap(Object2ShortSortedMap<K> m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Object2ShortRBTreeMap(K[] k, short[] v, Comparator<? super K> 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 Object2ShortRBTreeMap(K[] 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(K 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(K k, short v)
Object2ShortFunctionput in interface Object2ShortFunction<K>put in class AbstractObject2ShortFunction<K>k - the key.v - the value.Function.put(Object,Object)public short removeShort(Object k)
Object2ShortFunctionremoveShort in interface Object2ShortFunction<K>removeShort in class AbstractObject2ShortFunction<K>k - the key.Function.remove(Object)@Deprecated public Short put(K 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)
AbstractObject2ShortMapAbstractObject2ShortMap.values().containsValue in interface Object2ShortMap<K>containsValue in class AbstractObject2ShortMap<K>Map.containsValue(Object)public void clear()
Functionpublic boolean containsKey(Object k)
AbstractObject2ShortMapAbstractObject2ShortMap.keySet().containsKey in interface Function<K,Short>containsKey in interface Map<K,Short>containsKey in class AbstractObject2ShortMap<K>k - the key.key.Map.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 getShort(Object k)
Object2ShortFunctiongetShort in interface Object2ShortFunction<K>k - the key.Function.get(Object)@Deprecated public Short get(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 ObjectSortedSet<Object2ShortMap.Entry<K>> object2ShortEntrySet()
Object2ShortSortedMapobject2ShortEntrySet in interface Object2ShortMap<K>object2ShortEntrySet in interface Object2ShortSortedMap<K>Object2ShortSortedMap.entrySet()public ObjectSortedSet<K> 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 Object2ShortMap<K>keySet in interface Object2ShortSortedMap<K>keySet in interface Map<K,Short>keySet in interface SortedMap<K,Short>keySet in class AbstractObject2ShortSortedMap<K>Map.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 Object2ShortMap<K>values in interface Object2ShortSortedMap<K>values in interface Map<K,Short>values in interface SortedMap<K,Short>values in class AbstractObject2ShortSortedMap<K>Map.values()public Comparator<? super K> comparator()
Object2ShortSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Object2ShortSortedMap<K>comparator in interface SortedMap<K,Short>SortedMap.comparator()public Object2ShortSortedMap<K> headMap(K to)
Object2ShortSortedMaptoKey.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
headMap in interface Object2ShortSortedMap<K>headMap in interface SortedMap<K,Short>SortedMap.headMap(Object)public Object2ShortSortedMap<K> tailMap(K from)
Object2ShortSortedMapfromKey.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).
tailMap in interface Object2ShortSortedMap<K>tailMap in interface SortedMap<K,Short>SortedMap.tailMap(Object)public Object2ShortSortedMap<K> subMap(K from, K to)
Object2ShortSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
subMap in interface Object2ShortSortedMap<K>subMap in interface SortedMap<K,Short>SortedMap.subMap(Object,Object)public Object2ShortRBTreeMap<K> 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.