T - the type of elements maintained by this Collectionpublic class Object2IntArrayMap<T> extends AbstractObject2IntMap<T> implements Object2IntSortedMap<T>
AbstractObject2IntMap.BasicEntry<T>java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Object2IntSortedMap.FastSortedSet<T>Object2IntMap.Entry<T>, Object2IntMap.FastEntrySet<T>| Constructor and Description |
|---|
Object2IntArrayMap()
Default Constructor
|
Object2IntArrayMap(int minCapacity)
Constructor that defines the minimum capacity
|
Object2IntArrayMap(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.
|
Object2IntArrayMap(Object2IntMap<T> map)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Object2IntArrayMap(T[] keys,
int[] values)
Helper constructor that allow to create a map from unboxed values
|
Object2IntArrayMap(T[] keys,
int[] values,
int length)
Helper constructor that allow to create a map from unboxed values
|
Object2IntArrayMap(T[] keys,
java.lang.Integer[] values)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Object2IntArrayMap(T[] keys,
java.lang.Integer[] values,
int length)
Helper constructor that allow to create a map from boxed values (it will unbox them) with a custom length
|
| Modifier and Type | Method and Description |
|---|---|
int |
addTo(T key,
int value)
A Helper method to add a primitives together.
|
void |
clear() |
java.util.Comparator<T> |
comparator() |
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) |
int |
firstIntValue()
A method to get the first Value of a Map.
|
T |
firstKey() |
void |
forEach(ObjectIntConsumer<T> action)
Type Specific forEach method to reduce boxing/unboxing
|
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(java.lang.Object key,
int defaultValue)
A Type Specific getOrDefault method to reduce boxing/unboxing
|
Object2IntSortedMap<T> |
headMap(T toKey) |
ObjectSet<T> |
keySet() |
int |
lastIntValue()
A method to get the last Value of a Map.
|
T |
lastKey() |
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.
|
ObjectSortedSet<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) |
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() |
Object2IntSortedMap<T> |
subMap(T fromKey,
T toKey) |
Object2IntSortedMap<T> |
tailMap(T fromKey) |
IntCollection |
values() |
addToAll, entrySet, equals, get, getDefaultReturnValue, getOrDefault, hashCode, putAll, putAll, putAll, putAllIfAbsent, replaceInts, replaceInts, setDefaultReturnValueaddToAll, compute, computeIfAbsent, computeIfPresent, entrySet, forEach, get, getDefaultReturnValue, getOrDefault, merge, put, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, replace, replace, replaceAll, replaceInts, replaceInts, setDefaultReturnValueapplyAsIntpublic Object2IntArrayMap()
public Object2IntArrayMap(int minCapacity)
minCapacity - the minimum capacity the HashMap is allowed to be.java.lang.IllegalStateException - if the minimum capacity is negativepublic Object2IntArrayMap(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 lengthpublic Object2IntArrayMap(T[] keys, java.lang.Integer[] values, int length)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.length - the amount of values that should be pulled from the arrayjava.lang.IllegalStateException - if the keys and values do not match in lengthpublic Object2IntArrayMap(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 Object2IntArrayMap(T[] keys, int[] values, int length)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.length - the amount of values that should be pulled from the arrayjava.lang.IllegalStateException - if the keys and values do not match in lenghtpublic Object2IntArrayMap(java.util.Map<? extends T,? extends java.lang.Integer> map)
map - the values that should be present in the mappublic Object2IntArrayMap(Object2IntMap<T> map)
map - the values that should be present in the mappublic 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 putAndMoveToFirst(T key, int value)
Object2IntSortedMapputAndMoveToFirst in interface Object2IntSortedMap<T>key - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public int putAndMoveToLast(T key, int value)
Object2IntSortedMapputAndMoveToLast in interface Object2IntSortedMap<T>key - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public boolean moveToFirst(T key)
Object2IntSortedMapmoveToFirst in interface Object2IntSortedMap<T>key - that should be moved to the first indexpublic boolean moveToLast(T key)
Object2IntSortedMapmoveToLast in interface Object2IntSortedMap<T>key - that should be moved to the first lastpublic boolean containsValue(int value)
Object2IntMapcontainsValue in interface Object2IntMap<T>containsValue in class AbstractObject2IntMap<T>value - element 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(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 getInt(T key)
Object2IntMapgetInt in interface Object2IntFunction<T>getInt in interface Object2IntMap<T>key - the key that is searched forpublic int getOrDefault(java.lang.Object 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 int getAndMoveToFirst(T key)
Object2IntSortedMapgetAndMoveToFirst in interface Object2IntSortedMap<T>key - that is searched forpublic int getAndMoveToLast(T key)
Object2IntSortedMapgetAndMoveToLast in interface Object2IntSortedMap<T>key - that is searched forpublic T firstKey()
firstKey in interface java.util.SortedMap<T,java.lang.Integer>public T lastKey()
lastKey in interface java.util.SortedMap<T,java.lang.Integer>public int firstIntValue()
Object2IntSortedMapfirstIntValue in interface Object2IntSortedMap<T>public int lastIntValue()
Object2IntSortedMaplastIntValue in interface Object2IntSortedMap<T>public T pollFirstKey()
Object2IntSortedMappollFirstKey in interface Object2IntSortedMap<T>public T pollLastKey()
Object2IntSortedMappollLastKey in interface Object2IntSortedMap<T>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)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 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 java.util.AbstractMap<T,java.lang.Integer>key - the element that should be removedMap.remove(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 void forEach(ObjectIntConsumer<T> action)
Object2IntMapforEach in interface Object2IntMap<T>forEach in class AbstractObject2IntMap<T>action - processor of the values that are iterator overpublic ObjectSet<T> keySet()
keySet in interface java.util.Map<T,java.lang.Integer>keySet in interface java.util.SortedMap<T,java.lang.Integer>keySet in interface Object2IntMap<T>keySet in interface Object2IntSortedMap<T>keySet in class AbstractObject2IntMap<T>public IntCollection values()
values in interface java.util.Map<T,java.lang.Integer>values in interface java.util.SortedMap<T,java.lang.Integer>values in interface Object2IntMap<T>values in interface Object2IntSortedMap<T>values in class AbstractObject2IntMap<T>public ObjectSortedSet<Object2IntMap.Entry<T>> object2IntEntrySet()
Object2IntMapobject2IntEntrySet in interface Object2IntMap<T>public 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 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()
public void clear()
public java.util.Comparator<T> comparator()
comparator in interface java.util.SortedMap<T,java.lang.Integer>comparator in interface Object2IntSortedMap<T>public Object2IntSortedMap<T> subMap(T fromKey, T toKey)
subMap in interface java.util.SortedMap<T,java.lang.Integer>subMap in interface Object2IntSortedMap<T>public Object2IntSortedMap<T> headMap(T toKey)
headMap in interface java.util.SortedMap<T,java.lang.Integer>headMap in interface Object2IntSortedMap<T>public Object2IntSortedMap<T> tailMap(T fromKey)
tailMap in interface java.util.SortedMap<T,java.lang.Integer>tailMap in interface Object2IntSortedMap<T>