public class Long2IntOpenCustomHashMap extends AbstractLong2IntMap implements ITrimmable
AbstractLong2IntMap.BasicEntryjava.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Long2IntMap.BuilderCache, Long2IntMap.Entry, Long2IntMap.FastEntrySet, Long2IntMap.MapBuilder| Constructor and Description |
|---|
Long2IntOpenCustomHashMap(int minCapacity,
float loadFactor,
LongStrategy strategy)
Constructor that defines the minimum capacity and load factor
|
Long2IntOpenCustomHashMap(int minCapacity,
LongStrategy strategy)
Constructor that defines the minimum capacity
|
Long2IntOpenCustomHashMap(long[] keys,
int[] values,
float loadFactor,
LongStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Long2IntOpenCustomHashMap(long[] keys,
int[] values,
LongStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Long2IntOpenCustomHashMap(java.lang.Long[] keys,
java.lang.Integer[] values,
float loadFactor,
LongStrategy strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Long2IntOpenCustomHashMap(java.lang.Long[] keys,
java.lang.Integer[] values,
LongStrategy strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Long2IntOpenCustomHashMap(Long2IntMap map,
float loadFactor,
LongStrategy strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Long2IntOpenCustomHashMap(Long2IntMap map,
LongStrategy strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Long2IntOpenCustomHashMap(LongStrategy strategy)
Default Contstructor
|
Long2IntOpenCustomHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Integer> map,
float loadFactor,
LongStrategy strategy)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Long2IntOpenCustomHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Integer> map,
LongStrategy 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 |
|---|---|
int |
addTo(long key,
int 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
|
int |
computeInt(long key,
LongIntUnaryOperator mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
int |
computeIntIfAbsent(long key,
Long2IntFunction mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
int |
computeIntIfPresent(long key,
LongIntUnaryOperator mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
boolean |
containsKey(long key)
Type Specific method to reduce boxing/unboxing of values
|
boolean |
containsKey(java.lang.Object key)
Deprecated.
|
boolean |
containsValue(int value)
Type Specific method to reduce boxing/unboxing of values
|
boolean |
containsValue(java.lang.Object value)
Deprecated.
|
Long2IntOpenCustomHashMap |
copy()
A Function that does a shallow clone of the Map itself.
|
void |
forEach(LongIntConsumer action)
Type Specific forEach method to reduce boxing/unboxing
|
int |
get(long key)
A Type Specific get method to reduce boxing/unboxing
|
java.lang.Integer |
get(java.lang.Object key) |
int |
getOrDefault(long key,
int defaultValue)
A Type Specific getOrDefault method to reduce boxing/unboxing
|
LongSet |
keySet() |
ObjectSet<Long2IntMap.Entry> |
long2IntEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
void |
mergeAllInt(Long2IntMap m,
IntIntUnaryOperator mappingFunction)
A Bulk method for merging Maps.
|
int |
mergeInt(long key,
int value,
IntIntUnaryOperator mappingFunction)
A Type Specific merge method to reduce boxing/unboxing
|
int |
put(long key,
int value)
Type Specific method to reduce boxing/unboxing of values
|
int |
putIfAbsent(long key,
int value)
Type Specific method to reduce boxing/unboxing of values
|
int |
remove(long key)
Type Specific remove function to reduce boxing/unboxing
|
boolean |
remove(long key,
int value)
Type Specific remove function to reduce boxing/unboxing
|
java.lang.Integer |
remove(java.lang.Object key) |
boolean |
remove(java.lang.Object key,
java.lang.Object value) |
int |
removeOrDefault(long key,
int defaultValue)
Type-Specific Remove function with a default return value if wanted.
|
int |
replace(long key,
int value)
A Type Specific replace method to reduce boxing/unboxing replace an existing value
|
boolean |
replace(long key,
int oldValue,
int newValue)
A Type Specific replace method to replace an existing value
|
int |
size() |
int |
subFrom(long key,
int value)
A Helper method to subtract from primitive from each other.
|
int |
supplyIntIfAbsent(long key,
IntSupplier 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
|
IntCollection |
values() |
addToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, replaceInts, replaceInts, setDefaultReturnValueclearAndTrim, trimapplyAsInt, builder, compute, computeIfAbsent, computeIfPresent, forEach, merge, put, put, putAll, putAll, putIfAbsent, replace, replace, replaceAll, synchronize, synchronize, unmodifiablepublic Long2IntOpenCustomHashMap(LongStrategy strategy)
strategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Long2IntOpenCustomHashMap(int minCapacity,
LongStrategy 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 Long2IntOpenCustomHashMap(int minCapacity,
float loadFactor,
LongStrategy 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 Long2IntOpenCustomHashMap(java.lang.Long[] keys,
java.lang.Integer[] values,
LongStrategy 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 Long2IntOpenCustomHashMap(java.lang.Long[] keys,
java.lang.Integer[] values,
float loadFactor,
LongStrategy 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 Long2IntOpenCustomHashMap(long[] keys,
int[] values,
LongStrategy 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 Long2IntOpenCustomHashMap(long[] keys,
int[] values,
float loadFactor,
LongStrategy 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 Long2IntOpenCustomHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Integer> map,
LongStrategy strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Long2IntOpenCustomHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Integer> map,
float loadFactor,
LongStrategy 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 Long2IntOpenCustomHashMap(Long2IntMap map, LongStrategy strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Long2IntOpenCustomHashMap(Long2IntMap map, float loadFactor, LongStrategy 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 int put(long key,
int value)
Long2IntMapput in interface Long2IntMapkey - the key that should be inserted,value - the value that should be insertedMap.put(Object, Object)public int putIfAbsent(long key,
int value)
Long2IntMapputIfAbsent in interface Long2IntMapkey - the key that should be inserted,value - the value that should be insertedMap.putIfAbsent(Object, Object)public int addTo(long key,
int value)
Long2IntMapaddTo in interface Long2IntMapkey - the key that should be inserted,value - the value that should be inserted / addedpublic int subFrom(long key,
int value)
Long2IntMapLong2IntMap.getDefaultReturnValue()
If the fence is reached the element will be automaticall removedsubFrom in interface Long2IntMapkey - that should be subtract fromvalue - that should be subtractpublic boolean containsKey(long key)
Long2IntMapcontainsKey in interface Long2IntMapcontainsKey in class AbstractLong2IntMapkey - element that is searched for@Deprecated public boolean containsKey(java.lang.Object key)
containsKey in interface java.util.Map<java.lang.Long,java.lang.Integer>containsKey in interface Long2IntMapcontainsKey in class java.util.AbstractMap<java.lang.Long,java.lang.Integer>key - that is searched for.Map.containsKey(Object)public boolean containsValue(int value)
Long2IntMapcontainsValue in interface Long2IntMapcontainsValue in class AbstractLong2IntMapvalue - element that is searched for@Deprecated public boolean containsValue(java.lang.Object value)
containsValue in interface java.util.Map<java.lang.Long,java.lang.Integer>containsValue in interface Long2IntMapcontainsValue in class java.util.AbstractMap<java.lang.Long,java.lang.Integer>value - that is searched for.Map.containsValue(Object)public int remove(long key)
Long2IntMapremove in interface Long2IntMapkey - the element that should be removedpublic int removeOrDefault(long key,
int defaultValue)
Long2IntMapremoveOrDefault in interface Long2IntMapkey - the element that should be removeddefaultValue - the value that should be returned if the entry doesn't existMap.remove(Object, Object)public java.lang.Integer remove(java.lang.Object key)
remove in interface java.util.Map<java.lang.Long,java.lang.Integer>remove in interface Long2IntMapremove in class AbstractLong2IntMapkey - the element that should be removedMap.remove(Object)public boolean remove(long key,
int value)
Long2IntMapremove in interface Long2IntMapkey - 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.Long,java.lang.Integer>remove in interface Long2IntMapkey - the element that should be removedvalue - the expected value that should be foundMap.remove(Object, Object)public int get(long key)
Long2IntMapget in interface Long2IntMapkey - the key that is searched forpublic java.lang.Integer get(java.lang.Object key)
get in interface java.util.Map<java.lang.Long,java.lang.Integer>get in interface Long2IntMapget in class AbstractLong2IntMappublic int getOrDefault(long key,
int defaultValue)
Long2IntMapgetOrDefault in interface Long2IntMapgetOrDefault in class AbstractLong2IntMapkey - the key that is searched fordefaultValue - the value that should be returned if the key is not presentpublic Long2IntOpenCustomHashMap copy()
Long2IntMapcopy in interface Long2IntMapcopy in class AbstractLong2IntMappublic ObjectSet<Long2IntMap.Entry> long2IntEntrySet()
Long2IntMaplong2IntEntrySet in interface Long2IntMappublic LongSet keySet()
keySet in interface java.util.Map<java.lang.Long,java.lang.Integer>keySet in interface Long2IntMapkeySet in class AbstractLong2IntMappublic IntCollection values()
values in interface java.util.Map<java.lang.Long,java.lang.Integer>values in interface Long2IntMapvalues in class AbstractLong2IntMappublic void forEach(LongIntConsumer action)
Long2IntMapforEach in interface Long2IntMapforEach in class AbstractLong2IntMapaction - processor of the values that are iterator overpublic boolean replace(long key,
int oldValue,
int newValue)
Long2IntMapreplace in interface Long2IntMapreplace in class AbstractLong2IntMapkey - the element that should be searched foroldValue - the expected value to be replacednewValue - the value to replace the oldValue with.public int replace(long key,
int value)
Long2IntMapreplace in interface Long2IntMapreplace in class AbstractLong2IntMapkey - the element that should be searched forvalue - the value to replace with.public int computeInt(long key,
LongIntUnaryOperator mappingFunction)
Long2IntMapcomputeInt in interface Long2IntMapcomputeInt in class AbstractLong2IntMapkey - the key that should be computedmappingFunction - the operator that should generate the valuepublic int computeIntIfAbsent(long key,
Long2IntFunction mappingFunction)
Long2IntMapcomputeIntIfAbsent in interface Long2IntMapcomputeIntIfAbsent in class AbstractLong2IntMapkey - the key that should be computedmappingFunction - the operator that should generate the value if not presentpublic int supplyIntIfAbsent(long key,
IntSupplier valueProvider)
Long2IntMapsupplyIntIfAbsent in interface Long2IntMapsupplyIntIfAbsent in class AbstractLong2IntMapkey - the key that should be computedvalueProvider - the value if not presentpublic int computeIntIfPresent(long key,
LongIntUnaryOperator mappingFunction)
Long2IntMapcomputeIntIfPresent in interface Long2IntMapcomputeIntIfPresent in class AbstractLong2IntMapkey - the key that should be computedmappingFunction - the operator that should generate the value if presentpublic int mergeInt(long key,
int value,
IntIntUnaryOperator mappingFunction)
Long2IntMapmergeInt in interface Long2IntMapmergeInt in class AbstractLong2IntMapkey - the key that should be be searched forvalue - the value that should be merged withmappingFunction - the operator that should generate the new Valuepublic void mergeAllInt(Long2IntMap m, IntIntUnaryOperator mappingFunction)
Long2IntMapmergeAllInt in interface Long2IntMapmergeAllInt in class AbstractLong2IntMapm - 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.Long,java.lang.Integer>size in class java.util.AbstractMap<java.lang.Long,java.lang.Integer>public void clear()
clear in interface java.util.Map<java.lang.Long,java.lang.Integer>clear in class java.util.AbstractMap<java.lang.Long,java.lang.Integer>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