|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.floats.AbstractFloat2ObjectFunction<V>
it.unimi.dsi.fastutil.floats.AbstractFloat2ObjectMap<V>
it.unimi.dsi.fastutil.floats.AbstractFloat2ObjectSortedMap<V>
it.unimi.dsi.fastutil.floats.Float2ObjectAVLTreeMap<V>
public class Float2ObjectAVLTreeMap<V>
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.AbstractFloat2ObjectMap |
|---|
AbstractFloat2ObjectMap.BasicEntry<V> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.floats.Float2ObjectSortedMap |
|---|
Float2ObjectSortedMap.FastSortedEntrySet<V> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.floats.Float2ObjectMap |
|---|
Float2ObjectMap.FastEntrySet<V> |
| Field Summary | |
|---|---|
static long |
serialVersionUID
|
| Constructor Summary | |
|---|---|
Float2ObjectAVLTreeMap()
Creates a new empty tree map. |
|
Float2ObjectAVLTreeMap(Comparator<? super Float> c)
Creates a new empty tree map with the given comparator. |
|
Float2ObjectAVLTreeMap(float[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Float2ObjectAVLTreeMap(float[] k,
V[] v,
Comparator<? super Float> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Float2ObjectAVLTreeMap(Float2ObjectMap<? extends V> m)
Creates a new tree map copying a given map. |
|
Float2ObjectAVLTreeMap(Float2ObjectSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Float2ObjectAVLTreeMap(Map<? extends Float,? extends V> m)
Creates a new tree map copying a given map. |
|
Float2ObjectAVLTreeMap(SortedMap<Float,V> 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 AbstractFloat2ObjectMap.keySet(). |
boolean |
containsValue(Object v)
Checks whether the given value is contained in AbstractFloat2ObjectMap.values(). |
float |
firstFloatKey()
|
ObjectSortedSet<Float2ObjectMap.Entry<V>> |
float2ObjectEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
V |
get(float k)
Returns the value to which the given key is mapped. |
Float2ObjectSortedMap<V> |
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()
|
V |
put(float k,
V v)
Adds a pair to the map. |
V |
put(Float ok,
V ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
V |
remove(float k)
Removes the mapping with the given key. |
V |
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. |
Float2ObjectSortedMap<V> |
subMap(float from,
float to)
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive. |
Float2ObjectSortedMap<V> |
tailMap(float from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey. |
ObjectCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2ObjectSortedMap |
|---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2ObjectMap |
|---|
equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2ObjectFunction |
|---|
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.Float2ObjectFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Methods inherited from interface it.unimi.dsi.fastutil.Function |
|---|
containsKey, get |
| Methods inherited from interface java.util.Map |
|---|
containsKey, equals, get, hashCode, putAll |
| Methods inherited from interface java.util.Map |
|---|
containsKey, equals, get, hashCode, putAll |
| Field Detail |
|---|
public static final long serialVersionUID
| Constructor Detail |
|---|
public Float2ObjectAVLTreeMap()
public Float2ObjectAVLTreeMap(Comparator<? super Float> c)
c - a (possibly type-specific) comparator.public Float2ObjectAVLTreeMap(Map<? extends Float,? extends V> m)
m - a Map to be copied into the new tree map.public Float2ObjectAVLTreeMap(SortedMap<Float,V> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Float2ObjectAVLTreeMap(Float2ObjectMap<? extends V> m)
m - a type-specific map to be copied into the new tree map.public Float2ObjectAVLTreeMap(Float2ObjectSortedMap<V> m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Float2ObjectAVLTreeMap(float[] k,
V[] 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 Float2ObjectAVLTreeMap(float[] k,
V[] 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 V put(float k,
V v)
Float2ObjectFunction
put in interface Float2ObjectFunction<V>put in class AbstractFloat2ObjectFunction<V>k - the key.v - the value.
Function.put(Object,Object)public V remove(float k)
Float2ObjectFunction
remove in interface Float2ObjectFunction<V>remove in class AbstractFloat2ObjectFunction<V>Function.remove(Object)
public V put(Float ok,
V ov)
AbstractFloat2ObjectFunctionnull 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,V>put in interface Map<Float,V>put in class AbstractFloat2ObjectFunction<V>ok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public V remove(Object ok)
AbstractFloat2ObjectFunctionnull 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,V>remove in interface Map<Float,V>remove in class AbstractFloat2ObjectFunction<V>null if no value was present for the given key.Map.remove(Object)public boolean containsValue(Object v)
AbstractFloat2ObjectMapAbstractFloat2ObjectMap.values().
containsValue in interface Map<Float,V>containsValue in class AbstractFloat2ObjectMap<V>public void clear()
Function
clear in interface Function<Float,V>clear in interface Map<Float,V>clear in class AbstractFloat2ObjectFunction<V>Map.clear()public boolean containsKey(float k)
AbstractFloat2ObjectMapAbstractFloat2ObjectMap.keySet().
containsKey in interface Float2ObjectFunction<V>containsKey in class AbstractFloat2ObjectMap<V>Function.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,V>size in interface Map<Float,V>public boolean isEmpty()
isEmpty in interface Map<Float,V>isEmpty in class AbstractFloat2ObjectMap<V>public V get(float k)
Float2ObjectFunction
get in interface Float2ObjectFunction<V>k - the key.
Function.get(Object)public float firstFloatKey()
firstFloatKey in interface Float2ObjectSortedMap<V>SortedMap.firstKey()public float lastFloatKey()
lastFloatKey in interface Float2ObjectSortedMap<V>SortedMap.lastKey()public ObjectSortedSet<Float2ObjectMap.Entry<V>> float2ObjectEntrySet()
Float2ObjectMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Float2ObjectMap.entrySet()
so that it returns an ObjectSet
of objects of type Float2ObjectMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
float2ObjectEntrySet in interface Float2ObjectMap<V>float2ObjectEntrySet in interface Float2ObjectSortedMap<V>Float2ObjectMap.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 Float2ObjectMap<V>keySet in interface Float2ObjectSortedMap<V>keySet in interface Map<Float,V>keySet in class AbstractFloat2ObjectSortedMap<V>Map.keySet()public ObjectCollection<V> 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 Float2ObjectMap<V>values in interface Float2ObjectSortedMap<V>values in interface Map<Float,V>values in class AbstractFloat2ObjectSortedMap<V>Map.values()public FloatComparator comparator()
Float2ObjectSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Float2ObjectSortedMap<V>comparator in interface SortedMap<Float,V>SortedMap.comparator()public Float2ObjectSortedMap<V> headMap(float to)
Float2ObjectSortedMaptoKey.
headMap in interface Float2ObjectSortedMap<V>SortedMap.headMap(Object)public Float2ObjectSortedMap<V> tailMap(float from)
Float2ObjectSortedMapfromKey.
tailMap in interface Float2ObjectSortedMap<V>SortedMap.tailMap(Object)
public Float2ObjectSortedMap<V> subMap(float from,
float to)
Float2ObjectSortedMapfromKey, inclusive, to toKey, exclusive.
subMap in interface Float2ObjectSortedMap<V>SortedMap.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 | ||||||||