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.
AbstractByte2DoubleMap.BasicEntryByte2DoubleSortedMap.FastSortedEntrySetByte2DoubleMap.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,
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 |
|---|---|
ObjectSortedSet<Byte2DoubleMap.Entry> |
byte2DoubleEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (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)
Checks whether the given value is contained in
AbstractByte2DoubleMap.keySet(). |
boolean |
containsValue(double v)
Checks whether the given value is contained in
AbstractByte2DoubleMap.values(). |
byte |
firstByteKey() |
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() |
double |
put(byte k,
double v)
Adds a pair to the map.
|
Double |
put(Byte ok,
Double ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
double |
remove(byte k)
Removes the mapping with the given key.
|
Double |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcontainsKey, containsValue, equals, get, hashCode, putAllpublic 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 put(byte k,
double v)
Byte2DoubleFunctionput in interface Byte2DoubleFunctionput in class AbstractByte2DoubleFunctionk - the key.v - the value.Function.put(Object,Object)public double remove(byte k)
Byte2DoubleFunctionremove in interface Byte2DoubleFunctionremove in class AbstractByte2DoubleFunctionFunction.remove(Object)public Double put(Byte ok, Double ov)
AbstractByte2DoubleFunctionnull on a missing key.
This method must check whether the provided key is in the map using containsKey(). Thus,
it probes the map twice. Implementors of subclasses should override it with a more efficient method.
public Double remove(Object ok)
AbstractByte2DoubleFunctionnull on a missing key.
This method must check whether the provided key is in the map using containsKey(). Thus,
it probes the map twice. Implementors of subclasses should override it with a more efficient method.
public boolean containsValue(double v)
AbstractByte2DoubleMapAbstractByte2DoubleMap.values().containsValue in interface Byte2DoubleMapcontainsValue in class AbstractByte2DoubleMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(byte k)
AbstractByte2DoubleMapAbstractByte2DoubleMap.keySet().containsKey in interface Byte2DoubleFunctioncontainsKey in class AbstractByte2DoubleMapFunction.containsKey(Object)public int size()
FunctionMost function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
public boolean isEmpty()
public double get(byte k)
Byte2DoubleFunctionget in interface Byte2DoubleFunctionk - the key.Function.get(Object)public byte firstByteKey()
firstByteKey in interface Byte2DoubleSortedMapSortedMap.firstKey()public byte lastByteKey()
lastByteKey in interface Byte2DoubleSortedMapSortedMap.lastKey()public ObjectSortedSet<Byte2DoubleMap.Entry> byte2DoubleEntrySet()
Byte2DoubleSortedMapbyte2DoubleEntrySet 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.headMap in interface Byte2DoubleSortedMapSortedMap.headMap(Object)public Byte2DoubleSortedMap tailMap(byte from)
Byte2DoubleSortedMapfromKey.tailMap in interface Byte2DoubleSortedMapSortedMap.tailMap(Object)public Byte2DoubleSortedMap subMap(byte from, byte to)
Byte2DoubleSortedMapfromKey, inclusive, to toKey, exclusive.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.