Class Byte2ReferenceAVLTreeMap<V>
- java.lang.Object
-
- it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceFunction<V>
-
- it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceMap<V>
-
- it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceSortedMap<V>
-
- it.unimi.dsi.fastutil.bytes.Byte2ReferenceAVLTreeMap<V>
-
- All Implemented Interfaces:
Byte2ReferenceFunction<V>
,Byte2ReferenceMap<V>
,Byte2ReferenceSortedMap<V>
,Function<java.lang.Byte,V>
,java.io.Serializable
,java.lang.Cloneable
,java.util.function.Function<java.lang.Byte,V>
,java.util.function.IntFunction<V>
,java.util.Map<java.lang.Byte,V>
,java.util.SortedMap<java.lang.Byte,V>
public class Byte2ReferenceAVLTreeMap<V> extends AbstractByte2ReferenceSortedMap<V> implements java.io.Serializable, java.lang.Cloneable
A type-specific AVL 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.AbstractByte2ReferenceMap
AbstractByte2ReferenceMap.BasicEntry<V>, AbstractByte2ReferenceMap.BasicEntrySet<V>
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ReferenceMap
Byte2ReferenceMap.FastEntrySet<V>
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ReferenceSortedMap
Byte2ReferenceSortedMap.FastSortedEntrySet<V>
-
-
Constructor Summary
Constructors Constructor Description Byte2ReferenceAVLTreeMap()
Creates a new empty tree map.Byte2ReferenceAVLTreeMap(byte[] k, V[] v)
Creates a new tree map using the elements of two parallel arrays.Byte2ReferenceAVLTreeMap(byte[] k, V[] v, java.util.Comparator<? super java.lang.Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.Byte2ReferenceAVLTreeMap(Byte2ReferenceMap<? extends V> m)
Creates a new tree map copying a given map.Byte2ReferenceAVLTreeMap(Byte2ReferenceSortedMap<V> m)
Creates a new tree map copying a given sorted map (and itsComparator
).Byte2ReferenceAVLTreeMap(java.util.Comparator<? super java.lang.Byte> c)
Creates a new empty tree map with the given comparator.Byte2ReferenceAVLTreeMap(java.util.Map<? extends java.lang.Byte,? extends V> m)
Creates a new tree map copying a given map.Byte2ReferenceAVLTreeMap(java.util.SortedMap<java.lang.Byte,V> 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 ObjectSortedSet<Byte2ReferenceMap.Entry<V>>
byte2ReferenceEntrySet()
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).Byte2ReferenceAVLTreeMap<V>
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(java.lang.Object v)
byte
firstByteKey()
Returns the first (lowest) key currently in this map.V
get(byte k)
Returns the value to which the given key is mapped.Byte2ReferenceSortedMap<V>
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.V
put(byte k, V v)
Adds a pair to the map (optional operation).V
remove(byte k)
Removes the mapping with the given key (optional operation).int
size()
Returns the number of key/value mappings in this map.Byte2ReferenceSortedMap<V>
subMap(byte from, byte to)
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.Byte2ReferenceSortedMap<V>
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.ReferenceCollection<V>
values()
Returns a type-specific collection view of the values contained in this map.-
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceMap
equals, hashCode, putAll, toString
-
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceFunction
defaultReturnValue, defaultReturnValue
-
Methods inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ReferenceFunction
apply
-
Methods inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ReferenceMap
compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
-
-
-
-
Constructor Detail
-
Byte2ReferenceAVLTreeMap
public Byte2ReferenceAVLTreeMap()
Creates a new empty tree map.
-
Byte2ReferenceAVLTreeMap
public Byte2ReferenceAVLTreeMap(java.util.Comparator<? super java.lang.Byte> c)
Creates a new empty tree map with the given comparator.- Parameters:
c
- a (possibly type-specific) comparator.
-
Byte2ReferenceAVLTreeMap
public Byte2ReferenceAVLTreeMap(java.util.Map<? extends java.lang.Byte,? extends V> m)
Creates a new tree map copying a given map.- Parameters:
m
- aMap
to be copied into the new tree map.
-
Byte2ReferenceAVLTreeMap
public Byte2ReferenceAVLTreeMap(java.util.SortedMap<java.lang.Byte,V> m)
Creates a new tree map copying a given sorted map (and itsComparator
).- Parameters:
m
- aSortedMap
to be copied into the new tree map.
-
Byte2ReferenceAVLTreeMap
public Byte2ReferenceAVLTreeMap(Byte2ReferenceMap<? extends V> m)
Creates a new tree map copying a given map.- Parameters:
m
- a type-specific map to be copied into the new tree map.
-
Byte2ReferenceAVLTreeMap
public Byte2ReferenceAVLTreeMap(Byte2ReferenceSortedMap<V> 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.
-
Byte2ReferenceAVLTreeMap
public Byte2ReferenceAVLTreeMap(byte[] k, V[] v, java.util.Comparator<? super java.lang.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:
java.lang.IllegalArgumentException
- ifk
andv
have different lengths.
-
Byte2ReferenceAVLTreeMap
public Byte2ReferenceAVLTreeMap(byte[] k, V[] 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:
java.lang.IllegalArgumentException
- ifk
andv
have different lengths.
-
-
Method Detail
-
put
public V put(byte k, V v)
Description copied from interface:Byte2ReferenceFunction
Adds a pair to the map (optional operation).- Specified by:
put
in interfaceByte2ReferenceFunction<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:
Function.put(Object,Object)
-
remove
public V remove(byte k)
Description copied from interface:Byte2ReferenceFunction
Removes the mapping with the given key (optional operation).- Specified by:
remove
in interfaceByte2ReferenceFunction<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:
Function.remove(Object)
-
containsValue
public boolean containsValue(java.lang.Object v)
- Specified by:
containsValue
in interfacejava.util.Map<java.lang.Byte,V>
- Overrides:
containsValue
in classAbstractByte2ReferenceMap<V>
-
clear
public void clear()
Description copied from interface:Byte2ReferenceMap
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:Byte2ReferenceMap
Returns true if this function contains a mapping for the specified key.- Specified by:
containsKey
in interfaceByte2ReferenceFunction<V>
- Specified by:
containsKey
in interfaceByte2ReferenceMap<V>
- Overrides:
containsKey
in classAbstractByte2ReferenceMap<V>
- 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:Byte2ReferenceMap
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()
- Specified by:
isEmpty
in interfacejava.util.Map<java.lang.Byte,V>
- Overrides:
isEmpty
in classAbstractByte2ReferenceMap<V>
-
get
public V get(byte k)
Description copied from interface:Byte2ReferenceFunction
Returns the value to which the given key is mapped.- Specified by:
get
in interfaceByte2ReferenceFunction<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:
Function.get(Object)
-
firstByteKey
public byte firstByteKey()
Description copied from interface:Byte2ReferenceSortedMap
Returns the first (lowest) key currently in this map.- Specified by:
firstByteKey
in interfaceByte2ReferenceSortedMap<V>
- See Also:
SortedMap.firstKey()
-
lastByteKey
public byte lastByteKey()
Description copied from interface:Byte2ReferenceSortedMap
Returns the last (highest) key currently in this map.- Specified by:
lastByteKey
in interfaceByte2ReferenceSortedMap<V>
- See Also:
SortedMap.lastKey()
-
byte2ReferenceEntrySet
public ObjectSortedSet<Byte2ReferenceMap.Entry<V>> byte2ReferenceEntrySet()
Description copied from interface:Byte2ReferenceSortedMap
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:
byte2ReferenceEntrySet
in interfaceByte2ReferenceMap<V>
- Specified by:
byte2ReferenceEntrySet
in interfaceByte2ReferenceSortedMap<V>
- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
Byte2ReferenceSortedMap.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 interfaceByte2ReferenceMap<V>
- Specified by:
keySet
in interfaceByte2ReferenceSortedMap<V>
- Specified by:
keySet
in interfacejava.util.Map<java.lang.Byte,V>
- Specified by:
keySet
in interfacejava.util.SortedMap<java.lang.Byte,V>
- Overrides:
keySet
in classAbstractByte2ReferenceSortedMap<V>
- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
Map.keySet()
-
values
public ReferenceCollection<V> 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 interfaceByte2ReferenceMap<V>
- Specified by:
values
in interfaceByte2ReferenceSortedMap<V>
- Specified by:
values
in interfacejava.util.Map<java.lang.Byte,V>
- Specified by:
values
in interfacejava.util.SortedMap<java.lang.Byte,V>
- Overrides:
values
in classAbstractByte2ReferenceSortedMap<V>
- 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:Byte2ReferenceSortedMap
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 interfaceByte2ReferenceSortedMap<V>
- Specified by:
comparator
in interfacejava.util.SortedMap<java.lang.Byte,V>
- See Also:
SortedMap.comparator()
-
headMap
public Byte2ReferenceSortedMap<V> headMap(byte to)
Description copied from interface:Byte2ReferenceSortedMap
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 interfaceByte2ReferenceSortedMap<V>
- See Also:
SortedMap.headMap(Object)
-
tailMap
public Byte2ReferenceSortedMap<V> tailMap(byte from)
Description copied from interface:Byte2ReferenceSortedMap
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 interfaceByte2ReferenceSortedMap<V>
- See Also:
SortedMap.tailMap(Object)
-
subMap
public Byte2ReferenceSortedMap<V> subMap(byte from, byte to)
Description copied from interface:Byte2ReferenceSortedMap
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 interfaceByte2ReferenceSortedMap<V>
- See Also:
SortedMap.subMap(Object,Object)
-
clone
public Byte2ReferenceAVLTreeMap<V> 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.
-
-