Object2IntRBTreeMap (Primitive-Collections 0.8.0 API)

java.lang.Object
- java.util.AbstractMap<T,java.lang.Integer>
- - speiger.src.collections.objects.maps.abstracts.AbstractObject2IntMap<T>
  - - speiger.src.collections.objects.maps.impl.tree.Object2IntRBTreeMap<T>

Type Parameters:

T - the keyType of elements maintained by this Collection

All Implemented Interfaces:

java.util.function.ToIntFunction<T>, java.util.Map<T,java.lang.Integer>, java.util.NavigableMap<T,java.lang.Integer>, java.util.SortedMap<T,java.lang.Integer>, Object2IntMap<T>, Object2IntNavigableMap<T>, Object2IntSortedMap<T>
```
public class Object2IntRBTreeMap<T>
extends AbstractObject2IntMap<T>
implements Object2IntNavigableMap<T>
```
A Simple Type Specific RB TreeMap implementation that reduces boxing/unboxing. It is using a bit more memory then FastUtil, but it saves a lot of Performance on the Optimized removal and iteration logic. Which makes the implementation actually useable and does not get outperformed by Javas default implementation.

Nested Class Summary
- Nested classes/interfaces inherited from class speiger.src.collections.objects.maps.abstracts.AbstractObject2IntMap
  AbstractObject2IntMap.BasicEntry<T>
- Nested classes/interfaces inherited from class java.util.AbstractMap
  java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>
- Nested classes/interfaces inherited from interface speiger.src.collections.objects.maps.interfaces.Object2IntSortedMap
  Object2IntSortedMap.FastSortedSet<T>
- Nested classes/interfaces inherited from interface speiger.src.collections.objects.maps.interfaces.Object2IntMap
  Object2IntMap.BuilderCache<T>, Object2IntMap.Entry<T>, Object2IntMap.FastEntrySet<T>, Object2IntMap.MapBuilder

Constructor Summary

