public class Int2FloatAVLTreeMap extends AbstractInt2FloatSortedMap 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.
AbstractInt2FloatMap.BasicEntry, AbstractInt2FloatMap.BasicEntrySetInt2FloatSortedMap.FastSortedEntrySetInt2FloatMap.FastEntrySet| Constructor and Description |
|---|
Int2FloatAVLTreeMap()
Creates a new empty tree map.
|
Int2FloatAVLTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2FloatAVLTreeMap(int[] k,
float[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2FloatAVLTreeMap(int[] k,
float[] v,
Comparator<? super Integer> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Int2FloatAVLTreeMap(Int2FloatMap m)
Creates a new tree map copying a given map.
|
Int2FloatAVLTreeMap(Int2FloatSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Int2FloatAVLTreeMap(Map<? extends Integer,? extends Float> m)
Creates a new tree map copying a given map.
|
Int2FloatAVLTreeMap(SortedMap<Integer,Float> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
float |
addTo(int k,
float incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Int2FloatAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(int k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(float v)
Returns
true if this map maps one or more keys to the specified value. |
int |
firstIntKey()
Returns the first (lowest) key currently in this map.
|
float |
get(int k)
Returns the value to which the given key is mapped.
|
Int2FloatSortedMap |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
ObjectSortedSet<Int2FloatMap.Entry> |
int2FloatEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
boolean |
isEmpty() |
IntSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
int |
lastIntKey()
Returns the last (highest) key currently in this map.
|
float |
put(int k,
float v)
Adds a pair to the map (optional operation).
|
float |
remove(int k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Int2FloatSortedMap |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Int2FloatSortedMap |
tailMap(int 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.
|
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, replaceapplyAsDoublepublic Int2FloatAVLTreeMap()
public Int2FloatAVLTreeMap(Comparator<? super Integer> c)
c - a (possibly type-specific) comparator.public Int2FloatAVLTreeMap(Map<? extends Integer,? extends Float> m)
m - a Map to be copied into the new tree map.public Int2FloatAVLTreeMap(SortedMap<Integer,Float> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Int2FloatAVLTreeMap(Int2FloatMap m)
m - a type-specific map to be copied into the new tree map.public Int2FloatAVLTreeMap(Int2FloatSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Int2FloatAVLTreeMap(int[] k,
float[] v,
Comparator<? super Integer> 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 Int2FloatAVLTreeMap(int[] 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 addTo(int 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(int k,
float v)
Int2FloatFunctionput in interface Int2FloatFunctionk - the key.v - the value.Function.put(Object,Object)public float remove(int k)
Int2FloatFunctionremove in interface Int2FloatFunctionk - the key.Function.remove(Object)public boolean containsValue(float v)
Int2FloatMaptrue if this map maps one or more keys to the specified value.containsValue in interface Int2FloatMapcontainsValue in class AbstractInt2FloatMapMap.containsValue(Object)public void clear()
Int2FloatMapclear in interface Int2FloatMapclear in interface Map<Integer,Float>Map.clear()public boolean containsKey(int k)
Int2FloatMapcontainsKey in interface Int2FloatFunctioncontainsKey in interface Int2FloatMapcontainsKey in class AbstractInt2FloatMapk - the key.key.Map.containsKey(Object)public int size()
Int2FloatMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public float get(int k)
Int2FloatFunctionget in interface Int2FloatFunctionk - the key.Function.get(Object)public int firstIntKey()
Int2FloatSortedMapfirstIntKey in interface Int2FloatSortedMapSortedMap.firstKey()public int lastIntKey()
Int2FloatSortedMaplastIntKey in interface Int2FloatSortedMapSortedMap.lastKey()public ObjectSortedSet<Int2FloatMap.Entry> int2FloatEntrySet()
Int2FloatSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
int2FloatEntrySet in interface Int2FloatMapint2FloatEntrySet in interface Int2FloatSortedMapInt2FloatSortedMap.entrySet()public IntSortedSet 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 Int2FloatMapkeySet in interface Int2FloatSortedMapkeySet in interface Map<Integer,Float>keySet in interface SortedMap<Integer,Float>keySet in class AbstractInt2FloatSortedMapMap.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 Int2FloatMapvalues in interface Int2FloatSortedMapvalues in interface Map<Integer,Float>values in interface SortedMap<Integer,Float>values in class AbstractInt2FloatSortedMapMap.values()public IntComparator comparator()
Int2FloatSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Int2FloatSortedMapcomparator in interface SortedMap<Integer,Float>SortedMap.comparator()public Int2FloatSortedMap headMap(int to)
Int2FloatSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Int2FloatSortedMapSortedMap.headMap(Object)public Int2FloatSortedMap tailMap(int from)
Int2FloatSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Int2FloatSortedMapSortedMap.tailMap(Object)public Int2FloatSortedMap subMap(int from, int to)
Int2FloatSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Int2FloatSortedMapSortedMap.subMap(Object,Object)public Int2FloatAVLTreeMap 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.