public class Double2LongRBTreeMap extends AbstractDouble2LongSortedMap 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.
AbstractDouble2LongMap.BasicEntryDouble2LongSortedMap.FastSortedEntrySetDouble2LongMap.FastEntrySet| Constructor and Description |
|---|
Double2LongRBTreeMap()
Creates a new empty tree map.
|
Double2LongRBTreeMap(Comparator<? super Double> c)
Creates a new empty tree map with the given comparator.
|
Double2LongRBTreeMap(double[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Double2LongRBTreeMap(double[] k,
long[] v,
Comparator<? super Double> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Double2LongRBTreeMap(Double2LongMap m)
Creates a new tree map copying a given map.
|
Double2LongRBTreeMap(Double2LongSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Double2LongRBTreeMap(Map<? extends Double,? extends Long> m)
Creates a new tree map copying a given map.
|
Double2LongRBTreeMap(SortedMap<Double,Long> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
long |
addTo(double k,
long incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Double2LongRBTreeMap |
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
AbstractDouble2LongMap.keySet(). |
boolean |
containsValue(long v)
Checks whether the given value is contained in
AbstractDouble2LongMap.values(). |
ObjectSortedSet<Double2LongMap.Entry> |
double2LongEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
double |
firstDoubleKey() |
long |
get(double k)
Returns the value to which the given key is mapped.
|
Double2LongSortedMap |
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() |
long |
put(double k,
long v)
Adds a pair to the map.
|
Long |
put(Double ok,
Long ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
long |
remove(double k)
Removes the mapping with the given key.
|
Long |
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.
|
Double2LongSortedMap |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Double2LongSortedMap |
tailMap(double from)
Returns a view of the portion of this sorted map whose keys are greater
than or equal to
fromKey. |
LongCollection |
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 Double2LongRBTreeMap()
public Double2LongRBTreeMap(Comparator<? super Double> c)
c - a (possibly type-specific) comparator.public Double2LongRBTreeMap(Map<? extends Double,? extends Long> m)
m - a Map to be copied into the new tree map.public Double2LongRBTreeMap(SortedMap<Double,Long> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Double2LongRBTreeMap(Double2LongMap m)
m - a type-specific map to be copied into the new tree map.public Double2LongRBTreeMap(Double2LongSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Double2LongRBTreeMap(double[] k,
long[] 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 Double2LongRBTreeMap(double[] k,
long[] 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 long addTo(double k,
long 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 long put(double k,
long v)
Double2LongFunctionput in interface Double2LongFunctionput in class AbstractDouble2LongFunctionk - the key.v - the value.Function.put(Object,Object)public long remove(double k)
Double2LongFunctionremove in interface Double2LongFunctionremove in class AbstractDouble2LongFunctionk - the key.Function.remove(Object)@Deprecated public Long put(Double ok, Long 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,Long>put in interface Map<Double,Long>put in class AbstractDouble2LongFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public Long 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(long v)
AbstractDouble2LongMapAbstractDouble2LongMap.values().containsValue in interface Double2LongMapcontainsValue in class AbstractDouble2LongMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(double k)
AbstractDouble2LongMapAbstractDouble2LongMap.keySet().containsKey in interface Double2LongFunctioncontainsKey in class AbstractDouble2LongMapFunction.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 long get(double k)
Double2LongFunctionget in interface Double2LongFunctionk - the key.Function.get(Object)public double firstDoubleKey()
firstDoubleKey in interface Double2LongSortedMapSortedMap.firstKey()public double lastDoubleKey()
lastDoubleKey in interface Double2LongSortedMapSortedMap.lastKey()public ObjectSortedSet<Double2LongMap.Entry> double2LongEntrySet()
Double2LongSortedMapdouble2LongEntrySet in interface Double2LongMapdouble2LongEntrySet in interface Double2LongSortedMapDouble2LongSortedMap.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 Double2LongMapkeySet in interface Double2LongSortedMapkeySet in interface Map<Double,Long>keySet in interface SortedMap<Double,Long>keySet in class AbstractDouble2LongSortedMapMap.keySet()public LongCollection 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 Double2LongMapvalues in interface Double2LongSortedMapvalues in interface Map<Double,Long>values in interface SortedMap<Double,Long>values in class AbstractDouble2LongSortedMapMap.values()public DoubleComparator comparator()
Double2LongSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Double2LongSortedMapcomparator in interface SortedMap<Double,Long>SortedMap.comparator()public Double2LongSortedMap headMap(double to)
Double2LongSortedMaptoKey.headMap in interface Double2LongSortedMapSortedMap.headMap(Object)public Double2LongSortedMap tailMap(double from)
Double2LongSortedMapfromKey.tailMap in interface Double2LongSortedMapSortedMap.tailMap(Object)public Double2LongSortedMap subMap(double from, double to)
Double2LongSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Double2LongSortedMapSortedMap.subMap(Object,Object)public Double2LongRBTreeMap 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.