public class Double2DoubleAVLTreeMap extends AbstractDouble2DoubleSortedMap 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.
AbstractDouble2DoubleMap.BasicEntryDouble2DoubleSortedMap.FastSortedEntrySetDouble2DoubleMap.FastEntrySet| Constructor and Description |
|---|
Double2DoubleAVLTreeMap()
Creates a new empty tree map.
|
Double2DoubleAVLTreeMap(Comparator<? super Double> c)
Creates a new empty tree map with the given comparator.
|
Double2DoubleAVLTreeMap(double[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Double2DoubleAVLTreeMap(double[] k,
double[] v,
Comparator<? super Double> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Double2DoubleAVLTreeMap(Double2DoubleMap m)
Creates a new tree map copying a given map.
|
Double2DoubleAVLTreeMap(Double2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Double2DoubleAVLTreeMap(Map<? extends Double,? extends Double> m)
Creates a new tree map copying a given map.
|
Double2DoubleAVLTreeMap(SortedMap<Double,Double> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
double |
addTo(double k,
double incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Double2DoubleAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
DoubleComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
boolean |
containsKey(double k)
Checks whether the given value is contained in
AbstractDouble2DoubleMap.keySet(). |
boolean |
containsValue(double v)
Checks whether the given value is contained in
AbstractDouble2DoubleMap.values(). |
ObjectSortedSet<Double2DoubleMap.Entry> |
double2DoubleEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
double |
firstDoubleKey() |
double |
get(double k)
Returns the value to which the given key is mapped.
|
Double2DoubleSortedMap |
headMap(double to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
boolean |
isEmpty() |
DoubleSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this
map.
|
double |
lastDoubleKey() |
double |
put(double k,
double v)
Adds a pair to the map.
|
Double |
put(Double ok,
Double ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
double |
remove(double 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.
|
Double2DoubleSortedMap |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Double2DoubleSortedMap |
tailMap(double 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 Double2DoubleAVLTreeMap()
public Double2DoubleAVLTreeMap(Comparator<? super Double> c)
c - a (possibly type-specific) comparator.public Double2DoubleAVLTreeMap(Map<? extends Double,? extends Double> m)
m - a Map to be copied into the new tree map.public Double2DoubleAVLTreeMap(SortedMap<Double,Double> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Double2DoubleAVLTreeMap(Double2DoubleMap m)
m - a type-specific map to be copied into the new tree map.public Double2DoubleAVLTreeMap(Double2DoubleSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Double2DoubleAVLTreeMap(double[] k,
double[] v,
Comparator<? super Double> 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 Double2DoubleAVLTreeMap(double[] 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(double 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(double k,
double v)
Double2DoubleFunctionput in interface Double2DoubleFunctionput in class AbstractDouble2DoubleFunctionk - the key.v - the value.Function.put(Object,Object)public double remove(double k)
Double2DoubleFunctionremove in interface Double2DoubleFunctionremove in class AbstractDouble2DoubleFunctionk - the key.Function.remove(Object)@Deprecated public Double put(Double 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<Double,Double>put in interface Map<Double,Double>put in class AbstractDouble2DoubleFunctionok - 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)
AbstractDouble2DoubleMapAbstractDouble2DoubleMap.values().containsValue in interface Double2DoubleMapcontainsValue in class AbstractDouble2DoubleMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(double k)
AbstractDouble2DoubleMapAbstractDouble2DoubleMap.keySet().containsKey in interface Double2DoubleFunctioncontainsKey in class AbstractDouble2DoubleMapFunction.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(double k)
Double2DoubleFunctionget in interface Double2DoubleFunctionk - the key.Function.get(Object)public double firstDoubleKey()
firstDoubleKey in interface Double2DoubleSortedMapSortedMap.firstKey()public double lastDoubleKey()
lastDoubleKey in interface Double2DoubleSortedMapSortedMap.lastKey()public ObjectSortedSet<Double2DoubleMap.Entry> double2DoubleEntrySet()
Double2DoubleSortedMapdouble2DoubleEntrySet in interface Double2DoubleMapdouble2DoubleEntrySet in interface Double2DoubleSortedMapDouble2DoubleSortedMap.entrySet()public DoubleSortedSet 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 Double2DoubleMapkeySet in interface Double2DoubleSortedMapkeySet in interface Map<Double,Double>keySet in interface SortedMap<Double,Double>keySet in class AbstractDouble2DoubleSortedMapMap.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 Double2DoubleMapvalues in interface Double2DoubleSortedMapvalues in interface Map<Double,Double>values in interface SortedMap<Double,Double>values in class AbstractDouble2DoubleSortedMapMap.values()public DoubleComparator comparator()
Double2DoubleSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Double2DoubleSortedMapcomparator in interface SortedMap<Double,Double>SortedMap.comparator()public Double2DoubleSortedMap headMap(double to)
Double2DoubleSortedMaptoKey.headMap in interface Double2DoubleSortedMapSortedMap.headMap(Object)public Double2DoubleSortedMap tailMap(double from)
Double2DoubleSortedMapfromKey.tailMap in interface Double2DoubleSortedMapSortedMap.tailMap(Object)public Double2DoubleSortedMap subMap(double from, double to)
Double2DoubleSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Double2DoubleSortedMapSortedMap.subMap(Object,Object)public Double2DoubleAVLTreeMap 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.