public class Double2ShortAVLTreeMap extends AbstractDouble2ShortSortedMap 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.
AbstractDouble2ShortMap.BasicEntry
Double2ShortSortedMap.FastSortedEntrySet
Double2ShortMap.FastEntrySet
Constructor and Description |
---|
Double2ShortAVLTreeMap()
Creates a new empty tree map.
|
Double2ShortAVLTreeMap(Comparator<? super Double> c)
Creates a new empty tree map with the given comparator.
|
Double2ShortAVLTreeMap(double[] k,
short[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Double2ShortAVLTreeMap(double[] k,
short[] v,
Comparator<? super Double> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Double2ShortAVLTreeMap(Double2ShortMap m)
Creates a new tree map copying a given map.
|
Double2ShortAVLTreeMap(Double2ShortSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Double2ShortAVLTreeMap(Map<? extends Double,? extends Short> m)
Creates a new tree map copying a given map.
|
Double2ShortAVLTreeMap(SortedMap<Double,Short> 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).
|
Double2ShortAVLTreeMap |
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)
Checks whether the given value is contained in
AbstractDouble2ShortMap.keySet() . |
boolean |
containsValue(short v)
Checks whether the given value is contained in
AbstractDouble2ShortMap.values() . |
ObjectSortedSet<Double2ShortMap.Entry> |
double2ShortEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
double |
firstDoubleKey() |
short |
get(double k)
Returns the value to which the given key is mapped.
|
Double2ShortSortedMap |
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() |
short |
put(double k,
short v)
Adds a pair to the map.
|
Short |
put(Double ok,
Short ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
short |
remove(double k)
Removes the mapping with the given key.
|
Short |
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.
|
Double2ShortSortedMap |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Double2ShortSortedMap |
tailMap(double from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
ShortCollection |
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 Double2ShortAVLTreeMap()
public Double2ShortAVLTreeMap(Comparator<? super Double> c)
c
- a (possibly type-specific) comparator.public Double2ShortAVLTreeMap(Map<? extends Double,? extends Short> m)
m
- a Map
to be copied into the new tree map.public Double2ShortAVLTreeMap(SortedMap<Double,Short> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Double2ShortAVLTreeMap(Double2ShortMap m)
m
- a type-specific map to be copied into the new tree map.public Double2ShortAVLTreeMap(Double2ShortSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Double2ShortAVLTreeMap(double[] k, short[] 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 Double2ShortAVLTreeMap(double[] k, short[] 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 short put(double k, short v)
Double2ShortFunction
put
in interface Double2ShortFunction
put
in class AbstractDouble2ShortFunction
k
- the key.v
- the value.Function.put(Object,Object)
public short remove(double k)
Double2ShortFunction
remove
in interface Double2ShortFunction
remove
in class AbstractDouble2ShortFunction
k
- the key.Function.remove(Object)
public Short put(Double ok, Short ov)
AbstractDouble2ShortFunction
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<Double,Short>
put
in interface Map<Double,Short>
put
in class AbstractDouble2ShortFunction
ok
- the key.ov
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public Short remove(Object ok)
AbstractDouble2ShortFunction
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(short v)
AbstractDouble2ShortMap
AbstractDouble2ShortMap.values()
.containsValue
in interface Double2ShortMap
containsValue
in class AbstractDouble2ShortMap
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(double k)
AbstractDouble2ShortMap
AbstractDouble2ShortMap.keySet()
.containsKey
in interface Double2ShortFunction
containsKey
in class AbstractDouble2ShortMap
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 short get(double k)
Double2ShortFunction
get
in interface Double2ShortFunction
k
- the key.Function.get(Object)
public double firstDoubleKey()
firstDoubleKey
in interface Double2ShortSortedMap
SortedMap.firstKey()
public double lastDoubleKey()
lastDoubleKey
in interface Double2ShortSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Double2ShortMap.Entry> double2ShortEntrySet()
Double2ShortSortedMap
double2ShortEntrySet
in interface Double2ShortMap
double2ShortEntrySet
in interface Double2ShortSortedMap
Double2ShortSortedMap.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 Double2ShortMap
keySet
in interface Double2ShortSortedMap
keySet
in interface Map<Double,Short>
keySet
in interface SortedMap<Double,Short>
keySet
in class AbstractDouble2ShortSortedMap
Map.keySet()
public ShortCollection 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 Double2ShortMap
values
in interface Double2ShortSortedMap
values
in interface Map<Double,Short>
values
in interface SortedMap<Double,Short>
values
in class AbstractDouble2ShortSortedMap
Map.values()
public DoubleComparator comparator()
Double2ShortSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Double2ShortSortedMap
comparator
in interface SortedMap<Double,Short>
SortedMap.comparator()
public Double2ShortSortedMap headMap(double to)
Double2ShortSortedMap
toKey
.headMap
in interface Double2ShortSortedMap
SortedMap.headMap(Object)
public Double2ShortSortedMap tailMap(double from)
Double2ShortSortedMap
fromKey
.tailMap
in interface Double2ShortSortedMap
SortedMap.tailMap(Object)
public Double2ShortSortedMap subMap(double from, double to)
Double2ShortSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Double2ShortSortedMap
SortedMap.subMap(Object,Object)
public Double2ShortAVLTreeMap 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.