Class Double2CharAVLTreeMap
- java.lang.Object
-
- it.unimi.dsi.fastutil.doubles.AbstractDouble2CharFunction
-
- it.unimi.dsi.fastutil.doubles.AbstractDouble2CharMap
-
- it.unimi.dsi.fastutil.doubles.AbstractDouble2CharSortedMap
-
- it.unimi.dsi.fastutil.doubles.Double2CharAVLTreeMap
-
- All Implemented Interfaces:
Double2CharFunction
,Double2CharMap
,Double2CharSortedMap
,Function<Double,Character>
,Serializable
,Cloneable
,DoubleToIntFunction
,Function<Double,Character>
,Map<Double,Character>
,SortedMap<Double,Character>
public class Double2CharAVLTreeMap extends AbstractDouble2CharSortedMap 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:
- Serialized Form
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2CharMap
AbstractDouble2CharMap.BasicEntry, AbstractDouble2CharMap.BasicEntrySet
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2CharMap
Double2CharMap.FastEntrySet
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2CharSortedMap
Double2CharSortedMap.FastSortedEntrySet
-
-
Constructor Summary
Constructors Constructor Description Double2CharAVLTreeMap()
Creates a new empty tree map.Double2CharAVLTreeMap(double[] k, char[] v)
Creates a new tree map using the elements of two parallel arrays.Double2CharAVLTreeMap(double[] k, char[] v, Comparator<? super Double> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.Double2CharAVLTreeMap(Double2CharMap m)
Creates a new tree map copying a given map.Double2CharAVLTreeMap(Double2CharSortedMap m)
Creates a new tree map copying a given sorted map (and itsComparator
).Double2CharAVLTreeMap(Comparator<? super Double> c)
Creates a new empty tree map with the given comparator.Double2CharAVLTreeMap(Map<? extends Double,? extends Character> m)
Creates a new tree map copying a given map.Double2CharAVLTreeMap(SortedMap<Double,Character> 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 char
addTo(double k, char incr)
Adds an increment to value currently associated with a key.void
clear()
Removes all of the mappings from this map (optional operation).Double2CharAVLTreeMap
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(char v)
Returnstrue
if this map maps one or more keys to the specified value.ObjectSortedSet<Double2CharMap.Entry>
double2CharEntrySet()
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.char
get(double k)
Returns the value to which the given key is mapped.Double2CharSortedMap
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.char
put(double k, char v)
Adds a pair to the map (optional operation).char
remove(double k)
Removes the mapping with the given key (optional operation).int
size()
Returns the number of key/value mappings in this map.Double2CharSortedMap
subMap(double from, double to)
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.Double2CharSortedMap
tailMap(double from)
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.CharCollection
values()
Returns a type-specific collection view of the values contained in this map.-
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2CharMap
equals, hashCode, putAll, toString
-
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2CharFunction
defaultReturnValue, defaultReturnValue
-
Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2CharFunction
andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsInt, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
-
Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2CharMap
compute, 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, replace
-
Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2CharSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMap
-
Methods inherited from interface java.util.Map
containsKey, equals, forEach, get, hashCode, put, putAll, remove, replaceAll
-
-
-
-
Constructor Detail
-
Double2CharAVLTreeMap
public Double2CharAVLTreeMap()
Creates a new empty tree map.
-
Double2CharAVLTreeMap
public Double2CharAVLTreeMap(Comparator<? super Double> c)
Creates a new empty tree map with the given comparator.- Parameters:
c
- a (possibly type-specific) comparator.
-
Double2CharAVLTreeMap
public Double2CharAVLTreeMap(Map<? extends Double,? extends Character> m)
Creates a new tree map copying a given map.- Parameters:
m
- aMap
to be copied into the new tree map.
-
Double2CharAVLTreeMap
public Double2CharAVLTreeMap(SortedMap<Double,Character> m)
Creates a new tree map copying a given sorted map (and itsComparator
).- Parameters:
m
- aSortedMap
to be copied into the new tree map.
-
Double2CharAVLTreeMap
public Double2CharAVLTreeMap(Double2CharMap m)
Creates a new tree map copying a given map.- Parameters:
m
- a type-specific map to be copied into the new tree map.
-
Double2CharAVLTreeMap
public Double2CharAVLTreeMap(Double2CharSortedMap 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.
-
Double2CharAVLTreeMap
public Double2CharAVLTreeMap(double[] k, char[] v, Comparator<? super 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:
IllegalArgumentException
- ifk
andv
have different lengths.
-
Double2CharAVLTreeMap
public Double2CharAVLTreeMap(double[] k, char[] 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 Detail
-
addTo
public char addTo(double k, char 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 char put(double k, char v)
Description copied from interface:Double2CharFunction
Adds a pair to the map (optional operation).- Specified by:
put
in interfaceDouble2CharFunction
- 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 char remove(double k)
Description copied from interface:Double2CharFunction
Removes the mapping with the given key (optional operation).- Specified by:
remove
in interfaceDouble2CharFunction
- 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(char v)
Description copied from interface:Double2CharMap
Returnstrue
if this map maps one or more keys to the specified value.- Specified by:
containsValue
in interfaceDouble2CharMap
- Overrides:
containsValue
in classAbstractDouble2CharMap
- See Also:
Map.containsValue(Object)
-
clear
public void clear()
Description copied from interface:Double2CharMap
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:Double2CharMap
Returns true if this function contains a mapping for the specified key.- Specified by:
containsKey
in interfaceDouble2CharFunction
- Specified by:
containsKey
in interfaceDouble2CharMap
- Overrides:
containsKey
in classAbstractDouble2CharMap
- 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:Double2CharMap
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 char get(double k)
Description copied from interface:Double2CharFunction
Returns the value to which the given key is mapped.- Specified by:
get
in interfaceDouble2CharFunction
- 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:Double2CharSortedMap
Returns the first (lowest) key currently in this map.- Specified by:
firstDoubleKey
in interfaceDouble2CharSortedMap
- See Also:
SortedMap.firstKey()
-
lastDoubleKey
public double lastDoubleKey()
Description copied from interface:Double2CharSortedMap
Returns the last (highest) key currently in this map.- Specified by:
lastDoubleKey
in interfaceDouble2CharSortedMap
- See Also:
SortedMap.lastKey()
-
double2CharEntrySet
public ObjectSortedSet<Double2CharMap.Entry> double2CharEntrySet()
Description copied from interface:Double2CharSortedMap
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:
double2CharEntrySet
in interfaceDouble2CharMap
- Specified by:
double2CharEntrySet
in interfaceDouble2CharSortedMap
- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
Double2CharSortedMap.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 interfaceDouble2CharMap
- Specified by:
keySet
in interfaceDouble2CharSortedMap
- Specified by:
keySet
in interfaceMap<Double,Character>
- Specified by:
keySet
in interfaceSortedMap<Double,Character>
- Overrides:
keySet
in classAbstractDouble2CharSortedMap
- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
Map.keySet()
-
values
public CharCollection 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 interfaceDouble2CharMap
- Specified by:
values
in interfaceDouble2CharSortedMap
- Specified by:
values
in interfaceMap<Double,Character>
- Specified by:
values
in interfaceSortedMap<Double,Character>
- Overrides:
values
in classAbstractDouble2CharSortedMap
- 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:Double2CharSortedMap
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 interfaceDouble2CharSortedMap
- Specified by:
comparator
in interfaceSortedMap<Double,Character>
- See Also:
SortedMap.comparator()
-
headMap
public Double2CharSortedMap headMap(double to)
Description copied from interface:Double2CharSortedMap
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 interfaceDouble2CharSortedMap
- See Also:
SortedMap.headMap(Object)
-
tailMap
public Double2CharSortedMap tailMap(double from)
Description copied from interface:Double2CharSortedMap
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 interfaceDouble2CharSortedMap
- See Also:
SortedMap.tailMap(Object)
-
subMap
public Double2CharSortedMap subMap(double from, double to)
Description copied from interface:Double2CharSortedMap
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 interfaceDouble2CharSortedMap
- See Also:
SortedMap.subMap(Object,Object)
-
clone
public Double2CharAVLTreeMap 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.
-
-