public class Int2DoubleAVLTreeMap extends AbstractInt2DoubleSortedMap 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.
AbstractInt2DoubleMap.BasicEntryInt2DoubleSortedMap.FastSortedEntrySetInt2DoubleMap.FastEntrySet| Constructor and Description |
|---|
Int2DoubleAVLTreeMap()
Creates a new empty tree map.
|
Int2DoubleAVLTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2DoubleAVLTreeMap(int[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2DoubleAVLTreeMap(int[] k,
double[] v,
Comparator<? super Integer> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Int2DoubleAVLTreeMap(Int2DoubleMap m)
Creates a new tree map copying a given map.
|
Int2DoubleAVLTreeMap(Int2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Int2DoubleAVLTreeMap(Map<? extends Integer,? extends Double> m)
Creates a new tree map copying a given map.
|
Int2DoubleAVLTreeMap(SortedMap<Integer,Double> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
double |
addTo(int k,
double incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Int2DoubleAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
boolean |
containsKey(int k)
Checks whether the given value is contained in
AbstractInt2DoubleMap.keySet(). |
boolean |
containsValue(double v)
Checks whether the given value is contained in
AbstractInt2DoubleMap.values(). |
int |
firstIntKey() |
double |
get(int k)
Returns the value to which the given key is mapped.
|
Int2DoubleSortedMap |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
ObjectSortedSet<Int2DoubleMap.Entry> |
int2DoubleEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
boolean |
isEmpty() |
IntSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this
map.
|
int |
lastIntKey() |
double |
put(int k,
double v)
Adds a pair to the map.
|
Double |
put(Integer ok,
Double ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
double |
remove(int k)
Removes the mapping with the given key.
|
Double |
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.
|
Int2DoubleSortedMap |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Int2DoubleSortedMap |
tailMap(int 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 Int2DoubleAVLTreeMap()
public Int2DoubleAVLTreeMap(Comparator<? super Integer> c)
c - a (possibly type-specific) comparator.public Int2DoubleAVLTreeMap(Map<? extends Integer,? extends Double> m)
m - a Map to be copied into the new tree map.public Int2DoubleAVLTreeMap(SortedMap<Integer,Double> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Int2DoubleAVLTreeMap(Int2DoubleMap m)
m - a type-specific map to be copied into the new tree map.public Int2DoubleAVLTreeMap(Int2DoubleSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Int2DoubleAVLTreeMap(int[] k,
double[] v,
Comparator<? super Integer> 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 Int2DoubleAVLTreeMap(int[] 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(int 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(int k,
double v)
Int2DoubleFunctionput in interface Int2DoubleFunctionput in class AbstractInt2DoubleFunctionk - the key.v - the value.Function.put(Object,Object)public double remove(int k)
Int2DoubleFunctionremove in interface Int2DoubleFunctionremove in class AbstractInt2DoubleFunctionk - the key.Function.remove(Object)@Deprecated public Double put(Integer 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<Integer,Double>put in interface Map<Integer,Double>put in class AbstractInt2DoubleFunctionok - 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)
AbstractInt2DoubleMapAbstractInt2DoubleMap.values().containsValue in interface Int2DoubleMapcontainsValue in class AbstractInt2DoubleMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(int k)
AbstractInt2DoubleMapAbstractInt2DoubleMap.keySet().containsKey in interface Int2DoubleFunctioncontainsKey in class AbstractInt2DoubleMapFunction.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(int k)
Int2DoubleFunctionget in interface Int2DoubleFunctionk - the key.Function.get(Object)public int firstIntKey()
firstIntKey in interface Int2DoubleSortedMapSortedMap.firstKey()public int lastIntKey()
lastIntKey in interface Int2DoubleSortedMapSortedMap.lastKey()public ObjectSortedSet<Int2DoubleMap.Entry> int2DoubleEntrySet()
Int2DoubleSortedMapint2DoubleEntrySet in interface Int2DoubleMapint2DoubleEntrySet in interface Int2DoubleSortedMapInt2DoubleSortedMap.entrySet()public IntSortedSet 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 Int2DoubleMapkeySet in interface Int2DoubleSortedMapkeySet in interface Map<Integer,Double>keySet in interface SortedMap<Integer,Double>keySet in class AbstractInt2DoubleSortedMapMap.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 Int2DoubleMapvalues in interface Int2DoubleSortedMapvalues in interface Map<Integer,Double>values in interface SortedMap<Integer,Double>values in class AbstractInt2DoubleSortedMapMap.values()public IntComparator comparator()
Int2DoubleSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Int2DoubleSortedMapcomparator in interface SortedMap<Integer,Double>SortedMap.comparator()public Int2DoubleSortedMap headMap(int to)
Int2DoubleSortedMaptoKey.headMap in interface Int2DoubleSortedMapSortedMap.headMap(Object)public Int2DoubleSortedMap tailMap(int from)
Int2DoubleSortedMapfromKey.tailMap in interface Int2DoubleSortedMapSortedMap.tailMap(Object)public Int2DoubleSortedMap subMap(int from, int to)
Int2DoubleSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Int2DoubleSortedMapSortedMap.subMap(Object,Object)public Int2DoubleAVLTreeMap 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.