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<Byte,V>,Serializable,Cloneable,Function<Byte,V>,IntFunction<V>,Map<Byte,V>,SortedMap<Byte,V>
public class Byte2ReferenceAVLTreeMap<V> extends AbstractByte2ReferenceSortedMap<V> implements Serializable, 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, Comparator<? super 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(Comparator<? super Byte> c)Creates a new empty tree map with the given comparator.Byte2ReferenceAVLTreeMap(Map<? extends Byte,? extends V> m)Creates a new tree map copying a given map.Byte2ReferenceAVLTreeMap(SortedMap<Byte,V> m)Creates a new tree map copying a given sorted map (and itsComparator).
-
Method Summary
Modifier and Type Method Description ObjectSortedSet<Byte2ReferenceMap.Entry<V>>byte2ReferenceEntrySet()Returns a type-specific sorted-set view of the mappings contained in this map.voidclear()Removes all of the mappings from this map (optional operation).Byte2ReferenceAVLTreeMap<V>clone()Returns a deep copy of this tree map.ByteComparatorcomparator()Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.booleancontainsKey(byte k)Returns true if this function contains a mapping for the specified key.booleancontainsValue(Object v)bytefirstByteKey()Returns the first (lowest) key currently in this map.Vget(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.booleanisEmpty()ByteSortedSetkeySet()Returns a type-specific sorted set view of the keys contained in this map.bytelastByteKey()Returns the last (highest) key currently in this map.Vput(byte k, V v)Adds a pair to the map (optional operation).Vremove(byte k)Removes the mapping with the given key (optional operation).intsize()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
-
Methods inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ReferenceSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMap
-
Methods inherited from interface java.util.Map
containsKey, equals, forEach, get, hashCode, put, putAll, remove, replaceAll
-
-
-
-
Constructor Detail
-
Byte2ReferenceAVLTreeMap
public Byte2ReferenceAVLTreeMap()
Creates a new empty tree map.
-
Byte2ReferenceAVLTreeMap
public Byte2ReferenceAVLTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator.- Parameters:
c- a (possibly type-specific) comparator.
-
Byte2ReferenceAVLTreeMap
public Byte2ReferenceAVLTreeMap(Map<? extends Byte,? extends V> m)
Creates a new tree map copying a given map.- Parameters:
m- aMapto be copied into the new tree map.
-
Byte2ReferenceAVLTreeMap
public Byte2ReferenceAVLTreeMap(SortedMap<Byte,V> m)
Creates a new tree map copying a given sorted map (and itsComparator).- Parameters:
m- aSortedMapto 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, 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- ifkandvhave 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:
IllegalArgumentException- ifkandvhave different lengths.
-
-
Method Detail
-
put
public V put(byte k, V v)
Description copied from interface:Byte2ReferenceFunctionAdds a pair to the map (optional operation).- Specified by:
putin 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:Byte2ReferenceFunctionRemoves the mapping with the given key (optional operation).- Specified by:
removein 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(Object v)
- Specified by:
containsValuein interfaceMap<Byte,V>- Overrides:
containsValuein classAbstractByte2ReferenceMap<V>
-
clear
public void clear()
Description copied from interface:Byte2ReferenceMapRemoves 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:Byte2ReferenceMapReturns true if this function contains a mapping for the specified key.- Specified by:
containsKeyin interfaceByte2ReferenceFunction<V>- Specified by:
containsKeyin interfaceByte2ReferenceMap<V>- Overrides:
containsKeyin 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:Byte2ReferenceMapReturns the number of key/value mappings in this map. If the map contains more thanInteger.MAX_VALUEelements, returnsInteger.MAX_VALUE.
-
isEmpty
public boolean isEmpty()
-
get
public V get(byte k)
Description copied from interface:Byte2ReferenceFunctionReturns the value to which the given key is mapped.- Specified by:
getin 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:Byte2ReferenceSortedMapReturns the first (lowest) key currently in this map.- Specified by:
firstByteKeyin interfaceByte2ReferenceSortedMap<V>- See Also:
SortedMap.firstKey()
-
lastByteKey
public byte lastByteKey()
Description copied from interface:Byte2ReferenceSortedMapReturns the last (highest) key currently in this map.- Specified by:
lastByteKeyin interfaceByte2ReferenceSortedMap<V>- See Also:
SortedMap.lastKey()
-
byte2ReferenceEntrySet
public ObjectSortedSet<Byte2ReferenceMap.Entry<V>> byte2ReferenceEntrySet()
Description copied from interface:Byte2ReferenceSortedMapReturns 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:
byte2ReferenceEntrySetin interfaceByte2ReferenceMap<V>- Specified by:
byte2ReferenceEntrySetin 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:
keySetin interfaceByte2ReferenceMap<V>- Specified by:
keySetin interfaceByte2ReferenceSortedMap<V>- Specified by:
keySetin interfaceMap<Byte,V>- Specified by:
keySetin interfaceSortedMap<Byte,V>- Overrides:
keySetin 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:
valuesin interfaceByte2ReferenceMap<V>- Specified by:
valuesin interfaceByte2ReferenceSortedMap<V>- Specified by:
valuesin interfaceMap<Byte,V>- Specified by:
valuesin interfaceSortedMap<Byte,V>- Overrides:
valuesin 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:Byte2ReferenceSortedMapReturns 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:
comparatorin interfaceByte2ReferenceSortedMap<V>- Specified by:
comparatorin interfaceSortedMap<Byte,V>- See Also:
SortedMap.comparator()
-
headMap
public Byte2ReferenceSortedMap<V> headMap(byte to)
Description copied from interface:Byte2ReferenceSortedMapReturns 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:
headMapin interfaceByte2ReferenceSortedMap<V>- See Also:
SortedMap.headMap(Object)
-
tailMap
public Byte2ReferenceSortedMap<V> tailMap(byte from)
Description copied from interface:Byte2ReferenceSortedMapReturns 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:
tailMapin interfaceByte2ReferenceSortedMap<V>- See Also:
SortedMap.tailMap(Object)
-
subMap
public Byte2ReferenceSortedMap<V> subMap(byte from, byte to)
Description copied from interface:Byte2ReferenceSortedMapReturns 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:
subMapin 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.
-
-