Package it.unimi.dsi.fastutil.doubles

Class Double2ReferenceAVLTreeMap<V>

java.lang.Object

it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceFunction<V>

it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceMap<V>

it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceSortedMap<V>

it.unimi.dsi.fastutil.doubles.Double2ReferenceAVLTreeMap<V>

All Implemented Interfaces:

Double2ReferenceFunction<V>, Double2ReferenceMap<V>, Double2ReferenceSortedMap<V>, Function<Double,V>, Serializable, Cloneable, DoubleFunction<V>, Function<Double,V>, Map<Double,V>, SequencedMap<Double,V>, SortedMap<Double,V>

public class Double2ReferenceAVLTreeMap<V>
extends AbstractDouble2ReferenceSortedMap<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.doubles.AbstractDouble2ReferenceMap

AbstractDouble2ReferenceMap.BasicEntry<V>, AbstractDouble2ReferenceMap.BasicEntrySet<V>

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceMap

Double2ReferenceMap.FastEntrySet<V>

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceSortedMap

Double2ReferenceSortedMap.FastSortedEntrySet<V>

Constructor Summary

Constructors

Constructor	Description
Double2ReferenceAVLTreeMap()	Creates a new empty tree map.
Double2ReferenceAVLTreeMap(double[] k, V[] v)	Creates a new tree map using the elements of two parallel arrays.
Double2ReferenceAVLTreeMap(double[] k, V[] v, Comparator<? super Double> c)	Creates a new tree map using the elements of two parallel arrays and the given comparator.
Double2ReferenceAVLTreeMap(Double2ReferenceMap<? extends V> m)	Creates a new tree map copying a given map.
Double2ReferenceAVLTreeMap(Double2ReferenceSortedMap<V> m)	Creates a new tree map copying a given sorted map (and its Comparator).
Double2ReferenceAVLTreeMap(Comparator<? super Double> c)	Creates a new empty tree map with the given comparator.
Double2ReferenceAVLTreeMap(Map<? extends Double,? extends V> m)	Creates a new tree map copying a given map.
Double2ReferenceAVLTreeMap(SortedMap<Double,V> m)	Creates a new tree map copying a given sorted map (and its Comparator).

Method Summary

