public class Object2FloatRBTreeMap<K> extends AbstractObject2FloatSortedMap<K> 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.
AbstractObject2FloatSortedMap.KeySetIterator<K>, AbstractObject2FloatSortedMap.ValuesCollection, AbstractObject2FloatSortedMap.ValuesIterator<K>AbstractObject2FloatMap.BasicEntry<K>, AbstractObject2FloatMap.BasicEntrySet<K>Object2FloatSortedMap.FastSortedEntrySet<K>Object2FloatMap.FastEntrySet<K>| Modifier and Type | Field and Description |
|---|---|
protected Comparator<? super K> |
actualComparator
This map's actual comparator; it may differ from
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping. |
protected int |
count
Number of entries in this map.
|
protected ObjectSortedSet<Object2FloatMap.Entry<K>> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.objects.Object2FloatRBTreeMap.Entry<K> |
firstEntry
The first key in this map.
|
protected ObjectSortedSet<K> |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.objects.Object2FloatRBTreeMap.Entry<K> |
lastEntry
The last key in this map.
|
protected boolean |
modified
The value of this variable remembers, after a
put()
or a remove(), whether the domain of the map
has been modified. |
protected Comparator<? super K> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.objects.Object2FloatRBTreeMap.Entry<K> |
tree
A reference to the root entry.
|
protected FloatCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Object2FloatRBTreeMap()
Creates a new empty tree map.
|
Object2FloatRBTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator.
|
Object2FloatRBTreeMap(K[] k,
float[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Object2FloatRBTreeMap(K[] k,
float[] v,
Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Object2FloatRBTreeMap(Map<? extends K,? extends Float> m)
Creates a new tree map copying a given map.
|
Object2FloatRBTreeMap(Object2FloatMap<? extends K> m)
Creates a new tree map copying a given map.
|
Object2FloatRBTreeMap(Object2FloatSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Object2FloatRBTreeMap(SortedMap<K,Float> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
float |
addTo(K 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).
|
Object2FloatRBTreeMap<K> |
clone()
Returns a deep copy of this tree map.
|
Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(Object 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. |
K |
firstKey() |
float |
getFloat(Object k)
Returns the value to which the given key is mapped.
|
Object2FloatSortedMap<K> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
K |
lastKey() |
ObjectSortedSet<Object2FloatMap.Entry<K>> |
object2FloatEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
float |
put(K k,
float v)
Adds a pair to the map (optional operation).
|
float |
removeFloat(Object k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Object2FloatSortedMap<K> |
subMap(K from,
K to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Object2FloatSortedMap<K> |
tailMap(K 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, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitentrySetcomputeFloat, computeFloatIfAbsent, computeFloatIfAbsentPartial, computeFloatIfPresent, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, mergeFloat, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsDoublecompute, computeIfAbsent, computeIfPresent, equals, forEach, hashCode, putAll, replaceAllprotected transient it.unimi.dsi.fastutil.objects.Object2FloatRBTreeMap.Entry<K> tree
protected int count
protected transient it.unimi.dsi.fastutil.objects.Object2FloatRBTreeMap.Entry<K> firstEntry
protected transient it.unimi.dsi.fastutil.objects.Object2FloatRBTreeMap.Entry<K> lastEntry
protected transient ObjectSortedSet<Object2FloatMap.Entry<K>> entries
protected transient ObjectSortedSet<K> keys
protected transient FloatCollection values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected Comparator<? super K> storedComparator
protected transient Comparator<? super K> actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Object2FloatRBTreeMap()
public Object2FloatRBTreeMap(Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2FloatRBTreeMap(Map<? extends K,? extends Float> m)
m - a Map to be copied into the new tree map.public Object2FloatRBTreeMap(SortedMap<K,Float> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Object2FloatRBTreeMap(Object2FloatMap<? extends K> m)
m - a type-specific map to be copied into the new tree map.public Object2FloatRBTreeMap(Object2FloatSortedMap<K> m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Object2FloatRBTreeMap(K[] k, float[] v, Comparator<? super K> 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 Object2FloatRBTreeMap(K[] 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(K 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(K k, float v)
Object2FloatFunctionput in interface Object2FloatFunction<K>k - the key.v - the value.Function.put(Object,Object)public float removeFloat(Object k)
Object2FloatFunctionremoveFloat in interface Object2FloatFunction<K>k - the key.Function.remove(Object)public boolean containsValue(float v)
Object2FloatMaptrue if this map maps one or more keys to the specified value.containsValue in interface Object2FloatMap<K>containsValue in class AbstractObject2FloatMap<K>Map.containsValue(Object)public void clear()
Object2FloatMapclear in interface Object2FloatMap<K>clear in interface Map<K,Float>Map.clear()public boolean containsKey(Object k)
Object2FloatMapcontainsKey in interface Object2FloatMap<K>containsKey in interface Map<K,Float>containsKey in class AbstractObject2FloatMap<K>k - the key.key.Map.containsKey(Object)public int size()
Object2FloatMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public float getFloat(Object k)
Object2FloatFunctiongetFloat in interface Object2FloatFunction<K>k - the key.Function.get(Object)public ObjectSortedSet<Object2FloatMap.Entry<K>> object2FloatEntrySet()
Object2FloatSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
object2FloatEntrySet in interface Object2FloatMap<K>object2FloatEntrySet in interface Object2FloatSortedMap<K>Object2FloatSortedMap.entrySet()public ObjectSortedSet<K> 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 Object2FloatMap<K>keySet in interface Object2FloatSortedMap<K>keySet in interface Map<K,Float>keySet in interface SortedMap<K,Float>keySet in class AbstractObject2FloatSortedMap<K>Map.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 Object2FloatMap<K>values in interface Object2FloatSortedMap<K>values in interface Map<K,Float>values in interface SortedMap<K,Float>values in class AbstractObject2FloatSortedMap<K>Map.values()public Comparator<? super K> comparator()
Object2FloatSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Object2FloatSortedMap<K>comparator in interface SortedMap<K,Float>SortedMap.comparator()public Object2FloatSortedMap<K> headMap(K to)
Object2FloatSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Object2FloatSortedMap<K>headMap in interface SortedMap<K,Float>SortedMap.headMap(Object)public Object2FloatSortedMap<K> tailMap(K from)
Object2FloatSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Object2FloatSortedMap<K>tailMap in interface SortedMap<K,Float>SortedMap.tailMap(Object)public Object2FloatSortedMap<K> subMap(K from, K to)
Object2FloatSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Object2FloatSortedMap<K>subMap in interface SortedMap<K,Float>SortedMap.subMap(Object,Object)public Object2FloatRBTreeMap<K> 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.
Copyright © 2020. All rights reserved.