Class Double2ByteAVLTreeMap
- java.lang.Object
-
- it.unimi.dsi.fastutil.doubles.AbstractDouble2ByteFunction
-
- it.unimi.dsi.fastutil.doubles.AbstractDouble2ByteMap
-
- it.unimi.dsi.fastutil.doubles.AbstractDouble2ByteSortedMap
-
- it.unimi.dsi.fastutil.doubles.Double2ByteAVLTreeMap
-
- All Implemented Interfaces:
Double2ByteFunction,Double2ByteMap,Double2ByteSortedMap,Function<Double,Byte>,Serializable,Cloneable,DoubleToIntFunction,Function<Double,Byte>,Map<Double,Byte>,SortedMap<Double,Byte>
public class Double2ByteAVLTreeMap extends AbstractDouble2ByteSortedMap 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.AbstractDouble2ByteMap
AbstractDouble2ByteMap.BasicEntry, AbstractDouble2ByteMap.BasicEntrySet
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2ByteMap
Double2ByteMap.FastEntrySet
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2ByteSortedMap
Double2ByteSortedMap.FastSortedEntrySet
-
-
Constructor Summary
Constructors Constructor Description Double2ByteAVLTreeMap()Creates a new empty tree map.Double2ByteAVLTreeMap(double[] k, byte[] v)Creates a new tree map using the elements of two parallel arrays.Double2ByteAVLTreeMap(double[] k, byte[] v, Comparator<? super Double> c)Creates a new tree map using the elements of two parallel arrays and the given comparator.Double2ByteAVLTreeMap(Double2ByteMap m)Creates a new tree map copying a given map.Double2ByteAVLTreeMap(Double2ByteSortedMap m)Creates a new tree map copying a given sorted map (and itsComparator).Double2ByteAVLTreeMap(Comparator<? super Double> c)Creates a new empty tree map with the given comparator.Double2ByteAVLTreeMap(Map<? extends Double,? extends Byte> m)Creates a new tree map copying a given map.Double2ByteAVLTreeMap(SortedMap<Double,Byte> m)Creates a new tree map copying a given sorted map (and itsComparator).
-
Method Summary
Modifier and Type Method Description byteaddTo(double k, byte incr)Adds an increment to value currently associated with a key.voidclear()Removes all of the mappings from this map (optional operation).Double2ByteAVLTreeMapclone()Returns a deep copy of this tree map.DoubleComparatorcomparator()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.booleancontainsValue(byte v)Returnstrueif this map maps one or more keys to the specified value.ObjectSortedSet<Double2ByteMap.Entry>double2ByteEntrySet()Returns a type-specific sorted-set view of the mappings contained in this map.doublefirstDoubleKey()Returns the first (lowest) key currently in this map.byteget(double k)Returns the value to which the given key is mapped.Double2ByteSortedMapheadMap(double to)Returns a view of the portion of this sorted map whose keys are strictly less thantoKey.booleanisEmpty()DoubleSortedSetkeySet()Returns a type-specific sorted set view of the keys contained in this map.doublelastDoubleKey()Returns the last (highest) key currently in this map.byteput(double k, byte v)Adds a pair to the map (optional operation).byteremove(double k)Removes the mapping with the given key (optional operation).intsize()Returns the number of key/value mappings in this map.Double2ByteSortedMapsubMap(double from, double to)Returns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.Double2ByteSortedMaptailMap(double from)Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey.ByteCollectionvalues()Returns a type-specific collection view of the values contained in this map.-
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ByteMap
equals, hashCode, putAll, toString
-
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ByteFunction
defaultReturnValue, defaultReturnValue
-
Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2ByteFunction
applyAsInt
-
Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2ByteMap
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.Double2ByteSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMap
-
Methods inherited from interface java.util.Map
containsKey, equals, forEach, get, hashCode, put, putAll, remove, replaceAll
-
-
-
-
Constructor Detail
-
Double2ByteAVLTreeMap
public Double2ByteAVLTreeMap()
Creates a new empty tree map.
-
Double2ByteAVLTreeMap
public Double2ByteAVLTreeMap(Comparator<? super Double> c)
Creates a new empty tree map with the given comparator.- Parameters:
c- a (possibly type-specific) comparator.
-
Double2ByteAVLTreeMap
public Double2ByteAVLTreeMap(Map<? extends Double,? extends Byte> m)
Creates a new tree map copying a given map.- Parameters:
m- aMapto be copied into the new tree map.
-
Double2ByteAVLTreeMap
public Double2ByteAVLTreeMap(SortedMap<Double,Byte> m)
Creates a new tree map copying a given sorted map (and itsComparator).- Parameters:
m- aSortedMapto be copied into the new tree map.
-
Double2ByteAVLTreeMap
public Double2ByteAVLTreeMap(Double2ByteMap m)
Creates a new tree map copying a given map.- Parameters:
m- a type-specific map to be copied into the new tree map.
-
Double2ByteAVLTreeMap
public Double2ByteAVLTreeMap(Double2ByteSortedMap 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.
-
Double2ByteAVLTreeMap
public Double2ByteAVLTreeMap(double[] k, byte[] 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- ifkandvhave different lengths.
-
Double2ByteAVLTreeMap
public Double2ByteAVLTreeMap(double[] k, byte[] 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- ifkandvhave different lengths.
-
-
Method Detail
-
addTo
public byte addTo(double k, byte 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 byte put(double k, byte v)Description copied from interface:Double2ByteFunctionAdds a pair to the map (optional operation).- Specified by:
putin interfaceDouble2ByteFunction- 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 byte remove(double k)
Description copied from interface:Double2ByteFunctionRemoves the mapping with the given key (optional operation).- Specified by:
removein interfaceDouble2ByteFunction- 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(byte v)
Description copied from interface:Double2ByteMapReturnstrueif this map maps one or more keys to the specified value.- Specified by:
containsValuein interfaceDouble2ByteMap- Overrides:
containsValuein classAbstractDouble2ByteMap- See Also:
Map.containsValue(Object)
-
clear
public void clear()
Description copied from interface:Double2ByteMapRemoves 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:Double2ByteMapReturns true if this function contains a mapping for the specified key.- Specified by:
containsKeyin interfaceDouble2ByteFunction- Specified by:
containsKeyin interfaceDouble2ByteMap- Overrides:
containsKeyin classAbstractDouble2ByteMap- 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:Double2ByteMapReturns 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
public byte get(double k)
Description copied from interface:Double2ByteFunctionReturns the value to which the given key is mapped.- Specified by:
getin interfaceDouble2ByteFunction- 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:Double2ByteSortedMapReturns the first (lowest) key currently in this map.- Specified by:
firstDoubleKeyin interfaceDouble2ByteSortedMap- See Also:
SortedMap.firstKey()
-
lastDoubleKey
public double lastDoubleKey()
Description copied from interface:Double2ByteSortedMapReturns the last (highest) key currently in this map.- Specified by:
lastDoubleKeyin interfaceDouble2ByteSortedMap- See Also:
SortedMap.lastKey()
-
double2ByteEntrySet
public ObjectSortedSet<Double2ByteMap.Entry> double2ByteEntrySet()
Description copied from interface:Double2ByteSortedMapReturns 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:
double2ByteEntrySetin interfaceDouble2ByteMap- Specified by:
double2ByteEntrySetin interfaceDouble2ByteSortedMap- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
Double2ByteSortedMap.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:
keySetin interfaceDouble2ByteMap- Specified by:
keySetin interfaceDouble2ByteSortedMap- Specified by:
keySetin interfaceMap<Double,Byte>- Specified by:
keySetin interfaceSortedMap<Double,Byte>- Overrides:
keySetin classAbstractDouble2ByteSortedMap- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
Map.keySet()
-
values
public ByteCollection 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 interfaceDouble2ByteMap- Specified by:
valuesin interfaceDouble2ByteSortedMap- Specified by:
valuesin interfaceMap<Double,Byte>- Specified by:
valuesin interfaceSortedMap<Double,Byte>- Overrides:
valuesin classAbstractDouble2ByteSortedMap- 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:Double2ByteSortedMapReturns 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:
comparatorin interfaceDouble2ByteSortedMap- Specified by:
comparatorin interfaceSortedMap<Double,Byte>- See Also:
SortedMap.comparator()
-
headMap
public Double2ByteSortedMap headMap(double to)
Description copied from interface:Double2ByteSortedMapReturns 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:
headMapin interfaceDouble2ByteSortedMap- See Also:
SortedMap.headMap(Object)
-
tailMap
public Double2ByteSortedMap tailMap(double from)
Description copied from interface:Double2ByteSortedMapReturns 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:
tailMapin interfaceDouble2ByteSortedMap- See Also:
SortedMap.tailMap(Object)
-
subMap
public Double2ByteSortedMap subMap(double from, double to)
Description copied from interface:Double2ByteSortedMapReturns 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:
subMapin interfaceDouble2ByteSortedMap- See Also:
SortedMap.subMap(Object,Object)
-
clone
public Double2ByteAVLTreeMap 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.
-
-