public class Float2FloatAVLTreeMap extends AbstractFloat2FloatSortedMap implements java.io.Serializable, java.lang.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.
AbstractFloat2FloatMap.BasicEntryFloat2FloatSortedMap.FastSortedEntrySetFloat2FloatMap.FastEntrySet| Constructor and Description |
|---|
Float2FloatAVLTreeMap()
Creates a new empty tree map.
|
Float2FloatAVLTreeMap(java.util.Comparator<? super java.lang.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,
java.util.Comparator<? super java.lang.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(java.util.Map<? extends java.lang.Float,? extends java.lang.Float> m)
Creates a new tree map copying a given map.
|
Float2FloatAVLTreeMap(java.util.SortedMap<java.lang.Float,java.lang.Float> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
float |
addTo(float k,
float incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Float2FloatAVLTreeMap |
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 sorted-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.
|
java.lang.Float |
put(java.lang.Float ok,
java.lang.Float ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
float |
remove(float k)
Removes the mapping with the given key.
|
java.lang.Float |
remove(java.lang.Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getpublic Float2FloatAVLTreeMap()
public Float2FloatAVLTreeMap(java.util.Comparator<? super java.lang.Float> c)
c - a (possibly type-specific) comparator.public Float2FloatAVLTreeMap(java.util.Map<? extends java.lang.Float,? extends java.lang.Float> m)
m - a Map to be copied into the new tree map.public Float2FloatAVLTreeMap(java.util.SortedMap<java.lang.Float,java.lang.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,
java.util.Comparator<? super java.lang.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.java.lang.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.java.lang.IllegalArgumentException - if k and v have different lengths.public float addTo(float k,
float incr)
Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
k - the key.incr - the increment.public float put(float k,
float v)
Float2FloatFunctionput in interface Float2FloatFunctionput in class AbstractFloat2FloatFunctionk - the key.v - the value.Function.put(Object,Object)public float remove(float k)
Float2FloatFunctionremove in interface Float2FloatFunctionremove in class AbstractFloat2FloatFunctionk - the key.Function.remove(Object)@Deprecated
public java.lang.Float put(java.lang.Float ok,
java.lang.Float ov)
null 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<java.lang.Float,java.lang.Float>put in interface java.util.Map<java.lang.Float,java.lang.Float>put in class AbstractFloat2FloatFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public java.lang.Float remove(java.lang.Object ok)
null 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<java.lang.Float,java.lang.Float>remove in interface java.util.Map<java.lang.Float,java.lang.Float>remove in class AbstractFloat2FloatFunctionok - the key.null 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()
Functionclear in interface Function<java.lang.Float,java.lang.Float>clear in interface java.util.Map<java.lang.Float,java.lang.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.
public boolean isEmpty()
isEmpty in interface java.util.Map<java.lang.Float,java.lang.Float>isEmpty in class AbstractFloat2FloatMappublic float get(float k)
Float2FloatFunctionget 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()
Float2FloatSortedMapfloat2FloatEntrySet in interface Float2FloatMapfloat2FloatEntrySet in interface Float2FloatSortedMapFloat2FloatSortedMap.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 java.util.Map<java.lang.Float,java.lang.Float>keySet in interface java.util.SortedMap<java.lang.Float,java.lang.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 java.util.Map<java.lang.Float,java.lang.Float>values in interface java.util.SortedMap<java.lang.Float,java.lang.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 java.util.SortedMap<java.lang.Float,java.lang.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 Float2FloatAVLTreeMap 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 java.lang.Object