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<java.lang.Integer,java.lang.Double>
,Int2DoubleFunction
,Int2DoubleMap
,Int2DoubleSortedMap
,java.io.Serializable
,java.lang.Cloneable
,java.util.function.Function<java.lang.Integer,java.lang.Double>
,java.util.function.IntToDoubleFunction
,java.util.Map<java.lang.Integer,java.lang.Double>
,java.util.SortedMap<java.lang.Integer,java.lang.Double>
public class Int2DoubleRBTreeMap extends AbstractInt2DoubleSortedMap implements java.io.Serializable, java.lang.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, java.util.Comparator<? super java.lang.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(java.util.Comparator<? super java.lang.Integer> c)
Creates a new empty tree map with the given comparator.Int2DoubleRBTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Double> m)
Creates a new tree map copying a given map.Int2DoubleRBTreeMap(java.util.SortedMap<java.lang.Integer,java.lang.Double> 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 double
addTo(int k, double incr)
Adds an increment to value currently associated with a key.void
clear()
Removes all of the mappings from this map (optional operation).Int2DoubleRBTreeMap
clone()
Returns a deep copy of this tree map.IntComparator
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.boolean
containsKey(int k)
Returns true if this function contains a mapping for the specified key.boolean
containsValue(double v)
Returnstrue
if this map maps one or more keys to the specified value.int
firstIntKey()
Returns the first (lowest) key currently in this map.double
get(int k)
Returns the value to which the given key is mapped.Int2DoubleSortedMap
headMap(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.boolean
isEmpty()
IntSortedSet
keySet()
Returns a type-specific sorted set view of the keys contained in this map.int
lastIntKey()
Returns the last (highest) key currently in this map.double
put(int k, double v)
Adds a pair to the map (optional operation).double
remove(int k)
Removes the mapping with the given key (optional operation).int
size()
Returns the number of key/value mappings in this map.Int2DoubleSortedMap
subMap(int from, int to)
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.Int2DoubleSortedMap
tailMap(int from)
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.DoubleCollection
values()
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, mergeDouble, putAll, toString
-
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2DoubleFunction
defaultReturnValue, defaultReturnValue
-
Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2DoubleFunction
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsDouble, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
-
Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2DoubleMap
compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, merge, mergeDouble, mergeDouble, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
-
-
-
-
Constructor Detail
-
Int2DoubleRBTreeMap
public Int2DoubleRBTreeMap()
Creates a new empty tree map.
-
Int2DoubleRBTreeMap
public Int2DoubleRBTreeMap(java.util.Comparator<? super java.lang.Integer> c)
Creates a new empty tree map with the given comparator.- Parameters:
c
- a (possibly type-specific) comparator.
-
Int2DoubleRBTreeMap
public Int2DoubleRBTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Double> m)
Creates a new tree map copying a given map.- Parameters:
m
- aMap
to be copied into the new tree map.
-
Int2DoubleRBTreeMap
public Int2DoubleRBTreeMap(java.util.SortedMap<java.lang.Integer,java.lang.Double> m)
Creates a new tree map copying a given sorted map (and itsComparator
).- Parameters:
m
- aSortedMap
to 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, java.util.Comparator<? super java.lang.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:
java.lang.IllegalArgumentException
- ifk
andv
have 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:
java.lang.IllegalArgumentException
- ifk
andv
have 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:Int2DoubleFunction
Adds a pair to the map (optional operation).- Specified by:
put
in 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:Int2DoubleFunction
Removes the mapping with the given key (optional operation).- Specified by:
remove
in 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 class:AbstractInt2DoubleMap
Returnstrue
if this map maps one or more keys to the specified value.- Specified by:
containsValue
in interfaceInt2DoubleMap
- Overrides:
containsValue
in classAbstractInt2DoubleMap
- See Also:
Map.containsValue(Object)
-
clear
public void clear()
Description copied from interface:Int2DoubleMap
Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.- Specified by:
clear
in interfaceFunction<java.lang.Integer,java.lang.Double>
- Specified by:
clear
in interfaceInt2DoubleMap
- Specified by:
clear
in interfacejava.util.Map<java.lang.Integer,java.lang.Double>
- See Also:
Map.clear()
-
containsKey
public boolean containsKey(int k)
Description copied from class:AbstractInt2DoubleMap
Returns true if this function contains a mapping for the specified key.- Specified by:
containsKey
in interfaceInt2DoubleFunction
- Specified by:
containsKey
in interfaceInt2DoubleMap
- Overrides:
containsKey
in 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:Int2DoubleMap
Returns the number of key/value mappings in this map. If the map contains more thanInteger.MAX_VALUE
elements, returnsInteger.MAX_VALUE
.- Specified by:
size
in interfaceFunction<java.lang.Integer,java.lang.Double>
- Specified by:
size
in interfaceInt2DoubleMap
- Specified by:
size
in interfacejava.util.Map<java.lang.Integer,java.lang.Double>
- Returns:
- the number of key-value mappings in this map.
- See Also:
Size64
-
isEmpty
public boolean isEmpty()
- Specified by:
isEmpty
in interfacejava.util.Map<java.lang.Integer,java.lang.Double>
- Overrides:
isEmpty
in classAbstractInt2DoubleMap
-
get
public double get(int k)
Description copied from interface:Int2DoubleFunction
Returns the value to which the given key is mapped.- Specified by:
get
in 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:Int2DoubleSortedMap
Returns the first (lowest) key currently in this map.- Specified by:
firstIntKey
in interfaceInt2DoubleSortedMap
- See Also:
SortedMap.firstKey()
-
lastIntKey
public int lastIntKey()
Description copied from interface:Int2DoubleSortedMap
Returns the last (highest) key currently in this map.- Specified by:
lastIntKey
in interfaceInt2DoubleSortedMap
- See Also:
SortedMap.lastKey()
-
int2DoubleEntrySet
public ObjectSortedSet<Int2DoubleMap.Entry> int2DoubleEntrySet()
Description copied from interface:Int2DoubleSortedMap
Returns a type-specific sorted-set view of the mappings contained in this map.- Specified by:
int2DoubleEntrySet
in interfaceInt2DoubleMap
- Specified by:
int2DoubleEntrySet
in 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:
keySet
in interfaceInt2DoubleMap
- Specified by:
keySet
in interfaceInt2DoubleSortedMap
- Specified by:
keySet
in interfacejava.util.Map<java.lang.Integer,java.lang.Double>
- Specified by:
keySet
in interfacejava.util.SortedMap<java.lang.Integer,java.lang.Double>
- Overrides:
keySet
in 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:
values
in interfaceInt2DoubleMap
- Specified by:
values
in interfaceInt2DoubleSortedMap
- Specified by:
values
in interfacejava.util.Map<java.lang.Integer,java.lang.Double>
- Specified by:
values
in interfacejava.util.SortedMap<java.lang.Integer,java.lang.Double>
- Overrides:
values
in 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:Int2DoubleSortedMap
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.- Specified by:
comparator
in interfaceInt2DoubleSortedMap
- Specified by:
comparator
in interfacejava.util.SortedMap<java.lang.Integer,java.lang.Double>
- See Also:
SortedMap.comparator()
-
headMap
public Int2DoubleSortedMap headMap(int to)
Description copied from interface:Int2DoubleSortedMap
Returns a view of the portion of this sorted map whose keys are strictly less thantoKey
.- Specified by:
headMap
in interfaceInt2DoubleSortedMap
- See Also:
SortedMap.headMap(Object)
-
tailMap
public Int2DoubleSortedMap tailMap(int from)
Description copied from interface:Int2DoubleSortedMap
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.- Specified by:
tailMap
in interfaceInt2DoubleSortedMap
- See Also:
SortedMap.tailMap(Object)
-
subMap
public Int2DoubleSortedMap subMap(int from, int to)
Description copied from interface:Int2DoubleSortedMap
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.- Specified by:
subMap
in 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.
-
-