public class Byte2ShortAVLTreeMap extends AbstractByte2ShortSortedMap 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.
AbstractByte2ShortSortedMap.KeySetIterator, AbstractByte2ShortSortedMap.ValuesCollection, AbstractByte2ShortSortedMap.ValuesIteratorAbstractByte2ShortMap.BasicEntry, AbstractByte2ShortMap.BasicEntrySetByte2ShortSortedMap.FastSortedEntrySetByte2ShortMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected ByteComparator |
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<Byte2ShortMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.bytes.Byte2ShortAVLTreeMap.Entry |
firstEntry
The first key in this map.
|
protected ByteSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.bytes.Byte2ShortAVLTreeMap.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 Byte> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.bytes.Byte2ShortAVLTreeMap.Entry |
tree
A reference to the root entry.
|
protected ShortCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Byte2ShortAVLTreeMap()
Creates a new empty tree map.
|
Byte2ShortAVLTreeMap(byte[] k,
short[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Byte2ShortAVLTreeMap(byte[] k,
short[] v,
Comparator<? super Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Byte2ShortAVLTreeMap(Byte2ShortMap m)
Creates a new tree map copying a given map.
|
Byte2ShortAVLTreeMap(Byte2ShortSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Byte2ShortAVLTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2ShortAVLTreeMap(Map<? extends Byte,? extends Short> m)
Creates a new tree map copying a given map.
|
Byte2ShortAVLTreeMap(SortedMap<Byte,Short> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
short |
addTo(byte k,
short incr)
Adds an increment to value currently associated with a key.
|
ObjectSortedSet<Byte2ShortMap.Entry> |
byte2ShortEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Byte2ShortAVLTreeMap |
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)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(short v)
Returns
true if this map maps one or more keys to the specified value. |
byte |
firstByteKey()
Returns the first (lowest) key currently in this map.
|
short |
get(byte k)
Returns the value to which the given key is mapped.
|
Byte2ShortSortedMap |
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()
Returns the last (highest) key currently in this map.
|
short |
put(byte k,
short v)
Adds a pair to the map (optional operation).
|
short |
remove(byte k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Byte2ShortSortedMap |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Byte2ShortSortedMap |
tailMap(byte 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.
|
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, replaceapplyAsIntandThen, compose, identityprotected transient it.unimi.dsi.fastutil.bytes.Byte2ShortAVLTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.bytes.Byte2ShortAVLTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.bytes.Byte2ShortAVLTreeMap.Entry lastEntry
protected transient ObjectSortedSet<Byte2ShortMap.Entry> entries
protected transient ByteSortedSet keys
protected transient ShortCollection values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected Comparator<? super Byte> storedComparator
protected transient ByteComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Byte2ShortAVLTreeMap()
public Byte2ShortAVLTreeMap(Comparator<? super Byte> c)
c - a (possibly type-specific) comparator.public Byte2ShortAVLTreeMap(Map<? extends Byte,? extends Short> m)
m - a Map to be copied into the new tree map.public Byte2ShortAVLTreeMap(SortedMap<Byte,Short> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Byte2ShortAVLTreeMap(Byte2ShortMap m)
m - a type-specific map to be copied into the new tree map.public Byte2ShortAVLTreeMap(Byte2ShortSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Byte2ShortAVLTreeMap(byte[] k,
short[] 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 Byte2ShortAVLTreeMap(byte[] 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 addTo(byte k,
short 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 short put(byte k,
short v)
Byte2ShortFunctionput in interface Byte2ShortFunctionk - the key.v - the value.Function.put(Object,Object)public short remove(byte k)
Byte2ShortFunctionremove in interface Byte2ShortFunctionk - the key.Function.remove(Object)public boolean containsValue(short v)
Byte2ShortMaptrue if this map maps one or more keys to the specified value.containsValue in interface Byte2ShortMapcontainsValue in class AbstractByte2ShortMapMap.containsValue(Object)public void clear()
Byte2ShortMapclear in interface Byte2ShortMapclear in interface Map<Byte,Short>Map.clear()public boolean containsKey(byte k)
Byte2ShortMapcontainsKey in interface Byte2ShortFunctioncontainsKey in interface Byte2ShortMapcontainsKey in class AbstractByte2ShortMapk - the key.key.Map.containsKey(Object)public int size()
Byte2ShortMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public short get(byte k)
Byte2ShortFunctionget in interface Byte2ShortFunctionk - the key.Function.get(Object)public byte firstByteKey()
Byte2ShortSortedMapfirstByteKey in interface Byte2ShortSortedMapSortedMap.firstKey()public byte lastByteKey()
Byte2ShortSortedMaplastByteKey in interface Byte2ShortSortedMapSortedMap.lastKey()public ObjectSortedSet<Byte2ShortMap.Entry> byte2ShortEntrySet()
Byte2ShortSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
byte2ShortEntrySet in interface Byte2ShortMapbyte2ShortEntrySet in interface Byte2ShortSortedMapByte2ShortSortedMap.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 Byte2ShortMapkeySet in interface Byte2ShortSortedMapkeySet in interface Map<Byte,Short>keySet in interface SortedMap<Byte,Short>keySet in class AbstractByte2ShortSortedMapMap.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 Byte2ShortMapvalues in interface Byte2ShortSortedMapvalues in interface Map<Byte,Short>values in interface SortedMap<Byte,Short>values in class AbstractByte2ShortSortedMapMap.values()public ByteComparator comparator()
Byte2ShortSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Byte2ShortSortedMapcomparator in interface SortedMap<Byte,Short>SortedMap.comparator()public Byte2ShortSortedMap headMap(byte to)
Byte2ShortSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Byte2ShortSortedMapSortedMap.headMap(Object)public Byte2ShortSortedMap tailMap(byte from)
Byte2ShortSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Byte2ShortSortedMapSortedMap.tailMap(Object)public Byte2ShortSortedMap subMap(byte from, byte to)
Byte2ShortSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Byte2ShortSortedMapSortedMap.subMap(Object,Object)public Byte2ShortAVLTreeMap 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.