public class Int2IntLinkedOpenCustomHashMap extends Int2IntOpenCustomHashMap implements Int2IntOrderedMap
AbstractInt2IntMap.BasicEntryjava.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Int2IntOrderedMap.FastOrderedSetInt2IntMap.BuilderCache, Int2IntMap.Entry, Int2IntMap.FastEntrySet, Int2IntMap.MapBuilder| Constructor and Description |
|---|
Int2IntLinkedOpenCustomHashMap(int[] keys,
int[] values,
float loadFactor,
IntStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Int2IntLinkedOpenCustomHashMap(int[] keys,
int[] values,
IntStrategy strategy)
Helper constructor that allow to create a map from unboxed values
|
Int2IntLinkedOpenCustomHashMap(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.
|
Int2IntLinkedOpenCustomHashMap(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.
|
Int2IntLinkedOpenCustomHashMap(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)
|
Int2IntLinkedOpenCustomHashMap(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)
|
Int2IntLinkedOpenCustomHashMap(int minCapacity,
float loadFactor,
IntStrategy strategy)
Constructor that defines the minimum capacity and load factor
|
Int2IntLinkedOpenCustomHashMap(int minCapacity,
IntStrategy strategy)
Constructor that defines the minimum capacity
|
Int2IntLinkedOpenCustomHashMap(IntStrategy strategy)
Default Constructor
|
Int2IntLinkedOpenCustomHashMap(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.
|
Int2IntLinkedOpenCustomHashMap(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 |
|---|---|
void |
clear() |
void |
clearAndTrim(int size)
Trims the collection down to the requested size and clears all elements while doing so
|
Int2IntLinkedOpenCustomHashMap |
copy()
A Function that does a shallow clone of the Map itself.
|
int |
firstIntKey()
A method to get the first Key of a Map.
|
int |
firstIntValue()
A method to get the first Value of a Map.
|
void |
forEach(IntIntConsumer action)
Type Specific forEach method to reduce boxing/unboxing
|
int |
getAndMoveToFirst(int key)
A Specific get method that allows to move teh given key/value int the first index.
|
int |
getAndMoveToLast(int key)
A Specific get method that allows to move teh given key/value int the last index.
|
ObjectOrderedSet<Int2IntMap.Entry> |
int2IntEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
IntOrderedSet |
keySet() |
int |
lastIntKey()
A method to get the last Key of a Map.
|
int |
lastIntValue()
A method to get the last Value of a Map.
|
boolean |
moveToFirst(int key)
A specific move method to move a given key/value to the first index.
|
boolean |
moveToLast(int key)
A specific move method to move a given key/value to the last index.
|
int |
pollFirstIntKey()
A method to get and remove the first Key of a Map.
|
int |
pollLastIntKey()
A method to get and remove the last Key of a Map.
|
int |
putAndMoveToFirst(int key,
int value)
A customized put method that allows you to insert into the first index.
|
int |
putAndMoveToLast(int key,
int value)
A customized put method that allows you to insert into the last index.
|
IntCollection |
values() |
addTo, computeInt, computeIntIfAbsent, computeIntIfPresent, containsKey, containsKey, containsValue, containsValue, get, get, getOrDefault, mergeAllInt, mergeInt, put, putIfAbsent, remove, remove, remove, remove, removeOrDefault, 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, containsKey, containsKey, containsValue, containsValue, entrySet, forEach, get, get, getDefaultReturnValue, getOrDefault, getOrDefault, merge, mergeAllInt, mergeInt, put, put, putAll, putAll, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, putIfAbsent, remove, remove, remove, remove, removeOrDefault, replace, replace, replace, replace, replaceAll, replaceInts, replaceInts, setDefaultReturnValue, subFrom, supplyIntIfAbsentapplyAsIntclearAndTrim, trimpublic Int2IntLinkedOpenCustomHashMap(IntStrategy strategy)
strategy - the strategy that allows hash control.java.lang.NullPointerException - if Strategy is nullpublic Int2IntLinkedOpenCustomHashMap(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 Int2IntLinkedOpenCustomHashMap(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 Int2IntLinkedOpenCustomHashMap(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 Int2IntLinkedOpenCustomHashMap(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 Int2IntLinkedOpenCustomHashMap(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 Int2IntLinkedOpenCustomHashMap(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 Int2IntLinkedOpenCustomHashMap(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 Int2IntLinkedOpenCustomHashMap(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 Int2IntLinkedOpenCustomHashMap(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 Int2IntLinkedOpenCustomHashMap(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 putAndMoveToFirst(int key,
int value)
Int2IntOrderedMapputAndMoveToFirst in interface Int2IntOrderedMapkey - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public int putAndMoveToLast(int key,
int value)
Int2IntOrderedMapputAndMoveToLast in interface Int2IntOrderedMapkey - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public boolean moveToFirst(int key)
Int2IntOrderedMapmoveToFirst in interface Int2IntOrderedMapkey - that should be moved to the first indexpublic boolean moveToLast(int key)
Int2IntOrderedMapmoveToLast in interface Int2IntOrderedMapkey - that should be moved to the first lastpublic int getAndMoveToFirst(int key)
Int2IntOrderedMapgetAndMoveToFirst in interface Int2IntOrderedMapkey - that is searched forpublic int getAndMoveToLast(int key)
Int2IntOrderedMapgetAndMoveToLast in interface Int2IntOrderedMapkey - that is searched forpublic Int2IntLinkedOpenCustomHashMap copy()
Int2IntMapcopy in interface Int2IntMapcopy in interface Int2IntOrderedMapcopy in class Int2IntOpenCustomHashMappublic int firstIntKey()
Int2IntOrderedMapfirstIntKey in interface Int2IntOrderedMappublic int pollFirstIntKey()
Int2IntOrderedMappollFirstIntKey in interface Int2IntOrderedMappublic int lastIntKey()
Int2IntOrderedMaplastIntKey in interface Int2IntOrderedMappublic int pollLastIntKey()
Int2IntOrderedMappollLastIntKey in interface Int2IntOrderedMappublic int firstIntValue()
Int2IntOrderedMapfirstIntValue in interface Int2IntOrderedMappublic int lastIntValue()
Int2IntOrderedMaplastIntValue in interface Int2IntOrderedMappublic ObjectOrderedSet<Int2IntMap.Entry> int2IntEntrySet()
Int2IntMapint2IntEntrySet in interface Int2IntMapint2IntEntrySet in interface Int2IntOrderedMapint2IntEntrySet in class Int2IntOpenCustomHashMappublic IntOrderedSet keySet()
keySet in interface java.util.Map<java.lang.Integer,java.lang.Integer>keySet in interface Int2IntMapkeySet in interface Int2IntOrderedMapkeySet in class Int2IntOpenCustomHashMappublic IntCollection values()
values in interface java.util.Map<java.lang.Integer,java.lang.Integer>values in interface Int2IntMapvalues in class Int2IntOpenCustomHashMappublic void forEach(IntIntConsumer action)
Int2IntMapforEach in interface Int2IntMapforEach in class Int2IntOpenCustomHashMapaction - processor of the values that are iterator overpublic void clear()
clear in interface java.util.Map<java.lang.Integer,java.lang.Integer>clear in class Int2IntOpenCustomHashMappublic void clearAndTrim(int size)
ITrimmableclearAndTrim in interface ITrimmableclearAndTrim in class Int2IntOpenCustomHashMapsize - the amount of elements that should be allowed