T - the type of elements maintained by this Collectionpublic class Object2DoubleLinkedOpenCustomHashMap<T> extends Object2DoubleOpenCustomHashMap<T> implements Object2DoubleSortedMap<T>
AbstractObject2DoubleMap.BasicEntry<T>java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Object2DoubleSortedMap.FastSortedSet<T>Object2DoubleMap.Entry<T>, Object2DoubleMap.FastEntrySet<T>| Constructor and Description |
|---|
Object2DoubleLinkedOpenCustomHashMap(int minCapacity,
float loadFactor,
ObjectStrategy<? super T> strategy)
Constructor that defines the minimum capacity and load factor
|
Object2DoubleLinkedOpenCustomHashMap(int minCapacity,
ObjectStrategy<? super T> strategy)
Constructor that defines the minimum capacity
|
Object2DoubleLinkedOpenCustomHashMap(java.util.Map<? extends T,? extends java.lang.Double> map,
float loadFactor,
ObjectStrategy<? super T> strategy)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Object2DoubleLinkedOpenCustomHashMap(java.util.Map<? extends T,? extends java.lang.Double> map,
ObjectStrategy<? super T> strategy)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Object2DoubleLinkedOpenCustomHashMap(Object2DoubleMap<T> map,
float loadFactor,
ObjectStrategy<? super T> strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Object2DoubleLinkedOpenCustomHashMap(Object2DoubleMap<T> map,
ObjectStrategy<? super T> strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Object2DoubleLinkedOpenCustomHashMap(ObjectStrategy<? super T> strategy)
Default Constructor
|
Object2DoubleLinkedOpenCustomHashMap(T[] keys,
double[] values,
float loadFactor,
ObjectStrategy<? super T> strategy)
Helper constructor that allow to create a map from unboxed values
|
Object2DoubleLinkedOpenCustomHashMap(T[] keys,
java.lang.Double[] values,
float loadFactor,
ObjectStrategy<? super T> strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Object2DoubleLinkedOpenCustomHashMap(T[] keys,
double[] values,
ObjectStrategy<? super T> strategy)
Helper constructor that allow to create a map from unboxed values
|
Object2DoubleLinkedOpenCustomHashMap(T[] keys,
java.lang.Double[] values,
ObjectStrategy<? super T> strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
java.util.Comparator<T> |
comparator() |
double |
firstDoubleValue()
A method to get the first Value of a Map.
|
T |
firstKey() |
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.
|
Object2DoubleSortedMap<T> |
headMap(T toKey) |
ObjectSet<T> |
keySet() |
double |
lastDoubleValue()
A method to get the last Value of a Map.
|
T |
lastKey() |
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.
|
ObjectSet<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.
|
Object2DoubleSortedMap<T> |
subMap(T fromKey,
T toKey) |
Object2DoubleSortedMap<T> |
tailMap(T fromKey) |
DoubleCollection |
values() |
addTo, computeDouble, computeDoubleIfAbsent, computeDoubleIfPresent, containsKey, containsValue, containsValue, get, getDouble, getOrDefault, mergeAllDouble, mergeDouble, put, putIfAbsent, rem, remOrDefault, remove, remove, remove, replace, replace, sizeaddToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, putAll, putAll, putAll, putAllIfAbsent, replaceDoubles, replaceDoubles, setDefaultReturnValueaddTo, addToAll, compute, computeDouble, computeDoubleIfAbsent, computeDoubleIfPresent, computeIfAbsent, computeIfPresent, containsValue, containsValue, entrySet, forEach, get, getDefaultReturnValue, getDouble, getOrDefault, getOrDefault, merge, mergeAllDouble, mergeDouble, put, put, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, putIfAbsent, rem, remOrDefault, remove, remove, remove, replace, replace, replace, replace, replaceAll, replaceDoubles, replaceDoubles, setDefaultReturnValueapplyAsDoublepublic Object2DoubleLinkedOpenCustomHashMap(ObjectStrategy<? super T> strategy)
strategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Object2DoubleLinkedOpenCustomHashMap(int minCapacity,
ObjectStrategy<? super T> 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 Object2DoubleLinkedOpenCustomHashMap(int minCapacity,
float loadFactor,
ObjectStrategy<? super T> 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 Object2DoubleLinkedOpenCustomHashMap(T[] keys, java.lang.Double[] values, ObjectStrategy<? super T> 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 Object2DoubleLinkedOpenCustomHashMap(T[] keys, java.lang.Double[] values, float loadFactor, ObjectStrategy<? super T> 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 Object2DoubleLinkedOpenCustomHashMap(T[] keys, double[] values, ObjectStrategy<? super T> 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 Object2DoubleLinkedOpenCustomHashMap(T[] keys, double[] values, float loadFactor, ObjectStrategy<? super T> 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 Object2DoubleLinkedOpenCustomHashMap(java.util.Map<? extends T,? extends java.lang.Double> map, ObjectStrategy<? super T> strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Object2DoubleLinkedOpenCustomHashMap(java.util.Map<? extends T,? extends java.lang.Double> map, float loadFactor, ObjectStrategy<? super T> 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 Object2DoubleLinkedOpenCustomHashMap(Object2DoubleMap<T> map, ObjectStrategy<? super T> strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Object2DoubleLinkedOpenCustomHashMap(Object2DoubleMap<T> map, float loadFactor, ObjectStrategy<? super T> 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(T key, double value)
Object2DoubleSortedMapputAndMoveToFirst in interface Object2DoubleSortedMap<T>key - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public double putAndMoveToLast(T key, double value)
Object2DoubleSortedMapputAndMoveToLast in interface Object2DoubleSortedMap<T>key - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public boolean moveToFirst(T key)
Object2DoubleSortedMapmoveToFirst in interface Object2DoubleSortedMap<T>key - that should be moved to the first indexpublic boolean moveToLast(T key)
Object2DoubleSortedMapmoveToLast in interface Object2DoubleSortedMap<T>key - that should be moved to the first lastpublic double getAndMoveToFirst(T key)
Object2DoubleSortedMapgetAndMoveToFirst in interface Object2DoubleSortedMap<T>key - that is searched forpublic double getAndMoveToLast(T key)
Object2DoubleSortedMapgetAndMoveToLast in interface Object2DoubleSortedMap<T>key - that is searched forpublic java.util.Comparator<T> comparator()
comparator in interface java.util.SortedMap<T,java.lang.Double>comparator in interface Object2DoubleSortedMap<T>public Object2DoubleSortedMap<T> subMap(T fromKey, T toKey)
subMap in interface java.util.SortedMap<T,java.lang.Double>subMap in interface Object2DoubleSortedMap<T>public Object2DoubleSortedMap<T> headMap(T toKey)
headMap in interface java.util.SortedMap<T,java.lang.Double>headMap in interface Object2DoubleSortedMap<T>public Object2DoubleSortedMap<T> tailMap(T fromKey)
tailMap in interface java.util.SortedMap<T,java.lang.Double>tailMap in interface Object2DoubleSortedMap<T>public T firstKey()
firstKey in interface java.util.SortedMap<T,java.lang.Double>public T pollFirstKey()
Object2DoubleSortedMappollFirstKey in interface Object2DoubleSortedMap<T>public T lastKey()
lastKey in interface java.util.SortedMap<T,java.lang.Double>public T pollLastKey()
Object2DoubleSortedMappollLastKey in interface Object2DoubleSortedMap<T>public double firstDoubleValue()
Object2DoubleSortedMapfirstDoubleValue in interface Object2DoubleSortedMap<T>public double lastDoubleValue()
Object2DoubleSortedMaplastDoubleValue in interface Object2DoubleSortedMap<T>public ObjectSet<Object2DoubleMap.Entry<T>> object2DoubleEntrySet()
Object2DoubleMapobject2DoubleEntrySet in interface Object2DoubleMap<T>object2DoubleEntrySet in class Object2DoubleOpenCustomHashMap<T>public ObjectSet<T> keySet()
keySet in interface java.util.Map<T,java.lang.Double>keySet in interface java.util.SortedMap<T,java.lang.Double>keySet in interface Object2DoubleMap<T>keySet in interface Object2DoubleSortedMap<T>keySet in class Object2DoubleOpenCustomHashMap<T>public DoubleCollection values()
values in interface java.util.Map<T,java.lang.Double>values in interface java.util.SortedMap<T,java.lang.Double>values in interface Object2DoubleMap<T>values in interface Object2DoubleSortedMap<T>values in class Object2DoubleOpenCustomHashMap<T>public void forEach(ObjectDoubleConsumer<T> action)
Object2DoubleMapforEach in interface Object2DoubleMap<T>forEach in class Object2DoubleOpenCustomHashMap<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 Object2DoubleOpenCustomHashMap<T>