it.unimi.dsi.fastutil.bytes

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, 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>

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ReferenceSortedMap

Byte2ReferenceSortedMap.FastSortedEntrySet<V>

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ReferenceMap

Byte2ReferenceMap.FastEntrySet<V>

Constructor Summary

Constructors

Constructor and 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 its Comparator).
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 its Comparator).

Method Summary

Modifier and Type	Method and Description
ObjectSortedSet<Byte2ReferenceMap.Entry<V>>	byte2ReferenceEntrySet() Returns a type-specific sorted-set view of the mappings contained in this map.
void	clear() Removes all associations from this function (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) Checks whether the given value is contained in AbstractByte2ReferenceMap.keySet().
boolean	containsValue(Object v) Checks whether the given value is contained in AbstractByte2ReferenceMap.values().
byte	firstByteKey()
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 than toKey.
boolean	isEmpty()
ByteSortedSet	keySet() Returns a type-specific sorted set view of the keys contained in this map.
byte	lastByteKey()
V	put(byte k, V v) Adds a pair to the map.
V	put(Byte ok, V ov) Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
V	remove(byte k) Removes the mapping with the given key.
V	remove(Object ok) Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
int	size() Returns the intended number of keys in this function, or -1 if no such number exists.
Byte2ReferenceSortedMap<V>	subMap(byte from, byte to) Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.
Byte2ReferenceSortedMap<V>	tailMap(byte from) Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey.
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.AbstractByte2ReferenceSortedMap

entrySet, firstKey, headMap, lastKey, subMap, tailMap

Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceMap

equals, hashCode, putAll, toString

Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceFunction

containsKey, defaultReturnValue, defaultReturnValue, get

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ReferenceFunction

defaultReturnValue, defaultReturnValue

Methods inherited from interface it.unimi.dsi.fastutil.Function

containsKey, get

Methods inherited from interface java.util.Map

compute, computeIfAbsent, computeIfPresent, containsKey, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, 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 - a Map to 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 its Comparator).

Parameters:

m - a SortedMap 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 its Comparator).

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 - if k and v 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:

IllegalArgumentException - if k and v have different lengths.

Method Detail

put

public V put(byte k,
             V v)

Description copied from interface: Byte2ReferenceFunction

Adds a pair to the map.

Specified by:

put in interface Byte2ReferenceFunction<V>

Overrides:

put in class AbstractByte2ReferenceFunction<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.

Specified by:

remove in interface Byte2ReferenceFunction<V>

Overrides:

remove in class AbstractByte2ReferenceFunction<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)

put

public V put(Byte ok,
             V ov)

Description copied from class: AbstractByte2ReferenceFunction

Delegates to the corresponding type-specific method, taking care of returning null on a missing key.

This method must check whether the provided key is in the map using containsKey(). Thus, it probes the map twice. Implementors of subclasses should override it with a more efficient method.

Specified by:

put in interface Function<Byte,V>

Specified by:

put in interface Map<Byte,V>

Overrides:

put in class AbstractByte2ReferenceFunction<V>

Parameters:

ok - the key.

ov - the value.

Returns:

the old value, or null if no value was present for the given key.

See Also:

Map.put(Object,Object)

remove

public V remove(Object ok)

Description copied from class: AbstractByte2ReferenceFunction

Delegates to the corresponding type-specific method, taking care of returning null on a missing key.

This method must check whether the provided key is in the map using containsKey(). Thus, it probes the map twice. Implementors of subclasses should override it with a more efficient method.

Specified by:

remove in interface Function<Byte,V>

Specified by:

remove in interface Map<Byte,V>

Overrides:

remove in class AbstractByte2ReferenceFunction<V>

Parameters:

ok - the key.

Returns:

the old value, or null if no value was present for the given key.

See Also:

Map.remove(Object)

containsValue

public boolean containsValue(Object v)

Description copied from class: AbstractByte2ReferenceMap

Checks whether the given value is contained in AbstractByte2ReferenceMap.values().

Specified by:

containsValue in interface Map<Byte,V>

Overrides:

containsValue in class AbstractByte2ReferenceMap<V>

clear

public void clear()

Description copied from interface: Function

Removes all associations from this function (optional operation).

Specified by:

clear in interface Function<Byte,V>

Specified by:

clear in interface Map<Byte,V>

Overrides:

clear in class AbstractByte2ReferenceFunction<V>

See Also:

Map.clear()

containsKey

public boolean containsKey(byte k)

Description copied from class: AbstractByte2ReferenceMap

Checks whether the given value is contained in AbstractByte2ReferenceMap.keySet().

Specified by:

containsKey in interface Byte2ReferenceFunction<V>

Overrides:

containsKey in class AbstractByte2ReferenceMap<V>

See Also:

Function.containsKey(Object)

size

public int size()

Description copied from interface: Function

Returns 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.

Specified by:

size in interface Function<Byte,V>

Specified by:

size in interface Map<Byte,V>

Returns:

the intended number of keys in this function, or -1 if that number is not available.

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map<Byte,V>

Overrides:

isEmpty in class AbstractByte2ReferenceMap<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 interface Byte2ReferenceFunction<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()

Specified by:

firstByteKey in interface Byte2ReferenceSortedMap<V>

See Also:

SortedMap.firstKey()

lastByteKey

public byte lastByteKey()

Specified by:

lastByteKey in interface Byte2ReferenceSortedMap<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 interface Byte2ReferenceMap<V>

Specified by:

byte2ReferenceEntrySet in interface Byte2ReferenceSortedMap<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 interface Byte2ReferenceMap<V>

Specified by:

keySet in interface Byte2ReferenceSortedMap<V>

Specified by:

keySet in interface Map<Byte,V>

Specified by:

keySet in interface SortedMap<Byte,V>

Overrides:

keySet in class AbstractByte2ReferenceSortedMap<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 interface Byte2ReferenceMap<V>

Specified by:

values in interface Byte2ReferenceSortedMap<V>

Specified by:

values in interface Map<Byte,V>

Specified by:

values in interface SortedMap<Byte,V>

Overrides:

values in class AbstractByte2ReferenceSortedMap<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 interface Byte2ReferenceSortedMap<V>

Specified by:

comparator in interface SortedMap<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 than toKey.

Specified by:

headMap in interface Byte2ReferenceSortedMap<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 to fromKey.

Specified by:

tailMap in interface Byte2ReferenceSortedMap<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 from fromKey, inclusive, to toKey, exclusive.

Specified by:

subMap in interface Byte2ReferenceSortedMap<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.

Overrides:

clone in class Object

Returns:

a deep copy of this tree map.