T - the type of elements maintained by this Collectionpublic class Object2IntLinkedOpenCustomHashMap<T> extends Object2IntOpenCustomHashMap<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 |
|---|
Object2IntLinkedOpenCustomHashMap(int minCapacity,
float loadFactor,
ObjectStrategy<? super T> strategy)
Constructor that defines the minimum capacity and load factor
|
Object2IntLinkedOpenCustomHashMap(int minCapacity,
ObjectStrategy<? super T> strategy)
Constructor that defines the minimum capacity
|
Object2IntLinkedOpenCustomHashMap(java.util.Map<? extends T,? extends java.lang.Integer> map,
float loadFactor,
ObjectStrategy<? super T> strategy)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Object2IntLinkedOpenCustomHashMap(java.util.Map<? extends T,? extends java.lang.Integer> map,
ObjectStrategy<? super T> strategy)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Object2IntLinkedOpenCustomHashMap(Object2IntMap<T> map,
float loadFactor,
ObjectStrategy<? super T> strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Object2IntLinkedOpenCustomHashMap(Object2IntMap<T> map,
ObjectStrategy<? super T> strategy)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Object2IntLinkedOpenCustomHashMap(ObjectStrategy<? super T> strategy)
Default Constructor
|
Object2IntLinkedOpenCustomHashMap(T[] keys,
int[] values,
float loadFactor,
ObjectStrategy<? super T> strategy)
Helper constructor that allow to create a map from unboxed values
|
Object2IntLinkedOpenCustomHashMap(T[] keys,
int[] values,
ObjectStrategy<? super T> strategy)
Helper constructor that allow to create a map from unboxed values
|
Object2IntLinkedOpenCustomHashMap(T[] keys,
java.lang.Integer[] values,
float loadFactor,
ObjectStrategy<? super T> strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Object2IntLinkedOpenCustomHashMap(T[] keys,
java.lang.Integer[] values,
ObjectStrategy<? super T> strategy)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
void |
clearAndTrim(int size)
Trims the collection down to the requested size and clears all elements while doing so
|
Object2IntLinkedOpenCustomHashMap<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
|
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.
|
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.
|
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 |
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.
|
IntCollection |
values() |
addTo, computeInt, computeIntIfAbsent, computeIntIfPresent, containsKey, containsValue, containsValue, get, getInt, getOrDefault, mergeAllInt, mergeInt, put, putIfAbsent, rem, remOrDefault, remove, remove, remove, replace, replace, size, subFrom, supplyIntIfAbsent, trimaddToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, replaceInts, replaceInts, setDefaultReturnValuesynchronize, synchronize, unmodifiableaddTo, addToAll, builder, compute, computeIfAbsent, computeIfPresent, computeInt, computeIntIfAbsent, computeIntIfPresent, containsValue, containsValue, entrySet, forEach, get, getDefaultReturnValue, getInt, getOrDefault, getOrDefault, merge, mergeAllInt, mergeInt, put, put, putAll, putAll, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, putIfAbsent, rem, remOrDefault, remove, remove, remove, replace, replace, replace, replace, replaceAll, replaceInts, replaceInts, setDefaultReturnValue, subFrom, supplyIntIfAbsentapplyAsIntclearAndTrim, trimpublic Object2IntLinkedOpenCustomHashMap(ObjectStrategy<? super T> strategy)
strategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Object2IntLinkedOpenCustomHashMap(int minCapacity,
ObjectStrategy<? super T> 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 Object2IntLinkedOpenCustomHashMap(int minCapacity,
float loadFactor,
ObjectStrategy<? super T> 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 Object2IntLinkedOpenCustomHashMap(T[] keys, java.lang.Integer[] values, ObjectStrategy<? super T> 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 Object2IntLinkedOpenCustomHashMap(T[] keys, java.lang.Integer[] values, float loadFactor, ObjectStrategy<? super T> 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 Object2IntLinkedOpenCustomHashMap(T[] keys, int[] values, ObjectStrategy<? super T> 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 Object2IntLinkedOpenCustomHashMap(T[] keys, int[] values, float loadFactor, ObjectStrategy<? super T> 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 Object2IntLinkedOpenCustomHashMap(java.util.Map<? extends T,? extends java.lang.Integer> map, ObjectStrategy<? super T> strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Object2IntLinkedOpenCustomHashMap(java.util.Map<? extends T,? extends java.lang.Integer> map, float loadFactor, ObjectStrategy<? super T> 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 Object2IntLinkedOpenCustomHashMap(Object2IntMap<T> map, ObjectStrategy<? super T> strategy)
map - the values that should be present in the mapstrategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Object2IntLinkedOpenCustomHashMap(Object2IntMap<T> map, float loadFactor, ObjectStrategy<? super T> 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 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 Object2IntLinkedOpenCustomHashMap<T> copy()
Object2IntMapcopy in interface Object2IntMap<T>copy in interface Object2IntOrderedMap<T>copy in class Object2IntOpenCustomHashMap<T>public 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>object2IntEntrySet in class Object2IntOpenCustomHashMap<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 Object2IntOpenCustomHashMap<T>public IntCollection values()
values in interface java.util.Map<T,java.lang.Integer>values in interface Object2IntMap<T>values in class Object2IntOpenCustomHashMap<T>public void forEach(ObjectIntConsumer<T> action)
Object2IntMapforEach in interface Object2IntMap<T>forEach in class Object2IntOpenCustomHashMap<T>action - processor of the values that are iterator overpublic void clear()
clear in interface java.util.Map<T,java.lang.Integer>clear in class Object2IntOpenCustomHashMap<T>public void clearAndTrim(int size)
ITrimmableclearAndTrim in interface ITrimmableclearAndTrim in class Object2IntOpenCustomHashMap<T>size - the amount of elements that should be allowed