public class Short2LongOpenCustomHashMap extends AbstractShort2LongMap implements ITrimmable
AbstractShort2LongMap.BasicEntryjava.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Short2LongMap.BuilderCache, Short2LongMap.Entry, Short2LongMap.FastEntrySet, Short2LongMap.MapBuilder| Constructor and Description |
|---|
Short2LongOpenCustomHashMap(int minCapacity,
float loadFactor,
ShortStrategy strategy)
Constructor that defines the minimum capacity and load factor
|
Short2LongOpenCustomHashMap(int minCapacity,
ShortStrategy strategy)
Constructor that defines the minimum capacity
|
Short2LongOpenCustomHashMap(java.util.Map<? extends java.lang.Short,? extends java.lang.Long> map,
float loadFactor,
ShortStrategy strategy)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Short2LongOpenCustomHashMap(java.util.Map<? extends java.lang.Short,? extends java.lang.Long> map,
ShortStrategy strategy)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Short2LongOpenCustomHashMap(short[] keys,
long[] values,
float loadFactor,
ShortStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Short2LongOpenCustomHashMap(java.lang.Short[] keys,
java.lang.Long[] values,
float loadFactor,
ShortStrategy strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Short2LongOpenCustomHashMap(short[] keys,
long[] values,
ShortStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Short2LongOpenCustomHashMap(java.lang.Short[] keys,
java.lang.Long[] values,
ShortStrategy strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Short2LongOpenCustomHashMap(Short2LongMap 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.
|
Short2LongOpenCustomHashMap(Short2LongMap map,
ShortStrategy strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Short2LongOpenCustomHashMap(ShortStrategy strategy)
Default Contstructor
|
| Modifier and Type | Method and Description |
|---|---|
long |
addTo(short key,
long value)
A Helper method to add a primitives together.
|
void |
clear() |
void |
clearAndTrim(int size)
Trims the collection down to the requested size and clears all elements while doing so
|
long |
computeLong(short key,
ShortLongUnaryOperator mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
long |
computeLongIfAbsent(short key,
Short2LongFunction mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
long |
computeLongIfPresent(short key,
ShortLongUnaryOperator mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
boolean |
containsKey(java.lang.Object key)
Deprecated.
|
boolean |
containsKey(short key)
Type Specific method to reduce boxing/unboxing of values
|
boolean |
containsValue(long value)
Type Specific method to reduce boxing/unboxing of values
|
boolean |
containsValue(java.lang.Object value)
Deprecated.
|
Short2LongOpenCustomHashMap |
copy()
A Function that does a shallow clone of the Map itself.
|
void |
forEach(ShortLongConsumer action)
Type Specific forEach method to reduce boxing/unboxing
|
java.lang.Long |
get(java.lang.Object key) |
long |
get(short key)
A Type Specific get method to reduce boxing/unboxing
|
long |
getOrDefault(short key,
long defaultValue)
A Type Specific getOrDefault method to reduce boxing/unboxing
|
ShortSet |
keySet() |
void |
mergeAllLong(Short2LongMap m,
LongLongUnaryOperator mappingFunction)
A Bulk method for merging Maps.
|
long |
mergeLong(short key,
long value,
LongLongUnaryOperator mappingFunction)
A Type Specific merge method to reduce boxing/unboxing
|
long |
put(short key,
long value)
Type Specific method to reduce boxing/unboxing of values
|
long |
putIfAbsent(short key,
long value)
Type Specific method to reduce boxing/unboxing of values
|
java.lang.Long |
remove(java.lang.Object key) |
boolean |
remove(java.lang.Object key,
java.lang.Object value) |
long |
remove(short key)
Type Specific remove function to reduce boxing/unboxing
|
boolean |
remove(short key,
long value)
Type Specific remove function to reduce boxing/unboxing
|
long |
removeOrDefault(short key,
long defaultValue)
Type-Specific Remove function with a default return value if wanted.
|
long |
replace(short key,
long value)
A Type Specific replace method to reduce boxing/unboxing replace an existing value
|
boolean |
replace(short key,
long oldValue,
long newValue)
A Type Specific replace method to replace an existing value
|
ObjectSet<Short2LongMap.Entry> |
short2LongEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
int |
size() |
long |
subFrom(short key,
long value)
A Helper method to subtract from primitive from each other.
|
long |
supplyLongIfAbsent(short key,
LongSupplier valueProvider)
A Supplier based computeIfAbsent function to fill the most used usecase of this function
|
boolean |
trim(int size)
Trims the original collection down to the size of the current elements or the requested size depending which is bigger
|
LongCollection |
values() |
addToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, replaceLongs, replaceLongs, setDefaultReturnValueclearAndTrim, trimbuilder, compute, computeIfAbsent, computeIfPresent, forEach, merge, putAll, putAll, putIfAbsent, replace, replace, replaceAll, synchronize, synchronize, unmodifiablepublic Short2LongOpenCustomHashMap(ShortStrategy strategy)
strategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Short2LongOpenCustomHashMap(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 Short2LongOpenCustomHashMap(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 Short2LongOpenCustomHashMap(java.lang.Short[] keys,
java.lang.Long[] 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 Short2LongOpenCustomHashMap(java.lang.Short[] keys,
java.lang.Long[] 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 Short2LongOpenCustomHashMap(short[] keys,
long[] 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 Short2LongOpenCustomHashMap(short[] keys,
long[] 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 Short2LongOpenCustomHashMap(java.util.Map<? extends java.lang.Short,? extends java.lang.Long> 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 Short2LongOpenCustomHashMap(java.util.Map<? extends java.lang.Short,? extends java.lang.Long> 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 Short2LongOpenCustomHashMap(Short2LongMap 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 Short2LongOpenCustomHashMap(Short2LongMap 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 long put(short key,
long value)
Short2LongMapput in interface Short2LongMapkey - the key that should be inserted,value - the value that should be insertedMap.put(Object, Object)public long putIfAbsent(short key,
long value)
Short2LongMapputIfAbsent in interface Short2LongMapkey - the key that should be inserted,value - the value that should be insertedMap.putIfAbsent(Object, Object)public long addTo(short key,
long value)
Short2LongMapaddTo in interface Short2LongMapkey - the key that should be inserted,value - the value that should be inserted / addedpublic long subFrom(short key,
long value)
Short2LongMapShort2LongMap.getDefaultReturnValue()
If the fence is reached the element will be automaticall removedsubFrom in interface Short2LongMapkey - that should be subtract fromvalue - that should be subtractpublic boolean containsKey(short key)
Short2LongMapcontainsKey in interface Short2LongMapcontainsKey in class AbstractShort2LongMapkey - element that is searched for@Deprecated public boolean containsKey(java.lang.Object key)
containsKey in interface java.util.Map<java.lang.Short,java.lang.Long>containsKey in interface Short2LongMapcontainsKey in class java.util.AbstractMap<java.lang.Short,java.lang.Long>key - that is searched for.Map.containsKey(Object)public boolean containsValue(long value)
Short2LongMapcontainsValue in interface Short2LongMapcontainsValue in class AbstractShort2LongMapvalue - element that is searched for@Deprecated public boolean containsValue(java.lang.Object value)
containsValue in interface java.util.Map<java.lang.Short,java.lang.Long>containsValue in interface Short2LongMapcontainsValue in class java.util.AbstractMap<java.lang.Short,java.lang.Long>value - that is searched for.Map.containsValue(Object)public long remove(short key)
Short2LongMapremove in interface Short2LongMapkey - the element that should be removedpublic long removeOrDefault(short key,
long defaultValue)
Short2LongMapremoveOrDefault in interface Short2LongMapkey - the element that should be removeddefaultValue - the value that should be returned if the entry doesn't existMap.remove(Object, Object)public java.lang.Long remove(java.lang.Object key)
remove in interface java.util.Map<java.lang.Short,java.lang.Long>remove in interface Short2LongMapremove in class AbstractShort2LongMapkey - the element that should be removedMap.remove(Object)public boolean remove(short key,
long value)
Short2LongMapremove in interface Short2LongMapkey - the element that should be removedvalue - the expected value that should be foundMap.remove(Object, Object)public boolean remove(java.lang.Object key,
java.lang.Object value)
remove in interface java.util.Map<java.lang.Short,java.lang.Long>remove in interface Short2LongMapkey - the element that should be removedvalue - the expected value that should be foundMap.remove(Object, Object)public long get(short key)
Short2LongMapget in interface Short2LongFunctionget in interface Short2LongMapkey - the key that is searched forpublic java.lang.Long get(java.lang.Object key)
get in interface java.util.Map<java.lang.Short,java.lang.Long>get in interface Short2LongMapget in class AbstractShort2LongMappublic long getOrDefault(short key,
long defaultValue)
Short2LongMapgetOrDefault in interface Short2LongMapgetOrDefault in class AbstractShort2LongMapkey - the key that is searched fordefaultValue - the value that should be returned if the key is not presentpublic Short2LongOpenCustomHashMap copy()
Short2LongMapcopy in interface Short2LongMapcopy in class AbstractShort2LongMappublic ObjectSet<Short2LongMap.Entry> short2LongEntrySet()
Short2LongMapshort2LongEntrySet in interface Short2LongMappublic ShortSet keySet()
keySet in interface java.util.Map<java.lang.Short,java.lang.Long>keySet in interface Short2LongMapkeySet in class AbstractShort2LongMappublic LongCollection values()
values in interface java.util.Map<java.lang.Short,java.lang.Long>values in interface Short2LongMapvalues in class AbstractShort2LongMappublic void forEach(ShortLongConsumer action)
Short2LongMapforEach in interface Short2LongMapforEach in class AbstractShort2LongMapaction - processor of the values that are iterator overpublic boolean replace(short key,
long oldValue,
long newValue)
Short2LongMapreplace in interface Short2LongMapreplace in class AbstractShort2LongMapkey - the element that should be searched foroldValue - the expected value to be replacednewValue - the value to replace the oldValue with.public long replace(short key,
long value)
Short2LongMapreplace in interface Short2LongMapreplace in class AbstractShort2LongMapkey - the element that should be searched forvalue - the value to replace with.public long computeLong(short key,
ShortLongUnaryOperator mappingFunction)
Short2LongMapcomputeLong in interface Short2LongMapcomputeLong in class AbstractShort2LongMapkey - the key that should be computedmappingFunction - the operator that should generate the valuepublic long computeLongIfAbsent(short key,
Short2LongFunction mappingFunction)
Short2LongMapcomputeLongIfAbsent in interface Short2LongMapcomputeLongIfAbsent in class AbstractShort2LongMapkey - the key that should be computedmappingFunction - the operator that should generate the value if not presentpublic long supplyLongIfAbsent(short key,
LongSupplier valueProvider)
Short2LongMapsupplyLongIfAbsent in interface Short2LongMapsupplyLongIfAbsent in class AbstractShort2LongMapkey - the key that should be computedvalueProvider - the value if not presentpublic long computeLongIfPresent(short key,
ShortLongUnaryOperator mappingFunction)
Short2LongMapcomputeLongIfPresent in interface Short2LongMapcomputeLongIfPresent in class AbstractShort2LongMapkey - the key that should be computedmappingFunction - the operator that should generate the value if presentpublic long mergeLong(short key,
long value,
LongLongUnaryOperator mappingFunction)
Short2LongMapmergeLong in interface Short2LongMapmergeLong in class AbstractShort2LongMapkey - the key that should be be searched forvalue - the value that should be merged withmappingFunction - the operator that should generate the new Valuepublic void mergeAllLong(Short2LongMap m, LongLongUnaryOperator mappingFunction)
Short2LongMapmergeAllLong in interface Short2LongMapmergeAllLong in class AbstractShort2LongMapm - the entries that should be bulk addedmappingFunction - the operator that should generate the new Valuepublic int size()
size in interface java.util.Map<java.lang.Short,java.lang.Long>size in class java.util.AbstractMap<java.lang.Short,java.lang.Long>public void clear()
clear in interface java.util.Map<java.lang.Short,java.lang.Long>clear in class java.util.AbstractMap<java.lang.Short,java.lang.Long>public boolean trim(int size)
ITrimmabletrim in interface ITrimmablesize - the requested trim size.public void clearAndTrim(int size)
ITrimmableclearAndTrim in interface ITrimmablesize - the amount of elements that should be allowed