Class Byte2ShortRBTreeMap
- java.lang.Object
-
- it.unimi.dsi.fastutil.bytes.AbstractByte2ShortFunction
-
- it.unimi.dsi.fastutil.bytes.AbstractByte2ShortMap
-
- it.unimi.dsi.fastutil.bytes.AbstractByte2ShortSortedMap
-
- it.unimi.dsi.fastutil.bytes.Byte2ShortRBTreeMap
-
- All Implemented Interfaces:
Byte2ShortFunction
,Byte2ShortMap
,Byte2ShortSortedMap
,Function<Byte,Short>
,Serializable
,Cloneable
,Function<Byte,Short>
,IntUnaryOperator
,Map<Byte,Short>
,SortedMap<Byte,Short>
public class Byte2ShortRBTreeMap extends AbstractByte2ShortSortedMap 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:
- Serialized Form
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ShortMap
AbstractByte2ShortMap.BasicEntry, AbstractByte2ShortMap.BasicEntrySet
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ShortMap
Byte2ShortMap.FastEntrySet
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ShortSortedMap
Byte2ShortSortedMap.FastSortedEntrySet
-
-
Constructor Summary
Constructors Constructor Description Byte2ShortRBTreeMap()
Creates a new empty tree map.Byte2ShortRBTreeMap(byte[] k, short[] v)
Creates a new tree map using the elements of two parallel arrays.Byte2ShortRBTreeMap(byte[] k, short[] v, Comparator<? super Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.Byte2ShortRBTreeMap(Byte2ShortMap m)
Creates a new tree map copying a given map.Byte2ShortRBTreeMap(Byte2ShortSortedMap m)
Creates a new tree map copying a given sorted map (and itsComparator
).Byte2ShortRBTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator.Byte2ShortRBTreeMap(Map<? extends Byte,? extends Short> m)
Creates a new tree map copying a given map.Byte2ShortRBTreeMap(SortedMap<Byte,Short> m)
Creates a new tree map copying a given sorted map (and itsComparator
).
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method 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).Byte2ShortRBTreeMap
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)
Returnstrue
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 thantoKey
.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 fromfromKey
, inclusive, totoKey
, exclusive.Byte2ShortSortedMap
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.ShortCollection
values()
Returns a type-specific collection view of the values contained in this map.-
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ShortMap
equals, hashCode, putAll, toString
-
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ShortFunction
defaultReturnValue, defaultReturnValue
-
Methods inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ShortFunction
applyAsInt
-
Methods inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ShortMap
compute, 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, replace
-
Methods inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ShortSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMap
-
Methods inherited from interface java.util.function.IntUnaryOperator
andThen, compose
-
Methods inherited from interface java.util.Map
containsKey, equals, forEach, get, hashCode, put, putAll, remove, replaceAll
-
-
-
-
Constructor Detail
-
Byte2ShortRBTreeMap
public Byte2ShortRBTreeMap()
Creates a new empty tree map.
-
Byte2ShortRBTreeMap
public Byte2ShortRBTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator.- Parameters:
c
- a (possibly type-specific) comparator.
-
Byte2ShortRBTreeMap
public Byte2ShortRBTreeMap(Map<? extends Byte,? extends Short> m)
Creates a new tree map copying a given map.- Parameters:
m
- aMap
to be copied into the new tree map.
-
Byte2ShortRBTreeMap
public Byte2ShortRBTreeMap(SortedMap<Byte,Short> m)
Creates a new tree map copying a given sorted map (and itsComparator
).- Parameters:
m
- aSortedMap
to be copied into the new tree map.
-
Byte2ShortRBTreeMap
public Byte2ShortRBTreeMap(Byte2ShortMap m)
Creates a new tree map copying a given map.- Parameters:
m
- a type-specific map to be copied into the new tree map.
-
Byte2ShortRBTreeMap
public Byte2ShortRBTreeMap(Byte2ShortSortedMap m)
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.
-
Byte2ShortRBTreeMap
public Byte2ShortRBTreeMap(byte[] k, short[] v, Comparator<? super Byte> c)
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.
-
Byte2ShortRBTreeMap
public Byte2ShortRBTreeMap(byte[] k, short[] 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
- ifk
andv
have different lengths.
-
-
Method Detail
-
addTo
public short addTo(byte k, short 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 short put(byte k, short v)
Description copied from interface:Byte2ShortFunction
Adds a pair to the map (optional operation).- Specified by:
put
in interfaceByte2ShortFunction
- 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:
Function.put(Object,Object)
-
remove
public short remove(byte k)
Description copied from interface:Byte2ShortFunction
Removes the mapping with the given key (optional operation).- Specified by:
remove
in interfaceByte2ShortFunction
- Parameters:
k
- the key.- Returns:
- the old value, or the default return value if no value was present for the given key.
- See Also:
Function.remove(Object)
-
containsValue
public boolean containsValue(short v)
Description copied from interface:Byte2ShortMap
Returnstrue
if this map maps one or more keys to the specified value.- Specified by:
containsValue
in interfaceByte2ShortMap
- Overrides:
containsValue
in classAbstractByte2ShortMap
- See Also:
Map.containsValue(Object)
-
clear
public void clear()
Description copied from interface:Byte2ShortMap
Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.
-
containsKey
public boolean containsKey(byte k)
Description copied from interface:Byte2ShortMap
Returns true if this function contains a mapping for the specified key.- Specified by:
containsKey
in interfaceByte2ShortFunction
- Specified by:
containsKey
in interfaceByte2ShortMap
- Overrides:
containsKey
in classAbstractByte2ShortMap
- Parameters:
k
- the key.- Returns:
- true if this function associates a value to
key
. - See Also:
Map.containsKey(Object)
-
size
public int size()
Description copied from interface:Byte2ShortMap
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
public short get(byte k)
Description copied from interface:Byte2ShortFunction
Returns the value to which the given key is mapped.- Specified by:
get
in interfaceByte2ShortFunction
- Parameters:
k
- the key.- Returns:
- the corresponding value, or the default return value if no value was present for the given key.
- See Also:
Function.get(Object)
-
firstByteKey
public byte firstByteKey()
Description copied from interface:Byte2ShortSortedMap
Returns the first (lowest) key currently in this map.- Specified by:
firstByteKey
in interfaceByte2ShortSortedMap
- See Also:
SortedMap.firstKey()
-
lastByteKey
public byte lastByteKey()
Description copied from interface:Byte2ShortSortedMap
Returns the last (highest) key currently in this map.- Specified by:
lastByteKey
in interfaceByte2ShortSortedMap
- See Also:
SortedMap.lastKey()
-
byte2ShortEntrySet
public ObjectSortedSet<Byte2ShortMap.Entry> byte2ShortEntrySet()
Description copied from interface:Byte2ShortSortedMap
Returns a type-specific sorted-set view of the mappings contained in this map.Note that this specification strengthens the one given in the corresponding type-specific unsorted map.
- Specified by:
byte2ShortEntrySet
in interfaceByte2ShortMap
- Specified by:
byte2ShortEntrySet
in interfaceByte2ShortSortedMap
- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
Byte2ShortSortedMap.entrySet()
-
keySet
public ByteSortedSet 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 interfaceByte2ShortMap
- Specified by:
keySet
in interfaceByte2ShortSortedMap
- Specified by:
keySet
in interfaceMap<Byte,Short>
- Specified by:
keySet
in interfaceSortedMap<Byte,Short>
- Overrides:
keySet
in classAbstractByte2ShortSortedMap
- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
Map.keySet()
-
values
public ShortCollection 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 interfaceByte2ShortMap
- Specified by:
values
in interfaceByte2ShortSortedMap
- Specified by:
values
in interfaceMap<Byte,Short>
- Specified by:
values
in interfaceSortedMap<Byte,Short>
- Overrides:
values
in classAbstractByte2ShortSortedMap
- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
Map.values()
-
comparator
public ByteComparator comparator()
Description copied from interface:Byte2ShortSortedMap
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.Note that this specification strengthens the one given in
SortedMap.comparator()
.- Specified by:
comparator
in interfaceByte2ShortSortedMap
- Specified by:
comparator
in interfaceSortedMap<Byte,Short>
- See Also:
SortedMap.comparator()
-
headMap
public Byte2ShortSortedMap headMap(byte to)
Description copied from interface:Byte2ShortSortedMap
Returns a view of the portion of this sorted map whose keys are strictly less thantoKey
.Note that this specification strengthens the one given in
SortedMap.headMap(Object)
.- Specified by:
headMap
in interfaceByte2ShortSortedMap
- See Also:
SortedMap.headMap(Object)
-
tailMap
public Byte2ShortSortedMap tailMap(byte from)
Description copied from interface:Byte2ShortSortedMap
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.Note that this specification strengthens the one given in
SortedMap.tailMap(Object)
.- Specified by:
tailMap
in interfaceByte2ShortSortedMap
- See Also:
SortedMap.tailMap(Object)
-
subMap
public Byte2ShortSortedMap subMap(byte from, byte to)
Description copied from interface:Byte2ShortSortedMap
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object)
.- Specified by:
subMap
in interfaceByte2ShortSortedMap
- See Also:
SortedMap.subMap(Object,Object)
-
clone
public Byte2ShortRBTreeMap 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.
-
-