public class Short2ByteAVLTreeMap extends AbstractShort2ByteSortedMap 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.
AbstractShort2ByteSortedMap.KeySetIterator, AbstractShort2ByteSortedMap.ValuesCollection, AbstractShort2ByteSortedMap.ValuesIteratorAbstractShort2ByteMap.BasicEntry, AbstractShort2ByteMap.BasicEntrySetShort2ByteSortedMap.FastSortedEntrySetShort2ByteMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected ShortComparator |
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<Short2ByteMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.shorts.Short2ByteAVLTreeMap.Entry |
firstEntry
The first key in this map.
|
protected ShortSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.shorts.Short2ByteAVLTreeMap.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 Short> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.shorts.Short2ByteAVLTreeMap.Entry |
tree
A reference to the root entry.
|
protected ByteCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Short2ByteAVLTreeMap()
Creates a new empty tree map.
|
Short2ByteAVLTreeMap(Comparator<? super Short> c)
Creates a new empty tree map with the given comparator.
|
Short2ByteAVLTreeMap(Map<? extends Short,? extends Byte> m)
Creates a new tree map copying a given map.
|
Short2ByteAVLTreeMap(short[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Short2ByteAVLTreeMap(short[] k,
byte[] v,
Comparator<? super Short> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Short2ByteAVLTreeMap(Short2ByteMap m)
Creates a new tree map copying a given map.
|
Short2ByteAVLTreeMap(Short2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Short2ByteAVLTreeMap(SortedMap<Short,Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
byte |
addTo(short 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).
|
Short2ByteAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
ShortComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(short 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. |
short |
firstShortKey()
Returns the first (lowest) key currently in this map.
|
byte |
get(short k)
Returns the value to which the given key is mapped.
|
Short2ByteSortedMap |
headMap(short to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
ShortSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
short |
lastShortKey()
Returns the last (highest) key currently in this map.
|
byte |
put(short k,
byte v)
Adds a pair to the map (optional operation).
|
byte |
remove(short k)
Removes the mapping with the given key (optional operation).
|
ObjectSortedSet<Short2ByteMap.Entry> |
short2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
int |
size()
Returns the number of key/value mappings in this map.
|
Short2ByteSortedMap |
subMap(short from,
short to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Short2ByteSortedMap |
tailMap(short 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, replaceapplyAsIntandThen, compose, identityprotected transient it.unimi.dsi.fastutil.shorts.Short2ByteAVLTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.shorts.Short2ByteAVLTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.shorts.Short2ByteAVLTreeMap.Entry lastEntry
protected transient ObjectSortedSet<Short2ByteMap.Entry> entries
protected transient ShortSortedSet 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 Short> storedComparator
protected transient ShortComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Short2ByteAVLTreeMap()
public Short2ByteAVLTreeMap(Comparator<? super Short> c)
c - a (possibly type-specific) comparator.public Short2ByteAVLTreeMap(Map<? extends Short,? extends Byte> m)
m - a Map to be copied into the new tree map.public Short2ByteAVLTreeMap(SortedMap<Short,Byte> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Short2ByteAVLTreeMap(Short2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Short2ByteAVLTreeMap(Short2ByteSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Short2ByteAVLTreeMap(short[] k,
byte[] v,
Comparator<? super Short> 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 Short2ByteAVLTreeMap(short[] 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(short 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(short k,
byte v)
Short2ByteFunctionput in interface Short2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public byte remove(short k)
Short2ByteFunctionremove in interface Short2ByteFunctionk - the key.Function.remove(Object)public boolean containsValue(byte v)
Short2ByteMaptrue if this map maps one or more keys to the specified value.containsValue in interface Short2ByteMapcontainsValue in class AbstractShort2ByteMapMap.containsValue(Object)public void clear()
Short2ByteMapclear in interface Short2ByteMapclear in interface Map<Short,Byte>Map.clear()public boolean containsKey(short k)
Short2ByteMapcontainsKey in interface Short2ByteFunctioncontainsKey in interface Short2ByteMapcontainsKey in class AbstractShort2ByteMapk - the key.key.Map.containsKey(Object)public int size()
Short2ByteMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public byte get(short k)
Short2ByteFunctionget in interface Short2ByteFunctionk - the key.Function.get(Object)public short firstShortKey()
Short2ByteSortedMapfirstShortKey in interface Short2ByteSortedMapSortedMap.firstKey()public short lastShortKey()
Short2ByteSortedMaplastShortKey in interface Short2ByteSortedMapSortedMap.lastKey()public ObjectSortedSet<Short2ByteMap.Entry> short2ByteEntrySet()
Short2ByteSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
short2ByteEntrySet in interface Short2ByteMapshort2ByteEntrySet in interface Short2ByteSortedMapShort2ByteSortedMap.entrySet()public ShortSortedSet 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 Short2ByteMapkeySet in interface Short2ByteSortedMapkeySet in interface Map<Short,Byte>keySet in interface SortedMap<Short,Byte>keySet in class AbstractShort2ByteSortedMapMap.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 Short2ByteMapvalues in interface Short2ByteSortedMapvalues in interface Map<Short,Byte>values in interface SortedMap<Short,Byte>values in class AbstractShort2ByteSortedMapMap.values()public ShortComparator comparator()
Short2ByteSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Short2ByteSortedMapcomparator in interface SortedMap<Short,Byte>SortedMap.comparator()public Short2ByteSortedMap headMap(short to)
Short2ByteSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Short2ByteSortedMapSortedMap.headMap(Object)public Short2ByteSortedMap tailMap(short from)
Short2ByteSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Short2ByteSortedMapSortedMap.tailMap(Object)public Short2ByteSortedMap subMap(short from, short to)
Short2ByteSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Short2ByteSortedMapSortedMap.subMap(Object,Object)public Short2ByteAVLTreeMap 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.