public class Long2DoubleAVLTreeMap extends AbstractLong2DoubleSortedMap 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.
AbstractLong2DoubleMap.BasicEntry, AbstractLong2DoubleMap.BasicEntrySet
Long2DoubleSortedMap.FastSortedEntrySet
Long2DoubleMap.FastEntrySet
Constructor and Description |
---|
Long2DoubleAVLTreeMap()
Creates a new empty tree map.
|
Long2DoubleAVLTreeMap(java.util.Comparator<? super java.lang.Long> c)
Creates a new empty tree map with the given comparator.
|
Long2DoubleAVLTreeMap(long[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Long2DoubleAVLTreeMap(long[] k,
double[] v,
java.util.Comparator<? super java.lang.Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Long2DoubleAVLTreeMap(Long2DoubleMap m)
Creates a new tree map copying a given map.
|
Long2DoubleAVLTreeMap(Long2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Long2DoubleAVLTreeMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Double> m)
Creates a new tree map copying a given map.
|
Long2DoubleAVLTreeMap(java.util.SortedMap<java.lang.Long,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(long 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).
|
Long2DoubleAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
LongComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(long 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. |
long |
firstLongKey()
Returns the first (lowest) key currently in this map.
|
double |
get(long k)
Returns the value to which the given key is mapped.
|
Long2DoubleSortedMap |
headMap(long to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey . |
boolean |
isEmpty() |
LongSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
long |
lastLongKey()
Returns the last (highest) key currently in this map.
|
ObjectSortedSet<Long2DoubleMap.Entry> |
long2DoubleEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
double |
put(long k,
double v)
Adds a pair to the map (optional operation).
|
double |
remove(long k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Long2DoubleSortedMap |
subMap(long from,
long to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Long2DoubleSortedMap |
tailMap(long 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 Long2DoubleAVLTreeMap()
public Long2DoubleAVLTreeMap(java.util.Comparator<? super java.lang.Long> c)
c
- a (possibly type-specific) comparator.public Long2DoubleAVLTreeMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Double> m)
m
- a Map
to be copied into the new tree map.public Long2DoubleAVLTreeMap(java.util.SortedMap<java.lang.Long,java.lang.Double> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Long2DoubleAVLTreeMap(Long2DoubleMap m)
m
- a type-specific map to be copied into the new tree map.public Long2DoubleAVLTreeMap(Long2DoubleSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Long2DoubleAVLTreeMap(long[] k, double[] v, java.util.Comparator<? super java.lang.Long> 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 Long2DoubleAVLTreeMap(long[] 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(long 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(long k, double v)
Long2DoubleFunction
put
in interface Long2DoubleFunction
k
- the key.v
- the value.Function.put(Object,Object)
public double remove(long k)
Long2DoubleFunction
remove
in interface Long2DoubleFunction
k
- the key.Function.remove(Object)
public boolean containsValue(double v)
AbstractLong2DoubleMap
true
if this map maps one or more keys to the specified value.containsValue
in interface Long2DoubleMap
containsValue
in class AbstractLong2DoubleMap
Map.containsValue(Object)
public void clear()
Long2DoubleMap
clear
in interface Long2DoubleMap
clear
in interface java.util.Map<java.lang.Long,java.lang.Double>
Map.clear()
public boolean containsKey(long k)
AbstractLong2DoubleMap
containsKey
in interface Long2DoubleFunction
containsKey
in interface Long2DoubleMap
containsKey
in class AbstractLong2DoubleMap
k
- the key.key
.Map.containsKey(Object)
public int size()
Long2DoubleMap
Integer.MAX_VALUE
elements, returns Integer.MAX_VALUE
.size
in interface Long2DoubleMap
size
in interface java.util.Map<java.lang.Long,java.lang.Double>
Size64
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Long,java.lang.Double>
isEmpty
in class AbstractLong2DoubleMap
public double get(long k)
Long2DoubleFunction
get
in interface Long2DoubleFunction
k
- the key.Function.get(Object)
public long firstLongKey()
Long2DoubleSortedMap
firstLongKey
in interface Long2DoubleSortedMap
SortedMap.firstKey()
public long lastLongKey()
Long2DoubleSortedMap
lastLongKey
in interface Long2DoubleSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Long2DoubleMap.Entry> long2DoubleEntrySet()
Long2DoubleSortedMap
long2DoubleEntrySet
in interface Long2DoubleMap
long2DoubleEntrySet
in interface Long2DoubleSortedMap
Long2DoubleSortedMap.entrySet()
public LongSortedSet 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 Long2DoubleMap
keySet
in interface Long2DoubleSortedMap
keySet
in interface java.util.Map<java.lang.Long,java.lang.Double>
keySet
in interface java.util.SortedMap<java.lang.Long,java.lang.Double>
keySet
in class AbstractLong2DoubleSortedMap
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 Long2DoubleMap
values
in interface Long2DoubleSortedMap
values
in interface java.util.Map<java.lang.Long,java.lang.Double>
values
in interface java.util.SortedMap<java.lang.Long,java.lang.Double>
values
in class AbstractLong2DoubleSortedMap
Map.values()
public LongComparator comparator()
Long2DoubleSortedMap
comparator
in interface Long2DoubleSortedMap
comparator
in interface java.util.SortedMap<java.lang.Long,java.lang.Double>
SortedMap.comparator()
public Long2DoubleSortedMap headMap(long to)
Long2DoubleSortedMap
toKey
.headMap
in interface Long2DoubleSortedMap
SortedMap.headMap(Object)
public Long2DoubleSortedMap tailMap(long from)
Long2DoubleSortedMap
fromKey
.tailMap
in interface Long2DoubleSortedMap
SortedMap.tailMap(Object)
public Long2DoubleSortedMap subMap(long from, long to)
Long2DoubleSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Long2DoubleSortedMap
SortedMap.subMap(Object,Object)
public Long2DoubleAVLTreeMap 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