public class Long2CharConcurrentOpenHashMap extends AbstractLong2CharMap implements Long2CharConcurrentMap, ITrimmable
AbstractLong2CharMap.BasicEntryjava.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Long2CharMap.BuilderCache, Long2CharMap.Entry, Long2CharMap.FastEntrySet, Long2CharMap.MapBuilder| Constructor and Description |
|---|
Long2CharConcurrentOpenHashMap()
Default Constructor
|
Long2CharConcurrentOpenHashMap(float loadFactor,
int concurrencyLevel)
Constructor that defines the load factor and concurrencyLevel
|
Long2CharConcurrentOpenHashMap(int minCapacity)
Constructor that defines the minimum capacity
|
Long2CharConcurrentOpenHashMap(int minCapacity,
float loadFactor)
Constructor that defines the minimum capacity and load factor
|
Long2CharConcurrentOpenHashMap(int minCapacity,
float loadFactor,
int concurrencyLevel)
Constructor that defines the minimum capacity, load factor and concurrencyLevel
|
Long2CharConcurrentOpenHashMap(int minCapacity,
int concurrencyLevel)
Constructor that defines the minimum capacity and concurrencyLevel
|
Long2CharConcurrentOpenHashMap(long[] keys,
char[] values)
Helper constructor that allow to create a map from unboxed values
|
Long2CharConcurrentOpenHashMap(long[] keys,
char[] values,
float loadFactor)
Helper constructor that allow to create a map from unboxed values
|
Long2CharConcurrentOpenHashMap(long[] keys,
char[] values,
float loadFactor,
int concurrencyLevel)
Helper constructor that allow to create a map from unboxed values
|
Long2CharConcurrentOpenHashMap(long[] keys,
char[] values,
int concurrencyLevel)
Helper constructor that allow to create a map from unboxed values
|
Long2CharConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Character[] values)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Long2CharConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Character[] values,
float loadFactor)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Long2CharConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Character[] values,
float loadFactor,
int concurrencyLevel)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Long2CharConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Character[] values,
int concurrencyLevel)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Long2CharConcurrentOpenHashMap(Long2CharMap map)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Long2CharConcurrentOpenHashMap(Long2CharMap map,
float loadFactor)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Long2CharConcurrentOpenHashMap(Long2CharMap 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.
|
Long2CharConcurrentOpenHashMap(Long2CharMap map,
int concurrencyLevel)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Long2CharConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Character> map)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Long2CharConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Character> map,
float loadFactor)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Long2CharConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Character> map,
float loadFactor,
int concurrencyLevel)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Long2CharConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Character> 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 |
|---|---|
char |
addTo(long key,
char 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
|
char |
computeChar(long key,
LongCharUnaryOperator mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
char |
computeCharIfAbsent(long key,
Long2CharFunction mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
char |
computeCharIfPresent(long key,
LongCharUnaryOperator 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(char value)
Type Specific method to reduce boxing/unboxing of values
|
Long2CharConcurrentOpenHashMap |
copy()
A Function that does a shallow clone of the Map itself.
|
void |
forEach(LongCharConsumer action)
Type Specific forEach method to reduce boxing/unboxing
|
char |
get(long key)
A Type Specific get method to reduce boxing/unboxing
|
java.lang.Character |
get(java.lang.Object key) |
char |
getOrDefault(long key,
char defaultValue)
A Type Specific getOrDefault method to reduce boxing/unboxing
|
boolean |
isEmpty() |
LongSet |
keySet() |
ObjectSet<Long2CharMap.Entry> |
long2CharEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
char |
mergeChar(long key,
char value,
CharCharUnaryOperator mappingFunction)
A Type Specific merge method to reduce boxing/unboxing
|
char |
put(long key,
char value)
Type Specific method to reduce boxing/unboxing of values
|
char |
putIfAbsent(long key,
char value)
Type Specific method to reduce boxing/unboxing of values
|
char |
remove(long key)
Type Specific remove function to reduce boxing/unboxing
|
boolean |
remove(long key,
char value)
Type Specific remove function to reduce boxing/unboxing
|
boolean |
remove(java.lang.Object key,
java.lang.Object value) |
char |
removeOrDefault(long key,
char defaultValue)
Type-Specific Remove function with a default return value if wanted.
|
char |
replace(long key,
char value)
A Type Specific replace method to reduce boxing/unboxing replace an existing value
|
boolean |
replace(long key,
char oldValue,
char newValue)
A Type Specific replace method to replace an existing value
|
int |
size() |
char |
subFrom(long key,
char value)
A Helper method to subtract from primitive from each other.
|
char |
supplyCharIfAbsent(long key,
CharSupplier 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
|
CharCollection |
values() |
addToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, mergeAllChar, put, putAll, putAll, putAll, putAll, putAllIfAbsent, remove, replaceChars, replaceChars, setDefaultReturnValuecompute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, replace, replace, replaceAlladdToAll, builder, containsKey, containsValue, entrySet, getDefaultReturnValue, mergeAllChar, put, putAll, putAll, putAll, putAll, putAll, putAllIfAbsent, remove, replaceChars, replaceChars, setDefaultReturnValue, synchronize, synchronize, unmodifiableclearAndTrim, trimpublic Long2CharConcurrentOpenHashMap()
public Long2CharConcurrentOpenHashMap(int minCapacity)
minCapacity - the minimum capacity the HashMap is allowed to be.java.lang.IllegalStateException - if the minimum capacity is negativepublic Long2CharConcurrentOpenHashMap(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 Long2CharConcurrentOpenHashMap(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 Long2CharConcurrentOpenHashMap(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 Long2CharConcurrentOpenHashMap(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 Long2CharConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Character[] 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 Long2CharConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Character[] 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 Long2CharConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Character[] 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 Long2CharConcurrentOpenHashMap(java.lang.Long[] keys,
java.lang.Character[] 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 Long2CharConcurrentOpenHashMap(long[] keys,
char[] 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 Long2CharConcurrentOpenHashMap(long[] keys,
char[] 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 Long2CharConcurrentOpenHashMap(long[] keys,
char[] 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 Long2CharConcurrentOpenHashMap(long[] keys,
char[] 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 Long2CharConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Character> map)
map - the values that should be present in the mappublic Long2CharConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Character> 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 Long2CharConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Character> 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 Long2CharConcurrentOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Character> 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 Long2CharConcurrentOpenHashMap(Long2CharMap map)
map - the values that should be present in the mappublic Long2CharConcurrentOpenHashMap(Long2CharMap 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 Long2CharConcurrentOpenHashMap(Long2CharMap 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 Long2CharConcurrentOpenHashMap(Long2CharMap 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 char put(long key,
char value)
Long2CharMapput in interface Long2CharMapkey - the key that should be inserted,value - the value that should be insertedMap.put(Object, Object)public char putIfAbsent(long key,
char value)
Long2CharMapputIfAbsent in interface Long2CharMapkey - the key that should be inserted,value - the value that should be insertedMap.putIfAbsent(Object, Object)public char addTo(long key,
char value)
Long2CharMapaddTo in interface Long2CharMapkey - the key that should be inserted,value - the value that should be inserted / addedpublic char subFrom(long key,
char value)
Long2CharMapLong2CharMap.getDefaultReturnValue()
If the fence is reached the element will be automaticall removedsubFrom in interface Long2CharMapkey - that should be subtract fromvalue - that should be subtractpublic char remove(long key)
Long2CharMapremove in interface Long2CharMapkey - the element that should be removedpublic boolean remove(long key,
char value)
Long2CharMapremove in interface Long2CharMapkey - 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.Character>remove in interface java.util.Map<java.lang.Long,java.lang.Character>remove in interface Long2CharConcurrentMapremove in interface Long2CharMapkey - the element that should be removedvalue - the expected value that should be foundMap.remove(Object, Object)public char removeOrDefault(long key,
char defaultValue)
Long2CharMapremoveOrDefault in interface Long2CharMapkey - the element that should be removeddefaultValue - the value that should be returned if the entry doesn't existMap.remove(Object, Object)public char get(long key)
Long2CharMapget in interface Long2CharFunctionget in interface Long2CharMapkey - the key that is searched forpublic java.lang.Character get(java.lang.Object key)
get in interface java.util.Map<java.lang.Long,java.lang.Character>get in interface Long2CharMapget in class AbstractLong2CharMappublic char getOrDefault(long key,
char defaultValue)
Long2CharMapgetOrDefault in interface Long2CharMapgetOrDefault in class AbstractLong2CharMapkey - the key that is searched fordefaultValue - the value that should be returned if the key is not presentpublic void forEach(LongCharConsumer action)
Long2CharMapforEach in interface Long2CharMapforEach in class AbstractLong2CharMapaction - processor of the values that are iterator overpublic Long2CharConcurrentOpenHashMap copy()
Long2CharMapcopy in interface Long2CharMapcopy in class AbstractLong2CharMappublic boolean containsKey(long key)
Long2CharMapcontainsKey in interface Long2CharMapcontainsKey in class AbstractLong2CharMapkey - element that is searched forpublic boolean containsValue(char value)
Long2CharMapcontainsValue in interface Long2CharMapcontainsValue in class AbstractLong2CharMapvalue - element that is searched forpublic boolean replace(long key,
char oldValue,
char newValue)
Long2CharMapreplace in interface Long2CharMapreplace in class AbstractLong2CharMapkey - the element that should be searched foroldValue - the expected value to be replacednewValue - the value to replace the oldValue with.public char replace(long key,
char value)
Long2CharMapreplace in interface Long2CharMapreplace in class AbstractLong2CharMapkey - the element that should be searched forvalue - the value to replace with.public char computeChar(long key,
LongCharUnaryOperator mappingFunction)
Long2CharMapcomputeChar in interface Long2CharMapcomputeChar in class AbstractLong2CharMapkey - the key that should be computedmappingFunction - the operator that should generate the valuepublic char computeCharIfAbsent(long key,
Long2CharFunction mappingFunction)
Long2CharMapcomputeCharIfAbsent in interface Long2CharMapcomputeCharIfAbsent in class AbstractLong2CharMapkey - the key that should be computedmappingFunction - the operator that should generate the value if not presentpublic char supplyCharIfAbsent(long key,
CharSupplier valueProvider)
Long2CharMapsupplyCharIfAbsent in interface Long2CharMapsupplyCharIfAbsent in class AbstractLong2CharMapkey - the key that should be computedvalueProvider - the value if not presentpublic char computeCharIfPresent(long key,
LongCharUnaryOperator mappingFunction)
Long2CharMapcomputeCharIfPresent in interface Long2CharMapcomputeCharIfPresent in class AbstractLong2CharMapkey - the key that should be computedmappingFunction - the operator that should generate the value if presentpublic char mergeChar(long key,
char value,
CharCharUnaryOperator mappingFunction)
Long2CharMapmergeChar in interface Long2CharMapmergeChar in class AbstractLong2CharMapkey - 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.Character>clear in class java.util.AbstractMap<java.lang.Long,java.lang.Character>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.Character>isEmpty in class java.util.AbstractMap<java.lang.Long,java.lang.Character>public int size()
size in interface java.util.Map<java.lang.Long,java.lang.Character>size in class java.util.AbstractMap<java.lang.Long,java.lang.Character>public ObjectSet<Long2CharMap.Entry> long2CharEntrySet()
Long2CharMaplong2CharEntrySet in interface Long2CharMappublic LongSet keySet()
keySet in interface java.util.Map<java.lang.Long,java.lang.Character>keySet in interface Long2CharMapkeySet in class AbstractLong2CharMappublic CharCollection values()
values in interface java.util.Map<java.lang.Long,java.lang.Character>values in interface Long2CharMapvalues in class AbstractLong2CharMap