Class Double2BooleanAVLTreeMap
- All Implemented Interfaces:
Double2BooleanFunction,Double2BooleanMap,Double2BooleanSortedMap,Function<Double,,Boolean> Serializable,Cloneable,DoublePredicate,Function<Double,,Boolean> Map<Double,,Boolean> SequencedMap<Double,,Boolean> SortedMap<Double,Boolean>
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:
-
Nested Class Summary
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2BooleanMap
AbstractDouble2BooleanMap.BasicEntry, AbstractDouble2BooleanMap.BasicEntrySetNested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2BooleanMap
Double2BooleanMap.FastEntrySetNested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2BooleanSortedMap
Double2BooleanSortedMap.FastSortedEntrySet -
Constructor Summary
ConstructorsConstructorDescriptionCreates a new empty tree map.Double2BooleanAVLTreeMap(double[] k, boolean[] v) Creates a new tree map using the elements of two parallel arrays.Double2BooleanAVLTreeMap(double[] k, boolean[] v, Comparator<? super Double> c) Creates a new tree map using the elements of two parallel arrays and the given comparator.Creates a new tree map copying a given map.Creates a new tree map copying a given sorted map (and itsComparator).Double2BooleanAVLTreeMap(Comparator<? super Double> c) Creates a new empty tree map with the given comparator.Double2BooleanAVLTreeMap(Map<? extends Double, ? extends Boolean> m) Creates a new tree map copying a given map.Creates a new tree map copying a given sorted map (and itsComparator). -
Method Summary
Modifier and TypeMethodDescriptionvoidclear()Removes all associations from this function (optional operation).clone()Returns a deep copy of this tree map.Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.booleancontainsKey(double k) Returns true if this function contains a mapping for the specified key.booleancontainsValue(boolean v) Returnstrueif this map maps one or more keys to the specified value.Returns a type-specific set view of the mappings contained in this map.doubleReturns the first (lowest) key currently in this map.booleanget(double k) Returns the value to which the given key is mapped.headMap(double to) Returns a view of the portion of this sorted map whose keys are strictly less thantoKey.booleanisEmpty()keySet()Returns a type-specific sorted set view of the keys contained in this map.doubleReturns the last (highest) key currently in this map.booleanput(double k, boolean v) Adds a pair to the map (optional operation).booleanremove(double k) Removes the mapping with the given key (optional operation).intsize()Returns the intended number of keys in this function, or -1 if no such number exists.subMap(double from, double to) Returns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.tailMap(double from) Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey.values()Returns a type-specific collection view of the values contained in this map.Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2BooleanMap
equals, hashCode, putAll, toStringMethods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2BooleanFunction
defaultReturnValue, defaultReturnValueMethods inherited from interface it.unimi.dsi.fastutil.doubles.Double2BooleanFunction
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort, testMethods inherited from interface it.unimi.dsi.fastutil.doubles.Double2BooleanMap
compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, forEach, forEach, get, getOrDefault, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replaceMethods inherited from interface it.unimi.dsi.fastutil.doubles.Double2BooleanSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMapMethods inherited from interface java.util.function.DoublePredicate
and, negate, orMethods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, containsKey, equals, get, getOrDefault, hashCode, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAllMethods inherited from interface java.util.SequencedMap
firstEntry, lastEntry, pollFirstEntry, pollLastEntry, sequencedEntrySet, sequencedKeySet, sequencedValues
-
Constructor Details
-
Double2BooleanAVLTreeMap
public Double2BooleanAVLTreeMap()Creates a new empty tree map. -
Double2BooleanAVLTreeMap
Creates a new empty tree map with the given comparator.- Parameters:
c- a (possibly type-specific) comparator.
-
Double2BooleanAVLTreeMap
-
Double2BooleanAVLTreeMap
Creates a new tree map copying a given sorted map (and itsComparator).- Parameters:
m- aSortedMapto be copied into the new tree map.
-
Double2BooleanAVLTreeMap
Creates a new tree map copying a given map.- Parameters:
m- a type-specific map to be copied into the new tree map.
-
Double2BooleanAVLTreeMap
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.
-
Double2BooleanAVLTreeMap
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.
-
Double2BooleanAVLTreeMap
public Double2BooleanAVLTreeMap(double[] k, boolean[] 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 Details
-
put
public boolean put(double k, boolean v) Description copied from interface:Double2BooleanFunctionAdds a pair to the map (optional operation).- Specified by:
putin interfaceDouble2BooleanFunction- 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:
-
remove
public boolean remove(double k) Description copied from interface:Double2BooleanFunctionRemoves the mapping with the given key (optional operation).- Specified by:
removein interfaceDouble2BooleanFunction- Parameters:
k- the key.- Returns:
- the old value, or the default return value if no value was present for the given key.
- See Also:
-
containsValue
public boolean containsValue(boolean v) Description copied from class:AbstractDouble2BooleanMapReturnstrueif this map maps one or more keys to the specified value.- Specified by:
containsValuein interfaceDouble2BooleanMap- Overrides:
containsValuein classAbstractDouble2BooleanMap- See Also:
-
clear
public void clear()Description copied from interface:FunctionRemoves all associations from this function (optional operation). -
containsKey
public boolean containsKey(double k) Description copied from class:AbstractDouble2BooleanMapReturns true if this function contains a mapping for the specified key.Note that for some kind of functions (e.g., hashes) this method will always return true. In particular, this default implementation always returns true.
- Specified by:
containsKeyin interfaceDouble2BooleanFunction- Specified by:
containsKeyin interfaceDouble2BooleanMap- Overrides:
containsKeyin classAbstractDouble2BooleanMap- Parameters:
k- the key.- Returns:
- true if this function associates a value to
key. - See Also:
-
size
public int size()Description copied from interface:FunctionReturns 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. This default implementation, in particular, returns -1.
-
isEmpty
-
get
public boolean get(double k) Description copied from interface:Double2BooleanFunctionReturns the value to which the given key is mapped.- Specified by:
getin interfaceDouble2BooleanFunction- Parameters:
k- the key.- Returns:
- the corresponding value, or the default return value if no value was present for the given key.
- See Also:
-
firstDoubleKey
public double firstDoubleKey()Description copied from interface:Double2BooleanSortedMapReturns the first (lowest) key currently in this map.- Specified by:
firstDoubleKeyin interfaceDouble2BooleanSortedMap- See Also:
-
lastDoubleKey
public double lastDoubleKey()Description copied from interface:Double2BooleanSortedMapReturns the last (highest) key currently in this map.- Specified by:
lastDoubleKeyin interfaceDouble2BooleanSortedMap- See Also:
-
double2BooleanEntrySet
Description copied from interface:Double2BooleanMapReturns a type-specific set view of the mappings contained in this map.This method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen
Map.entrySet()so that it returns anObjectSetof type-specific entries (the latter makes it possible to access keys and values with type-specific methods).- Specified by:
double2BooleanEntrySetin interfaceDouble2BooleanMap- Specified by:
double2BooleanEntrySetin interfaceDouble2BooleanSortedMap- Returns:
- a type-specific set view of the mappings contained in this map.
- See Also:
-
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 interfaceDouble2BooleanMap- Specified by:
keySetin interfaceDouble2BooleanSortedMap- Specified by:
keySetin interfaceMap<Double,Boolean> - Specified by:
keySetin interfaceSortedMap<Double,Boolean> - Overrides:
keySetin classAbstractDouble2BooleanSortedMap- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
-
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 interfaceDouble2BooleanMap- Specified by:
valuesin interfaceDouble2BooleanSortedMap- Specified by:
valuesin interfaceMap<Double,Boolean> - Specified by:
valuesin interfaceSortedMap<Double,Boolean> - Overrides:
valuesin classAbstractDouble2BooleanSortedMap- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
-
comparator
Description copied from interface:Double2BooleanSortedMapReturns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.- Specified by:
comparatorin interfaceDouble2BooleanSortedMap- Specified by:
comparatorin interfaceSortedMap<Double,Boolean> - See Also:
-
headMap
Description copied from interface:Double2BooleanSortedMapReturns a view of the portion of this sorted map whose keys are strictly less thantoKey.- Specified by:
headMapin interfaceDouble2BooleanSortedMap- See Also:
-
tailMap
Description copied from interface:Double2BooleanSortedMapReturns a view of the portion of this sorted map whose keys are greater than or equal tofromKey.- Specified by:
tailMapin interfaceDouble2BooleanSortedMap- See Also:
-
subMap
Description copied from interface:Double2BooleanSortedMapReturns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.- Specified by:
subMapin interfaceDouble2BooleanSortedMap- See Also:
-
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.
-