public class Float2IntRBTreeMap extends AbstractFloat2IntSortedMap 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.
AbstractFloat2IntMap.BasicEntry, AbstractFloat2IntMap.BasicEntrySetFloat2IntSortedMap.FastSortedEntrySetFloat2IntMap.FastEntrySet| Constructor and Description |
|---|
Float2IntRBTreeMap()
Creates a new empty tree map.
|
Float2IntRBTreeMap(Comparator<? super Float> c)
Creates a new empty tree map with the given comparator.
|
Float2IntRBTreeMap(float[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Float2IntRBTreeMap(float[] k,
int[] v,
Comparator<? super Float> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Float2IntRBTreeMap(Float2IntMap m)
Creates a new tree map copying a given map.
|
Float2IntRBTreeMap(Float2IntSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Float2IntRBTreeMap(Map<? extends Float,? extends Integer> m)
Creates a new tree map copying a given map.
|
Float2IntRBTreeMap(SortedMap<Float,Integer> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
int |
addTo(float k,
int incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Float2IntRBTreeMap |
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)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(int v)
Returns
true if this map maps one or more keys to the specified value. |
float |
firstFloatKey()
Returns the first (lowest) key currently in this map.
|
ObjectSortedSet<Float2IntMap.Entry> |
float2IntEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
int |
get(float k)
Returns the value to which the given key is mapped.
|
Float2IntSortedMap |
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()
Returns the last (highest) key currently in this map.
|
int |
put(float k,
int v)
Adds a pair to the map (optional operation).
|
int |
remove(float k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Float2IntSortedMap |
subMap(float from,
float to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Float2IntSortedMap |
tailMap(float from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
IntCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValueentrySet, firstKey, headMap, lastKey, subMap, tailMapcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsIntpublic Float2IntRBTreeMap()
public Float2IntRBTreeMap(Comparator<? super Float> c)
c - a (possibly type-specific) comparator.public Float2IntRBTreeMap(Map<? extends Float,? extends Integer> m)
m - a Map to be copied into the new tree map.public Float2IntRBTreeMap(SortedMap<Float,Integer> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Float2IntRBTreeMap(Float2IntMap m)
m - a type-specific map to be copied into the new tree map.public Float2IntRBTreeMap(Float2IntSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Float2IntRBTreeMap(float[] k,
int[] 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 Float2IntRBTreeMap(float[] k,
int[] 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 int addTo(float k,
int 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 int put(float k,
int v)
Float2IntFunctionput in interface Float2IntFunctionk - the key.v - the value.Function.put(Object,Object)public int remove(float k)
Float2IntFunctionremove in interface Float2IntFunctionk - the key.Function.remove(Object)public boolean containsValue(int v)
Float2IntMaptrue if this map maps one or more keys to the specified value.containsValue in interface Float2IntMapcontainsValue in class AbstractFloat2IntMapMap.containsValue(Object)public void clear()
Float2IntMapclear in interface Float2IntMapclear in interface Map<Float,Integer>Map.clear()public boolean containsKey(float k)
Float2IntMapcontainsKey in interface Float2IntFunctioncontainsKey in interface Float2IntMapcontainsKey in class AbstractFloat2IntMapk - the key.key.Map.containsKey(Object)public int size()
Float2IntMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public int get(float k)
Float2IntFunctionget in interface Float2IntFunctionk - the key.Function.get(Object)public float firstFloatKey()
Float2IntSortedMapfirstFloatKey in interface Float2IntSortedMapSortedMap.firstKey()public float lastFloatKey()
Float2IntSortedMaplastFloatKey in interface Float2IntSortedMapSortedMap.lastKey()public ObjectSortedSet<Float2IntMap.Entry> float2IntEntrySet()
Float2IntSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
float2IntEntrySet in interface Float2IntMapfloat2IntEntrySet in interface Float2IntSortedMapFloat2IntSortedMap.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 Float2IntMapkeySet in interface Float2IntSortedMapkeySet in interface Map<Float,Integer>keySet in interface SortedMap<Float,Integer>keySet in class AbstractFloat2IntSortedMapMap.keySet()public IntCollection 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 Float2IntMapvalues in interface Float2IntSortedMapvalues in interface Map<Float,Integer>values in interface SortedMap<Float,Integer>values in class AbstractFloat2IntSortedMapMap.values()public FloatComparator comparator()
Float2IntSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Float2IntSortedMapcomparator in interface SortedMap<Float,Integer>SortedMap.comparator()public Float2IntSortedMap headMap(float to)
Float2IntSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Float2IntSortedMapSortedMap.headMap(Object)public Float2IntSortedMap tailMap(float from)
Float2IntSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Float2IntSortedMapSortedMap.tailMap(Object)public Float2IntSortedMap subMap(float from, float to)
Float2IntSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Float2IntSortedMapSortedMap.subMap(Object,Object)public Float2IntRBTreeMap 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.