public class Float2ByteRBTreeMap extends AbstractFloat2ByteSortedMap 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.
AbstractFloat2ByteMap.BasicEntryFloat2ByteSortedMap.FastSortedEntrySetFloat2ByteMap.FastEntrySet| Constructor and Description |
|---|
Float2ByteRBTreeMap()
Creates a new empty tree map.
|
Float2ByteRBTreeMap(Comparator<? super Float> c)
Creates a new empty tree map with the given comparator.
|
Float2ByteRBTreeMap(float[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Float2ByteRBTreeMap(float[] k,
byte[] v,
Comparator<? super Float> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Float2ByteRBTreeMap(Float2ByteMap m)
Creates a new tree map copying a given map.
|
Float2ByteRBTreeMap(Float2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Float2ByteRBTreeMap(Map<? extends Float,? extends Byte> m)
Creates a new tree map copying a given map.
|
Float2ByteRBTreeMap(SortedMap<Float,Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
byte |
addTo(float k,
byte incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Float2ByteRBTreeMap |
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
AbstractFloat2ByteMap.keySet(). |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractFloat2ByteMap.values(). |
float |
firstFloatKey() |
ObjectSortedSet<Float2ByteMap.Entry> |
float2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
byte |
get(float k)
Returns the value to which the given key is mapped.
|
Float2ByteSortedMap |
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() |
byte |
put(float k,
byte v)
Adds a pair to the map.
|
Byte |
put(Float ok,
Byte ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
byte |
remove(float k)
Removes the mapping with the given key.
|
Byte |
remove(Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Float2ByteSortedMap |
subMap(float from,
float to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Float2ByteSortedMap |
tailMap(float from)
Returns a view of the portion of this sorted map whose keys are greater
than or equal to
fromKey. |
ByteCollection |
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, getcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Float2ByteRBTreeMap()
public Float2ByteRBTreeMap(Comparator<? super Float> c)
c - a (possibly type-specific) comparator.public Float2ByteRBTreeMap(Map<? extends Float,? extends Byte> m)
m - a Map to be copied into the new tree map.public Float2ByteRBTreeMap(SortedMap<Float,Byte> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Float2ByteRBTreeMap(Float2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Float2ByteRBTreeMap(Float2ByteSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Float2ByteRBTreeMap(float[] k,
byte[] 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 Float2ByteRBTreeMap(float[] k,
byte[] 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 byte addTo(float k,
byte incr)
Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
k - the key.incr - the increment.public byte put(float k,
byte v)
Float2ByteFunctionput in interface Float2ByteFunctionput in class AbstractFloat2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public byte remove(float k)
Float2ByteFunctionremove in interface Float2ByteFunctionremove in class AbstractFloat2ByteFunctionk - the key.Function.remove(Object)@Deprecated public Byte put(Float ok, Byte ov)
null 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.
@Deprecated public Byte remove(Object ok)
null 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(byte v)
AbstractFloat2ByteMapAbstractFloat2ByteMap.values().containsValue in interface Float2ByteMapcontainsValue in class AbstractFloat2ByteMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(float k)
AbstractFloat2ByteMapAbstractFloat2ByteMap.keySet().containsKey in interface Float2ByteFunctioncontainsKey in class AbstractFloat2ByteMapFunction.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 byte get(float k)
Float2ByteFunctionget in interface Float2ByteFunctionk - the key.Function.get(Object)public float firstFloatKey()
firstFloatKey in interface Float2ByteSortedMapSortedMap.firstKey()public float lastFloatKey()
lastFloatKey in interface Float2ByteSortedMapSortedMap.lastKey()public ObjectSortedSet<Float2ByteMap.Entry> float2ByteEntrySet()
Float2ByteSortedMapfloat2ByteEntrySet in interface Float2ByteMapfloat2ByteEntrySet in interface Float2ByteSortedMapFloat2ByteSortedMap.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 Float2ByteMapkeySet in interface Float2ByteSortedMapkeySet in interface Map<Float,Byte>keySet in interface SortedMap<Float,Byte>keySet in class AbstractFloat2ByteSortedMapMap.keySet()public ByteCollection 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 Float2ByteMapvalues in interface Float2ByteSortedMapvalues in interface Map<Float,Byte>values in interface SortedMap<Float,Byte>values in class AbstractFloat2ByteSortedMapMap.values()public FloatComparator comparator()
Float2ByteSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Float2ByteSortedMapcomparator in interface SortedMap<Float,Byte>SortedMap.comparator()public Float2ByteSortedMap headMap(float to)
Float2ByteSortedMaptoKey.headMap in interface Float2ByteSortedMapSortedMap.headMap(Object)public Float2ByteSortedMap tailMap(float from)
Float2ByteSortedMapfromKey.tailMap in interface Float2ByteSortedMapSortedMap.tailMap(Object)public Float2ByteSortedMap subMap(float from, float to)
Float2ByteSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Float2ByteSortedMapSortedMap.subMap(Object,Object)public Float2ByteRBTreeMap 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.