public class Char2ObjectAVLTreeMap<V> extends AbstractChar2ObjectSortedMap<V> 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.
AbstractChar2ObjectMap.BasicEntry<V>
Char2ObjectSortedMap.FastSortedEntrySet<V>
Char2ObjectMap.FastEntrySet<V>
Constructor and Description |
---|
Char2ObjectAVLTreeMap()
Creates a new empty tree map.
|
Char2ObjectAVLTreeMap(char[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2ObjectAVLTreeMap(char[] k,
V[] v,
Comparator<? super Character> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Char2ObjectAVLTreeMap(Char2ObjectMap<? extends V> m)
Creates a new tree map copying a given map.
|
Char2ObjectAVLTreeMap(Char2ObjectSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Char2ObjectAVLTreeMap(Comparator<? super Character> c)
Creates a new empty tree map with the given comparator.
|
Char2ObjectAVLTreeMap(Map<? extends Character,? extends V> m)
Creates a new tree map copying a given map.
|
Char2ObjectAVLTreeMap(SortedMap<Character,V> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
ObjectSortedSet<Char2ObjectMap.Entry<V>> |
char2ObjectEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Char2ObjectAVLTreeMap<V> |
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
AbstractChar2ObjectMap.keySet() . |
boolean |
containsValue(Object v)
Checks whether the given value is contained in
AbstractChar2ObjectMap.values() . |
char |
firstCharKey() |
V |
get(char k)
Returns the value to which the given key is mapped.
|
Char2ObjectSortedMap<V> |
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() |
V |
put(Character ok,
V ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
V |
put(char k,
V v)
Adds a pair to the map.
|
V |
remove(char k)
Removes the mapping with the given key.
|
V |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Char2ObjectSortedMap<V> |
subMap(char from,
char to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Char2ObjectSortedMap<V> |
tailMap(char from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
ObjectCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMap
equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get
defaultReturnValue, defaultReturnValue
containsKey, get
compute, computeIfAbsent, computeIfPresent, containsKey, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAll
public Char2ObjectAVLTreeMap()
public Char2ObjectAVLTreeMap(Comparator<? super Character> c)
c
- a (possibly type-specific) comparator.public Char2ObjectAVLTreeMap(Map<? extends Character,? extends V> m)
m
- a Map
to be copied into the new tree map.public Char2ObjectAVLTreeMap(SortedMap<Character,V> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Char2ObjectAVLTreeMap(Char2ObjectMap<? extends V> m)
m
- a type-specific map to be copied into the new tree map.public Char2ObjectAVLTreeMap(Char2ObjectSortedMap<V> m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Char2ObjectAVLTreeMap(char[] k, V[] 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 Char2ObjectAVLTreeMap(char[] k, V[] 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 V put(char k, V v)
Char2ObjectFunction
put
in interface Char2ObjectFunction<V>
put
in class AbstractChar2ObjectFunction<V>
k
- the key.v
- the value.Function.put(Object,Object)
public V remove(char k)
Char2ObjectFunction
remove
in interface Char2ObjectFunction<V>
remove
in class AbstractChar2ObjectFunction<V>
k
- the key.Function.remove(Object)
public V put(Character ok, V ov)
AbstractChar2ObjectFunction
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,V>
put
in interface Map<Character,V>
put
in class AbstractChar2ObjectFunction<V>
ok
- the key.ov
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public V remove(Object ok)
AbstractChar2ObjectFunction
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(Object v)
AbstractChar2ObjectMap
AbstractChar2ObjectMap.values()
.containsValue
in interface Map<Character,V>
containsValue
in class AbstractChar2ObjectMap<V>
public void clear()
Function
public boolean containsKey(char k)
AbstractChar2ObjectMap
AbstractChar2ObjectMap.keySet()
.containsKey
in interface Char2ObjectFunction<V>
containsKey
in class AbstractChar2ObjectMap<V>
Function.containsKey(Object)
public int size()
Function
Most 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 V get(char k)
Char2ObjectFunction
get
in interface Char2ObjectFunction<V>
k
- the key.Function.get(Object)
public char firstCharKey()
firstCharKey
in interface Char2ObjectSortedMap<V>
SortedMap.firstKey()
public char lastCharKey()
lastCharKey
in interface Char2ObjectSortedMap<V>
SortedMap.lastKey()
public ObjectSortedSet<Char2ObjectMap.Entry<V>> char2ObjectEntrySet()
Char2ObjectSortedMap
char2ObjectEntrySet
in interface Char2ObjectMap<V>
char2ObjectEntrySet
in interface Char2ObjectSortedMap<V>
Char2ObjectSortedMap.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 Char2ObjectMap<V>
keySet
in interface Char2ObjectSortedMap<V>
keySet
in interface Map<Character,V>
keySet
in interface SortedMap<Character,V>
keySet
in class AbstractChar2ObjectSortedMap<V>
Map.keySet()
public ObjectCollection<V> 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 Char2ObjectMap<V>
values
in interface Char2ObjectSortedMap<V>
values
in interface Map<Character,V>
values
in interface SortedMap<Character,V>
values
in class AbstractChar2ObjectSortedMap<V>
Map.values()
public CharComparator comparator()
Char2ObjectSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Char2ObjectSortedMap<V>
comparator
in interface SortedMap<Character,V>
SortedMap.comparator()
public Char2ObjectSortedMap<V> headMap(char to)
Char2ObjectSortedMap
toKey
.headMap
in interface Char2ObjectSortedMap<V>
SortedMap.headMap(Object)
public Char2ObjectSortedMap<V> tailMap(char from)
Char2ObjectSortedMap
fromKey
.tailMap
in interface Char2ObjectSortedMap<V>
SortedMap.tailMap(Object)
public Char2ObjectSortedMap<V> subMap(char from, char to)
Char2ObjectSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Char2ObjectSortedMap<V>
SortedMap.subMap(Object,Object)
public Char2ObjectAVLTreeMap<V> 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.