|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.chars.AbstractChar2CharFunction
it.unimi.dsi.fastutil.chars.AbstractChar2CharMap
it.unimi.dsi.fastutil.chars.AbstractChar2CharSortedMap
it.unimi.dsi.fastutil.chars.Char2CharRBTreeMap
public class Char2CharRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
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.
Nested Class Summary |
---|
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2CharMap |
---|
AbstractChar2CharMap.BasicEntry |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.chars.Char2CharSortedMap |
---|
Char2CharSortedMap.FastSortedEntrySet |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.chars.Char2CharMap |
---|
Char2CharMap.FastEntrySet |
Field Summary | |
---|---|
static long |
serialVersionUID
|
Constructor Summary | |
---|---|
Char2CharRBTreeMap()
Creates a new empty tree map. |
|
Char2CharRBTreeMap(char[] k,
char[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Char2CharRBTreeMap(char[] k,
char[] v,
java.util.Comparator<? super java.lang.Character> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Char2CharRBTreeMap(Char2CharMap m)
Creates a new tree map copying a given map. |
|
Char2CharRBTreeMap(Char2CharSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Char2CharRBTreeMap(java.util.Comparator<? super java.lang.Character> c)
Creates a new empty tree map with the given comparator. |
|
Char2CharRBTreeMap(java.util.Map<? extends java.lang.Character,? extends java.lang.Character> m)
Creates a new tree map copying a given map. |
|
Char2CharRBTreeMap(java.util.SortedMap<java.lang.Character,java.lang.Character> m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
Method Summary | |
---|---|
ObjectSortedSet<Char2CharMap.Entry> |
char2CharEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
void |
clear()
Removes all associations from this function (optional operation). |
java.lang.Object |
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 AbstractChar2CharMap.keySet() . |
boolean |
containsValue(char v)
Checks whether the given value is contained in AbstractChar2CharMap.values() . |
char |
firstCharKey()
|
char |
get(char k)
Returns the value to which the given key is mapped. |
Char2CharSortedMap |
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()
|
java.lang.Character |
put(java.lang.Character ok,
java.lang.Character ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
char |
put(char k,
char v)
Adds a pair to the map. |
char |
remove(char k)
Removes the mapping with the given key. |
java.lang.Character |
remove(java.lang.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. |
Char2CharSortedMap |
subMap(char from,
char to)
Returns a view of the portion of this sorted map whose keys range from fromKey , inclusive, to toKey , exclusive. |
Char2CharSortedMap |
tailMap(char 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. |
Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2CharSortedMap |
---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2CharMap |
---|
containsValue, equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2CharFunction |
---|
containsKey, defaultReturnValue, defaultReturnValue, get |
Methods inherited from class java.lang.Object |
---|
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.chars.Char2CharFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from interface it.unimi.dsi.fastutil.Function |
---|
containsKey, get |
Methods inherited from interface java.util.Map |
---|
containsKey, containsValue, equals, get, hashCode, putAll |
Methods inherited from interface java.util.Map |
---|
containsKey, containsValue, equals, get, hashCode, putAll |
Field Detail |
---|
public static final long serialVersionUID
Constructor Detail |
---|
public Char2CharRBTreeMap()
public Char2CharRBTreeMap(java.util.Comparator<? super java.lang.Character> c)
c
- a (possibly type-specific) comparator.public Char2CharRBTreeMap(java.util.Map<? extends java.lang.Character,? extends java.lang.Character> m)
m
- a Map
to be copied into the new tree map.public Char2CharRBTreeMap(java.util.SortedMap<java.lang.Character,java.lang.Character> m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Char2CharRBTreeMap(Char2CharMap m)
m
- a type-specific map to be copied into the new tree map.public Char2CharRBTreeMap(Char2CharSortedMap m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.public Char2CharRBTreeMap(char[] k, char[] v, java.util.Comparator<? super java.lang.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.
java.lang.IllegalArgumentException
- if k
and v
have different lengths.public Char2CharRBTreeMap(char[] k, char[] v)
k
- the array of keys of the new tree map.v
- the array of corresponding values in the new tree map.
java.lang.IllegalArgumentException
- if k
and v
have different lengths.Method Detail |
---|
public char put(char k, char v)
Char2CharFunction
put
in interface Char2CharFunction
put
in class AbstractChar2CharFunction
k
- the key.v
- the value.
Function.put(Object,Object)
public char remove(char k)
Char2CharFunction
remove
in interface Char2CharFunction
remove
in class AbstractChar2CharFunction
Function.remove(Object)
public java.lang.Character put(java.lang.Character ok, java.lang.Character ov)
AbstractChar2CharFunction
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<java.lang.Character,java.lang.Character>
put
in interface java.util.Map<java.lang.Character,java.lang.Character>
put
in class AbstractChar2CharFunction
ok
- the key.ov
- the value.
null
if no value was present for the given key.Map.put(Object,Object)
public java.lang.Character remove(java.lang.Object ok)
AbstractChar2CharFunction
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<java.lang.Character,java.lang.Character>
remove
in interface java.util.Map<java.lang.Character,java.lang.Character>
remove
in class AbstractChar2CharFunction
null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(char v)
AbstractChar2CharMap
AbstractChar2CharMap.values()
.
containsValue
in interface Char2CharMap
containsValue
in class AbstractChar2CharMap
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<java.lang.Character,java.lang.Character>
clear
in interface java.util.Map<java.lang.Character,java.lang.Character>
clear
in class AbstractChar2CharFunction
Map.clear()
public boolean containsKey(char k)
AbstractChar2CharMap
AbstractChar2CharMap.keySet()
.
containsKey
in interface Char2CharFunction
containsKey
in class AbstractChar2CharMap
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.
size
in interface Function<java.lang.Character,java.lang.Character>
size
in interface java.util.Map<java.lang.Character,java.lang.Character>
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Character,java.lang.Character>
isEmpty
in class AbstractChar2CharMap
public char get(char k)
Char2CharFunction
get
in interface Char2CharFunction
k
- the key.
Function.get(Object)
public char firstCharKey()
firstCharKey
in interface Char2CharSortedMap
SortedMap.firstKey()
public char lastCharKey()
lastCharKey
in interface Char2CharSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Char2CharMap.Entry> char2CharEntrySet()
Char2CharMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Char2CharMap.entrySet()
so that it returns an ObjectSet
of objects of type Char2CharMap.Entry
(the latter makes it possible to
access keys and values with type-specific methods).
char2CharEntrySet
in interface Char2CharMap
char2CharEntrySet
in interface Char2CharSortedMap
Char2CharMap.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 Char2CharMap
keySet
in interface Char2CharSortedMap
keySet
in interface java.util.Map<java.lang.Character,java.lang.Character>
keySet
in class AbstractChar2CharSortedMap
Map.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 Char2CharMap
values
in interface Char2CharSortedMap
values
in interface java.util.Map<java.lang.Character,java.lang.Character>
values
in class AbstractChar2CharSortedMap
Map.values()
public CharComparator comparator()
Char2CharSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Char2CharSortedMap
comparator
in interface java.util.SortedMap<java.lang.Character,java.lang.Character>
SortedMap.comparator()
public Char2CharSortedMap headMap(char to)
Char2CharSortedMap
toKey
.
headMap
in interface Char2CharSortedMap
SortedMap.headMap(Object)
public Char2CharSortedMap tailMap(char from)
Char2CharSortedMap
fromKey
.
tailMap
in interface Char2CharSortedMap
SortedMap.tailMap(Object)
public Char2CharSortedMap subMap(char from, char to)
Char2CharSortedMap
fromKey
, inclusive, to toKey
, exclusive.
subMap
in interface Char2CharSortedMap
SortedMap.subMap(Object,Object)
public java.lang.Object 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.
clone
in class java.lang.Object
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |