public class Short2DoubleAVLTreeMap extends AbstractShort2DoubleSortedMap 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.
AbstractShort2DoubleMap.BasicEntry
Short2DoubleSortedMap.FastSortedEntrySet
Short2DoubleMap.FastEntrySet
Constructor and Description |
---|
Short2DoubleAVLTreeMap()
Creates a new empty tree map.
|
Short2DoubleAVLTreeMap(Comparator<? super Short> c)
Creates a new empty tree map with the given comparator.
|
Short2DoubleAVLTreeMap(Map<? extends Short,? extends Double> m)
Creates a new tree map copying a given map.
|
Short2DoubleAVLTreeMap(short[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Short2DoubleAVLTreeMap(short[] k,
double[] v,
Comparator<? super Short> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Short2DoubleAVLTreeMap(Short2DoubleMap m)
Creates a new tree map copying a given map.
|
Short2DoubleAVLTreeMap(Short2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Short2DoubleAVLTreeMap(SortedMap<Short,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).
|
Short2DoubleAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
ShortComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(short k)
Checks whether the given value is contained in
AbstractShort2DoubleMap.keySet() . |
boolean |
containsValue(double v)
Checks whether the given value is contained in
AbstractShort2DoubleMap.values() . |
short |
firstShortKey() |
double |
get(short k)
Returns the value to which the given key is mapped.
|
Short2DoubleSortedMap |
headMap(short to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey . |
boolean |
isEmpty() |
ShortSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
short |
lastShortKey() |
double |
put(short k,
double v)
Adds a pair to the map.
|
Double |
put(Short ok,
Double ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
Double |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
double |
remove(short k)
Removes the mapping with the given key.
|
ObjectSortedSet<Short2DoubleMap.Entry> |
short2DoubleEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Short2DoubleSortedMap |
subMap(short from,
short to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Short2DoubleSortedMap |
tailMap(short 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 Short2DoubleAVLTreeMap()
public Short2DoubleAVLTreeMap(Comparator<? super Short> c)
c
- a (possibly type-specific) comparator.public Short2DoubleAVLTreeMap(Map<? extends Short,? extends Double> m)
m
- a Map
to be copied into the new tree map.public Short2DoubleAVLTreeMap(SortedMap<Short,Double> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Short2DoubleAVLTreeMap(Short2DoubleMap m)
m
- a type-specific map to be copied into the new tree map.public Short2DoubleAVLTreeMap(Short2DoubleSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Short2DoubleAVLTreeMap(short[] k, double[] v, Comparator<? super Short> 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 Short2DoubleAVLTreeMap(short[] 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(short k, double v)
Short2DoubleFunction
put
in interface Short2DoubleFunction
put
in class AbstractShort2DoubleFunction
k
- the key.v
- the value.Function.put(Object,Object)
public double remove(short k)
Short2DoubleFunction
remove
in interface Short2DoubleFunction
remove
in class AbstractShort2DoubleFunction
Function.remove(Object)
public Double put(Short ok, Double ov)
AbstractShort2DoubleFunction
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.
put
in interface Function<Short,Double>
put
in interface Map<Short,Double>
put
in class AbstractShort2DoubleFunction
ok
- the key.ov
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public Double remove(Object ok)
AbstractShort2DoubleFunction
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)
AbstractShort2DoubleMap
AbstractShort2DoubleMap.values()
.containsValue
in interface Short2DoubleMap
containsValue
in class AbstractShort2DoubleMap
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(short k)
AbstractShort2DoubleMap
AbstractShort2DoubleMap.keySet()
.containsKey
in interface Short2DoubleFunction
containsKey
in class AbstractShort2DoubleMap
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(short k)
Short2DoubleFunction
get
in interface Short2DoubleFunction
k
- the key.Function.get(Object)
public short firstShortKey()
firstShortKey
in interface Short2DoubleSortedMap
SortedMap.firstKey()
public short lastShortKey()
lastShortKey
in interface Short2DoubleSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Short2DoubleMap.Entry> short2DoubleEntrySet()
Short2DoubleSortedMap
short2DoubleEntrySet
in interface Short2DoubleMap
short2DoubleEntrySet
in interface Short2DoubleSortedMap
Short2DoubleSortedMap.entrySet()
public ShortSortedSet 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 Short2DoubleMap
keySet
in interface Short2DoubleSortedMap
keySet
in interface Map<Short,Double>
keySet
in interface SortedMap<Short,Double>
keySet
in class AbstractShort2DoubleSortedMap
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 Short2DoubleMap
values
in interface Short2DoubleSortedMap
values
in interface Map<Short,Double>
values
in interface SortedMap<Short,Double>
values
in class AbstractShort2DoubleSortedMap
Map.values()
public ShortComparator comparator()
Short2DoubleSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Short2DoubleSortedMap
comparator
in interface SortedMap<Short,Double>
SortedMap.comparator()
public Short2DoubleSortedMap headMap(short to)
Short2DoubleSortedMap
toKey
.headMap
in interface Short2DoubleSortedMap
SortedMap.headMap(Object)
public Short2DoubleSortedMap tailMap(short from)
Short2DoubleSortedMap
fromKey
.tailMap
in interface Short2DoubleSortedMap
SortedMap.tailMap(Object)
public Short2DoubleSortedMap subMap(short from, short to)
Short2DoubleSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Short2DoubleSortedMap
SortedMap.subMap(Object,Object)
public Short2DoubleAVLTreeMap 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.