public class Double2ByteRBTreeMap extends AbstractDouble2ByteSortedMap 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.
AbstractDouble2ByteSortedMap.KeySetIterator, AbstractDouble2ByteSortedMap.ValuesCollection, AbstractDouble2ByteSortedMap.ValuesIteratorAbstractDouble2ByteMap.BasicEntry, AbstractDouble2ByteMap.BasicEntrySetDouble2ByteSortedMap.FastSortedEntrySetDouble2ByteMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected DoubleComparator |
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<Double2ByteMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.doubles.Double2ByteRBTreeMap.Entry |
firstEntry
The first key in this map.
|
protected DoubleSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.doubles.Double2ByteRBTreeMap.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 Double> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.doubles.Double2ByteRBTreeMap.Entry |
tree
A reference to the root entry.
|
protected ByteCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Double2ByteRBTreeMap()
Creates a new empty tree map.
|
Double2ByteRBTreeMap(Comparator<? super Double> c)
Creates a new empty tree map with the given comparator.
|
Double2ByteRBTreeMap(double[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Double2ByteRBTreeMap(double[] k,
byte[] v,
Comparator<? super Double> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Double2ByteRBTreeMap(Double2ByteMap m)
Creates a new tree map copying a given map.
|
Double2ByteRBTreeMap(Double2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Double2ByteRBTreeMap(Map<? extends Double,? extends Byte> m)
Creates a new tree map copying a given map.
|
Double2ByteRBTreeMap(SortedMap<Double,Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
byte |
addTo(double k,
byte incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Double2ByteRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
DoubleComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(double k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(byte v)
Returns
true if this map maps one or more keys to the specified value. |
ObjectSortedSet<Double2ByteMap.Entry> |
double2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
double |
firstDoubleKey()
Returns the first (lowest) key currently in this map.
|
byte |
get(double k)
Returns the value to which the given key is mapped.
|
Double2ByteSortedMap |
headMap(double to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
DoubleSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
double |
lastDoubleKey()
Returns the last (highest) key currently in this map.
|
byte |
put(double k,
byte v)
Adds a pair to the map (optional operation).
|
byte |
remove(double k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Double2ByteSortedMap |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Double2ByteSortedMap |
tailMap(double from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
ByteCollection |
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, replaceapplyAsIntprotected transient it.unimi.dsi.fastutil.doubles.Double2ByteRBTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.doubles.Double2ByteRBTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.doubles.Double2ByteRBTreeMap.Entry lastEntry
protected transient ObjectSortedSet<Double2ByteMap.Entry> entries
protected transient DoubleSortedSet keys
protected transient ByteCollection values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected Comparator<? super Double> storedComparator
protected transient DoubleComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Double2ByteRBTreeMap()
public Double2ByteRBTreeMap(Comparator<? super Double> c)
c - a (possibly type-specific) comparator.public Double2ByteRBTreeMap(Map<? extends Double,? extends Byte> m)
m - a Map to be copied into the new tree map.public Double2ByteRBTreeMap(SortedMap<Double,Byte> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Double2ByteRBTreeMap(Double2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Double2ByteRBTreeMap(Double2ByteSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Double2ByteRBTreeMap(double[] k,
byte[] v,
Comparator<? super Double> 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 Double2ByteRBTreeMap(double[] k,
byte[] 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 byte addTo(double k,
byte 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 byte put(double k,
byte v)
Double2ByteFunctionput in interface Double2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public byte remove(double k)
Double2ByteFunctionremove in interface Double2ByteFunctionk - the key.Function.remove(Object)public boolean containsValue(byte v)
Double2ByteMaptrue if this map maps one or more keys to the specified value.containsValue in interface Double2ByteMapcontainsValue in class AbstractDouble2ByteMapMap.containsValue(Object)public void clear()
Double2ByteMapclear in interface Double2ByteMapclear in interface Map<Double,Byte>Map.clear()public boolean containsKey(double k)
Double2ByteMapcontainsKey in interface Double2ByteFunctioncontainsKey in interface Double2ByteMapcontainsKey in class AbstractDouble2ByteMapk - the key.key.Map.containsKey(Object)public int size()
Double2ByteMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public byte get(double k)
Double2ByteFunctionget in interface Double2ByteFunctionk - the key.Function.get(Object)public double firstDoubleKey()
Double2ByteSortedMapfirstDoubleKey in interface Double2ByteSortedMapSortedMap.firstKey()public double lastDoubleKey()
Double2ByteSortedMaplastDoubleKey in interface Double2ByteSortedMapSortedMap.lastKey()public ObjectSortedSet<Double2ByteMap.Entry> double2ByteEntrySet()
Double2ByteSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
double2ByteEntrySet in interface Double2ByteMapdouble2ByteEntrySet in interface Double2ByteSortedMapDouble2ByteSortedMap.entrySet()public DoubleSortedSet 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 Double2ByteMapkeySet in interface Double2ByteSortedMapkeySet in interface Map<Double,Byte>keySet in interface SortedMap<Double,Byte>keySet in class AbstractDouble2ByteSortedMapMap.keySet()public ByteCollection 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 Double2ByteMapvalues in interface Double2ByteSortedMapvalues in interface Map<Double,Byte>values in interface SortedMap<Double,Byte>values in class AbstractDouble2ByteSortedMapMap.values()public DoubleComparator comparator()
Double2ByteSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Double2ByteSortedMapcomparator in interface SortedMap<Double,Byte>SortedMap.comparator()public Double2ByteSortedMap headMap(double to)
Double2ByteSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Double2ByteSortedMapSortedMap.headMap(Object)public Double2ByteSortedMap tailMap(double from)
Double2ByteSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Double2ByteSortedMapSortedMap.tailMap(Object)public Double2ByteSortedMap subMap(double from, double to)
Double2ByteSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Double2ByteSortedMapSortedMap.subMap(Object,Object)public Double2ByteRBTreeMap 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.