public class Long2DoubleLinkedOpenHashMap extends Long2DoubleOpenHashMap implements Long2DoubleOrderedMap
AbstractLong2DoubleMap.BasicEntryjava.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Long2DoubleOrderedMap.FastOrderedSetLong2DoubleMap.BuilderCache, Long2DoubleMap.Entry, Long2DoubleMap.FastEntrySet, Long2DoubleMap.MapBuilder| Constructor and Description |
|---|
Long2DoubleLinkedOpenHashMap()
Default Constructor
|
Long2DoubleLinkedOpenHashMap(int minCapacity)
Constructor that defines the minimum capacity
|
Long2DoubleLinkedOpenHashMap(int minCapacity,
float loadFactor)
Constructor that defines the minimum capacity and load factor
|
Long2DoubleLinkedOpenHashMap(long[] keys,
double[] values)
Helper constructor that allow to create a map from unboxed values
|
Long2DoubleLinkedOpenHashMap(java.lang.Long[] keys,
java.lang.Double[] values)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Long2DoubleLinkedOpenHashMap(long[] keys,
double[] values,
float loadFactor)
Helper constructor that allow to create a map from unboxed values
|
Long2DoubleLinkedOpenHashMap(java.lang.Long[] keys,
java.lang.Double[] values,
float loadFactor)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Long2DoubleLinkedOpenHashMap(Long2DoubleMap map)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Long2DoubleLinkedOpenHashMap(Long2DoubleMap map,
float loadFactor)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Long2DoubleLinkedOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Double> map)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Long2DoubleLinkedOpenHashMap(java.util.Map<? extends java.lang.Long,? 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.
|
| 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.
|
Long2DoubleLinkedOpenHashMap |
copy()
A Function that does a shallow clone of the Map itself.
|
double |
firstDoubleValue()
A method to get the first Value of a Map.
|
long |
firstLongKey()
A method to get the first Key of a Map.
|
void |
forEach(LongDoubleConsumer action)
Type Specific forEach method to reduce boxing/unboxing
|
double |
getAndMoveToFirst(long key)
A Specific get method that allows to move teh given key/value int the first index.
|
double |
getAndMoveToLast(long key)
A Specific get method that allows to move teh given key/value int the last index.
|
LongOrderedSet |
keySet() |
double |
lastDoubleValue()
A method to get the last Value of a Map.
|
long |
lastLongKey()
A method to get the last Key of a Map.
|
ObjectOrderedSet<Long2DoubleMap.Entry> |
long2DoubleEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
boolean |
moveToFirst(long key)
A specific move method to move a given key/value to the first index.
|
boolean |
moveToLast(long key)
A specific move method to move a given key/value to the last index.
|
long |
pollFirstLongKey()
A method to get and remove the first Key of a Map.
|
long |
pollLastLongKey()
A method to get and remove the last Key of a Map.
|
double |
putAndMoveToFirst(long key,
double value)
A customized put method that allows you to insert into the first index.
|
double |
putAndMoveToLast(long key,
double value)
A customized put method that allows you to insert into the last index.
|
DoubleCollection |
values() |
addTo, computeDouble, computeDoubleIfAbsent, computeDoubleIfPresent, containsKey, containsKey, get, get, getOrDefault, mergeAllDouble, mergeDouble, put, putIfAbsent, remove, remove, remove, remove, removeOrDefault, replace, replace, size, subFrom, supplyDoubleIfAbsent, trimaddToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, replaceDoubles, replaceDoubles, setDefaultReturnValuesynchronize, synchronize, unmodifiableaddTo, addToAll, builder, compute, computeDouble, computeDoubleIfAbsent, computeDoubleIfPresent, computeIfAbsent, computeIfPresent, containsKey, containsKey, entrySet, forEach, get, get, getDefaultReturnValue, getOrDefault, getOrDefault, merge, mergeAllDouble, mergeDouble, put, put, putAll, putAll, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, putIfAbsent, remove, remove, remove, remove, removeOrDefault, replace, replace, replace, replace, replaceAll, replaceDoubles, replaceDoubles, setDefaultReturnValue, subFrom, supplyDoubleIfAbsentapplyAsDoubleclearAndTrim, trimpublic Long2DoubleLinkedOpenHashMap()
public Long2DoubleLinkedOpenHashMap(int minCapacity)
minCapacity - the minimum capacity the HashMap is allowed to be.java.lang.IllegalStateException - if the minimum capacity is negativepublic Long2DoubleLinkedOpenHashMap(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 Long2DoubleLinkedOpenHashMap(java.lang.Long[] 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 Long2DoubleLinkedOpenHashMap(java.lang.Long[] 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 Long2DoubleLinkedOpenHashMap(long[] 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 Long2DoubleLinkedOpenHashMap(long[] 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 Long2DoubleLinkedOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Double> map)
map - the values that should be present in the mappublic Long2DoubleLinkedOpenHashMap(java.util.Map<? extends java.lang.Long,? 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 Long2DoubleLinkedOpenHashMap(Long2DoubleMap map)
map - the values that should be present in the mappublic Long2DoubleLinkedOpenHashMap(Long2DoubleMap 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(long key,
double value)
Long2DoubleOrderedMapputAndMoveToFirst in interface Long2DoubleOrderedMapkey - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public double putAndMoveToLast(long key,
double value)
Long2DoubleOrderedMapputAndMoveToLast in interface Long2DoubleOrderedMapkey - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public boolean moveToFirst(long key)
Long2DoubleOrderedMapmoveToFirst in interface Long2DoubleOrderedMapkey - that should be moved to the first indexpublic boolean moveToLast(long key)
Long2DoubleOrderedMapmoveToLast in interface Long2DoubleOrderedMapkey - that should be moved to the first lastpublic double getAndMoveToFirst(long key)
Long2DoubleOrderedMapgetAndMoveToFirst in interface Long2DoubleOrderedMapkey - that is searched forpublic double getAndMoveToLast(long key)
Long2DoubleOrderedMapgetAndMoveToLast in interface Long2DoubleOrderedMapkey - that is searched forpublic boolean containsValue(double value)
Long2DoubleMapcontainsValue in interface Long2DoubleMapcontainsValue in class Long2DoubleOpenHashMapvalue - element that is searched for@Deprecated public boolean containsValue(java.lang.Object value)
containsValue in interface java.util.Map<java.lang.Long,java.lang.Double>containsValue in interface Long2DoubleMapcontainsValue in class Long2DoubleOpenHashMapvalue - that is searched for.Map.containsValue(Object)public Long2DoubleLinkedOpenHashMap copy()
Long2DoubleMapcopy in interface Long2DoubleMapcopy in interface Long2DoubleOrderedMapcopy in class Long2DoubleOpenHashMappublic long firstLongKey()
Long2DoubleOrderedMapfirstLongKey in interface Long2DoubleOrderedMappublic long pollFirstLongKey()
Long2DoubleOrderedMappollFirstLongKey in interface Long2DoubleOrderedMappublic long lastLongKey()
Long2DoubleOrderedMaplastLongKey in interface Long2DoubleOrderedMappublic long pollLastLongKey()
Long2DoubleOrderedMappollLastLongKey in interface Long2DoubleOrderedMappublic double firstDoubleValue()
Long2DoubleOrderedMapfirstDoubleValue in interface Long2DoubleOrderedMappublic double lastDoubleValue()
Long2DoubleOrderedMaplastDoubleValue in interface Long2DoubleOrderedMappublic ObjectOrderedSet<Long2DoubleMap.Entry> long2DoubleEntrySet()
Long2DoubleMaplong2DoubleEntrySet in interface Long2DoubleMaplong2DoubleEntrySet in interface Long2DoubleOrderedMaplong2DoubleEntrySet in class Long2DoubleOpenHashMappublic LongOrderedSet keySet()
keySet in interface java.util.Map<java.lang.Long,java.lang.Double>keySet in interface Long2DoubleMapkeySet in interface Long2DoubleOrderedMapkeySet in class Long2DoubleOpenHashMappublic DoubleCollection values()
values in interface java.util.Map<java.lang.Long,java.lang.Double>values in interface Long2DoubleMapvalues in class Long2DoubleOpenHashMappublic void forEach(LongDoubleConsumer action)
Long2DoubleMapforEach in interface Long2DoubleMapforEach in class Long2DoubleOpenHashMapaction - processor of the values that are iterator overpublic void clear()
clear in interface java.util.Map<java.lang.Long,java.lang.Double>clear in class Long2DoubleOpenHashMappublic void clearAndTrim(int size)
ITrimmableclearAndTrim in interface ITrimmableclearAndTrim in class Long2DoubleOpenHashMapsize - the amount of elements that should be allowed