public class Short2CharRBTreeMap extends AbstractShort2CharSortedMap 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.
AbstractShort2CharMap.BasicEntryShort2CharSortedMap.FastSortedEntrySetShort2CharMap.FastEntrySet| Constructor and Description |
|---|
Short2CharRBTreeMap()
Creates a new empty tree map.
|
Short2CharRBTreeMap(Comparator<? super Short> c)
Creates a new empty tree map with the given comparator.
|
Short2CharRBTreeMap(Map<? extends Short,? extends Character> m)
Creates a new tree map copying a given map.
|
Short2CharRBTreeMap(short[] k,
char[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Short2CharRBTreeMap(short[] k,
char[] v,
Comparator<? super Short> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Short2CharRBTreeMap(Short2CharMap m)
Creates a new tree map copying a given map.
|
Short2CharRBTreeMap(Short2CharSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Short2CharRBTreeMap(SortedMap<Short,Character> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
char |
addTo(short 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).
|
Short2CharRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
ShortComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
boolean |
containsKey(short 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. |
short |
firstShortKey()
Returns the first (lowest) key currently in this map.
|
char |
get(short k)
Returns the value to which the given key is mapped.
|
Short2CharSortedMap |
headMap(short to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
boolean |
isEmpty()
Returns true if this map contains no key-value mappings.
|
ShortSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this
map.
|
short |
lastShortKey()
Returns the last (highest) key currently in this map.
|
char |
put(short k,
char v)
Adds a pair to the map (optional operation).
|
char |
remove(short k)
Removes the mapping with the given key (optional operation).
|
ObjectSortedSet<Short2CharMap.Entry> |
short2CharEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
int |
size()
Returns the number of key-value mappings in this map.
|
Short2CharSortedMap |
subMap(short from,
short to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Short2CharSortedMap |
tailMap(short 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.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValueentrySet, firstKey, headMap, lastKey, subMap, tailMapcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsIntandThen, compose, identitypublic Short2CharRBTreeMap()
public Short2CharRBTreeMap(Comparator<? super Short> c)
c - a (possibly type-specific) comparator.public Short2CharRBTreeMap(Map<? extends Short,? extends Character> m)
m - a Map to be copied into the new tree map.public Short2CharRBTreeMap(SortedMap<Short,Character> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Short2CharRBTreeMap(Short2CharMap m)
m - a type-specific map to be copied into the new tree map.public Short2CharRBTreeMap(Short2CharSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Short2CharRBTreeMap(short[] k,
char[] v,
Comparator<? super Short> 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 Short2CharRBTreeMap(short[] 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(short 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(short k,
char v)
Short2CharFunctionput in interface Short2CharFunctionk - the key.v - the value.Function.put(Object,Object)public char remove(short k)
Short2CharFunctionremove in interface Short2CharFunctionk - the key.Function.remove(Object)public boolean containsValue(char v)
Short2CharMaptrue if this map maps one or more keys to the specified
value.containsValue in interface Short2CharMapcontainsValue in class AbstractShort2CharMapMap.containsValue(Object)public void clear()
java.util.Mapclear in interface Short2CharMapclear in interface Map<Short,Character>Map.clear()public boolean containsKey(short k)
Short2CharMapcontainsKey in interface Short2CharFunctioncontainsKey in interface Short2CharMapcontainsKey in class AbstractShort2CharMapk - the key.key.Map.containsKey(Object)public int size()
java.util.Mappublic boolean isEmpty()
java.util.Mappublic char get(short k)
Short2CharFunctionget in interface Short2CharFunctionk - the key.Function.get(Object)public short firstShortKey()
Short2CharSortedMapfirstShortKey in interface Short2CharSortedMapSortedMap.firstKey()public short lastShortKey()
Short2CharSortedMaplastShortKey in interface Short2CharSortedMapSortedMap.lastKey()public ObjectSortedSet<Short2CharMap.Entry> short2CharEntrySet()
Short2CharSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
short2CharEntrySet in interface Short2CharMapshort2CharEntrySet in interface Short2CharSortedMapShort2CharSortedMap.entrySet()public ShortSortedSet 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 Short2CharMapkeySet in interface Short2CharSortedMapkeySet in interface Map<Short,Character>keySet in interface SortedMap<Short,Character>keySet in class AbstractShort2CharSortedMapMap.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 Short2CharMapvalues in interface Short2CharSortedMapvalues in interface Map<Short,Character>values in interface SortedMap<Short,Character>values in class AbstractShort2CharSortedMapMap.values()public ShortComparator comparator()
Short2CharSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Short2CharSortedMapcomparator in interface SortedMap<Short,Character>null if this map uses the natural ordering
of its keysSortedMap.comparator()public Short2CharSortedMap headMap(short to)
Short2CharSortedMaptoKey.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
headMap in interface Short2CharSortedMapSortedMap.headMap(Object)public Short2CharSortedMap tailMap(short from)
Short2CharSortedMapfromKey.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).
tailMap in interface Short2CharSortedMapSortedMap.tailMap(Object)public Short2CharSortedMap subMap(short from, short to)
Short2CharSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
subMap in interface Short2CharSortedMapSortedMap.subMap(Object,Object)public Short2CharRBTreeMap 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.