T - the keyType of elements maintained by this Collectionpublic class Object2ShortConcurrentOpenHashMap<T> extends AbstractObject2ShortMap<T> implements Object2ShortConcurrentMap<T>, ITrimmable
AbstractObject2ShortMap.BasicEntry<T>java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Object2ShortMap.BuilderCache<T>, Object2ShortMap.Entry<T>, Object2ShortMap.FastEntrySet<T>, Object2ShortMap.MapBuilder| Constructor and Description |
|---|
Object2ShortConcurrentOpenHashMap()
Default Constructor
|
Object2ShortConcurrentOpenHashMap(float loadFactor,
int concurrencyLevel)
Constructor that defines the load factor and concurrencyLevel
|
Object2ShortConcurrentOpenHashMap(int minCapacity)
Constructor that defines the minimum capacity
|
Object2ShortConcurrentOpenHashMap(int minCapacity,
float loadFactor)
Constructor that defines the minimum capacity and load factor
|
Object2ShortConcurrentOpenHashMap(int minCapacity,
float loadFactor,
int concurrencyLevel)
Constructor that defines the minimum capacity, load factor and concurrencyLevel
|
Object2ShortConcurrentOpenHashMap(int minCapacity,
int concurrencyLevel)
Constructor that defines the minimum capacity and concurrencyLevel
|
Object2ShortConcurrentOpenHashMap(java.util.Map<? extends T,? extends java.lang.Short> map)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Object2ShortConcurrentOpenHashMap(java.util.Map<? extends T,? extends java.lang.Short> map,
float loadFactor)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Object2ShortConcurrentOpenHashMap(java.util.Map<? extends T,? extends java.lang.Short> map,
float loadFactor,
int concurrencyLevel)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Object2ShortConcurrentOpenHashMap(java.util.Map<? extends T,? extends java.lang.Short> map,
int concurrencyLevel)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Object2ShortConcurrentOpenHashMap(Object2ShortMap<T> map)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Object2ShortConcurrentOpenHashMap(Object2ShortMap<T> map,
float loadFactor)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Object2ShortConcurrentOpenHashMap(Object2ShortMap<T> map,
float loadFactor,
int concurrencyLevel)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Object2ShortConcurrentOpenHashMap(Object2ShortMap<T> map,
int concurrencyLevel)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Object2ShortConcurrentOpenHashMap(T[] keys,
short[] values)
Helper constructor that allow to create a map from unboxed values
|
Object2ShortConcurrentOpenHashMap(T[] keys,
java.lang.Short[] values)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Object2ShortConcurrentOpenHashMap(T[] keys,
short[] values,
float loadFactor)
Helper constructor that allow to create a map from unboxed values
|
Object2ShortConcurrentOpenHashMap(T[] keys,
java.lang.Short[] values,
float loadFactor)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Object2ShortConcurrentOpenHashMap(T[] keys,
short[] values,
float loadFactor,
int concurrencyLevel)
Helper constructor that allow to create a map from unboxed values
|
Object2ShortConcurrentOpenHashMap(T[] keys,
java.lang.Short[] values,
float loadFactor,
int concurrencyLevel)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Object2ShortConcurrentOpenHashMap(T[] keys,
short[] values,
int concurrencyLevel)
Helper constructor that allow to create a map from unboxed values
|
Object2ShortConcurrentOpenHashMap(T[] keys,
java.lang.Short[] values,
int concurrencyLevel)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
| Modifier and Type | Method and Description |
|---|---|
short |
addTo(T key,
short 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
|
short |
computeShort(T key,
ObjectShortUnaryOperator<T> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
short |
computeShortIfAbsent(T key,
ToShortFunction<T> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
short |
computeShortIfPresent(T key,
ObjectShortUnaryOperator<T> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
boolean |
containsValue(short value)
Type Specific method to reduce boxing/unboxing of values
|
Object2ShortConcurrentOpenHashMap<T> |
copy()
A Function that does a shallow clone of the Map itself.
|
void |
forEach(ObjectShortConsumer<T> action)
Type Specific forEach method to reduce boxing/unboxing
|
java.lang.Short |
get(java.lang.Object key) |
short |
getOrDefault(T key,
short defaultValue)
A Type Specific getOrDefault method to reduce boxing/unboxing
|
short |
getShort(T key)
A Type Specific get method to reduce boxing/unboxing
|
boolean |
isEmpty() |
ObjectSet<T> |
keySet() |
short |
mergeShort(T key,
short value,
ShortShortUnaryOperator mappingFunction)
A Type Specific merge method to reduce boxing/unboxing
|
ObjectSet<Object2ShortMap.Entry<T>> |
object2ShortEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
short |
put(T key,
short value)
Type Specific method to reduce boxing/unboxing of values
|
short |
putIfAbsent(T key,
short value)
Type Specific method to reduce boxing/unboxing of values
|
short |
rem(T key)
Type Specific remove function to reduce boxing/unboxing
|
short |
remOrDefault(T key,
short defaultValue)
Type-Specific Remove function with a default return value if wanted.
|
boolean |
remove(java.lang.Object key,
java.lang.Object value) |
boolean |
remove(T key,
short value)
Type Specific remove function to reduce boxing/unboxing
|
short |
replace(T key,
short value)
A Type Specific replace method to reduce boxing/unboxing replace an existing value
|
boolean |
replace(T key,
short oldValue,
short newValue)
A Type Specific replace method to replace an existing value
|
int |
size() |
short |
subFrom(T key,
short value)
A Helper method to subtract from primitive from each other.
|
short |
supplyShortIfAbsent(T key,
ShortSupplier 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
|
ShortCollection |
values() |
addToAll, containsKey, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, mergeAllShort, put, putAll, putAll, putAll, putAll, putAllIfAbsent, remove, replaceShorts, replaceShorts, setDefaultReturnValuecompute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, replace, replace, replaceAlladdToAll, applyAsShort, builder, containsValue, entrySet, getDefaultReturnValue, mergeAllShort, put, put, put, putAll, putAll, putAll, putAll, putAll, putAllIfAbsent, remove, replaceShorts, replaceShorts, setDefaultReturnValue, synchronize, synchronize, unmodifiableclearAndTrim, trimpublic Object2ShortConcurrentOpenHashMap()
public Object2ShortConcurrentOpenHashMap(int minCapacity)
minCapacity - the minimum capacity the HashMap is allowed to be.java.lang.IllegalStateException - if the minimum capacity is negativepublic Object2ShortConcurrentOpenHashMap(int minCapacity,
float loadFactor)
minCapacity - the minimum capacity the HashMap is allowed to be.loadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the minimum capacity is negativejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public Object2ShortConcurrentOpenHashMap(int minCapacity,
int concurrencyLevel)
minCapacity - the minimum capacity the HashMap is allowed to be.concurrencyLevel - decides how many operations can be performed at once.java.lang.IllegalStateException - if the minimum capacity is negativejava.lang.IllegalStateException - if the concurrencyLevel is either below/equal to 0 or above/equal to 65535public Object2ShortConcurrentOpenHashMap(float loadFactor,
int concurrencyLevel)
loadFactor - the percentage of how full the backing array can be before they resizeconcurrencyLevel - decides how many operations can be performed at once.java.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1java.lang.IllegalStateException - if the concurrencyLevel is either below/equal to 0 or above/equal to 65535public Object2ShortConcurrentOpenHashMap(int minCapacity,
float loadFactor,
int concurrencyLevel)
minCapacity - the minimum capacity the HashMap is allowed to be.loadFactor - the percentage of how full the backing array can be before they resizeconcurrencyLevel - decides how many operations can be performed at once.java.lang.IllegalStateException - if the minimum capacity is negativejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1java.lang.IllegalStateException - if the concurrencyLevel is either below/equal to 0 or above/equal to 65535public Object2ShortConcurrentOpenHashMap(T[] keys, java.lang.Short[] values)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.java.lang.IllegalStateException - if the keys and values do not match in lenghtpublic Object2ShortConcurrentOpenHashMap(T[] keys, java.lang.Short[] values, float loadFactor)
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 resizejava.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 Object2ShortConcurrentOpenHashMap(T[] keys, java.lang.Short[] values, int concurrencyLevel)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.concurrencyLevel - decides how many operations can be performed at once.java.lang.IllegalStateException - if the keys and values do not match in lenghtjava.lang.IllegalStateException - if the concurrencyLevel is either below/equal to 0 or above/equal to 65535public Object2ShortConcurrentOpenHashMap(T[] keys, java.lang.Short[] values, float loadFactor, int concurrencyLevel)
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 resizeconcurrencyLevel - decides how many operations can be performed at once.java.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 1java.lang.IllegalStateException - if the concurrencyLevel is either below/equal to 0 or above/equal to 65535public Object2ShortConcurrentOpenHashMap(T[] keys, short[] values)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.java.lang.IllegalStateException - if the keys and values do not match in lenghtpublic Object2ShortConcurrentOpenHashMap(T[] keys, short[] values, float loadFactor)
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 resizejava.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 Object2ShortConcurrentOpenHashMap(T[] keys, short[] values, int concurrencyLevel)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.concurrencyLevel - decides how many operations can be performed at once.java.lang.IllegalStateException - if the keys and values do not match in lenghtjava.lang.IllegalStateException - if the concurrencyLevel is either below/equal to 0 or above/equal to 65535public Object2ShortConcurrentOpenHashMap(T[] keys, short[] values, float loadFactor, int concurrencyLevel)
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 resizeconcurrencyLevel - decides how many operations can be performed at once.java.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 1java.lang.IllegalStateException - if the concurrencyLevel is either below/equal to 0 or above/equal to 65535public Object2ShortConcurrentOpenHashMap(java.util.Map<? extends T,? extends java.lang.Short> map)
map - the values that should be present in the mappublic Object2ShortConcurrentOpenHashMap(java.util.Map<? extends T,? extends java.lang.Short> map, float loadFactor)
map - the values that should be present in the maploadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public Object2ShortConcurrentOpenHashMap(java.util.Map<? extends T,? extends java.lang.Short> map, int concurrencyLevel)
map - the values that should be present in the mapconcurrencyLevel - decides how many operations can be performed at once.java.lang.IllegalStateException - if the concurrencyLevel is either below/equal to 0 or above/equal to 65535public Object2ShortConcurrentOpenHashMap(java.util.Map<? extends T,? extends java.lang.Short> map, float loadFactor, int concurrencyLevel)
map - the values that should be present in the maploadFactor - the percentage of how full the backing array can be before they resizeconcurrencyLevel - decides how many operations can be performed at once.java.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1java.lang.IllegalStateException - if the concurrencyLevel is either below/equal to 0 or above/equal to 65535public Object2ShortConcurrentOpenHashMap(Object2ShortMap<T> map)
map - the values that should be present in the mappublic Object2ShortConcurrentOpenHashMap(Object2ShortMap<T> map, float loadFactor)
map - the values that should be present in the maploadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public Object2ShortConcurrentOpenHashMap(Object2ShortMap<T> map, int concurrencyLevel)
map - the values that should be present in the mapconcurrencyLevel - decides how many operations can be performed at once.java.lang.IllegalStateException - if the concurrencyLevel is either below/equal to 0 or above/equal to 65535public Object2ShortConcurrentOpenHashMap(Object2ShortMap<T> map, float loadFactor, int concurrencyLevel)
map - the values that should be present in the maploadFactor - the percentage of how full the backing array can be before they resizeconcurrencyLevel - decides how many operations can be performed at once.java.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1java.lang.IllegalStateException - if the concurrencyLevel is either below/equal to 0 or above/equal to 65535public short put(T key, short value)
Object2ShortMapput in interface Object2ShortMap<T>key - the key that should be inserted,value - the value that should be insertedMap.put(Object, Object)public short putIfAbsent(T key, short value)
Object2ShortMapputIfAbsent in interface Object2ShortMap<T>key - the key that should be inserted,value - the value that should be insertedMap.putIfAbsent(Object, Object)public short addTo(T key, short value)
Object2ShortMapaddTo in interface Object2ShortMap<T>key - the key that should be inserted,value - the value that should be inserted / addedpublic short subFrom(T key, short value)
Object2ShortMapObject2ShortMap.getDefaultReturnValue()
If the fence is reached the element will be automaticall removedsubFrom in interface Object2ShortMap<T>key - that should be subtract fromvalue - that should be subtractpublic short rem(T key)
Object2ShortMaprem in interface Object2ShortMap<T>key - the element that should be removedpublic boolean remove(T key, short value)
Object2ShortMapremove in interface Object2ShortMap<T>key - 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.concurrent.ConcurrentMap<T,java.lang.Short>remove in interface java.util.Map<T,java.lang.Short>remove in interface Object2ShortConcurrentMap<T>remove in interface Object2ShortMap<T>key - the element that should be removedvalue - the expected value that should be foundMap.remove(Object, Object)public short remOrDefault(T key, short defaultValue)
Object2ShortMapremOrDefault in interface Object2ShortMap<T>key - the element that should be removeddefaultValue - the value that should be returned if the entry doesn't existMap.remove(Object, Object)public short getShort(T key)
Object2ShortMapgetShort in interface Object2ShortMap<T>key - the key that is searched forpublic java.lang.Short get(java.lang.Object key)
get in interface java.util.Map<T,java.lang.Short>get in interface Object2ShortMap<T>get in class AbstractObject2ShortMap<T>public short getOrDefault(T key, short defaultValue)
Object2ShortMapgetOrDefault in interface Object2ShortMap<T>key - the key that is searched fordefaultValue - the value that should be returned if the key is not presentpublic void forEach(ObjectShortConsumer<T> action)
Object2ShortMapforEach in interface Object2ShortMap<T>forEach in class AbstractObject2ShortMap<T>action - processor of the values that are iterator overpublic Object2ShortConcurrentOpenHashMap<T> copy()
Object2ShortMapcopy in interface Object2ShortMap<T>copy in class AbstractObject2ShortMap<T>public boolean containsValue(short value)
Object2ShortMapcontainsValue in interface Object2ShortMap<T>containsValue in class AbstractObject2ShortMap<T>value - element that is searched forpublic boolean replace(T key, short oldValue, short newValue)
Object2ShortMapreplace in interface Object2ShortMap<T>replace in class AbstractObject2ShortMap<T>key - the element that should be searched foroldValue - the expected value to be replacednewValue - the value to replace the oldValue with.public short replace(T key, short value)
Object2ShortMapreplace in interface Object2ShortMap<T>replace in class AbstractObject2ShortMap<T>key - the element that should be searched forvalue - the value to replace with.public short computeShort(T key, ObjectShortUnaryOperator<T> mappingFunction)
Object2ShortMapcomputeShort in interface Object2ShortMap<T>computeShort in class AbstractObject2ShortMap<T>key - the key that should be computedmappingFunction - the operator that should generate the valuepublic short computeShortIfAbsent(T key, ToShortFunction<T> mappingFunction)
Object2ShortMapcomputeShortIfAbsent in interface Object2ShortMap<T>computeShortIfAbsent in class AbstractObject2ShortMap<T>key - the key that should be computedmappingFunction - the operator that should generate the value if not presentpublic short supplyShortIfAbsent(T key, ShortSupplier valueProvider)
Object2ShortMapsupplyShortIfAbsent in interface Object2ShortMap<T>supplyShortIfAbsent in class AbstractObject2ShortMap<T>key - the key that should be computedvalueProvider - the value if not presentpublic short computeShortIfPresent(T key, ObjectShortUnaryOperator<T> mappingFunction)
Object2ShortMapcomputeShortIfPresent in interface Object2ShortMap<T>computeShortIfPresent in class AbstractObject2ShortMap<T>key - the key that should be computedmappingFunction - the operator that should generate the value if presentpublic short mergeShort(T key, short value, ShortShortUnaryOperator mappingFunction)
Object2ShortMapmergeShort in interface Object2ShortMap<T>mergeShort in class AbstractObject2ShortMap<T>key - the key that should be be searched forvalue - the value that should be merged withmappingFunction - the operator that should generate the new Valuepublic void clear()
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 allowedpublic boolean isEmpty()
public int size()
public ObjectSet<Object2ShortMap.Entry<T>> object2ShortEntrySet()
Object2ShortMapobject2ShortEntrySet in interface Object2ShortMap<T>public ObjectSet<T> keySet()
keySet in interface java.util.Map<T,java.lang.Short>keySet in interface Object2ShortMap<T>keySet in class AbstractObject2ShortMap<T>public ShortCollection values()
values in interface java.util.Map<T,java.lang.Short>values in interface Object2ShortMap<T>values in class AbstractObject2ShortMap<T>