public class Int2CharAVLTreeMap extends AbstractInt2CharSortedMap 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.
AbstractInt2CharMap.BasicEntryInt2CharSortedMap.FastSortedEntrySetInt2CharMap.FastEntrySet| Constructor and Description |
|---|
Int2CharAVLTreeMap()
Creates a new empty tree map.
|
Int2CharAVLTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2CharAVLTreeMap(int[] k,
char[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2CharAVLTreeMap(int[] k,
char[] v,
Comparator<? super Integer> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Int2CharAVLTreeMap(Int2CharMap m)
Creates a new tree map copying a given map.
|
Int2CharAVLTreeMap(Int2CharSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Int2CharAVLTreeMap(Map<? extends Integer,? extends Character> m)
Creates a new tree map copying a given map.
|
Int2CharAVLTreeMap(SortedMap<Integer,Character> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
char |
addTo(int k,
char incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Int2CharAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
boolean |
containsKey(int k)
Checks whether the given value is contained in
AbstractInt2CharMap.keySet(). |
boolean |
containsValue(char v)
Checks whether the given value is contained in
AbstractInt2CharMap.values(). |
int |
firstIntKey() |
char |
get(int k)
Returns the value to which the given key is mapped.
|
Int2CharSortedMap |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
ObjectSortedSet<Int2CharMap.Entry> |
int2CharEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
boolean |
isEmpty() |
IntSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this
map.
|
int |
lastIntKey() |
char |
put(int k,
char v)
Adds a pair to the map.
|
Character |
put(Integer ok,
Character ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
char |
remove(int k)
Removes the mapping with the given key.
|
Character |
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.
|
Int2CharSortedMap |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Int2CharSortedMap |
tailMap(int 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.
|
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 Int2CharAVLTreeMap()
public Int2CharAVLTreeMap(Comparator<? super Integer> c)
c - a (possibly type-specific) comparator.public Int2CharAVLTreeMap(Map<? extends Integer,? extends Character> m)
m - a Map to be copied into the new tree map.public Int2CharAVLTreeMap(SortedMap<Integer,Character> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Int2CharAVLTreeMap(Int2CharMap m)
m - a type-specific map to be copied into the new tree map.public Int2CharAVLTreeMap(Int2CharSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Int2CharAVLTreeMap(int[] k,
char[] v,
Comparator<? super Integer> 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 Int2CharAVLTreeMap(int[] 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(int 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(int k,
char v)
Int2CharFunctionput in interface Int2CharFunctionput in class AbstractInt2CharFunctionk - the key.v - the value.Function.put(Object,Object)public char remove(int k)
Int2CharFunctionremove in interface Int2CharFunctionremove in class AbstractInt2CharFunctionk - the key.Function.remove(Object)@Deprecated public Character put(Integer 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<Integer,Character>put in interface Map<Integer,Character>put in class AbstractInt2CharFunctionok - 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.
remove in interface Function<Integer,Character>remove in interface Map<Integer,Character>remove in class AbstractInt2CharFunctionok - the key.null if no value was present for the given key.Map.remove(Object)public boolean containsValue(char v)
AbstractInt2CharMapAbstractInt2CharMap.values().containsValue in interface Int2CharMapcontainsValue in class AbstractInt2CharMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(int k)
AbstractInt2CharMapAbstractInt2CharMap.keySet().containsKey in interface Int2CharFunctioncontainsKey in class AbstractInt2CharMapFunction.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 get(int k)
Int2CharFunctionget in interface Int2CharFunctionk - the key.Function.get(Object)public int firstIntKey()
firstIntKey in interface Int2CharSortedMapSortedMap.firstKey()public int lastIntKey()
lastIntKey in interface Int2CharSortedMapSortedMap.lastKey()public ObjectSortedSet<Int2CharMap.Entry> int2CharEntrySet()
Int2CharSortedMapint2CharEntrySet in interface Int2CharMapint2CharEntrySet in interface Int2CharSortedMapInt2CharSortedMap.entrySet()public IntSortedSet 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 Int2CharMapkeySet in interface Int2CharSortedMapkeySet in interface Map<Integer,Character>keySet in interface SortedMap<Integer,Character>keySet in class AbstractInt2CharSortedMapMap.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 Int2CharMapvalues in interface Int2CharSortedMapvalues in interface Map<Integer,Character>values in interface SortedMap<Integer,Character>values in class AbstractInt2CharSortedMapMap.values()public IntComparator comparator()
Int2CharSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Int2CharSortedMapcomparator in interface SortedMap<Integer,Character>SortedMap.comparator()public Int2CharSortedMap headMap(int to)
Int2CharSortedMaptoKey.headMap in interface Int2CharSortedMapSortedMap.headMap(Object)public Int2CharSortedMap tailMap(int from)
Int2CharSortedMapfromKey.tailMap in interface Int2CharSortedMapSortedMap.tailMap(Object)public Int2CharSortedMap subMap(int from, int to)
Int2CharSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Int2CharSortedMapSortedMap.subMap(Object,Object)public Int2CharAVLTreeMap 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.