V - the type of elements maintained by this Collectionpublic class Double2ObjectLinkedOpenHashMap<V> extends Double2ObjectOpenHashMap<V> implements Double2ObjectSortedMap<V>
AbstractDouble2ObjectMap.BasicEntry<V>java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Double2ObjectSortedMap.FastSortedSet<V>Double2ObjectMap.Entry<V>, Double2ObjectMap.FastEntrySet<V>| Constructor and Description |
|---|
Double2ObjectLinkedOpenHashMap()
Default Constructor
|
Double2ObjectLinkedOpenHashMap(double[] keys,
V[] values)
Helper constructor that allow to create a map from unboxed values
|
Double2ObjectLinkedOpenHashMap(java.lang.Double[] keys,
V[] values)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Double2ObjectLinkedOpenHashMap(double[] keys,
V[] values,
float loadFactor)
Helper constructor that allow to create a map from unboxed values
|
Double2ObjectLinkedOpenHashMap(java.lang.Double[] keys,
V[] values,
float loadFactor)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Double2ObjectLinkedOpenHashMap(Double2ObjectMap<V> map)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Double2ObjectLinkedOpenHashMap(Double2ObjectMap<V> map,
float loadFactor)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Double2ObjectLinkedOpenHashMap(int minCapacity)
Constructor that defines the minimum capacity
|
Double2ObjectLinkedOpenHashMap(int minCapacity,
float loadFactor)
Constructor that defines the minimum capacity and load factor
|
Double2ObjectLinkedOpenHashMap(java.util.Map<? extends java.lang.Double,? extends V> map)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Double2ObjectLinkedOpenHashMap(java.util.Map<? extends java.lang.Double,? extends V> 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() |
DoubleComparator |
comparator() |
ObjectSet<Double2ObjectMap.Entry<V>> |
double2ObjectEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
double |
firstDoubleKey()
A method to get the first Key of a Map.
|
V |
firstValue()
A method to get the first Value of a Map.
|
void |
forEach(DoubleObjectConsumer<V> action)
Type Specific forEach method to reduce boxing/unboxing
|
V |
getAndMoveToFirst(double key)
A Specific get method that allows to move teh given key/value int the first index.
|
V |
getAndMoveToLast(double key)
A Specific get method that allows to move teh given key/value int the last index.
|
Double2ObjectSortedMap<V> |
headMap(double toKey)
A Type Specific HeadMap method to reduce boxing/unboxing
|
DoubleSet |
keySet() |
double |
lastDoubleKey()
A method to get the last Key of a Map.
|
V |
lastValue()
A method to get the last Value of a Map.
|
boolean |
moveToFirst(double key)
A specific move method to move a given key/value to the first index.
|
boolean |
moveToLast(double key)
A specific move method to move a given key/value to the last index.
|
double |
pollFirstDoubleKey()
A method to get and remove the first Key of a Map.
|
double |
pollLastDoubleKey()
A method to get and remove the last Key of a Map.
|
V |
putAndMoveToFirst(double key,
V value)
A customized put method that allows you to insert into the first index.
|
V |
putAndMoveToLast(double key,
V value)
A customized put method that allows you to insert into the last index.
|
Double2ObjectSortedMap<V> |
subMap(double fromKey,
double toKey)
A Type Specific SubMap method to reduce boxing/unboxing
|
Double2ObjectSortedMap<V> |
tailMap(double fromKey)
A Type Specific TailMap method to reduce boxing/unboxing
|
ObjectCollection<V> |
values() |
compute, computeIfAbsent, computeIfPresent, containsKey, containsKey, containsValue, get, getObject, getOrDefault, merge, mergeAll, put, putIfAbsent, remDouble, remDoubleOrDefault, remove, remove, remove, replace, replace, sizeentrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, putAll, putAll, putAll, putAllIfAbsent, replaceObjects, replaceObjects, setDefaultReturnValuefirstKey, headMap, lastKey, subMap, tailMapcompute, compute, computeIfAbsent, computeIfAbsent, computeIfPresent, computeIfPresent, containsKey, containsKey, entrySet, forEach, get, getDefaultReturnValue, getObject, getOrDefault, getOrDefault, merge, merge, mergeAll, put, put, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, putIfAbsent, remDouble, remDoubleOrDefault, remove, remove, remove, replace, replace, replace, replace, replaceAll, replaceObjects, replaceObjects, setDefaultReturnValuecontainsValue, equals, hashCode, isEmpty, putAll, sizeapplypublic Double2ObjectLinkedOpenHashMap()
public Double2ObjectLinkedOpenHashMap(int minCapacity)
minCapacity - the minimum capacity the HashMap is allowed to be.java.lang.IllegalStateException - if the minimum capacity is negativepublic Double2ObjectLinkedOpenHashMap(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 Double2ObjectLinkedOpenHashMap(java.lang.Double[] keys,
V[] 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 Double2ObjectLinkedOpenHashMap(java.lang.Double[] keys,
V[] 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 Double2ObjectLinkedOpenHashMap(double[] keys,
V[] 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 Double2ObjectLinkedOpenHashMap(double[] keys,
V[] 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 Double2ObjectLinkedOpenHashMap(java.util.Map<? extends java.lang.Double,? extends V> map)
map - the values that should be present in the mappublic Double2ObjectLinkedOpenHashMap(java.util.Map<? extends java.lang.Double,? extends V> 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 Double2ObjectLinkedOpenHashMap(Double2ObjectMap<V> map)
map - the values that should be present in the mappublic Double2ObjectLinkedOpenHashMap(Double2ObjectMap<V> 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 V putAndMoveToFirst(double key, V value)
Double2ObjectSortedMapputAndMoveToFirst in interface Double2ObjectSortedMap<V>key - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public V putAndMoveToLast(double key, V value)
Double2ObjectSortedMapputAndMoveToLast in interface Double2ObjectSortedMap<V>key - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public boolean moveToFirst(double key)
Double2ObjectSortedMapmoveToFirst in interface Double2ObjectSortedMap<V>key - that should be moved to the first indexpublic boolean moveToLast(double key)
Double2ObjectSortedMapmoveToLast in interface Double2ObjectSortedMap<V>key - that should be moved to the first lastpublic V getAndMoveToFirst(double key)
Double2ObjectSortedMapgetAndMoveToFirst in interface Double2ObjectSortedMap<V>key - that is searched forpublic V getAndMoveToLast(double key)
Double2ObjectSortedMapgetAndMoveToLast in interface Double2ObjectSortedMap<V>key - that is searched forpublic DoubleComparator comparator()
comparator in interface java.util.SortedMap<java.lang.Double,V>comparator in interface Double2ObjectSortedMap<V>public Double2ObjectSortedMap<V> subMap(double fromKey, double toKey)
Double2ObjectSortedMapsubMap in interface Double2ObjectSortedMap<V>fromKey - where the submap should starttoKey - where the subMap should endpublic Double2ObjectSortedMap<V> headMap(double toKey)
Double2ObjectSortedMapheadMap in interface Double2ObjectSortedMap<V>toKey - where the headMap should endpublic Double2ObjectSortedMap<V> tailMap(double fromKey)
Double2ObjectSortedMaptailMap in interface Double2ObjectSortedMap<V>fromKey - where the TailMap should startpublic double firstDoubleKey()
Double2ObjectSortedMapfirstDoubleKey in interface Double2ObjectSortedMap<V>public double pollFirstDoubleKey()
Double2ObjectSortedMappollFirstDoubleKey in interface Double2ObjectSortedMap<V>public double lastDoubleKey()
Double2ObjectSortedMaplastDoubleKey in interface Double2ObjectSortedMap<V>public double pollLastDoubleKey()
Double2ObjectSortedMappollLastDoubleKey in interface Double2ObjectSortedMap<V>public V firstValue()
Double2ObjectSortedMapfirstValue in interface Double2ObjectSortedMap<V>public V lastValue()
Double2ObjectSortedMaplastValue in interface Double2ObjectSortedMap<V>public ObjectSet<Double2ObjectMap.Entry<V>> double2ObjectEntrySet()
Double2ObjectMapdouble2ObjectEntrySet in interface Double2ObjectMap<V>double2ObjectEntrySet in class Double2ObjectOpenHashMap<V>public DoubleSet keySet()
keySet in interface java.util.Map<java.lang.Double,V>keySet in interface java.util.SortedMap<java.lang.Double,V>keySet in interface Double2ObjectMap<V>keySet in interface Double2ObjectSortedMap<V>keySet in class Double2ObjectOpenHashMap<V>public ObjectCollection<V> values()
values in interface java.util.Map<java.lang.Double,V>values in interface java.util.SortedMap<java.lang.Double,V>values in interface Double2ObjectMap<V>values in interface Double2ObjectSortedMap<V>values in class Double2ObjectOpenHashMap<V>public void forEach(DoubleObjectConsumer<V> action)
Double2ObjectMapforEach in interface Double2ObjectMap<V>forEach in class Double2ObjectOpenHashMap<V>action - processor of the values that are iterator overpublic void clear()
clear in interface java.util.Map<java.lang.Double,V>clear in class Double2ObjectOpenHashMap<V>