public class Int2IntOpenCustomHashMap extends AbstractInt2IntMap implements ITrimmable
AbstractInt2IntMap.BasicEntryjava.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Int2IntMap.BuilderCache, Int2IntMap.Entry, Int2IntMap.FastEntrySet, Int2IntMap.MapBuilder| Constructor and Description |
|---|
Int2IntOpenCustomHashMap(int[] keys,
int[] values,
float loadFactor,
IntStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Int2IntOpenCustomHashMap(int[] keys,
int[] values,
IntStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Int2IntOpenCustomHashMap(Int2IntMap map,
float loadFactor,
IntStrategy strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Int2IntOpenCustomHashMap(Int2IntMap map,
IntStrategy strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Int2IntOpenCustomHashMap(java.lang.Integer[] keys,
java.lang.Integer[] values,
float loadFactor,
IntStrategy strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Int2IntOpenCustomHashMap(java.lang.Integer[] keys,
java.lang.Integer[] values,
IntStrategy strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Int2IntOpenCustomHashMap(int minCapacity,
float loadFactor,
IntStrategy strategy)
Constructor that defines the minimum capacity and load factor
|
Int2IntOpenCustomHashMap(int minCapacity,
IntStrategy strategy)
Constructor that defines the minimum capacity
|
Int2IntOpenCustomHashMap(IntStrategy strategy)
Default Contstructor
|
Int2IntOpenCustomHashMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> map,
float loadFactor,
IntStrategy strategy)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Int2IntOpenCustomHashMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> map,
IntStrategy 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(int 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(int key,
IntIntUnaryOperator mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
int |
computeIntIfAbsent(int key,
Int2IntFunction mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
int |
computeIntIfPresent(int key,
IntIntUnaryOperator mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
boolean |
containsKey(int 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.
|
Int2IntOpenCustomHashMap |
copy()
A Function that does a shallow clone of the Map itself.
|
void |
forEach(IntIntConsumer action)
Type Specific forEach method to reduce boxing/unboxing
|
int |
get(int key)
A Type Specific get method to reduce boxing/unboxing
|
java.lang.Integer |
get(java.lang.Object key) |
int |
getOrDefault(int key,
int defaultValue)
A Type Specific getOrDefault method to reduce boxing/unboxing
|
ObjectSet<Int2IntMap.Entry> |
int2IntEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
IntSet |
keySet() |
void |
mergeAllInt(Int2IntMap m,
IntIntUnaryOperator mappingFunction)
A Bulk method for merging Maps.
|
int |
mergeInt(int key,
int value,
IntIntUnaryOperator mappingFunction)
A Type Specific merge method to reduce boxing/unboxing
|
int |
put(int key,
int value)
Type Specific method to reduce boxing/unboxing of values
|
int |
putIfAbsent(int key,
int value)
Type Specific method to reduce boxing/unboxing of values
|
int |
remove(int key)
Type Specific remove function to reduce boxing/unboxing
|
boolean |
remove(int 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(int key,
int defaultValue)
Type-Specific Remove function with a default return value if wanted.
|
int |
replace(int key,
int value)
A Type Specific replace method to reduce boxing/unboxing replace an existing value
|
boolean |
replace(int key,
int oldValue,
int newValue)
A Type Specific replace method to replace an existing value
|
int |
size() |
int |
subFrom(int key,
int value)
A Helper method to subtract from primitive from each other.
|
int |
supplyIntIfAbsent(int 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, trimbuilder, compute, computeIfAbsent, computeIfPresent, forEach, merge, putAll, putAll, putIfAbsent, replace, replace, replaceAll, synchronize, synchronize, unmodifiableapplyAsIntpublic Int2IntOpenCustomHashMap(IntStrategy strategy)
strategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Int2IntOpenCustomHashMap(int minCapacity,
IntStrategy 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 Int2IntOpenCustomHashMap(int minCapacity,
float loadFactor,
IntStrategy 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 Int2IntOpenCustomHashMap(java.lang.Integer[] keys,
java.lang.Integer[] values,
IntStrategy 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 Int2IntOpenCustomHashMap(java.lang.Integer[] keys,
java.lang.Integer[] values,
float loadFactor,
IntStrategy 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 Int2IntOpenCustomHashMap(int[] keys,
int[] values,
IntStrategy 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 Int2IntOpenCustomHashMap(int[] keys,
int[] values,
float loadFactor,
IntStrategy 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 Int2IntOpenCustomHashMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> map,
IntStrategy strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Int2IntOpenCustomHashMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> map,
float loadFactor,
IntStrategy 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 Int2IntOpenCustomHashMap(Int2IntMap map, IntStrategy strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Int2IntOpenCustomHashMap(Int2IntMap map, float loadFactor, IntStrategy 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(int key,
int value)
Int2IntMapput in interface Int2IntMapkey - the key that should be inserted,value - the value that should be insertedMap.put(Object, Object)public int putIfAbsent(int key,
int value)
Int2IntMapputIfAbsent in interface Int2IntMapkey - the key that should be inserted,value - the value that should be insertedMap.putIfAbsent(Object, Object)public int addTo(int key,
int value)
Int2IntMapaddTo in interface Int2IntMapkey - the key that should be inserted,value - the value that should be inserted / addedpublic int subFrom(int key,
int value)
Int2IntMapInt2IntMap.getDefaultReturnValue()
If the fence is reached the element will be automaticall removedsubFrom in interface Int2IntMapkey - that should be subtract fromvalue - that should be subtractpublic boolean containsKey(int key)
Int2IntMapcontainsKey in interface Int2IntMapcontainsKey in class AbstractInt2IntMapkey - element that is searched for@Deprecated public boolean containsKey(java.lang.Object key)
containsKey in interface java.util.Map<java.lang.Integer,java.lang.Integer>containsKey in interface Int2IntMapcontainsKey in class java.util.AbstractMap<java.lang.Integer,java.lang.Integer>key - that is searched for.Map.containsKey(Object)public boolean containsValue(int value)
Int2IntMapcontainsValue in interface Int2IntMapcontainsValue in class AbstractInt2IntMapvalue - element that is searched for@Deprecated public boolean containsValue(java.lang.Object value)
containsValue in interface java.util.Map<java.lang.Integer,java.lang.Integer>containsValue in interface Int2IntMapcontainsValue in class java.util.AbstractMap<java.lang.Integer,java.lang.Integer>value - that is searched for.Map.containsValue(Object)public int remove(int key)
Int2IntMapremove in interface Int2IntMapkey - the element that should be removedpublic int removeOrDefault(int key,
int defaultValue)
Int2IntMapremoveOrDefault in interface Int2IntMapkey - 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.Integer,java.lang.Integer>remove in interface Int2IntMapremove in class AbstractInt2IntMapkey - the element that should be removedMap.remove(Object)public boolean remove(int key,
int value)
Int2IntMapremove in interface Int2IntMapkey - 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.Integer,java.lang.Integer>remove in interface Int2IntMapkey - the element that should be removedvalue - the expected value that should be foundMap.remove(Object, Object)public int get(int key)
Int2IntMapget in interface Int2IntFunctionget in interface Int2IntMapkey - the key that is searched forpublic java.lang.Integer get(java.lang.Object key)
get in interface java.util.Map<java.lang.Integer,java.lang.Integer>get in interface Int2IntMapget in class AbstractInt2IntMappublic int getOrDefault(int key,
int defaultValue)
Int2IntMapgetOrDefault in interface Int2IntMapgetOrDefault in class AbstractInt2IntMapkey - the key that is searched fordefaultValue - the value that should be returned if the key is not presentpublic Int2IntOpenCustomHashMap copy()
Int2IntMapcopy in interface Int2IntMapcopy in class AbstractInt2IntMappublic ObjectSet<Int2IntMap.Entry> int2IntEntrySet()
Int2IntMapint2IntEntrySet in interface Int2IntMappublic IntSet keySet()
keySet in interface java.util.Map<java.lang.Integer,java.lang.Integer>keySet in interface Int2IntMapkeySet in class AbstractInt2IntMappublic IntCollection values()
values in interface java.util.Map<java.lang.Integer,java.lang.Integer>values in interface Int2IntMapvalues in class AbstractInt2IntMappublic void forEach(IntIntConsumer action)
Int2IntMapforEach in interface Int2IntMapforEach in class AbstractInt2IntMapaction - processor of the values that are iterator overpublic boolean replace(int key,
int oldValue,
int newValue)
Int2IntMapreplace in interface Int2IntMapreplace in class AbstractInt2IntMapkey - the element that should be searched foroldValue - the expected value to be replacednewValue - the value to replace the oldValue with.public int replace(int key,
int value)
Int2IntMapreplace in interface Int2IntMapreplace in class AbstractInt2IntMapkey - the element that should be searched forvalue - the value to replace with.public int computeInt(int key,
IntIntUnaryOperator mappingFunction)
Int2IntMapcomputeInt in interface Int2IntMapcomputeInt in class AbstractInt2IntMapkey - the key that should be computedmappingFunction - the operator that should generate the valuepublic int computeIntIfAbsent(int key,
Int2IntFunction mappingFunction)
Int2IntMapcomputeIntIfAbsent in interface Int2IntMapcomputeIntIfAbsent in class AbstractInt2IntMapkey - the key that should be computedmappingFunction - the operator that should generate the value if not presentpublic int supplyIntIfAbsent(int key,
IntSupplier valueProvider)
Int2IntMapsupplyIntIfAbsent in interface Int2IntMapsupplyIntIfAbsent in class AbstractInt2IntMapkey - the key that should be computedvalueProvider - the value if not presentpublic int computeIntIfPresent(int key,
IntIntUnaryOperator mappingFunction)
Int2IntMapcomputeIntIfPresent in interface Int2IntMapcomputeIntIfPresent in class AbstractInt2IntMapkey - the key that should be computedmappingFunction - the operator that should generate the value if presentpublic int mergeInt(int key,
int value,
IntIntUnaryOperator mappingFunction)
Int2IntMapmergeInt in interface Int2IntMapmergeInt in class AbstractInt2IntMapkey - 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(Int2IntMap m, IntIntUnaryOperator mappingFunction)
Int2IntMapmergeAllInt in interface Int2IntMapmergeAllInt in class AbstractInt2IntMapm - 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.Integer,java.lang.Integer>size in class java.util.AbstractMap<java.lang.Integer,java.lang.Integer>public void clear()
clear in interface java.util.Map<java.lang.Integer,java.lang.Integer>clear in class java.util.AbstractMap<java.lang.Integer,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