public class Double2IntRBTreeMap extends AbstractDouble2IntSortedMap implements Serializable, 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.BasicEntrySetDouble2IntSortedMap.FastSortedEntrySetDouble2IntMap.FastEntrySet| Constructor and Description |
|---|
Double2IntRBTreeMap()
Creates a new empty tree map.
|
Double2IntRBTreeMap(Comparator<? super 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,
Comparator<? super 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(Map<? extends Double,? extends Integer> m)
Creates a new tree map copying a given map.
|
Double2IntRBTreeMap(SortedMap<Double,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, putAll, toStringdefaultReturnValue, defaultReturnValueentrySet, firstKey, headMap, lastKey, subMap, tailMapcompute, 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, replaceapplyAsIntpublic Double2IntRBTreeMap()
public Double2IntRBTreeMap(Comparator<? super Double> c)
c - a (possibly type-specific) comparator.public Double2IntRBTreeMap(Map<? extends Double,? extends Integer> m)
m - a Map to be copied into the new tree map.public Double2IntRBTreeMap(SortedMap<Double,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,
Comparator<? super 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.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.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)
Double2IntFunctionput in interface Double2IntFunctionk - the key.v - the value.Function.put(Object,Object)public int remove(double k)
Double2IntFunctionremove in interface Double2IntFunctionk - the key.Function.remove(Object)public boolean containsValue(int v)
Double2IntMaptrue if this map maps one or more keys to the specified value.containsValue in interface Double2IntMapcontainsValue in class AbstractDouble2IntMapMap.containsValue(Object)public void clear()
Double2IntMapclear in interface Double2IntMapclear in interface Map<Double,Integer>Map.clear()public boolean containsKey(double k)
Double2IntMapcontainsKey in interface Double2IntFunctioncontainsKey in interface Double2IntMapcontainsKey in class AbstractDouble2IntMapk - the key.key.Map.containsKey(Object)public int size()
Double2IntMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public int get(double k)
Double2IntFunctionget in interface Double2IntFunctionk - the key.Function.get(Object)public double firstDoubleKey()
Double2IntSortedMapfirstDoubleKey in interface Double2IntSortedMapSortedMap.firstKey()public double lastDoubleKey()
Double2IntSortedMaplastDoubleKey in interface Double2IntSortedMapSortedMap.lastKey()public ObjectSortedSet<Double2IntMap.Entry> double2IntEntrySet()
Double2IntSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
double2IntEntrySet in interface Double2IntMapdouble2IntEntrySet in interface Double2IntSortedMapDouble2IntSortedMap.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 Double2IntMapkeySet in interface Double2IntSortedMapkeySet in interface Map<Double,Integer>keySet in interface SortedMap<Double,Integer>keySet in class AbstractDouble2IntSortedMapMap.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 Double2IntMapvalues in interface Double2IntSortedMapvalues in interface Map<Double,Integer>values in interface SortedMap<Double,Integer>values in class AbstractDouble2IntSortedMapMap.values()public DoubleComparator comparator()
Double2IntSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Double2IntSortedMapcomparator in interface SortedMap<Double,Integer>SortedMap.comparator()public Double2IntSortedMap headMap(double to)
Double2IntSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Double2IntSortedMapSortedMap.headMap(Object)public Double2IntSortedMap tailMap(double from)
Double2IntSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Double2IntSortedMapSortedMap.tailMap(Object)public Double2IntSortedMap subMap(double from, double to)
Double2IntSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Double2IntSortedMapSortedMap.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.