public class Double2CharAVLTreeMap 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.BasicEntryDouble2CharSortedMap.FastSortedEntrySetDouble2CharMap.FastEntrySet| Constructor and Description |
|---|
Double2CharAVLTreeMap()
Creates a new empty tree map.
|
Double2CharAVLTreeMap(java.util.Comparator<? super java.lang.Double> c)
Creates a new empty tree map with the given comparator.
|
Double2CharAVLTreeMap(double[] k,
char[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Double2CharAVLTreeMap(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.
|
Double2CharAVLTreeMap(Double2CharMap m)
Creates a new tree map copying a given map.
|
Double2CharAVLTreeMap(Double2CharSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Double2CharAVLTreeMap(java.util.Map<? extends java.lang.Double,? extends java.lang.Character> m)
Creates a new tree map copying a given map.
|
Double2CharAVLTreeMap(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 |
|---|---|
char |
addTo(double k,
char incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Double2CharAVLTreeMap |
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)
Deprecated.
Please use the corresponding type-specific method instead.
|
char |
remove(double k)
Removes the mapping with the given key.
|
java.lang.Character |
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.
|
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, getpublic Double2CharAVLTreeMap()
public Double2CharAVLTreeMap(java.util.Comparator<? super java.lang.Double> c)
c - a (possibly type-specific) comparator.public Double2CharAVLTreeMap(java.util.Map<? extends java.lang.Double,? extends java.lang.Character> m)
m - a Map to be copied into the new tree map.public Double2CharAVLTreeMap(java.util.SortedMap<java.lang.Double,java.lang.Character> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Double2CharAVLTreeMap(Double2CharMap m)
m - a type-specific map to be copied into the new tree map.public Double2CharAVLTreeMap(Double2CharSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Double2CharAVLTreeMap(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 Double2CharAVLTreeMap(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 addTo(double k,
char 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 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)@Deprecated
public java.lang.Character put(java.lang.Double ok,
java.lang.Character 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.Double,java.lang.Character>put in interface java.util.Map<java.lang.Double,java.lang.Character>put in class AbstractDouble2CharFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public java.lang.Character 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.Double,java.lang.Character>remove in interface java.util.Map<java.lang.Double,java.lang.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()
Functionclear in interface Function<java.lang.Double,java.lang.Character>clear in interface java.util.Map<java.lang.Double,java.lang.Character>clear in class AbstractDouble2CharFunctionMap.clear()public 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()
isEmpty in interface java.util.Map<java.lang.Double,java.lang.Character>isEmpty in class AbstractDouble2CharMappublic 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 java.util.Map<java.lang.Double,java.lang.Character>keySet in interface java.util.SortedMap<java.lang.Double,java.lang.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 java.util.Map<java.lang.Double,java.lang.Character>values in interface java.util.SortedMap<java.lang.Double,java.lang.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 java.util.SortedMap<java.lang.Double,java.lang.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 Double2CharAVLTreeMap 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