public class Float2ShortRBTreeMap extends AbstractFloat2ShortSortedMap 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.
AbstractFloat2ShortMap.BasicEntryFloat2ShortSortedMap.FastSortedEntrySetFloat2ShortMap.FastEntrySet| Constructor and Description |
|---|
Float2ShortRBTreeMap()
Creates a new empty tree map.
|
Float2ShortRBTreeMap(Comparator<? super Float> c)
Creates a new empty tree map with the given comparator.
|
Float2ShortRBTreeMap(float[] k,
short[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Float2ShortRBTreeMap(float[] k,
short[] v,
Comparator<? super Float> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Float2ShortRBTreeMap(Float2ShortMap m)
Creates a new tree map copying a given map.
|
Float2ShortRBTreeMap(Float2ShortSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Float2ShortRBTreeMap(Map<? extends Float,? extends Short> m)
Creates a new tree map copying a given map.
|
Float2ShortRBTreeMap(SortedMap<Float,Short> 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).
|
Float2ShortRBTreeMap |
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
AbstractFloat2ShortMap.keySet(). |
boolean |
containsValue(short v)
Checks whether the given value is contained in
AbstractFloat2ShortMap.values(). |
float |
firstFloatKey() |
ObjectSortedSet<Float2ShortMap.Entry> |
float2ShortEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
short |
get(float k)
Returns the value to which the given key is mapped.
|
Float2ShortSortedMap |
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() |
short |
put(float k,
short v)
Adds a pair to the map.
|
Short |
put(Float ok,
Short ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
short |
remove(float k)
Removes the mapping with the given key.
|
Short |
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.
|
Float2ShortSortedMap |
subMap(float from,
float to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Float2ShortSortedMap |
tailMap(float from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
ShortCollection |
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, getdefaultReturnValue, defaultReturnValuecontainsKey, getcontainsKey, containsValue, equals, get, hashCode, putAllpublic Float2ShortRBTreeMap()
public Float2ShortRBTreeMap(Comparator<? super Float> c)
c - a (possibly type-specific) comparator.public Float2ShortRBTreeMap(Map<? extends Float,? extends Short> m)
m - a Map to be copied into the new tree map.public Float2ShortRBTreeMap(SortedMap<Float,Short> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Float2ShortRBTreeMap(Float2ShortMap m)
m - a type-specific map to be copied into the new tree map.public Float2ShortRBTreeMap(Float2ShortSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Float2ShortRBTreeMap(float[] k,
short[] 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 Float2ShortRBTreeMap(float[] k,
short[] 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 short put(float k,
short v)
Float2ShortFunctionput in interface Float2ShortFunctionput in class AbstractFloat2ShortFunctionk - the key.v - the value.Function.put(Object,Object)public short remove(float k)
Float2ShortFunctionremove in interface Float2ShortFunctionremove in class AbstractFloat2ShortFunctionFunction.remove(Object)public Short put(Float ok, Short ov)
AbstractFloat2ShortFunctionnull 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 Short remove(Object ok)
AbstractFloat2ShortFunctionnull 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(short v)
AbstractFloat2ShortMapAbstractFloat2ShortMap.values().containsValue in interface Float2ShortMapcontainsValue in class AbstractFloat2ShortMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(float k)
AbstractFloat2ShortMapAbstractFloat2ShortMap.keySet().containsKey in interface Float2ShortFunctioncontainsKey in class AbstractFloat2ShortMapFunction.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 short get(float k)
Float2ShortFunctionget in interface Float2ShortFunctionk - the key.Function.get(Object)public float firstFloatKey()
firstFloatKey in interface Float2ShortSortedMapSortedMap.firstKey()public float lastFloatKey()
lastFloatKey in interface Float2ShortSortedMapSortedMap.lastKey()public ObjectSortedSet<Float2ShortMap.Entry> float2ShortEntrySet()
Float2ShortSortedMapfloat2ShortEntrySet in interface Float2ShortMapfloat2ShortEntrySet in interface Float2ShortSortedMapFloat2ShortSortedMap.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 Float2ShortMapkeySet in interface Float2ShortSortedMapkeySet in interface Map<Float,Short>keySet in interface SortedMap<Float,Short>keySet in class AbstractFloat2ShortSortedMapMap.keySet()public ShortCollection 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 Float2ShortMapvalues in interface Float2ShortSortedMapvalues in interface Map<Float,Short>values in interface SortedMap<Float,Short>values in class AbstractFloat2ShortSortedMapMap.values()public FloatComparator comparator()
Float2ShortSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Float2ShortSortedMapcomparator in interface SortedMap<Float,Short>SortedMap.comparator()public Float2ShortSortedMap headMap(float to)
Float2ShortSortedMaptoKey.headMap in interface Float2ShortSortedMapSortedMap.headMap(Object)public Float2ShortSortedMap tailMap(float from)
Float2ShortSortedMapfromKey.tailMap in interface Float2ShortSortedMapSortedMap.tailMap(Object)public Float2ShortSortedMap subMap(float from, float to)
Float2ShortSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Float2ShortSortedMapSortedMap.subMap(Object,Object)public Float2ShortRBTreeMap 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.