public class Double2IntAVLTreeMap extends AbstractDouble2IntSortedMap 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.
AbstractDouble2IntMap.BasicEntryDouble2IntSortedMap.FastSortedEntrySetDouble2IntMap.FastEntrySet| Constructor and Description |
|---|
Double2IntAVLTreeMap()
Creates a new empty tree map.
|
Double2IntAVLTreeMap(Comparator<? super Double> c)
Creates a new empty tree map with the given comparator.
|
Double2IntAVLTreeMap(double[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Double2IntAVLTreeMap(double[] k,
int[] v,
Comparator<? super Double> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Double2IntAVLTreeMap(Double2IntMap m)
Creates a new tree map copying a given map.
|
Double2IntAVLTreeMap(Double2IntSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Double2IntAVLTreeMap(Map<? extends Double,? extends Integer> m)
Creates a new tree map copying a given map.
|
Double2IntAVLTreeMap(SortedMap<Double,Integer> 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).
|
Double2IntAVLTreeMap |
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
AbstractDouble2IntMap.keySet(). |
boolean |
containsValue(int v)
Checks whether the given value is contained in
AbstractDouble2IntMap.values(). |
ObjectSortedSet<Double2IntMap.Entry> |
double2IntEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
double |
firstDoubleKey() |
int |
get(double k)
Returns the value to which the given key is mapped.
|
Double2IntSortedMap |
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() |
int |
put(double k,
int v)
Adds a pair to the map.
|
Integer |
put(Double ok,
Integer ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
remove(double k)
Removes the mapping with the given key.
|
Integer |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Double2IntSortedMap |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Double2IntSortedMap |
tailMap(double from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
IntCollection |
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 Double2IntAVLTreeMap()
public Double2IntAVLTreeMap(Comparator<? super Double> c)
c - a (possibly type-specific) comparator.public Double2IntAVLTreeMap(Map<? extends Double,? extends Integer> m)
m - a Map to be copied into the new tree map.public Double2IntAVLTreeMap(SortedMap<Double,Integer> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Double2IntAVLTreeMap(Double2IntMap m)
m - a type-specific map to be copied into the new tree map.public Double2IntAVLTreeMap(Double2IntSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Double2IntAVLTreeMap(double[] k,
int[] 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 Double2IntAVLTreeMap(double[] k,
int[] 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 int put(double k,
int v)
Double2IntFunctionput in interface Double2IntFunctionput in class AbstractDouble2IntFunctionk - the key.v - the value.Function.put(Object,Object)public int remove(double k)
Double2IntFunctionremove in interface Double2IntFunctionremove in class AbstractDouble2IntFunctionk - the key.Function.remove(Object)public Integer put(Double ok, Integer ov)
AbstractDouble2IntFunctionnull 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,Integer>put in interface Map<Double,Integer>put in class AbstractDouble2IntFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public Integer remove(Object ok)
AbstractDouble2IntFunctionnull 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(int v)
AbstractDouble2IntMapAbstractDouble2IntMap.values().containsValue in interface Double2IntMapcontainsValue in class AbstractDouble2IntMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(double k)
AbstractDouble2IntMapAbstractDouble2IntMap.keySet().containsKey in interface Double2IntFunctioncontainsKey in class AbstractDouble2IntMapFunction.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 int get(double k)
Double2IntFunctionget in interface Double2IntFunctionk - the key.Function.get(Object)public double firstDoubleKey()
firstDoubleKey in interface Double2IntSortedMapSortedMap.firstKey()public double lastDoubleKey()
lastDoubleKey in interface Double2IntSortedMapSortedMap.lastKey()public ObjectSortedSet<Double2IntMap.Entry> double2IntEntrySet()
Double2IntSortedMapdouble2IntEntrySet in interface Double2IntMapdouble2IntEntrySet in interface Double2IntSortedMapDouble2IntSortedMap.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 Double2IntMapkeySet in interface Double2IntSortedMapkeySet in interface Map<Double,Integer>keySet in interface SortedMap<Double,Integer>keySet in class AbstractDouble2IntSortedMapMap.keySet()public IntCollection 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 Double2IntMapvalues in interface Double2IntSortedMapvalues in interface Map<Double,Integer>values in interface SortedMap<Double,Integer>values in class AbstractDouble2IntSortedMapMap.values()public DoubleComparator comparator()
Double2IntSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Double2IntSortedMapcomparator in interface SortedMap<Double,Integer>SortedMap.comparator()public Double2IntSortedMap headMap(double to)
Double2IntSortedMaptoKey.headMap in interface Double2IntSortedMapSortedMap.headMap(Object)public Double2IntSortedMap tailMap(double from)
Double2IntSortedMapfromKey.tailMap in interface Double2IntSortedMapSortedMap.tailMap(Object)public Double2IntSortedMap subMap(double from, double to)
Double2IntSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Double2IntSortedMapSortedMap.subMap(Object,Object)public Double2IntAVLTreeMap 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.