|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.floats.AbstractFloat2DoubleFunction
it.unimi.dsi.fastutil.floats.AbstractFloat2DoubleMap
it.unimi.dsi.fastutil.floats.AbstractFloat2DoubleSortedMap
it.unimi.dsi.fastutil.floats.Float2DoubleAVLTreeMap
public class Float2DoubleAVLTreeMap
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.floats.AbstractFloat2DoubleMap |
|---|
AbstractFloat2DoubleMap.BasicEntry |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.floats.Float2DoubleSortedMap |
|---|
Float2DoubleSortedMap.FastSortedEntrySet |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.floats.Float2DoubleMap |
|---|
Float2DoubleMap.FastEntrySet |
| Field Summary | |
|---|---|
static long |
serialVersionUID
|
| Constructor Summary | |
|---|---|
Float2DoubleAVLTreeMap()
Creates a new empty tree map. |
|
Float2DoubleAVLTreeMap(Comparator<? super Float> c)
Creates a new empty tree map with the given comparator. |
|
Float2DoubleAVLTreeMap(float[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Float2DoubleAVLTreeMap(float[] k,
double[] v,
Comparator<? super Float> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Float2DoubleAVLTreeMap(Float2DoubleMap m)
Creates a new tree map copying a given map. |
|
Float2DoubleAVLTreeMap(Float2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Float2DoubleAVLTreeMap(Map<? extends Float,? extends Double> m)
Creates a new tree map copying a given map. |
|
Float2DoubleAVLTreeMap(SortedMap<Float,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). |
Object |
clone()
Returns a deep copy of this tree map. |
FloatComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering. |
boolean |
containsKey(float k)
Checks whether the given value is contained in AbstractFloat2DoubleMap.keySet(). |
boolean |
containsValue(double v)
Checks whether the given value is contained in AbstractFloat2DoubleMap.values(). |
float |
firstFloatKey()
|
ObjectSortedSet<Float2DoubleMap.Entry> |
float2DoubleEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
double |
get(float k)
Returns the value to which the given key is mapped. |
Float2DoubleSortedMap |
headMap(float to)
Returns a view of the portion of this sorted map whose keys are strictly less than toKey. |
boolean |
isEmpty()
|
FloatSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
float |
lastFloatKey()
|
double |
put(float k,
double v)
Adds a pair to the map. |
Double |
put(Float ok,
Double ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
double |
remove(float 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. |
Float2DoubleSortedMap |
subMap(float from,
float to)
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive. |
Float2DoubleSortedMap |
tailMap(float 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.floats.AbstractFloat2DoubleSortedMap |
|---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2DoubleMap |
|---|
containsValue, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2DoubleFunction |
|---|
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.floats.Float2DoubleFunction |
|---|
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 Float2DoubleAVLTreeMap()
public Float2DoubleAVLTreeMap(Comparator<? super Float> c)
c - a (possibly type-specific) comparator.public Float2DoubleAVLTreeMap(Map<? extends Float,? extends Double> m)
m - a Map to be copied into the new tree map.public Float2DoubleAVLTreeMap(SortedMap<Float,Double> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Float2DoubleAVLTreeMap(Float2DoubleMap m)
m - a type-specific map to be copied into the new tree map.public Float2DoubleAVLTreeMap(Float2DoubleSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Float2DoubleAVLTreeMap(float[] k,
double[] v,
Comparator<? super Float> 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 Float2DoubleAVLTreeMap(float[] 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.| Method Detail |
|---|
public double put(float k,
double v)
Float2DoubleFunction
put in interface Float2DoubleFunctionput in class AbstractFloat2DoubleFunctionk - the key.v - the value.
Function.put(Object,Object)public double remove(float k)
Float2DoubleFunction
remove in interface Float2DoubleFunctionremove in class AbstractFloat2DoubleFunctionFunction.remove(Object)
public Double put(Float ok,
Double ov)
AbstractFloat2DoubleFunctionnull 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<Float,Double>put in interface Map<Float,Double>put in class AbstractFloat2DoubleFunctionok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public Double remove(Object ok)
AbstractFloat2DoubleFunctionnull 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<Float,Double>remove in interface Map<Float,Double>remove in class AbstractFloat2DoubleFunctionnull if no value was present for the given key.Map.remove(Object)public boolean containsValue(double v)
AbstractFloat2DoubleMapAbstractFloat2DoubleMap.values().
containsValue in interface Float2DoubleMapcontainsValue in class AbstractFloat2DoubleMapMap.containsValue(Object)public void clear()
Function
clear in interface Function<Float,Double>clear in interface Map<Float,Double>clear in class AbstractFloat2DoubleFunctionMap.clear()public boolean containsKey(float k)
AbstractFloat2DoubleMapAbstractFloat2DoubleMap.keySet().
containsKey in interface Float2DoubleFunctioncontainsKey in class AbstractFloat2DoubleMapFunction.containsKey(Object)public int size()
FunctionMost 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<Float,Double>size in interface Map<Float,Double>public boolean isEmpty()
isEmpty in interface Map<Float,Double>isEmpty in class AbstractFloat2DoubleMappublic double get(float k)
Float2DoubleFunction
get in interface Float2DoubleFunctionk - the key.
Function.get(Object)public float firstFloatKey()
firstFloatKey in interface Float2DoubleSortedMapSortedMap.firstKey()public float lastFloatKey()
lastFloatKey in interface Float2DoubleSortedMapSortedMap.lastKey()public ObjectSortedSet<Float2DoubleMap.Entry> float2DoubleEntrySet()
Float2DoubleMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Float2DoubleMap.entrySet()
so that it returns an ObjectSet
of objects of type Float2DoubleMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
float2DoubleEntrySet in interface Float2DoubleMapfloat2DoubleEntrySet in interface Float2DoubleSortedMapFloat2DoubleMap.entrySet()public FloatSortedSet 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 Float2DoubleMapkeySet in interface Float2DoubleSortedMapkeySet in interface Map<Float,Double>keySet in class AbstractFloat2DoubleSortedMapMap.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 Float2DoubleMapvalues in interface Float2DoubleSortedMapvalues in interface Map<Float,Double>values in class AbstractFloat2DoubleSortedMapMap.values()public FloatComparator comparator()
Float2DoubleSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Float2DoubleSortedMapcomparator in interface SortedMap<Float,Double>SortedMap.comparator()public Float2DoubleSortedMap headMap(float to)
Float2DoubleSortedMaptoKey.
headMap in interface Float2DoubleSortedMapSortedMap.headMap(Object)public Float2DoubleSortedMap tailMap(float from)
Float2DoubleSortedMapfromKey.
tailMap in interface Float2DoubleSortedMapSortedMap.tailMap(Object)
public Float2DoubleSortedMap subMap(float from,
float to)
Float2DoubleSortedMapfromKey, inclusive, to toKey, exclusive.
subMap in interface Float2DoubleSortedMapSortedMap.subMap(Object,Object)public 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 Object
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||