public class Byte2DoubleRBTreeMap extends AbstractByte2DoubleSortedMap implements java.io.Serializable, java.lang.Cloneable
The iterators provided by the views of this class are type-specific bidirectional iterators.
Moreover, the iterator returned by iterator()
can be safely cast
to a type-specific list iterator.
AbstractByte2DoubleMap.BasicEntry, AbstractByte2DoubleMap.BasicEntrySet
Byte2DoubleSortedMap.FastSortedEntrySet
Byte2DoubleMap.FastEntrySet
Constructor and Description |
---|
Byte2DoubleRBTreeMap()
Creates a new empty tree map.
|
Byte2DoubleRBTreeMap(byte[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Byte2DoubleRBTreeMap(byte[] k,
double[] v,
java.util.Comparator<? super java.lang.Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Byte2DoubleRBTreeMap(Byte2DoubleMap m)
Creates a new tree map copying a given map.
|
Byte2DoubleRBTreeMap(Byte2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Byte2DoubleRBTreeMap(java.util.Comparator<? super java.lang.Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2DoubleRBTreeMap(java.util.Map<? extends java.lang.Byte,? extends java.lang.Double> m)
Creates a new tree map copying a given map.
|
Byte2DoubleRBTreeMap(java.util.SortedMap<java.lang.Byte,java.lang.Double> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
double |
addTo(byte k,
double incr)
Adds an increment to value currently associated with a key.
|
ObjectSortedSet<Byte2DoubleMap.Entry> |
byte2DoubleEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Byte2DoubleRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
ByteComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(byte k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(double v)
Returns
true if this map maps one or more keys to the specified value. |
byte |
firstByteKey()
Returns the first (lowest) key currently in this map.
|
double |
get(byte k)
Returns the value to which the given key is mapped.
|
Byte2DoubleSortedMap |
headMap(byte to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey . |
boolean |
isEmpty() |
ByteSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
byte |
lastByteKey()
Returns the last (highest) key currently in this map.
|
double |
put(byte k,
double v)
Adds a pair to the map (optional operation).
|
double |
remove(byte k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Byte2DoubleSortedMap |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Byte2DoubleSortedMap |
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
DoubleCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, mergeDouble, putAll, toString
defaultReturnValue, defaultReturnValue
entrySet, firstKey, headMap, lastKey, subMap, tailMap
compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, merge, mergeDouble, mergeDouble, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsDouble, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
public Byte2DoubleRBTreeMap()
public Byte2DoubleRBTreeMap(java.util.Comparator<? super java.lang.Byte> c)
c
- a (possibly type-specific) comparator.public Byte2DoubleRBTreeMap(java.util.Map<? extends java.lang.Byte,? extends java.lang.Double> m)
m
- a Map
to be copied into the new tree map.public Byte2DoubleRBTreeMap(java.util.SortedMap<java.lang.Byte,java.lang.Double> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Byte2DoubleRBTreeMap(Byte2DoubleMap m)
m
- a type-specific map to be copied into the new tree map.public Byte2DoubleRBTreeMap(Byte2DoubleSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Byte2DoubleRBTreeMap(byte[] k, double[] v, java.util.Comparator<? super java.lang.Byte> c)
k
- the array of keys of the new tree map.v
- the array of corresponding values in the new tree map.c
- a (possibly type-specific) comparator.java.lang.IllegalArgumentException
- if k
and v
have different lengths.public Byte2DoubleRBTreeMap(byte[] k, double[] v)
k
- the array of keys of the new tree map.v
- the array of corresponding values in the new tree map.java.lang.IllegalArgumentException
- if k
and v
have different lengths.public double addTo(byte k, double incr)
Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
k
- the key.incr
- the increment.public double put(byte k, double v)
Byte2DoubleFunction
put
in interface Byte2DoubleFunction
k
- the key.v
- the value.Function.put(Object,Object)
public double remove(byte k)
Byte2DoubleFunction
remove
in interface Byte2DoubleFunction
k
- the key.Function.remove(Object)
public boolean containsValue(double v)
AbstractByte2DoubleMap
true
if this map maps one or more keys to the specified value.containsValue
in interface Byte2DoubleMap
containsValue
in class AbstractByte2DoubleMap
Map.containsValue(Object)
public void clear()
Byte2DoubleMap
clear
in interface Byte2DoubleMap
clear
in interface java.util.Map<java.lang.Byte,java.lang.Double>
Map.clear()
public boolean containsKey(byte k)
AbstractByte2DoubleMap
containsKey
in interface Byte2DoubleFunction
containsKey
in interface Byte2DoubleMap
containsKey
in class AbstractByte2DoubleMap
k
- the key.key
.Map.containsKey(Object)
public int size()
Byte2DoubleMap
Integer.MAX_VALUE
elements, returns Integer.MAX_VALUE
.size
in interface Byte2DoubleMap
size
in interface java.util.Map<java.lang.Byte,java.lang.Double>
Size64
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Byte,java.lang.Double>
isEmpty
in class AbstractByte2DoubleMap
public double get(byte k)
Byte2DoubleFunction
get
in interface Byte2DoubleFunction
k
- the key.Function.get(Object)
public byte firstByteKey()
Byte2DoubleSortedMap
firstByteKey
in interface Byte2DoubleSortedMap
SortedMap.firstKey()
public byte lastByteKey()
Byte2DoubleSortedMap
lastByteKey
in interface Byte2DoubleSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Byte2DoubleMap.Entry> byte2DoubleEntrySet()
Byte2DoubleSortedMap
byte2DoubleEntrySet
in interface Byte2DoubleMap
byte2DoubleEntrySet
in interface Byte2DoubleSortedMap
Byte2DoubleSortedMap.entrySet()
public ByteSortedSet keySet()
In addition to the semantics of Map.keySet()
, you can
safely cast the set returned by this call to a type-specific sorted
set interface.
keySet
in interface Byte2DoubleMap
keySet
in interface Byte2DoubleSortedMap
keySet
in interface java.util.Map<java.lang.Byte,java.lang.Double>
keySet
in interface java.util.SortedMap<java.lang.Byte,java.lang.Double>
keySet
in class AbstractByte2DoubleSortedMap
Map.keySet()
public DoubleCollection values()
In addition to the semantics of Map.values()
, you can
safely cast the collection returned by this call to a type-specific collection
interface.
values
in interface Byte2DoubleMap
values
in interface Byte2DoubleSortedMap
values
in interface java.util.Map<java.lang.Byte,java.lang.Double>
values
in interface java.util.SortedMap<java.lang.Byte,java.lang.Double>
values
in class AbstractByte2DoubleSortedMap
Map.values()
public ByteComparator comparator()
Byte2DoubleSortedMap
comparator
in interface Byte2DoubleSortedMap
comparator
in interface java.util.SortedMap<java.lang.Byte,java.lang.Double>
SortedMap.comparator()
public Byte2DoubleSortedMap headMap(byte to)
Byte2DoubleSortedMap
toKey
.headMap
in interface Byte2DoubleSortedMap
SortedMap.headMap(Object)
public Byte2DoubleSortedMap tailMap(byte from)
Byte2DoubleSortedMap
fromKey
.tailMap
in interface Byte2DoubleSortedMap
SortedMap.tailMap(Object)
public Byte2DoubleSortedMap subMap(byte from, byte to)
Byte2DoubleSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Byte2DoubleSortedMap
SortedMap.subMap(Object,Object)
public Byte2DoubleRBTreeMap clone()
This method performs a deep copy of this tree map; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.
clone
in class java.lang.Object