public class Double2IntRBTreeMap extends AbstractDouble2IntSortedMap 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.
AbstractDouble2IntMap.BasicEntry, AbstractDouble2IntMap.BasicEntrySet
Double2IntSortedMap.FastSortedEntrySet
Double2IntMap.FastEntrySet
Constructor and Description |
---|
Double2IntRBTreeMap()
Creates a new empty tree map.
|
Double2IntRBTreeMap(java.util.Comparator<? super java.lang.Double> c)
Creates a new empty tree map with the given comparator.
|
Double2IntRBTreeMap(double[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Double2IntRBTreeMap(double[] k,
int[] v,
java.util.Comparator<? super java.lang.Double> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Double2IntRBTreeMap(Double2IntMap m)
Creates a new tree map copying a given map.
|
Double2IntRBTreeMap(Double2IntSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Double2IntRBTreeMap(java.util.Map<? extends java.lang.Double,? extends java.lang.Integer> m)
Creates a new tree map copying a given map.
|
Double2IntRBTreeMap(java.util.SortedMap<java.lang.Double,java.lang.Integer> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
int |
addTo(double k,
int incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Double2IntRBTreeMap |
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(int v)
Returns
true if this map maps one or more keys to the specified value. |
ObjectSortedSet<Double2IntMap.Entry> |
double2IntEntrySet()
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.
|
int |
get(double k)
Returns the value to which the given key is mapped.
|
Double2IntSortedMap |
headMap(double to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey . |
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.
|
int |
put(double k,
int v)
Adds a pair to the map (optional operation).
|
int |
remove(double k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Double2IntSortedMap |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Double2IntSortedMap |
tailMap(double from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
IntCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, mergeInt, 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, mergeInt, mergeInt, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsInt, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
public Double2IntRBTreeMap()
public Double2IntRBTreeMap(java.util.Comparator<? super java.lang.Double> c)
c
- a (possibly type-specific) comparator.public Double2IntRBTreeMap(java.util.Map<? extends java.lang.Double,? extends java.lang.Integer> m)
m
- a Map
to be copied into the new tree map.public Double2IntRBTreeMap(java.util.SortedMap<java.lang.Double,java.lang.Integer> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Double2IntRBTreeMap(Double2IntMap m)
m
- a type-specific map to be copied into the new tree map.public Double2IntRBTreeMap(Double2IntSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Double2IntRBTreeMap(double[] k, int[] v, java.util.Comparator<? super java.lang.Double> 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 Double2IntRBTreeMap(double[] k, int[] 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 int addTo(double k, int 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 int put(double k, int v)
Double2IntFunction
put
in interface Double2IntFunction
k
- the key.v
- the value.Function.put(Object,Object)
public int remove(double k)
Double2IntFunction
remove
in interface Double2IntFunction
k
- the key.Function.remove(Object)
public boolean containsValue(int v)
AbstractDouble2IntMap
true
if this map maps one or more keys to the specified value.containsValue
in interface Double2IntMap
containsValue
in class AbstractDouble2IntMap
Map.containsValue(Object)
public void clear()
Double2IntMap
clear
in interface Double2IntMap
clear
in interface java.util.Map<java.lang.Double,java.lang.Integer>
Map.clear()
public boolean containsKey(double k)
AbstractDouble2IntMap
containsKey
in interface Double2IntFunction
containsKey
in interface Double2IntMap
containsKey
in class AbstractDouble2IntMap
k
- the key.key
.Map.containsKey(Object)
public int size()
Double2IntMap
Integer.MAX_VALUE
elements, returns Integer.MAX_VALUE
.size
in interface Double2IntMap
size
in interface java.util.Map<java.lang.Double,java.lang.Integer>
Size64
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Double,java.lang.Integer>
isEmpty
in class AbstractDouble2IntMap
public int get(double k)
Double2IntFunction
get
in interface Double2IntFunction
k
- the key.Function.get(Object)
public double firstDoubleKey()
Double2IntSortedMap
firstDoubleKey
in interface Double2IntSortedMap
SortedMap.firstKey()
public double lastDoubleKey()
Double2IntSortedMap
lastDoubleKey
in interface Double2IntSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Double2IntMap.Entry> double2IntEntrySet()
Double2IntSortedMap
double2IntEntrySet
in interface Double2IntMap
double2IntEntrySet
in interface Double2IntSortedMap
Double2IntSortedMap.entrySet()
public DoubleSortedSet 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 Double2IntMap
keySet
in interface Double2IntSortedMap
keySet
in interface java.util.Map<java.lang.Double,java.lang.Integer>
keySet
in interface java.util.SortedMap<java.lang.Double,java.lang.Integer>
keySet
in class AbstractDouble2IntSortedMap
Map.keySet()
public IntCollection 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 Double2IntMap
values
in interface Double2IntSortedMap
values
in interface java.util.Map<java.lang.Double,java.lang.Integer>
values
in interface java.util.SortedMap<java.lang.Double,java.lang.Integer>
values
in class AbstractDouble2IntSortedMap
Map.values()
public DoubleComparator comparator()
Double2IntSortedMap
comparator
in interface Double2IntSortedMap
comparator
in interface java.util.SortedMap<java.lang.Double,java.lang.Integer>
SortedMap.comparator()
public Double2IntSortedMap headMap(double to)
Double2IntSortedMap
toKey
.headMap
in interface Double2IntSortedMap
SortedMap.headMap(Object)
public Double2IntSortedMap tailMap(double from)
Double2IntSortedMap
fromKey
.tailMap
in interface Double2IntSortedMap
SortedMap.tailMap(Object)
public Double2IntSortedMap subMap(double from, double to)
Double2IntSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Double2IntSortedMap
SortedMap.subMap(Object,Object)
public Double2IntRBTreeMap 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