public class Short2DoubleRBTreeMap extends AbstractShort2DoubleSortedMap 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.
AbstractShort2DoubleMap.BasicEntryShort2DoubleSortedMap.FastSortedEntrySetShort2DoubleMap.FastEntrySet| Constructor and Description |
|---|
Short2DoubleRBTreeMap()
Creates a new empty tree map.
|
Short2DoubleRBTreeMap(Comparator<? super Short> c)
Creates a new empty tree map with the given comparator.
|
Short2DoubleRBTreeMap(Map<? extends Short,? extends Double> m)
Creates a new tree map copying a given map.
|
Short2DoubleRBTreeMap(short[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Short2DoubleRBTreeMap(short[] k,
double[] v,
Comparator<? super Short> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Short2DoubleRBTreeMap(Short2DoubleMap m)
Creates a new tree map copying a given map.
|
Short2DoubleRBTreeMap(Short2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Short2DoubleRBTreeMap(SortedMap<Short,Double> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
double |
addTo(short k,
double incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Short2DoubleRBTreeMap |
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
AbstractShort2DoubleMap.keySet(). |
boolean |
containsValue(double v)
Checks whether the given value is contained in
AbstractShort2DoubleMap.values(). |
short |
firstShortKey() |
double |
get(short k)
Returns the value to which the given key is mapped.
|
Short2DoubleSortedMap |
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() |
double |
put(short k,
double v)
Adds a pair to the map.
|
Double |
put(Short ok,
Double ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
Double |
remove(Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
double |
remove(short k)
Removes the mapping with the given key.
|
ObjectSortedSet<Short2DoubleMap.Entry> |
short2DoubleEntrySet()
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.
|
Short2DoubleSortedMap |
subMap(short from,
short to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Short2DoubleSortedMap |
tailMap(short from)
Returns a view of the portion of this sorted map whose keys are greater
than or equal to
fromKey. |
DoubleCollection |
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 Short2DoubleRBTreeMap()
public Short2DoubleRBTreeMap(Comparator<? super Short> c)
c - a (possibly type-specific) comparator.public Short2DoubleRBTreeMap(Map<? extends Short,? extends Double> m)
m - a Map to be copied into the new tree map.public Short2DoubleRBTreeMap(SortedMap<Short,Double> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Short2DoubleRBTreeMap(Short2DoubleMap m)
m - a type-specific map to be copied into the new tree map.public Short2DoubleRBTreeMap(Short2DoubleSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Short2DoubleRBTreeMap(short[] k,
double[] 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 Short2DoubleRBTreeMap(short[] k,
double[] 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 double addTo(short k,
double 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 double put(short k,
double v)
Short2DoubleFunctionput in interface Short2DoubleFunctionput in class AbstractShort2DoubleFunctionk - the key.v - the value.Function.put(Object,Object)public double remove(short k)
Short2DoubleFunctionremove in interface Short2DoubleFunctionremove in class AbstractShort2DoubleFunctionk - the key.Function.remove(Object)@Deprecated public Double put(Short ok, Double 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.
put in interface Function<Short,Double>put in interface Map<Short,Double>put in class AbstractShort2DoubleFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public Double 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(double v)
AbstractShort2DoubleMapAbstractShort2DoubleMap.values().containsValue in interface Short2DoubleMapcontainsValue in class AbstractShort2DoubleMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(short k)
AbstractShort2DoubleMapAbstractShort2DoubleMap.keySet().containsKey in interface Short2DoubleFunctioncontainsKey in class AbstractShort2DoubleMapFunction.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 double get(short k)
Short2DoubleFunctionget in interface Short2DoubleFunctionk - the key.Function.get(Object)public short firstShortKey()
firstShortKey in interface Short2DoubleSortedMapSortedMap.firstKey()public short lastShortKey()
lastShortKey in interface Short2DoubleSortedMapSortedMap.lastKey()public ObjectSortedSet<Short2DoubleMap.Entry> short2DoubleEntrySet()
Short2DoubleSortedMapshort2DoubleEntrySet in interface Short2DoubleMapshort2DoubleEntrySet in interface Short2DoubleSortedMapShort2DoubleSortedMap.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 Short2DoubleMapkeySet in interface Short2DoubleSortedMapkeySet in interface Map<Short,Double>keySet in interface SortedMap<Short,Double>keySet in class AbstractShort2DoubleSortedMapMap.keySet()public DoubleCollection 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 Short2DoubleMapvalues in interface Short2DoubleSortedMapvalues in interface Map<Short,Double>values in interface SortedMap<Short,Double>values in class AbstractShort2DoubleSortedMapMap.values()public ShortComparator comparator()
Short2DoubleSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Short2DoubleSortedMapcomparator in interface SortedMap<Short,Double>SortedMap.comparator()public Short2DoubleSortedMap headMap(short to)
Short2DoubleSortedMaptoKey.headMap in interface Short2DoubleSortedMapSortedMap.headMap(Object)public Short2DoubleSortedMap tailMap(short from)
Short2DoubleSortedMapfromKey.tailMap in interface Short2DoubleSortedMapSortedMap.tailMap(Object)public Short2DoubleSortedMap subMap(short from, short to)
Short2DoubleSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Short2DoubleSortedMapSortedMap.subMap(Object,Object)public Short2DoubleRBTreeMap 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.