Class Int2DoubleRBTreeMap
- java.lang.Object
-
- it.unimi.dsi.fastutil.ints.AbstractInt2DoubleFunction
-
- it.unimi.dsi.fastutil.ints.AbstractInt2DoubleMap
-
- it.unimi.dsi.fastutil.ints.AbstractInt2DoubleSortedMap
-
- it.unimi.dsi.fastutil.ints.Int2DoubleRBTreeMap
-
- All Implemented Interfaces:
Function<Integer,Double>,Int2DoubleFunction,Int2DoubleMap,Int2DoubleSortedMap,Serializable,Cloneable,Function<Integer,Double>,IntToDoubleFunction,Map<Integer,Double>,SortedMap<Integer,Double>
public class Int2DoubleRBTreeMap extends AbstractInt2DoubleSortedMap implements Serializable, Cloneable
A type-specific red-black 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.ints.AbstractInt2DoubleMap
AbstractInt2DoubleMap.BasicEntry, AbstractInt2DoubleMap.BasicEntrySet
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.ints.Int2DoubleMap
Int2DoubleMap.FastEntrySet
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.ints.Int2DoubleSortedMap
Int2DoubleSortedMap.FastSortedEntrySet
-
-
Constructor Summary
Constructors Constructor Description Int2DoubleRBTreeMap()Creates a new empty tree map.Int2DoubleRBTreeMap(int[] k, double[] v)Creates a new tree map using the elements of two parallel arrays.Int2DoubleRBTreeMap(int[] k, double[] v, Comparator<? super Integer> c)Creates a new tree map using the elements of two parallel arrays and the given comparator.Int2DoubleRBTreeMap(Int2DoubleMap m)Creates a new tree map copying a given map.Int2DoubleRBTreeMap(Int2DoubleSortedMap m)Creates a new tree map copying a given sorted map (and itsComparator).Int2DoubleRBTreeMap(Comparator<? super Integer> c)Creates a new empty tree map with the given comparator.Int2DoubleRBTreeMap(Map<? extends Integer,? extends Double> m)Creates a new tree map copying a given map.Int2DoubleRBTreeMap(SortedMap<Integer,Double> m)Creates a new tree map copying a given sorted map (and itsComparator).
-
Method Summary
Modifier and Type Method Description doubleaddTo(int k, double incr)Adds an increment to value currently associated with a key.voidclear()Removes all of the mappings from this map (optional operation).Int2DoubleRBTreeMapclone()Returns a deep copy of this tree map.IntComparatorcomparator()Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.booleancontainsKey(int k)Returns true if this function contains a mapping for the specified key.booleancontainsValue(double v)Returnstrueif this map maps one or more keys to the specified value.intfirstIntKey()Returns the first (lowest) key currently in this map.doubleget(int k)Returns the value to which the given key is mapped.Int2DoubleSortedMapheadMap(int to)Returns a view of the portion of this sorted map whose keys are strictly less thantoKey.ObjectSortedSet<Int2DoubleMap.Entry>int2DoubleEntrySet()Returns a type-specific sorted-set view of the mappings contained in this map.booleanisEmpty()IntSortedSetkeySet()Returns a type-specific sorted set view of the keys contained in this map.intlastIntKey()Returns the last (highest) key currently in this map.doubleput(int k, double v)Adds a pair to the map (optional operation).doubleremove(int k)Removes the mapping with the given key (optional operation).intsize()Returns the number of key/value mappings in this map.Int2DoubleSortedMapsubMap(int from, int to)Returns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.Int2DoubleSortedMaptailMap(int from)Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey.DoubleCollectionvalues()Returns a type-specific collection view of the values contained in this map.-
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2DoubleMap
equals, hashCode, putAll, toString
-
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2DoubleFunction
defaultReturnValue, defaultReturnValue
-
Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2DoubleFunction
applyAsDouble
-
Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2DoubleMap
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.ints.Int2DoubleSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMap
-
Methods inherited from interface java.util.Map
containsKey, equals, forEach, get, hashCode, put, putAll, remove, replaceAll
-
-
-
-
Constructor Detail
-
Int2DoubleRBTreeMap
public Int2DoubleRBTreeMap()
Creates a new empty tree map.
-
Int2DoubleRBTreeMap
public Int2DoubleRBTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.- Parameters:
c- a (possibly type-specific) comparator.
-
Int2DoubleRBTreeMap
public Int2DoubleRBTreeMap(Map<? extends Integer,? extends Double> m)
Creates a new tree map copying a given map.- Parameters:
m- aMapto be copied into the new tree map.
-
Int2DoubleRBTreeMap
public Int2DoubleRBTreeMap(SortedMap<Integer,Double> m)
Creates a new tree map copying a given sorted map (and itsComparator).- Parameters:
m- aSortedMapto be copied into the new tree map.
-
Int2DoubleRBTreeMap
public Int2DoubleRBTreeMap(Int2DoubleMap m)
Creates a new tree map copying a given map.- Parameters:
m- a type-specific map to be copied into the new tree map.
-
Int2DoubleRBTreeMap
public Int2DoubleRBTreeMap(Int2DoubleSortedMap 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.
-
Int2DoubleRBTreeMap
public Int2DoubleRBTreeMap(int[] k, double[] v, Comparator<? super Integer> 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.
-
Int2DoubleRBTreeMap
public Int2DoubleRBTreeMap(int[] k, double[] 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 double addTo(int k, double 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 double put(int k, double v)Description copied from interface:Int2DoubleFunctionAdds a pair to the map (optional operation).- Specified by:
putin interfaceInt2DoubleFunction- 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 double remove(int k)
Description copied from interface:Int2DoubleFunctionRemoves the mapping with the given key (optional operation).- Specified by:
removein interfaceInt2DoubleFunction- 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(double v)
Description copied from interface:Int2DoubleMapReturnstrueif this map maps one or more keys to the specified value.- Specified by:
containsValuein interfaceInt2DoubleMap- Overrides:
containsValuein classAbstractInt2DoubleMap- See Also:
Map.containsValue(Object)
-
clear
public void clear()
Description copied from interface:Int2DoubleMapRemoves all of the mappings from this map (optional operation). The map will be empty after this call returns.
-
containsKey
public boolean containsKey(int k)
Description copied from interface:Int2DoubleMapReturns true if this function contains a mapping for the specified key.- Specified by:
containsKeyin interfaceInt2DoubleFunction- Specified by:
containsKeyin interfaceInt2DoubleMap- Overrides:
containsKeyin classAbstractInt2DoubleMap- 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:Int2DoubleMapReturns 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 double get(int k)
Description copied from interface:Int2DoubleFunctionReturns the value to which the given key is mapped.- Specified by:
getin interfaceInt2DoubleFunction- 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)
-
firstIntKey
public int firstIntKey()
Description copied from interface:Int2DoubleSortedMapReturns the first (lowest) key currently in this map.- Specified by:
firstIntKeyin interfaceInt2DoubleSortedMap- See Also:
SortedMap.firstKey()
-
lastIntKey
public int lastIntKey()
Description copied from interface:Int2DoubleSortedMapReturns the last (highest) key currently in this map.- Specified by:
lastIntKeyin interfaceInt2DoubleSortedMap- See Also:
SortedMap.lastKey()
-
int2DoubleEntrySet
public ObjectSortedSet<Int2DoubleMap.Entry> int2DoubleEntrySet()
Description copied from interface:Int2DoubleSortedMapReturns 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:
int2DoubleEntrySetin interfaceInt2DoubleMap- Specified by:
int2DoubleEntrySetin interfaceInt2DoubleSortedMap- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
Int2DoubleSortedMap.entrySet()
-
keySet
public IntSortedSet 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 interfaceInt2DoubleMap- Specified by:
keySetin interfaceInt2DoubleSortedMap- Specified by:
keySetin interfaceMap<Integer,Double>- Specified by:
keySetin interfaceSortedMap<Integer,Double>- Overrides:
keySetin classAbstractInt2DoubleSortedMap- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
Map.keySet()
-
values
public DoubleCollection 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 interfaceInt2DoubleMap- Specified by:
valuesin interfaceInt2DoubleSortedMap- Specified by:
valuesin interfaceMap<Integer,Double>- Specified by:
valuesin interfaceSortedMap<Integer,Double>- Overrides:
valuesin classAbstractInt2DoubleSortedMap- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
Map.values()
-
comparator
public IntComparator comparator()
Description copied from interface:Int2DoubleSortedMapReturns 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 interfaceInt2DoubleSortedMap- Specified by:
comparatorin interfaceSortedMap<Integer,Double>- See Also:
SortedMap.comparator()
-
headMap
public Int2DoubleSortedMap headMap(int to)
Description copied from interface:Int2DoubleSortedMapReturns 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 interfaceInt2DoubleSortedMap- See Also:
SortedMap.headMap(Object)
-
tailMap
public Int2DoubleSortedMap tailMap(int from)
Description copied from interface:Int2DoubleSortedMapReturns 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 interfaceInt2DoubleSortedMap- See Also:
SortedMap.tailMap(Object)
-
subMap
public Int2DoubleSortedMap subMap(int from, int to)
Description copied from interface:Int2DoubleSortedMapReturns 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 interfaceInt2DoubleSortedMap- See Also:
SortedMap.subMap(Object,Object)
-
clone
public Int2DoubleRBTreeMap 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.
-
-