Class Double2ReferenceAVLTreeMap<V>
- java.lang.Object
-
- it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceFunction<V>
-
- it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceMap<V>
-
- it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceSortedMap<V>
-
- it.unimi.dsi.fastutil.doubles.Double2ReferenceAVLTreeMap<V>
-
- All Implemented Interfaces:
Double2ReferenceFunction<V>
,Double2ReferenceMap<V>
,Double2ReferenceSortedMap<V>
,Function<java.lang.Double,V>
,java.io.Serializable
,java.lang.Cloneable
,java.util.function.DoubleFunction<V>
,java.util.function.Function<java.lang.Double,V>
,java.util.Map<java.lang.Double,V>
,java.util.SortedMap<java.lang.Double,V>
public class Double2ReferenceAVLTreeMap<V> extends AbstractDouble2ReferenceSortedMap<V> implements java.io.Serializable, java.lang.Cloneable
A type-specific AVL tree map with a fast, small-footprint implementation.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:
- Serialized Form
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceMap
AbstractDouble2ReferenceMap.BasicEntry<V>, AbstractDouble2ReferenceMap.BasicEntrySet<V>
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceMap
Double2ReferenceMap.FastEntrySet<V>
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceSortedMap
Double2ReferenceSortedMap.FastSortedEntrySet<V>
-
-
Constructor Summary
Constructors Constructor Description Double2ReferenceAVLTreeMap()
Creates a new empty tree map.Double2ReferenceAVLTreeMap(double[] k, V[] v)
Creates a new tree map using the elements of two parallel arrays.Double2ReferenceAVLTreeMap(double[] k, V[] 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.Double2ReferenceAVLTreeMap(Double2ReferenceMap<? extends V> m)
Creates a new tree map copying a given map.Double2ReferenceAVLTreeMap(Double2ReferenceSortedMap<V> m)
Creates a new tree map copying a given sorted map (and itsComparator
).Double2ReferenceAVLTreeMap(java.util.Comparator<? super java.lang.Double> c)
Creates a new empty tree map with the given comparator.Double2ReferenceAVLTreeMap(java.util.Map<? extends java.lang.Double,? extends V> m)
Creates a new tree map copying a given map.Double2ReferenceAVLTreeMap(java.util.SortedMap<java.lang.Double,V> m)
Creates a new tree map copying a given sorted map (and itsComparator
).
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
clear()
Removes all of the mappings from this map (optional operation).Double2ReferenceAVLTreeMap<V>
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(java.lang.Object v)
ObjectSortedSet<Double2ReferenceMap.Entry<V>>
double2ReferenceEntrySet()
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.V
get(double k)
Returns the value to which the given key is mapped.Double2ReferenceSortedMap<V>
headMap(double to)
Returns a view of the portion of this sorted map whose keys are strictly less thantoKey
.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.V
put(double k, V v)
Adds a pair to the map (optional operation).V
remove(double k)
Removes the mapping with the given key (optional operation).int
size()
Returns the number of key/value mappings in this map.Double2ReferenceSortedMap<V>
subMap(double from, double to)
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.Double2ReferenceSortedMap<V>
tailMap(double from)
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.ReferenceCollection<V>
values()
Returns a type-specific collection view of the values contained in this map.-
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceMap
equals, hashCode, putAll, toString
-
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceFunction
defaultReturnValue, defaultReturnValue
-
Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceFunction
apply
-
Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceMap
compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
-
-
-
-
Constructor Detail
-
Double2ReferenceAVLTreeMap
public Double2ReferenceAVLTreeMap()
Creates a new empty tree map.
-
Double2ReferenceAVLTreeMap
public Double2ReferenceAVLTreeMap(java.util.Comparator<? super java.lang.Double> c)
Creates a new empty tree map with the given comparator.- Parameters:
c
- a (possibly type-specific) comparator.
-
Double2ReferenceAVLTreeMap
public Double2ReferenceAVLTreeMap(java.util.Map<? extends java.lang.Double,? extends V> m)
Creates a new tree map copying a given map.- Parameters:
m
- aMap
to be copied into the new tree map.
-
Double2ReferenceAVLTreeMap
public Double2ReferenceAVLTreeMap(java.util.SortedMap<java.lang.Double,V> m)
Creates a new tree map copying a given sorted map (and itsComparator
).- Parameters:
m
- aSortedMap
to be copied into the new tree map.
-
Double2ReferenceAVLTreeMap
public Double2ReferenceAVLTreeMap(Double2ReferenceMap<? extends V> m)
Creates a new tree map copying a given map.- Parameters:
m
- a type-specific map to be copied into the new tree map.
-
Double2ReferenceAVLTreeMap
public Double2ReferenceAVLTreeMap(Double2ReferenceSortedMap<V> m)
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.
-
Double2ReferenceAVLTreeMap
public Double2ReferenceAVLTreeMap(double[] k, V[] 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.- 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:
java.lang.IllegalArgumentException
- ifk
andv
have different lengths.
-
Double2ReferenceAVLTreeMap
public Double2ReferenceAVLTreeMap(double[] k, V[] 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:
java.lang.IllegalArgumentException
- ifk
andv
have different lengths.
-
-
Method Detail
-
put
public V put(double k, V v)
Description copied from interface:Double2ReferenceFunction
Adds a pair to the map (optional operation).- Specified by:
put
in interfaceDouble2ReferenceFunction<V>
- 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:
Function.put(Object,Object)
-
remove
public V remove(double k)
Description copied from interface:Double2ReferenceFunction
Removes the mapping with the given key (optional operation).- Specified by:
remove
in interfaceDouble2ReferenceFunction<V>
- Parameters:
k
- the key.- Returns:
- the old value, or the default return value if no value was present for the given key.
- See Also:
Function.remove(Object)
-
containsValue
public boolean containsValue(java.lang.Object v)
- Specified by:
containsValue
in interfacejava.util.Map<java.lang.Double,V>
- Overrides:
containsValue
in classAbstractDouble2ReferenceMap<V>
-
clear
public void clear()
Description copied from interface:Double2ReferenceMap
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 interface:Double2ReferenceMap
Returns true if this function contains a mapping for the specified key.- Specified by:
containsKey
in interfaceDouble2ReferenceFunction<V>
- Specified by:
containsKey
in interfaceDouble2ReferenceMap<V>
- Overrides:
containsKey
in classAbstractDouble2ReferenceMap<V>
- Parameters:
k
- the key.- Returns:
- true if this function associates a value to
key
. - See Also:
Map.containsKey(Object)
-
size
public int size()
Description copied from interface:Double2ReferenceMap
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()
- Specified by:
isEmpty
in interfacejava.util.Map<java.lang.Double,V>
- Overrides:
isEmpty
in classAbstractDouble2ReferenceMap<V>
-
get
public V get(double k)
Description copied from interface:Double2ReferenceFunction
Returns the value to which the given key is mapped.- Specified by:
get
in interfaceDouble2ReferenceFunction<V>
- Parameters:
k
- the key.- Returns:
- the corresponding value, or the default return value if no value was present for the given key.
- See Also:
Function.get(Object)
-
firstDoubleKey
public double firstDoubleKey()
Description copied from interface:Double2ReferenceSortedMap
Returns the first (lowest) key currently in this map.- Specified by:
firstDoubleKey
in interfaceDouble2ReferenceSortedMap<V>
- See Also:
SortedMap.firstKey()
-
lastDoubleKey
public double lastDoubleKey()
Description copied from interface:Double2ReferenceSortedMap
Returns the last (highest) key currently in this map.- Specified by:
lastDoubleKey
in interfaceDouble2ReferenceSortedMap<V>
- See Also:
SortedMap.lastKey()
-
double2ReferenceEntrySet
public ObjectSortedSet<Double2ReferenceMap.Entry<V>> double2ReferenceEntrySet()
Description copied from interface:Double2ReferenceSortedMap
Returns a type-specific sorted-set view of the mappings contained in this map.Note that this specification strengthens the one given in the corresponding type-specific unsorted map.
- Specified by:
double2ReferenceEntrySet
in interfaceDouble2ReferenceMap<V>
- Specified by:
double2ReferenceEntrySet
in interfaceDouble2ReferenceSortedMap<V>
- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
Double2ReferenceSortedMap.entrySet()
-
keySet
public DoubleSortedSet 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 interfaceDouble2ReferenceMap<V>
- Specified by:
keySet
in interfaceDouble2ReferenceSortedMap<V>
- Specified by:
keySet
in interfacejava.util.Map<java.lang.Double,V>
- Specified by:
keySet
in interfacejava.util.SortedMap<java.lang.Double,V>
- Overrides:
keySet
in classAbstractDouble2ReferenceSortedMap<V>
- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
Map.keySet()
-
values
public ReferenceCollection<V> 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 interfaceDouble2ReferenceMap<V>
- Specified by:
values
in interfaceDouble2ReferenceSortedMap<V>
- Specified by:
values
in interfacejava.util.Map<java.lang.Double,V>
- Specified by:
values
in interfacejava.util.SortedMap<java.lang.Double,V>
- Overrides:
values
in classAbstractDouble2ReferenceSortedMap<V>
- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
Map.values()
-
comparator
public DoubleComparator comparator()
Description copied from interface:Double2ReferenceSortedMap
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.Note that this specification strengthens the one given in
SortedMap.comparator()
.- Specified by:
comparator
in interfaceDouble2ReferenceSortedMap<V>
- Specified by:
comparator
in interfacejava.util.SortedMap<java.lang.Double,V>
- See Also:
SortedMap.comparator()
-
headMap
public Double2ReferenceSortedMap<V> headMap(double to)
Description copied from interface:Double2ReferenceSortedMap
Returns a view of the portion of this sorted map whose keys are strictly less thantoKey
.Note that this specification strengthens the one given in
SortedMap.headMap(Object)
.- Specified by:
headMap
in interfaceDouble2ReferenceSortedMap<V>
- See Also:
SortedMap.headMap(Object)
-
tailMap
public Double2ReferenceSortedMap<V> tailMap(double from)
Description copied from interface:Double2ReferenceSortedMap
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.Note that this specification strengthens the one given in
SortedMap.tailMap(Object)
.- Specified by:
tailMap
in interfaceDouble2ReferenceSortedMap<V>
- See Also:
SortedMap.tailMap(Object)
-
subMap
public Double2ReferenceSortedMap<V> subMap(double from, double to)
Description copied from interface:Double2ReferenceSortedMap
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object)
.- Specified by:
subMap
in interfaceDouble2ReferenceSortedMap<V>
- See Also:
SortedMap.subMap(Object,Object)
-
clone
public Double2ReferenceAVLTreeMap<V> 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.
-
-