V - the type of elements maintained by this Collectionpublic class Double2ObjectOpenCustomHashMap<V> extends AbstractDouble2ObjectMap<V> implements ITrimmable
AbstractDouble2ObjectMap.BasicEntry<V>java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Double2ObjectMap.BuilderCache<V>, Double2ObjectMap.Entry<V>, Double2ObjectMap.FastEntrySet<V>, Double2ObjectMap.MapBuilder| Constructor and Description |
|---|
Double2ObjectOpenCustomHashMap(double[] keys,
V[] values,
DoubleStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Double2ObjectOpenCustomHashMap(java.lang.Double[] keys,
V[] values,
DoubleStrategy strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Double2ObjectOpenCustomHashMap(double[] keys,
V[] values,
float loadFactor,
DoubleStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Double2ObjectOpenCustomHashMap(java.lang.Double[] keys,
V[] values,
float loadFactor,
DoubleStrategy strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Double2ObjectOpenCustomHashMap(Double2ObjectMap<V> map,
DoubleStrategy strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Double2ObjectOpenCustomHashMap(Double2ObjectMap<V> map,
float loadFactor,
DoubleStrategy strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Double2ObjectOpenCustomHashMap(DoubleStrategy strategy)
Default Contstructor
|
Double2ObjectOpenCustomHashMap(int minCapacity,
DoubleStrategy strategy)
Constructor that defines the minimum capacity
|
Double2ObjectOpenCustomHashMap(int minCapacity,
float loadFactor,
DoubleStrategy strategy)
Constructor that defines the minimum capacity and load factor
|
Double2ObjectOpenCustomHashMap(java.util.Map<? extends java.lang.Double,? extends V> map,
DoubleStrategy strategy)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Double2ObjectOpenCustomHashMap(java.util.Map<? extends java.lang.Double,? extends V> map,
float loadFactor,
DoubleStrategy strategy)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
void |
clearAndTrim(int size)
Trims the collection down to the requested size and clears all elements while doing so
|
V |
compute(double key,
DoubleObjectUnaryOperator<V> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
V |
computeIfAbsent(double key,
Double2ObjectFunction<V> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
V |
computeIfPresent(double key,
DoubleObjectUnaryOperator<V> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
boolean |
containsKey(double key)
Type Specific method to reduce boxing/unboxing of values
|
boolean |
containsKey(java.lang.Object key)
Deprecated.
|
boolean |
containsValue(java.lang.Object value) |
Double2ObjectOpenCustomHashMap<V> |
copy()
A Function that does a shallow clone of the Map itself.
|
ObjectSet<Double2ObjectMap.Entry<V>> |
double2ObjectEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
void |
forEach(DoubleObjectConsumer<V> action)
Type Specific forEach method to reduce boxing/unboxing
|
V |
get(double key)
A Type Specific get method to reduce boxing/unboxing
|
V |
get(java.lang.Object key) |
V |
getOrDefault(double key,
V defaultValue)
A Type Specific getOrDefault method to reduce boxing/unboxing
|
DoubleSet |
keySet() |
V |
merge(double key,
V value,
ObjectObjectUnaryOperator<V,V> mappingFunction)
A Type Specific merge method to reduce boxing/unboxing
|
void |
mergeAll(Double2ObjectMap<V> m,
ObjectObjectUnaryOperator<V,V> mappingFunction)
A Bulk method for merging Maps.
|
V |
put(double key,
V value)
Type Specific method to reduce boxing/unboxing of values
|
V |
putIfAbsent(double key,
V value)
Type Specific method to reduce boxing/unboxing of values
|
V |
remove(double key)
Type Specific remove function to reduce boxing/unboxing
|
boolean |
remove(double key,
V value)
Type Specific remove function to reduce boxing/unboxing
|
V |
remove(java.lang.Object key) |
boolean |
remove(java.lang.Object key,
java.lang.Object value) |
V |
removeOrDefault(double key,
V defaultValue)
Type-Specific Remove function with a default return value if wanted.
|
V |
replace(double key,
V value)
A Type Specific replace method to reduce boxing/unboxing replace an existing value
|
boolean |
replace(double key,
V oldValue,
V newValue)
A Type Specific replace method to replace an existing value
|
int |
size() |
V |
supplyIfAbsent(double key,
ObjectSupplier<V> valueProvider)
A Supplier based computeIfAbsent function to fill the most used usecase of this function
|
boolean |
trim(int size)
Trims the original collection down to the size of the current elements or the requested size depending which is bigger
|
ObjectCollection<V> |
values() |
entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, replaceObjects, replaceObjects, setDefaultReturnValueclearAndTrim, trimbuilder, compute, computeIfAbsent, computeIfPresent, forEach, merge, putAll, putAll, putIfAbsent, replace, replace, replaceAll, synchronize, synchronize, unmodifiableapplypublic Double2ObjectOpenCustomHashMap(DoubleStrategy strategy)
strategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Double2ObjectOpenCustomHashMap(int minCapacity,
DoubleStrategy strategy)
minCapacity - the minimum capacity the HashMap is allowed to be.strategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nulljava.lang.IllegalStateException - if the minimum capacity is negativepublic Double2ObjectOpenCustomHashMap(int minCapacity,
float loadFactor,
DoubleStrategy strategy)
minCapacity - the minimum capacity the HashMap is allowed to be.loadFactor - the percentage of how full the backing array can be before they resizestrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nulljava.lang.IllegalStateException - if the minimum capacity is negativejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public Double2ObjectOpenCustomHashMap(java.lang.Double[] keys,
V[] values,
DoubleStrategy strategy)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.strategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nulljava.lang.IllegalStateException - if the keys and values do not match in lenghtpublic Double2ObjectOpenCustomHashMap(java.lang.Double[] keys,
V[] values,
float loadFactor,
DoubleStrategy strategy)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.loadFactor - the percentage of how full the backing array can be before they resizestrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nulljava.lang.IllegalStateException - if the keys and values do not match in lenghtjava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public Double2ObjectOpenCustomHashMap(double[] keys,
V[] values,
DoubleStrategy strategy)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.strategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nulljava.lang.IllegalStateException - if the keys and values do not match in lenghtpublic Double2ObjectOpenCustomHashMap(double[] keys,
V[] values,
float loadFactor,
DoubleStrategy strategy)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.loadFactor - the percentage of how full the backing array can be before they resizestrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nulljava.lang.IllegalStateException - if the keys and values do not match in lenghtjava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public Double2ObjectOpenCustomHashMap(java.util.Map<? extends java.lang.Double,? extends V> map, DoubleStrategy strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Double2ObjectOpenCustomHashMap(java.util.Map<? extends java.lang.Double,? extends V> map, float loadFactor, DoubleStrategy strategy)
map - the values that should be present in the maploadFactor - the percentage of how full the backing array can be before they resizestrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nulljava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public Double2ObjectOpenCustomHashMap(Double2ObjectMap<V> map, DoubleStrategy strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Double2ObjectOpenCustomHashMap(Double2ObjectMap<V> map, float loadFactor, DoubleStrategy strategy)
map - the values that should be present in the maploadFactor - the percentage of how full the backing array can be before they resizestrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nulljava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public V put(double key, V value)
Double2ObjectMapput in interface Double2ObjectMap<V>key - the key that should be inserted,value - the value that should be insertedMap.put(Object, Object)public V putIfAbsent(double key, V value)
Double2ObjectMapputIfAbsent in interface Double2ObjectMap<V>key - the key that should be inserted,value - the value that should be insertedMap.putIfAbsent(Object, Object)public boolean containsKey(double key)
Double2ObjectMapcontainsKey in interface Double2ObjectMap<V>containsKey in class AbstractDouble2ObjectMap<V>key - element that is searched for@Deprecated public boolean containsKey(java.lang.Object key)
containsKey in interface java.util.Map<java.lang.Double,V>containsKey in interface Double2ObjectMap<V>containsKey in class java.util.AbstractMap<java.lang.Double,V>key - that is searched for.Map.containsKey(Object)public boolean containsValue(java.lang.Object value)
containsValue in interface java.util.Map<java.lang.Double,V>containsValue in class AbstractDouble2ObjectMap<V>public V remove(double key)
Double2ObjectMapremove in interface Double2ObjectMap<V>key - the element that should be removedpublic V removeOrDefault(double key, V defaultValue)
Double2ObjectMapremoveOrDefault in interface Double2ObjectMap<V>key - the element that should be removeddefaultValue - the value that should be returned if the entry doesn't existMap.remove(Object, Object)public V remove(java.lang.Object key)
remove in interface java.util.Map<java.lang.Double,V>remove in interface Double2ObjectMap<V>remove in class AbstractDouble2ObjectMap<V>key - the element that should be removedMap.remove(Object)public boolean remove(double key,
V value)
Double2ObjectMapremove in interface Double2ObjectMap<V>key - the element that should be removedvalue - the expected value that should be foundMap.remove(Object, Object)public boolean remove(java.lang.Object key,
java.lang.Object value)
remove in interface java.util.Map<java.lang.Double,V>remove in interface Double2ObjectMap<V>key - the element that should be removedvalue - the expected value that should be foundMap.remove(Object, Object)public V get(double key)
Double2ObjectMapget in interface Double2ObjectFunction<V>get in interface Double2ObjectMap<V>key - the key that is searched forpublic V get(java.lang.Object key)
get in interface java.util.Map<java.lang.Double,V>get in interface Double2ObjectMap<V>get in class AbstractDouble2ObjectMap<V>public V getOrDefault(double key, V defaultValue)
Double2ObjectMapgetOrDefault in interface Double2ObjectMap<V>getOrDefault in class AbstractDouble2ObjectMap<V>key - the key that is searched fordefaultValue - the value that should be returned if the key is not presentpublic Double2ObjectOpenCustomHashMap<V> copy()
Double2ObjectMapcopy in interface Double2ObjectMap<V>copy in class AbstractDouble2ObjectMap<V>public ObjectSet<Double2ObjectMap.Entry<V>> double2ObjectEntrySet()
Double2ObjectMapdouble2ObjectEntrySet in interface Double2ObjectMap<V>public DoubleSet keySet()
keySet in interface java.util.Map<java.lang.Double,V>keySet in interface Double2ObjectMap<V>keySet in class AbstractDouble2ObjectMap<V>public ObjectCollection<V> values()
values in interface java.util.Map<java.lang.Double,V>values in interface Double2ObjectMap<V>values in class AbstractDouble2ObjectMap<V>public void forEach(DoubleObjectConsumer<V> action)
Double2ObjectMapforEach in interface Double2ObjectMap<V>forEach in class AbstractDouble2ObjectMap<V>action - processor of the values that are iterator overpublic boolean replace(double key,
V oldValue,
V newValue)
Double2ObjectMapreplace in interface Double2ObjectMap<V>replace in class AbstractDouble2ObjectMap<V>key - the element that should be searched foroldValue - the expected value to be replacednewValue - the value to replace the oldValue with.public V replace(double key, V value)
Double2ObjectMapreplace in interface Double2ObjectMap<V>replace in class AbstractDouble2ObjectMap<V>key - the element that should be searched forvalue - the value to replace with.public V compute(double key, DoubleObjectUnaryOperator<V> mappingFunction)
Double2ObjectMapcompute in interface Double2ObjectMap<V>compute in class AbstractDouble2ObjectMap<V>key - the key that should be computedmappingFunction - the operator that should generate the valuepublic V computeIfAbsent(double key, Double2ObjectFunction<V> mappingFunction)
Double2ObjectMapcomputeIfAbsent in interface Double2ObjectMap<V>computeIfAbsent in class AbstractDouble2ObjectMap<V>key - the key that should be computedmappingFunction - the operator that should generate the value if not presentpublic V supplyIfAbsent(double key, ObjectSupplier<V> valueProvider)
Double2ObjectMapsupplyIfAbsent in interface Double2ObjectMap<V>supplyIfAbsent in class AbstractDouble2ObjectMap<V>key - the key that should be computedvalueProvider - the value if not presentpublic V computeIfPresent(double key, DoubleObjectUnaryOperator<V> mappingFunction)
Double2ObjectMapcomputeIfPresent in interface Double2ObjectMap<V>computeIfPresent in class AbstractDouble2ObjectMap<V>key - the key that should be computedmappingFunction - the operator that should generate the value if presentpublic V merge(double key, V value, ObjectObjectUnaryOperator<V,V> mappingFunction)
Double2ObjectMapmerge in interface Double2ObjectMap<V>merge in class AbstractDouble2ObjectMap<V>key - the key that should be be searched forvalue - the value that should be merged withmappingFunction - the operator that should generate the new Valuepublic void mergeAll(Double2ObjectMap<V> m, ObjectObjectUnaryOperator<V,V> mappingFunction)
Double2ObjectMapmergeAll in interface Double2ObjectMap<V>mergeAll in class AbstractDouble2ObjectMap<V>m - the entries that should be bulk addedmappingFunction - the operator that should generate the new Valuepublic int size()
public void clear()
public boolean trim(int size)
ITrimmabletrim in interface ITrimmablesize - the requested trim size.public void clearAndTrim(int size)
ITrimmableclearAndTrim in interface ITrimmablesize - the amount of elements that should be allowed