public class Double2ReferenceRBTreeMap<V> extends AbstractDouble2ReferenceSortedMap<V> 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.
AbstractDouble2ReferenceMap.BasicEntry<V>, AbstractDouble2ReferenceMap.BasicEntrySet<V>
Double2ReferenceSortedMap.FastSortedEntrySet<V>
Double2ReferenceMap.FastEntrySet<V>
Constructor and Description |
---|
Double2ReferenceRBTreeMap()
Creates a new empty tree map.
|
Double2ReferenceRBTreeMap(java.util.Comparator<? super java.lang.Double> c)
Creates a new empty tree map with the given comparator.
|
Double2ReferenceRBTreeMap(double[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Double2ReferenceRBTreeMap(double[] k,
V[] 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.
|
Double2ReferenceRBTreeMap(Double2ReferenceMap<? extends V> m)
Creates a new tree map copying a given map.
|
Double2ReferenceRBTreeMap(Double2ReferenceSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Double2ReferenceRBTreeMap(java.util.Map<? extends java.lang.Double,? extends V> m)
Creates a new tree map copying a given map.
|
Double2ReferenceRBTreeMap(java.util.SortedMap<java.lang.Double,V> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Double2ReferenceRBTreeMap<V> |
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(java.lang.Object v) |
ObjectSortedSet<Double2ReferenceMap.Entry<V>> |
double2ReferenceEntrySet()
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.
|
V |
get(double k)
Returns the value to which the given key is mapped.
|
Double2ReferenceSortedMap<V> |
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.
|
V |
put(double k,
V v)
Adds a pair to the map (optional operation).
|
V |
remove(double k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Double2ReferenceSortedMap<V> |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Double2ReferenceSortedMap<V> |
tailMap(double from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
ReferenceCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, putAll, toString
defaultReturnValue, defaultReturnValue
entrySet, firstKey, headMap, lastKey, subMap, tailMap
compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace
andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, apply, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
public Double2ReferenceRBTreeMap()
public Double2ReferenceRBTreeMap(java.util.Comparator<? super java.lang.Double> c)
c
- a (possibly type-specific) comparator.public Double2ReferenceRBTreeMap(java.util.Map<? extends java.lang.Double,? extends V> m)
m
- a Map
to be copied into the new tree map.public Double2ReferenceRBTreeMap(java.util.SortedMap<java.lang.Double,V> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Double2ReferenceRBTreeMap(Double2ReferenceMap<? extends V> m)
m
- a type-specific map to be copied into the new tree map.public Double2ReferenceRBTreeMap(Double2ReferenceSortedMap<V> m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Double2ReferenceRBTreeMap(double[] k, V[] 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 Double2ReferenceRBTreeMap(double[] k, V[] 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 V put(double k, V v)
Double2ReferenceFunction
put
in interface Double2ReferenceFunction<V>
k
- the key.v
- the value.Function.put(Object,Object)
public V remove(double k)
Double2ReferenceFunction
remove
in interface Double2ReferenceFunction<V>
k
- the key.Function.remove(Object)
public boolean containsValue(java.lang.Object v)
AbstractDouble2ReferenceMap
containsValue
in interface java.util.Map<java.lang.Double,V>
containsValue
in class AbstractDouble2ReferenceMap<V>
public void clear()
Double2ReferenceMap
clear
in interface Double2ReferenceMap<V>
clear
in interface java.util.Map<java.lang.Double,V>
Map.clear()
public boolean containsKey(double k)
AbstractDouble2ReferenceMap
containsKey
in interface Double2ReferenceFunction<V>
containsKey
in interface Double2ReferenceMap<V>
containsKey
in class AbstractDouble2ReferenceMap<V>
k
- the key.key
.Map.containsKey(Object)
public int size()
Double2ReferenceMap
Integer.MAX_VALUE
elements, returns Integer.MAX_VALUE
.size
in interface Double2ReferenceMap<V>
size
in interface java.util.Map<java.lang.Double,V>
Size64
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Double,V>
isEmpty
in class AbstractDouble2ReferenceMap<V>
public V get(double k)
Double2ReferenceFunction
get
in interface Double2ReferenceFunction<V>
k
- the key.Function.get(Object)
public double firstDoubleKey()
Double2ReferenceSortedMap
firstDoubleKey
in interface Double2ReferenceSortedMap<V>
SortedMap.firstKey()
public double lastDoubleKey()
Double2ReferenceSortedMap
lastDoubleKey
in interface Double2ReferenceSortedMap<V>
SortedMap.lastKey()
public ObjectSortedSet<Double2ReferenceMap.Entry<V>> double2ReferenceEntrySet()
Double2ReferenceSortedMap
double2ReferenceEntrySet
in interface Double2ReferenceMap<V>
double2ReferenceEntrySet
in interface Double2ReferenceSortedMap<V>
Double2ReferenceSortedMap.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 Double2ReferenceMap<V>
keySet
in interface Double2ReferenceSortedMap<V>
keySet
in interface java.util.Map<java.lang.Double,V>
keySet
in interface java.util.SortedMap<java.lang.Double,V>
keySet
in class AbstractDouble2ReferenceSortedMap<V>
Map.keySet()
public ReferenceCollection<V> 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 Double2ReferenceMap<V>
values
in interface Double2ReferenceSortedMap<V>
values
in interface java.util.Map<java.lang.Double,V>
values
in interface java.util.SortedMap<java.lang.Double,V>
values
in class AbstractDouble2ReferenceSortedMap<V>
Map.values()
public DoubleComparator comparator()
Double2ReferenceSortedMap
comparator
in interface Double2ReferenceSortedMap<V>
comparator
in interface java.util.SortedMap<java.lang.Double,V>
SortedMap.comparator()
public Double2ReferenceSortedMap<V> headMap(double to)
Double2ReferenceSortedMap
toKey
.headMap
in interface Double2ReferenceSortedMap<V>
SortedMap.headMap(Object)
public Double2ReferenceSortedMap<V> tailMap(double from)
Double2ReferenceSortedMap
fromKey
.tailMap
in interface Double2ReferenceSortedMap<V>
SortedMap.tailMap(Object)
public Double2ReferenceSortedMap<V> subMap(double from, double to)
Double2ReferenceSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Double2ReferenceSortedMap<V>
SortedMap.subMap(Object,Object)
public Double2ReferenceRBTreeMap<V> 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