public class Object2FloatAVLTreeMap<K> extends AbstractObject2FloatSortedMap<K> implements Serializable, Cloneable
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.
AbstractObject2FloatMap.BasicEntry<K>Object2FloatSortedMap.FastSortedEntrySet<K>Object2FloatMap.FastEntrySet<K>| Constructor and Description |
|---|
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). |
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Object2FloatAVLTreeMap<K> |
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)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
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 sorted-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)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Object2FloatSortedMap<K> |
tailMap(K 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.
|
entrySetcontainsValue, equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuedefaultReturnValue, defaultReturnValuecompute, computeIfAbsent, computeIfPresent, containsValue, equals, forEach, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic 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.public float put(K k, float v)
Object2FloatFunctionput in interface Object2FloatFunction<K>put in class AbstractObject2FloatFunction<K>k - the key.v - the value.Function.put(Object,Object)public float removeFloat(Object k)
Object2FloatFunctionremoveFloat in interface Object2FloatFunction<K>removeFloat in class AbstractObject2FloatFunction<K>k - the key.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.
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.
public boolean containsValue(float v)
AbstractObject2FloatMapAbstractObject2FloatMap.values().containsValue in interface Object2FloatMap<K>containsValue in class AbstractObject2FloatMap<K>Map.containsValue(Object)public void clear()
Functionpublic 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.
public boolean isEmpty()
public float getFloat(Object k)
Object2FloatFunctiongetFloat 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.
public ObjectSortedSet<Object2FloatMap.Entry<K>> object2FloatEntrySet()
Object2FloatSortedMapobject2FloatEntrySet in interface Object2FloatMap<K>object2FloatEntrySet in interface Object2FloatSortedMap<K>Object2FloatSortedMap.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 interface SortedMap<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 interface SortedMap<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)
Object2FloatSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Object2FloatSortedMap<K>headMap in interface SortedMap<K,Float>SortedMap.headMap(Object)public Object2FloatSortedMap<K> tailMap(K from)
Object2FloatSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Object2FloatSortedMap<K>tailMap in interface SortedMap<K,Float>SortedMap.tailMap(Object)public Object2FloatSortedMap<K> subMap(K from, K to)
Object2FloatSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Object2FloatSortedMap<K>subMap in interface SortedMap<K,Float>SortedMap.subMap(Object,Object)public Object2FloatAVLTreeMap<K> 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.