Package it.unimi.dsi.fastutil.shorts
Class Short2ReferenceRBTreeMap<V>
java.lang.Object
it.unimi.dsi.fastutil.shorts.AbstractShort2ReferenceFunction<V>
it.unimi.dsi.fastutil.shorts.AbstractShort2ReferenceMap<V>
it.unimi.dsi.fastutil.shorts.AbstractShort2ReferenceSortedMap<V>
it.unimi.dsi.fastutil.shorts.Short2ReferenceRBTreeMap<V>
- All Implemented Interfaces:
Function<Short,
,V> Short2ReferenceFunction<V>
,Short2ReferenceMap<V>
,Short2ReferenceSortedMap<V>
,Serializable
,Cloneable
,Function<Short,
,V> IntFunction<V>
,Map<Short,
,V> SequencedMap<Short,
,V> SortedMap<Short,
V>
public class Short2ReferenceRBTreeMap<V>
extends AbstractShort2ReferenceSortedMap<V>
implements Serializable, Cloneable
A type-specific red-black tree map with a fast, small-footprint implementation.
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.AbstractShort2ReferenceMap
AbstractShort2ReferenceMap.BasicEntry<V>, AbstractShort2ReferenceMap.BasicEntrySet<V>
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.shorts.Short2ReferenceMap
Short2ReferenceMap.FastEntrySet<V>
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.shorts.Short2ReferenceSortedMap
Short2ReferenceSortedMap.FastSortedEntrySet<V>
-
Constructor Summary
ConstructorDescriptionCreates a new empty tree map.Short2ReferenceRBTreeMap
(short[] k, V[] v) Creates a new tree map using the elements of two parallel arrays.Short2ReferenceRBTreeMap
(short[] k, V[] v, Comparator<? super Short> c) Creates a new tree map using the elements of two parallel arrays and the given comparator.Short2ReferenceRBTreeMap
(Short2ReferenceMap<? extends V> m) Creates a new tree map copying a given map.Creates a new tree map copying a given sorted map (and itsComparator
).Short2ReferenceRBTreeMap
(Comparator<? super Short> c) Creates a new empty tree map with the given comparator.Short2ReferenceRBTreeMap
(Map<? extends Short, ? extends V> 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 TypeMethodDescriptionvoid
clear()
Removes all of the mappings from this map (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.boolean
containsKey
(short k) Returns true if this function contains a mapping for the specified key.boolean
short
Returns the first (lowest) key currently in this map.get
(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
.boolean
isEmpty()
keySet()
Returns a type-specific sorted set view of the keys contained in this map.short
Returns the last (highest) key currently in this map.Adds a pair to the map (optional operation).remove
(short k) Removes the mapping with the given key (optional operation).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.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.AbstractShort2ReferenceMap
equals, hashCode, putAll, toString
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2ReferenceFunction
defaultReturnValue, defaultReturnValue
Methods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, containsKey, equals, get, getOrDefault, hashCode, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll
Methods inherited from interface java.util.SequencedMap
firstEntry, lastEntry, pollFirstEntry, pollLastEntry, sequencedEntrySet, sequencedKeySet, sequencedValues
Methods inherited from interface it.unimi.dsi.fastutil.shorts.Short2ReferenceFunction
andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, apply, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
Methods inherited from interface it.unimi.dsi.fastutil.shorts.Short2ReferenceMap
compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace
-
Constructor Details
-
Short2ReferenceRBTreeMap
public Short2ReferenceRBTreeMap()Creates a new empty tree map. -
Short2ReferenceRBTreeMap
Creates a new empty tree map with the given comparator.- Parameters:
c
- a (possibly type-specific) comparator.
-
Short2ReferenceRBTreeMap
Creates a new tree map copying a given map.- Parameters:
m
- aMap
to be copied into the new tree map.
-
Short2ReferenceRBTreeMap
Creates a new tree map copying a given sorted map (and itsComparator
).- Parameters:
m
- aSortedMap
to be copied into the new tree map.
-
Short2ReferenceRBTreeMap
Creates a new tree map copying a given map.- Parameters:
m
- a type-specific map to be copied into the new tree map.
-
Short2ReferenceRBTreeMap
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.
-
Short2ReferenceRBTreeMap
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
- ifk
andv
have different lengths.
-
Short2ReferenceRBTreeMap
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
- ifk
andv
have different lengths.
-
-
Method Details
-
put
Description copied from interface:Short2ReferenceFunction
Adds a pair to the map (optional operation).- Specified by:
put
in interfaceShort2ReferenceFunction<V>
- 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
Description copied from interface:Short2ReferenceFunction
Removes the mapping with the given key (optional operation).- Specified by:
remove
in interfaceShort2ReferenceFunction<V>
- 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
Description copied from class:AbstractShort2ReferenceMap
- Specified by:
containsValue
in interfaceMap<Short,
V> - Overrides:
containsValue
in classAbstractShort2ReferenceMap<V>
-
clear
public void clear()Description copied from interface:Short2ReferenceMap
Removes all of the mappings from this map (optional operation). The map will be empty after this call returns. -
containsKey
public boolean containsKey(short k) Description copied from class:AbstractShort2ReferenceMap
Returns true if this function contains a mapping for the specified key.- Specified by:
containsKey
in interfaceShort2ReferenceFunction<V>
- Specified by:
containsKey
in interfaceShort2ReferenceMap<V>
- Overrides:
containsKey
in classAbstractShort2ReferenceMap<V>
- Parameters:
k
- the key.- Returns:
- true if this function associates a value to
key
. - See Also:
-
size
public int size()Description copied from interface:Short2ReferenceMap
Returns the number of key/value mappings in this map. If the map contains more thanInteger.MAX_VALUE
elements, returnsInteger.MAX_VALUE
. -
isEmpty
public boolean isEmpty() -
get
Description copied from interface:Short2ReferenceFunction
Returns the value to which the given key is mapped.- Specified by:
get
in interfaceShort2ReferenceFunction<V>
- 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:Short2ReferenceSortedMap
Returns the first (lowest) key currently in this map.- Specified by:
firstShortKey
in interfaceShort2ReferenceSortedMap<V>
- See Also:
-
lastShortKey
public short lastShortKey()Description copied from interface:Short2ReferenceSortedMap
Returns the last (highest) key currently in this map.- Specified by:
lastShortKey
in interfaceShort2ReferenceSortedMap<V>
- See Also:
-
short2ReferenceEntrySet
Description copied from interface:Short2ReferenceSortedMap
Returns a type-specific sorted-set view of the mappings contained in this map.- Specified by:
short2ReferenceEntrySet
in interfaceShort2ReferenceMap<V>
- Specified by:
short2ReferenceEntrySet
in interfaceShort2ReferenceSortedMap<V>
- Returns:
- a type-specific sorted-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:
keySet
in interfaceMap<Short,
V> - Specified by:
keySet
in interfaceShort2ReferenceMap<V>
- Specified by:
keySet
in interfaceShort2ReferenceSortedMap<V>
- Specified by:
keySet
in interfaceSortedMap<Short,
V> - Overrides:
keySet
in classAbstractShort2ReferenceSortedMap<V>
- 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:
values
in interfaceMap<Short,
V> - Specified by:
values
in interfaceShort2ReferenceMap<V>
- Specified by:
values
in interfaceShort2ReferenceSortedMap<V>
- Specified by:
values
in interfaceSortedMap<Short,
V> - Overrides:
values
in classAbstractShort2ReferenceSortedMap<V>
- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
-
comparator
Description copied from interface:Short2ReferenceSortedMap
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.- Specified by:
comparator
in interfaceShort2ReferenceSortedMap<V>
- Specified by:
comparator
in interfaceSortedMap<Short,
V> - See Also:
-
headMap
Description copied from interface:Short2ReferenceSortedMap
Returns a view of the portion of this sorted map whose keys are strictly less thantoKey
.- Specified by:
headMap
in interfaceShort2ReferenceSortedMap<V>
- See Also:
-
tailMap
Description copied from interface:Short2ReferenceSortedMap
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.- Specified by:
tailMap
in interfaceShort2ReferenceSortedMap<V>
- See Also:
-
subMap
Description copied from interface:Short2ReferenceSortedMap
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.- Specified by:
subMap
in interfaceShort2ReferenceSortedMap<V>
- 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.
-