public class Long2DoubleAVLTreeMap extends AbstractLong2DoubleSortedMap 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.
AbstractLong2DoubleMap.BasicEntry
Long2DoubleSortedMap.FastSortedEntrySet
Long2DoubleMap.FastEntrySet
Constructor and Description |
---|
Long2DoubleAVLTreeMap()
Creates a new empty tree map.
|
Long2DoubleAVLTreeMap(Comparator<? super 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,
Comparator<? super 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(Map<? extends Long,? extends Double> m)
Creates a new tree map copying a given map.
|
Long2DoubleAVLTreeMap(SortedMap<Long,Double> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
void |
clear()
Removes all associations from this function (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)
Checks whether the given value is contained in
AbstractLong2DoubleMap.keySet() . |
boolean |
containsValue(double v)
Checks whether the given value is contained in
AbstractLong2DoubleMap.values() . |
long |
firstLongKey() |
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() |
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.
|
Double |
put(Long ok,
Double ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
double |
remove(long k)
Removes the mapping with the given key.
|
Double |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMap
containsValue, equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get
defaultReturnValue, defaultReturnValue
containsKey, get
containsKey, containsValue, equals, get, hashCode, putAll
public Long2DoubleAVLTreeMap()
public Long2DoubleAVLTreeMap(Comparator<? super Long> c)
c
- a (possibly type-specific) comparator.public Long2DoubleAVLTreeMap(Map<? extends Long,? extends Double> m)
m
- a Map
to be copied into the new tree map.public Long2DoubleAVLTreeMap(SortedMap<Long,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, Comparator<? super 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.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.IllegalArgumentException
- if k
and v
have different lengths.public double put(long k, double v)
Long2DoubleFunction
put
in interface Long2DoubleFunction
put
in class AbstractLong2DoubleFunction
k
- the key.v
- the value.Function.put(Object,Object)
public double remove(long k)
Long2DoubleFunction
remove
in interface Long2DoubleFunction
remove
in class AbstractLong2DoubleFunction
k
- the key.Function.remove(Object)
public Double put(Long ok, Double ov)
AbstractLong2DoubleFunction
null
on a missing key.
This method must check whether the provided key is in the map using containsKey()
. Thus,
it probes the map twice. Implementors of subclasses should override it with a more efficient method.
public Double remove(Object ok)
AbstractLong2DoubleFunction
null
on a missing key.
This method must check whether the provided key is in the map using containsKey()
. Thus,
it probes the map twice. Implementors of subclasses should override it with a more efficient method.
public boolean containsValue(double v)
AbstractLong2DoubleMap
AbstractLong2DoubleMap.values()
.containsValue
in interface Long2DoubleMap
containsValue
in class AbstractLong2DoubleMap
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(long k)
AbstractLong2DoubleMap
AbstractLong2DoubleMap.keySet()
.containsKey
in interface Long2DoubleFunction
containsKey
in class AbstractLong2DoubleMap
Function.containsKey(Object)
public int size()
Function
Most function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
public boolean isEmpty()
public double get(long k)
Long2DoubleFunction
get
in interface Long2DoubleFunction
k
- the key.Function.get(Object)
public long firstLongKey()
firstLongKey
in interface Long2DoubleSortedMap
SortedMap.firstKey()
public long lastLongKey()
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 Map<Long,Double>
keySet
in interface SortedMap<Long,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 Map<Long,Double>
values
in interface SortedMap<Long,Double>
values
in class AbstractLong2DoubleSortedMap
Map.values()
public LongComparator comparator()
Long2DoubleSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Long2DoubleSortedMap
comparator
in interface SortedMap<Long,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.