public class Float2ByteAVLTreeMap 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.
AbstractFloat2ByteSortedMap.KeySetIterator, AbstractFloat2ByteSortedMap.ValuesCollection, AbstractFloat2ByteSortedMap.ValuesIteratorAbstractFloat2ByteMap.BasicEntry, AbstractFloat2ByteMap.BasicEntrySetFloat2ByteSortedMap.FastSortedEntrySetFloat2ByteMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected FloatComparator |
actualComparator
This map's actual comparator; it may differ from
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping. |
protected int |
count
Number of entries in this map.
|
protected ObjectSortedSet<Float2ByteMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.floats.Float2ByteAVLTreeMap.Entry |
firstEntry
The first key in this map.
|
protected FloatSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.floats.Float2ByteAVLTreeMap.Entry |
lastEntry
The last key in this map.
|
protected boolean |
modified
The value of this variable remembers, after a
put()
or a remove(), whether the domain of the map
has been modified. |
protected Comparator<? super Float> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.floats.Float2ByteAVLTreeMap.Entry |
tree
A reference to the root entry.
|
protected ByteCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Float2ByteAVLTreeMap()
Creates a new empty tree map.
|
Float2ByteAVLTreeMap(Comparator<? super Float> c)
Creates a new empty tree map with the given comparator.
|
Float2ByteAVLTreeMap(float[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Float2ByteAVLTreeMap(float[] k,
byte[] v,
Comparator<? super Float> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Float2ByteAVLTreeMap(Float2ByteMap m)
Creates a new tree map copying a given map.
|
Float2ByteAVLTreeMap(Float2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Float2ByteAVLTreeMap(Map<? extends Float,? extends Byte> m)
Creates a new tree map copying a given map.
|
Float2ByteAVLTreeMap(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 of the mappings from this map (optional operation).
|
Float2ByteAVLTreeMap |
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)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(byte v)
Returns
true if this map maps one or more keys to the specified value. |
float |
firstFloatKey()
Returns the first (lowest) key currently in this map.
|
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()
Returns the last (highest) key currently in this map.
|
byte |
put(float k,
byte v)
Adds a pair to the map (optional operation).
|
byte |
remove(float k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
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.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitentrySet, firstKey, headMap, lastKey, subMap, tailMapcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsIntprotected transient it.unimi.dsi.fastutil.floats.Float2ByteAVLTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.floats.Float2ByteAVLTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.floats.Float2ByteAVLTreeMap.Entry lastEntry
protected transient ObjectSortedSet<Float2ByteMap.Entry> entries
protected transient FloatSortedSet keys
protected transient ByteCollection values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected Comparator<? super Float> storedComparator
protected transient FloatComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Float2ByteAVLTreeMap()
public Float2ByteAVLTreeMap(Comparator<? super Float> c)
c - a (possibly type-specific) comparator.public Float2ByteAVLTreeMap(Map<? extends Float,? extends Byte> m)
m - a Map to be copied into the new tree map.public Float2ByteAVLTreeMap(SortedMap<Float,Byte> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Float2ByteAVLTreeMap(Float2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Float2ByteAVLTreeMap(Float2ByteSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Float2ByteAVLTreeMap(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 Float2ByteAVLTreeMap(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 Float2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public byte remove(float k)
Float2ByteFunctionremove in interface Float2ByteFunctionk - the key.Function.remove(Object)public boolean containsValue(byte v)
Float2ByteMaptrue if this map maps one or more keys to the specified value.containsValue in interface Float2ByteMapcontainsValue in class AbstractFloat2ByteMapMap.containsValue(Object)public void clear()
Float2ByteMapclear in interface Float2ByteMapclear in interface Map<Float,Byte>Map.clear()public boolean containsKey(float k)
Float2ByteMapcontainsKey in interface Float2ByteFunctioncontainsKey in interface Float2ByteMapcontainsKey in class AbstractFloat2ByteMapk - the key.key.Map.containsKey(Object)public int size()
Float2ByteMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public byte get(float k)
Float2ByteFunctionget in interface Float2ByteFunctionk - the key.Function.get(Object)public float firstFloatKey()
Float2ByteSortedMapfirstFloatKey in interface Float2ByteSortedMapSortedMap.firstKey()public float lastFloatKey()
Float2ByteSortedMaplastFloatKey in interface Float2ByteSortedMapSortedMap.lastKey()public ObjectSortedSet<Float2ByteMap.Entry> float2ByteEntrySet()
Float2ByteSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
float2ByteEntrySet 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()
Float2ByteSortedMapNote 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.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Float2ByteSortedMapSortedMap.headMap(Object)public Float2ByteSortedMap tailMap(float from)
Float2ByteSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Float2ByteSortedMapSortedMap.tailMap(Object)public Float2ByteSortedMap subMap(float from, float to)
Float2ByteSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Float2ByteSortedMapSortedMap.subMap(Object,Object)public Float2ByteAVLTreeMap 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.
Copyright © 2020. All rights reserved.