T - the type of elements maintained by this Collectionpublic class ImmutableObject2IntOpenHashMap<T> extends AbstractObject2IntMap<T> implements Object2IntOrderedMap<T>
AbstractObject2IntMap.BasicEntry<T>java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Object2IntOrderedMap.FastOrderedSet<T>Object2IntMap.BuilderCache<T>, Object2IntMap.Entry<T>, Object2IntMap.FastEntrySet<T>, Object2IntMap.MapBuilder| Constructor and Description |
|---|
ImmutableObject2IntOpenHashMap(java.util.Map<? extends T,? extends java.lang.Integer> map)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
ImmutableObject2IntOpenHashMap(java.util.Map<? extends T,? extends java.lang.Integer> map,
float loadFactor)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
ImmutableObject2IntOpenHashMap(Object2IntMap<T> map)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
ImmutableObject2IntOpenHashMap(Object2IntMap<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.
|
ImmutableObject2IntOpenHashMap(T[] keys,
int[] values)
Helper constructor that allow to create a map from unboxed values
|
ImmutableObject2IntOpenHashMap(T[] keys,
int[] values,
float loadFactor)
Helper constructor that allow to create a map from unboxed values
|
ImmutableObject2IntOpenHashMap(T[] keys,
java.lang.Integer[] values)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
ImmutableObject2IntOpenHashMap(T[] keys,
java.lang.Integer[] values,
float loadFactor)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
| Modifier and Type | Method and Description |
|---|---|
int |
addTo(T key,
int value)
A Helper method to add a primitives together.
|
void |
clear() |
int |
computeInt(T key,
ObjectIntUnaryOperator<T> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
int |
computeIntIfAbsent(T key,
Object2IntFunction<T> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
int |
computeIntIfPresent(T key,
ObjectIntUnaryOperator<T> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
boolean |
containsKey(java.lang.Object key) |
boolean |
containsValue(int value)
Type Specific method to reduce boxing/unboxing of values
|
boolean |
containsValue(java.lang.Object value)
Deprecated.
|
ImmutableObject2IntOpenHashMap<T> |
copy()
A Function that does a shallow clone of the Map itself.
|
int |
firstIntValue()
A method to get the first Value of a Map.
|
T |
firstKey()
A method to get the first Key of a Map.
|
void |
forEach(ObjectIntConsumer<T> action)
Type Specific forEach method to reduce boxing/unboxing
|
java.lang.Integer |
get(java.lang.Object key) |
int |
getAndMoveToFirst(T key)
A Specific get method that allows to move teh given key/value int the first index.
|
int |
getAndMoveToLast(T key)
A Specific get method that allows to move teh given key/value int the last index.
|
int |
getInt(T key)
A Type Specific get method to reduce boxing/unboxing
|
int |
getOrDefault(T key,
int defaultValue)
A Type Specific getOrDefault method to reduce boxing/unboxing
|
ObjectOrderedSet<T> |
keySet() |
int |
lastIntValue()
A method to get the last Value of a Map.
|
T |
lastKey()
A method to get the last Key of a Map.
|
void |
mergeAllInt(Object2IntMap<T> m,
IntIntUnaryOperator mappingFunction)
A Bulk method for merging Maps.
|
int |
mergeInt(T key,
int value,
IntIntUnaryOperator mappingFunction)
A Type Specific merge method to reduce boxing/unboxing
|
boolean |
moveToFirst(T key)
A specific move method to move a given key/value to the first index.
|
boolean |
moveToLast(T key)
A specific move method to move a given key/value to the last index.
|
ObjectOrderedSet<Object2IntMap.Entry<T>> |
object2IntEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
T |
pollFirstKey()
A method to get and remove the first Key of a Map.
|
T |
pollLastKey()
A method to get and remove the last Key of a Map.
|
int |
put(T key,
int value)
Type Specific method to reduce boxing/unboxing of values
|
int |
putAndMoveToFirst(T key,
int value)
A customized put method that allows you to insert into the first index.
|
int |
putAndMoveToLast(T key,
int value)
A customized put method that allows you to insert into the last index.
|
int |
putIfAbsent(T key,
int value)
Type Specific method to reduce boxing/unboxing of values
|
int |
rem(T key)
Type Specific remove function to reduce boxing/unboxing
|
int |
remOrDefault(T key,
int defaultValue)
Type-Specific Remove function with a default return value if wanted.
|
java.lang.Integer |
remove(java.lang.Object key)
Deprecated.
|
boolean |
remove(java.lang.Object key,
java.lang.Object value) |
boolean |
remove(T key,
int value)
Type Specific remove function to reduce boxing/unboxing
|
int |
replace(T key,
int value)
A Type Specific replace method to reduce boxing/unboxing replace an existing value
|
boolean |
replace(T key,
int oldValue,
int newValue)
A Type Specific replace method to replace an existing value
|
int |
size() |
int |
subFrom(T key,
int value)
A Helper method to subtract from primitive from each other.
|
int |
supplyIntIfAbsent(T key,
IntSupplier valueProvider)
A Supplier based computeIfAbsent function to fill the most used usecase of this function
|
IntCollection |
values() |
addToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, replaceInts, replaceInts, setDefaultReturnValuesynchronize, synchronize, unmodifiableaddToAll, builder, compute, computeIfAbsent, computeIfPresent, entrySet, forEach, getDefaultReturnValue, getOrDefault, merge, put, putAll, putAll, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, replace, replace, replaceAll, replaceInts, replaceInts, setDefaultReturnValueapplyAsIntpublic ImmutableObject2IntOpenHashMap(T[] keys, java.lang.Integer[] 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 ImmutableObject2IntOpenHashMap(T[] keys, java.lang.Integer[] 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 ImmutableObject2IntOpenHashMap(T[] keys, int[] 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 ImmutableObject2IntOpenHashMap(T[] keys, int[] 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 ImmutableObject2IntOpenHashMap(java.util.Map<? extends T,? extends java.lang.Integer> map)
map - the values that should be present in the mappublic ImmutableObject2IntOpenHashMap(java.util.Map<? extends T,? extends java.lang.Integer> 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 ImmutableObject2IntOpenHashMap(Object2IntMap<T> map)
map - the values that should be present in the mappublic ImmutableObject2IntOpenHashMap(Object2IntMap<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 int put(T key, int value)
Object2IntMapput in interface Object2IntMap<T>key - the key that should be inserted,value - the value that should be insertedMap.put(Object, Object)public int putIfAbsent(T key, int value)
Object2IntMapputIfAbsent in interface Object2IntMap<T>key - the key that should be inserted,value - the value that should be insertedMap.putIfAbsent(Object, Object)public int addTo(T key, int value)
Object2IntMapaddTo in interface Object2IntMap<T>key - the key that should be inserted,value - the value that should be inserted / addedpublic int subFrom(T key, int value)
Object2IntMapObject2IntMap.getDefaultReturnValue()
If the fence is reached the element will be automaticall removedsubFrom in interface Object2IntMap<T>key - that should be subtract fromvalue - that should be subtractpublic int putAndMoveToFirst(T key, int value)
Object2IntOrderedMapputAndMoveToFirst in interface Object2IntOrderedMap<T>key - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public int putAndMoveToLast(T key, int value)
Object2IntOrderedMapputAndMoveToLast in interface Object2IntOrderedMap<T>key - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public boolean moveToFirst(T key)
Object2IntOrderedMapmoveToFirst in interface Object2IntOrderedMap<T>key - that should be moved to the first indexpublic boolean moveToLast(T key)
Object2IntOrderedMapmoveToLast in interface Object2IntOrderedMap<T>key - that should be moved to the first lastpublic int getAndMoveToFirst(T key)
Object2IntOrderedMapgetAndMoveToFirst in interface Object2IntOrderedMap<T>key - that is searched forpublic int getAndMoveToLast(T key)
Object2IntOrderedMapgetAndMoveToLast in interface Object2IntOrderedMap<T>key - that is searched forpublic boolean containsKey(java.lang.Object key)
containsKey in interface java.util.Map<T,java.lang.Integer>containsKey in class AbstractObject2IntMap<T>public boolean containsValue(int value)
Object2IntMapcontainsValue in interface Object2IntMap<T>containsValue in class AbstractObject2IntMap<T>value - element that is searched for@Deprecated public boolean containsValue(java.lang.Object value)
containsValue in interface java.util.Map<T,java.lang.Integer>containsValue in interface Object2IntMap<T>containsValue in class java.util.AbstractMap<T,java.lang.Integer>value - that is searched for.Map.containsValue(Object)public int rem(T key)
Object2IntMaprem in interface Object2IntMap<T>key - the element that should be removedpublic int remOrDefault(T key, int defaultValue)
Object2IntMapremOrDefault in interface Object2IntMap<T>key - the element that should be removeddefaultValue - the value that should be returned if the entry doesn't existMap.remove(Object, Object)@Deprecated public java.lang.Integer remove(java.lang.Object key)
remove in interface java.util.Map<T,java.lang.Integer>remove in interface Object2IntMap<T>remove in class AbstractObject2IntMap<T>key - the element that should be removedMap.remove(Object)public boolean remove(T key, int value)
Object2IntMapremove in interface Object2IntMap<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.Map<T,java.lang.Integer>remove in interface Object2IntMap<T>key - the element that should be removedvalue - the expected value that should be foundMap.remove(Object, Object)public int getInt(T key)
Object2IntMapgetInt in interface Object2IntFunction<T>getInt in interface Object2IntMap<T>key - the key that is searched forpublic java.lang.Integer get(java.lang.Object key)
get in interface java.util.Map<T,java.lang.Integer>get in interface Object2IntMap<T>get in class AbstractObject2IntMap<T>public int getOrDefault(T key, int defaultValue)
Object2IntMapgetOrDefault in interface Object2IntMap<T>key - the key that is searched fordefaultValue - the value that should be returned if the key is not presentpublic T firstKey()
Object2IntOrderedMapfirstKey in interface Object2IntOrderedMap<T>public T pollFirstKey()
Object2IntOrderedMappollFirstKey in interface Object2IntOrderedMap<T>public T lastKey()
Object2IntOrderedMaplastKey in interface Object2IntOrderedMap<T>public T pollLastKey()
Object2IntOrderedMappollLastKey in interface Object2IntOrderedMap<T>public int firstIntValue()
Object2IntOrderedMapfirstIntValue in interface Object2IntOrderedMap<T>public int lastIntValue()
Object2IntOrderedMaplastIntValue in interface Object2IntOrderedMap<T>public ObjectOrderedSet<Object2IntMap.Entry<T>> object2IntEntrySet()
Object2IntMapobject2IntEntrySet in interface Object2IntMap<T>object2IntEntrySet in interface Object2IntOrderedMap<T>public ObjectOrderedSet<T> keySet()
keySet in interface java.util.Map<T,java.lang.Integer>keySet in interface Object2IntMap<T>keySet in interface Object2IntOrderedMap<T>keySet in class AbstractObject2IntMap<T>public IntCollection values()
values in interface java.util.Map<T,java.lang.Integer>values in interface Object2IntMap<T>values in class AbstractObject2IntMap<T>public ImmutableObject2IntOpenHashMap<T> copy()
Object2IntMapcopy in interface Object2IntMap<T>copy in interface Object2IntOrderedMap<T>copy in class AbstractObject2IntMap<T>public void forEach(ObjectIntConsumer<T> action)
Object2IntMapforEach in interface Object2IntMap<T>forEach in class AbstractObject2IntMap<T>action - processor of the values that are iterator overpublic boolean replace(T key, int oldValue, int newValue)
Object2IntMapreplace in interface Object2IntMap<T>replace in class AbstractObject2IntMap<T>key - the element that should be searched foroldValue - the expected value to be replacednewValue - the value to replace the oldValue with.public int replace(T key, int value)
Object2IntMapreplace in interface Object2IntMap<T>replace in class AbstractObject2IntMap<T>key - the element that should be searched forvalue - the value to replace with.public int computeInt(T key, ObjectIntUnaryOperator<T> mappingFunction)
Object2IntMapcomputeInt in interface Object2IntMap<T>computeInt in class AbstractObject2IntMap<T>key - the key that should be computedmappingFunction - the operator that should generate the valuepublic int computeIntIfAbsent(T key, Object2IntFunction<T> mappingFunction)
Object2IntMapcomputeIntIfAbsent in interface Object2IntMap<T>computeIntIfAbsent in class AbstractObject2IntMap<T>key - the key that should be computedmappingFunction - the operator that should generate the value if not presentpublic int supplyIntIfAbsent(T key, IntSupplier valueProvider)
Object2IntMapsupplyIntIfAbsent in interface Object2IntMap<T>supplyIntIfAbsent in class AbstractObject2IntMap<T>key - the key that should be computedvalueProvider - the value if not presentpublic int computeIntIfPresent(T key, ObjectIntUnaryOperator<T> mappingFunction)
Object2IntMapcomputeIntIfPresent in interface Object2IntMap<T>computeIntIfPresent in class AbstractObject2IntMap<T>key - the key that should be computedmappingFunction - the operator that should generate the value if presentpublic int mergeInt(T key, int value, IntIntUnaryOperator mappingFunction)
Object2IntMapmergeInt in interface Object2IntMap<T>mergeInt in class AbstractObject2IntMap<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 mergeAllInt(Object2IntMap<T> m, IntIntUnaryOperator mappingFunction)
Object2IntMapmergeAllInt in interface Object2IntMap<T>mergeAllInt in class AbstractObject2IntMap<T>m - the entries that should be bulk addedmappingFunction - the operator that should generate the new Valuepublic int size()