public class Long2LongConcurrentOpenHashMap extends AbstractLong2LongMap implements Long2LongConcurrentMap, ITrimmable
AbstractLong2LongMap.BasicEntryjava.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Long2LongMap.BuilderCache, Long2LongMap.Entry, Long2LongMap.FastEntrySet, Long2LongMap.MapBuilder| Constructor and Description |
|---|
Long2LongConcurrentOpenHashMap()
Default Constructor
|
Long2LongConcurrentOpenHashMap(float loadFactor,
int concurrencyLevel)
Constructor that defines the load factor and concurrencyLevel
|
Long2LongConcurrentOpenHashMap(int minCapacity)
Constructor that defines the minimum capacity
|
Long2LongConcurrentOpenHashMap(int minCapacity,
float loadFactor)
Constructor that defines the minimum capacity and load factor
|
Long2LongConcurrentOpenHashMap(int minCapacity,
float loadFactor,
int concurrencyLevel)
Constructor that defines the minimum capacity, load factor and concurrencyLevel
|
Long2LongConcurrentOpenHashMap(int minCapacity,
int concurrencyLevel)
Constructor that defines the minimum capacity and concurrencyLevel
|
Long2LongConcurrentOpenHashMap(long[] keys,
long[] values)
Helper constructor that allow to create a map from unboxed values
|
Long2LongConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Long[] values)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Long2LongConcurrentOpenHashMap(long[] keys,
long[] values,
float loadFactor)
Helper constructor that allow to create a map from unboxed values
|
Long2LongConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Long[] values,
float loadFactor)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Long2LongConcurrentOpenHashMap(long[] keys,
long[] values,
float loadFactor,
int concurrencyLevel)
Helper constructor that allow to create a map from unboxed values
|
Long2LongConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Long[] values,
float loadFactor,
int concurrencyLevel)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Long2LongConcurrentOpenHashMap(long[] keys,
long[] values,
int concurrencyLevel)
Helper constructor that allow to create a map from unboxed values
|
Long2LongConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Long[] values,
int concurrencyLevel)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Long2LongConcurrentOpenHashMap(Long2LongMap map)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Long2LongConcurrentOpenHashMap(Long2LongMap map,
float loadFactor)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Long2LongConcurrentOpenHashMap(Long2LongMap 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.
|
Long2LongConcurrentOpenHashMap(Long2LongMap map,
int concurrencyLevel)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Long2LongConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Long> map)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Long2LongConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Long> map,
float loadFactor)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Long2LongConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Long> map,
float loadFactor,
int concurrencyLevel)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Long2LongConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Long> map,
int concurrencyLevel)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
| Modifier and Type | Method and Description |
|---|---|
long |
addTo(long 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(long key,
LongLongUnaryOperator mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
long |
computeLongIfAbsent(long key,
LongUnaryOperator mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
long |
computeLongIfPresent(long key,
LongLongUnaryOperator mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
boolean |
containsKey(long key)
Type Specific method to reduce boxing/unboxing of values
|
boolean |
containsValue(long value)
Type Specific method to reduce boxing/unboxing of values
|
Long2LongConcurrentOpenHashMap |
copy()
A Function that does a shallow clone of the Map itself.
|
void |
forEach(LongLongConsumer action)
Type Specific forEach method to reduce boxing/unboxing
|
long |
get(long key)
A Type Specific get method to reduce boxing/unboxing
|
java.lang.Long |
get(java.lang.Object key) |
long |
getOrDefault(long key,
long defaultValue)
A Type Specific getOrDefault method to reduce boxing/unboxing
|
boolean |
isEmpty() |
LongSet |
keySet() |
ObjectSet<Long2LongMap.Entry> |
long2LongEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
long |
mergeLong(long key,
long value,
LongLongUnaryOperator mappingFunction)
A Type Specific merge method to reduce boxing/unboxing
|
long |
put(long key,
long value)
Type Specific method to reduce boxing/unboxing of values
|
long |
putIfAbsent(long key,
long value)
Type Specific method to reduce boxing/unboxing of values
|
long |
remove(long key)
Type Specific remove function to reduce boxing/unboxing
|
boolean |
remove(long key,
long value)
Type Specific remove function to reduce boxing/unboxing
|
boolean |
remove(java.lang.Object key,
java.lang.Object value) |
long |
removeOrDefault(long key,
long defaultValue)
Type-Specific Remove function with a default return value if wanted.
|
long |
replace(long key,
long value)
A Type Specific replace method to reduce boxing/unboxing replace an existing value
|
boolean |
replace(long key,
long oldValue,
long newValue)
A Type Specific replace method to replace an existing value
|
int |
size() |
long |
subFrom(long key,
long value)
A Helper method to subtract from primitive from each other.
|
long |
supplyLongIfAbsent(long 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, mergeAllLong, put, putAll, putAll, putAll, putAll, putAllIfAbsent, remove, replaceLongs, replaceLongs, setDefaultReturnValuecompute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, replace, replace, replaceAlladdToAll, applyAsLong, builder, containsKey, containsValue, entrySet, getDefaultReturnValue, mergeAllLong, put, put, put, putAll, putAll, putAll, putAll, putAll, putAllIfAbsent, remove, replaceLongs, replaceLongs, setDefaultReturnValue, synchronize, synchronize, unmodifiableandThen, compose, identityclearAndTrim, trimpublic Long2LongConcurrentOpenHashMap()
public Long2LongConcurrentOpenHashMap(int minCapacity)
minCapacity - the minimum capacity the HashMap is allowed to be.java.lang.IllegalStateException - if the minimum capacity is negativepublic Long2LongConcurrentOpenHashMap(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 Long2LongConcurrentOpenHashMap(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 Long2LongConcurrentOpenHashMap(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 Long2LongConcurrentOpenHashMap(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 Long2LongConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Long[] 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 Long2LongConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Long[] 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 Long2LongConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Long[] 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 Long2LongConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Long[] 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 Long2LongConcurrentOpenHashMap(long[] keys,
long[] 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 Long2LongConcurrentOpenHashMap(long[] keys,
long[] 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 Long2LongConcurrentOpenHashMap(long[] keys,
long[] 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 Long2LongConcurrentOpenHashMap(long[] keys,
long[] 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 Long2LongConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Long> map)
map - the values that should be present in the mappublic Long2LongConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Long> 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 Long2LongConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Long> 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 Long2LongConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Long> 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 Long2LongConcurrentOpenHashMap(Long2LongMap map)
map - the values that should be present in the mappublic Long2LongConcurrentOpenHashMap(Long2LongMap 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 Long2LongConcurrentOpenHashMap(Long2LongMap 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 Long2LongConcurrentOpenHashMap(Long2LongMap 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 long put(long key,
long value)
Long2LongMapput in interface Long2LongMapkey - the key that should be inserted,value - the value that should be insertedMap.put(Object, Object)public long putIfAbsent(long key,
long value)
Long2LongMapputIfAbsent in interface Long2LongMapkey - the key that should be inserted,value - the value that should be insertedMap.putIfAbsent(Object, Object)public long addTo(long key,
long value)
Long2LongMapaddTo in interface Long2LongMapkey - the key that should be inserted,value - the value that should be inserted / addedpublic long subFrom(long key,
long value)
Long2LongMapLong2LongMap.getDefaultReturnValue()
If the fence is reached the element will be automaticall removedsubFrom in interface Long2LongMapkey - that should be subtract fromvalue - that should be subtractpublic long remove(long key)
Long2LongMapremove in interface Long2LongMapkey - the element that should be removedpublic boolean remove(long key,
long value)
Long2LongMapremove in interface Long2LongMapkey - 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<java.lang.Long,java.lang.Long>remove in interface java.util.Map<java.lang.Long,java.lang.Long>remove in interface Long2LongConcurrentMapremove in interface Long2LongMapkey - the element that should be removedvalue - the expected value that should be foundMap.remove(Object, Object)public long removeOrDefault(long key,
long defaultValue)
Long2LongMapremoveOrDefault in interface Long2LongMapkey - the element that should be removeddefaultValue - the value that should be returned if the entry doesn't existMap.remove(Object, Object)public long get(long key)
Long2LongMapget in interface Long2LongMapkey - the key that is searched forpublic java.lang.Long get(java.lang.Object key)
get in interface java.util.Map<java.lang.Long,java.lang.Long>get in interface Long2LongMapget in class AbstractLong2LongMappublic long getOrDefault(long key,
long defaultValue)
Long2LongMapgetOrDefault in interface Long2LongMapgetOrDefault in class AbstractLong2LongMapkey - the key that is searched fordefaultValue - the value that should be returned if the key is not presentpublic void forEach(LongLongConsumer action)
Long2LongMapforEach in interface Long2LongMapforEach in class AbstractLong2LongMapaction - processor of the values that are iterator overpublic Long2LongConcurrentOpenHashMap copy()
Long2LongMapcopy in interface Long2LongMapcopy in class AbstractLong2LongMappublic boolean containsKey(long key)
Long2LongMapcontainsKey in interface Long2LongMapcontainsKey in class AbstractLong2LongMapkey - element that is searched forpublic boolean containsValue(long value)
Long2LongMapcontainsValue in interface Long2LongMapcontainsValue in class AbstractLong2LongMapvalue - element that is searched forpublic boolean replace(long key,
long oldValue,
long newValue)
Long2LongMapreplace in interface Long2LongMapreplace in class AbstractLong2LongMapkey - the element that should be searched foroldValue - the expected value to be replacednewValue - the value to replace the oldValue with.public long replace(long key,
long value)
Long2LongMapreplace in interface Long2LongMapreplace in class AbstractLong2LongMapkey - the element that should be searched forvalue - the value to replace with.public long computeLong(long key,
LongLongUnaryOperator mappingFunction)
Long2LongMapcomputeLong in interface Long2LongMapcomputeLong in class AbstractLong2LongMapkey - the key that should be computedmappingFunction - the operator that should generate the valuepublic long computeLongIfAbsent(long key,
LongUnaryOperator mappingFunction)
Long2LongMapcomputeLongIfAbsent in interface Long2LongMapcomputeLongIfAbsent in class AbstractLong2LongMapkey - the key that should be computedmappingFunction - the operator that should generate the value if not presentpublic long supplyLongIfAbsent(long key,
LongSupplier valueProvider)
Long2LongMapsupplyLongIfAbsent in interface Long2LongMapsupplyLongIfAbsent in class AbstractLong2LongMapkey - the key that should be computedvalueProvider - the value if not presentpublic long computeLongIfPresent(long key,
LongLongUnaryOperator mappingFunction)
Long2LongMapcomputeLongIfPresent in interface Long2LongMapcomputeLongIfPresent in class AbstractLong2LongMapkey - the key that should be computedmappingFunction - the operator that should generate the value if presentpublic long mergeLong(long key,
long value,
LongLongUnaryOperator mappingFunction)
Long2LongMapmergeLong in interface Long2LongMapmergeLong in class AbstractLong2LongMapkey - 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()
clear in interface java.util.Map<java.lang.Long,java.lang.Long>clear in class java.util.AbstractMap<java.lang.Long,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 allowedpublic boolean isEmpty()
isEmpty in interface java.util.Map<java.lang.Long,java.lang.Long>isEmpty in class java.util.AbstractMap<java.lang.Long,java.lang.Long>public int size()
size in interface java.util.Map<java.lang.Long,java.lang.Long>size in class java.util.AbstractMap<java.lang.Long,java.lang.Long>public ObjectSet<Long2LongMap.Entry> long2LongEntrySet()
Long2LongMaplong2LongEntrySet in interface Long2LongMappublic LongSet keySet()
keySet in interface java.util.Map<java.lang.Long,java.lang.Long>keySet in interface Long2LongMapkeySet in class AbstractLong2LongMappublic LongCollection values()
values in interface java.util.Map<java.lang.Long,java.lang.Long>values in interface Long2LongMapvalues in class AbstractLong2LongMap