Modul speiger.src.collections
Klasse Char2IntLinkedOpenHashMap
java.lang.Object
java.util.AbstractMap<Character,Integer>
speiger.src.collections.chars.maps.abstracts.AbstractChar2IntMap
speiger.src.collections.chars.maps.impl.hash.Char2IntOpenHashMap
speiger.src.collections.chars.maps.impl.hash.Char2IntLinkedOpenHashMap
- Alle implementierten Schnittstellen:
Map<Character,,Integer> Char2IntFunction,Char2IntMap,Char2IntOrderedMap,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.chars.maps.abstracts.AbstractChar2IntMap
AbstractChar2IntMap.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.chars.maps.interfaces.Char2IntMap
Char2IntMap.BuilderCache, Char2IntMap.Entry, Char2IntMap.FastEntrySet, Char2IntMap.MapBuilderVon Schnittstelle geerbte verschachtelte Klassen/Schnittstellen speiger.src.collections.chars.maps.interfaces.Char2IntOrderedMap
Char2IntOrderedMap.FastOrderedSet -
Konstruktorübersicht
KonstruktorenKonstruktorBeschreibungDefault ConstructorChar2IntLinkedOpenHashMap(char[] keys, int[] values) Helper constructor that allow to create a map from unboxed valuesChar2IntLinkedOpenHashMap(char[] keys, int[] values, float loadFactor) Helper constructor that allow to create a map from unboxed valuesChar2IntLinkedOpenHashMap(int minCapacity) Constructor that defines the minimum capacityChar2IntLinkedOpenHashMap(int minCapacity, float loadFactor) Constructor that defines the minimum capacity and load factorChar2IntLinkedOpenHashMap(Character[] keys, Integer[] values) Helper constructor that allow to create a map from boxed values (it will unbox them)Char2IntLinkedOpenHashMap(Character[] keys, Integer[] values, float loadFactor) Helper constructor that allow to create a map from boxed values (it will unbox them)Char2IntLinkedOpenHashMap(Map<? extends Character, ? extends Integer> map) A Helper constructor that allows to create a Map with exactly the same values as the provided map.Char2IntLinkedOpenHashMap(Map<? extends Character, ? extends Integer> 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.Char2IntLinkedOpenHashMap(Char2IntMap 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 TypMethodeBeschreibungType Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.voidclear()voidclearAndTrim(int size) Trims the collection down to the requested size and clears all elements while doing sobooleancontainsValue(int 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.charA method to get the first Key of a Map.intA method to get the first Value of a Map.voidforEach(CharIntConsumer action) Type Specific forEach method to reduce boxing/unboxingintgetAndMoveToFirst(char key) A Specific get method that allows to move teh given key/value int the first index.intgetAndMoveToLast(char key) A Specific get method that allows to move teh given key/value int the last index.keySet()charA method to get the last Key of a Map.intA method to get the last Value of a Map.booleanmoveToFirst(char key) A specific move method to move a given key/value to the first index.booleanmoveToLast(char key) A specific move method to move a given key/value to the last index.charA method to get and remove the first Key of a Map.charA method to get and remove the last Key of a Map.intputAndMoveToFirst(char key, int value) A customized put method that allows you to insert into the first index.intputAndMoveToLast(char key, int value) A customized put method that allows you to insert into the last index.values()Von Klasse geerbte Methoden speiger.src.collections.chars.maps.impl.hash.Char2IntOpenHashMap
addTo, computeInt, computeIntIfAbsent, computeIntIfAbsentNonDefault, computeIntIfPresent, computeIntIfPresentNonDefault, computeIntNonDefault, containsKey, containsKey, get, get, getOrDefault, mergeAllInt, mergeInt, put, putIfAbsent, remove, remove, remove, remove, removeOrDefault, replace, replace, size, subFrom, supplyIntIfAbsent, supplyIntIfAbsentNonDefault, trimVon Klasse geerbte Methoden speiger.src.collections.chars.maps.abstracts.AbstractChar2IntMap
addToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, replaceInts, replaceInts, setDefaultReturnValueVon Klasse geerbte Methoden java.util.AbstractMap
isEmpty, toStringVon Schnittstelle geerbte Methoden speiger.src.collections.chars.maps.interfaces.Char2IntMap
addTo, addToAll, applyAsInt, compute, computeIfAbsent, computeIfPresent, computeInt, computeIntIfAbsent, computeIntIfAbsentNonDefault, computeIntIfPresent, computeIntIfPresentNonDefault, computeIntNonDefault, containsKey, containsKey, entrySet, forEach, get, get, getDefaultReturnValue, getOrDefault, getOrDefault, merge, mergeAllInt, mergeInt, put, put, put, put, putAll, putAll, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, putIfAbsent, remove, remove, remove, remove, removeOrDefault, replace, replace, replace, replace, replaceAll, replaceInts, replaceInts, setDefaultReturnValue, subFrom, supplyIntIfAbsent, supplyIntIfAbsentNonDefaultVon Schnittstelle geerbte Methoden speiger.src.collections.chars.maps.interfaces.Char2IntOrderedMap
synchronize, synchronize, unmodifiableVon Schnittstelle geerbte Methoden speiger.src.collections.utils.ITrimmable
clearAndTrim, trim
-
Konstruktordetails
-
Char2IntLinkedOpenHashMap
public Char2IntLinkedOpenHashMap()Default Constructor -
Char2IntLinkedOpenHashMap
public Char2IntLinkedOpenHashMap(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
-
Char2IntLinkedOpenHashMap
public Char2IntLinkedOpenHashMap(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
-
Char2IntLinkedOpenHashMap
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
-
Char2IntLinkedOpenHashMap
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
-
Char2IntLinkedOpenHashMap
public Char2IntLinkedOpenHashMap(char[] keys, int[] 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
-
Char2IntLinkedOpenHashMap
public Char2IntLinkedOpenHashMap(char[] keys, int[] 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
-
Char2IntLinkedOpenHashMap
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
-
Char2IntLinkedOpenHashMap
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
-
Char2IntLinkedOpenHashMap
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
-
Char2IntLinkedOpenHashMap
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 int putAndMoveToFirst(char key, int value) Beschreibung aus Schnittstelle kopiert:Char2IntOrderedMapA customized put method that allows you to insert into the first index.- Angegeben von:
putAndMoveToFirstin SchnittstelleChar2IntOrderedMap- 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 int putAndMoveToLast(char key, int value) Beschreibung aus Schnittstelle kopiert:Char2IntOrderedMapA customized put method that allows you to insert into the last index. (This may be nessesary depending on the implementation)- Angegeben von:
putAndMoveToLastin SchnittstelleChar2IntOrderedMap- 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(char key) Beschreibung aus Schnittstelle kopiert:Char2IntOrderedMapA specific move method to move a given key/value to the first index.- Angegeben von:
moveToFirstin SchnittstelleChar2IntOrderedMap- Parameter:
key- that should be moved to the first index- Gibt zurück:
- true if the value was moved.
-
moveToLast
public boolean moveToLast(char key) Beschreibung aus Schnittstelle kopiert:Char2IntOrderedMapA specific move method to move a given key/value to the last index.- Angegeben von:
moveToLastin SchnittstelleChar2IntOrderedMap- Parameter:
key- that should be moved to the first last- Gibt zurück:
- true if the value was moved.
-
getAndMoveToFirst
public int getAndMoveToFirst(char key) Beschreibung aus Schnittstelle kopiert:Char2IntOrderedMapA Specific get method that allows to move teh given key/value int the first index.- Angegeben von:
getAndMoveToFirstin SchnittstelleChar2IntOrderedMap- Parameter:
key- that is searched for- Gibt zurück:
- the given value for the requested key or default return value
-
getAndMoveToLast
public int getAndMoveToLast(char key) Beschreibung aus Schnittstelle kopiert:Char2IntOrderedMapA Specific get method that allows to move teh given key/value int the last index.- Angegeben von:
getAndMoveToLastin SchnittstelleChar2IntOrderedMap- Parameter:
key- that is searched for- Gibt zurück:
- the given value for the requested key or default return value
-
containsValue
public boolean containsValue(int value) Beschreibung aus Schnittstelle kopiert:Char2IntMapType Specific method to reduce boxing/unboxing of values- Angegeben von:
containsValuein SchnittstelleChar2IntMap- Setzt außer Kraft:
containsValuein KlasseChar2IntOpenHashMap- Parameter:
value- element that is searched for- Gibt zurück:
- if the value is present
-
containsValue
Veraltet.- Angegeben von:
containsValuein SchnittstelleChar2IntMap- Angegeben von:
containsValuein SchnittstelleMap<Character,Integer> - Setzt außer Kraft:
containsValuein KlasseChar2IntOpenHashMap- Parameter:
value- that is searched for.- Gibt zurück:
- true if found
- Siehe auch:
-
copy
Beschreibung aus Schnittstelle kopiert:Char2IntMapA 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 SchnittstelleChar2IntMap- Angegeben von:
copyin SchnittstelleChar2IntOrderedMap- Setzt außer Kraft:
copyin KlasseChar2IntOpenHashMap- Gibt zurück:
- a Shallow Copy of the Map
-
firstCharKey
public char firstCharKey()Beschreibung aus Schnittstelle kopiert:Char2IntOrderedMapA method to get the first Key of a Map.- Angegeben von:
firstCharKeyin SchnittstelleChar2IntOrderedMap- Gibt zurück:
- the first key in the map
-
pollFirstCharKey
public char pollFirstCharKey()Beschreibung aus Schnittstelle kopiert:Char2IntOrderedMapA method to get and remove the first Key of a Map.- Angegeben von:
pollFirstCharKeyin SchnittstelleChar2IntOrderedMap- Gibt zurück:
- the first key in the map
-
lastCharKey
public char lastCharKey()Beschreibung aus Schnittstelle kopiert:Char2IntOrderedMapA method to get the last Key of a Map.- Angegeben von:
lastCharKeyin SchnittstelleChar2IntOrderedMap- Gibt zurück:
- the last key in the map
-
pollLastCharKey
public char pollLastCharKey()Beschreibung aus Schnittstelle kopiert:Char2IntOrderedMapA method to get and remove the last Key of a Map.- Angegeben von:
pollLastCharKeyin SchnittstelleChar2IntOrderedMap- Gibt zurück:
- the last key in the map
-
firstIntValue
public int firstIntValue()Beschreibung aus Schnittstelle kopiert:Char2IntOrderedMapA method to get the first Value of a Map.- Angegeben von:
firstIntValuein SchnittstelleChar2IntOrderedMap- Gibt zurück:
- the first key in the map
-
lastIntValue
public int lastIntValue()Beschreibung aus Schnittstelle kopiert:Char2IntOrderedMapA method to get the last Value of a Map.- Angegeben von:
lastIntValuein SchnittstelleChar2IntOrderedMap- Gibt zurück:
- the last key in the map
-
char2IntEntrySet
Beschreibung aus Schnittstelle kopiert:Char2IntMapType Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.- Angegeben von:
char2IntEntrySetin SchnittstelleChar2IntMap- Angegeben von:
char2IntEntrySetin SchnittstelleChar2IntOrderedMap- Setzt außer Kraft:
char2IntEntrySetin KlasseChar2IntOpenHashMap- Gibt zurück:
- a EntrySet of the collection
-
keySet
- Angegeben von:
keySetin SchnittstelleChar2IntMap- Angegeben von:
keySetin SchnittstelleChar2IntOrderedMap- Angegeben von:
keySetin SchnittstelleMap<Character,Integer> - Setzt außer Kraft:
keySetin KlasseChar2IntOpenHashMap
-
values
- Angegeben von:
valuesin SchnittstelleChar2IntMap- Angegeben von:
valuesin SchnittstelleMap<Character,Integer> - Setzt außer Kraft:
valuesin KlasseChar2IntOpenHashMap
-
forEach
Beschreibung aus Schnittstelle kopiert:Char2IntMapType Specific forEach method to reduce boxing/unboxing- Angegeben von:
forEachin SchnittstelleChar2IntMap- Setzt außer Kraft:
forEachin KlasseChar2IntOpenHashMap- 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 KlasseChar2IntOpenHashMap- Parameter:
size- the amount of elements that should be allowed
-