public class Int2ShortLinkedOpenCustomHashMap extends Int2ShortOpenCustomHashMap implements Int2ShortOrderedMap
AbstractInt2ShortMap.BasicEntryjava.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Int2ShortOrderedMap.FastOrderedSetInt2ShortMap.BuilderCache, Int2ShortMap.Entry, Int2ShortMap.FastEntrySet, Int2ShortMap.MapBuilder| Constructor and Description |
|---|
Int2ShortLinkedOpenCustomHashMap(int[] keys,
short[] values,
float loadFactor,
IntStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Int2ShortLinkedOpenCustomHashMap(int[] keys,
short[] values,
IntStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Int2ShortLinkedOpenCustomHashMap(Int2ShortMap 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.
|
Int2ShortLinkedOpenCustomHashMap(Int2ShortMap map,
IntStrategy strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Int2ShortLinkedOpenCustomHashMap(java.lang.Integer[] keys,
java.lang.Short[] values,
float loadFactor,
IntStrategy strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Int2ShortLinkedOpenCustomHashMap(java.lang.Integer[] keys,
java.lang.Short[] values,
IntStrategy strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Int2ShortLinkedOpenCustomHashMap(int minCapacity,
float loadFactor,
IntStrategy strategy)
Constructor that defines the minimum capacity and load factor
|
Int2ShortLinkedOpenCustomHashMap(int minCapacity,
IntStrategy strategy)
Constructor that defines the minimum capacity
|
Int2ShortLinkedOpenCustomHashMap(IntStrategy strategy)
Default Constructor
|
Int2ShortLinkedOpenCustomHashMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Short> map,
float loadFactor,
IntStrategy strategy)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Int2ShortLinkedOpenCustomHashMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Short> map,
IntStrategy strategy)
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() |
void |
clearAndTrim(int size)
Trims the collection down to the requested size and clears all elements while doing so
|
Int2ShortLinkedOpenCustomHashMap |
copy()
A Function that does a shallow clone of the Map itself.
|
int |
firstIntKey()
A method to get the first Key of a Map.
|
short |
firstShortValue()
A method to get the first Value of a Map.
|
void |
forEach(IntShortConsumer action)
Type Specific forEach method to reduce boxing/unboxing
|
short |
getAndMoveToFirst(int key)
A Specific get method that allows to move teh given key/value int the first index.
|
short |
getAndMoveToLast(int key)
A Specific get method that allows to move teh given key/value int the last index.
|
ObjectOrderedSet<Int2ShortMap.Entry> |
int2ShortEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
IntOrderedSet |
keySet() |
int |
lastIntKey()
A method to get the last Key of a Map.
|
short |
lastShortValue()
A method to get the last Value of a Map.
|
boolean |
moveToFirst(int key)
A specific move method to move a given key/value to the first index.
|
boolean |
moveToLast(int key)
A specific move method to move a given key/value to the last index.
|
int |
pollFirstIntKey()
A method to get and remove the first Key of a Map.
|
int |
pollLastIntKey()
A method to get and remove the last Key of a Map.
|
short |
putAndMoveToFirst(int key,
short value)
A customized put method that allows you to insert into the first index.
|
short |
putAndMoveToLast(int key,
short value)
A customized put method that allows you to insert into the last index.
|
ShortCollection |
values() |
addTo, computeShort, computeShortIfAbsent, computeShortIfPresent, containsKey, containsKey, containsValue, containsValue, get, get, getOrDefault, mergeAllShort, mergeShort, put, putIfAbsent, remove, remove, remove, remove, removeOrDefault, replace, replace, size, subFrom, supplyShortIfAbsent, trimaddToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, replaceShorts, replaceShorts, setDefaultReturnValuesynchronize, synchronize, unmodifiableaddTo, addToAll, applyAsShort, builder, compute, computeIfAbsent, computeIfPresent, computeShort, computeShortIfAbsent, computeShortIfPresent, containsKey, containsKey, containsValue, containsValue, entrySet, forEach, get, get, getDefaultReturnValue, getOrDefault, getOrDefault, merge, mergeAllShort, mergeShort, put, put, put, put, putAll, putAll, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, putIfAbsent, remove, remove, remove, remove, removeOrDefault, replace, replace, replace, replace, replaceAll, replaceShorts, replaceShorts, setDefaultReturnValue, subFrom, supplyShortIfAbsentclearAndTrim, trimpublic Int2ShortLinkedOpenCustomHashMap(IntStrategy strategy)
strategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Int2ShortLinkedOpenCustomHashMap(int minCapacity,
IntStrategy 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 Int2ShortLinkedOpenCustomHashMap(int minCapacity,
float loadFactor,
IntStrategy 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 Int2ShortLinkedOpenCustomHashMap(java.lang.Integer[] keys,
java.lang.Short[] values,
IntStrategy 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 Int2ShortLinkedOpenCustomHashMap(java.lang.Integer[] keys,
java.lang.Short[] values,
float loadFactor,
IntStrategy 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 Int2ShortLinkedOpenCustomHashMap(int[] keys,
short[] values,
IntStrategy 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 Int2ShortLinkedOpenCustomHashMap(int[] keys,
short[] values,
float loadFactor,
IntStrategy 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 Int2ShortLinkedOpenCustomHashMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Short> map,
IntStrategy strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Int2ShortLinkedOpenCustomHashMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Short> map,
float loadFactor,
IntStrategy 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 Int2ShortLinkedOpenCustomHashMap(Int2ShortMap map, IntStrategy strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Int2ShortLinkedOpenCustomHashMap(Int2ShortMap map, float loadFactor, IntStrategy 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 short putAndMoveToFirst(int key,
short value)
Int2ShortOrderedMapputAndMoveToFirst in interface Int2ShortOrderedMapkey - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public short putAndMoveToLast(int key,
short value)
Int2ShortOrderedMapputAndMoveToLast in interface Int2ShortOrderedMapkey - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public boolean moveToFirst(int key)
Int2ShortOrderedMapmoveToFirst in interface Int2ShortOrderedMapkey - that should be moved to the first indexpublic boolean moveToLast(int key)
Int2ShortOrderedMapmoveToLast in interface Int2ShortOrderedMapkey - that should be moved to the first lastpublic short getAndMoveToFirst(int key)
Int2ShortOrderedMapgetAndMoveToFirst in interface Int2ShortOrderedMapkey - that is searched forpublic short getAndMoveToLast(int key)
Int2ShortOrderedMapgetAndMoveToLast in interface Int2ShortOrderedMapkey - that is searched forpublic Int2ShortLinkedOpenCustomHashMap copy()
Int2ShortMapcopy in interface Int2ShortMapcopy in interface Int2ShortOrderedMapcopy in class Int2ShortOpenCustomHashMappublic int firstIntKey()
Int2ShortOrderedMapfirstIntKey in interface Int2ShortOrderedMappublic int pollFirstIntKey()
Int2ShortOrderedMappollFirstIntKey in interface Int2ShortOrderedMappublic int lastIntKey()
Int2ShortOrderedMaplastIntKey in interface Int2ShortOrderedMappublic int pollLastIntKey()
Int2ShortOrderedMappollLastIntKey in interface Int2ShortOrderedMappublic short firstShortValue()
Int2ShortOrderedMapfirstShortValue in interface Int2ShortOrderedMappublic short lastShortValue()
Int2ShortOrderedMaplastShortValue in interface Int2ShortOrderedMappublic ObjectOrderedSet<Int2ShortMap.Entry> int2ShortEntrySet()
Int2ShortMapint2ShortEntrySet in interface Int2ShortMapint2ShortEntrySet in interface Int2ShortOrderedMapint2ShortEntrySet in class Int2ShortOpenCustomHashMappublic IntOrderedSet keySet()
keySet in interface java.util.Map<java.lang.Integer,java.lang.Short>keySet in interface Int2ShortMapkeySet in interface Int2ShortOrderedMapkeySet in class Int2ShortOpenCustomHashMappublic ShortCollection values()
values in interface java.util.Map<java.lang.Integer,java.lang.Short>values in interface Int2ShortMapvalues in class Int2ShortOpenCustomHashMappublic void forEach(IntShortConsumer action)
Int2ShortMapforEach in interface Int2ShortMapforEach in class Int2ShortOpenCustomHashMapaction - processor of the values that are iterator overpublic void clear()
clear in interface java.util.Map<java.lang.Integer,java.lang.Short>clear in class Int2ShortOpenCustomHashMappublic void clearAndTrim(int size)
ITrimmableclearAndTrim in interface ITrimmableclearAndTrim in class Int2ShortOpenCustomHashMapsize - the amount of elements that should be allowed