public class Char2CharAVLTreeMap extends AbstractChar2CharSortedMap 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.
AbstractChar2CharMap.BasicEntryChar2CharSortedMap.FastSortedEntrySetChar2CharMap.FastEntrySet| Constructor and Description |
|---|
Char2CharAVLTreeMap()
Creates a new empty tree map.
|
Char2CharAVLTreeMap(char[] k,
char[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2CharAVLTreeMap(char[] k,
char[] 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.
|
Char2CharAVLTreeMap(Char2CharMap m)
Creates a new tree map copying a given map.
|
Char2CharAVLTreeMap(Char2CharSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Char2CharAVLTreeMap(java.util.Comparator<? super java.lang.Character> c)
Creates a new empty tree map with the given comparator.
|
Char2CharAVLTreeMap(java.util.Map<? extends java.lang.Character,? extends java.lang.Character> m)
Creates a new tree map copying a given map.
|
Char2CharAVLTreeMap(java.util.SortedMap<java.lang.Character,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(char k,
char incr)
Adds an increment to value currently associated with a key.
|
ObjectSortedSet<Char2CharMap.Entry> |
char2CharEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Char2CharAVLTreeMap |
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
AbstractChar2CharMap.keySet(). |
boolean |
containsValue(char v)
Checks whether the given value is contained in
AbstractChar2CharMap.values(). |
char |
firstCharKey() |
char |
get(char k)
Returns the value to which the given key is mapped.
|
Char2CharSortedMap |
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.Character |
put(java.lang.Character ok,
java.lang.Character ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
char |
put(char k,
char v)
Adds a pair to the map.
|
char |
remove(char 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.
|
Char2CharSortedMap |
subMap(char from,
char to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Char2CharSortedMap |
tailMap(char 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 Char2CharAVLTreeMap()
public Char2CharAVLTreeMap(java.util.Comparator<? super java.lang.Character> c)
c - a (possibly type-specific) comparator.public Char2CharAVLTreeMap(java.util.Map<? extends java.lang.Character,? extends java.lang.Character> m)
m - a Map to be copied into the new tree map.public Char2CharAVLTreeMap(java.util.SortedMap<java.lang.Character,java.lang.Character> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Char2CharAVLTreeMap(Char2CharMap m)
m - a type-specific map to be copied into the new tree map.public Char2CharAVLTreeMap(Char2CharSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Char2CharAVLTreeMap(char[] k,
char[] 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 Char2CharAVLTreeMap(char[] 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(char 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(char k,
char v)
Char2CharFunctionput in interface Char2CharFunctionput in class AbstractChar2CharFunctionk - the key.v - the value.Function.put(Object,Object)public char remove(char k)
Char2CharFunctionremove in interface Char2CharFunctionremove in class AbstractChar2CharFunctionk - the key.Function.remove(Object)@Deprecated
public java.lang.Character put(java.lang.Character 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.Character,java.lang.Character>put in interface java.util.Map<java.lang.Character,java.lang.Character>put in class AbstractChar2CharFunctionok - 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.Character,java.lang.Character>remove in interface java.util.Map<java.lang.Character,java.lang.Character>remove in class AbstractChar2CharFunctionok - the key.null if no value was present for the given key.Map.remove(Object)public boolean containsValue(char v)
AbstractChar2CharMapAbstractChar2CharMap.values().containsValue in interface Char2CharMapcontainsValue in class AbstractChar2CharMapMap.containsValue(Object)public void clear()
Functionclear in interface Function<java.lang.Character,java.lang.Character>clear in interface java.util.Map<java.lang.Character,java.lang.Character>clear in class AbstractChar2CharFunctionMap.clear()public boolean containsKey(char k)
AbstractChar2CharMapAbstractChar2CharMap.keySet().containsKey in interface Char2CharFunctioncontainsKey in class AbstractChar2CharMapFunction.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.Character>isEmpty in class AbstractChar2CharMappublic char get(char k)
Char2CharFunctionget in interface Char2CharFunctionk - the key.Function.get(Object)public char firstCharKey()
firstCharKey in interface Char2CharSortedMapSortedMap.firstKey()public char lastCharKey()
lastCharKey in interface Char2CharSortedMapSortedMap.lastKey()public ObjectSortedSet<Char2CharMap.Entry> char2CharEntrySet()
Char2CharSortedMapchar2CharEntrySet in interface Char2CharMapchar2CharEntrySet in interface Char2CharSortedMapChar2CharSortedMap.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 Char2CharMapkeySet in interface Char2CharSortedMapkeySet in interface java.util.Map<java.lang.Character,java.lang.Character>keySet in interface java.util.SortedMap<java.lang.Character,java.lang.Character>keySet in class AbstractChar2CharSortedMapMap.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 Char2CharMapvalues in interface Char2CharSortedMapvalues in interface java.util.Map<java.lang.Character,java.lang.Character>values in interface java.util.SortedMap<java.lang.Character,java.lang.Character>values in class AbstractChar2CharSortedMapMap.values()public CharComparator comparator()
Char2CharSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Char2CharSortedMapcomparator in interface java.util.SortedMap<java.lang.Character,java.lang.Character>SortedMap.comparator()public Char2CharSortedMap headMap(char to)
Char2CharSortedMaptoKey.headMap in interface Char2CharSortedMapSortedMap.headMap(Object)public Char2CharSortedMap tailMap(char from)
Char2CharSortedMapfromKey.tailMap in interface Char2CharSortedMapSortedMap.tailMap(Object)public Char2CharSortedMap subMap(char from, char to)
Char2CharSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Char2CharSortedMapSortedMap.subMap(Object,Object)public Char2CharAVLTreeMap 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