Modifier and Type	Method	Description
void	clear()	Removes all of the mappings from this map (optional operation).
Double2ReferenceAVLTreeMap<V>	clone()	Returns a deep copy of this tree map.
DoubleComparator	comparator()	Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
boolean	containsKey(double k)	Returns true if this function contains a mapping for the specified key.
boolean	containsValue(Object v)
ObjectSortedSet<Double2ReferenceMap.Entry<V>>	double2ReferenceEntrySet()	Returns a type-specific sorted-set view of the mappings contained in this map.
double	firstDoubleKey()	Returns the first (lowest) key currently in this map.
V	get(double k)	Returns the value to which the given key is mapped.
Double2ReferenceSortedMap<V>	headMap(double to)	Returns a view of the portion of this sorted map whose keys are strictly less than toKey.
boolean	isEmpty()
DoubleSortedSet	keySet()	Returns a type-specific sorted set view of the keys contained in this map.
double	lastDoubleKey()	Returns the last (highest) key currently in this map.
V	put(double k, V v)	Adds a pair to the map (optional operation).
V	remove(double k)	Removes the mapping with the given key (optional operation).
int	size()	Returns the number of key/value mappings in this map.
Double2ReferenceSortedMap<V>	subMap(double from, double to)	Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.
Double2ReferenceSortedMap<V>	tailMap(double 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.doubles.AbstractDouble2ReferenceMap

equals, hashCode, putAll, toString

Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceFunction

defaultReturnValue, defaultReturnValue

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceFunction

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.doubles.Double2ReferenceMap

compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace

Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceSortedMap

entrySet, firstKey, headMap, lastKey, subMap, tailMap

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

apply

Methods inherited from interface java.util.function.Function

andThen

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 java.util.SortedMap

putFirst, putLast, reversed

Constructor Details

Double2ReferenceAVLTreeMap

public Double2ReferenceAVLTreeMap()

Creates a new empty tree map.

Double2ReferenceAVLTreeMap

public Double2ReferenceAVLTreeMap(Comparator<? super Double> c)

Creates a new empty tree map with the given comparator.

Parameters:

c - a (possibly type-specific) comparator.

Double2ReferenceAVLTreeMap

public Double2ReferenceAVLTreeMap(Map<? extends Double,? extends V> m)

Creates a new tree map copying a given map.

Parameters:

m - a Map to be copied into the new tree map.

Double2ReferenceAVLTreeMap

public Double2ReferenceAVLTreeMap(SortedMap<Double,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.

Double2ReferenceAVLTreeMap

public Double2ReferenceAVLTreeMap(Double2ReferenceMap<? 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.

Double2ReferenceAVLTreeMap

public Double2ReferenceAVLTreeMap(Double2ReferenceSortedMap<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.

Double2ReferenceAVLTreeMap

public Double2ReferenceAVLTreeMap(double[] k,
 V[] v,
 Comparator<? super Double> 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.

Double2ReferenceAVLTreeMap

public Double2ReferenceAVLTreeMap(double[] 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 Details

put

public V put(double k,
 V v)

Description copied from interface: Double2ReferenceFunction

Adds a pair to the map (optional operation).

Specified by:

put in interface Double2ReferenceFunction<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(double k)

Description copied from interface: Double2ReferenceFunction

Removes the mapping with the given key (optional operation).

Specified by:

remove in interface Double2ReferenceFunction<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)

Description copied from class: AbstractDouble2ReferenceMap

Specified by:

containsValue in interface Map<Double,V>

Overrides:

containsValue in class AbstractDouble2ReferenceMap<V>

clear

public void clear()

Description copied from interface: Double2ReferenceMap

Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.

Specified by:

clear in interface Double2ReferenceMap<V>

Specified by:

clear in interface Function<Double,V>

Specified by:

clear in interface Map<Double,V>

See Also:

• Map.clear()

containsKey

public boolean containsKey(double k)

Description copied from class: AbstractDouble2ReferenceMap

Returns true if this function contains a mapping for the specified key.

Specified by:

containsKey in interface Double2ReferenceFunction<V>

Specified by:

containsKey in interface Double2ReferenceMap<V>

Overrides:

containsKey in class AbstractDouble2ReferenceMap<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: Double2ReferenceMap

Returns the number of key/value mappings in this map. If the map contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

Specified by:

size in interface Double2ReferenceMap<V>

Specified by:

size in interface Function<Double,V>

Specified by:

size in interface Map<Double,V>

Returns:

the number of key-value mappings in this map.

See Also:

• Size64

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map<Double,V>

Overrides:

isEmpty in class AbstractDouble2ReferenceMap<V>

get

public V get(double k)

Description copied from interface: Double2ReferenceFunction

Returns the value to which the given key is mapped.

Specified by:

get in interface Double2ReferenceFunction<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)

firstDoubleKey

public double firstDoubleKey()

Description copied from interface: Double2ReferenceSortedMap

Returns the first (lowest) key currently in this map.

Specified by:

firstDoubleKey in interface Double2ReferenceSortedMap<V>

See Also:

• SortedMap.firstKey()

lastDoubleKey

public double lastDoubleKey()

Description copied from interface: Double2ReferenceSortedMap

Returns the last (highest) key currently in this map.

Specified by:

lastDoubleKey in interface Double2ReferenceSortedMap<V>

See Also:

• SortedMap.lastKey()

double2ReferenceEntrySet

public ObjectSortedSet<Double2ReferenceMap.Entry<V>> double2ReferenceEntrySet()

Description copied from interface: Double2ReferenceSortedMap

Returns a type-specific sorted-set view of the mappings contained in this map.

Specified by:

double2ReferenceEntrySet in interface Double2ReferenceMap<V>

Specified by:

double2ReferenceEntrySet in interface Double2ReferenceSortedMap<V>

Returns:

a type-specific sorted-set view of the mappings contained in this map.

See Also:

• Double2ReferenceSortedMap.entrySet()

keySet

public DoubleSortedSet 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 Double2ReferenceMap<V>

Specified by:

keySet in interface Double2ReferenceSortedMap<V>

Specified by:

keySet in interface Map<Double,V>

Specified by:

keySet in interface SortedMap<Double,V>

Overrides:

keySet in class AbstractDouble2ReferenceSortedMap<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 Double2ReferenceMap<V>

Specified by:

values in interface Double2ReferenceSortedMap<V>

Specified by:

values in interface Map<Double,V>

Specified by:

values in interface SortedMap<Double,V>

Overrides:

values in class AbstractDouble2ReferenceSortedMap<V>

Returns:

a type-specific collection view of the values contained in this map.

See Also:

• Map.values()

comparator

public DoubleComparator comparator()

Description copied from interface: Double2ReferenceSortedMap

Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.

Specified by:

comparator in interface Double2ReferenceSortedMap<V>

Specified by:

comparator in interface SortedMap<Double,V>

See Also:

• SortedMap.comparator()

headMap

public Double2ReferenceSortedMap<V> headMap(double to)

Description copied from interface: Double2ReferenceSortedMap

Returns a view of the portion of this sorted map whose keys are strictly less than toKey.

Specified by:

headMap in interface Double2ReferenceSortedMap<V>

See Also:

• SortedMap.headMap(Object)

tailMap

public Double2ReferenceSortedMap<V> tailMap(double from)

Description copied from interface: Double2ReferenceSortedMap

Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey.

Specified by:

tailMap in interface Double2ReferenceSortedMap<V>

See Also:

• SortedMap.tailMap(Object)

subMap

public Double2ReferenceSortedMap<V> subMap(double from,
 double to)

Description copied from interface: Double2ReferenceSortedMap

Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.

Specified by:

subMap in interface Double2ReferenceSortedMap<V>

See Also:

• SortedMap.subMap(Object,Object)

clone

public Double2ReferenceAVLTreeMap<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.