public class Int2IntAVLTreeMap extends AbstractInt2IntMap implements Int2IntNavigableMap
AbstractInt2IntMap.BasicEntryjava.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Int2IntSortedMap.FastSortedSetInt2IntMap.FastEntrySet| Constructor and Description |
|---|
Int2IntAVLTreeMap()
Default Constructor
|
Int2IntAVLTreeMap(int[] keys,
int[] values)
Helper constructor that allow to create a map from unboxed values
|
Int2IntAVLTreeMap(int[] keys,
int[] values,
IntComparator comp)
Helper constructor that has a custom sorter and allow to create a map from unboxed values
|
Int2IntAVLTreeMap(Int2IntMap map)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Int2IntAVLTreeMap(Int2IntMap map,
IntComparator comp)
A Type Specific Helper function that has a custom sorter and allows to create a new Map with exactly the same values as the provided map.
|
Int2IntAVLTreeMap(IntComparator comp)
Constructor that allows to define the sorter
|
Int2IntAVLTreeMap(java.lang.Integer[] keys,
java.lang.Integer[] values)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Int2IntAVLTreeMap(java.lang.Integer[] keys,
java.lang.Integer[] values,
IntComparator comp)
Helper constructor that has a custom sorter and allow to create a map from boxed values (it will unbox them)
|
Int2IntAVLTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> map)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Int2IntAVLTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> map,
IntComparator comp)
A Helper constructor that has a custom sorter and 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.
|
Int2IntMap.Entry |
ceilingEntry(int key)
A Type Specific ceilingEntry method to reduce boxing/unboxing.
|
int |
ceilingKey(int e)
A Type Specific ceilingKey method to reduce boxing/unboxing.
|
void |
clear() |
IntComparator |
comparator() |
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
|
IntNavigableSet |
descendingKeySet() |
Int2IntNavigableMap |
descendingMap() |
Int2IntMap.Entry |
firstEntry() |
int |
firstIntKey()
A method to get the first Key of a Map.
|
int |
firstIntValue()
A method to get the first Value of a Map.
|
Int2IntMap.Entry |
floorEntry(int key)
A Type Specific floorEntry method to reduce boxing/unboxing.
|
int |
floorKey(int e)
A Type Specific floorKey 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.
|
int |
getDefaultMaxValue()
A Helper method to get the max value for SubMaps.
|
int |
getDefaultMinValue()
A Helper method to get the min value for SubMaps.
|
int |
getInt(int key)
A Type Specific get method to reduce boxing/unboxing
|
int |
getOrDefault(int key,
int defaultValue)
A Type Specific getOrDefault method to reduce boxing/unboxing
|
Int2IntNavigableMap |
headMap(int toKey,
boolean inclusive)
A Type Specific HeadMap method to reduce boxing/unboxing
|
Int2IntMap.Entry |
higherEntry(int key)
A Type Specific higherEntry method to reduce boxing/unboxing.
|
int |
higherKey(int e)
A Type Specific higherKey method to reduce boxing/unboxing.
|
ObjectSet<Int2IntMap.Entry> |
int2IntEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
IntSortedSet |
keySet() |
Int2IntMap.Entry |
lastEntry() |
int |
lastIntKey()
A method to get the last Key of a Map.
|
int |
lastIntValue()
A method to get the last Value of a Map.
|
Int2IntMap.Entry |
lowerEntry(int key)
A Type Specific lowerEntry method to reduce boxing/unboxing.
|
int |
lowerKey(int e)
A Type Specific lowerKey method to reduce boxing/unboxing.
|
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
|
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.
|
IntNavigableSet |
navigableKeySet() |
Int2IntMap.Entry |
pollFirstEntry() |
int |
pollFirstIntKey()
A method to get and remove the first Key of a Map.
|
Int2IntMap.Entry |
pollLastEntry() |
int |
pollLastIntKey()
A method to get and remove the last Key of a Map.
|
int |
put(int key,
int value)
Type Specific method to reduce boxing/unboxing of values
|
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.
|
int |
putIfAbsent(int key,
int value)
Type Specific method to reduce boxing/unboxing of values
|
int |
remInt(int key)
Type Specific remove function to reduce boxing/unboxing
|
int |
remIntOrDefault(int key,
int defaultValue)
Type-Specific Remove function with a default return value if wanted.
|
boolean |
remove(int key,
int value)
Type Specific remove function to reduce boxing/unboxing
|
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
|
void |
setDefaultMaxValue(int value)
A Helper method to set the max value for SubMaps.
|
void |
setDefaultMinValue(int value)
A Helper method to set the min value for SubMaps.
|
int |
size() |
Int2IntNavigableMap |
subMap(int fromKey,
boolean fromInclusive,
int toKey,
boolean toInclusive)
A Type Specific SubMap method to reduce boxing/unboxing
|
Int2IntNavigableMap |
tailMap(int fromKey,
boolean inclusive)
A Type Specific TailMap method to reduce boxing/unboxing
|
IntCollection |
values() |
addToAll, containsValue, entrySet, equals, forEach, get, getDefaultReturnValue, getOrDefault, hashCode, putAll, putAll, putAll, putAllIfAbsent, replaceInts, replaceInts, setDefaultReturnValuecontainsKey, containsValue, isEmpty, put, remove, toStringceilingEntry, ceilingKey, floorEntry, floorKey, headMap, headMap, headMap, higherEntry, higherKey, lowerEntry, lowerKey, subMap, subMap, subMap, tailMap, tailMap, tailMapfirstKey, lastKeyaddToAll, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, containsValue, entrySet, forEach, forEach, get, getDefaultReturnValue, getOrDefault, merge, put, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, remove, remove, replace, replace, replaceAll, replaceInts, replaceInts, setDefaultReturnValueapplyAsIntpublic Int2IntAVLTreeMap()
public Int2IntAVLTreeMap(IntComparator comp)
comp - the function that decides how the tree is sorted, can be nullpublic Int2IntAVLTreeMap(java.lang.Integer[] 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 Int2IntAVLTreeMap(java.lang.Integer[] keys,
java.lang.Integer[] values,
IntComparator comp)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.comp - the function that decides how the tree is sorted, can be nulljava.lang.IllegalStateException - if the keys and values do not match in lenghtpublic Int2IntAVLTreeMap(int[] 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 Int2IntAVLTreeMap(int[] keys,
int[] values,
IntComparator comp)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.comp - the function that decides how the tree is sorted, can be nulljava.lang.IllegalStateException - if the keys and values do not match in lenghtpublic Int2IntAVLTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> map)
map - the values that should be present in the mappublic Int2IntAVLTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> map,
IntComparator comp)
map - the values that should be present in the mapcomp - the function that decides how the tree is sorted, can be nullpublic Int2IntAVLTreeMap(Int2IntMap map)
map - the values that should be present in the mappublic Int2IntAVLTreeMap(Int2IntMap map, IntComparator comp)
map - the values that should be present in the mapcomp - the function that decides how the tree is sorted, can be nullpublic void setDefaultMaxValue(int value)
Int2IntNavigableMapsetDefaultMaxValue in interface Int2IntNavigableMapvalue - the new max valuepublic int getDefaultMaxValue()
Int2IntNavigableMapgetDefaultMaxValue in interface Int2IntNavigableMappublic void setDefaultMinValue(int value)
Int2IntNavigableMapsetDefaultMinValue in interface Int2IntNavigableMapvalue - the new min valuepublic int getDefaultMinValue()
Int2IntNavigableMapgetDefaultMinValue in interface Int2IntNavigableMappublic 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 putAndMoveToFirst(int key,
int value)
Int2IntSortedMapputAndMoveToFirst in interface Int2IntSortedMapkey - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public int putAndMoveToLast(int key,
int value)
Int2IntSortedMapputAndMoveToLast in interface Int2IntSortedMapkey - the key that should be insertedvalue - the value that should be insertedMap.put(Object, Object)public boolean moveToFirst(int key)
Int2IntSortedMapmoveToFirst in interface Int2IntSortedMapkey - that should be moved to the first indexpublic boolean moveToLast(int key)
Int2IntSortedMapmoveToLast in interface Int2IntSortedMapkey - that should be moved to the first lastpublic int getAndMoveToFirst(int key)
Int2IntSortedMapgetAndMoveToFirst in interface Int2IntSortedMapkey - that is searched forpublic int getAndMoveToLast(int key)
Int2IntSortedMapgetAndMoveToLast in interface Int2IntSortedMapkey - that is searched forpublic IntComparator comparator()
comparator in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>comparator in interface Int2IntSortedMappublic boolean containsKey(int key)
Int2IntMapcontainsKey in interface Int2IntMapcontainsKey in class AbstractInt2IntMapkey - element that is searched forpublic int getInt(int key)
Int2IntMapgetInt in interface Int2IntFunctiongetInt in interface Int2IntMapkey - the key that is searched forpublic 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 int firstIntKey()
Int2IntSortedMapfirstIntKey in interface Int2IntSortedMappublic int pollFirstIntKey()
Int2IntSortedMappollFirstIntKey in interface Int2IntSortedMappublic int lastIntKey()
Int2IntSortedMaplastIntKey in interface Int2IntSortedMappublic int pollLastIntKey()
Int2IntSortedMappollLastIntKey in interface Int2IntSortedMappublic Int2IntMap.Entry firstEntry()
firstEntry in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>firstEntry in interface Int2IntNavigableMappublic Int2IntMap.Entry lastEntry()
lastEntry in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>lastEntry in interface Int2IntNavigableMappublic Int2IntMap.Entry pollFirstEntry()
pollFirstEntry in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>pollFirstEntry in interface Int2IntNavigableMappublic Int2IntMap.Entry pollLastEntry()
pollLastEntry in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>pollLastEntry in interface Int2IntNavigableMappublic int firstIntValue()
Int2IntSortedMapfirstIntValue in interface Int2IntSortedMappublic int lastIntValue()
Int2IntSortedMaplastIntValue in interface Int2IntSortedMappublic int remInt(int key)
Int2IntMapremInt in interface Int2IntMapkey - the element that should be removedpublic int remIntOrDefault(int key,
int defaultValue)
Int2IntMapremIntOrDefault 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 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 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 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 IntSortedSet keySet()
keySet in interface java.util.Map<java.lang.Integer,java.lang.Integer>keySet in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>keySet in interface Int2IntMapkeySet in interface Int2IntSortedMapkeySet in class AbstractInt2IntMappublic ObjectSet<Int2IntMap.Entry> int2IntEntrySet()
Int2IntMapint2IntEntrySet in interface Int2IntMappublic IntCollection values()
values in interface java.util.Map<java.lang.Integer,java.lang.Integer>values in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>values in interface Int2IntMapvalues in interface Int2IntSortedMapvalues in class AbstractInt2IntMappublic IntNavigableSet navigableKeySet()
navigableKeySet in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>navigableKeySet in interface Int2IntNavigableMappublic Int2IntNavigableMap descendingMap()
descendingMap in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>descendingMap in interface Int2IntNavigableMappublic IntNavigableSet descendingKeySet()
descendingKeySet in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>descendingKeySet in interface Int2IntNavigableMappublic Int2IntNavigableMap subMap(int fromKey, boolean fromInclusive, int toKey, boolean toInclusive)
Int2IntNavigableMapsubMap in interface Int2IntNavigableMapfromKey - where the submap should startfromInclusive - if the fromKey is inclusive or nottoKey - where the subMap should endtoInclusive - if the toKey is inclusive or notpublic Int2IntNavigableMap headMap(int toKey, boolean inclusive)
Int2IntNavigableMapheadMap in interface Int2IntNavigableMaptoKey - where the HeadMap should endinclusive - if the toKey is inclusive or notpublic Int2IntNavigableMap tailMap(int fromKey, boolean inclusive)
Int2IntNavigableMaptailMap in interface Int2IntNavigableMapfromKey - where the TailMap should startinclusive - if the fromKey is inclusive or notpublic int lowerKey(int e)
Int2IntNavigableMaplowerKey in interface Int2IntNavigableMape - that should be compared with.public int floorKey(int e)
Int2IntNavigableMapfloorKey in interface Int2IntNavigableMape - that should be compared with.public int higherKey(int e)
Int2IntNavigableMaphigherKey in interface Int2IntNavigableMape - that should be compared with.public int ceilingKey(int e)
Int2IntNavigableMapceilingKey in interface Int2IntNavigableMape - that should be compared with.public Int2IntMap.Entry lowerEntry(int key)
Int2IntNavigableMaplowerEntry in interface Int2IntNavigableMapkey - that should be compared with.public Int2IntMap.Entry higherEntry(int key)
Int2IntNavigableMaphigherEntry in interface Int2IntNavigableMapkey - that should be compared with.public Int2IntMap.Entry floorEntry(int key)
Int2IntNavigableMapfloorEntry in interface Int2IntNavigableMapkey - that should be compared with.public Int2IntMap.Entry ceilingEntry(int key)
Int2IntNavigableMapceilingEntry in interface Int2IntNavigableMapkey - that should be compared with.