public class Int2FloatRBTreeMap 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.
AbstractInt2FloatSortedMap.KeySetIterator, AbstractInt2FloatSortedMap.ValuesCollection, AbstractInt2FloatSortedMap.ValuesIteratorAbstractInt2FloatMap.BasicEntryInt2FloatSortedMap.FastSortedEntrySetInt2FloatMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected IntComparator |
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<Int2FloatMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.ints.Int2FloatRBTreeMap.Entry |
firstEntry
The first key in this map.
|
protected IntSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.ints.Int2FloatRBTreeMap.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 Integer> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.ints.Int2FloatRBTreeMap.Entry |
tree
A reference to the root entry.
|
protected FloatCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Int2FloatRBTreeMap()
Creates a new empty tree map.
|
Int2FloatRBTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2FloatRBTreeMap(int[] k,
float[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2FloatRBTreeMap(int[] k,
float[] v,
Comparator<? super Integer> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Int2FloatRBTreeMap(Int2FloatMap m)
Creates a new tree map copying a given map.
|
Int2FloatRBTreeMap(Int2FloatSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Int2FloatRBTreeMap(Map<? extends Integer,? extends Float> m)
Creates a new tree map copying a given map.
|
Int2FloatRBTreeMap(SortedMap<Integer,Float> 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).
|
Int2FloatRBTreeMap |
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)
Checks whether the given value is contained in
AbstractInt2FloatMap.keySet(). |
boolean |
containsValue(float v)
Checks whether the given value is contained in
AbstractInt2FloatMap.values(). |
int |
firstIntKey() |
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() |
Float |
put(Integer ok,
Float ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
float |
put(int k,
float v)
Adds a pair to the map.
|
float |
remove(int k)
Removes the mapping with the given key.
|
Float |
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.
|
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.
|
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.ints.Int2FloatRBTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.ints.Int2FloatRBTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.ints.Int2FloatRBTreeMap.Entry lastEntry
protected transient volatile ObjectSortedSet<Int2FloatMap.Entry> entries
protected transient volatile IntSortedSet keys
protected transient volatile FloatCollection values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected Comparator<? super Integer> storedComparator
protected transient IntComparator 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 Int2FloatRBTreeMap()
public Int2FloatRBTreeMap(Comparator<? super Integer> c)
c - a (possibly type-specific) comparator.public Int2FloatRBTreeMap(Map<? extends Integer,? extends Float> m)
m - a Map to be copied into the new tree map.public Int2FloatRBTreeMap(SortedMap<Integer,Float> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Int2FloatRBTreeMap(Int2FloatMap m)
m - a type-specific map to be copied into the new tree map.public Int2FloatRBTreeMap(Int2FloatSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Int2FloatRBTreeMap(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 Int2FloatRBTreeMap(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 put(int k,
float v)
Int2FloatFunctionput in interface Int2FloatFunctionput in class AbstractInt2FloatFunctionk - the key.v - the value.Function.put(Object,Object)public float remove(int k)
Int2FloatFunctionremove in interface Int2FloatFunctionremove in class AbstractInt2FloatFunctionFunction.remove(Object)public Float put(Integer ok, Float ov)
AbstractInt2FloatFunctionnull 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 Float remove(Object ok)
AbstractInt2FloatFunctionnull 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(float v)
AbstractInt2FloatMapAbstractInt2FloatMap.values().containsValue in interface Int2FloatMapcontainsValue in class AbstractInt2FloatMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(int k)
AbstractInt2FloatMapAbstractInt2FloatMap.keySet().containsKey in interface Int2FloatFunctioncontainsKey in class AbstractInt2FloatMapFunction.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 float get(int k)
Int2FloatFunctionget in interface Int2FloatFunctionk - the key.Function.get(Object)public int firstIntKey()
firstIntKey in interface Int2FloatSortedMapSortedMap.firstKey()public int lastIntKey()
lastIntKey in interface Int2FloatSortedMapSortedMap.lastKey()public ObjectSortedSet<Int2FloatMap.Entry> int2FloatEntrySet()
Int2FloatSortedMapint2FloatEntrySet 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.headMap in interface Int2FloatSortedMapSortedMap.headMap(Object)public Int2FloatSortedMap tailMap(int from)
Int2FloatSortedMapfromKey.tailMap in interface Int2FloatSortedMapSortedMap.tailMap(Object)public Int2FloatSortedMap subMap(int from, int to)
Int2FloatSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Int2FloatSortedMapSortedMap.subMap(Object,Object)public Int2FloatRBTreeMap 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.