public class Int2DoubleRBTreeMap extends AbstractInt2DoubleSortedMap implements java.io.Serializable, java.lang.Cloneable
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.
AbstractInt2DoubleMap.BasicEntry, AbstractInt2DoubleMap.BasicEntrySet
Int2DoubleSortedMap.FastSortedEntrySet
Int2DoubleMap.FastEntrySet
Constructor and Description |
---|
Int2DoubleRBTreeMap()
Creates a new empty tree map.
|
Int2DoubleRBTreeMap(java.util.Comparator<? super java.lang.Integer> c)
Creates a new empty tree map with the given comparator.
|
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 its
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 its
Comparator ). |
Modifier and Type | Method and 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)
Returns
true 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 than
toKey . |
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 from
fromKey , inclusive, to toKey , exclusive. |
Int2DoubleSortedMap |
tailMap(int from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
DoubleCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, mergeDouble, putAll, toString
defaultReturnValue, defaultReturnValue
entrySet, firstKey, headMap, lastKey, subMap, tailMap
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
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsDouble, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
public Int2DoubleRBTreeMap()
public Int2DoubleRBTreeMap(java.util.Comparator<? super java.lang.Integer> c)
c
- a (possibly type-specific) comparator.public Int2DoubleRBTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Double> m)
m
- a Map
to be copied into the new tree map.public Int2DoubleRBTreeMap(java.util.SortedMap<java.lang.Integer,java.lang.Double> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Int2DoubleRBTreeMap(Int2DoubleMap m)
m
- a type-specific map to be copied into the new tree map.public Int2DoubleRBTreeMap(Int2DoubleSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Int2DoubleRBTreeMap(int[] k, double[] v, java.util.Comparator<? super java.lang.Integer> c)
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.java.lang.IllegalArgumentException
- if k
and v
have different lengths.public Int2DoubleRBTreeMap(int[] k, double[] v)
k
- the array of keys of the new tree map.v
- the array of corresponding values in the new tree map.java.lang.IllegalArgumentException
- if k
and v
have different lengths.public double addTo(int k, double incr)
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.
k
- the key.incr
- the increment.public double put(int k, double v)
Int2DoubleFunction
put
in interface Int2DoubleFunction
k
- the key.v
- the value.Function.put(Object,Object)
public double remove(int k)
Int2DoubleFunction
remove
in interface Int2DoubleFunction
k
- the key.Function.remove(Object)
public boolean containsValue(double v)
AbstractInt2DoubleMap
true
if this map maps one or more keys to the specified value.containsValue
in interface Int2DoubleMap
containsValue
in class AbstractInt2DoubleMap
Map.containsValue(Object)
public void clear()
Int2DoubleMap
clear
in interface Int2DoubleMap
clear
in interface java.util.Map<java.lang.Integer,java.lang.Double>
Map.clear()
public boolean containsKey(int k)
AbstractInt2DoubleMap
containsKey
in interface Int2DoubleFunction
containsKey
in interface Int2DoubleMap
containsKey
in class AbstractInt2DoubleMap
k
- the key.key
.Map.containsKey(Object)
public int size()
Int2DoubleMap
Integer.MAX_VALUE
elements, returns Integer.MAX_VALUE
.size
in interface Int2DoubleMap
size
in interface java.util.Map<java.lang.Integer,java.lang.Double>
Size64
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Integer,java.lang.Double>
isEmpty
in class AbstractInt2DoubleMap
public double get(int k)
Int2DoubleFunction
get
in interface Int2DoubleFunction
k
- the key.Function.get(Object)
public int firstIntKey()
Int2DoubleSortedMap
firstIntKey
in interface Int2DoubleSortedMap
SortedMap.firstKey()
public int lastIntKey()
Int2DoubleSortedMap
lastIntKey
in interface Int2DoubleSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Int2DoubleMap.Entry> int2DoubleEntrySet()
Int2DoubleSortedMap
int2DoubleEntrySet
in interface Int2DoubleMap
int2DoubleEntrySet
in interface Int2DoubleSortedMap
Int2DoubleSortedMap.entrySet()
public IntSortedSet keySet()
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.
keySet
in interface Int2DoubleMap
keySet
in interface Int2DoubleSortedMap
keySet
in interface java.util.Map<java.lang.Integer,java.lang.Double>
keySet
in interface java.util.SortedMap<java.lang.Integer,java.lang.Double>
keySet
in class AbstractInt2DoubleSortedMap
Map.keySet()
public DoubleCollection values()
In addition to the semantics of Map.values()
, you can
safely cast the collection returned by this call to a type-specific collection
interface.
values
in interface Int2DoubleMap
values
in interface Int2DoubleSortedMap
values
in interface java.util.Map<java.lang.Integer,java.lang.Double>
values
in interface java.util.SortedMap<java.lang.Integer,java.lang.Double>
values
in class AbstractInt2DoubleSortedMap
Map.values()
public IntComparator comparator()
Int2DoubleSortedMap
comparator
in interface Int2DoubleSortedMap
comparator
in interface java.util.SortedMap<java.lang.Integer,java.lang.Double>
SortedMap.comparator()
public Int2DoubleSortedMap headMap(int to)
Int2DoubleSortedMap
toKey
.headMap
in interface Int2DoubleSortedMap
SortedMap.headMap(Object)
public Int2DoubleSortedMap tailMap(int from)
Int2DoubleSortedMap
fromKey
.tailMap
in interface Int2DoubleSortedMap
SortedMap.tailMap(Object)
public Int2DoubleSortedMap subMap(int from, int to)
Int2DoubleSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Int2DoubleSortedMap
SortedMap.subMap(Object,Object)
public Int2DoubleRBTreeMap clone()
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.
clone
in class java.lang.Object