Class Double2LongAVLTreeMap
- All Implemented Interfaces:
Double2LongFunction
,Double2LongMap
,Double2LongSortedMap
,Function<Double,
,Long> Serializable
,Cloneable
,DoubleToLongFunction
,Function<Double,
,Long> Map<Double,
,Long> SequencedMap<Double,
,Long> SortedMap<Double,
Long>
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.
- See Also:
-
Nested Class Summary
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2LongMap
AbstractDouble2LongMap.BasicEntry, AbstractDouble2LongMap.BasicEntrySet
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2LongMap
Double2LongMap.FastEntrySet
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2LongSortedMap
Double2LongSortedMap.FastSortedEntrySet
-
Constructor Summary
ConstructorDescriptionCreates a new empty tree map.Double2LongAVLTreeMap
(double[] k, long[] v) Creates a new tree map using the elements of two parallel arrays.Double2LongAVLTreeMap
(double[] k, long[] v, Comparator<? super Double> c) Creates a new tree map using the elements of two parallel arrays and the given comparator.Creates a new tree map copying a given map.Creates a new tree map copying a given sorted map (and itsComparator
).Double2LongAVLTreeMap
(Comparator<? super Double> c) Creates a new empty tree map with the given comparator.Double2LongAVLTreeMap
(Map<? extends Double, ? extends Long> m) Creates a new tree map copying a given map.Creates a new tree map copying a given sorted map (and itsComparator
). -
Method Summary
Modifier and TypeMethodDescriptionlong
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).clone()
Returns a deep copy of this tree map.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) Returnstrue
if this map maps one or more keys to the specified value.Returns a type-specific sorted-set view of the mappings contained in this map.double
Returns the first (lowest) key currently in this map.long
get
(double k) Returns the value to which the given key is mapped.headMap
(double to) Returns a view of the portion of this sorted map whose keys are strictly less thantoKey
.boolean
isEmpty()
keySet()
Returns a type-specific sorted set view of the keys contained in this map.double
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.subMap
(double from, double to) Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.tailMap
(double from) Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.values()
Returns a type-specific collection view of the values contained in this map.Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2LongMap
equals, hashCode, mergeLong, putAll, toString
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2LongFunction
defaultReturnValue, defaultReturnValue
Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2LongFunction
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsLong, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2LongMap
compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, merge, mergeLong, mergeLong, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2LongSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMap
Methods inherited from interface java.util.Map
containsKey, equals, get, getOrDefault, hashCode, put, putAll, remove, replaceAll
Methods inherited from interface java.util.SequencedMap
firstEntry, lastEntry, pollFirstEntry, pollLastEntry, sequencedEntrySet, sequencedKeySet, sequencedValues
-
Constructor Details
-
Double2LongAVLTreeMap
public Double2LongAVLTreeMap()Creates a new empty tree map. -
Double2LongAVLTreeMap
Creates a new empty tree map with the given comparator.- Parameters:
c
- a (possibly type-specific) comparator.
-
Double2LongAVLTreeMap
Creates a new tree map copying a given map.- Parameters:
m
- aMap
to be copied into the new tree map.
-
Double2LongAVLTreeMap
Creates a new tree map copying a given sorted map (and itsComparator
).- Parameters:
m
- aSortedMap
to be copied into the new tree map.
-
Double2LongAVLTreeMap
Creates a new tree map copying a given map.- Parameters:
m
- a type-specific map to be copied into the new tree map.
-
Double2LongAVLTreeMap
Creates a new tree map copying a given sorted map (and itsComparator
).- Parameters:
m
- a type-specific sorted map to be copied into the new tree map.
-
Double2LongAVLTreeMap
Creates a new tree map using the elements of two parallel arrays and the given comparator.- Parameters:
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.- Throws:
IllegalArgumentException
- ifk
andv
have different lengths.
-
Double2LongAVLTreeMap
public Double2LongAVLTreeMap(double[] k, long[] v) Creates a new tree map using the elements of two parallel arrays.- Parameters:
k
- the array of keys of the new tree map.v
- the array of corresponding values in the new tree map.- Throws:
IllegalArgumentException
- ifk
andv
have different lengths.
-
-
Method Details
-
addTo
public long addTo(double k, long incr) Adds an increment to value currently associated with a key.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.
- Parameters:
k
- the key.incr
- the increment.- Returns:
- the old value, or the default return value if no value was present for the given key.
-
put
public long put(double k, long v) Description copied from interface:Double2LongFunction
Adds a pair to the map (optional operation).- Specified by:
put
in interfaceDouble2LongFunction
- Parameters:
k
- the key.v
- the value.- Returns:
- the old value, or the default return value if no value was present for the given key.
- See Also:
-
remove
public long remove(double k) Description copied from interface:Double2LongFunction
Removes the mapping with the given key (optional operation).- Specified by:
remove
in interfaceDouble2LongFunction
- Parameters:
k
- the key.- Returns:
- the old value, or the default return value if no value was present for the given key.
- See Also:
-
containsValue
public boolean containsValue(long v) Description copied from class:AbstractDouble2LongMap
Returnstrue
if this map maps one or more keys to the specified value.- Specified by:
containsValue
in interfaceDouble2LongMap
- Overrides:
containsValue
in classAbstractDouble2LongMap
- See Also:
-
clear
public void clear()Description copied from interface:Double2LongMap
Removes all of the mappings from this map (optional operation). The map will be empty after this call returns. -
containsKey
public boolean containsKey(double k) Description copied from class:AbstractDouble2LongMap
Returns true if this function contains a mapping for the specified key.- Specified by:
containsKey
in interfaceDouble2LongFunction
- Specified by:
containsKey
in interfaceDouble2LongMap
- Overrides:
containsKey
in classAbstractDouble2LongMap
- Parameters:
k
- the key.- Returns:
- true if this function associates a value to
key
. - See Also:
-
size
public int size()Description copied from interface:Double2LongMap
Returns the number of key/value mappings in this map. If the map contains more thanInteger.MAX_VALUE
elements, returnsInteger.MAX_VALUE
. -
isEmpty
public boolean isEmpty() -
get
public long get(double k) Description copied from interface:Double2LongFunction
Returns the value to which the given key is mapped.- Specified by:
get
in interfaceDouble2LongFunction
- Parameters:
k
- the key.- Returns:
- the corresponding value, or the default return value if no value was present for the given key.
- See Also:
-
firstDoubleKey
public double firstDoubleKey()Description copied from interface:Double2LongSortedMap
Returns the first (lowest) key currently in this map.- Specified by:
firstDoubleKey
in interfaceDouble2LongSortedMap
- See Also:
-
lastDoubleKey
public double lastDoubleKey()Description copied from interface:Double2LongSortedMap
Returns the last (highest) key currently in this map.- Specified by:
lastDoubleKey
in interfaceDouble2LongSortedMap
- See Also:
-
double2LongEntrySet
Description copied from interface:Double2LongSortedMap
Returns a type-specific sorted-set view of the mappings contained in this map.- Specified by:
double2LongEntrySet
in interfaceDouble2LongMap
- Specified by:
double2LongEntrySet
in interfaceDouble2LongSortedMap
- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
-
keySet
Returns a type-specific sorted set view of the keys contained in this map.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.- Specified by:
keySet
in interfaceDouble2LongMap
- Specified by:
keySet
in interfaceDouble2LongSortedMap
- Specified by:
keySet
in interfaceMap<Double,
Long> - Specified by:
keySet
in interfaceSortedMap<Double,
Long> - Overrides:
keySet
in classAbstractDouble2LongSortedMap
- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
-
values
Returns a type-specific collection view of the values contained in this map.In addition to the semantics of
Map.values()
, you can safely cast the collection returned by this call to a type-specific collection interface.- Specified by:
values
in interfaceDouble2LongMap
- Specified by:
values
in interfaceDouble2LongSortedMap
- Specified by:
values
in interfaceMap<Double,
Long> - Specified by:
values
in interfaceSortedMap<Double,
Long> - Overrides:
values
in classAbstractDouble2LongSortedMap
- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
-
comparator
Description copied from interface:Double2LongSortedMap
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.- Specified by:
comparator
in interfaceDouble2LongSortedMap
- Specified by:
comparator
in interfaceSortedMap<Double,
Long> - See Also:
-
headMap
Description copied from interface:Double2LongSortedMap
Returns a view of the portion of this sorted map whose keys are strictly less thantoKey
.- Specified by:
headMap
in interfaceDouble2LongSortedMap
- See Also:
-
tailMap
Description copied from interface:Double2LongSortedMap
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.- Specified by:
tailMap
in interfaceDouble2LongSortedMap
- See Also:
-
subMap
Description copied from interface:Double2LongSortedMap
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.- Specified by:
subMap
in interfaceDouble2LongSortedMap
- See Also:
-
clone
Returns a deep copy of this tree map.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.
- Returns:
- a deep copy of this tree map.
-