public class Int2DoubleLinkedOpenCustomHashMap extends Int2DoubleOpenCustomHashMap implements Int2DoubleSortedMap
AbstractInt2DoubleMap.BasicEntryjava.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Int2DoubleSortedMap.FastSortedSetInt2DoubleMap.Entry, Int2DoubleMap.FastEntrySet| Constructor and Description |
|---|
Int2DoubleLinkedOpenCustomHashMap(int[] keys,
double[] values,
float loadFactor,
IntStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Int2DoubleLinkedOpenCustomHashMap(int[] keys,
double[] values,
IntStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Int2DoubleLinkedOpenCustomHashMap(Int2DoubleMap map,
float loadFactor,
IntStrategy strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Int2DoubleLinkedOpenCustomHashMap(Int2DoubleMap map,
IntStrategy strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Int2DoubleLinkedOpenCustomHashMap(java.lang.Integer[] keys,
java.lang.Double[] values,
float loadFactor,
IntStrategy strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Int2DoubleLinkedOpenCustomHashMap(java.lang.Integer[] keys,
java.lang.Double[] values,
IntStrategy strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Int2DoubleLinkedOpenCustomHashMap(int minCapacity,
float loadFactor,
IntStrategy strategy)
Constructor that defines the minimum capacity and load factor
|
Int2DoubleLinkedOpenCustomHashMap(int minCapacity,
IntStrategy strategy)
Constructor that defines the minimum capacity
|
Int2DoubleLinkedOpenCustomHashMap(IntStrategy strategy)
Default Constructor
|
Int2DoubleLinkedOpenCustomHashMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Double> map,
float loadFactor,
IntStrategy strategy)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Int2DoubleLinkedOpenCustomHashMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Double> map,
IntStrategy 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() |
IntComparator |
comparator() |
double |
firstDoubleValue()
A method to get the first Value of a Map.
|
int |
firstIntKey()
A method to get the first Key of a Map.
|
void |
forEach(IntDoubleConsumer action)
Type Specific forEach method to reduce boxing/unboxing
|
double |
getAndMoveToFirst(int key)
A Specific get method that allows to move teh given key/value int the first index.
|
double |
getAndMoveToLast(int key)
A Specific get method that allows to move teh given key/value int the last index.
|
Int2DoubleSortedMap |
headMap(int toKey)
A Type Specific HeadMap method to reduce boxing/unboxing
|
ObjectSet<Int2DoubleMap.Entry> |
int2DoubleEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
IntSet |
keySet() |
double |
lastDoubleValue()
A method to get the last Value of a Map.
|
int |
lastIntKey()
A method to get the last Key of a Map.
|
boolean |
moveToFirst(int key)
A specific move method to move a given key/value to the first index.
|
boolean |
moveToLast(int key)
A specific move method to move a given key/value to the last index.
|
int |
pollFirstIntKey()
A method to get and remove the first Key of a Map.
|
int |
pollLastIntKey()
A method to get and remove the last Key of a Map.
|
double |
putAndMoveToFirst(int key,
double value)
A customized put method that allows you to insert into the first index.
|
double |
putAndMoveToLast(int key,
double value)
A customized put method that allows you to insert into the last index.
|
Int2DoubleSortedMap |
subMap(int fromKey,
int toKey)
A Type Specific SubMap method to reduce boxing/unboxing
|
Int2DoubleSortedMap |
tailMap(int fromKey)
A Type Specific TailMap method to reduce boxing/unboxing
|
DoubleCollection |
values() |
addTo, computeDouble, computeDoubleIfAbsent, computeDoubleIfPresent, containsKey, containsKey, containsValue, containsValue, get, getDouble, getOrDefault, mergeAllDouble, mergeDouble, put, putIfAbsent, remInt, remIntOrDefault, remove, remove, remove, replace, replace, sizeaddToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, putAll, putAll, putAll, putAllIfAbsent, replaceDoubles, replaceDoubles, setDefaultReturnValuefirstKey, headMap, lastKey, subMap, tailMapaddTo, addToAll, compute, computeDouble, computeDoubleIfAbsent, computeDoubleIfPresent, computeIfAbsent, computeIfPresent, containsKey, containsKey, containsValue, containsValue, entrySet, forEach, get, getDefaultReturnValue, getDouble, getOrDefault, getOrDefault, merge, mergeAllDouble, mergeDouble, put, put, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, putIfAbsent, remInt, remIntOrDefault, remove, remove, remove, replace, replace, replace, replace, replaceAll, replaceDoubles, replaceDoubles, setDefaultReturnValueapplyAsDoublepublic Int2DoubleLinkedOpenCustomHashMap(IntStrategy strategy)
strategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Int2DoubleLinkedOpenCustomHashMap(int minCapacity,
IntStrategy 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 Int2DoubleLinkedOpenCustomHashMap(int minCapacity,
float loadFactor,
IntStrategy 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 Int2DoubleLinkedOpenCustomHashMap(java.lang.Integer[] keys,
java.lang.Double[] values,
IntStrategy 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 Int2DoubleLinkedOpenCustomHashMap(java.lang.Integer[] keys,
java.lang.Double[] values,
float loadFactor,
IntStrategy 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 Int2DoubleLinkedOpenCustomHashMap(int[] keys,
double[] values,
IntStrategy 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 Int2DoubleLinkedOpenCustomHashMap(int[] keys,
double[] values,
float loadFactor,
IntStrategy 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 Int2DoubleLinkedOpenCustomHashMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Double> map,
IntStrategy strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Int2DoubleLinkedOpenCustomHashMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Double> map,
float loadFactor,
IntStrategy 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 Int2DoubleLinkedOpenCustomHashMap(Int2DoubleMap map, IntStrategy strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Int2DoubleLinkedOpenCustomHashMap(Int2DoubleMap map, float loadFactor, IntStrategy 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 double putAndMoveToFirst(int key,
double value)
Int2DoubleSortedMapputAndMoveToFirst in interface Int2DoubleSortedMapkey - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public double putAndMoveToLast(int key,
double value)
Int2DoubleSortedMapputAndMoveToLast in interface Int2DoubleSortedMapkey - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public boolean moveToFirst(int key)
Int2DoubleSortedMapmoveToFirst in interface Int2DoubleSortedMapkey - that should be moved to the first indexpublic boolean moveToLast(int key)
Int2DoubleSortedMapmoveToLast in interface Int2DoubleSortedMapkey - that should be moved to the first lastpublic double getAndMoveToFirst(int key)
Int2DoubleSortedMapgetAndMoveToFirst in interface Int2DoubleSortedMapkey - that is searched forpublic double getAndMoveToLast(int key)
Int2DoubleSortedMapgetAndMoveToLast in interface Int2DoubleSortedMapkey - that is searched forpublic IntComparator comparator()
comparator in interface java.util.SortedMap<java.lang.Integer,java.lang.Double>comparator in interface Int2DoubleSortedMappublic Int2DoubleSortedMap subMap(int fromKey, int toKey)
Int2DoubleSortedMapsubMap in interface Int2DoubleSortedMapfromKey - where the submap should starttoKey - where the subMap should endpublic Int2DoubleSortedMap headMap(int toKey)
Int2DoubleSortedMapheadMap in interface Int2DoubleSortedMaptoKey - where the headMap should endpublic Int2DoubleSortedMap tailMap(int fromKey)
Int2DoubleSortedMaptailMap in interface Int2DoubleSortedMapfromKey - where the TailMap should startpublic int firstIntKey()
Int2DoubleSortedMapfirstIntKey in interface Int2DoubleSortedMappublic int pollFirstIntKey()
Int2DoubleSortedMappollFirstIntKey in interface Int2DoubleSortedMappublic int lastIntKey()
Int2DoubleSortedMaplastIntKey in interface Int2DoubleSortedMappublic int pollLastIntKey()
Int2DoubleSortedMappollLastIntKey in interface Int2DoubleSortedMappublic double firstDoubleValue()
Int2DoubleSortedMapfirstDoubleValue in interface Int2DoubleSortedMappublic double lastDoubleValue()
Int2DoubleSortedMaplastDoubleValue in interface Int2DoubleSortedMappublic ObjectSet<Int2DoubleMap.Entry> int2DoubleEntrySet()
Int2DoubleMapint2DoubleEntrySet in interface Int2DoubleMapint2DoubleEntrySet in class Int2DoubleOpenCustomHashMappublic IntSet keySet()
keySet in interface java.util.Map<java.lang.Integer,java.lang.Double>keySet in interface java.util.SortedMap<java.lang.Integer,java.lang.Double>keySet in interface Int2DoubleMapkeySet in interface Int2DoubleSortedMapkeySet in class Int2DoubleOpenCustomHashMappublic DoubleCollection values()
values in interface java.util.Map<java.lang.Integer,java.lang.Double>values in interface java.util.SortedMap<java.lang.Integer,java.lang.Double>values in interface Int2DoubleMapvalues in interface Int2DoubleSortedMapvalues in class Int2DoubleOpenCustomHashMappublic void forEach(IntDoubleConsumer action)
Int2DoubleMapforEach in interface Int2DoubleMapforEach in class Int2DoubleOpenCustomHashMapaction - processor of the values that are iterator overpublic void clear()
clear in interface java.util.Map<java.lang.Integer,java.lang.Double>clear in class Int2DoubleOpenCustomHashMap