T - the keyType of elements maintained by this Collectionpublic class Object2DoubleRBTreeMap<T> extends AbstractObject2DoubleMap<T> implements Object2DoubleNavigableMap<T>
AbstractObject2DoubleMap.BasicEntry<T>java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Object2DoubleSortedMap.FastSortedSet<T>Object2DoubleMap.BuilderCache<T>, Object2DoubleMap.Entry<T>, Object2DoubleMap.FastEntrySet<T>, Object2DoubleMap.MapBuilder| Constructor and Description |
|---|
Object2DoubleRBTreeMap()
Default Constructor
|
Object2DoubleRBTreeMap(java.util.Comparator<T> comp)
Constructor that allows to define the sorter
|
Object2DoubleRBTreeMap(java.util.Map<? extends T,? extends java.lang.Double> map)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Object2DoubleRBTreeMap(java.util.Map<? extends T,? extends java.lang.Double> 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.
|
Object2DoubleRBTreeMap(Object2DoubleMap<T> map)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Object2DoubleRBTreeMap(Object2DoubleMap<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.
|
Object2DoubleRBTreeMap(T[] keys,
double[] values)
Helper constructor that allow to create a map from unboxed values
|
Object2DoubleRBTreeMap(T[] keys,
java.lang.Double[] values)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Object2DoubleRBTreeMap(T[] keys,
double[] values,
java.util.Comparator<T> comp)
Helper constructor that has a custom sorter and allow to create a map from unboxed values
|
Object2DoubleRBTreeMap(T[] keys,
java.lang.Double[] 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)
|
| Modifier and Type | Method and Description |
|---|---|
double |
addTo(T key,
double value)
A Helper method to add a primitives together.
|
Object2DoubleMap.Entry<T> |
ceilingEntry(T key) |
T |
ceilingKey(T e) |
void |
clear() |
java.util.Comparator<T> |
comparator() |
double |
computeDouble(T key,
ObjectDoubleUnaryOperator<T> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
double |
computeDoubleIfAbsent(T key,
ToDoubleFunction<T> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
double |
computeDoubleIfPresent(T key,
ObjectDoubleUnaryOperator<T> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
boolean |
containsKey(java.lang.Object key) |
Object2DoubleRBTreeMap<T> |
copy()
A Function that does a shallow clone of the Map itself.
|
ObjectNavigableSet<T> |
descendingKeySet() |
Object2DoubleNavigableMap<T> |
descendingMap() |
double |
firstDoubleValue()
A method to get the first Value of a Map.
|
Object2DoubleMap.Entry<T> |
firstEntry() |
T |
firstKey() |
Object2DoubleMap.Entry<T> |
floorEntry(T key) |
T |
floorKey(T e) |
void |
forEach(ObjectDoubleConsumer<T> action)
Type Specific forEach method to reduce boxing/unboxing
|
T |
getDefaultMaxValue()
only used for primitives
|
T |
getDefaultMinValue()
only used for primitives
|
double |
getDouble(T key)
A Type Specific get method to reduce boxing/unboxing
|
double |
getOrDefault(T key,
double defaultValue)
A Type Specific getOrDefault method to reduce boxing/unboxing
|
Object2DoubleNavigableMap<T> |
headMap(T toKey,
boolean inclusive) |
Object2DoubleMap.Entry<T> |
higherEntry(T key) |
T |
higherKey(T e) |
ObjectNavigableSet<T> |
keySet() |
double |
lastDoubleValue()
A method to get the last Value of a Map.
|
Object2DoubleMap.Entry<T> |
lastEntry() |
T |
lastKey() |
Object2DoubleMap.Entry<T> |
lowerEntry(T key) |
T |
lowerKey(T e) |
void |
mergeAllDouble(Object2DoubleMap<T> m,
DoubleDoubleUnaryOperator mappingFunction)
A Bulk method for merging Maps.
|
double |
mergeDouble(T key,
double value,
DoubleDoubleUnaryOperator mappingFunction)
A Type Specific merge method to reduce boxing/unboxing
|
ObjectNavigableSet<T> |
navigableKeySet() |
ObjectSet<Object2DoubleMap.Entry<T>> |
object2DoubleEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
Object2DoubleMap.Entry<T> |
pollFirstEntry() |
T |
pollFirstKey()
A method to get and remove the first Key of a Map.
|
Object2DoubleMap.Entry<T> |
pollLastEntry() |
T |
pollLastKey()
A method to get and remove the last Key of a Map.
|
double |
put(T key,
double value)
Type Specific method to reduce boxing/unboxing of values
|
double |
putIfAbsent(T key,
double value)
Type Specific method to reduce boxing/unboxing of values
|
double |
rem(T key)
Type Specific remove function to reduce boxing/unboxing
|
double |
remOrDefault(T key,
double defaultValue)
Type-Specific Remove function with a default return value if wanted.
|
boolean |
remove(T key,
double value)
Type Specific remove function to reduce boxing/unboxing
|
double |
replace(T key,
double value)
A Type Specific replace method to reduce boxing/unboxing replace an existing value
|
boolean |
replace(T key,
double oldValue,
double newValue)
A Type Specific replace method to replace an existing value
|
int |
size() |
double |
subFrom(T key,
double value)
A Helper method to subtract from primitive from each other.
|
Object2DoubleNavigableMap<T> |
subMap(T fromKey,
boolean fromInclusive,
T toKey,
boolean toInclusive) |
double |
supplyDoubleIfAbsent(T key,
DoubleSupplier valueProvider)
A Supplier based computeIfAbsent function to fill the most used usecase of this function
|
Object2DoubleNavigableMap<T> |
tailMap(T fromKey,
boolean inclusive) |
DoubleCollection |
values() |
addToAll, containsValue, entrySet, equals, get, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, remove, replaceDoubles, replaceDoubles, setDefaultReturnValueheadMap, subMap, synchronize, synchronize, tailMap, unmodifiableaddToAll, applyAsDouble, 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, replaceDoubles, replaceDoubles, setDefaultReturnValuepublic Object2DoubleRBTreeMap()
public Object2DoubleRBTreeMap(java.util.Comparator<T> comp)
comp - the function that decides how the tree is sorted, can be nullpublic Object2DoubleRBTreeMap(T[] keys, java.lang.Double[] 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 Object2DoubleRBTreeMap(T[] keys, java.lang.Double[] values, java.util.Comparator<T> 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 Object2DoubleRBTreeMap(T[] keys, double[] 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 Object2DoubleRBTreeMap(T[] keys, double[] values, java.util.Comparator<T> 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 Object2DoubleRBTreeMap(java.util.Map<? extends T,? extends java.lang.Double> map)
map - the values that should be present in the mappublic Object2DoubleRBTreeMap(java.util.Map<? extends T,? extends java.lang.Double> map, java.util.Comparator<T> comp)
map - the values that should be present in the mapcomp - the function that decides how the tree is sorted, can be nullpublic Object2DoubleRBTreeMap(Object2DoubleMap<T> map)
map - the values that should be present in the mappublic Object2DoubleRBTreeMap(Object2DoubleMap<T> map, java.util.Comparator<T> comp)
map - the values that should be present in the mapcomp - the function that decides how the tree is sorted, can be nullpublic T getDefaultMaxValue()
public T getDefaultMinValue()
public double put(T key, double value)
Object2DoubleMapput in interface Object2DoubleMap<T>key - the key that should be inserted,value - the value that should be insertedMap.put(Object, Object)public double putIfAbsent(T key, double value)
Object2DoubleMapputIfAbsent in interface Object2DoubleMap<T>key - the key that should be inserted,value - the value that should be insertedMap.putIfAbsent(Object, Object)public double addTo(T key, double value)
Object2DoubleMapaddTo in interface Object2DoubleMap<T>key - the key that should be inserted,value - the value that should be inserted / addedpublic double subFrom(T key, double value)
Object2DoubleMapObject2DoubleMap.getDefaultReturnValue()
If the fence is reached the element will be automaticall removedsubFrom in interface Object2DoubleMap<T>key - that should be subtract fromvalue - that should be subtractpublic java.util.Comparator<T> comparator()
comparator in interface java.util.SortedMap<T,java.lang.Double>comparator in interface Object2DoubleSortedMap<T>public boolean containsKey(java.lang.Object key)
containsKey in interface java.util.Map<T,java.lang.Double>containsKey in class AbstractObject2DoubleMap<T>public double getDouble(T key)
Object2DoubleMapgetDouble in interface Object2DoubleMap<T>key - the key that is searched forpublic double getOrDefault(T key, double defaultValue)
Object2DoubleMapgetOrDefault in interface Object2DoubleMap<T>key - the key that is searched fordefaultValue - the value that should be returned if the key is not presentpublic T firstKey()
firstKey in interface java.util.SortedMap<T,java.lang.Double>public T pollFirstKey()
Object2DoubleSortedMappollFirstKey in interface Object2DoubleSortedMap<T>public T lastKey()
lastKey in interface java.util.SortedMap<T,java.lang.Double>public T pollLastKey()
Object2DoubleSortedMappollLastKey in interface Object2DoubleSortedMap<T>public Object2DoubleMap.Entry<T> firstEntry()
firstEntry in interface java.util.NavigableMap<T,java.lang.Double>firstEntry in interface Object2DoubleNavigableMap<T>public Object2DoubleMap.Entry<T> lastEntry()
lastEntry in interface java.util.NavigableMap<T,java.lang.Double>lastEntry in interface Object2DoubleNavigableMap<T>public Object2DoubleMap.Entry<T> pollFirstEntry()
pollFirstEntry in interface java.util.NavigableMap<T,java.lang.Double>pollFirstEntry in interface Object2DoubleNavigableMap<T>public Object2DoubleMap.Entry<T> pollLastEntry()
pollLastEntry in interface java.util.NavigableMap<T,java.lang.Double>pollLastEntry in interface Object2DoubleNavigableMap<T>public double firstDoubleValue()
Object2DoubleSortedMapfirstDoubleValue in interface Object2DoubleSortedMap<T>public double lastDoubleValue()
Object2DoubleSortedMaplastDoubleValue in interface Object2DoubleSortedMap<T>public double rem(T key)
Object2DoubleMaprem in interface Object2DoubleMap<T>key - the element that should be removedpublic double remOrDefault(T key, double defaultValue)
Object2DoubleMapremOrDefault in interface Object2DoubleMap<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, double value)
Object2DoubleMapremove in interface Object2DoubleMap<T>key - the element that should be removedvalue - the expected value that should be foundMap.remove(Object, Object)public boolean replace(T key, double oldValue, double newValue)
Object2DoubleMapreplace in interface Object2DoubleMap<T>replace in class AbstractObject2DoubleMap<T>key - the element that should be searched foroldValue - the expected value to be replacednewValue - the value to replace the oldValue with.public double replace(T key, double value)
Object2DoubleMapreplace in interface Object2DoubleMap<T>replace in class AbstractObject2DoubleMap<T>key - the element that should be searched forvalue - the value to replace with.public double computeDouble(T key, ObjectDoubleUnaryOperator<T> mappingFunction)
Object2DoubleMapcomputeDouble in interface Object2DoubleMap<T>computeDouble in class AbstractObject2DoubleMap<T>key - the key that should be computedmappingFunction - the operator that should generate the valuepublic double computeDoubleIfAbsent(T key, ToDoubleFunction<T> mappingFunction)
Object2DoubleMapcomputeDoubleIfAbsent in interface Object2DoubleMap<T>computeDoubleIfAbsent in class AbstractObject2DoubleMap<T>key - the key that should be computedmappingFunction - the operator that should generate the value if not presentpublic double supplyDoubleIfAbsent(T key, DoubleSupplier valueProvider)
Object2DoubleMapsupplyDoubleIfAbsent in interface Object2DoubleMap<T>supplyDoubleIfAbsent in class AbstractObject2DoubleMap<T>key - the key that should be computedvalueProvider - the value if not presentpublic double computeDoubleIfPresent(T key, ObjectDoubleUnaryOperator<T> mappingFunction)
Object2DoubleMapcomputeDoubleIfPresent in interface Object2DoubleMap<T>computeDoubleIfPresent in class AbstractObject2DoubleMap<T>key - the key that should be computedmappingFunction - the operator that should generate the value if presentpublic double mergeDouble(T key, double value, DoubleDoubleUnaryOperator mappingFunction)
Object2DoubleMapmergeDouble in interface Object2DoubleMap<T>mergeDouble in class AbstractObject2DoubleMap<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 mergeAllDouble(Object2DoubleMap<T> m, DoubleDoubleUnaryOperator mappingFunction)
Object2DoubleMapmergeAllDouble in interface Object2DoubleMap<T>mergeAllDouble in class AbstractObject2DoubleMap<T>m - the entries that should be bulk addedmappingFunction - the operator that should generate the new Valuepublic void forEach(ObjectDoubleConsumer<T> action)
Object2DoubleMapforEach in interface Object2DoubleMap<T>forEach in class AbstractObject2DoubleMap<T>action - processor of the values that are iterator overpublic int size()
public void clear()
public Object2DoubleRBTreeMap<T> copy()
Object2DoubleMapcopy in interface Object2DoubleMap<T>copy in interface Object2DoubleNavigableMap<T>copy in interface Object2DoubleSortedMap<T>copy in class AbstractObject2DoubleMap<T>public ObjectNavigableSet<T> keySet()
keySet in interface java.util.Map<T,java.lang.Double>keySet in interface java.util.SortedMap<T,java.lang.Double>keySet in interface Object2DoubleMap<T>keySet in interface Object2DoubleNavigableMap<T>keySet in interface Object2DoubleSortedMap<T>keySet in class AbstractObject2DoubleMap<T>public ObjectSet<Object2DoubleMap.Entry<T>> object2DoubleEntrySet()
Object2DoubleMapobject2DoubleEntrySet in interface Object2DoubleMap<T>public DoubleCollection values()
values in interface java.util.Map<T,java.lang.Double>values in interface java.util.SortedMap<T,java.lang.Double>values in interface Object2DoubleMap<T>values in interface Object2DoubleSortedMap<T>values in class AbstractObject2DoubleMap<T>public ObjectNavigableSet<T> navigableKeySet()
navigableKeySet in interface java.util.NavigableMap<T,java.lang.Double>navigableKeySet in interface Object2DoubleNavigableMap<T>public Object2DoubleNavigableMap<T> descendingMap()
descendingMap in interface java.util.NavigableMap<T,java.lang.Double>descendingMap in interface Object2DoubleNavigableMap<T>public ObjectNavigableSet<T> descendingKeySet()
descendingKeySet in interface java.util.NavigableMap<T,java.lang.Double>descendingKeySet in interface Object2DoubleNavigableMap<T>public Object2DoubleNavigableMap<T> subMap(T fromKey, boolean fromInclusive, T toKey, boolean toInclusive)
subMap in interface java.util.NavigableMap<T,java.lang.Double>subMap in interface Object2DoubleNavigableMap<T>public Object2DoubleNavigableMap<T> headMap(T toKey, boolean inclusive)
headMap in interface java.util.NavigableMap<T,java.lang.Double>headMap in interface Object2DoubleNavigableMap<T>public Object2DoubleNavigableMap<T> tailMap(T fromKey, boolean inclusive)
tailMap in interface java.util.NavigableMap<T,java.lang.Double>tailMap in interface Object2DoubleNavigableMap<T>public T lowerKey(T e)
lowerKey in interface java.util.NavigableMap<T,java.lang.Double>public T floorKey(T e)
floorKey in interface java.util.NavigableMap<T,java.lang.Double>public T higherKey(T e)
higherKey in interface java.util.NavigableMap<T,java.lang.Double>public T ceilingKey(T e)
ceilingKey in interface java.util.NavigableMap<T,java.lang.Double>public Object2DoubleMap.Entry<T> lowerEntry(T key)
lowerEntry in interface java.util.NavigableMap<T,java.lang.Double>lowerEntry in interface Object2DoubleNavigableMap<T>public Object2DoubleMap.Entry<T> higherEntry(T key)
higherEntry in interface java.util.NavigableMap<T,java.lang.Double>higherEntry in interface Object2DoubleNavigableMap<T>public Object2DoubleMap.Entry<T> floorEntry(T key)
floorEntry in interface java.util.NavigableMap<T,java.lang.Double>floorEntry in interface Object2DoubleNavigableMap<T>public Object2DoubleMap.Entry<T> ceilingEntry(T key)
ceilingEntry in interface java.util.NavigableMap<T,java.lang.Double>ceilingEntry in interface Object2DoubleNavigableMap<T>