Modul speiger.src.collections
Klasse Int2DoubleLinkedOpenCustomHashMap
java.lang.Object
java.util.AbstractMap<Integer,Double>
speiger.src.collections.ints.maps.abstracts.AbstractInt2DoubleMap
speiger.src.collections.ints.maps.impl.customHash.Int2DoubleOpenCustomHashMap
speiger.src.collections.ints.maps.impl.customHash.Int2DoubleLinkedOpenCustomHashMap
- Alle implementierten Schnittstellen:
IntToDoubleFunction,Map<Integer,,Double> Int2DoubleFunction,Int2DoubleMap,Int2DoubleOrderedMap,ITrimmable
public class Int2DoubleLinkedOpenCustomHashMap
extends Int2DoubleOpenCustomHashMap
implements Int2DoubleOrderedMap
A Type Specific LinkedHashMap that allows for custom HashControl. That uses arrays to create links between nodes.
For cases where Objects/primitive do not allow hashcoding this can be really useful and provide a lot of control.
This implementation of SortedMap does not support SubMaps of any kind. It implements the interface due to sortability and first/last access
-
Verschachtelte Klassen - Übersicht
Von Klasse geerbte verschachtelte Klassen/Schnittstellen speiger.src.collections.ints.maps.abstracts.AbstractInt2DoubleMap
AbstractInt2DoubleMap.BasicEntryVon Klasse geerbte verschachtelte Klassen/Schnittstellen java.util.AbstractMap
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K, V> Von Schnittstelle geerbte verschachtelte Klassen/Schnittstellen speiger.src.collections.ints.maps.interfaces.Int2DoubleMap
Int2DoubleMap.BuilderCache, Int2DoubleMap.Entry, Int2DoubleMap.FastEntrySet, Int2DoubleMap.MapBuilderVon Schnittstelle geerbte verschachtelte Klassen/Schnittstellen speiger.src.collections.ints.maps.interfaces.Int2DoubleOrderedMap
Int2DoubleOrderedMap.FastOrderedSet -
Konstruktorübersicht
KonstruktorenKonstruktorBeschreibungInt2DoubleLinkedOpenCustomHashMap(int[] keys, double[] values, float loadFactor, IntStrategy strategy) Helper constructor that allow to create a map from unboxed valuesInt2DoubleLinkedOpenCustomHashMap(int[] keys, double[] values, IntStrategy strategy) Helper constructor that allow to create a map from unboxed valuesInt2DoubleLinkedOpenCustomHashMap(int minCapacity, float loadFactor, IntStrategy strategy) Constructor that defines the minimum capacity and load factorInt2DoubleLinkedOpenCustomHashMap(int minCapacity, IntStrategy strategy) Constructor that defines the minimum capacityInt2DoubleLinkedOpenCustomHashMap(Integer[] keys, Double[] values, float loadFactor, IntStrategy strategy) Helper constructor that allow to create a map from boxed values (it will unbox them)Int2DoubleLinkedOpenCustomHashMap(Integer[] keys, Double[] values, IntStrategy strategy) Helper constructor that allow to create a map from boxed values (it will unbox them)Int2DoubleLinkedOpenCustomHashMap(Map<? extends Integer, ? extends 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(Map<? extends Integer, ? extends Double> map, IntStrategy strategy) A Helper constructor that allows to create a Map with exactly the same values as the provided map.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(IntStrategy strategy) Default Constructor -
Methodenübersicht
Modifizierer und TypMethodeBeschreibungvoidclear()voidclearAndTrim(int size) Trims the collection down to the requested size and clears all elements while doing socopy()A Function that does a shallow clone of the Map itself.doubleA method to get the first Value of a Map.intA method to get the first Key of a Map.voidforEach(IntDoubleConsumer action) Type Specific forEach method to reduce boxing/unboxingdoublegetAndMoveToFirst(int key) A Specific get method that allows to move teh given key/value int the first index.doublegetAndMoveToLast(int key) A Specific get method that allows to move teh given key/value int the last index.Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.keySet()doubleA method to get the last Value of a Map.intA method to get the last Key of a Map.booleanmoveToFirst(int key) A specific move method to move a given key/value to the first index.booleanmoveToLast(int key) A specific move method to move a given key/value to the last index.intA method to get and remove the first Key of a Map.intA method to get and remove the last Key of a Map.doubleputAndMoveToFirst(int key, double value) A customized put method that allows you to insert into the first index.doubleputAndMoveToLast(int key, double value) A customized put method that allows you to insert into the last index.values()Von Klasse geerbte Methoden speiger.src.collections.ints.maps.impl.customHash.Int2DoubleOpenCustomHashMap
addTo, computeDouble, computeDoubleIfAbsent, computeDoubleIfAbsentNonDefault, computeDoubleIfPresent, computeDoubleIfPresentNonDefault, computeDoubleNonDefault, containsKey, containsKey, containsValue, containsValue, get, get, getOrDefault, mergeAllDouble, mergeDouble, put, putIfAbsent, remove, remove, remove, remove, removeOrDefault, replace, replace, size, subFrom, supplyDoubleIfAbsent, supplyDoubleIfAbsentNonDefault, trimVon Klasse geerbte Methoden speiger.src.collections.ints.maps.abstracts.AbstractInt2DoubleMap
addToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, replaceDoubles, replaceDoubles, setDefaultReturnValueVon Klasse geerbte Methoden java.util.AbstractMap
isEmpty, toStringVon Schnittstelle geerbte Methoden speiger.src.collections.ints.maps.interfaces.Int2DoubleMap
addTo, addToAll, applyAsDouble, compute, computeDouble, computeDoubleIfAbsent, computeDoubleIfAbsentNonDefault, computeDoubleIfPresent, computeDoubleIfPresentNonDefault, computeDoubleNonDefault, computeIfAbsent, computeIfPresent, containsKey, containsKey, containsValue, containsValue, entrySet, forEach, get, get, getDefaultReturnValue, getOrDefault, getOrDefault, merge, mergeAllDouble, mergeDouble, put, put, put, put, putAll, putAll, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, putIfAbsent, remove, remove, remove, remove, removeOrDefault, replace, replace, replace, replace, replaceAll, replaceDoubles, replaceDoubles, setDefaultReturnValue, subFrom, supplyDoubleIfAbsent, supplyDoubleIfAbsentNonDefaultVon Schnittstelle geerbte Methoden speiger.src.collections.ints.maps.interfaces.Int2DoubleOrderedMap
synchronize, synchronize, unmodifiableVon Schnittstelle geerbte Methoden speiger.src.collections.utils.ITrimmable
clearAndTrim, trim
-
Konstruktordetails
-
Int2DoubleLinkedOpenCustomHashMap
Default Constructor- Parameter:
strategy- the strategy that allows hash control.- Löst aus:
NullPointerException- if Strategy is null
-
Int2DoubleLinkedOpenCustomHashMap
Constructor that defines the minimum capacity- Parameter:
minCapacity- the minimum capacity the HashMap is allowed to be.strategy- the strategy that allows hash control.- Löst aus:
NullPointerException- if Strategy is nullIllegalStateException- if the minimum capacity is negative
-
Int2DoubleLinkedOpenCustomHashMap
Constructor that defines the minimum capacity and load factor- Parameter:
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.- Löst aus:
NullPointerException- if Strategy is nullIllegalStateException- if the minimum capacity is negativeIllegalStateException- if the loadfactor is either below/equal to 0 or above/equal to 1
-
Int2DoubleLinkedOpenCustomHashMap
Helper constructor that allow to create a map from boxed values (it will unbox them)- Parameter:
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.- Löst aus:
NullPointerException- if Strategy is nullIllegalStateException- if the keys and values do not match in lenght
-
Int2DoubleLinkedOpenCustomHashMap
public Int2DoubleLinkedOpenCustomHashMap(Integer[] keys, Double[] values, float loadFactor, IntStrategy strategy) Helper constructor that allow to create a map from boxed values (it will unbox them)- Parameter:
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.- Löst aus:
NullPointerException- if Strategy is nullIllegalStateException- if the keys and values do not match in lenghtIllegalStateException- if the loadfactor is either below/equal to 0 or above/equal to 1
-
Int2DoubleLinkedOpenCustomHashMap
Helper constructor that allow to create a map from unboxed values- Parameter:
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.- Löst aus:
NullPointerException- if Strategy is nullIllegalStateException- if the keys and values do not match in lenght
-
Int2DoubleLinkedOpenCustomHashMap
public Int2DoubleLinkedOpenCustomHashMap(int[] keys, double[] values, float loadFactor, IntStrategy strategy) Helper constructor that allow to create a map from unboxed values- Parameter:
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.- Löst aus:
NullPointerException- if Strategy is nullIllegalStateException- if the keys and values do not match in lenghtIllegalStateException- if the loadfactor is either below/equal to 0 or above/equal to 1
-
Int2DoubleLinkedOpenCustomHashMap
public Int2DoubleLinkedOpenCustomHashMap(Map<? extends Integer, ? extends Double> map, IntStrategy strategy) A Helper constructor that allows to create a Map with exactly the same values as the provided map.- Parameter:
map- the values that should be present in the mapstrategy- the strategy that allows hash control.- Löst aus:
NullPointerException- if Strategy is null
-
Int2DoubleLinkedOpenCustomHashMap
public Int2DoubleLinkedOpenCustomHashMap(Map<? extends Integer, ? extends Double> map, float loadFactor, IntStrategy strategy) A Helper constructor that allows to create a Map with exactly the same values as the provided map.- Parameter:
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.- Löst aus:
NullPointerException- if Strategy is nullIllegalStateException- if the loadfactor is either below/equal to 0 or above/equal to 1
-
Int2DoubleLinkedOpenCustomHashMap
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.- Parameter:
map- the values that should be present in the mapstrategy- the strategy that allows hash control.- Löst aus:
NullPointerException- if Strategy is null
-
Int2DoubleLinkedOpenCustomHashMap
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.- Parameter:
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.- Löst aus:
NullPointerException- if Strategy is nullIllegalStateException- if the loadfactor is either below/equal to 0 or above/equal to 1
-
-
Methodendetails
-
putAndMoveToFirst
public double putAndMoveToFirst(int key, double value) Beschreibung aus Schnittstelle kopiert:Int2DoubleOrderedMapA customized put method that allows you to insert into the first index.- Angegeben von:
putAndMoveToFirstin SchnittstelleInt2DoubleOrderedMap- Parameter:
key- the key that should be insertedvalue- the value that should be inserted- Gibt zurück:
- the previous present or default return value
- Siehe auch:
-
putAndMoveToLast
public double putAndMoveToLast(int key, double value) Beschreibung aus Schnittstelle kopiert:Int2DoubleOrderedMapA customized put method that allows you to insert into the last index. (This may be nessesary depending on the implementation)- Angegeben von:
putAndMoveToLastin SchnittstelleInt2DoubleOrderedMap- Parameter:
key- the key that should be insertedvalue- the value that should be inserted- Gibt zurück:
- the previous present or default return value
- Siehe auch:
-
moveToFirst
public boolean moveToFirst(int key) Beschreibung aus Schnittstelle kopiert:Int2DoubleOrderedMapA specific move method to move a given key/value to the first index.- Angegeben von:
moveToFirstin SchnittstelleInt2DoubleOrderedMap- Parameter:
key- that should be moved to the first index- Gibt zurück:
- true if the value was moved.
-
moveToLast
public boolean moveToLast(int key) Beschreibung aus Schnittstelle kopiert:Int2DoubleOrderedMapA specific move method to move a given key/value to the last index.- Angegeben von:
moveToLastin SchnittstelleInt2DoubleOrderedMap- Parameter:
key- that should be moved to the first last- Gibt zurück:
- true if the value was moved.
-
getAndMoveToFirst
public double getAndMoveToFirst(int key) Beschreibung aus Schnittstelle kopiert:Int2DoubleOrderedMapA Specific get method that allows to move teh given key/value int the first index.- Angegeben von:
getAndMoveToFirstin SchnittstelleInt2DoubleOrderedMap- Parameter:
key- that is searched for- Gibt zurück:
- the given value for the requested key or default return value
-
getAndMoveToLast
public double getAndMoveToLast(int key) Beschreibung aus Schnittstelle kopiert:Int2DoubleOrderedMapA Specific get method that allows to move teh given key/value int the last index.- Angegeben von:
getAndMoveToLastin SchnittstelleInt2DoubleOrderedMap- Parameter:
key- that is searched for- Gibt zurück:
- the given value for the requested key or default return value
-
copy
Beschreibung aus Schnittstelle kopiert:Int2DoubleMapA Function that does a shallow clone of the Map itself. This function is more optimized then a copy constructor since the Map does not have to be unsorted/resorted. It can be compared to Cloneable but with less exception risk- Angegeben von:
copyin SchnittstelleInt2DoubleMap- Angegeben von:
copyin SchnittstelleInt2DoubleOrderedMap- Setzt außer Kraft:
copyin KlasseInt2DoubleOpenCustomHashMap- Gibt zurück:
- a Shallow Copy of the Map
-
firstIntKey
public int firstIntKey()Beschreibung aus Schnittstelle kopiert:Int2DoubleOrderedMapA method to get the first Key of a Map.- Angegeben von:
firstIntKeyin SchnittstelleInt2DoubleOrderedMap- Gibt zurück:
- the first key in the map
-
pollFirstIntKey
public int pollFirstIntKey()Beschreibung aus Schnittstelle kopiert:Int2DoubleOrderedMapA method to get and remove the first Key of a Map.- Angegeben von:
pollFirstIntKeyin SchnittstelleInt2DoubleOrderedMap- Gibt zurück:
- the first key in the map
-
lastIntKey
public int lastIntKey()Beschreibung aus Schnittstelle kopiert:Int2DoubleOrderedMapA method to get the last Key of a Map.- Angegeben von:
lastIntKeyin SchnittstelleInt2DoubleOrderedMap- Gibt zurück:
- the last key in the map
-
pollLastIntKey
public int pollLastIntKey()Beschreibung aus Schnittstelle kopiert:Int2DoubleOrderedMapA method to get and remove the last Key of a Map.- Angegeben von:
pollLastIntKeyin SchnittstelleInt2DoubleOrderedMap- Gibt zurück:
- the last key in the map
-
firstDoubleValue
public double firstDoubleValue()Beschreibung aus Schnittstelle kopiert:Int2DoubleOrderedMapA method to get the first Value of a Map.- Angegeben von:
firstDoubleValuein SchnittstelleInt2DoubleOrderedMap- Gibt zurück:
- the first key in the map
-
lastDoubleValue
public double lastDoubleValue()Beschreibung aus Schnittstelle kopiert:Int2DoubleOrderedMapA method to get the last Value of a Map.- Angegeben von:
lastDoubleValuein SchnittstelleInt2DoubleOrderedMap- Gibt zurück:
- the last key in the map
-
int2DoubleEntrySet
Beschreibung aus Schnittstelle kopiert:Int2DoubleMapType Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.- Angegeben von:
int2DoubleEntrySetin SchnittstelleInt2DoubleMap- Angegeben von:
int2DoubleEntrySetin SchnittstelleInt2DoubleOrderedMap- Setzt außer Kraft:
int2DoubleEntrySetin KlasseInt2DoubleOpenCustomHashMap- Gibt zurück:
- a EntrySet of the collection
-
keySet
- Angegeben von:
keySetin SchnittstelleInt2DoubleMap- Angegeben von:
keySetin SchnittstelleInt2DoubleOrderedMap- Angegeben von:
keySetin SchnittstelleMap<Integer,Double> - Setzt außer Kraft:
keySetin KlasseInt2DoubleOpenCustomHashMap
-
values
- Angegeben von:
valuesin SchnittstelleInt2DoubleMap- Angegeben von:
valuesin SchnittstelleMap<Integer,Double> - Setzt außer Kraft:
valuesin KlasseInt2DoubleOpenCustomHashMap
-
forEach
Beschreibung aus Schnittstelle kopiert:Int2DoubleMapType Specific forEach method to reduce boxing/unboxing- Angegeben von:
forEachin SchnittstelleInt2DoubleMap- Setzt außer Kraft:
forEachin KlasseInt2DoubleOpenCustomHashMap- Parameter:
action- processor of the values that are iterator over
-
clear
public void clear() -
clearAndTrim
public void clearAndTrim(int size) Beschreibung aus Schnittstelle kopiert:ITrimmableTrims the collection down to the requested size and clears all elements while doing so- Angegeben von:
clearAndTrimin SchnittstelleITrimmable- Setzt außer Kraft:
clearAndTrimin KlasseInt2DoubleOpenCustomHashMap- Parameter:
size- the amount of elements that should be allowed
-