public class Char2IntRBTreeMap 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.BasicEntry
Char2IntSortedMap.FastSortedEntrySet
Char2IntMap.FastEntrySet
Constructor and Description |
---|
Char2IntRBTreeMap()
Creates a new empty tree map.
|
Char2IntRBTreeMap(char[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2IntRBTreeMap(char[] k,
int[] v,
Comparator<? super Character> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Char2IntRBTreeMap(Char2IntMap m)
Creates a new tree map copying a given map.
|
Char2IntRBTreeMap(Char2IntSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Char2IntRBTreeMap(Comparator<? super Character> c)
Creates a new empty tree map with the given comparator.
|
Char2IntRBTreeMap(Map<? extends Character,? extends Integer> m)
Creates a new tree map copying a given map.
|
Char2IntRBTreeMap(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).
|
Char2IntRBTreeMap |
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, tailMap
containsValue, equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get
defaultReturnValue, defaultReturnValue
containsKey, get
containsKey, containsValue, equals, get, hashCode, putAll
public Char2IntRBTreeMap()
public Char2IntRBTreeMap(Comparator<? super Character> c)
c
- a (possibly type-specific) comparator.public Char2IntRBTreeMap(Map<? extends Character,? extends Integer> m)
m
- a Map
to be copied into the new tree map.public Char2IntRBTreeMap(SortedMap<Character,Integer> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Char2IntRBTreeMap(Char2IntMap m)
m
- a type-specific map to be copied into the new tree map.public Char2IntRBTreeMap(Char2IntSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Char2IntRBTreeMap(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 Char2IntRBTreeMap(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)
Char2IntFunction
put
in interface Char2IntFunction
put
in class AbstractChar2IntFunction
k
- the key.v
- the value.Function.put(Object,Object)
public int remove(char k)
Char2IntFunction
remove
in interface Char2IntFunction
remove
in class AbstractChar2IntFunction
Function.remove(Object)
public Integer put(Character ok, Integer ov)
AbstractChar2IntFunction
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,Integer>
put
in interface Map<Character,Integer>
put
in class AbstractChar2IntFunction
ok
- the key.ov
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public Integer remove(Object ok)
AbstractChar2IntFunction
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(int v)
AbstractChar2IntMap
AbstractChar2IntMap.values()
.containsValue
in interface Char2IntMap
containsValue
in class AbstractChar2IntMap
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(char k)
AbstractChar2IntMap
AbstractChar2IntMap.keySet()
.containsKey
in interface Char2IntFunction
containsKey
in class AbstractChar2IntMap
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 int get(char k)
Char2IntFunction
get
in interface Char2IntFunction
k
- the key.Function.get(Object)
public char firstCharKey()
firstCharKey
in interface Char2IntSortedMap
SortedMap.firstKey()
public char lastCharKey()
lastCharKey
in interface Char2IntSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Char2IntMap.Entry> char2IntEntrySet()
Char2IntSortedMap
char2IntEntrySet
in interface Char2IntMap
char2IntEntrySet
in interface Char2IntSortedMap
Char2IntSortedMap.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 Char2IntMap
keySet
in interface Char2IntSortedMap
keySet
in interface Map<Character,Integer>
keySet
in interface SortedMap<Character,Integer>
keySet
in class AbstractChar2IntSortedMap
Map.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 Char2IntMap
values
in interface Char2IntSortedMap
values
in interface Map<Character,Integer>
values
in interface SortedMap<Character,Integer>
values
in class AbstractChar2IntSortedMap
Map.values()
public CharComparator comparator()
Char2IntSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Char2IntSortedMap
comparator
in interface SortedMap<Character,Integer>
SortedMap.comparator()
public Char2IntSortedMap headMap(char to)
Char2IntSortedMap
toKey
.headMap
in interface Char2IntSortedMap
SortedMap.headMap(Object)
public Char2IntSortedMap tailMap(char from)
Char2IntSortedMap
fromKey
.tailMap
in interface Char2IntSortedMap
SortedMap.tailMap(Object)
public Char2IntSortedMap subMap(char from, char to)
Char2IntSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Char2IntSortedMap
SortedMap.subMap(Object,Object)
public Char2IntRBTreeMap 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.