public class Char2IntAVLTreeMap extends AbstractChar2IntSortedMap 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.
AbstractChar2IntMap.BasicEntryChar2IntSortedMap.FastSortedEntrySetChar2IntMap.FastEntrySet| Constructor and Description |
|---|
Char2IntAVLTreeMap()
Creates a new empty tree map.
|
Char2IntAVLTreeMap(char[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2IntAVLTreeMap(char[] k,
int[] v,
Comparator<? super Character> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Char2IntAVLTreeMap(Char2IntMap m)
Creates a new tree map copying a given map.
|
Char2IntAVLTreeMap(Char2IntSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Char2IntAVLTreeMap(Comparator<? super Character> c)
Creates a new empty tree map with the given comparator.
|
Char2IntAVLTreeMap(Map<? extends Character,? extends Integer> m)
Creates a new tree map copying a given map.
|
Char2IntAVLTreeMap(SortedMap<Character,Integer> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Char2IntMap.Entry> |
char2IntEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Char2IntAVLTreeMap |
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
AbstractChar2IntMap.keySet(). |
boolean |
containsValue(int v)
Checks whether the given value is contained in
AbstractChar2IntMap.values(). |
char |
firstCharKey() |
int |
get(char k)
Returns the value to which the given key is mapped.
|
Char2IntSortedMap |
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() |
Integer |
put(Character ok,
Integer ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
put(char k,
int v)
Adds a pair to the map.
|
int |
remove(char k)
Removes the mapping with the given key.
|
Integer |
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.
|
Char2IntSortedMap |
subMap(char from,
char to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Char2IntSortedMap |
tailMap(char from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
IntCollection |
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, getcontainsKey, containsValue, equals, get, hashCode, putAllpublic Char2IntAVLTreeMap()
public Char2IntAVLTreeMap(Comparator<? super Character> c)
c - a (possibly type-specific) comparator.public Char2IntAVLTreeMap(Map<? extends Character,? extends Integer> m)
m - a Map to be copied into the new tree map.public Char2IntAVLTreeMap(SortedMap<Character,Integer> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Char2IntAVLTreeMap(Char2IntMap m)
m - a type-specific map to be copied into the new tree map.public Char2IntAVLTreeMap(Char2IntSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Char2IntAVLTreeMap(char[] k,
int[] 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 Char2IntAVLTreeMap(char[] k,
int[] 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 int put(char k,
int v)
Char2IntFunctionput in interface Char2IntFunctionput in class AbstractChar2IntFunctionk - the key.v - the value.Function.put(Object,Object)public int remove(char k)
Char2IntFunctionremove in interface Char2IntFunctionremove in class AbstractChar2IntFunctionFunction.remove(Object)public Integer put(Character ok, Integer ov)
AbstractChar2IntFunctionnull 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,Integer>put in interface Map<Character,Integer>put in class AbstractChar2IntFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public Integer remove(Object ok)
AbstractChar2IntFunctionnull 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(int v)
AbstractChar2IntMapAbstractChar2IntMap.values().containsValue in interface Char2IntMapcontainsValue in class AbstractChar2IntMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(char k)
AbstractChar2IntMapAbstractChar2IntMap.keySet().containsKey in interface Char2IntFunctioncontainsKey in class AbstractChar2IntMapFunction.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 int get(char k)
Char2IntFunctionget in interface Char2IntFunctionk - the key.Function.get(Object)public char firstCharKey()
firstCharKey in interface Char2IntSortedMapSortedMap.firstKey()public char lastCharKey()
lastCharKey in interface Char2IntSortedMapSortedMap.lastKey()public ObjectSortedSet<Char2IntMap.Entry> char2IntEntrySet()
Char2IntSortedMapchar2IntEntrySet in interface Char2IntMapchar2IntEntrySet in interface Char2IntSortedMapChar2IntSortedMap.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 Char2IntMapkeySet in interface Char2IntSortedMapkeySet in interface Map<Character,Integer>keySet in interface SortedMap<Character,Integer>keySet in class AbstractChar2IntSortedMapMap.keySet()public IntCollection 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 Char2IntMapvalues in interface Char2IntSortedMapvalues in interface Map<Character,Integer>values in interface SortedMap<Character,Integer>values in class AbstractChar2IntSortedMapMap.values()public CharComparator comparator()
Char2IntSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Char2IntSortedMapcomparator in interface SortedMap<Character,Integer>SortedMap.comparator()public Char2IntSortedMap headMap(char to)
Char2IntSortedMaptoKey.headMap in interface Char2IntSortedMapSortedMap.headMap(Object)public Char2IntSortedMap tailMap(char from)
Char2IntSortedMapfromKey.tailMap in interface Char2IntSortedMapSortedMap.tailMap(Object)public Char2IntSortedMap subMap(char from, char to)
Char2IntSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Char2IntSortedMapSortedMap.subMap(Object,Object)public Char2IntAVLTreeMap 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.