|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.floats.AbstractFloat2FloatFunction
it.unimi.dsi.fastutil.floats.AbstractFloat2FloatMap
it.unimi.dsi.fastutil.floats.AbstractFloat2FloatSortedMap
it.unimi.dsi.fastutil.floats.Float2FloatAVLTreeMap
public class Float2FloatAVLTreeMap
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.AbstractFloat2FloatMap |
|---|
AbstractFloat2FloatMap.BasicEntry |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.floats.Float2FloatSortedMap |
|---|
Float2FloatSortedMap.FastSortedEntrySet |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.floats.Float2FloatMap |
|---|
Float2FloatMap.FastEntrySet |
| Field Summary | |
|---|---|
static long |
serialVersionUID
|
| Constructor Summary | |
|---|---|
Float2FloatAVLTreeMap()
Creates a new empty tree map. |
|
Float2FloatAVLTreeMap(Comparator<? super Float> c)
Creates a new empty tree map with the given comparator. |
|
Float2FloatAVLTreeMap(float[] k,
float[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Float2FloatAVLTreeMap(float[] k,
float[] v,
Comparator<? super Float> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Float2FloatAVLTreeMap(Float2FloatMap m)
Creates a new tree map copying a given map. |
|
Float2FloatAVLTreeMap(Float2FloatSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Float2FloatAVLTreeMap(Map<? extends Float,? extends Float> m)
Creates a new tree map copying a given map. |
|
Float2FloatAVLTreeMap(SortedMap<Float,Float> 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 AbstractFloat2FloatMap.keySet(). |
boolean |
containsValue(float v)
Checks whether the given value is contained in AbstractFloat2FloatMap.values(). |
float |
firstFloatKey()
|
ObjectSortedSet<Float2FloatMap.Entry> |
float2FloatEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
float |
get(float k)
Returns the value to which the given key is mapped. |
Float2FloatSortedMap |
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()
|
float |
put(float k,
float v)
Adds a pair to the map. |
Float |
put(Float ok,
Float ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
float |
remove(float k)
Removes the mapping with the given key. |
Float |
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. |
Float2FloatSortedMap |
subMap(float from,
float to)
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive. |
Float2FloatSortedMap |
tailMap(float from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey. |
FloatCollection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2FloatSortedMap |
|---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2FloatMap |
|---|
containsValue, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2FloatFunction |
|---|
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.Float2FloatFunction |
|---|
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 Float2FloatAVLTreeMap()
public Float2FloatAVLTreeMap(Comparator<? super Float> c)
c - a (possibly type-specific) comparator.public Float2FloatAVLTreeMap(Map<? extends Float,? extends Float> m)
m - a Map to be copied into the new tree map.public Float2FloatAVLTreeMap(SortedMap<Float,Float> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Float2FloatAVLTreeMap(Float2FloatMap m)
m - a type-specific map to be copied into the new tree map.public Float2FloatAVLTreeMap(Float2FloatSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Float2FloatAVLTreeMap(float[] k,
float[] 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 Float2FloatAVLTreeMap(float[] k,
float[] 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 float put(float k,
float v)
Float2FloatFunction
put in interface Float2FloatFunctionput in class AbstractFloat2FloatFunctionk - the key.v - the value.
Function.put(Object,Object)public float remove(float k)
Float2FloatFunction
remove in interface Float2FloatFunctionremove in class AbstractFloat2FloatFunctionFunction.remove(Object)
public Float put(Float ok,
Float ov)
AbstractFloat2FloatFunctionnull 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,Float>put in interface Map<Float,Float>put in class AbstractFloat2FloatFunctionok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public Float remove(Object ok)
AbstractFloat2FloatFunctionnull 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,Float>remove in interface Map<Float,Float>remove in class AbstractFloat2FloatFunctionnull if no value was present for the given key.Map.remove(Object)public boolean containsValue(float v)
AbstractFloat2FloatMapAbstractFloat2FloatMap.values().
containsValue in interface Float2FloatMapcontainsValue in class AbstractFloat2FloatMapMap.containsValue(Object)public void clear()
Function
clear in interface Function<Float,Float>clear in interface Map<Float,Float>clear in class AbstractFloat2FloatFunctionMap.clear()public boolean containsKey(float k)
AbstractFloat2FloatMapAbstractFloat2FloatMap.keySet().
containsKey in interface Float2FloatFunctioncontainsKey in class AbstractFloat2FloatMapFunction.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,Float>size in interface Map<Float,Float>public boolean isEmpty()
isEmpty in interface Map<Float,Float>isEmpty in class AbstractFloat2FloatMappublic float get(float k)
Float2FloatFunction
get in interface Float2FloatFunctionk - the key.
Function.get(Object)public float firstFloatKey()
firstFloatKey in interface Float2FloatSortedMapSortedMap.firstKey()public float lastFloatKey()
lastFloatKey in interface Float2FloatSortedMapSortedMap.lastKey()public ObjectSortedSet<Float2FloatMap.Entry> float2FloatEntrySet()
Float2FloatMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Float2FloatMap.entrySet()
so that it returns an ObjectSet
of objects of type Float2FloatMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
float2FloatEntrySet in interface Float2FloatMapfloat2FloatEntrySet in interface Float2FloatSortedMapFloat2FloatMap.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 Float2FloatMapkeySet in interface Float2FloatSortedMapkeySet in interface Map<Float,Float>keySet in class AbstractFloat2FloatSortedMapMap.keySet()public FloatCollection 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 Float2FloatMapvalues in interface Float2FloatSortedMapvalues in interface Map<Float,Float>values in class AbstractFloat2FloatSortedMapMap.values()public FloatComparator comparator()
Float2FloatSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Float2FloatSortedMapcomparator in interface SortedMap<Float,Float>SortedMap.comparator()public Float2FloatSortedMap headMap(float to)
Float2FloatSortedMaptoKey.
headMap in interface Float2FloatSortedMapSortedMap.headMap(Object)public Float2FloatSortedMap tailMap(float from)
Float2FloatSortedMapfromKey.
tailMap in interface Float2FloatSortedMapSortedMap.tailMap(Object)
public Float2FloatSortedMap subMap(float from,
float to)
Float2FloatSortedMapfromKey, inclusive, to toKey, exclusive.
subMap in interface Float2FloatSortedMapSortedMap.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 | ||||||||