public class Short2LongRBTreeMap extends AbstractShort2LongSortedMap 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.
AbstractShort2LongSortedMap.KeySetIterator, AbstractShort2LongSortedMap.ValuesCollection, AbstractShort2LongSortedMap.ValuesIteratorAbstractShort2LongMap.BasicEntry, AbstractShort2LongMap.BasicEntrySetShort2LongSortedMap.FastSortedEntrySetShort2LongMap.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<Short2LongMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.shorts.Short2LongRBTreeMap.Entry |
firstEntry
The first key in this map.
|
protected ShortSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.shorts.Short2LongRBTreeMap.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.Short2LongRBTreeMap.Entry |
tree
A reference to the root entry.
|
protected LongCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Short2LongRBTreeMap()
Creates a new empty tree map.
|
Short2LongRBTreeMap(Comparator<? super Short> c)
Creates a new empty tree map with the given comparator.
|
Short2LongRBTreeMap(Map<? extends Short,? extends Long> m)
Creates a new tree map copying a given map.
|
Short2LongRBTreeMap(short[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Short2LongRBTreeMap(short[] k,
long[] v,
Comparator<? super Short> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Short2LongRBTreeMap(Short2LongMap m)
Creates a new tree map copying a given map.
|
Short2LongRBTreeMap(Short2LongSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Short2LongRBTreeMap(SortedMap<Short,Long> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
long |
addTo(short k,
long incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Short2LongRBTreeMap |
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(long 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.
|
long |
get(short k)
Returns the value to which the given key is mapped.
|
Short2LongSortedMap |
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.
|
long |
put(short k,
long v)
Adds a pair to the map (optional operation).
|
long |
remove(short k)
Removes the mapping with the given key (optional operation).
|
ObjectSortedSet<Short2LongMap.Entry> |
short2LongEntrySet()
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.
|
Short2LongSortedMap |
subMap(short from,
short to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Short2LongSortedMap |
tailMap(short from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
LongCollection |
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, replaceapplyAsLongprotected transient it.unimi.dsi.fastutil.shorts.Short2LongRBTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.shorts.Short2LongRBTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.shorts.Short2LongRBTreeMap.Entry lastEntry
protected transient ObjectSortedSet<Short2LongMap.Entry> entries
protected transient ShortSortedSet keys
protected transient LongCollection 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 Short2LongRBTreeMap()
public Short2LongRBTreeMap(Comparator<? super Short> c)
c - a (possibly type-specific) comparator.public Short2LongRBTreeMap(Map<? extends Short,? extends Long> m)
m - a Map to be copied into the new tree map.public Short2LongRBTreeMap(SortedMap<Short,Long> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Short2LongRBTreeMap(Short2LongMap m)
m - a type-specific map to be copied into the new tree map.public Short2LongRBTreeMap(Short2LongSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Short2LongRBTreeMap(short[] k,
long[] 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 Short2LongRBTreeMap(short[] k,
long[] 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 long addTo(short k,
long 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 long put(short k,
long v)
Short2LongFunctionput in interface Short2LongFunctionk - the key.v - the value.Function.put(Object,Object)public long remove(short k)
Short2LongFunctionremove in interface Short2LongFunctionk - the key.Function.remove(Object)public boolean containsValue(long v)
Short2LongMaptrue if this map maps one or more keys to the specified value.containsValue in interface Short2LongMapcontainsValue in class AbstractShort2LongMapMap.containsValue(Object)public void clear()
Short2LongMapclear in interface Short2LongMapclear in interface Map<Short,Long>Map.clear()public boolean containsKey(short k)
Short2LongMapcontainsKey in interface Short2LongFunctioncontainsKey in interface Short2LongMapcontainsKey in class AbstractShort2LongMapk - the key.key.Map.containsKey(Object)public int size()
Short2LongMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public long get(short k)
Short2LongFunctionget in interface Short2LongFunctionk - the key.Function.get(Object)public short firstShortKey()
Short2LongSortedMapfirstShortKey in interface Short2LongSortedMapSortedMap.firstKey()public short lastShortKey()
Short2LongSortedMaplastShortKey in interface Short2LongSortedMapSortedMap.lastKey()public ObjectSortedSet<Short2LongMap.Entry> short2LongEntrySet()
Short2LongSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
short2LongEntrySet in interface Short2LongMapshort2LongEntrySet in interface Short2LongSortedMapShort2LongSortedMap.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 Short2LongMapkeySet in interface Short2LongSortedMapkeySet in interface Map<Short,Long>keySet in interface SortedMap<Short,Long>keySet in class AbstractShort2LongSortedMapMap.keySet()public LongCollection 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 Short2LongMapvalues in interface Short2LongSortedMapvalues in interface Map<Short,Long>values in interface SortedMap<Short,Long>values in class AbstractShort2LongSortedMapMap.values()public ShortComparator comparator()
Short2LongSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Short2LongSortedMapcomparator in interface SortedMap<Short,Long>SortedMap.comparator()public Short2LongSortedMap headMap(short to)
Short2LongSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Short2LongSortedMapSortedMap.headMap(Object)public Short2LongSortedMap tailMap(short from)
Short2LongSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Short2LongSortedMapSortedMap.tailMap(Object)public Short2LongSortedMap subMap(short from, short to)
Short2LongSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Short2LongSortedMapSortedMap.subMap(Object,Object)public Short2LongRBTreeMap 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.