public class Long2FloatRBTreeMap extends AbstractLong2FloatSortedMap 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.
AbstractLong2FloatMap.BasicEntryLong2FloatSortedMap.FastSortedEntrySetLong2FloatMap.FastEntrySet| Constructor and Description |
|---|
Long2FloatRBTreeMap()
Creates a new empty tree map.
|
Long2FloatRBTreeMap(Comparator<? super Long> c)
Creates a new empty tree map with the given comparator.
|
Long2FloatRBTreeMap(long[] k,
float[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Long2FloatRBTreeMap(long[] k,
float[] v,
Comparator<? super Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Long2FloatRBTreeMap(Long2FloatMap m)
Creates a new tree map copying a given map.
|
Long2FloatRBTreeMap(Long2FloatSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Long2FloatRBTreeMap(Map<? extends Long,? extends Float> m)
Creates a new tree map copying a given map.
|
Long2FloatRBTreeMap(SortedMap<Long,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).
|
Long2FloatRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
LongComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(long k)
Checks whether the given value is contained in
AbstractLong2FloatMap.keySet(). |
boolean |
containsValue(float v)
Checks whether the given value is contained in
AbstractLong2FloatMap.values(). |
long |
firstLongKey() |
float |
get(long k)
Returns the value to which the given key is mapped.
|
Long2FloatSortedMap |
headMap(long to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
LongSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
long |
lastLongKey() |
ObjectSortedSet<Long2FloatMap.Entry> |
long2FloatEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
float |
put(long k,
float v)
Adds a pair to the map.
|
Float |
put(Long ok,
Float ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
float |
remove(long k)
Removes the mapping with the given key.
|
Float |
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.
|
Long2FloatSortedMap |
subMap(long from,
long to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Long2FloatSortedMap |
tailMap(long 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, getcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Long2FloatRBTreeMap()
public Long2FloatRBTreeMap(Comparator<? super Long> c)
c - a (possibly type-specific) comparator.public Long2FloatRBTreeMap(Map<? extends Long,? extends Float> m)
m - a Map to be copied into the new tree map.public Long2FloatRBTreeMap(SortedMap<Long,Float> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Long2FloatRBTreeMap(Long2FloatMap m)
m - a type-specific map to be copied into the new tree map.public Long2FloatRBTreeMap(Long2FloatSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Long2FloatRBTreeMap(long[] k,
float[] v,
Comparator<? super Long> 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 Long2FloatRBTreeMap(long[] 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(long k,
float v)
Long2FloatFunctionput in interface Long2FloatFunctionput in class AbstractLong2FloatFunctionk - the key.v - the value.Function.put(Object,Object)public float remove(long k)
Long2FloatFunctionremove in interface Long2FloatFunctionremove in class AbstractLong2FloatFunctionk - the key.Function.remove(Object)public Float put(Long ok, Float ov)
AbstractLong2FloatFunctionnull 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)
AbstractLong2FloatFunctionnull 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)
AbstractLong2FloatMapAbstractLong2FloatMap.values().containsValue in interface Long2FloatMapcontainsValue in class AbstractLong2FloatMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(long k)
AbstractLong2FloatMapAbstractLong2FloatMap.keySet().containsKey in interface Long2FloatFunctioncontainsKey in class AbstractLong2FloatMapFunction.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 get(long k)
Long2FloatFunctionget in interface Long2FloatFunctionk - the key.Function.get(Object)public long firstLongKey()
firstLongKey in interface Long2FloatSortedMapSortedMap.firstKey()public long lastLongKey()
lastLongKey in interface Long2FloatSortedMapSortedMap.lastKey()public ObjectSortedSet<Long2FloatMap.Entry> long2FloatEntrySet()
Long2FloatSortedMaplong2FloatEntrySet in interface Long2FloatMaplong2FloatEntrySet in interface Long2FloatSortedMapLong2FloatSortedMap.entrySet()public LongSortedSet 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 Long2FloatMapkeySet in interface Long2FloatSortedMapkeySet in interface Map<Long,Float>keySet in interface SortedMap<Long,Float>keySet in class AbstractLong2FloatSortedMapMap.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 Long2FloatMapvalues in interface Long2FloatSortedMapvalues in interface Map<Long,Float>values in interface SortedMap<Long,Float>values in class AbstractLong2FloatSortedMapMap.values()public LongComparator comparator()
Long2FloatSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Long2FloatSortedMapcomparator in interface SortedMap<Long,Float>SortedMap.comparator()public Long2FloatSortedMap headMap(long to)
Long2FloatSortedMaptoKey.headMap in interface Long2FloatSortedMapSortedMap.headMap(Object)public Long2FloatSortedMap tailMap(long from)
Long2FloatSortedMapfromKey.tailMap in interface Long2FloatSortedMapSortedMap.tailMap(Object)public Long2FloatSortedMap subMap(long from, long to)
Long2FloatSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Long2FloatSortedMapSortedMap.subMap(Object,Object)public Long2FloatRBTreeMap 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.