public class Short2IntLinkedOpenCustomHashMap extends Short2IntOpenCustomHashMap implements Short2IntOrderedMap
AbstractShort2IntMap.BasicEntryjava.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Short2IntOrderedMap.FastOrderedSetShort2IntMap.BuilderCache, Short2IntMap.Entry, Short2IntMap.FastEntrySet, Short2IntMap.MapBuilder| Constructor and Description |
|---|
Short2IntLinkedOpenCustomHashMap(int minCapacity,
float loadFactor,
ShortStrategy strategy)
Constructor that defines the minimum capacity and load factor
|
Short2IntLinkedOpenCustomHashMap(int minCapacity,
ShortStrategy strategy)
Constructor that defines the minimum capacity
|
Short2IntLinkedOpenCustomHashMap(java.util.Map<? extends java.lang.Short,? extends java.lang.Integer> map,
float loadFactor,
ShortStrategy strategy)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Short2IntLinkedOpenCustomHashMap(java.util.Map<? extends java.lang.Short,? extends java.lang.Integer> map,
ShortStrategy strategy)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Short2IntLinkedOpenCustomHashMap(short[] keys,
int[] values,
float loadFactor,
ShortStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Short2IntLinkedOpenCustomHashMap(short[] keys,
int[] values,
ShortStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Short2IntLinkedOpenCustomHashMap(java.lang.Short[] keys,
java.lang.Integer[] values,
float loadFactor,
ShortStrategy strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Short2IntLinkedOpenCustomHashMap(java.lang.Short[] keys,
java.lang.Integer[] values,
ShortStrategy strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Short2IntLinkedOpenCustomHashMap(Short2IntMap map,
float loadFactor,
ShortStrategy strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Short2IntLinkedOpenCustomHashMap(Short2IntMap map,
ShortStrategy strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Short2IntLinkedOpenCustomHashMap(ShortStrategy strategy)
Default Constructor
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
void |
clearAndTrim(int size)
Trims the collection down to the requested size and clears all elements while doing so
|
Short2IntLinkedOpenCustomHashMap |
copy()
A Function that does a shallow clone of the Map itself.
|
int |
firstIntValue()
A method to get the first Value of a Map.
|
short |
firstShortKey()
A method to get the first Key of a Map.
|
void |
forEach(ShortIntConsumer action)
Type Specific forEach method to reduce boxing/unboxing
|
int |
getAndMoveToFirst(short key)
A Specific get method that allows to move teh given key/value int the first index.
|
int |
getAndMoveToLast(short key)
A Specific get method that allows to move teh given key/value int the last index.
|
ShortOrderedSet |
keySet() |
int |
lastIntValue()
A method to get the last Value of a Map.
|
short |
lastShortKey()
A method to get the last Key of a Map.
|
boolean |
moveToFirst(short key)
A specific move method to move a given key/value to the first index.
|
boolean |
moveToLast(short key)
A specific move method to move a given key/value to the last index.
|
short |
pollFirstShortKey()
A method to get and remove the first Key of a Map.
|
short |
pollLastShortKey()
A method to get and remove the last Key of a Map.
|
int |
putAndMoveToFirst(short key,
int value)
A customized put method that allows you to insert into the first index.
|
int |
putAndMoveToLast(short key,
int value)
A customized put method that allows you to insert into the last index.
|
ObjectOrderedSet<Short2IntMap.Entry> |
short2IntEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
IntCollection |
values() |
addTo, computeInt, computeIntIfAbsent, computeIntIfPresent, containsKey, containsKey, containsValue, containsValue, get, get, getOrDefault, mergeAllInt, mergeInt, put, putIfAbsent, remove, remove, remove, remove, removeOrDefault, replace, replace, size, subFrom, supplyIntIfAbsent, trimaddToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, replaceInts, replaceInts, setDefaultReturnValuesynchronize, synchronize, unmodifiableaddTo, addToAll, applyAsInt, builder, compute, computeIfAbsent, computeIfPresent, computeInt, computeIntIfAbsent, computeIntIfPresent, containsKey, containsKey, containsValue, containsValue, 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, supplyIntIfAbsentclearAndTrim, trimpublic Short2IntLinkedOpenCustomHashMap(ShortStrategy strategy)
strategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Short2IntLinkedOpenCustomHashMap(int minCapacity,
ShortStrategy 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 Short2IntLinkedOpenCustomHashMap(int minCapacity,
float loadFactor,
ShortStrategy 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 Short2IntLinkedOpenCustomHashMap(java.lang.Short[] keys,
java.lang.Integer[] values,
ShortStrategy 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 Short2IntLinkedOpenCustomHashMap(java.lang.Short[] keys,
java.lang.Integer[] values,
float loadFactor,
ShortStrategy 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 Short2IntLinkedOpenCustomHashMap(short[] keys,
int[] values,
ShortStrategy 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 Short2IntLinkedOpenCustomHashMap(short[] keys,
int[] values,
float loadFactor,
ShortStrategy 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 Short2IntLinkedOpenCustomHashMap(java.util.Map<? extends java.lang.Short,? extends java.lang.Integer> map,
ShortStrategy strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Short2IntLinkedOpenCustomHashMap(java.util.Map<? extends java.lang.Short,? extends java.lang.Integer> map,
float loadFactor,
ShortStrategy 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 Short2IntLinkedOpenCustomHashMap(Short2IntMap map, ShortStrategy strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Short2IntLinkedOpenCustomHashMap(Short2IntMap map, float loadFactor, ShortStrategy 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 int putAndMoveToFirst(short key,
int value)
Short2IntOrderedMapputAndMoveToFirst in interface Short2IntOrderedMapkey - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public int putAndMoveToLast(short key,
int value)
Short2IntOrderedMapputAndMoveToLast in interface Short2IntOrderedMapkey - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public boolean moveToFirst(short key)
Short2IntOrderedMapmoveToFirst in interface Short2IntOrderedMapkey - that should be moved to the first indexpublic boolean moveToLast(short key)
Short2IntOrderedMapmoveToLast in interface Short2IntOrderedMapkey - that should be moved to the first lastpublic int getAndMoveToFirst(short key)
Short2IntOrderedMapgetAndMoveToFirst in interface Short2IntOrderedMapkey - that is searched forpublic int getAndMoveToLast(short key)
Short2IntOrderedMapgetAndMoveToLast in interface Short2IntOrderedMapkey - that is searched forpublic Short2IntLinkedOpenCustomHashMap copy()
Short2IntMapcopy in interface Short2IntMapcopy in interface Short2IntOrderedMapcopy in class Short2IntOpenCustomHashMappublic short firstShortKey()
Short2IntOrderedMapfirstShortKey in interface Short2IntOrderedMappublic short pollFirstShortKey()
Short2IntOrderedMappollFirstShortKey in interface Short2IntOrderedMappublic short lastShortKey()
Short2IntOrderedMaplastShortKey in interface Short2IntOrderedMappublic short pollLastShortKey()
Short2IntOrderedMappollLastShortKey in interface Short2IntOrderedMappublic int firstIntValue()
Short2IntOrderedMapfirstIntValue in interface Short2IntOrderedMappublic int lastIntValue()
Short2IntOrderedMaplastIntValue in interface Short2IntOrderedMappublic ObjectOrderedSet<Short2IntMap.Entry> short2IntEntrySet()
Short2IntMapshort2IntEntrySet in interface Short2IntMapshort2IntEntrySet in interface Short2IntOrderedMapshort2IntEntrySet in class Short2IntOpenCustomHashMappublic ShortOrderedSet keySet()
keySet in interface java.util.Map<java.lang.Short,java.lang.Integer>keySet in interface Short2IntMapkeySet in interface Short2IntOrderedMapkeySet in class Short2IntOpenCustomHashMappublic IntCollection values()
values in interface java.util.Map<java.lang.Short,java.lang.Integer>values in interface Short2IntMapvalues in class Short2IntOpenCustomHashMappublic void forEach(ShortIntConsumer action)
Short2IntMapforEach in interface Short2IntMapforEach in class Short2IntOpenCustomHashMapaction - processor of the values that are iterator overpublic void clear()
clear in interface java.util.Map<java.lang.Short,java.lang.Integer>clear in class Short2IntOpenCustomHashMappublic void clearAndTrim(int size)
ITrimmableclearAndTrim in interface ITrimmableclearAndTrim in class Short2IntOpenCustomHashMapsize - the amount of elements that should be allowed