Constructors
Constructor and Description
`Object2IntRBTreeMap()` Default Constructor
`Object2IntRBTreeMap(java.util.Comparator<T> comp)` Constructor that allows to define the sorter
`Object2IntRBTreeMap(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.
`Object2IntRBTreeMap(java.util.Map<? extends T,? extends java.lang.Integer> map, java.util.Comparator<T> comp)` A Helper constructor that has a custom sorter and allows to create a Map with exactly the same values as the provided map.
`Object2IntRBTreeMap(Object2IntMap<T> map)` A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
`Object2IntRBTreeMap(Object2IntMap<T> map, java.util.Comparator<T> 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.
`Object2IntRBTreeMap(T[] keys, int[] values)` Helper constructor that allow to create a map from unboxed values
`Object2IntRBTreeMap(T[] keys, int[] values, java.util.Comparator<T> comp)` Helper constructor that has a custom sorter and allow to create a map from unboxed values
`Object2IntRBTreeMap(T[] keys, java.lang.Integer[] values)` Helper constructor that allow to create a map from boxed values (it will unbox them)
`Object2IntRBTreeMap(T[] keys, java.lang.Integer[] values, java.util.Comparator<T> comp)` Helper constructor that has a custom sorter and allow to create a map from boxed values (it will unbox them)

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`int`	`addTo(T key, int value)` A Helper method to add a primitives together.
`Object2IntMap.Entry<T>`	`ceilingEntry(T key)`
`T`	`ceilingKey(T e)`
`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, ToIntFunction<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)`
`Object2IntRBTreeMap<T>`	`copy()` A Function that does a shallow clone of the Map itself.
`ObjectNavigableSet<T>`	`descendingKeySet()`
`Object2IntNavigableMap<T>`	`descendingMap()`
`Object2IntMap.Entry<T>`	`firstEntry()`
`int`	`firstIntValue()` A method to get the first Value of a Map.
`T`	`firstKey()`
`Object2IntMap.Entry<T>`	`floorEntry(T key)`
`T`	`floorKey(T e)`
`void`	`forEach(ObjectIntConsumer<T> action)` Type Specific forEach method to reduce boxing/unboxing
`T`	`getDefaultMaxValue()` only used for primitives
`T`	`getDefaultMinValue()` only used for primitives
`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
`Object2IntNavigableMap<T>`	`headMap(T toKey, boolean inclusive)`
`Object2IntMap.Entry<T>`	`higherEntry(T key)`
`T`	`higherKey(T e)`
`ObjectNavigableSet<T>`	`keySet()`
`Object2IntMap.Entry<T>`	`lastEntry()`
`int`	`lastIntValue()` A method to get the last Value of a Map.
`T`	`lastKey()`
`Object2IntMap.Entry<T>`	`lowerEntry(T key)`
`T`	`lowerKey(T e)`
`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
`ObjectNavigableSet<T>`	`navigableKeySet()`
`ObjectSet<Object2IntMap.Entry<T>>`	`object2IntEntrySet()` Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
`Object2IntMap.Entry<T>`	`pollFirstEntry()`
`T`	`pollFirstKey()` A method to get and remove the first Key of a Map.
`Object2IntMap.Entry<T>`	`pollLastEntry()`
`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`	`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.
`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.
`Object2IntNavigableMap<T>`	`subMap(T fromKey, boolean fromInclusive, T toKey, boolean toInclusive)`
`int`	`supplyIntIfAbsent(T key, IntSupplier valueProvider)` A Supplier based computeIfAbsent function to fill the most used usecase of this function
`Object2IntNavigableMap<T>`	`tailMap(T fromKey, boolean inclusive)`
`IntCollection`	`values()`

Methods inherited from class speiger.src.collections.objects.maps.abstracts.AbstractObject2IntMap
addToAll, containsValue, entrySet, equals, get, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, remove, replaceInts, replaceInts, setDefaultReturnValue

Methods inherited from class java.util.AbstractMap
containsValue, isEmpty, toString

Methods inherited from class java.lang.Object
getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface speiger.src.collections.objects.maps.interfaces.Object2IntNavigableMap
headMap, subMap, synchronize, synchronize, tailMap, unmodifiable

Methods inherited from interface speiger.src.collections.objects.maps.interfaces.Object2IntMap
addToAll, applyAsInt, builder, compute, computeIfAbsent, computeIfPresent, containsValue, containsValue, entrySet, forEach, get, getDefaultReturnValue, getOrDefault, merge, put, put, put, putAll, putAll, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, remove, remove, replace, replace, replaceAll, replaceInts, replaceInts, setDefaultReturnValue

Methods inherited from interface java.util.SortedMap
entrySet

Methods inherited from interface java.util.Map
equals, hashCode, isEmpty, putAll

- Constructor Detail
  - Object2IntRBTreeMap
```
public Object2IntRBTreeMap()
```
    Default Constructor
  - Object2IntRBTreeMap
```
public Object2IntRBTreeMap(java.util.Comparator<T> comp)
```
    Constructor that allows to define the sorter
    
    Parameters:
    
    comp - the function that decides how the tree is sorted, can be null
  - Object2IntRBTreeMap
```
public Object2IntRBTreeMap(T[] keys,
                           java.lang.Integer[] values)
```
    Helper constructor that allow to create a map from boxed values (it will unbox them)
    
    Parameters:
    
    keys - the keys that should be put into the map
    
    values - the values that should be put into the map.
    
    Throws:
    
    java.lang.IllegalStateException - if the keys and values do not match in lenght
  - Object2IntRBTreeMap
```
public Object2IntRBTreeMap(T[] keys,
                           java.lang.Integer[] values,
                           java.util.Comparator<T> comp)
```
    Helper constructor that has a custom sorter and allow to create a map from boxed values (it will unbox them)
    
    Parameters:
    
    keys - the keys that should be put into the map
    
    values - the values that should be put into the map.
    
    comp - the function that decides how the tree is sorted, can be null
    
    Throws:
    
    java.lang.IllegalStateException - if the keys and values do not match in lenght
  - Object2IntRBTreeMap
```
public Object2IntRBTreeMap(T[] keys,
                           int[] values)
```
    Helper constructor that allow to create a map from unboxed values
    
    Parameters:
    
    keys - the keys that should be put into the map
    
    values - the values that should be put into the map.
    
    Throws:
    
    java.lang.IllegalStateException - if the keys and values do not match in lenght
  - Object2IntRBTreeMap
```
public Object2IntRBTreeMap(T[] keys,
                           int[] values,
                           java.util.Comparator<T> comp)
```
    Helper constructor that has a custom sorter and allow to create a map from unboxed values
    
    Parameters:
    
    keys - the keys that should be put into the map
    
    values - the values that should be put into the map.
    
    comp - the function that decides how the tree is sorted, can be null
    
    Throws:
    
    java.lang.IllegalStateException - if the keys and values do not match in lenght
  - Object2IntRBTreeMap
```
public Object2IntRBTreeMap(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.
    
    Parameters:
    
    map - the values that should be present in the map
  - Object2IntRBTreeMap
```
public Object2IntRBTreeMap(java.util.Map<? extends T,? extends java.lang.Integer> map,
                           java.util.Comparator<T> comp)
```
    A Helper constructor that has a custom sorter and allows to create a Map with exactly the same values as the provided map.
    
    Parameters:
    
    map - the values that should be present in the map
    
    comp - the function that decides how the tree is sorted, can be null
  - Object2IntRBTreeMap
```
public Object2IntRBTreeMap(Object2IntMap<T> map)
```
    A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
    
    Parameters:
    
    map - the values that should be present in the map
  - Object2IntRBTreeMap
```
public Object2IntRBTreeMap(Object2IntMap<T> map,
                           java.util.Comparator<T> 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.
    
    Parameters:
    
    map - the values that should be present in the map
    
    comp - the function that decides how the tree is sorted, can be null
- Method Detail
  - getDefaultMaxValue
```
public T getDefaultMaxValue()
```
    only used for primitives
    
    Returns:
    
    null
  - getDefaultMinValue
```
public T getDefaultMinValue()
```
    only used for primitives
    
    Returns:
    
    null
  - put
```
public int put(T key,
               int value)
```
    Description copied from interface: Object2IntMap
    
    Type Specific method to reduce boxing/unboxing of values
    
    Specified by:
    
    put in interface Object2IntMap<T>
    
    Parameters:
    
    key - the key that should be inserted,
    
    value - the value that should be inserted
    
    Returns:
    
    the last present value or default return value.
    
    See Also:
    
    Map.put(Object, Object)
  - putIfAbsent
```
public int putIfAbsent(T key,
                       int value)
```
    Description copied from interface: Object2IntMap
    
    Type Specific method to reduce boxing/unboxing of values
    
    Specified by:
    
    putIfAbsent in interface Object2IntMap<T>
    
    Parameters:
    
    key - the key that should be inserted,
    
    value - the value that should be inserted
    
    Returns:
    
    the last present value or default return value.
    
    See Also:
    
    Map.putIfAbsent(Object, Object)
  - addTo
```
public int addTo(T key,
                 int value)
```
    Description copied from interface: Object2IntMap
    
    A Helper method to add a primitives together. If key is not present then this functions as a put.
    
    Specified by:
    
    addTo in interface Object2IntMap<T>
    
    Parameters:
    
    key - the key that should be inserted,
    
    value - the value that should be inserted / added
    
    Returns:
    
    the last present value or default return value.
  - subFrom
```
public int subFrom(T key,
                   int value)
```
    Description copied from interface: Object2IntMap
    
    A Helper method to subtract from primitive from each other. If the key is not present it will just return the defaultValue How the implementation works is that it will subtract from the current value (if not present it will do nothing) and fence it to the Object2IntMap.getDefaultReturnValue() If the fence is reached the element will be automaticall removed
    
    Specified by:
    
    subFrom in interface Object2IntMap<T>
    
    Parameters:
    
    key - that should be subtract from
    
    value - that should be subtract
    
    Returns:
    
    the last present or default return value
  - comparator
```
public java.util.Comparator<T> comparator()
```
    Specified by:
    
    comparator in interface java.util.SortedMap<T,java.lang.Integer>
    
    Specified by:
    
    comparator in interface Object2IntSortedMap<T>
  - containsKey
```
public boolean containsKey(java.lang.Object key)
```
    Specified by:
    
    containsKey in interface java.util.Map<T,java.lang.Integer>
    
    Overrides:
    
    containsKey in class AbstractObject2IntMap<T>
  - getInt
```
public int getInt(T key)
```
    Description copied from interface: Object2IntMap
    
    A Type Specific get method to reduce boxing/unboxing
    
    Specified by:
    
    getInt in interface Object2IntMap<T>
    
    Parameters:
    
    key - the key that is searched for
    
    Returns:
    
    the searched value or default return value
  - getOrDefault
```
public int getOrDefault(T key,
                        int defaultValue)
```
    Description copied from interface: Object2IntMap
    
    A Type Specific getOrDefault method to reduce boxing/unboxing
    
    Specified by:
    
    getOrDefault in interface Object2IntMap<T>
    
    Parameters:
    
    key - the key that is searched for
    
    defaultValue - the value that should be returned if the key is not present
    
    Returns:
    
    the searched value or defaultValue value
  - firstKey
```
public T firstKey()
```
    Specified by:
    
    firstKey in interface java.util.SortedMap<T,java.lang.Integer>
  - pollFirstKey
```
public T pollFirstKey()
```
    Description copied from interface: Object2IntSortedMap
    
    A method to get and remove the first Key of a Map.
    
    Specified by:
    
    pollFirstKey in interface Object2IntSortedMap<T>
    
    Returns:
    
    the first key in the map
  - lastKey
```
public T lastKey()
```
    Specified by:
    
    lastKey in interface java.util.SortedMap<T,java.lang.Integer>
  - pollLastKey
```
public T pollLastKey()
```
    Description copied from interface: Object2IntSortedMap
    
    A method to get and remove the last Key of a Map.
    
    Specified by:
    
    pollLastKey in interface Object2IntSortedMap<T>
    
    Returns:
    
    the last key in the map
  - firstEntry
```
public Object2IntMap.Entry<T> firstEntry()
```
    Specified by:
    
    firstEntry in interface java.util.NavigableMap<T,java.lang.Integer>
    
    Specified by:
    
    firstEntry in interface Object2IntNavigableMap<T>
    
    Returns:
    
    a Type Specific firstEntry
  - lastEntry
```
public Object2IntMap.Entry<T> lastEntry()
```
    Specified by:
    
    lastEntry in interface java.util.NavigableMap<T,java.lang.Integer>
    
    Specified by:
    
    lastEntry in interface Object2IntNavigableMap<T>
    
    Returns:
    
    a Type Specific lastEntry
  - pollFirstEntry
```
public Object2IntMap.Entry<T> pollFirstEntry()
```
    Specified by:
    
    pollFirstEntry in interface java.util.NavigableMap<T,java.lang.Integer>
    
    Specified by:
    
    pollFirstEntry in interface Object2IntNavigableMap<T>
    
    Returns:
    
    a Type Specific pollFirstEntry
  - pollLastEntry
```
public Object2IntMap.Entry<T> pollLastEntry()
```
    Specified by:
    
    pollLastEntry in interface java.util.NavigableMap<T,java.lang.Integer>
    
    Specified by:
    
    pollLastEntry in interface Object2IntNavigableMap<T>
    
    Returns:
    
    a Type Specific pollLastEntry
  - firstIntValue
```
public int firstIntValue()
```
    Description copied from interface: Object2IntSortedMap
    
    A method to get the first Value of a Map.
    
    Specified by:
    
    firstIntValue in interface Object2IntSortedMap<T>
    
    Returns:
    
    the first key in the map
  - lastIntValue
```
public int lastIntValue()
```
    Description copied from interface: Object2IntSortedMap
    
    A method to get the last Value of a Map.
    
    Specified by:
    
    lastIntValue in interface Object2IntSortedMap<T>
    
    Returns:
    
    the last key in the map
  - rem
```
public int rem(T key)
```
    Description copied from interface: Object2IntMap
    
    Type Specific remove function to reduce boxing/unboxing
    
    Specified by:
    
    rem in interface Object2IntMap<T>
    
    Parameters:
    
    key - the element that should be removed
    
    Returns:
    
    the value that was removed or default return value
  - remOrDefault
```
public int remOrDefault(T key,
                        int defaultValue)
```
    Description copied from interface: Object2IntMap
    
    Type-Specific Remove function with a default return value if wanted.
    
    Specified by:
    
    remOrDefault in interface Object2IntMap<T>
    
    Parameters:
    
    key - the element that should be removed
    
    defaultValue - the value that should be returned if the entry doesn't exist
    
    Returns:
    
    the value that was removed or default value
    
    See Also:
    
    Map.remove(Object, Object)
  - remove
```
public boolean remove(T key,
                      int value)
```
    Description copied from interface: Object2IntMap
    
    Type Specific remove function to reduce boxing/unboxing
    
    Specified by:
    
    remove in interface Object2IntMap<T>
    
    Parameters:
    
    key - the element that should be removed
    
    value - the expected value that should be found
    
    Returns:
    
    true if the key and value was found and removed
    
    See Also:
    
    Map.remove(Object, Object)
  - replace
```
public boolean replace(T key,
                       int oldValue,
                       int newValue)
```
    Description copied from interface: Object2IntMap
    
    A Type Specific replace method to replace an existing value
    
    Specified by:
    
    replace in interface Object2IntMap<T>
    
    Overrides:
    
    replace in class AbstractObject2IntMap<T>
    
    Parameters:
    
    key - the element that should be searched for
    
    oldValue - the expected value to be replaced
    
    newValue - the value to replace the oldValue with.
    
    Returns:
    
    true if the value got replaced
  - replace
```
public int replace(T key,
                   int value)
```
    Description copied from interface: Object2IntMap
    
    A Type Specific replace method to reduce boxing/unboxing replace an existing value
    
    Specified by:
    
    replace in interface Object2IntMap<T>
    
    Overrides:
    
    replace in class AbstractObject2IntMap<T>
    
    Parameters:
    
    key - the element that should be searched for
    
    value - the value to replace with.
    
    Returns:
    
    the present value or default return value
  - computeInt
```
public int computeInt(T key,
                      ObjectIntUnaryOperator<T> mappingFunction)
```
    Description copied from interface: Object2IntMap
    
    A Type Specific compute method to reduce boxing/unboxing
    
    Specified by:
    
    computeInt in interface Object2IntMap<T>
    
    Overrides:
    
    computeInt in class AbstractObject2IntMap<T>
    
    Parameters:
    
    key - the key that should be computed
    
    mappingFunction - the operator that should generate the value
    
    Returns:
    
    the result of the computation
  - computeIntIfAbsent
```
public int computeIntIfAbsent(T key,
                              ToIntFunction<T> mappingFunction)
```
    Description copied from interface: Object2IntMap
    
    A Type Specific compute method to reduce boxing/unboxing
    
    Specified by:
    
    computeIntIfAbsent in interface Object2IntMap<T>
    
    Overrides:
    
    computeIntIfAbsent in class AbstractObject2IntMap<T>
    
    Parameters:
    
    key - the key that should be computed
    
    mappingFunction - the operator that should generate the value if not present
    
    Returns:
    
    the result of the computed value or present value
  - supplyIntIfAbsent
```
public int supplyIntIfAbsent(T key,
                             IntSupplier valueProvider)
```
    Description copied from interface: Object2IntMap
    
    A Supplier based computeIfAbsent function to fill the most used usecase of this function
    
    Specified by:
    
    supplyIntIfAbsent in interface Object2IntMap<T>
    
    Overrides:
    
    supplyIntIfAbsent in class AbstractObject2IntMap<T>
    
    Parameters:
    
    key - the key that should be computed
    
    valueProvider - the value if not present
    
    Returns:
    
    the result of the computed value or present value
  - computeIntIfPresent
```
public int computeIntIfPresent(T key,
                               ObjectIntUnaryOperator<T> mappingFunction)
```
    Description copied from interface: Object2IntMap
    
    A Type Specific compute method to reduce boxing/unboxing
    
    Specified by:
    
    computeIntIfPresent in interface Object2IntMap<T>
    
    Overrides:
    
    computeIntIfPresent in class AbstractObject2IntMap<T>
    
    Parameters:
    
    key - the key that should be computed
    
    mappingFunction - the operator that should generate the value if present
    
    Returns:
    
    the result of the default return value or present value
  - mergeInt
```
public int mergeInt(T key,
                    int value,
                    IntIntUnaryOperator mappingFunction)
```
    Description copied from interface: Object2IntMap
    
    A Type Specific merge method to reduce boxing/unboxing
    
    Specified by:
    
    mergeInt in interface Object2IntMap<T>
    
    Overrides:
    
    mergeInt in class AbstractObject2IntMap<T>
    
    Parameters:
    
    key - the key that should be be searched for
    
    value - the value that should be merged with
    
    mappingFunction - the operator that should generate the new Value
    
    Returns:
    
    the result of the merge
  - mergeAllInt
```
public void mergeAllInt(Object2IntMap<T> m,
                        IntIntUnaryOperator mappingFunction)
```
    Description copied from interface: Object2IntMap
    
    A Bulk method for merging Maps.
    
    Specified by:
    
    mergeAllInt in interface Object2IntMap<T>
    
    Overrides:
    
    mergeAllInt in class AbstractObject2IntMap<T>
    
    Parameters:
    
    m - the entries that should be bulk added
    
    mappingFunction - the operator that should generate the new Value
  - forEach
```
public void forEach(ObjectIntConsumer<T> action)
```
    Description copied from interface: Object2IntMap
    
    Type Specific forEach method to reduce boxing/unboxing
    
    Specified by:
    
    forEach in interface Object2IntMap<T>
    
    Overrides:
    
    forEach in class AbstractObject2IntMap<T>
    
    Parameters:
    
    action - processor of the values that are iterator over
  - size
```
public int size()
```
    Specified by:
    
    size in interface java.util.Map<T,java.lang.Integer>
    
    Overrides:
    
    size in class java.util.AbstractMap<T,java.lang.Integer>
  - clear
```
public void clear()
```
    Specified by:
    
    clear in interface java.util.Map<T,java.lang.Integer>
    
    Overrides:
    
    clear in class java.util.AbstractMap<T,java.lang.Integer>
  - copy
```
public Object2IntRBTreeMap<T> copy()
```
    Description copied from interface: Object2IntMap
    
    A Function that does a shallow clone of the Map itself. This function is more optimized then a copy constructor since the Map does not have to be unsorted/resorted. It can be compared to Cloneable but with less exception risk
    
    Specified by:
    
    copy in interface Object2IntMap<T>
    
    Specified by:
    
    copy in interface Object2IntNavigableMap<T>
    
    Specified by:
    
    copy in interface Object2IntSortedMap<T>
    
    Overrides:
    
    copy in class AbstractObject2IntMap<T>
    
    Returns:
    
    a Shallow Copy of the Map
  - keySet
```
public ObjectNavigableSet<T> keySet()
```
    Specified by:
    
    keySet in interface java.util.Map<T,java.lang.Integer>
    
    Specified by:
    
    keySet in interface java.util.SortedMap<T,java.lang.Integer>
    
    Specified by:
    
    keySet in interface Object2IntMap<T>
    
    Specified by:
    
    keySet in interface Object2IntNavigableMap<T>
    
    Specified by:
    
    keySet in interface Object2IntSortedMap<T>
    
    Overrides:
    
    keySet in class AbstractObject2IntMap<T>
    
    Returns:
    
    a Type Specific Navigable Key Set
  - object2IntEntrySet
```
public ObjectSet<Object2IntMap.Entry<T>> object2IntEntrySet()
```
    Description copied from interface: Object2IntMap
    
    Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
    
    Specified by:
    
    object2IntEntrySet in interface Object2IntMap<T>
    
    Returns:
    
    a EntrySet of the collection
  - values
```
public IntCollection values()
```
    Specified by:
    
    values in interface java.util.Map<T,java.lang.Integer>
    
    Specified by:
    
    values in interface java.util.SortedMap<T,java.lang.Integer>
    
    Specified by:
    
    values in interface Object2IntMap<T>
    
    Specified by:
    
    values in interface Object2IntSortedMap<T>
    
    Overrides:
    
    values in class AbstractObject2IntMap<T>
  - navigableKeySet
```
public ObjectNavigableSet<T> navigableKeySet()
```
    Specified by:
    
    navigableKeySet in interface java.util.NavigableMap<T,java.lang.Integer>
    
    Specified by:
    
    navigableKeySet in interface Object2IntNavigableMap<T>
    
    Returns:
    
    a Type Specific Navigable Key Set
  - descendingMap
```
public Object2IntNavigableMap<T> descendingMap()
```
    Specified by:
    
    descendingMap in interface java.util.NavigableMap<T,java.lang.Integer>
    
    Specified by:
    
    descendingMap in interface Object2IntNavigableMap<T>
    
    Returns:
    
    a Type Specific desendingMap
  - descendingKeySet
```
public ObjectNavigableSet<T> descendingKeySet()
```
    Specified by:
    
    descendingKeySet in interface java.util.NavigableMap<T,java.lang.Integer>
    
    Specified by:
    
    descendingKeySet in interface Object2IntNavigableMap<T>
    
    Returns:
    
    a Type Specific Desending Key Set
  - subMap
```
public Object2IntNavigableMap<T> subMap(T fromKey,
                                        boolean fromInclusive,
                                        T toKey,
                                        boolean toInclusive)
```
    Specified by:
    
    subMap in interface java.util.NavigableMap<T,java.lang.Integer>
    
    Specified by:
    
    subMap in interface Object2IntNavigableMap<T>
  - headMap
```
public Object2IntNavigableMap<T> headMap(T toKey,
                                         boolean inclusive)
```
    Specified by:
    
    headMap in interface java.util.NavigableMap<T,java.lang.Integer>
    
    Specified by:
    
    headMap in interface Object2IntNavigableMap<T>
  - tailMap
```
public Object2IntNavigableMap<T> tailMap(T fromKey,
                                         boolean inclusive)
```
    Specified by:
    
    tailMap in interface java.util.NavigableMap<T,java.lang.Integer>
    
    Specified by:
    
    tailMap in interface Object2IntNavigableMap<T>
  - lowerKey
```
public T lowerKey(T e)
```
    Specified by:
    
    lowerKey in interface java.util.NavigableMap<T,java.lang.Integer>
  - floorKey
```
public T floorKey(T e)
```
    Specified by:
    
    floorKey in interface java.util.NavigableMap<T,java.lang.Integer>
  - higherKey
```
public T higherKey(T e)
```
    Specified by:
    
    higherKey in interface java.util.NavigableMap<T,java.lang.Integer>
  - ceilingKey
```
public T ceilingKey(T e)
```
    Specified by:
    
    ceilingKey in interface java.util.NavigableMap<T,java.lang.Integer>
  - lowerEntry
```
public Object2IntMap.Entry<T> lowerEntry(T key)
```
    Specified by:
    
    lowerEntry in interface java.util.NavigableMap<T,java.lang.Integer>
    
    Specified by:
    
    lowerEntry in interface Object2IntNavigableMap<T>
  - higherEntry
```
public Object2IntMap.Entry<T> higherEntry(T key)
```
    Specified by:
    
    higherEntry in interface java.util.NavigableMap<T,java.lang.Integer>
    
    Specified by:
    
    higherEntry in interface Object2IntNavigableMap<T>
  - floorEntry
```
public Object2IntMap.Entry<T> floorEntry(T key)
```
    Specified by:
    
    floorEntry in interface java.util.NavigableMap<T,java.lang.Integer>
    
    Specified by:
    
    floorEntry in interface Object2IntNavigableMap<T>
  - ceilingEntry
```
public Object2IntMap.Entry<T> ceilingEntry(T key)
```
    Specified by:
    
    ceilingEntry in interface java.util.NavigableMap<T,java.lang.Integer>
    
    Specified by:
    
    ceilingEntry in interface Object2IntNavigableMap<T>

Class Object2IntRBTreeMap<T>

Nested Class Summary

Nested classes/interfaces inherited from class speiger.src.collections.objects.maps.abstracts.AbstractObject2IntMap

Nested classes/interfaces inherited from class java.util.AbstractMap

Nested classes/interfaces inherited from interface speiger.src.collections.objects.maps.interfaces.Object2IntSortedMap

Nested classes/interfaces inherited from interface speiger.src.collections.objects.maps.interfaces.Object2IntMap

Constructor Summary

Method Summary

Methods inherited from class speiger.src.collections.objects.maps.abstracts.AbstractObject2IntMap

Methods inherited from class java.util.AbstractMap

Methods inherited from class java.lang.Object

Methods inherited from interface speiger.src.collections.objects.maps.interfaces.Object2IntNavigableMap

Methods inherited from interface speiger.src.collections.objects.maps.interfaces.Object2IntMap

Methods inherited from interface java.util.SortedMap

Methods inherited from interface java.util.Map

Constructor Detail

Object2IntRBTreeMap

Object2IntRBTreeMap

Object2IntRBTreeMap

Object2IntRBTreeMap

Object2IntRBTreeMap

Object2IntRBTreeMap

Object2IntRBTreeMap

Object2IntRBTreeMap

Object2IntRBTreeMap

Object2IntRBTreeMap

Method Detail

getDefaultMaxValue

getDefaultMinValue

put

putIfAbsent

addTo

subFrom

comparator

containsKey

getInt

getOrDefault

firstKey

pollFirstKey

lastKey

pollLastKey

firstEntry

lastEntry

pollFirstEntry

pollLastEntry

firstIntValue

lastIntValue

rem

remOrDefault

remove

replace

replace

computeInt

computeIntIfAbsent

supplyIntIfAbsent

computeIntIfPresent

mergeInt

mergeAllInt

forEach

size

clear

copy

keySet

object2IntEntrySet

values

navigableKeySet

descendingMap

descendingKeySet

subMap

headMap

tailMap

lowerKey

floorKey

higherKey

ceilingKey

lowerEntry

higherEntry

floorEntry

ceilingEntry