Modul speiger.src.collections
Klasse Int2LongLinkedOpenHashMap
java.lang.Object
java.util.AbstractMap<Integer,Long>
speiger.src.collections.ints.maps.abstracts.AbstractInt2LongMap
speiger.src.collections.ints.maps.impl.hash.Int2LongOpenHashMap
speiger.src.collections.ints.maps.impl.hash.Int2LongLinkedOpenHashMap
- Alle implementierten Schnittstellen:
IntToLongFunction,Map<Integer,,Long> Int2LongFunction,Int2LongMap,Int2LongOrderedMap,ITrimmable
A Type Specific LinkedHashMap implementation that uses specific arrays to create links between nodes to remove the wrapping of elements
to greatly reduce memory usage. In Addition adding some helper methods to move around elements.
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.AbstractInt2LongMap
AbstractInt2LongMap.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.Int2LongMap
Int2LongMap.BuilderCache, Int2LongMap.Entry, Int2LongMap.FastEntrySet, Int2LongMap.MapBuilderVon Schnittstelle geerbte verschachtelte Klassen/Schnittstellen speiger.src.collections.ints.maps.interfaces.Int2LongOrderedMap
Int2LongOrderedMap.FastOrderedSet -
Konstruktorübersicht
KonstruktorenKonstruktorBeschreibungDefault ConstructorInt2LongLinkedOpenHashMap(int minCapacity) Constructor that defines the minimum capacityInt2LongLinkedOpenHashMap(int[] keys, long[] values) Helper constructor that allow to create a map from unboxed valuesInt2LongLinkedOpenHashMap(int[] keys, long[] values, float loadFactor) Helper constructor that allow to create a map from unboxed valuesInt2LongLinkedOpenHashMap(int minCapacity, float loadFactor) Constructor that defines the minimum capacity and load factorInt2LongLinkedOpenHashMap(Integer[] keys, Long[] values) Helper constructor that allow to create a map from boxed values (it will unbox them)Int2LongLinkedOpenHashMap(Integer[] keys, Long[] values, float loadFactor) Helper constructor that allow to create a map from boxed values (it will unbox them)Int2LongLinkedOpenHashMap(Map<? extends Integer, ? extends Long> map) A Helper constructor that allows to create a Map with exactly the same values as the provided map.Int2LongLinkedOpenHashMap(Map<? extends Integer, ? extends Long> map, float loadFactor) A Helper constructor that allows to create a Map with exactly the same values as the provided map.A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.Int2LongLinkedOpenHashMap(Int2LongMap map, float loadFactor) A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map. -
Methodenübersicht
Modifizierer und TypMethodeBeschreibungvoidclear()voidclearAndTrim(int size) Trims the collection down to the requested size and clears all elements while doing sobooleancontainsValue(long value) Type Specific method to reduce boxing/unboxing of valuesbooleancontainsValue(Object value) Veraltet.copy()A Function that does a shallow clone of the Map itself.intA method to get the first Key of a Map.longA method to get the first Value of a Map.voidforEach(IntLongConsumer action) Type Specific forEach method to reduce boxing/unboxinglonggetAndMoveToFirst(int key) A Specific get method that allows to move teh given key/value int the first index.longgetAndMoveToLast(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()intA method to get the last Key of a Map.longA method to get the last Value 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.longputAndMoveToFirst(int key, long value) A customized put method that allows you to insert into the first index.longputAndMoveToLast(int key, long 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.hash.Int2LongOpenHashMap
addTo, computeLong, computeLongIfAbsent, computeLongIfAbsentNonDefault, computeLongIfPresent, computeLongIfPresentNonDefault, computeLongNonDefault, containsKey, containsKey, get, get, getOrDefault, mergeAllLong, mergeLong, put, putIfAbsent, remove, remove, remove, remove, removeOrDefault, replace, replace, size, subFrom, supplyLongIfAbsent, supplyLongIfAbsentNonDefault, trimVon Klasse geerbte Methoden speiger.src.collections.ints.maps.abstracts.AbstractInt2LongMap
addToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, replaceLongs, replaceLongs, setDefaultReturnValueVon Klasse geerbte Methoden java.util.AbstractMap
isEmpty, toStringVon Schnittstelle geerbte Methoden speiger.src.collections.ints.maps.interfaces.Int2LongMap
addTo, addToAll, applyAsLong, compute, computeIfAbsent, computeIfPresent, computeLong, computeLongIfAbsent, computeLongIfAbsentNonDefault, computeLongIfPresent, computeLongIfPresentNonDefault, computeLongNonDefault, containsKey, containsKey, entrySet, forEach, get, get, getDefaultReturnValue, getOrDefault, getOrDefault, merge, mergeAllLong, mergeLong, put, put, put, put, putAll, putAll, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, putIfAbsent, remove, remove, remove, remove, removeOrDefault, replace, replace, replace, replace, replaceAll, replaceLongs, replaceLongs, setDefaultReturnValue, subFrom, supplyLongIfAbsent, supplyLongIfAbsentNonDefaultVon Schnittstelle geerbte Methoden speiger.src.collections.ints.maps.interfaces.Int2LongOrderedMap
synchronize, synchronize, unmodifiableVon Schnittstelle geerbte Methoden speiger.src.collections.utils.ITrimmable
clearAndTrim, trim
-
Konstruktordetails
-
Int2LongLinkedOpenHashMap
public Int2LongLinkedOpenHashMap()Default Constructor -
Int2LongLinkedOpenHashMap
public Int2LongLinkedOpenHashMap(int minCapacity) Constructor that defines the minimum capacity- Parameter:
minCapacity- the minimum capacity the HashMap is allowed to be.- Löst aus:
IllegalStateException- if the minimum capacity is negative
-
Int2LongLinkedOpenHashMap
public Int2LongLinkedOpenHashMap(int minCapacity, float loadFactor) 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 resize- Löst aus:
IllegalStateException- if the minimum capacity is negativeIllegalStateException- if the loadfactor is either below/equal to 0 or above/equal to 1
-
Int2LongLinkedOpenHashMap
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.- Löst aus:
IllegalStateException- if the keys and values do not match in lenght
-
Int2LongLinkedOpenHashMap
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 resize- Löst aus:
IllegalStateException- if the keys and values do not match in lenghtIllegalStateException- if the loadfactor is either below/equal to 0 or above/equal to 1
-
Int2LongLinkedOpenHashMap
public Int2LongLinkedOpenHashMap(int[] keys, long[] values) 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.- Löst aus:
IllegalStateException- if the keys and values do not match in lenght
-
Int2LongLinkedOpenHashMap
public Int2LongLinkedOpenHashMap(int[] keys, long[] values, float loadFactor) 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 resize- Löst aus:
IllegalStateException- if the keys and values do not match in lenghtIllegalStateException- if the loadfactor is either below/equal to 0 or above/equal to 1
-
Int2LongLinkedOpenHashMap
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 map
-
Int2LongLinkedOpenHashMap
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 resize- Löst aus:
IllegalStateException- if the loadfactor is either below/equal to 0 or above/equal to 1
-
Int2LongLinkedOpenHashMap
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 map
-
Int2LongLinkedOpenHashMap
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 resize- Löst aus:
IllegalStateException- if the loadfactor is either below/equal to 0 or above/equal to 1
-
-
Methodendetails
-
putAndMoveToFirst
public long putAndMoveToFirst(int key, long value) Beschreibung aus Schnittstelle kopiert:Int2LongOrderedMapA customized put method that allows you to insert into the first index.- Angegeben von:
putAndMoveToFirstin SchnittstelleInt2LongOrderedMap- 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 long putAndMoveToLast(int key, long value) Beschreibung aus Schnittstelle kopiert:Int2LongOrderedMapA customized put method that allows you to insert into the last index. (This may be nessesary depending on the implementation)- Angegeben von:
putAndMoveToLastin SchnittstelleInt2LongOrderedMap- 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:Int2LongOrderedMapA specific move method to move a given key/value to the first index.- Angegeben von:
moveToFirstin SchnittstelleInt2LongOrderedMap- 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:Int2LongOrderedMapA specific move method to move a given key/value to the last index.- Angegeben von:
moveToLastin SchnittstelleInt2LongOrderedMap- Parameter:
key- that should be moved to the first last- Gibt zurück:
- true if the value was moved.
-
getAndMoveToFirst
public long getAndMoveToFirst(int key) Beschreibung aus Schnittstelle kopiert:Int2LongOrderedMapA Specific get method that allows to move teh given key/value int the first index.- Angegeben von:
getAndMoveToFirstin SchnittstelleInt2LongOrderedMap- Parameter:
key- that is searched for- Gibt zurück:
- the given value for the requested key or default return value
-
getAndMoveToLast
public long getAndMoveToLast(int key) Beschreibung aus Schnittstelle kopiert:Int2LongOrderedMapA Specific get method that allows to move teh given key/value int the last index.- Angegeben von:
getAndMoveToLastin SchnittstelleInt2LongOrderedMap- Parameter:
key- that is searched for- Gibt zurück:
- the given value for the requested key or default return value
-
containsValue
public boolean containsValue(long value) Beschreibung aus Schnittstelle kopiert:Int2LongMapType Specific method to reduce boxing/unboxing of values- Angegeben von:
containsValuein SchnittstelleInt2LongMap- Setzt außer Kraft:
containsValuein KlasseInt2LongOpenHashMap- Parameter:
value- element that is searched for- Gibt zurück:
- if the value is present
-
containsValue
Veraltet.- Angegeben von:
containsValuein SchnittstelleInt2LongMap- Angegeben von:
containsValuein SchnittstelleMap<Integer,Long> - Setzt außer Kraft:
containsValuein KlasseInt2LongOpenHashMap- Parameter:
value- that is searched for.- Gibt zurück:
- true if found
- Siehe auch:
-
copy
Beschreibung aus Schnittstelle kopiert:Int2LongMapA 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 SchnittstelleInt2LongMap- Angegeben von:
copyin SchnittstelleInt2LongOrderedMap- Setzt außer Kraft:
copyin KlasseInt2LongOpenHashMap- Gibt zurück:
- a Shallow Copy of the Map
-
firstIntKey
public int firstIntKey()Beschreibung aus Schnittstelle kopiert:Int2LongOrderedMapA method to get the first Key of a Map.- Angegeben von:
firstIntKeyin SchnittstelleInt2LongOrderedMap- Gibt zurück:
- the first key in the map
-
pollFirstIntKey
public int pollFirstIntKey()Beschreibung aus Schnittstelle kopiert:Int2LongOrderedMapA method to get and remove the first Key of a Map.- Angegeben von:
pollFirstIntKeyin SchnittstelleInt2LongOrderedMap- Gibt zurück:
- the first key in the map
-
lastIntKey
public int lastIntKey()Beschreibung aus Schnittstelle kopiert:Int2LongOrderedMapA method to get the last Key of a Map.- Angegeben von:
lastIntKeyin SchnittstelleInt2LongOrderedMap- Gibt zurück:
- the last key in the map
-
pollLastIntKey
public int pollLastIntKey()Beschreibung aus Schnittstelle kopiert:Int2LongOrderedMapA method to get and remove the last Key of a Map.- Angegeben von:
pollLastIntKeyin SchnittstelleInt2LongOrderedMap- Gibt zurück:
- the last key in the map
-
firstLongValue
public long firstLongValue()Beschreibung aus Schnittstelle kopiert:Int2LongOrderedMapA method to get the first Value of a Map.- Angegeben von:
firstLongValuein SchnittstelleInt2LongOrderedMap- Gibt zurück:
- the first key in the map
-
lastLongValue
public long lastLongValue()Beschreibung aus Schnittstelle kopiert:Int2LongOrderedMapA method to get the last Value of a Map.- Angegeben von:
lastLongValuein SchnittstelleInt2LongOrderedMap- Gibt zurück:
- the last key in the map
-
int2LongEntrySet
Beschreibung aus Schnittstelle kopiert:Int2LongMapType Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.- Angegeben von:
int2LongEntrySetin SchnittstelleInt2LongMap- Angegeben von:
int2LongEntrySetin SchnittstelleInt2LongOrderedMap- Setzt außer Kraft:
int2LongEntrySetin KlasseInt2LongOpenHashMap- Gibt zurück:
- a EntrySet of the collection
-
keySet
- Angegeben von:
keySetin SchnittstelleInt2LongMap- Angegeben von:
keySetin SchnittstelleInt2LongOrderedMap- Angegeben von:
keySetin SchnittstelleMap<Integer,Long> - Setzt außer Kraft:
keySetin KlasseInt2LongOpenHashMap
-
values
- Angegeben von:
valuesin SchnittstelleInt2LongMap- Angegeben von:
valuesin SchnittstelleMap<Integer,Long> - Setzt außer Kraft:
valuesin KlasseInt2LongOpenHashMap
-
forEach
Beschreibung aus Schnittstelle kopiert:Int2LongMapType Specific forEach method to reduce boxing/unboxing- Angegeben von:
forEachin SchnittstelleInt2LongMap- Setzt außer Kraft:
forEachin KlasseInt2LongOpenHashMap- 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 KlasseInt2LongOpenHashMap- Parameter:
size- the amount of elements that should be allowed
-