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.
AbstractFloat2ReferenceMap.BasicEntry<V>Float2ReferenceSortedMap.FastSortedEntrySet<V>Float2ReferenceMap.FastEntrySet<V>| 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 associations from this function (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)
Checks whether the given value is contained in
AbstractFloat2ReferenceMap.keySet(). |
boolean |
containsValue(Object v)
Checks whether the given value is contained in
AbstractFloat2ReferenceMap.values(). |
float |
firstFloatKey() |
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() |
V |
put(float k,
V v)
Adds a pair to the map.
|
V |
put(Float ok,
V ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
V |
remove(float k)
Removes the mapping with the given key.
|
V |
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.
|
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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapequals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getpublic 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>put in class AbstractFloat2ReferenceFunction<V>k - the key.v - the value.Function.put(Object,Object)public V remove(float k)
Float2ReferenceFunctionremove in interface Float2ReferenceFunction<V>remove in class AbstractFloat2ReferenceFunction<V>Function.remove(Object)public V put(Float ok, V ov)
AbstractFloat2ReferenceFunctionnull 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 V remove(Object ok)
AbstractFloat2ReferenceFunctionnull 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(Object v)
AbstractFloat2ReferenceMapAbstractFloat2ReferenceMap.values().containsValue in interface Map<Float,V>containsValue in class AbstractFloat2ReferenceMap<V>public void clear()
Functionpublic boolean containsKey(float k)
AbstractFloat2ReferenceMapAbstractFloat2ReferenceMap.keySet().containsKey in interface Float2ReferenceFunction<V>containsKey in class AbstractFloat2ReferenceMap<V>Function.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 V get(float k)
Float2ReferenceFunctionget in interface Float2ReferenceFunction<V>k - the key.Function.get(Object)public float firstFloatKey()
firstFloatKey in interface Float2ReferenceSortedMap<V>SortedMap.firstKey()public float lastFloatKey()
lastFloatKey in interface Float2ReferenceSortedMap<V>SortedMap.lastKey()public ObjectSortedSet<Float2ReferenceMap.Entry<V>> float2ReferenceEntrySet()
Float2ReferenceSortedMapfloat2ReferenceEntrySet 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.headMap in interface Float2ReferenceSortedMap<V>SortedMap.headMap(Object)public Float2ReferenceSortedMap<V> tailMap(float from)
Float2ReferenceSortedMapfromKey.tailMap in interface Float2ReferenceSortedMap<V>SortedMap.tailMap(Object)public Float2ReferenceSortedMap<V> subMap(float from, float to)
Float2ReferenceSortedMapfromKey, inclusive, to toKey, exclusive.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.