Class Short2IntRBTreeMap
- All Implemented Interfaces:
Function<Short,,Integer> Short2IntFunction,Short2IntMap,Short2IntSortedMap,Serializable,Cloneable,Function<Short,,Integer> IntUnaryOperator,Map<Short,,Integer> SequencedMap<Short,,Integer> SortedMap<Short,Integer>
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.
- See Also:
-
Nested Class Summary
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2IntMap
AbstractShort2IntMap.BasicEntry, AbstractShort2IntMap.BasicEntrySetNested classes/interfaces inherited from interface it.unimi.dsi.fastutil.shorts.Short2IntMap
Short2IntMap.FastEntrySetNested classes/interfaces inherited from interface it.unimi.dsi.fastutil.shorts.Short2IntSortedMap
Short2IntSortedMap.FastSortedEntrySet -
Constructor Summary
ConstructorsConstructorDescriptionCreates a new empty tree map.Short2IntRBTreeMap(short[] k, int[] v) Creates a new tree map using the elements of two parallel arrays.Short2IntRBTreeMap(short[] k, int[] v, Comparator<? super Short> c) Creates a new tree map using the elements of two parallel arrays and the given comparator.Creates a new tree map copying a given map.Creates a new tree map copying a given sorted map (and itsComparator).Short2IntRBTreeMap(Comparator<? super Short> c) Creates a new empty tree map with the given comparator.Short2IntRBTreeMap(Map<? extends Short, ? extends Integer> m) Creates a new tree map copying a given map.Creates a new tree map copying a given sorted map (and itsComparator). -
Method Summary
Modifier and TypeMethodDescriptionintaddTo(short k, int incr) Adds an increment to value currently associated with a key.voidclear()Removes all associations from this function (optional operation).clone()Returns a deep copy of this tree map.Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.booleancontainsKey(short k) Returns true if this function contains a mapping for the specified key.booleancontainsValue(int v) Returnstrueif this map maps one or more keys to the specified value.shortReturns the first (lowest) key currently in this map.intget(short k) Returns the value to which the given key is mapped.headMap(short to) Returns a view of the portion of this sorted map whose keys are strictly less thantoKey.booleanisEmpty()keySet()Returns a type-specific sorted set view of the keys contained in this map.shortReturns the last (highest) key currently in this map.intput(short k, int v) Adds a pair to the map (optional operation).intremove(short k) Removes the mapping with the given key (optional operation).Returns a type-specific set view of the mappings contained in this map.intsize()Returns the intended number of keys in this function, or -1 if no such number exists.subMap(short from, short to) Returns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.tailMap(short from) Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey.values()Returns a type-specific collection view of the values contained in this map.Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2IntMap
equals, hashCode, mergeInt, putAll, toStringMethods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2IntFunction
defaultReturnValue, defaultReturnValueMethods inherited from interface java.util.function.IntUnaryOperator
andThen, composeMethods inherited from interface java.util.Map
containsKey, equals, get, getOrDefault, hashCode, put, putAll, remove, replaceAllMethods inherited from interface java.util.SequencedMap
firstEntry, lastEntry, pollFirstEntry, pollLastEntry, sequencedEntrySet, sequencedKeySet, sequencedValuesMethods inherited from interface it.unimi.dsi.fastutil.shorts.Short2IntFunction
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsInt, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShortMethods inherited from interface it.unimi.dsi.fastutil.shorts.Short2IntMap
compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, forEach, forEach, get, getOrDefault, getOrDefault, merge, merge, mergeInt, mergeInt, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
-
Constructor Details
-
Short2IntRBTreeMap
public Short2IntRBTreeMap()Creates a new empty tree map. -
Short2IntRBTreeMap
Creates a new empty tree map with the given comparator.- Parameters:
c- a (possibly type-specific) comparator.
-
Short2IntRBTreeMap
-
Short2IntRBTreeMap
Creates a new tree map copying a given sorted map (and itsComparator).- Parameters:
m- aSortedMapto be copied into the new tree map.
-
Short2IntRBTreeMap
Creates a new tree map copying a given map.- Parameters:
m- a type-specific map to be copied into the new tree map.
-
Short2IntRBTreeMap
Creates a new tree map copying a given sorted map (and itsComparator).- Parameters:
m- a type-specific sorted map to be copied into the new tree map.
-
Short2IntRBTreeMap
Creates a new tree map using the elements of two parallel arrays and the given comparator.- Parameters:
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.- Throws:
IllegalArgumentException- ifkandvhave different lengths.
-
Short2IntRBTreeMap
public Short2IntRBTreeMap(short[] k, int[] v) Creates a new tree map using the elements of two parallel arrays.- Parameters:
k- the array of keys of the new tree map.v- the array of corresponding values in the new tree map.- Throws:
IllegalArgumentException- ifkandvhave different lengths.
-
-
Method Details
-
addTo
public int addTo(short k, int incr) Adds an increment to value currently associated with a key.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.
- Parameters:
k- the key.incr- the increment.- Returns:
- the old value, or the default return value if no value was present for the given key.
-
put
public int put(short k, int v) Description copied from interface:Short2IntFunctionAdds a pair to the map (optional operation).- Specified by:
putin interfaceShort2IntFunction- Parameters:
k- the key.v- the value.- Returns:
- the old value, or the default return value if no value was present for the given key.
- See Also:
-
remove
public int remove(short k) Description copied from interface:Short2IntFunctionRemoves the mapping with the given key (optional operation).- Specified by:
removein interfaceShort2IntFunction- Parameters:
k- the key.- Returns:
- the old value, or the default return value if no value was present for the given key.
- See Also:
-
containsValue
public boolean containsValue(int v) Description copied from class:AbstractShort2IntMapReturnstrueif this map maps one or more keys to the specified value.- Specified by:
containsValuein interfaceShort2IntMap- Overrides:
containsValuein classAbstractShort2IntMap- See Also:
-
clear
-
containsKey
public boolean containsKey(short k) Description copied from class:AbstractShort2IntMapReturns true if this function contains a mapping for the specified key.Note that for some kind of functions (e.g., hashes) this method will always return true. In particular, this default implementation always returns true.
- Specified by:
containsKeyin interfaceShort2IntFunction- Specified by:
containsKeyin interfaceShort2IntMap- Overrides:
containsKeyin classAbstractShort2IntMap- Parameters:
k- the key.- Returns:
- true if this function associates a value to
key. - See Also:
-
size
public int size()Description copied from interface:FunctionReturns the intended number of keys in this function, or -1 if no such number exists.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. This default implementation, in particular, returns -1.
-
isEmpty
-
get
public int get(short k) Description copied from interface:Short2IntFunctionReturns the value to which the given key is mapped.- Specified by:
getin interfaceShort2IntFunction- Parameters:
k- the key.- Returns:
- the corresponding value, or the default return value if no value was present for the given key.
- See Also:
-
firstShortKey
public short firstShortKey()Description copied from interface:Short2IntSortedMapReturns the first (lowest) key currently in this map.- Specified by:
firstShortKeyin interfaceShort2IntSortedMap- See Also:
-
lastShortKey
public short lastShortKey()Description copied from interface:Short2IntSortedMapReturns the last (highest) key currently in this map.- Specified by:
lastShortKeyin interfaceShort2IntSortedMap- See Also:
-
short2IntEntrySet
Description copied from interface:Short2IntMapReturns a type-specific set view of the mappings contained in this map.This method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen
Map.entrySet()so that it returns anObjectSetof type-specific entries (the latter makes it possible to access keys and values with type-specific methods).- Specified by:
short2IntEntrySetin interfaceShort2IntMap- Specified by:
short2IntEntrySetin interfaceShort2IntSortedMap- Returns:
- a type-specific set view of the mappings contained in this map.
- See Also:
-
keySet
Returns a type-specific sorted set view of the keys contained in this map.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.- Specified by:
keySetin interfaceMap<Short,Integer> - Specified by:
keySetin interfaceShort2IntMap- Specified by:
keySetin interfaceShort2IntSortedMap- Specified by:
keySetin interfaceSortedMap<Short,Integer> - Overrides:
keySetin classAbstractShort2IntSortedMap- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
-
values
Returns a type-specific collection view of the values contained in this map.In addition to the semantics of
Map.values(), you can safely cast the collection returned by this call to a type-specific collection interface.- Specified by:
valuesin interfaceMap<Short,Integer> - Specified by:
valuesin interfaceShort2IntMap- Specified by:
valuesin interfaceShort2IntSortedMap- Specified by:
valuesin interfaceSortedMap<Short,Integer> - Overrides:
valuesin classAbstractShort2IntSortedMap- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
-
comparator
Description copied from interface:Short2IntSortedMapReturns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.- Specified by:
comparatorin interfaceShort2IntSortedMap- Specified by:
comparatorin interfaceSortedMap<Short,Integer> - See Also:
-
headMap
Description copied from interface:Short2IntSortedMapReturns a view of the portion of this sorted map whose keys are strictly less thantoKey.- Specified by:
headMapin interfaceShort2IntSortedMap- See Also:
-
tailMap
Description copied from interface:Short2IntSortedMapReturns a view of the portion of this sorted map whose keys are greater than or equal tofromKey.- Specified by:
tailMapin interfaceShort2IntSortedMap- See Also:
-
subMap
Description copied from interface:Short2IntSortedMapReturns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.- Specified by:
subMapin interfaceShort2IntSortedMap- See Also:
-
clone
Returns a deep copy of this tree map.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.
- Returns:
- a deep copy of this tree map.
-