public class Char2DoubleRBTreeMap extends AbstractChar2DoubleSortedMap 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.
AbstractChar2DoubleMap.BasicEntryChar2DoubleSortedMap.FastSortedEntrySetChar2DoubleMap.FastEntrySet| Constructor and Description |
|---|
Char2DoubleRBTreeMap()
Creates a new empty tree map.
|
Char2DoubleRBTreeMap(char[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2DoubleRBTreeMap(char[] k,
double[] v,
Comparator<? super Character> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Char2DoubleRBTreeMap(Char2DoubleMap m)
Creates a new tree map copying a given map.
|
Char2DoubleRBTreeMap(Char2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Char2DoubleRBTreeMap(Comparator<? super Character> c)
Creates a new empty tree map with the given comparator.
|
Char2DoubleRBTreeMap(Map<? extends Character,? extends Double> m)
Creates a new tree map copying a given map.
|
Char2DoubleRBTreeMap(SortedMap<Character,Double> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Char2DoubleMap.Entry> |
char2DoubleEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Char2DoubleRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
CharComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(char k)
Checks whether the given value is contained in
AbstractChar2DoubleMap.keySet(). |
boolean |
containsValue(double v)
Checks whether the given value is contained in
AbstractChar2DoubleMap.values(). |
char |
firstCharKey() |
double |
get(char k)
Returns the value to which the given key is mapped.
|
Char2DoubleSortedMap |
headMap(char to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
CharSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
char |
lastCharKey() |
Double |
put(Character ok,
Double ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
double |
put(char k,
double v)
Adds a pair to the map.
|
double |
remove(char 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.
|
Char2DoubleSortedMap |
subMap(char from,
char to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Char2DoubleSortedMap |
tailMap(char 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 Char2DoubleRBTreeMap()
public Char2DoubleRBTreeMap(Comparator<? super Character> c)
c - a (possibly type-specific) comparator.public Char2DoubleRBTreeMap(Map<? extends Character,? extends Double> m)
m - a Map to be copied into the new tree map.public Char2DoubleRBTreeMap(SortedMap<Character,Double> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Char2DoubleRBTreeMap(Char2DoubleMap m)
m - a type-specific map to be copied into the new tree map.public Char2DoubleRBTreeMap(Char2DoubleSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Char2DoubleRBTreeMap(char[] k,
double[] v,
Comparator<? super Character> 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 Char2DoubleRBTreeMap(char[] 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(char k,
double v)
Char2DoubleFunctionput in interface Char2DoubleFunctionput in class AbstractChar2DoubleFunctionk - the key.v - the value.Function.put(Object,Object)public double remove(char k)
Char2DoubleFunctionremove in interface Char2DoubleFunctionremove in class AbstractChar2DoubleFunctionFunction.remove(Object)public Double put(Character ok, Double ov)
AbstractChar2DoubleFunctionnull 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<Character,Double>put in interface Map<Character,Double>put in class AbstractChar2DoubleFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public Double remove(Object ok)
AbstractChar2DoubleFunctionnull 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)
AbstractChar2DoubleMapAbstractChar2DoubleMap.values().containsValue in interface Char2DoubleMapcontainsValue in class AbstractChar2DoubleMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(char k)
AbstractChar2DoubleMapAbstractChar2DoubleMap.keySet().containsKey in interface Char2DoubleFunctioncontainsKey in class AbstractChar2DoubleMapFunction.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(char k)
Char2DoubleFunctionget in interface Char2DoubleFunctionk - the key.Function.get(Object)public char firstCharKey()
firstCharKey in interface Char2DoubleSortedMapSortedMap.firstKey()public char lastCharKey()
lastCharKey in interface Char2DoubleSortedMapSortedMap.lastKey()public ObjectSortedSet<Char2DoubleMap.Entry> char2DoubleEntrySet()
Char2DoubleSortedMapchar2DoubleEntrySet in interface Char2DoubleMapchar2DoubleEntrySet in interface Char2DoubleSortedMapChar2DoubleSortedMap.entrySet()public CharSortedSet 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 Char2DoubleMapkeySet in interface Char2DoubleSortedMapkeySet in interface Map<Character,Double>keySet in interface SortedMap<Character,Double>keySet in class AbstractChar2DoubleSortedMapMap.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 Char2DoubleMapvalues in interface Char2DoubleSortedMapvalues in interface Map<Character,Double>values in interface SortedMap<Character,Double>values in class AbstractChar2DoubleSortedMapMap.values()public CharComparator comparator()
Char2DoubleSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Char2DoubleSortedMapcomparator in interface SortedMap<Character,Double>SortedMap.comparator()public Char2DoubleSortedMap headMap(char to)
Char2DoubleSortedMaptoKey.headMap in interface Char2DoubleSortedMapSortedMap.headMap(Object)public Char2DoubleSortedMap tailMap(char from)
Char2DoubleSortedMapfromKey.tailMap in interface Char2DoubleSortedMapSortedMap.tailMap(Object)public Char2DoubleSortedMap subMap(char from, char to)
Char2DoubleSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Char2DoubleSortedMapSortedMap.subMap(Object,Object)public Char2DoubleRBTreeMap 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.