public class Double2ByteRBTreeMap extends AbstractDouble2ByteMap implements Double2ByteNavigableMap
AbstractDouble2ByteMap.BasicEntryjava.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Double2ByteSortedMap.FastSortedSetDouble2ByteMap.BuilderCache, Double2ByteMap.Entry, Double2ByteMap.FastEntrySet, Double2ByteMap.MapBuilder| Constructor and Description |
|---|
Double2ByteRBTreeMap()
Default Constructor
|
Double2ByteRBTreeMap(double[] keys,
byte[] values)
Helper constructor that allow to create a map from unboxed values
|
Double2ByteRBTreeMap(java.lang.Double[] keys,
java.lang.Byte[] values)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Double2ByteRBTreeMap(double[] keys,
byte[] values,
DoubleComparator comp)
Helper constructor that has a custom sorter and allow to create a map from unboxed values
|
Double2ByteRBTreeMap(java.lang.Double[] keys,
java.lang.Byte[] values,
DoubleComparator comp)
Helper constructor that has a custom sorter and allow to create a map from boxed values (it will unbox them)
|
Double2ByteRBTreeMap(Double2ByteMap map)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Double2ByteRBTreeMap(Double2ByteMap map,
DoubleComparator 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.
|
Double2ByteRBTreeMap(DoubleComparator comp)
Constructor that allows to define the sorter
|
Double2ByteRBTreeMap(java.util.Map<? extends java.lang.Double,? extends java.lang.Byte> map)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Double2ByteRBTreeMap(java.util.Map<? extends java.lang.Double,? extends java.lang.Byte> map,
DoubleComparator 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 |
|---|---|
byte |
addTo(double key,
byte value)
A Helper method to add a primitives together.
|
Double2ByteMap.Entry |
ceilingEntry(double key)
A Type Specific ceilingEntry method to reduce boxing/unboxing.
|
double |
ceilingKey(double e)
A Type Specific ceilingKey method to reduce boxing/unboxing.
|
void |
clear() |
DoubleComparator |
comparator() |
byte |
computeByte(double key,
DoubleByteUnaryOperator mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
byte |
computeByteIfAbsent(double key,
Double2ByteFunction mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
byte |
computeByteIfPresent(double key,
DoubleByteUnaryOperator mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
boolean |
containsKey(double key)
Type Specific method to reduce boxing/unboxing of values
|
Double2ByteRBTreeMap |
copy()
A Function that does a shallow clone of the Map itself.
|
DoubleNavigableSet |
descendingKeySet() |
Double2ByteNavigableMap |
descendingMap() |
ObjectSet<Double2ByteMap.Entry> |
double2ByteEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
byte |
firstByteValue()
A method to get the first Value of a Map.
|
double |
firstDoubleKey()
A method to get the first Key of a Map.
|
Double2ByteMap.Entry |
firstEntry() |
Double2ByteMap.Entry |
floorEntry(double key)
A Type Specific floorEntry method to reduce boxing/unboxing.
|
double |
floorKey(double e)
A Type Specific floorKey method to reduce boxing/unboxing.
|
void |
forEach(DoubleByteConsumer action)
Type Specific forEach method to reduce boxing/unboxing
|
byte |
get(double key)
A Type Specific get method to reduce boxing/unboxing
|
double |
getDefaultMaxValue()
A Helper method to get the max value for SubMaps.
|
double |
getDefaultMinValue()
A Helper method to get the min value for SubMaps.
|
byte |
getOrDefault(double key,
byte defaultValue)
A Type Specific getOrDefault method to reduce boxing/unboxing
|
Double2ByteNavigableMap |
headMap(double toKey,
boolean inclusive)
A Type Specific HeadMap method to reduce boxing/unboxing
|
Double2ByteMap.Entry |
higherEntry(double key)
A Type Specific higherEntry method to reduce boxing/unboxing.
|
double |
higherKey(double e)
A Type Specific higherKey method to reduce boxing/unboxing.
|
DoubleNavigableSet |
keySet() |
byte |
lastByteValue()
A method to get the last Value of a Map.
|
double |
lastDoubleKey()
A method to get the last Key of a Map.
|
Double2ByteMap.Entry |
lastEntry() |
Double2ByteMap.Entry |
lowerEntry(double key)
A Type Specific lowerEntry method to reduce boxing/unboxing.
|
double |
lowerKey(double e)
A Type Specific lowerKey method to reduce boxing/unboxing.
|
void |
mergeAllByte(Double2ByteMap m,
ByteByteUnaryOperator mappingFunction)
A Bulk method for merging Maps.
|
byte |
mergeByte(double key,
byte value,
ByteByteUnaryOperator mappingFunction)
A Type Specific merge method to reduce boxing/unboxing
|
DoubleNavigableSet |
navigableKeySet() |
double |
pollFirstDoubleKey()
A method to get and remove the first Key of a Map.
|
Double2ByteMap.Entry |
pollFirstEntry() |
double |
pollLastDoubleKey()
A method to get and remove the last Key of a Map.
|
Double2ByteMap.Entry |
pollLastEntry() |
byte |
put(double key,
byte value)
Type Specific method to reduce boxing/unboxing of values
|
byte |
putIfAbsent(double key,
byte value)
Type Specific method to reduce boxing/unboxing of values
|
byte |
remove(double key)
Type Specific remove function to reduce boxing/unboxing
|
boolean |
remove(double key,
byte value)
Type Specific remove function to reduce boxing/unboxing
|
byte |
removeOrDefault(double key,
byte defaultValue)
Type-Specific Remove function with a default return value if wanted.
|
byte |
replace(double key,
byte value)
A Type Specific replace method to reduce boxing/unboxing replace an existing value
|
boolean |
replace(double key,
byte oldValue,
byte newValue)
A Type Specific replace method to replace an existing value
|
void |
setDefaultMaxValue(double value)
A Helper method to set the max value for SubMaps.
|
void |
setDefaultMinValue(double value)
A Helper method to set the min value for SubMaps.
|
int |
size() |
byte |
subFrom(double key,
byte value)
A Helper method to subtract from primitive from each other.
|
Double2ByteNavigableMap |
subMap(double fromKey,
boolean fromInclusive,
double toKey,
boolean toInclusive)
A Type Specific SubMap method to reduce boxing/unboxing
|
byte |
supplyByteIfAbsent(double key,
ByteSupplier valueProvider)
A Supplier based computeIfAbsent function to fill the most used usecase of this function
|
Double2ByteNavigableMap |
tailMap(double fromKey,
boolean inclusive)
A Type Specific TailMap method to reduce boxing/unboxing
|
ByteCollection |
values() |
addToAll, containsValue, entrySet, equals, get, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, remove, replaceBytes, replaceBytes, setDefaultReturnValueceilingEntry, ceilingKey, floorEntry, floorKey, headMap, headMap, headMap, higherEntry, higherKey, lowerEntry, lowerKey, subMap, subMap, subMap, synchronize, synchronize, tailMap, tailMap, tailMap, unmodifiablefirstKey, lastKeyaddToAll, builder, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, containsValue, entrySet, forEach, get, getDefaultReturnValue, getOrDefault, merge, put, putAll, putAll, putAll, putAll, putAll, putAllIfAbsent, putIfAbsent, remove, remove, replace, replace, replaceAll, replaceBytes, replaceBytes, setDefaultReturnValuepublic Double2ByteRBTreeMap()
public Double2ByteRBTreeMap(DoubleComparator comp)
comp - the function that decides how the tree is sorted, can be nullpublic Double2ByteRBTreeMap(java.lang.Double[] keys,
java.lang.Byte[] 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 Double2ByteRBTreeMap(java.lang.Double[] keys,
java.lang.Byte[] values,
DoubleComparator 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 Double2ByteRBTreeMap(double[] keys,
byte[] 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 Double2ByteRBTreeMap(double[] keys,
byte[] values,
DoubleComparator 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 Double2ByteRBTreeMap(java.util.Map<? extends java.lang.Double,? extends java.lang.Byte> map)
map - the values that should be present in the mappublic Double2ByteRBTreeMap(java.util.Map<? extends java.lang.Double,? extends java.lang.Byte> map,
DoubleComparator comp)
map - the values that should be present in the mapcomp - the function that decides how the tree is sorted, can be nullpublic Double2ByteRBTreeMap(Double2ByteMap map)
map - the values that should be present in the mappublic Double2ByteRBTreeMap(Double2ByteMap map, DoubleComparator 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(double value)
Double2ByteNavigableMapsetDefaultMaxValue in interface Double2ByteNavigableMapvalue - the new max valuepublic double getDefaultMaxValue()
Double2ByteNavigableMapgetDefaultMaxValue in interface Double2ByteNavigableMappublic void setDefaultMinValue(double value)
Double2ByteNavigableMapsetDefaultMinValue in interface Double2ByteNavigableMapvalue - the new min valuepublic double getDefaultMinValue()
Double2ByteNavigableMapgetDefaultMinValue in interface Double2ByteNavigableMappublic byte put(double key,
byte value)
Double2ByteMapput in interface Double2ByteMapkey - the key that should be inserted,value - the value that should be insertedMap.put(Object, Object)public byte putIfAbsent(double key,
byte value)
Double2ByteMapputIfAbsent in interface Double2ByteMapkey - the key that should be inserted,value - the value that should be insertedMap.putIfAbsent(Object, Object)public byte addTo(double key,
byte value)
Double2ByteMapaddTo in interface Double2ByteMapkey - the key that should be inserted,value - the value that should be inserted / addedpublic byte subFrom(double key,
byte value)
Double2ByteMapDouble2ByteMap.getDefaultReturnValue()
If the fence is reached the element will be automaticall removedsubFrom in interface Double2ByteMapkey - that should be subtract fromvalue - that should be subtractpublic DoubleComparator comparator()
comparator in interface java.util.SortedMap<java.lang.Double,java.lang.Byte>comparator in interface Double2ByteSortedMappublic boolean containsKey(double key)
Double2ByteMapcontainsKey in interface Double2ByteMapcontainsKey in class AbstractDouble2ByteMapkey - element that is searched forpublic byte get(double key)
Double2ByteMapget in interface Double2ByteFunctionget in interface Double2ByteMapkey - the key that is searched forpublic byte getOrDefault(double key,
byte defaultValue)
Double2ByteMapgetOrDefault in interface Double2ByteMapgetOrDefault in class AbstractDouble2ByteMapkey - the key that is searched fordefaultValue - the value that should be returned if the key is not presentpublic double firstDoubleKey()
Double2ByteSortedMapfirstDoubleKey in interface Double2ByteSortedMappublic double pollFirstDoubleKey()
Double2ByteSortedMappollFirstDoubleKey in interface Double2ByteSortedMappublic double lastDoubleKey()
Double2ByteSortedMaplastDoubleKey in interface Double2ByteSortedMappublic double pollLastDoubleKey()
Double2ByteSortedMappollLastDoubleKey in interface Double2ByteSortedMappublic Double2ByteMap.Entry firstEntry()
firstEntry in interface java.util.NavigableMap<java.lang.Double,java.lang.Byte>firstEntry in interface Double2ByteNavigableMappublic Double2ByteMap.Entry lastEntry()
lastEntry in interface java.util.NavigableMap<java.lang.Double,java.lang.Byte>lastEntry in interface Double2ByteNavigableMappublic Double2ByteMap.Entry pollFirstEntry()
pollFirstEntry in interface java.util.NavigableMap<java.lang.Double,java.lang.Byte>pollFirstEntry in interface Double2ByteNavigableMappublic Double2ByteMap.Entry pollLastEntry()
pollLastEntry in interface java.util.NavigableMap<java.lang.Double,java.lang.Byte>pollLastEntry in interface Double2ByteNavigableMappublic byte firstByteValue()
Double2ByteSortedMapfirstByteValue in interface Double2ByteSortedMappublic byte lastByteValue()
Double2ByteSortedMaplastByteValue in interface Double2ByteSortedMappublic byte remove(double key)
Double2ByteMapremove in interface Double2ByteMapkey - the element that should be removedpublic byte removeOrDefault(double key,
byte defaultValue)
Double2ByteMapremoveOrDefault in interface Double2ByteMapkey - the element that should be removeddefaultValue - the value that should be returned if the entry doesn't existMap.remove(Object, Object)public boolean remove(double key,
byte value)
Double2ByteMapremove in interface Double2ByteMapkey - the element that should be removedvalue - the expected value that should be foundMap.remove(Object, Object)public boolean replace(double key,
byte oldValue,
byte newValue)
Double2ByteMapreplace in interface Double2ByteMapreplace in class AbstractDouble2ByteMapkey - the element that should be searched foroldValue - the expected value to be replacednewValue - the value to replace the oldValue with.public byte replace(double key,
byte value)
Double2ByteMapreplace in interface Double2ByteMapreplace in class AbstractDouble2ByteMapkey - the element that should be searched forvalue - the value to replace with.public byte computeByte(double key,
DoubleByteUnaryOperator mappingFunction)
Double2ByteMapcomputeByte in interface Double2ByteMapcomputeByte in class AbstractDouble2ByteMapkey - the key that should be computedmappingFunction - the operator that should generate the valuepublic byte computeByteIfAbsent(double key,
Double2ByteFunction mappingFunction)
Double2ByteMapcomputeByteIfAbsent in interface Double2ByteMapcomputeByteIfAbsent in class AbstractDouble2ByteMapkey - the key that should be computedmappingFunction - the operator that should generate the value if not presentpublic byte supplyByteIfAbsent(double key,
ByteSupplier valueProvider)
Double2ByteMapsupplyByteIfAbsent in interface Double2ByteMapsupplyByteIfAbsent in class AbstractDouble2ByteMapkey - the key that should be computedvalueProvider - the value if not presentpublic byte computeByteIfPresent(double key,
DoubleByteUnaryOperator mappingFunction)
Double2ByteMapcomputeByteIfPresent in interface Double2ByteMapcomputeByteIfPresent in class AbstractDouble2ByteMapkey - the key that should be computedmappingFunction - the operator that should generate the value if presentpublic byte mergeByte(double key,
byte value,
ByteByteUnaryOperator mappingFunction)
Double2ByteMapmergeByte in interface Double2ByteMapmergeByte in class AbstractDouble2ByteMapkey - the key that should be be searched forvalue - the value that should be merged withmappingFunction - the operator that should generate the new Valuepublic void mergeAllByte(Double2ByteMap m, ByteByteUnaryOperator mappingFunction)
Double2ByteMapmergeAllByte in interface Double2ByteMapmergeAllByte in class AbstractDouble2ByteMapm - the entries that should be bulk addedmappingFunction - the operator that should generate the new Valuepublic void forEach(DoubleByteConsumer action)
Double2ByteMapforEach in interface Double2ByteMapforEach in class AbstractDouble2ByteMapaction - processor of the values that are iterator overpublic int size()
size in interface java.util.Map<java.lang.Double,java.lang.Byte>size in class java.util.AbstractMap<java.lang.Double,java.lang.Byte>public void clear()
clear in interface java.util.Map<java.lang.Double,java.lang.Byte>clear in class java.util.AbstractMap<java.lang.Double,java.lang.Byte>public Double2ByteRBTreeMap copy()
Double2ByteMapcopy in interface Double2ByteMapcopy in interface Double2ByteNavigableMapcopy in interface Double2ByteSortedMapcopy in class AbstractDouble2ByteMappublic DoubleNavigableSet keySet()
keySet in interface java.util.Map<java.lang.Double,java.lang.Byte>keySet in interface java.util.SortedMap<java.lang.Double,java.lang.Byte>keySet in interface Double2ByteMapkeySet in interface Double2ByteNavigableMapkeySet in interface Double2ByteSortedMapkeySet in class AbstractDouble2ByteMappublic ObjectSet<Double2ByteMap.Entry> double2ByteEntrySet()
Double2ByteMapdouble2ByteEntrySet in interface Double2ByteMappublic ByteCollection values()
values in interface java.util.Map<java.lang.Double,java.lang.Byte>values in interface java.util.SortedMap<java.lang.Double,java.lang.Byte>values in interface Double2ByteMapvalues in interface Double2ByteSortedMapvalues in class AbstractDouble2ByteMappublic DoubleNavigableSet navigableKeySet()
navigableKeySet in interface java.util.NavigableMap<java.lang.Double,java.lang.Byte>navigableKeySet in interface Double2ByteNavigableMappublic Double2ByteNavigableMap descendingMap()
descendingMap in interface java.util.NavigableMap<java.lang.Double,java.lang.Byte>descendingMap in interface Double2ByteNavigableMappublic DoubleNavigableSet descendingKeySet()
descendingKeySet in interface java.util.NavigableMap<java.lang.Double,java.lang.Byte>descendingKeySet in interface Double2ByteNavigableMappublic Double2ByteNavigableMap subMap(double fromKey, boolean fromInclusive, double toKey, boolean toInclusive)
Double2ByteNavigableMapsubMap in interface Double2ByteNavigableMapfromKey - where the submap should startfromInclusive - if the fromKey is inclusive or nottoKey - where the subMap should endtoInclusive - if the toKey is inclusive or notpublic Double2ByteNavigableMap headMap(double toKey, boolean inclusive)
Double2ByteNavigableMapheadMap in interface Double2ByteNavigableMaptoKey - where the HeadMap should endinclusive - if the toKey is inclusive or notpublic Double2ByteNavigableMap tailMap(double fromKey, boolean inclusive)
Double2ByteNavigableMaptailMap in interface Double2ByteNavigableMapfromKey - where the TailMap should startinclusive - if the fromKey is inclusive or notpublic double lowerKey(double e)
Double2ByteNavigableMaplowerKey in interface Double2ByteNavigableMape - that should be compared with.public double floorKey(double e)
Double2ByteNavigableMapfloorKey in interface Double2ByteNavigableMape - that should be compared with.public double higherKey(double e)
Double2ByteNavigableMaphigherKey in interface Double2ByteNavigableMape - that should be compared with.public double ceilingKey(double e)
Double2ByteNavigableMapceilingKey in interface Double2ByteNavigableMape - that should be compared with.public Double2ByteMap.Entry lowerEntry(double key)
Double2ByteNavigableMaplowerEntry in interface Double2ByteNavigableMapkey - that should be compared with.public Double2ByteMap.Entry higherEntry(double key)
Double2ByteNavigableMaphigherEntry in interface Double2ByteNavigableMapkey - that should be compared with.public Double2ByteMap.Entry floorEntry(double key)
Double2ByteNavigableMapfloorEntry in interface Double2ByteNavigableMapkey - that should be compared with.public Double2ByteMap.Entry ceilingEntry(double key)
Double2ByteNavigableMapceilingEntry in interface Double2ByteNavigableMapkey - that should be compared with.