public class Long2CharRBTreeMap extends AbstractLong2CharSortedMap 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.
AbstractLong2CharMap.BasicEntryLong2CharSortedMap.FastSortedEntrySetLong2CharMap.FastEntrySet| Constructor and Description |
|---|
Long2CharRBTreeMap()
Creates a new empty tree map.
|
Long2CharRBTreeMap(Comparator<? super Long> c)
Creates a new empty tree map with the given comparator.
|
Long2CharRBTreeMap(long[] k,
char[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Long2CharRBTreeMap(long[] k,
char[] v,
Comparator<? super Long> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Long2CharRBTreeMap(Long2CharMap m)
Creates a new tree map copying a given map.
|
Long2CharRBTreeMap(Long2CharSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Long2CharRBTreeMap(Map<? extends Long,? extends Character> m)
Creates a new tree map copying a given map.
|
Long2CharRBTreeMap(SortedMap<Long,Character> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
char |
addTo(long 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).
|
Long2CharRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
LongComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
boolean |
containsKey(long 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. |
long |
firstLongKey()
Returns the first (lowest) key currently in this map.
|
char |
get(long k)
Returns the value to which the given key is mapped.
|
Long2CharSortedMap |
headMap(long 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.
|
LongSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this
map.
|
long |
lastLongKey()
Returns the last (highest) key currently in this map.
|
ObjectSortedSet<Long2CharMap.Entry> |
long2CharEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
char |
put(long k,
char v)
Adds a pair to the map (optional operation).
|
char |
remove(long k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Long2CharSortedMap |
subMap(long from,
long to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Long2CharSortedMap |
tailMap(long 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, replaceapplyAsIntpublic Long2CharRBTreeMap()
public Long2CharRBTreeMap(Comparator<? super Long> c)
c - a (possibly type-specific) comparator.public Long2CharRBTreeMap(Map<? extends Long,? extends Character> m)
m - a Map to be copied into the new tree map.public Long2CharRBTreeMap(SortedMap<Long,Character> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Long2CharRBTreeMap(Long2CharMap m)
m - a type-specific map to be copied into the new tree map.public Long2CharRBTreeMap(Long2CharSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Long2CharRBTreeMap(long[] k,
char[] v,
Comparator<? super Long> 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 Long2CharRBTreeMap(long[] 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(long 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(long k,
char v)
Long2CharFunctionput in interface Long2CharFunctionk - the key.v - the value.Function.put(Object,Object)public char remove(long k)
Long2CharFunctionremove in interface Long2CharFunctionk - the key.Function.remove(Object)public boolean containsValue(char v)
Long2CharMaptrue if this map maps one or more keys to the specified
value.containsValue in interface Long2CharMapcontainsValue in class AbstractLong2CharMapMap.containsValue(Object)public void clear()
Long2CharMapclear in interface Long2CharMapclear in interface Map<Long,Character>Map.clear()public boolean containsKey(long k)
Long2CharMapcontainsKey in interface Long2CharFunctioncontainsKey in interface Long2CharMapcontainsKey in class AbstractLong2CharMapk - the key.key.Map.containsKey(Object)public int size()
Long2CharMapInteger.MAX_VALUE elements, returns
Integer.MAX_VALUE.public boolean isEmpty()
java.util.Mappublic char get(long k)
Long2CharFunctionget in interface Long2CharFunctionk - the key.Function.get(Object)public long firstLongKey()
Long2CharSortedMapfirstLongKey in interface Long2CharSortedMapSortedMap.firstKey()public long lastLongKey()
Long2CharSortedMaplastLongKey in interface Long2CharSortedMapSortedMap.lastKey()public ObjectSortedSet<Long2CharMap.Entry> long2CharEntrySet()
Long2CharSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
long2CharEntrySet in interface Long2CharMaplong2CharEntrySet in interface Long2CharSortedMapLong2CharSortedMap.entrySet()public LongSortedSet 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 Long2CharMapkeySet in interface Long2CharSortedMapkeySet in interface Map<Long,Character>keySet in interface SortedMap<Long,Character>keySet in class AbstractLong2CharSortedMapMap.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 Long2CharMapvalues in interface Long2CharSortedMapvalues in interface Map<Long,Character>values in interface SortedMap<Long,Character>values in class AbstractLong2CharSortedMapMap.values()public LongComparator comparator()
Long2CharSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Long2CharSortedMapcomparator in interface SortedMap<Long,Character>null if this map uses the natural ordering
of its keysSortedMap.comparator()public Long2CharSortedMap headMap(long to)
Long2CharSortedMaptoKey.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
headMap in interface Long2CharSortedMapSortedMap.headMap(Object)public Long2CharSortedMap tailMap(long from)
Long2CharSortedMapfromKey.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).
tailMap in interface Long2CharSortedMapSortedMap.tailMap(Object)public Long2CharSortedMap subMap(long from, long to)
Long2CharSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
subMap in interface Long2CharSortedMapSortedMap.subMap(Object,Object)public Long2CharRBTreeMap 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.