public class Char2ByteAVLTreeMap extends AbstractChar2ByteSortedMap 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.
AbstractChar2ByteMap.BasicEntryChar2ByteSortedMap.FastSortedEntrySetChar2ByteMap.FastEntrySet| Constructor and Description |
|---|
Char2ByteAVLTreeMap()
Creates a new empty tree map.
|
Char2ByteAVLTreeMap(char[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2ByteAVLTreeMap(char[] k,
byte[] v,
Comparator<? super Character> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Char2ByteAVLTreeMap(Char2ByteMap m)
Creates a new tree map copying a given map.
|
Char2ByteAVLTreeMap(Char2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Char2ByteAVLTreeMap(Comparator<? super Character> c)
Creates a new empty tree map with the given comparator.
|
Char2ByteAVLTreeMap(Map<? extends Character,? extends Byte> m)
Creates a new tree map copying a given map.
|
Char2ByteAVLTreeMap(SortedMap<Character,Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
byte |
addTo(char k,
byte incr)
Adds an increment to value currently associated with a key.
|
ObjectSortedSet<Char2ByteMap.Entry> |
char2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Char2ByteAVLTreeMap |
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
AbstractChar2ByteMap.keySet(). |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractChar2ByteMap.values(). |
char |
firstCharKey() |
byte |
get(char k)
Returns the value to which the given key is mapped.
|
Char2ByteSortedMap |
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() |
Byte |
put(Character ok,
Byte ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
byte |
put(char k,
byte v)
Adds a pair to the map.
|
byte |
remove(char k)
Removes the mapping with the given key.
|
Byte |
remove(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.
|
Char2ByteSortedMap |
subMap(char from,
char to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Char2ByteSortedMap |
tailMap(char from)
Returns a view of the portion of this sorted map whose keys are greater
than or equal to
fromKey. |
ByteCollection |
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, getcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Char2ByteAVLTreeMap()
public Char2ByteAVLTreeMap(Comparator<? super Character> c)
c - a (possibly type-specific) comparator.public Char2ByteAVLTreeMap(Map<? extends Character,? extends Byte> m)
m - a Map to be copied into the new tree map.public Char2ByteAVLTreeMap(SortedMap<Character,Byte> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Char2ByteAVLTreeMap(Char2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Char2ByteAVLTreeMap(Char2ByteSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Char2ByteAVLTreeMap(char[] k,
byte[] v,
Comparator<? super 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.IllegalArgumentException - if k and v have different lengths.public Char2ByteAVLTreeMap(char[] k,
byte[] 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 byte addTo(char k,
byte 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 byte put(char k,
byte v)
Char2ByteFunctionput in interface Char2ByteFunctionput in class AbstractChar2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public byte remove(char k)
Char2ByteFunctionremove in interface Char2ByteFunctionremove in class AbstractChar2ByteFunctionk - the key.Function.remove(Object)@Deprecated public Byte put(Character ok, Byte 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<Character,Byte>put in interface Map<Character,Byte>put in class AbstractChar2ByteFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public Byte 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(byte v)
AbstractChar2ByteMapAbstractChar2ByteMap.values().containsValue in interface Char2ByteMapcontainsValue in class AbstractChar2ByteMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(char k)
AbstractChar2ByteMapAbstractChar2ByteMap.keySet().containsKey in interface Char2ByteFunctioncontainsKey in class AbstractChar2ByteMapFunction.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 byte get(char k)
Char2ByteFunctionget in interface Char2ByteFunctionk - the key.Function.get(Object)public char firstCharKey()
firstCharKey in interface Char2ByteSortedMapSortedMap.firstKey()public char lastCharKey()
lastCharKey in interface Char2ByteSortedMapSortedMap.lastKey()public ObjectSortedSet<Char2ByteMap.Entry> char2ByteEntrySet()
Char2ByteSortedMapchar2ByteEntrySet in interface Char2ByteMapchar2ByteEntrySet in interface Char2ByteSortedMapChar2ByteSortedMap.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 Char2ByteMapkeySet in interface Char2ByteSortedMapkeySet in interface Map<Character,Byte>keySet in interface SortedMap<Character,Byte>keySet in class AbstractChar2ByteSortedMapMap.keySet()public ByteCollection 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 Char2ByteMapvalues in interface Char2ByteSortedMapvalues in interface Map<Character,Byte>values in interface SortedMap<Character,Byte>values in class AbstractChar2ByteSortedMapMap.values()public CharComparator comparator()
Char2ByteSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Char2ByteSortedMapcomparator in interface SortedMap<Character,Byte>SortedMap.comparator()public Char2ByteSortedMap headMap(char to)
Char2ByteSortedMaptoKey.headMap in interface Char2ByteSortedMapSortedMap.headMap(Object)public Char2ByteSortedMap tailMap(char from)
Char2ByteSortedMapfromKey.tailMap in interface Char2ByteSortedMapSortedMap.tailMap(Object)public Char2ByteSortedMap subMap(char from, char to)
Char2ByteSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Char2ByteSortedMapSortedMap.subMap(Object,Object)public Char2ByteAVLTreeMap 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.