Double2LongFunction, Double2LongMap, Double2LongSortedMap, Function<java.lang.Double,java.lang.Long>, java.io.Serializable, java.lang.Cloneable, java.util.function.DoubleToLongFunction, java.util.function.Function<java.lang.Double,java.lang.Long>, java.util.Map<java.lang.Double,java.lang.Long>, java.util.SortedMap<java.lang.Double,java.lang.Long>public class Double2LongRBTreeMap extends AbstractDouble2LongSortedMap implements java.io.Serializable, java.lang.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.BasicEntry, AbstractDouble2LongMap.BasicEntrySetDouble2LongMap.FastEntrySetDouble2LongSortedMap.FastSortedEntrySet| Constructor | Description |
|---|---|
Double2LongRBTreeMap() |
Creates a new empty tree map.
|
Double2LongRBTreeMap(double[] k,
long[] v) |
Creates a new tree map using the elements of two parallel arrays.
|
Double2LongRBTreeMap(double[] k,
long[] v,
java.util.Comparator<? super java.lang.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(java.util.Comparator<? super java.lang.Double> c) |
Creates a new empty tree map with the given comparator.
|
Double2LongRBTreeMap(java.util.Map<? extends java.lang.Double,? extends java.lang.Long> m) |
Creates a new tree map copying a given map.
|
Double2LongRBTreeMap(java.util.SortedMap<java.lang.Double,java.lang.Long> m) |
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method | Description |
|---|---|---|
long |
addTo(double k,
long incr) |
Adds an increment to value currently associated with a key.
|
void |
clear() |
Removes all of the mappings from this map (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) |
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(long v) |
Returns
true if this map maps one or more keys to the specified
value. |
ObjectSortedSet<Double2LongMap.Entry> |
double2LongEntrySet() |
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
double |
firstDoubleKey() |
Returns the first (lowest) key currently in this map.
|
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() |
Returns the last (highest) key currently in this map.
|
long |
put(double k,
long v) |
Adds a pair to the map (optional operation).
|
long |
remove(double k) |
Removes the mapping with the given key (optional operation).
|
int |
size() |
Returns the number of key/value mappings in this map.
|
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.
|
defaultReturnValue, defaultReturnValueequals, hashCode, putAll, toStringapplyAsLongcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replacepublic Double2LongRBTreeMap()
public Double2LongRBTreeMap(java.util.Comparator<? super java.lang.Double> c)
c - a (possibly type-specific) comparator.public Double2LongRBTreeMap(java.util.Map<? extends java.lang.Double,? extends java.lang.Long> m)
m - a Map to be copied into the new tree map.public Double2LongRBTreeMap(java.util.SortedMap<java.lang.Double,java.lang.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,
java.util.Comparator<? super java.lang.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.java.lang.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.java.lang.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 Double2LongFunctionk - the key.v - the value.Function.put(Object,Object)public long remove(double k)
Double2LongFunctionremove in interface Double2LongFunctionk - the key.Function.remove(Object)public boolean containsValue(long v)
Double2LongMaptrue if this map maps one or more keys to the specified
value.containsValue in interface Double2LongMapcontainsValue in class AbstractDouble2LongMapMap.containsValue(Object)public void clear()
Double2LongMapclear in interface Double2LongMapclear in interface Function<java.lang.Double,java.lang.Long>clear in interface java.util.Map<java.lang.Double,java.lang.Long>Map.clear()public boolean containsKey(double k)
Double2LongMapcontainsKey in interface Double2LongFunctioncontainsKey in interface Double2LongMapcontainsKey in class AbstractDouble2LongMapk - the key.key.Map.containsKey(Object)public int size()
Double2LongMapInteger.MAX_VALUE elements, returns
Integer.MAX_VALUE.size in interface Double2LongMapsize in interface Function<java.lang.Double,java.lang.Long>size in interface java.util.Map<java.lang.Double,java.lang.Long>Size64public boolean isEmpty()
isEmpty in interface java.util.Map<java.lang.Double,java.lang.Long>isEmpty in class AbstractDouble2LongMappublic long get(double k)
Double2LongFunctionget in interface Double2LongFunctionk - the key.Function.get(Object)public double firstDoubleKey()
Double2LongSortedMapfirstDoubleKey in interface Double2LongSortedMapSortedMap.firstKey()public double lastDoubleKey()
Double2LongSortedMaplastDoubleKey in interface Double2LongSortedMapSortedMap.lastKey()public ObjectSortedSet<Double2LongMap.Entry> double2LongEntrySet()
Double2LongSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
double2LongEntrySet 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 java.util.Map<java.lang.Double,java.lang.Long>keySet in interface java.util.SortedMap<java.lang.Double,java.lang.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 java.util.Map<java.lang.Double,java.lang.Long>values in interface java.util.SortedMap<java.lang.Double,java.lang.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 java.util.SortedMap<java.lang.Double,java.lang.Long>SortedMap.comparator()public Double2LongSortedMap headMap(double to)
Double2LongSortedMaptoKey.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
headMap in interface Double2LongSortedMapSortedMap.headMap(Object)public Double2LongSortedMap tailMap(double from)
Double2LongSortedMapfromKey.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).
tailMap in interface Double2LongSortedMapSortedMap.tailMap(Object)public Double2LongSortedMap subMap(double from, double to)
Double2LongSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
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.