public class Double2CharRBTreeMap extends AbstractDouble2CharSortedMap 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.
AbstractDouble2CharMap.BasicEntry
Double2CharSortedMap.FastSortedEntrySet
Double2CharMap.FastEntrySet
Constructor and Description |
---|
Double2CharRBTreeMap()
Creates a new empty tree map.
|
Double2CharRBTreeMap(java.util.Comparator<? super java.lang.Double> c)
Creates a new empty tree map with the given comparator.
|
Double2CharRBTreeMap(double[] k,
char[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Double2CharRBTreeMap(double[] k,
char[] v,
java.util.Comparator<? super java.lang.Double> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Double2CharRBTreeMap(Double2CharMap m)
Creates a new tree map copying a given map.
|
Double2CharRBTreeMap(Double2CharSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Double2CharRBTreeMap(java.util.Map<? extends java.lang.Double,? extends java.lang.Character> m)
Creates a new tree map copying a given map.
|
Double2CharRBTreeMap(java.util.SortedMap<java.lang.Double,java.lang.Character> 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).
|
Double2CharRBTreeMap |
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
AbstractDouble2CharMap.keySet() . |
boolean |
containsValue(char v)
Checks whether the given value is contained in
AbstractDouble2CharMap.values() . |
ObjectSortedSet<Double2CharMap.Entry> |
double2CharEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
double |
firstDoubleKey() |
char |
get(double k)
Returns the value to which the given key is mapped.
|
Double2CharSortedMap |
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() |
char |
put(double k,
char v)
Adds a pair to the map.
|
java.lang.Character |
put(java.lang.Double ok,
java.lang.Character ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
char |
remove(double k)
Removes the mapping with the given key.
|
java.lang.Character |
remove(java.lang.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.
|
Double2CharSortedMap |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Double2CharSortedMap |
tailMap(double from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
CharCollection |
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
public Double2CharRBTreeMap()
public Double2CharRBTreeMap(java.util.Comparator<? super java.lang.Double> c)
c
- a (possibly type-specific) comparator.public Double2CharRBTreeMap(java.util.Map<? extends java.lang.Double,? extends java.lang.Character> m)
m
- a Map
to be copied into the new tree map.public Double2CharRBTreeMap(java.util.SortedMap<java.lang.Double,java.lang.Character> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Double2CharRBTreeMap(Double2CharMap m)
m
- a type-specific map to be copied into the new tree map.public Double2CharRBTreeMap(Double2CharSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Double2CharRBTreeMap(double[] k, char[] v, java.util.Comparator<? super java.lang.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.java.lang.IllegalArgumentException
- if k
and v
have different lengths.public Double2CharRBTreeMap(double[] k, char[] 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 char put(double k, char v)
Double2CharFunction
put
in interface Double2CharFunction
put
in class AbstractDouble2CharFunction
k
- the key.v
- the value.Function.put(Object,Object)
public char remove(double k)
Double2CharFunction
remove
in interface Double2CharFunction
remove
in class AbstractDouble2CharFunction
k
- the key.Function.remove(Object)
public java.lang.Character put(java.lang.Double ok, java.lang.Character ov)
AbstractDouble2CharFunction
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.
put
in interface Function<java.lang.Double,java.lang.Character>
put
in interface java.util.Map<java.lang.Double,java.lang.Character>
put
in class AbstractDouble2CharFunction
ok
- the key.ov
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public java.lang.Character remove(java.lang.Object ok)
AbstractDouble2CharFunction
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.
remove
in interface Function<java.lang.Double,java.lang.Character>
remove
in interface java.util.Map<java.lang.Double,java.lang.Character>
remove
in class AbstractDouble2CharFunction
ok
- the key.null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(char v)
AbstractDouble2CharMap
AbstractDouble2CharMap.values()
.containsValue
in interface Double2CharMap
containsValue
in class AbstractDouble2CharMap
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<java.lang.Double,java.lang.Character>
clear
in interface java.util.Map<java.lang.Double,java.lang.Character>
clear
in class AbstractDouble2CharFunction
Map.clear()
public boolean containsKey(double k)
AbstractDouble2CharMap
AbstractDouble2CharMap.keySet()
.containsKey
in interface Double2CharFunction
containsKey
in class AbstractDouble2CharMap
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()
isEmpty
in interface java.util.Map<java.lang.Double,java.lang.Character>
isEmpty
in class AbstractDouble2CharMap
public char get(double k)
Double2CharFunction
get
in interface Double2CharFunction
k
- the key.Function.get(Object)
public double firstDoubleKey()
firstDoubleKey
in interface Double2CharSortedMap
SortedMap.firstKey()
public double lastDoubleKey()
lastDoubleKey
in interface Double2CharSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Double2CharMap.Entry> double2CharEntrySet()
Double2CharSortedMap
double2CharEntrySet
in interface Double2CharMap
double2CharEntrySet
in interface Double2CharSortedMap
Double2CharSortedMap.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 Double2CharMap
keySet
in interface Double2CharSortedMap
keySet
in interface java.util.Map<java.lang.Double,java.lang.Character>
keySet
in interface java.util.SortedMap<java.lang.Double,java.lang.Character>
keySet
in class AbstractDouble2CharSortedMap
Map.keySet()
public CharCollection 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 Double2CharMap
values
in interface Double2CharSortedMap
values
in interface java.util.Map<java.lang.Double,java.lang.Character>
values
in interface java.util.SortedMap<java.lang.Double,java.lang.Character>
values
in class AbstractDouble2CharSortedMap
Map.values()
public DoubleComparator comparator()
Double2CharSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Double2CharSortedMap
comparator
in interface java.util.SortedMap<java.lang.Double,java.lang.Character>
SortedMap.comparator()
public Double2CharSortedMap headMap(double to)
Double2CharSortedMap
toKey
.headMap
in interface Double2CharSortedMap
SortedMap.headMap(Object)
public Double2CharSortedMap tailMap(double from)
Double2CharSortedMap
fromKey
.tailMap
in interface Double2CharSortedMap
SortedMap.tailMap(Object)
public Double2CharSortedMap subMap(double from, double to)
Double2CharSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Double2CharSortedMap
SortedMap.subMap(Object,Object)
public Double2CharRBTreeMap 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