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.
AbstractFloat2IntSortedMap.KeySetIterator, AbstractFloat2IntSortedMap.ValuesCollection, AbstractFloat2IntSortedMap.ValuesIteratorAbstractFloat2IntMap.BasicEntryFloat2IntSortedMap.FastSortedEntrySetFloat2IntMap.FastEntrySet| 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<Float2IntMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.floats.Float2IntRBTreeMap.Entry |
firstEntry
The first key in this map.
|
protected FloatSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.floats.Float2IntRBTreeMap.Entry |
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. |
static long |
serialVersionUID |
protected Comparator<? super Float> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.floats.Float2IntRBTreeMap.Entry |
tree
A reference to the root entry.
|
protected IntCollection |
values
Cached collection of values.
|
defRetValue| 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 |
|---|---|
void |
clear()
Removes all associations from this function (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)
Checks whether the given value is contained in
AbstractFloat2IntMap.keySet(). |
boolean |
containsValue(int v)
Checks whether the given value is contained in
AbstractFloat2IntMap.values(). |
float |
firstFloatKey() |
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() |
int |
put(float k,
int v)
Adds a pair to the map.
|
Integer |
put(Float ok,
Integer ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
remove(float k)
Removes the mapping with the given key.
|
Integer |
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.
|
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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getfinalize, getClass, notify, notifyAll, wait, wait, waitdefaultReturnValue, defaultReturnValuecontainsKey, getcontainsKey, containsValue, equals, get, hashCode, putAllprotected transient it.unimi.dsi.fastutil.floats.Float2IntRBTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.floats.Float2IntRBTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.floats.Float2IntRBTreeMap.Entry lastEntry
protected transient volatile ObjectSortedSet<Float2IntMap.Entry> entries
protected transient volatile FloatSortedSet keys
protected transient volatile IntCollection 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 static final long serialVersionUID
public 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 put(float k,
int v)
Float2IntFunctionput in interface Float2IntFunctionput in class AbstractFloat2IntFunctionk - the key.v - the value.Function.put(Object,Object)public int remove(float k)
Float2IntFunctionremove in interface Float2IntFunctionremove in class AbstractFloat2IntFunctionFunction.remove(Object)public Integer put(Float ok, Integer ov)
AbstractFloat2IntFunctionnull 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 Integer remove(Object ok)
AbstractFloat2IntFunctionnull 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(int v)
AbstractFloat2IntMapAbstractFloat2IntMap.values().containsValue in interface Float2IntMapcontainsValue in class AbstractFloat2IntMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(float k)
AbstractFloat2IntMapAbstractFloat2IntMap.keySet().containsKey in interface Float2IntFunctioncontainsKey in class AbstractFloat2IntMapFunction.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 int get(float k)
Float2IntFunctionget in interface Float2IntFunctionk - the key.Function.get(Object)public float firstFloatKey()
firstFloatKey in interface Float2IntSortedMapSortedMap.firstKey()public float lastFloatKey()
lastFloatKey in interface Float2IntSortedMapSortedMap.lastKey()public ObjectSortedSet<Float2IntMap.Entry> float2IntEntrySet()
Float2IntSortedMapfloat2IntEntrySet 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.headMap in interface Float2IntSortedMapSortedMap.headMap(Object)public Float2IntSortedMap tailMap(float from)
Float2IntSortedMapfromKey.tailMap in interface Float2IntSortedMapSortedMap.tailMap(Object)public Float2IntSortedMap subMap(float from, float to)
Float2IntSortedMapfromKey, inclusive, to toKey, exclusive.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.
Copyright © 2013. All Rights Reserved.