public class Byte2FloatAVLTreeMap extends AbstractByte2FloatSortedMap implements java.io.Serializable, java.lang.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.BasicEntry
Byte2FloatSortedMap.FastSortedEntrySet
Byte2FloatMap.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,
java.util.Comparator<? super java.lang.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(java.util.Comparator<? super java.lang.Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2FloatAVLTreeMap(java.util.Map<? extends java.lang.Byte,? extends java.lang.Float> m)
Creates a new tree map copying a given map.
|
Byte2FloatAVLTreeMap(java.util.SortedMap<java.lang.Byte,java.lang.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.
|
java.lang.Float |
put(java.lang.Byte ok,
java.lang.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.
|
java.lang.Float |
remove(java.lang.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, tailMap
containsValue, equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get
defaultReturnValue, defaultReturnValue
containsKey, get
public Byte2FloatAVLTreeMap()
public Byte2FloatAVLTreeMap(java.util.Comparator<? super java.lang.Byte> c)
c
- a (possibly type-specific) comparator.public Byte2FloatAVLTreeMap(java.util.Map<? extends java.lang.Byte,? extends java.lang.Float> m)
m
- a Map
to be copied into the new tree map.public Byte2FloatAVLTreeMap(java.util.SortedMap<java.lang.Byte,java.lang.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, java.util.Comparator<? super java.lang.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.java.lang.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.java.lang.IllegalArgumentException
- if k
and v
have different lengths.public float put(byte k, float v)
Byte2FloatFunction
put
in interface Byte2FloatFunction
put
in class AbstractByte2FloatFunction
k
- the key.v
- the value.Function.put(Object,Object)
public float remove(byte k)
Byte2FloatFunction
remove
in interface Byte2FloatFunction
remove
in class AbstractByte2FloatFunction
k
- the key.Function.remove(Object)
public java.lang.Float put(java.lang.Byte ok, java.lang.Float ov)
AbstractByte2FloatFunction
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.
put
in interface Function<java.lang.Byte,java.lang.Float>
put
in interface java.util.Map<java.lang.Byte,java.lang.Float>
put
in class AbstractByte2FloatFunction
ok
- the key.ov
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public java.lang.Float remove(java.lang.Object ok)
AbstractByte2FloatFunction
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.
remove
in interface Function<java.lang.Byte,java.lang.Float>
remove
in interface java.util.Map<java.lang.Byte,java.lang.Float>
remove
in class AbstractByte2FloatFunction
ok
- the key.null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(float v)
AbstractByte2FloatMap
AbstractByte2FloatMap.values()
.containsValue
in interface Byte2FloatMap
containsValue
in class AbstractByte2FloatMap
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<java.lang.Byte,java.lang.Float>
clear
in interface java.util.Map<java.lang.Byte,java.lang.Float>
clear
in class AbstractByte2FloatFunction
Map.clear()
public boolean containsKey(byte k)
AbstractByte2FloatMap
AbstractByte2FloatMap.keySet()
.containsKey
in interface Byte2FloatFunction
containsKey
in class AbstractByte2FloatMap
Function.containsKey(Object)
public int size()
Function
Most 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()
isEmpty
in interface java.util.Map<java.lang.Byte,java.lang.Float>
isEmpty
in class AbstractByte2FloatMap
public float get(byte k)
Byte2FloatFunction
get
in interface Byte2FloatFunction
k
- the key.Function.get(Object)
public byte firstByteKey()
firstByteKey
in interface Byte2FloatSortedMap
SortedMap.firstKey()
public byte lastByteKey()
lastByteKey
in interface Byte2FloatSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Byte2FloatMap.Entry> byte2FloatEntrySet()
Byte2FloatSortedMap
byte2FloatEntrySet
in interface Byte2FloatMap
byte2FloatEntrySet
in interface Byte2FloatSortedMap
Byte2FloatSortedMap.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 Byte2FloatMap
keySet
in interface Byte2FloatSortedMap
keySet
in interface java.util.Map<java.lang.Byte,java.lang.Float>
keySet
in interface java.util.SortedMap<java.lang.Byte,java.lang.Float>
keySet
in class AbstractByte2FloatSortedMap
Map.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 Byte2FloatMap
values
in interface Byte2FloatSortedMap
values
in interface java.util.Map<java.lang.Byte,java.lang.Float>
values
in interface java.util.SortedMap<java.lang.Byte,java.lang.Float>
values
in class AbstractByte2FloatSortedMap
Map.values()
public ByteComparator comparator()
Byte2FloatSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Byte2FloatSortedMap
comparator
in interface java.util.SortedMap<java.lang.Byte,java.lang.Float>
SortedMap.comparator()
public Byte2FloatSortedMap headMap(byte to)
Byte2FloatSortedMap
toKey
.headMap
in interface Byte2FloatSortedMap
SortedMap.headMap(Object)
public Byte2FloatSortedMap tailMap(byte from)
Byte2FloatSortedMap
fromKey
.tailMap
in interface Byte2FloatSortedMap
SortedMap.tailMap(Object)
public Byte2FloatSortedMap subMap(byte from, byte to)
Byte2FloatSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Byte2FloatSortedMap
SortedMap.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.
clone
in class java.lang.Object