public class Float2LongRBTreeMap extends AbstractFloat2LongSortedMap 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.
AbstractFloat2LongMap.BasicEntryFloat2LongSortedMap.FastSortedEntrySetFloat2LongMap.FastEntrySet| Constructor and Description |
|---|
Float2LongRBTreeMap()
Creates a new empty tree map.
|
Float2LongRBTreeMap(Comparator<? super Float> c)
Creates a new empty tree map with the given comparator.
|
Float2LongRBTreeMap(float[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Float2LongRBTreeMap(float[] k,
long[] v,
Comparator<? super Float> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Float2LongRBTreeMap(Float2LongMap m)
Creates a new tree map copying a given map.
|
Float2LongRBTreeMap(Float2LongSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Float2LongRBTreeMap(Map<? extends Float,? extends Long> m)
Creates a new tree map copying a given map.
|
Float2LongRBTreeMap(SortedMap<Float,Long> 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).
|
Float2LongRBTreeMap |
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
AbstractFloat2LongMap.keySet(). |
boolean |
containsValue(long v)
Checks whether the given value is contained in
AbstractFloat2LongMap.values(). |
float |
firstFloatKey() |
ObjectSortedSet<Float2LongMap.Entry> |
float2LongEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
long |
get(float k)
Returns the value to which the given key is mapped.
|
Float2LongSortedMap |
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() |
long |
put(float k,
long v)
Adds a pair to the map.
|
Long |
put(Float ok,
Long ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
long |
remove(float k)
Removes the mapping with the given key.
|
Long |
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.
|
Float2LongSortedMap |
subMap(float from,
float to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Float2LongSortedMap |
tailMap(float from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
LongCollection |
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, getcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Float2LongRBTreeMap()
public Float2LongRBTreeMap(Comparator<? super Float> c)
c - a (possibly type-specific) comparator.public Float2LongRBTreeMap(Map<? extends Float,? extends Long> m)
m - a Map to be copied into the new tree map.public Float2LongRBTreeMap(SortedMap<Float,Long> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Float2LongRBTreeMap(Float2LongMap m)
m - a type-specific map to be copied into the new tree map.public Float2LongRBTreeMap(Float2LongSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Float2LongRBTreeMap(float[] k,
long[] 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 Float2LongRBTreeMap(float[] k,
long[] 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 long put(float k,
long v)
Float2LongFunctionput in interface Float2LongFunctionput in class AbstractFloat2LongFunctionk - the key.v - the value.Function.put(Object,Object)public long remove(float k)
Float2LongFunctionremove in interface Float2LongFunctionremove in class AbstractFloat2LongFunctionk - the key.Function.remove(Object)public Long put(Float ok, Long ov)
AbstractFloat2LongFunctionnull 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 Long remove(Object ok)
AbstractFloat2LongFunctionnull 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(long v)
AbstractFloat2LongMapAbstractFloat2LongMap.values().containsValue in interface Float2LongMapcontainsValue in class AbstractFloat2LongMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(float k)
AbstractFloat2LongMapAbstractFloat2LongMap.keySet().containsKey in interface Float2LongFunctioncontainsKey in class AbstractFloat2LongMapFunction.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 long get(float k)
Float2LongFunctionget in interface Float2LongFunctionk - the key.Function.get(Object)public float firstFloatKey()
firstFloatKey in interface Float2LongSortedMapSortedMap.firstKey()public float lastFloatKey()
lastFloatKey in interface Float2LongSortedMapSortedMap.lastKey()public ObjectSortedSet<Float2LongMap.Entry> float2LongEntrySet()
Float2LongSortedMapfloat2LongEntrySet in interface Float2LongMapfloat2LongEntrySet in interface Float2LongSortedMapFloat2LongSortedMap.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 Float2LongMapkeySet in interface Float2LongSortedMapkeySet in interface Map<Float,Long>keySet in interface SortedMap<Float,Long>keySet in class AbstractFloat2LongSortedMapMap.keySet()public LongCollection 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 Float2LongMapvalues in interface Float2LongSortedMapvalues in interface Map<Float,Long>values in interface SortedMap<Float,Long>values in class AbstractFloat2LongSortedMapMap.values()public FloatComparator comparator()
Float2LongSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Float2LongSortedMapcomparator in interface SortedMap<Float,Long>SortedMap.comparator()public Float2LongSortedMap headMap(float to)
Float2LongSortedMaptoKey.headMap in interface Float2LongSortedMapSortedMap.headMap(Object)public Float2LongSortedMap tailMap(float from)
Float2LongSortedMapfromKey.tailMap in interface Float2LongSortedMapSortedMap.tailMap(Object)public Float2LongSortedMap subMap(float from, float to)
Float2LongSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Float2LongSortedMapSortedMap.subMap(Object,Object)public Float2LongRBTreeMap 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.