public class Double2CharRBTreeMap extends AbstractDouble2CharSortedMap 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.
AbstractDouble2CharMap.BasicEntryDouble2CharSortedMap.FastSortedEntrySetDouble2CharMap.FastEntrySet| Constructor and Description |
|---|
Double2CharRBTreeMap()
Creates a new empty tree map.
|
Double2CharRBTreeMap(Comparator<? super 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,
Comparator<? super 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(Map<? extends Double,? extends Character> m)
Creates a new tree map copying a given map.
|
Double2CharRBTreeMap(SortedMap<Double,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.
|
Character |
put(Double ok,
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.
|
Character |
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.
|
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, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Double2CharRBTreeMap()
public Double2CharRBTreeMap(Comparator<? super Double> c)
c - a (possibly type-specific) comparator.public Double2CharRBTreeMap(Map<? extends Double,? extends Character> m)
m - a Map to be copied into the new tree map.public Double2CharRBTreeMap(SortedMap<Double,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,
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 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.IllegalArgumentException - if k and v have different lengths.public char put(double k,
char v)
Double2CharFunctionput in interface Double2CharFunctionput in class AbstractDouble2CharFunctionk - the key.v - the value.Function.put(Object,Object)public char remove(double k)
Double2CharFunctionremove in interface Double2CharFunctionremove in class AbstractDouble2CharFunctionk - the key.Function.remove(Object)public Character put(Double ok, Character ov)
AbstractDouble2CharFunctionnull 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<Double,Character>put in interface Map<Double,Character>put in class AbstractDouble2CharFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public Character remove(Object ok)
AbstractDouble2CharFunctionnull 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<Double,Character>remove in interface Map<Double,Character>remove in class AbstractDouble2CharFunctionok - the key.null if no value was present for the given key.Map.remove(Object)public boolean containsValue(char v)
AbstractDouble2CharMapAbstractDouble2CharMap.values().containsValue in interface Double2CharMapcontainsValue in class AbstractDouble2CharMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(double k)
AbstractDouble2CharMapAbstractDouble2CharMap.keySet().containsKey in interface Double2CharFunctioncontainsKey in class AbstractDouble2CharMapFunction.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 char get(double k)
Double2CharFunctionget in interface Double2CharFunctionk - the key.Function.get(Object)public double firstDoubleKey()
firstDoubleKey in interface Double2CharSortedMapSortedMap.firstKey()public double lastDoubleKey()
lastDoubleKey in interface Double2CharSortedMapSortedMap.lastKey()public ObjectSortedSet<Double2CharMap.Entry> double2CharEntrySet()
Double2CharSortedMapdouble2CharEntrySet in interface Double2CharMapdouble2CharEntrySet in interface Double2CharSortedMapDouble2CharSortedMap.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 Double2CharMapkeySet in interface Double2CharSortedMapkeySet in interface Map<Double,Character>keySet in interface SortedMap<Double,Character>keySet in class AbstractDouble2CharSortedMapMap.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 Double2CharMapvalues in interface Double2CharSortedMapvalues in interface Map<Double,Character>values in interface SortedMap<Double,Character>values in class AbstractDouble2CharSortedMapMap.values()public DoubleComparator comparator()
Double2CharSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Double2CharSortedMapcomparator in interface SortedMap<Double,Character>SortedMap.comparator()public Double2CharSortedMap headMap(double to)
Double2CharSortedMaptoKey.headMap in interface Double2CharSortedMapSortedMap.headMap(Object)public Double2CharSortedMap tailMap(double from)
Double2CharSortedMapfromKey.tailMap in interface Double2CharSortedMapSortedMap.tailMap(Object)public Double2CharSortedMap subMap(double from, double to)
Double2CharSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Double2CharSortedMapSortedMap.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.