public class Char2DoubleAVLTreeMap extends AbstractChar2DoubleSortedMap 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.
AbstractChar2DoubleMap.BasicEntryChar2DoubleSortedMap.FastSortedEntrySetChar2DoubleMap.FastEntrySet| Constructor and Description |
|---|
Char2DoubleAVLTreeMap()
Creates a new empty tree map.
|
Char2DoubleAVLTreeMap(char[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2DoubleAVLTreeMap(char[] k,
double[] v,
java.util.Comparator<? super java.lang.Character> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Char2DoubleAVLTreeMap(Char2DoubleMap m)
Creates a new tree map copying a given map.
|
Char2DoubleAVLTreeMap(Char2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Char2DoubleAVLTreeMap(java.util.Comparator<? super java.lang.Character> c)
Creates a new empty tree map with the given comparator.
|
Char2DoubleAVLTreeMap(java.util.Map<? extends java.lang.Character,? extends java.lang.Double> m)
Creates a new tree map copying a given map.
|
Char2DoubleAVLTreeMap(java.util.SortedMap<java.lang.Character,java.lang.Double> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
double |
addTo(char k,
double incr)
Adds an increment to value currently associated with a key.
|
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).
|
Char2DoubleAVLTreeMap |
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() |
java.lang.Double |
put(java.lang.Character ok,
java.lang.Double ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
double |
put(char k,
double v)
Adds a pair to the map.
|
double |
remove(char k)
Removes the mapping with the given key.
|
java.lang.Double |
remove(java.lang.Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
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, getpublic Char2DoubleAVLTreeMap()
public Char2DoubleAVLTreeMap(java.util.Comparator<? super java.lang.Character> c)
c - a (possibly type-specific) comparator.public Char2DoubleAVLTreeMap(java.util.Map<? extends java.lang.Character,? extends java.lang.Double> m)
m - a Map to be copied into the new tree map.public Char2DoubleAVLTreeMap(java.util.SortedMap<java.lang.Character,java.lang.Double> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Char2DoubleAVLTreeMap(Char2DoubleMap m)
m - a type-specific map to be copied into the new tree map.public Char2DoubleAVLTreeMap(Char2DoubleSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Char2DoubleAVLTreeMap(char[] k,
double[] v,
java.util.Comparator<? super java.lang.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.java.lang.IllegalArgumentException - if k and v have different lengths.public Char2DoubleAVLTreeMap(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.java.lang.IllegalArgumentException - if k and v have different lengths.public double addTo(char k,
double incr)
Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
k - the key.incr - the increment.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 AbstractChar2DoubleFunctionk - the key.Function.remove(Object)@Deprecated
public java.lang.Double put(java.lang.Character ok,
java.lang.Double ov)
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.Character,java.lang.Double>put in interface java.util.Map<java.lang.Character,java.lang.Double>put in class AbstractChar2DoubleFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public java.lang.Double remove(java.lang.Object ok)
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.Character,java.lang.Double>remove in interface java.util.Map<java.lang.Character,java.lang.Double>remove in class AbstractChar2DoubleFunctionok - the key.null if no value was present for the given key.Map.remove(Object)public boolean containsValue(double v)
AbstractChar2DoubleMapAbstractChar2DoubleMap.values().containsValue in interface Char2DoubleMapcontainsValue in class AbstractChar2DoubleMapMap.containsValue(Object)public void clear()
Functionclear in interface Function<java.lang.Character,java.lang.Double>clear in interface java.util.Map<java.lang.Character,java.lang.Double>clear in class AbstractChar2DoubleFunctionMap.clear()public 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()
isEmpty in interface java.util.Map<java.lang.Character,java.lang.Double>isEmpty in class AbstractChar2DoubleMappublic 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 java.util.Map<java.lang.Character,java.lang.Double>keySet in interface java.util.SortedMap<java.lang.Character,java.lang.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 java.util.Map<java.lang.Character,java.lang.Double>values in interface java.util.SortedMap<java.lang.Character,java.lang.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 java.util.SortedMap<java.lang.Character,java.lang.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 Char2DoubleAVLTreeMap 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