T - the keyType of elements maintained by this Collectionpublic class Object2DoubleLinkedOpenHashMap<T> extends Object2DoubleOpenHashMap<T> implements Object2DoubleOrderedMap<T>
AbstractObject2DoubleMap.BasicEntry<T>java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Object2DoubleOrderedMap.FastOrderedSet<T>Object2DoubleMap.BuilderCache<T>, Object2DoubleMap.Entry<T>, Object2DoubleMap.FastEntrySet<T>, Object2DoubleMap.MapBuilder| Constructor and Description |
|---|
Object2DoubleLinkedOpenHashMap()
Default Constructor
|
Object2DoubleLinkedOpenHashMap(int minCapacity)
Constructor that defines the minimum capacity
|
Object2DoubleLinkedOpenHashMap(int minCapacity,
float loadFactor)
Constructor that defines the minimum capacity and load factor
|
Object2DoubleLinkedOpenHashMap(java.util.Map<? extends T,? extends java.lang.Double> map)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Object2DoubleLinkedOpenHashMap(java.util.Map<? extends T,? extends java.lang.Double> map,
float loadFactor)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Object2DoubleLinkedOpenHashMap(Object2DoubleMap<T> map)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Object2DoubleLinkedOpenHashMap(Object2DoubleMap<T> map,
float loadFactor)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Object2DoubleLinkedOpenHashMap(T[] keys,
double[] values)
Helper constructor that allow to create a map from unboxed values
|
Object2DoubleLinkedOpenHashMap(T[] keys,
java.lang.Double[] values)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Object2DoubleLinkedOpenHashMap(T[] keys,
double[] values,
float loadFactor)
Helper constructor that allow to create a map from unboxed values
|
Object2DoubleLinkedOpenHashMap(T[] keys,
java.lang.Double[] values,
float loadFactor)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
| 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
|
boolean |
containsValue(double value)
Type Specific method to reduce boxing/unboxing of values
|
boolean |
containsValue(java.lang.Object value)
Deprecated.
|
Object2DoubleLinkedOpenHashMap<T> |
copy()
A Function that does a shallow clone of the Map itself.
|
double |
firstDoubleValue()
A method to get the first Value of a Map.
|
T |
firstKey()
A method to get the first Key of a Map.
|
void |
forEach(ObjectDoubleConsumer<T> action)
Type Specific forEach method to reduce boxing/unboxing
|
double |
getAndMoveToFirst(T key)
A Specific get method that allows to move teh given key/value int the first index.
|
double |
getAndMoveToLast(T key)
A Specific get method that allows to move teh given key/value int the last index.
|
ObjectOrderedSet<T> |
keySet() |
double |
lastDoubleValue()
A method to get the last Value of a Map.
|
T |
lastKey()
A method to get the last Key of a Map.
|
boolean |
moveToFirst(T key)
A specific move method to move a given key/value to the first index.
|
boolean |
moveToLast(T key)
A specific move method to move a given key/value to the last index.
|
ObjectOrderedSet<Object2DoubleMap.Entry<T>> |
object2DoubleEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
T |
pollFirstKey()
A method to get and remove the first Key of a Map.
|
T |
pollLastKey()
A method to get and remove the last Key of a Map.
|
double |
putAndMoveToFirst(T key,
double value)
A customized put method that allows you to insert into the first index.
|
double |
putAndMoveToLast(T key,
double value)
A customized put method that allows you to insert into the last index.
|
DoubleCollection |
values() |
addTo, computeDouble, computeDoubleIfAbsent, computeDoubleIfPresent, containsKey, get, getDouble, getOrDefault, mergeAllDouble, mergeDouble, put, putIfAbsent, rem, remOrDefault, remove, remove, remove, replace, replace, size, subFrom, supplyDoubleIfAbsent, trimaddToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, replaceDoubles, replaceDoubles, setDefaultReturnValuesynchronize, synchronize, unmodifiableaddTo, addToAll, applyAsDouble, builder, compute, computeDouble, computeDoubleIfAbsent, computeDoubleIfPresent, computeIfAbsent, computeIfPresent, entrySet, forEach, get, getDefaultReturnValue, getDouble, getOrDefault, getOrDefault, merge, mergeAllDouble, mergeDouble, put, put, put, put, putAll, putAll, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, putIfAbsent, rem, remOrDefault, remove, remove, remove, replace, replace, replace, replace, replaceAll, replaceDoubles, replaceDoubles, setDefaultReturnValue, subFrom, supplyDoubleIfAbsentclearAndTrim, trimpublic Object2DoubleLinkedOpenHashMap()
public Object2DoubleLinkedOpenHashMap(int minCapacity)
minCapacity - the minimum capacity the HashMap is allowed to be.java.lang.IllegalStateException - if the minimum capacity is negativepublic Object2DoubleLinkedOpenHashMap(int minCapacity,
float loadFactor)
minCapacity - the minimum capacity the HashMap is allowed to be.loadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the minimum capacity is negativejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public Object2DoubleLinkedOpenHashMap(T[] keys, java.lang.Double[] values)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.java.lang.IllegalStateException - if the keys and values do not match in lenghtpublic Object2DoubleLinkedOpenHashMap(T[] keys, java.lang.Double[] values, float loadFactor)
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 resizejava.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 Object2DoubleLinkedOpenHashMap(T[] keys, double[] values)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.java.lang.IllegalStateException - if the keys and values do not match in lenghtpublic Object2DoubleLinkedOpenHashMap(T[] keys, double[] values, float loadFactor)
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 resizejava.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 Object2DoubleLinkedOpenHashMap(java.util.Map<? extends T,? extends java.lang.Double> map)
map - the values that should be present in the mappublic Object2DoubleLinkedOpenHashMap(java.util.Map<? extends T,? extends java.lang.Double> map, float loadFactor)
map - the values that should be present in the maploadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public Object2DoubleLinkedOpenHashMap(Object2DoubleMap<T> map)
map - the values that should be present in the mappublic Object2DoubleLinkedOpenHashMap(Object2DoubleMap<T> map, float loadFactor)
map - the values that should be present in the maploadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public double putAndMoveToFirst(T key, double value)
Object2DoubleOrderedMapputAndMoveToFirst in interface Object2DoubleOrderedMap<T>key - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public double putAndMoveToLast(T key, double value)
Object2DoubleOrderedMapputAndMoveToLast in interface Object2DoubleOrderedMap<T>key - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public boolean moveToFirst(T key)
Object2DoubleOrderedMapmoveToFirst in interface Object2DoubleOrderedMap<T>key - that should be moved to the first indexpublic boolean moveToLast(T key)
Object2DoubleOrderedMapmoveToLast in interface Object2DoubleOrderedMap<T>key - that should be moved to the first lastpublic double getAndMoveToFirst(T key)
Object2DoubleOrderedMapgetAndMoveToFirst in interface Object2DoubleOrderedMap<T>key - that is searched forpublic double getAndMoveToLast(T key)
Object2DoubleOrderedMapgetAndMoveToLast in interface Object2DoubleOrderedMap<T>key - that is searched forpublic boolean containsValue(double value)
Object2DoubleMapcontainsValue in interface Object2DoubleMap<T>containsValue in class Object2DoubleOpenHashMap<T>value - element that is searched for@Deprecated public boolean containsValue(java.lang.Object value)
containsValue in interface java.util.Map<T,java.lang.Double>containsValue in interface Object2DoubleMap<T>containsValue in class Object2DoubleOpenHashMap<T>value - that is searched for.Map.containsValue(Object)public Object2DoubleLinkedOpenHashMap<T> copy()
Object2DoubleMapcopy in interface Object2DoubleMap<T>copy in interface Object2DoubleOrderedMap<T>copy in class Object2DoubleOpenHashMap<T>public T firstKey()
Object2DoubleOrderedMapfirstKey in interface Object2DoubleOrderedMap<T>public T pollFirstKey()
Object2DoubleOrderedMappollFirstKey in interface Object2DoubleOrderedMap<T>public T lastKey()
Object2DoubleOrderedMaplastKey in interface Object2DoubleOrderedMap<T>public T pollLastKey()
Object2DoubleOrderedMappollLastKey in interface Object2DoubleOrderedMap<T>public double firstDoubleValue()
Object2DoubleOrderedMapfirstDoubleValue in interface Object2DoubleOrderedMap<T>public double lastDoubleValue()
Object2DoubleOrderedMaplastDoubleValue in interface Object2DoubleOrderedMap<T>public ObjectOrderedSet<Object2DoubleMap.Entry<T>> object2DoubleEntrySet()
Object2DoubleMapobject2DoubleEntrySet in interface Object2DoubleMap<T>object2DoubleEntrySet in interface Object2DoubleOrderedMap<T>object2DoubleEntrySet in class Object2DoubleOpenHashMap<T>public ObjectOrderedSet<T> keySet()
keySet in interface java.util.Map<T,java.lang.Double>keySet in interface Object2DoubleMap<T>keySet in interface Object2DoubleOrderedMap<T>keySet in class Object2DoubleOpenHashMap<T>public DoubleCollection values()
values in interface java.util.Map<T,java.lang.Double>values in interface Object2DoubleMap<T>values in class Object2DoubleOpenHashMap<T>public void forEach(ObjectDoubleConsumer<T> action)
Object2DoubleMapforEach in interface Object2DoubleMap<T>forEach in class Object2DoubleOpenHashMap<T>action - processor of the values that are iterator overpublic void clear()
clear in interface java.util.Map<T,java.lang.Double>clear in class Object2DoubleOpenHashMap<T>public void clearAndTrim(int size)
ITrimmableclearAndTrim in interface ITrimmableclearAndTrim in class Object2DoubleOpenHashMap<T>size - the amount of elements that should be allowed