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.
AbstractDouble2ByteMap.BasicEntry
Double2ByteSortedMap.FastSortedEntrySet
Double2ByteMap.FastEntrySet
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 |
---|---|
void |
clear()
Removes all associations from this function (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)
Checks whether the given value is contained in
AbstractDouble2ByteMap.keySet() . |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractDouble2ByteMap.values() . |
ObjectSortedSet<Double2ByteMap.Entry> |
double2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
double |
firstDoubleKey() |
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() |
byte |
put(double k,
byte v)
Adds a pair to the map.
|
Byte |
put(Double ok,
Byte ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
byte |
remove(double k)
Removes the mapping with the given key.
|
Byte |
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.
|
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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMap
containsValue, equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get
defaultReturnValue, defaultReturnValue
containsKey, get
containsKey, containsValue, equals, get, hashCode, putAll
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 put(double k, byte v)
Double2ByteFunction
put
in interface Double2ByteFunction
put
in class AbstractDouble2ByteFunction
k
- the key.v
- the value.Function.put(Object,Object)
public byte remove(double k)
Double2ByteFunction
remove
in interface Double2ByteFunction
remove
in class AbstractDouble2ByteFunction
Function.remove(Object)
public Byte put(Double ok, Byte ov)
AbstractDouble2ByteFunction
null
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 Byte remove(Object ok)
AbstractDouble2ByteFunction
null
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(byte v)
AbstractDouble2ByteMap
AbstractDouble2ByteMap.values()
.containsValue
in interface Double2ByteMap
containsValue
in class AbstractDouble2ByteMap
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(double k)
AbstractDouble2ByteMap
AbstractDouble2ByteMap.keySet()
.containsKey
in interface Double2ByteFunction
containsKey
in class AbstractDouble2ByteMap
Function.containsKey(Object)
public int size()
Function
Most 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 byte get(double k)
Double2ByteFunction
get
in interface Double2ByteFunction
k
- the key.Function.get(Object)
public double firstDoubleKey()
firstDoubleKey
in interface Double2ByteSortedMap
SortedMap.firstKey()
public double lastDoubleKey()
lastDoubleKey
in interface Double2ByteSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Double2ByteMap.Entry> double2ByteEntrySet()
Double2ByteSortedMap
double2ByteEntrySet
in interface Double2ByteMap
double2ByteEntrySet
in interface Double2ByteSortedMap
Double2ByteSortedMap.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 Double2ByteMap
keySet
in interface Double2ByteSortedMap
keySet
in interface Map<Double,Byte>
keySet
in interface SortedMap<Double,Byte>
keySet
in class AbstractDouble2ByteSortedMap
Map.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 Double2ByteMap
values
in interface Double2ByteSortedMap
values
in interface Map<Double,Byte>
values
in interface SortedMap<Double,Byte>
values
in class AbstractDouble2ByteSortedMap
Map.values()
public DoubleComparator comparator()
Double2ByteSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Double2ByteSortedMap
comparator
in interface SortedMap<Double,Byte>
SortedMap.comparator()
public Double2ByteSortedMap headMap(double to)
Double2ByteSortedMap
toKey
.headMap
in interface Double2ByteSortedMap
SortedMap.headMap(Object)
public Double2ByteSortedMap tailMap(double from)
Double2ByteSortedMap
fromKey
.tailMap
in interface Double2ByteSortedMap
SortedMap.tailMap(Object)
public Double2ByteSortedMap subMap(double from, double to)
Double2ByteSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Double2ByteSortedMap
SortedMap.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.