public class Float2ReferenceRBTreeMap<V> extends AbstractFloat2ReferenceSortedMap<V> 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.
AbstractFloat2ReferenceSortedMap.KeySetIterator<V>, AbstractFloat2ReferenceSortedMap.ValuesCollection, AbstractFloat2ReferenceSortedMap.ValuesIterator<V>AbstractFloat2ReferenceMap.BasicEntry<V>, AbstractFloat2ReferenceMap.BasicEntrySet<V>Float2ReferenceSortedMap.FastSortedEntrySet<V>Float2ReferenceMap.FastEntrySet<V>| Modifier and Type | Field and Description |
|---|---|
protected FloatComparator |
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<Float2ReferenceMap.Entry<V>> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.floats.Float2ReferenceRBTreeMap.Entry<V> |
firstEntry
The first key in this map.
|
protected FloatSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.floats.Float2ReferenceRBTreeMap.Entry<V> |
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 Float> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.floats.Float2ReferenceRBTreeMap.Entry<V> |
tree
A reference to the root entry.
|
protected ReferenceCollection<V> |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Float2ReferenceRBTreeMap()
Creates a new empty tree map.
|
Float2ReferenceRBTreeMap(Comparator<? super Float> c)
Creates a new empty tree map with the given comparator.
|
Float2ReferenceRBTreeMap(float[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Float2ReferenceRBTreeMap(float[] k,
V[] v,
Comparator<? super Float> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Float2ReferenceRBTreeMap(Float2ReferenceMap<? extends V> m)
Creates a new tree map copying a given map.
|
Float2ReferenceRBTreeMap(Float2ReferenceSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Float2ReferenceRBTreeMap(Map<? extends Float,? extends V> m)
Creates a new tree map copying a given map.
|
Float2ReferenceRBTreeMap(SortedMap<Float,V> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Float2ReferenceRBTreeMap<V> |
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(Object v) |
float |
firstFloatKey()
Returns the first (lowest) key currently in this map.
|
ObjectSortedSet<Float2ReferenceMap.Entry<V>> |
float2ReferenceEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
V |
get(float k)
Returns the value to which the given key is mapped.
|
Float2ReferenceSortedMap<V> |
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.
|
V |
put(float k,
V v)
Adds a pair to the map (optional operation).
|
V |
remove(float k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Float2ReferenceSortedMap<V> |
subMap(float from,
float to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Float2ReferenceSortedMap<V> |
tailMap(float from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
ReferenceCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitentrySet, firstKey, headMap, lastKey, subMap, tailMapcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyprotected transient it.unimi.dsi.fastutil.floats.Float2ReferenceRBTreeMap.Entry<V> tree
protected int count
protected transient it.unimi.dsi.fastutil.floats.Float2ReferenceRBTreeMap.Entry<V> firstEntry
protected transient it.unimi.dsi.fastutil.floats.Float2ReferenceRBTreeMap.Entry<V> lastEntry
protected transient ObjectSortedSet<Float2ReferenceMap.Entry<V>> entries
protected transient FloatSortedSet keys
protected transient ReferenceCollection<V> values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected Comparator<? super Float> storedComparator
protected transient FloatComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Float2ReferenceRBTreeMap()
public Float2ReferenceRBTreeMap(Comparator<? super Float> c)
c - a (possibly type-specific) comparator.public Float2ReferenceRBTreeMap(Map<? extends Float,? extends V> m)
m - a Map to be copied into the new tree map.public Float2ReferenceRBTreeMap(SortedMap<Float,V> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Float2ReferenceRBTreeMap(Float2ReferenceMap<? extends V> m)
m - a type-specific map to be copied into the new tree map.public Float2ReferenceRBTreeMap(Float2ReferenceSortedMap<V> m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Float2ReferenceRBTreeMap(float[] k,
V[] 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 Float2ReferenceRBTreeMap(float[] k,
V[] 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 V put(float k, V v)
Float2ReferenceFunctionput in interface Float2ReferenceFunction<V>k - the key.v - the value.Function.put(Object,Object)public V remove(float k)
Float2ReferenceFunctionremove in interface Float2ReferenceFunction<V>k - the key.Function.remove(Object)public boolean containsValue(Object v)
containsValue in interface Map<Float,V>containsValue in class AbstractFloat2ReferenceMap<V>public void clear()
Float2ReferenceMapclear in interface Float2ReferenceMap<V>clear in interface Map<Float,V>Map.clear()public boolean containsKey(float k)
Float2ReferenceMapcontainsKey in interface Float2ReferenceFunction<V>containsKey in interface Float2ReferenceMap<V>containsKey in class AbstractFloat2ReferenceMap<V>k - the key.key.Map.containsKey(Object)public int size()
Float2ReferenceMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public V get(float k)
Float2ReferenceFunctionget in interface Float2ReferenceFunction<V>k - the key.Function.get(Object)public float firstFloatKey()
Float2ReferenceSortedMapfirstFloatKey in interface Float2ReferenceSortedMap<V>SortedMap.firstKey()public float lastFloatKey()
Float2ReferenceSortedMaplastFloatKey in interface Float2ReferenceSortedMap<V>SortedMap.lastKey()public ObjectSortedSet<Float2ReferenceMap.Entry<V>> float2ReferenceEntrySet()
Float2ReferenceSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
float2ReferenceEntrySet in interface Float2ReferenceMap<V>float2ReferenceEntrySet in interface Float2ReferenceSortedMap<V>Float2ReferenceSortedMap.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 Float2ReferenceMap<V>keySet in interface Float2ReferenceSortedMap<V>keySet in interface Map<Float,V>keySet in interface SortedMap<Float,V>keySet in class AbstractFloat2ReferenceSortedMap<V>Map.keySet()public ReferenceCollection<V> 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 Float2ReferenceMap<V>values in interface Float2ReferenceSortedMap<V>values in interface Map<Float,V>values in interface SortedMap<Float,V>values in class AbstractFloat2ReferenceSortedMap<V>Map.values()public FloatComparator comparator()
Float2ReferenceSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Float2ReferenceSortedMap<V>comparator in interface SortedMap<Float,V>SortedMap.comparator()public Float2ReferenceSortedMap<V> headMap(float to)
Float2ReferenceSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Float2ReferenceSortedMap<V>SortedMap.headMap(Object)public Float2ReferenceSortedMap<V> tailMap(float from)
Float2ReferenceSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Float2ReferenceSortedMap<V>SortedMap.tailMap(Object)public Float2ReferenceSortedMap<V> subMap(float from, float to)
Float2ReferenceSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Float2ReferenceSortedMap<V>SortedMap.subMap(Object,Object)public Float2ReferenceRBTreeMap<V> 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.