public class Byte2DoubleRBTreeMap extends AbstractByte2DoubleSortedMap implements Serializable, 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.
AbstractByte2DoubleSortedMap.KeySetIterator, AbstractByte2DoubleSortedMap.ValuesCollection, AbstractByte2DoubleSortedMap.ValuesIteratorAbstractByte2DoubleMap.BasicEntry, AbstractByte2DoubleMap.BasicEntrySetByte2DoubleSortedMap.FastSortedEntrySetByte2DoubleMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected ByteComparator |
actualComparator
This map's actual comparator; it may differ from
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping. |
protected int |
count
Number of entries in this map.
|
protected ObjectSortedSet<Byte2DoubleMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.bytes.Byte2DoubleRBTreeMap.Entry |
firstEntry
The first key in this map.
|
protected ByteSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.bytes.Byte2DoubleRBTreeMap.Entry |
lastEntry
The last key in this map.
|
protected boolean |
modified
The value of this variable remembers, after a
put()
or a remove(), whether the domain of the map
has been modified. |
protected Comparator<? super Byte> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.bytes.Byte2DoubleRBTreeMap.Entry |
tree
A reference to the root entry.
|
protected DoubleCollection |
values
Cached collection of values.
|
defRetValue| 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,
Comparator<? super 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(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2DoubleRBTreeMap(Map<? extends Byte,? extends Double> m)
Creates a new tree map copying a given map.
|
Byte2DoubleRBTreeMap(SortedMap<Byte,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, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitentrySet, firstKey, headMap, lastKey, subMap, tailMapcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsDoubleprotected transient it.unimi.dsi.fastutil.bytes.Byte2DoubleRBTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.bytes.Byte2DoubleRBTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.bytes.Byte2DoubleRBTreeMap.Entry lastEntry
protected transient ObjectSortedSet<Byte2DoubleMap.Entry> entries
protected transient ByteSortedSet keys
protected transient DoubleCollection values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected Comparator<? super Byte> storedComparator
protected transient ByteComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Byte2DoubleRBTreeMap()
public Byte2DoubleRBTreeMap(Comparator<? super Byte> c)
c - a (possibly type-specific) comparator.public Byte2DoubleRBTreeMap(Map<? extends Byte,? extends Double> m)
m - a Map to be copied into the new tree map.public Byte2DoubleRBTreeMap(SortedMap<Byte,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,
Comparator<? super 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.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.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)
Byte2DoubleFunctionput in interface Byte2DoubleFunctionk - the key.v - the value.Function.put(Object,Object)public double remove(byte k)
Byte2DoubleFunctionremove in interface Byte2DoubleFunctionk - the key.Function.remove(Object)public boolean containsValue(double v)
Byte2DoubleMaptrue if this map maps one or more keys to the specified value.containsValue in interface Byte2DoubleMapcontainsValue in class AbstractByte2DoubleMapMap.containsValue(Object)public void clear()
Byte2DoubleMapclear in interface Byte2DoubleMapclear in interface Map<Byte,Double>Map.clear()public boolean containsKey(byte k)
Byte2DoubleMapcontainsKey in interface Byte2DoubleFunctioncontainsKey in interface Byte2DoubleMapcontainsKey in class AbstractByte2DoubleMapk - the key.key.Map.containsKey(Object)public int size()
Byte2DoubleMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public double get(byte k)
Byte2DoubleFunctionget in interface Byte2DoubleFunctionk - the key.Function.get(Object)public byte firstByteKey()
Byte2DoubleSortedMapfirstByteKey in interface Byte2DoubleSortedMapSortedMap.firstKey()public byte lastByteKey()
Byte2DoubleSortedMaplastByteKey in interface Byte2DoubleSortedMapSortedMap.lastKey()public ObjectSortedSet<Byte2DoubleMap.Entry> byte2DoubleEntrySet()
Byte2DoubleSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
byte2DoubleEntrySet in interface Byte2DoubleMapbyte2DoubleEntrySet in interface Byte2DoubleSortedMapByte2DoubleSortedMap.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 Byte2DoubleMapkeySet in interface Byte2DoubleSortedMapkeySet in interface Map<Byte,Double>keySet in interface SortedMap<Byte,Double>keySet in class AbstractByte2DoubleSortedMapMap.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 Byte2DoubleMapvalues in interface Byte2DoubleSortedMapvalues in interface Map<Byte,Double>values in interface SortedMap<Byte,Double>values in class AbstractByte2DoubleSortedMapMap.values()public ByteComparator comparator()
Byte2DoubleSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Byte2DoubleSortedMapcomparator in interface SortedMap<Byte,Double>SortedMap.comparator()public Byte2DoubleSortedMap headMap(byte to)
Byte2DoubleSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Byte2DoubleSortedMapSortedMap.headMap(Object)public Byte2DoubleSortedMap tailMap(byte from)
Byte2DoubleSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Byte2DoubleSortedMapSortedMap.tailMap(Object)public Byte2DoubleSortedMap subMap(byte from, byte to)
Byte2DoubleSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Byte2DoubleSortedMapSortedMap.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.
Copyright © 2020. All rights reserved.