public class Object2CharRBTreeMap<K> extends AbstractObject2CharSortedMap<K> 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.
AbstractObject2CharMap.BasicEntry<K>Object2CharSortedMap.FastSortedEntrySet<K>Object2CharMap.FastEntrySet<K>| Constructor and Description |
|---|
Object2CharRBTreeMap()
Creates a new empty tree map.
|
Object2CharRBTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator.
|
Object2CharRBTreeMap(K[] k,
char[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Object2CharRBTreeMap(K[] k,
char[] v,
Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Object2CharRBTreeMap(Map<? extends K,? extends Character> m)
Creates a new tree map copying a given map.
|
Object2CharRBTreeMap(Object2CharMap<? extends K> m)
Creates a new tree map copying a given map.
|
Object2CharRBTreeMap(Object2CharSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Object2CharRBTreeMap(SortedMap<K,Character> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
char |
addTo(K k,
char incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Object2CharRBTreeMap<K> |
clone()
Returns a deep copy of this tree map.
|
Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in
AbstractObject2CharMap.keySet(). |
boolean |
containsValue(char v)
Checks whether the given value is contained in
AbstractObject2CharMap.values(). |
K |
firstKey() |
Character |
get(Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
char |
getChar(Object k)
Returns the value to which the given key is mapped.
|
Object2CharSortedMap<K> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
boolean |
isEmpty() |
ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this
map.
|
K |
lastKey() |
ObjectSortedSet<Object2CharMap.Entry<K>> |
object2CharEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
char |
put(K k,
char v)
Adds a pair to the map.
|
Character |
put(K ok,
Character ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
Character |
remove(Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
char |
removeChar(Object k)
Removes the mapping with the given key.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Object2CharSortedMap<K> |
subMap(K from,
K to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Object2CharSortedMap<K> |
tailMap(K 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.
|
entrySetcontainsValue, equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuedefaultReturnValue, defaultReturnValuecompute, computeIfAbsent, computeIfPresent, containsValue, equals, forEach, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Object2CharRBTreeMap()
public Object2CharRBTreeMap(Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2CharRBTreeMap(Map<? extends K,? extends Character> m)
m - a Map to be copied into the new tree map.public Object2CharRBTreeMap(SortedMap<K,Character> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Object2CharRBTreeMap(Object2CharMap<? extends K> m)
m - a type-specific map to be copied into the new tree map.public Object2CharRBTreeMap(Object2CharSortedMap<K> m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Object2CharRBTreeMap(K[] k, char[] v, Comparator<? super K> 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 Object2CharRBTreeMap(K[] 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 addTo(K 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(K k, char v)
Object2CharFunctionput in interface Object2CharFunction<K>put in class AbstractObject2CharFunction<K>k - the key.v - the value.Function.put(Object,Object)public char removeChar(Object k)
Object2CharFunctionremoveChar in interface Object2CharFunction<K>removeChar in class AbstractObject2CharFunction<K>k - the key.Function.remove(Object)@Deprecated public Character put(K ok, 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<K,Character>put in interface Map<K,Character>put in class AbstractObject2CharFunction<K>ok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public Character remove(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.
public boolean containsValue(char v)
AbstractObject2CharMapAbstractObject2CharMap.values().containsValue in interface Object2CharMap<K>containsValue in class AbstractObject2CharMap<K>Map.containsValue(Object)public void clear()
Functionpublic boolean containsKey(Object k)
AbstractObject2CharMapAbstractObject2CharMap.keySet().containsKey in interface Function<K,Character>containsKey in interface Map<K,Character>containsKey in class AbstractObject2CharMap<K>k - the key.key.Map.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 getChar(Object k)
Object2CharFunctiongetChar in interface Object2CharFunction<K>k - the key.Function.get(Object)@Deprecated public Character get(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.
public ObjectSortedSet<Object2CharMap.Entry<K>> object2CharEntrySet()
Object2CharSortedMapobject2CharEntrySet in interface Object2CharMap<K>object2CharEntrySet in interface Object2CharSortedMap<K>Object2CharSortedMap.entrySet()public ObjectSortedSet<K> 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 Object2CharMap<K>keySet in interface Object2CharSortedMap<K>keySet in interface Map<K,Character>keySet in interface SortedMap<K,Character>keySet in class AbstractObject2CharSortedMap<K>Map.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 Object2CharMap<K>values in interface Object2CharSortedMap<K>values in interface Map<K,Character>values in interface SortedMap<K,Character>values in class AbstractObject2CharSortedMap<K>Map.values()public Comparator<? super K> comparator()
Object2CharSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Object2CharSortedMap<K>comparator in interface SortedMap<K,Character>SortedMap.comparator()public Object2CharSortedMap<K> headMap(K to)
Object2CharSortedMaptoKey.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
headMap in interface Object2CharSortedMap<K>headMap in interface SortedMap<K,Character>SortedMap.headMap(Object)public Object2CharSortedMap<K> tailMap(K from)
Object2CharSortedMapfromKey.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).
tailMap in interface Object2CharSortedMap<K>tailMap in interface SortedMap<K,Character>SortedMap.tailMap(Object)public Object2CharSortedMap<K> subMap(K from, K to)
Object2CharSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
subMap in interface Object2CharSortedMap<K>subMap in interface SortedMap<K,Character>SortedMap.subMap(Object,Object)public Object2CharRBTreeMap<K> 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.