public class Byte2FloatAVLTreeMap extends AbstractByte2FloatSortedMap 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.
AbstractByte2FloatMap.BasicEntryByte2FloatSortedMap.FastSortedEntrySetByte2FloatMap.FastEntrySet| Constructor and Description |
|---|
Byte2FloatAVLTreeMap()
Creates a new empty tree map.
|
Byte2FloatAVLTreeMap(byte[] k,
float[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Byte2FloatAVLTreeMap(byte[] k,
float[] v,
Comparator<? super Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Byte2FloatAVLTreeMap(Byte2FloatMap m)
Creates a new tree map copying a given map.
|
Byte2FloatAVLTreeMap(Byte2FloatSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Byte2FloatAVLTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2FloatAVLTreeMap(Map<? extends Byte,? extends Float> m)
Creates a new tree map copying a given map.
|
Byte2FloatAVLTreeMap(SortedMap<Byte,Float> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Byte2FloatMap.Entry> |
byte2FloatEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Byte2FloatAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
ByteComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(byte k)
Checks whether the given value is contained in
AbstractByte2FloatMap.keySet(). |
boolean |
containsValue(float v)
Checks whether the given value is contained in
AbstractByte2FloatMap.values(). |
byte |
firstByteKey() |
float |
get(byte k)
Returns the value to which the given key is mapped.
|
Byte2FloatSortedMap |
headMap(byte to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
ByteSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
byte |
lastByteKey() |
float |
put(byte k,
float v)
Adds a pair to the map.
|
Float |
put(Byte ok,
Float ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
float |
remove(byte 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.
|
Byte2FloatSortedMap |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Byte2FloatSortedMap |
tailMap(byte 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, getdefaultReturnValue, defaultReturnValuecontainsKey, getcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Byte2FloatAVLTreeMap()
public Byte2FloatAVLTreeMap(Comparator<? super Byte> c)
c - a (possibly type-specific) comparator.public Byte2FloatAVLTreeMap(Map<? extends Byte,? extends Float> m)
m - a Map to be copied into the new tree map.public Byte2FloatAVLTreeMap(SortedMap<Byte,Float> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Byte2FloatAVLTreeMap(Byte2FloatMap m)
m - a type-specific map to be copied into the new tree map.public Byte2FloatAVLTreeMap(Byte2FloatSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Byte2FloatAVLTreeMap(byte[] k,
float[] v,
Comparator<? super Byte> 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 Byte2FloatAVLTreeMap(byte[] 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(byte k,
float v)
Byte2FloatFunctionput in interface Byte2FloatFunctionput in class AbstractByte2FloatFunctionk - the key.v - the value.Function.put(Object,Object)public float remove(byte k)
Byte2FloatFunctionremove in interface Byte2FloatFunctionremove in class AbstractByte2FloatFunctionk - the key.Function.remove(Object)public Float put(Byte ok, Float ov)
AbstractByte2FloatFunctionnull 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)
AbstractByte2FloatFunctionnull 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)
AbstractByte2FloatMapAbstractByte2FloatMap.values().containsValue in interface Byte2FloatMapcontainsValue in class AbstractByte2FloatMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(byte k)
AbstractByte2FloatMapAbstractByte2FloatMap.keySet().containsKey in interface Byte2FloatFunctioncontainsKey in class AbstractByte2FloatMapFunction.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(byte k)
Byte2FloatFunctionget in interface Byte2FloatFunctionk - the key.Function.get(Object)public byte firstByteKey()
firstByteKey in interface Byte2FloatSortedMapSortedMap.firstKey()public byte lastByteKey()
lastByteKey in interface Byte2FloatSortedMapSortedMap.lastKey()public ObjectSortedSet<Byte2FloatMap.Entry> byte2FloatEntrySet()
Byte2FloatSortedMapbyte2FloatEntrySet in interface Byte2FloatMapbyte2FloatEntrySet in interface Byte2FloatSortedMapByte2FloatSortedMap.entrySet()public ByteSortedSet 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 Byte2FloatMapkeySet in interface Byte2FloatSortedMapkeySet in interface Map<Byte,Float>keySet in interface SortedMap<Byte,Float>keySet in class AbstractByte2FloatSortedMapMap.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 Byte2FloatMapvalues in interface Byte2FloatSortedMapvalues in interface Map<Byte,Float>values in interface SortedMap<Byte,Float>values in class AbstractByte2FloatSortedMapMap.values()public ByteComparator comparator()
Byte2FloatSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Byte2FloatSortedMapcomparator in interface SortedMap<Byte,Float>SortedMap.comparator()public Byte2FloatSortedMap headMap(byte to)
Byte2FloatSortedMaptoKey.headMap in interface Byte2FloatSortedMapSortedMap.headMap(Object)public Byte2FloatSortedMap tailMap(byte from)
Byte2FloatSortedMapfromKey.tailMap in interface Byte2FloatSortedMapSortedMap.tailMap(Object)public Byte2FloatSortedMap subMap(byte from, byte to)
Byte2FloatSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Byte2FloatSortedMapSortedMap.subMap(Object,Object)public Byte2FloatAVLTreeMap 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.