|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractObject2FloatFunction<K>
it.unimi.dsi.fastutil.objects.AbstractObject2FloatMap<K>
it.unimi.dsi.fastutil.objects.AbstractObject2FloatSortedMap<K>
it.unimi.dsi.fastutil.objects.Object2FloatAVLTreeMap<K>
public class Object2FloatAVLTreeMap<K>
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.objects.AbstractObject2FloatMap |
|---|
AbstractObject2FloatMap.BasicEntry<K> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2FloatSortedMap |
|---|
Object2FloatSortedMap.FastSortedEntrySet<K> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2FloatMap |
|---|
Object2FloatMap.FastEntrySet<K> |
| Field Summary | |
|---|---|
static long |
serialVersionUID
|
| Constructor Summary | |
|---|---|
Object2FloatAVLTreeMap()
Creates a new empty tree map. |
|
Object2FloatAVLTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator. |
|
Object2FloatAVLTreeMap(K[] k,
float[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Object2FloatAVLTreeMap(K[] k,
float[] v,
Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Object2FloatAVLTreeMap(Map<? extends K,? extends Float> m)
Creates a new tree map copying a given map. |
|
Object2FloatAVLTreeMap(Object2FloatMap<? extends K> m)
Creates a new tree map copying a given map. |
|
Object2FloatAVLTreeMap(Object2FloatSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Object2FloatAVLTreeMap(SortedMap<K,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. |
Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering. |
boolean |
containsKey(Object k)
Checks whether the given value is contained in AbstractObject2FloatMap.keySet(). |
boolean |
containsValue(float v)
Checks whether the given value is contained in AbstractObject2FloatMap.values(). |
K |
firstKey()
|
Float |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
float |
getFloat(Object k)
Returns the value to which the given key is mapped. |
Object2FloatSortedMap<K> |
headMap(K to)
Delegates to the corresponding type-specific method. |
boolean |
isEmpty()
|
ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
K |
lastKey()
|
ObjectSortedSet<Object2FloatMap.Entry<K>> |
object2FloatEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
float |
put(K k,
float v)
Adds a pair to the map. |
Float |
put(K ok,
Float ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
Float |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
float |
removeFloat(Object k)
Removes the mapping with the given key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists. |
Object2FloatSortedMap<K> |
subMap(K from,
K to)
Delegates to the corresponding type-specific method. |
Object2FloatSortedMap<K> |
tailMap(K from)
Delegates to the corresponding type-specific method. |
FloatCollection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2FloatSortedMap |
|---|
entrySet |
| Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2FloatMap |
|---|
containsValue, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2FloatFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Methods inherited from class java.lang.Object |
|---|
getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2FloatFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Methods inherited from interface java.util.Map |
|---|
containsValue, equals, hashCode, putAll |
| Methods inherited from interface java.util.Map |
|---|
containsValue, equals, hashCode, putAll |
| Field Detail |
|---|
public static final long serialVersionUID
| Constructor Detail |
|---|
public Object2FloatAVLTreeMap()
public Object2FloatAVLTreeMap(Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2FloatAVLTreeMap(Map<? extends K,? extends Float> m)
m - a Map to be copied into the new tree map.public Object2FloatAVLTreeMap(SortedMap<K,Float> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Object2FloatAVLTreeMap(Object2FloatMap<? extends K> m)
m - a type-specific map to be copied into the new tree map.public Object2FloatAVLTreeMap(Object2FloatSortedMap<K> m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Object2FloatAVLTreeMap(K[] k,
float[] v,
Comparator<? super K> 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 Object2FloatAVLTreeMap(K[] 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(K k,
float v)
Object2FloatFunction
put in interface Object2FloatFunction<K>put in class AbstractObject2FloatFunction<K>k - the key.v - the value.
Function.put(Object,Object)public float removeFloat(Object k)
Object2FloatFunction
removeFloat in interface Object2FloatFunction<K>removeFloat in class AbstractObject2FloatFunction<K>Function.remove(Object)
public Float put(K ok,
Float ov)
AbstractObject2FloatFunctionnull 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<K,Float>put in interface Map<K,Float>put in class AbstractObject2FloatFunction<K>ok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public Float remove(Object ok)
AbstractObject2FloatFunctionnull 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<K,Float>remove in interface Map<K,Float>remove in class AbstractObject2FloatFunction<K>null if no value was present for the given key.Map.remove(Object)public boolean containsValue(float v)
AbstractObject2FloatMapAbstractObject2FloatMap.values().
containsValue in interface Object2FloatMap<K>containsValue in class AbstractObject2FloatMap<K>Map.containsValue(Object)public void clear()
Function
clear in interface Function<K,Float>clear in interface Map<K,Float>clear in class AbstractObject2FloatFunction<K>Map.clear()public boolean containsKey(Object k)
AbstractObject2FloatMapAbstractObject2FloatMap.keySet().
containsKey in interface Function<K,Float>containsKey in interface Map<K,Float>containsKey in class AbstractObject2FloatMap<K>k - the key.
key.Map.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<K,Float>size in interface Map<K,Float>public boolean isEmpty()
isEmpty in interface Map<K,Float>isEmpty in class AbstractObject2FloatMap<K>public float getFloat(Object k)
Object2FloatFunction
getFloat in interface Object2FloatFunction<K>k - the key.
Function.get(Object)public Float get(Object ok)
AbstractObject2FloatFunctionnull 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.
get in interface Function<K,Float>get in interface Map<K,Float>get in class AbstractObject2FloatFunction<K>ok - the key.
null if no value was present for the given key.Map.get(Object)public K firstKey()
firstKey in interface SortedMap<K,Float>public K lastKey()
lastKey in interface SortedMap<K,Float>public ObjectSortedSet<Object2FloatMap.Entry<K>> object2FloatEntrySet()
Object2FloatMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Object2FloatMap.entrySet()
so that it returns an ObjectSet
of objects of type Object2FloatMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
object2FloatEntrySet in interface Object2FloatMap<K>object2FloatEntrySet in interface Object2FloatSortedMap<K>Object2FloatMap.entrySet()public ObjectSortedSet<K> 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 Object2FloatMap<K>keySet in interface Object2FloatSortedMap<K>keySet in interface Map<K,Float>keySet in class AbstractObject2FloatSortedMap<K>Map.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 Object2FloatMap<K>values in interface Object2FloatSortedMap<K>values in interface Map<K,Float>values in class AbstractObject2FloatSortedMap<K>Map.values()public Comparator<? super K> comparator()
Object2FloatSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Object2FloatSortedMap<K>comparator in interface SortedMap<K,Float>SortedMap.comparator()public Object2FloatSortedMap<K> headMap(K to)
AbstractObject2FloatSortedMap
headMap in interface Object2FloatSortedMap<K>headMap in interface SortedMap<K,Float>headMap in class AbstractObject2FloatSortedMap<K>SortedMap.headMap(Object)public Object2FloatSortedMap<K> tailMap(K from)
AbstractObject2FloatSortedMap
tailMap in interface Object2FloatSortedMap<K>tailMap in interface SortedMap<K,Float>tailMap in class AbstractObject2FloatSortedMap<K>SortedMap.tailMap(Object)
public Object2FloatSortedMap<K> subMap(K from,
K to)
AbstractObject2FloatSortedMap
subMap in interface Object2FloatSortedMap<K>subMap in interface SortedMap<K,Float>subMap in class AbstractObject2FloatSortedMap<K>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 | ||||||||