Function<K,java.lang.Character>, Object2CharFunction<K>, Object2CharMap<K>, Object2CharSortedMap<K>, java.io.Serializable, java.lang.Cloneable, java.util.function.Function<K,java.lang.Character>, java.util.function.ToIntFunction<K>, java.util.Map<K,java.lang.Character>, java.util.SortedMap<K,java.lang.Character>public class Object2CharRBTreeMap<K> extends AbstractObject2CharSortedMap<K> 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.
AbstractObject2CharMap.BasicEntry<K>, AbstractObject2CharMap.BasicEntrySet<K>Object2CharMap.FastEntrySet<K>Object2CharSortedMap.FastSortedEntrySet<K>| Constructor | Description |
|---|---|
Object2CharRBTreeMap() |
Creates a new empty tree 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(java.util.Comparator<? super K> c) |
Creates a new empty tree map with the given comparator.
|
Object2CharRBTreeMap(java.util.Map<? extends K,? extends java.lang.Character> m) |
Creates a new tree map copying a given map.
|
Object2CharRBTreeMap(java.util.SortedMap<K,java.lang.Character> m) |
Creates a new tree map copying a given sorted map (and its
Comparator). |
Object2CharRBTreeMap(K[] k,
char[] v) |
Creates a new tree map using the elements of two parallel arrays.
|
Object2CharRBTreeMap(K[] k,
char[] v,
java.util.Comparator<? super K> c) |
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
| Modifier and Type | Method | Description |
|---|---|---|
char |
addTo(K k,
char incr) |
Adds an increment to value currently associated with a key.
|
void |
clear() |
Removes all of the mappings from this map (optional operation).
|
Object2CharRBTreeMap<K> |
clone() |
Returns a deep copy of this tree map.
|
java.util.Comparator<? super K> |
comparator() |
Returns the comparator associated with this sorted set, or null if it uses
its keys' natural ordering.
|
boolean |
containsKey(java.lang.Object k) |
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(char v) |
Returns
true if this map maps one or more keys to the specified
value. |
K |
firstKey() |
|
char |
getChar(java.lang.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 (optional operation).
|
char |
removeChar(java.lang.Object k) |
Removes the mapping with the given key (optional operation).
|
int |
size() |
Returns the number of key/value mappings in this map.
|
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.
|
defaultReturnValue, defaultReturnValueequals, hashCode, putAll, toStringcompute, computeIfAbsent, computeIfPresent, equals, forEach, hashCode, putAll, replaceAllapplyAsIntcomputeChar, computeCharIfAbsent, computeCharIfAbsentPartial, computeCharIfPresent, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, mergeChar, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceentrySetpublic Object2CharRBTreeMap()
public Object2CharRBTreeMap(java.util.Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2CharRBTreeMap(java.util.Map<? extends K,? extends java.lang.Character> m)
m - a Map to be copied into the new tree map.public Object2CharRBTreeMap(java.util.SortedMap<K,java.lang.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, java.util.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.java.lang.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.java.lang.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>k - the key.v - the value.Function.put(Object,Object)public char removeChar(java.lang.Object k)
Object2CharFunctionremoveChar in interface Object2CharFunction<K>k - the key.Function.remove(Object)public boolean containsValue(char v)
Object2CharMaptrue if this map maps one or more keys to the specified
value.containsValue in interface Object2CharMap<K>containsValue in class AbstractObject2CharMap<K>Map.containsValue(Object)public void clear()
Object2CharMappublic boolean containsKey(java.lang.Object k)
Object2CharMapcontainsKey in interface Function<K,java.lang.Character>containsKey in interface java.util.Map<K,java.lang.Character>containsKey in interface Object2CharMap<K>containsKey in class AbstractObject2CharMap<K>k - the key.key.Map.containsKey(Object)public int size()
Object2CharMapInteger.MAX_VALUE elements, returns
Integer.MAX_VALUE.public boolean isEmpty()
isEmpty in interface java.util.Map<K,java.lang.Character>isEmpty in class AbstractObject2CharMap<K>public char getChar(java.lang.Object k)
Object2CharFunctiongetChar in interface Object2CharFunction<K>k - the key.Function.get(Object)public K firstKey()
firstKey in interface java.util.SortedMap<K,java.lang.Character>public K lastKey()
lastKey in interface java.util.SortedMap<K,java.lang.Character>public ObjectSortedSet<Object2CharMap.Entry<K>> object2CharEntrySet()
Object2CharSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
object2CharEntrySet 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 java.util.Map<K,java.lang.Character>keySet in interface Object2CharMap<K>keySet in interface Object2CharSortedMap<K>keySet in interface java.util.SortedMap<K,java.lang.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 java.util.Map<K,java.lang.Character>values in interface Object2CharMap<K>values in interface Object2CharSortedMap<K>values in interface java.util.SortedMap<K,java.lang.Character>values in class AbstractObject2CharSortedMap<K>Map.values()public java.util.Comparator<? super K> comparator()
Object2CharSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Object2CharSortedMap<K>comparator in interface java.util.SortedMap<K,java.lang.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 java.util.SortedMap<K,java.lang.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 java.util.SortedMap<K,java.lang.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 java.util.SortedMap<K,java.lang.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.