public class Double2DoubleRBTreeMap extends AbstractDouble2DoubleSortedMap 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.
AbstractDouble2DoubleSortedMap.KeySetIterator, AbstractDouble2DoubleSortedMap.ValuesCollection, AbstractDouble2DoubleSortedMap.ValuesIteratorAbstractDouble2DoubleMap.BasicEntry, AbstractDouble2DoubleMap.BasicEntrySetDouble2DoubleSortedMap.FastSortedEntrySetDouble2DoubleMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected DoubleComparator |
actualComparator
This map's actual comparator; it may differ from
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping. |
protected int |
count
Number of entries in this map.
|
protected ObjectSortedSet<Double2DoubleMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.doubles.Double2DoubleRBTreeMap.Entry |
firstEntry
The first key in this map.
|
protected DoubleSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.doubles.Double2DoubleRBTreeMap.Entry |
lastEntry
The last key in this map.
|
protected boolean |
modified
The value of this variable remembers, after a
put()
or a remove(), whether the domain of the map
has been modified. |
protected Comparator<? super Double> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.doubles.Double2DoubleRBTreeMap.Entry |
tree
A reference to the root entry.
|
protected DoubleCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Double2DoubleRBTreeMap()
Creates a new empty tree map.
|
Double2DoubleRBTreeMap(Comparator<? super Double> c)
Creates a new empty tree map with the given comparator.
|
Double2DoubleRBTreeMap(double[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Double2DoubleRBTreeMap(double[] k,
double[] v,
Comparator<? super Double> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Double2DoubleRBTreeMap(Double2DoubleMap m)
Creates a new tree map copying a given map.
|
Double2DoubleRBTreeMap(Double2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Double2DoubleRBTreeMap(Map<? extends Double,? extends Double> m)
Creates a new tree map copying a given map.
|
Double2DoubleRBTreeMap(SortedMap<Double,Double> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
double |
addTo(double 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).
|
Double2DoubleRBTreeMap |
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(double v)
Returns
true if this map maps one or more keys to the specified value. |
ObjectSortedSet<Double2DoubleMap.Entry> |
double2DoubleEntrySet()
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.
|
double |
get(double k)
Returns the value to which the given key is mapped.
|
Double2DoubleSortedMap |
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.
|
double |
put(double k,
double v)
Adds a pair to the map (optional operation).
|
double |
remove(double k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Double2DoubleSortedMap |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Double2DoubleSortedMap |
tailMap(double 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, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitentrySet, 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, replaceapplyAsDoubleandThen, compose, identityprotected transient it.unimi.dsi.fastutil.doubles.Double2DoubleRBTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.doubles.Double2DoubleRBTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.doubles.Double2DoubleRBTreeMap.Entry lastEntry
protected transient ObjectSortedSet<Double2DoubleMap.Entry> entries
protected transient DoubleSortedSet keys
protected transient DoubleCollection values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected Comparator<? super Double> storedComparator
protected transient DoubleComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Double2DoubleRBTreeMap()
public Double2DoubleRBTreeMap(Comparator<? super Double> c)
c - a (possibly type-specific) comparator.public Double2DoubleRBTreeMap(Map<? extends Double,? extends Double> m)
m - a Map to be copied into the new tree map.public Double2DoubleRBTreeMap(SortedMap<Double,Double> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Double2DoubleRBTreeMap(Double2DoubleMap m)
m - a type-specific map to be copied into the new tree map.public Double2DoubleRBTreeMap(Double2DoubleSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Double2DoubleRBTreeMap(double[] k,
double[] 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 Double2DoubleRBTreeMap(double[] k,
double[] 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 double addTo(double 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(double k,
double v)
Double2DoubleFunctionput in interface Double2DoubleFunctionk - the key.v - the value.Function.put(Object,Object)public double remove(double k)
Double2DoubleFunctionremove in interface Double2DoubleFunctionk - the key.Function.remove(Object)public boolean containsValue(double v)
Double2DoubleMaptrue if this map maps one or more keys to the specified value.containsValue in interface Double2DoubleMapcontainsValue in class AbstractDouble2DoubleMapMap.containsValue(Object)public void clear()
Double2DoubleMapclear in interface Double2DoubleMapclear in interface Map<Double,Double>Map.clear()public boolean containsKey(double k)
Double2DoubleMapcontainsKey in interface Double2DoubleFunctioncontainsKey in interface Double2DoubleMapcontainsKey in class AbstractDouble2DoubleMapk - the key.key.Map.containsKey(Object)public int size()
Double2DoubleMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public double get(double k)
Double2DoubleFunctionget in interface Double2DoubleFunctionk - the key.Function.get(Object)public double firstDoubleKey()
Double2DoubleSortedMapfirstDoubleKey in interface Double2DoubleSortedMapSortedMap.firstKey()public double lastDoubleKey()
Double2DoubleSortedMaplastDoubleKey in interface Double2DoubleSortedMapSortedMap.lastKey()public ObjectSortedSet<Double2DoubleMap.Entry> double2DoubleEntrySet()
Double2DoubleSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
double2DoubleEntrySet in interface Double2DoubleMapdouble2DoubleEntrySet in interface Double2DoubleSortedMapDouble2DoubleSortedMap.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 Double2DoubleMapkeySet in interface Double2DoubleSortedMapkeySet in interface Map<Double,Double>keySet in interface SortedMap<Double,Double>keySet in class AbstractDouble2DoubleSortedMapMap.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 Double2DoubleMapvalues in interface Double2DoubleSortedMapvalues in interface Map<Double,Double>values in interface SortedMap<Double,Double>values in class AbstractDouble2DoubleSortedMapMap.values()public DoubleComparator comparator()
Double2DoubleSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Double2DoubleSortedMapcomparator in interface SortedMap<Double,Double>SortedMap.comparator()public Double2DoubleSortedMap headMap(double to)
Double2DoubleSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Double2DoubleSortedMapSortedMap.headMap(Object)public Double2DoubleSortedMap tailMap(double from)
Double2DoubleSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Double2DoubleSortedMapSortedMap.tailMap(Object)public Double2DoubleSortedMap subMap(double from, double to)
Double2DoubleSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Double2DoubleSortedMapSortedMap.subMap(Object,Object)public Double2DoubleRBTreeMap 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.
Copyright © 2020. All rights reserved.