|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.shorts.AbstractShort2DoubleFunction
it.unimi.dsi.fastutil.shorts.AbstractShort2DoubleMap
it.unimi.dsi.fastutil.shorts.AbstractShort2DoubleSortedMap
it.unimi.dsi.fastutil.shorts.Short2DoubleAVLTreeMap
public class Short2DoubleAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
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.
Nested Class Summary |
---|
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2DoubleMap |
---|
AbstractShort2DoubleMap.BasicEntry |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.shorts.Short2DoubleSortedMap |
---|
Short2DoubleSortedMap.FastSortedEntrySet |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.shorts.Short2DoubleMap |
---|
Short2DoubleMap.FastEntrySet |
Field Summary | |
---|---|
static long |
serialVersionUID
|
Constructor Summary | |
---|---|
Short2DoubleAVLTreeMap()
Creates a new empty tree map. |
|
Short2DoubleAVLTreeMap(java.util.Comparator<? super java.lang.Short> c)
Creates a new empty tree map with the given comparator. |
|
Short2DoubleAVLTreeMap(java.util.Map<? extends java.lang.Short,? extends java.lang.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,
java.util.Comparator<? super java.lang.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(java.util.SortedMap<java.lang.Short,java.lang.Double> m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
Method Summary | |
---|---|
void |
clear()
Removes all associations from this function (optional operation). |
java.lang.Object |
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. |
java.lang.Double |
put(java.lang.Short ok,
java.lang.Double ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
java.lang.Double |
remove(java.lang.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 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. |
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2DoubleSortedMap |
---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2DoubleMap |
---|
containsValue, equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2DoubleFunction |
---|
containsKey, defaultReturnValue, defaultReturnValue, get |
Methods inherited from class java.lang.Object |
---|
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.shorts.Short2DoubleFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from interface it.unimi.dsi.fastutil.Function |
---|
containsKey, get |
Methods inherited from interface java.util.Map |
---|
containsKey, containsValue, equals, get, hashCode, putAll |
Methods inherited from interface java.util.Map |
---|
containsKey, containsValue, equals, get, hashCode, putAll |
Field Detail |
---|
public static final long serialVersionUID
Constructor Detail |
---|
public Short2DoubleAVLTreeMap()
public Short2DoubleAVLTreeMap(java.util.Comparator<? super java.lang.Short> c)
c
- a (possibly type-specific) comparator.public Short2DoubleAVLTreeMap(java.util.Map<? extends java.lang.Short,? extends java.lang.Double> m)
m
- a Map
to be copied into the new tree map.public Short2DoubleAVLTreeMap(java.util.SortedMap<java.lang.Short,java.lang.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, java.util.Comparator<? super java.lang.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.
java.lang.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.
java.lang.IllegalArgumentException
- if k
and v
have different lengths.Method Detail |
---|
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 java.lang.Double put(java.lang.Short ok, java.lang.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<java.lang.Short,java.lang.Double>
put
in interface java.util.Map<java.lang.Short,java.lang.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 java.lang.Double remove(java.lang.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.
remove
in interface Function<java.lang.Short,java.lang.Double>
remove
in interface java.util.Map<java.lang.Short,java.lang.Double>
remove
in class AbstractShort2DoubleFunction
null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(double v)
AbstractShort2DoubleMap
AbstractShort2DoubleMap.values()
.
containsValue
in interface Short2DoubleMap
containsValue
in class AbstractShort2DoubleMap
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<java.lang.Short,java.lang.Double>
clear
in interface java.util.Map<java.lang.Short,java.lang.Double>
clear
in class AbstractShort2DoubleFunction
Map.clear()
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.
size
in interface Function<java.lang.Short,java.lang.Double>
size
in interface java.util.Map<java.lang.Short,java.lang.Double>
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Short,java.lang.Double>
isEmpty
in class AbstractShort2DoubleMap
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()
Short2DoubleMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Short2DoubleMap.entrySet()
so that it returns an ObjectSet
of objects of type Short2DoubleMap.Entry
(the latter makes it possible to
access keys and values with type-specific methods).
short2DoubleEntrySet
in interface Short2DoubleMap
short2DoubleEntrySet
in interface Short2DoubleSortedMap
Short2DoubleMap.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 java.util.Map<java.lang.Short,java.lang.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 java.util.Map<java.lang.Short,java.lang.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 java.util.SortedMap<java.lang.Short,java.lang.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 java.lang.Object 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
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |