Package it.unimi.dsi.fastutil.doubles
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<Double,,V> Serializable,Cloneable,DoubleFunction<V>,Function<Double,,V> Map<Double,,V> SortedMap<Double,V>
public class Double2ReferenceAVLTreeMap<V>
extends AbstractDouble2ReferenceSortedMap<V>
implements Serializable, 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:
-
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
ConstructorsConstructorDescriptionCreates 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, Comparator<? super 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.Creates a new tree map copying a given sorted map (and itsComparator).Double2ReferenceAVLTreeMap(Comparator<? super Double> c) Creates a new empty tree map with the given comparator.Double2ReferenceAVLTreeMap(Map<? extends Double, ? extends V> 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 TypeMethodDescriptionvoidclear()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.booleancontainsKey(double k) Returns true if this function contains a mapping for the specified key.booleanReturns a type-specific sorted-set view of the mappings contained in this map.doubleReturns the first (lowest) key currently in this map.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.booleanisEmpty()keySet()Returns a type-specific sorted set view of the keys contained in this map.doubleReturns the last (highest) key currently in this map.Adds a pair to the map (optional operation).remove(double k) Removes the mapping with the given key (optional operation).intsize()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.AbstractDouble2ReferenceMap
equals, hashCode, putAll, toStringMethods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceFunction
defaultReturnValue, defaultReturnValueMethods inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceFunction
andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, apply, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShortMethods inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceMap
compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replaceMethods inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMapMethods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, containsKey, equals, get, getOrDefault, hashCode, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll
-
Constructor Details
-
Double2ReferenceAVLTreeMap
public Double2ReferenceAVLTreeMap()Creates a new empty tree map. -
Double2ReferenceAVLTreeMap
Creates a new empty tree map with the given comparator.- Parameters:
c- a (possibly type-specific) comparator.
-
Double2ReferenceAVLTreeMap
Creates a new tree map copying a given map.- Parameters:
m- aMapto be copied into the new tree map.
-
Double2ReferenceAVLTreeMap
Creates a new tree map copying a given sorted map (and itsComparator).- Parameters:
m- aSortedMapto be copied into the new tree map.
-
Double2ReferenceAVLTreeMap
Creates a new tree map copying a given map.- Parameters:
m- a type-specific map to be copied into the new tree map.
-
Double2ReferenceAVLTreeMap
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
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- ifkandvhave different lengths.
-
Double2ReferenceAVLTreeMap
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- ifkandvhave different lengths.
-
-
Method Details
-
put
Description copied from interface:Double2ReferenceFunctionAdds a pair to the map (optional operation).- Specified by:
putin 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:
-
remove
Description copied from interface:Double2ReferenceFunctionRemoves the mapping with the given key (optional operation).- Specified by:
removein 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:
-
containsValue
Description copied from class:AbstractDouble2ReferenceMap- Specified by:
containsValuein interfaceMap<Double,V> - Overrides:
containsValuein classAbstractDouble2ReferenceMap<V>
-
clear
public void clear()Description copied from interface:Double2ReferenceMapRemoves 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:AbstractDouble2ReferenceMapReturns true if this function contains a mapping for the specified key.- Specified by:
containsKeyin interfaceDouble2ReferenceFunction<V>- Specified by:
containsKeyin interfaceDouble2ReferenceMap<V>- Overrides:
containsKeyin classAbstractDouble2ReferenceMap<V>- Parameters:
k- the key.- Returns:
- true if this function associates a value to
key. - See Also:
-
size
public int size()Description copied from interface:Double2ReferenceMapReturns the number of key/value mappings in this map. If the map contains more thanInteger.MAX_VALUEelements, returnsInteger.MAX_VALUE. -
isEmpty
public boolean isEmpty() -
get
Description copied from interface:Double2ReferenceFunctionReturns the value to which the given key is mapped.- Specified by:
getin 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:
-
firstDoubleKey
public double firstDoubleKey()Description copied from interface:Double2ReferenceSortedMapReturns the first (lowest) key currently in this map.- Specified by:
firstDoubleKeyin interfaceDouble2ReferenceSortedMap<V>- See Also:
-
lastDoubleKey
public double lastDoubleKey()Description copied from interface:Double2ReferenceSortedMapReturns the last (highest) key currently in this map.- Specified by:
lastDoubleKeyin interfaceDouble2ReferenceSortedMap<V>- See Also:
-
double2ReferenceEntrySet
Description copied from interface:Double2ReferenceSortedMapReturns a type-specific sorted-set view of the mappings contained in this map.- Specified by:
double2ReferenceEntrySetin interfaceDouble2ReferenceMap<V>- Specified by:
double2ReferenceEntrySetin interfaceDouble2ReferenceSortedMap<V>- 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:
keySetin interfaceDouble2ReferenceMap<V>- Specified by:
keySetin interfaceDouble2ReferenceSortedMap<V>- Specified by:
keySetin interfaceMap<Double,V> - Specified by:
keySetin interfaceSortedMap<Double,V> - Overrides:
keySetin classAbstractDouble2ReferenceSortedMap<V>- 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:
valuesin interfaceDouble2ReferenceMap<V>- Specified by:
valuesin interfaceDouble2ReferenceSortedMap<V>- Specified by:
valuesin interfaceMap<Double,V> - Specified by:
valuesin interfaceSortedMap<Double,V> - Overrides:
valuesin classAbstractDouble2ReferenceSortedMap<V>- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
-
comparator
Description copied from interface:Double2ReferenceSortedMapReturns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.- Specified by:
comparatorin interfaceDouble2ReferenceSortedMap<V>- Specified by:
comparatorin interfaceSortedMap<Double,V> - See Also:
-
headMap
Description copied from interface:Double2ReferenceSortedMapReturns a view of the portion of this sorted map whose keys are strictly less thantoKey.- Specified by:
headMapin interfaceDouble2ReferenceSortedMap<V>- See Also:
-
tailMap
Description copied from interface:Double2ReferenceSortedMapReturns a view of the portion of this sorted map whose keys are greater than or equal tofromKey.- Specified by:
tailMapin interfaceDouble2ReferenceSortedMap<V>- See Also:
-
subMap
Description copied from interface:Double2ReferenceSortedMapReturns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.- Specified by:
subMapin interfaceDouble2ReferenceSortedMap<V>- 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.
-