|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.chars.AbstractChar2ObjectFunction<V>
it.unimi.dsi.fastutil.chars.AbstractChar2ObjectMap<V>
it.unimi.dsi.fastutil.chars.AbstractChar2ObjectSortedMap<V>
it.unimi.dsi.fastutil.chars.Char2ObjectRBTreeMap<V>
public class Char2ObjectRBTreeMap<V>
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.AbstractChar2ObjectMap |
---|
AbstractChar2ObjectMap.BasicEntry<V> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.chars.Char2ObjectSortedMap |
---|
Char2ObjectSortedMap.FastSortedEntrySet<V> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.chars.Char2ObjectMap |
---|
Char2ObjectMap.FastEntrySet<V> |
Field Summary | |
---|---|
static long |
serialVersionUID
|
Constructor Summary | |
---|---|
Char2ObjectRBTreeMap()
Creates a new empty tree map. |
|
Char2ObjectRBTreeMap(char[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Char2ObjectRBTreeMap(char[] k,
V[] 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. |
|
Char2ObjectRBTreeMap(Char2ObjectMap<? extends V> m)
Creates a new tree map copying a given map. |
|
Char2ObjectRBTreeMap(Char2ObjectSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Char2ObjectRBTreeMap(java.util.Comparator<? super java.lang.Character> c)
Creates a new empty tree map with the given comparator. |
|
Char2ObjectRBTreeMap(java.util.Map<? extends java.lang.Character,? extends V> m)
Creates a new tree map copying a given map. |
|
Char2ObjectRBTreeMap(java.util.SortedMap<java.lang.Character,V> m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
Method Summary | |
---|---|
ObjectSortedSet<Char2ObjectMap.Entry<V>> |
char2ObjectEntrySet()
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 AbstractChar2ObjectMap.keySet() . |
boolean |
containsValue(java.lang.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(java.lang.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(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. |
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. |
Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2ObjectSortedMap |
---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2ObjectMap |
---|
equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2ObjectFunction |
---|
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.Char2ObjectFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from interface it.unimi.dsi.fastutil.Function |
---|
containsKey, get |
Methods inherited from interface java.util.Map |
---|
containsKey, equals, get, hashCode, putAll |
Methods inherited from interface java.util.Map |
---|
containsKey, equals, get, hashCode, putAll |
Field Detail |
---|
public static final long serialVersionUID
Constructor Detail |
---|
public Char2ObjectRBTreeMap()
public Char2ObjectRBTreeMap(java.util.Comparator<? super java.lang.Character> c)
c
- a (possibly type-specific) comparator.public Char2ObjectRBTreeMap(java.util.Map<? extends java.lang.Character,? extends V> m)
m
- a Map
to be copied into the new tree map.public Char2ObjectRBTreeMap(java.util.SortedMap<java.lang.Character,V> m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Char2ObjectRBTreeMap(Char2ObjectMap<? extends V> m)
m
- a type-specific map to be copied into the new tree map.public Char2ObjectRBTreeMap(Char2ObjectSortedMap<V> m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.public Char2ObjectRBTreeMap(char[] k, V[] 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 Char2ObjectRBTreeMap(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.
java.lang.IllegalArgumentException
- if k
and v
have different lengths.Method Detail |
---|
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>
Function.remove(Object)
public V put(java.lang.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<java.lang.Character,V>
put
in interface java.util.Map<java.lang.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(java.lang.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.
remove
in interface Function<java.lang.Character,V>
remove
in interface java.util.Map<java.lang.Character,V>
remove
in class AbstractChar2ObjectFunction<V>
null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(java.lang.Object v)
AbstractChar2ObjectMap
AbstractChar2ObjectMap.values()
.
containsValue
in interface java.util.Map<java.lang.Character,V>
containsValue
in class AbstractChar2ObjectMap<V>
public void clear()
Function
clear
in interface Function<java.lang.Character,V>
clear
in interface java.util.Map<java.lang.Character,V>
clear
in class AbstractChar2ObjectFunction<V>
Map.clear()
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.
size
in interface Function<java.lang.Character,V>
size
in interface java.util.Map<java.lang.Character,V>
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Character,V>
isEmpty
in class AbstractChar2ObjectMap<V>
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()
Char2ObjectMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Char2ObjectMap.entrySet()
so that it returns an ObjectSet
of objects of type Char2ObjectMap.Entry
(the latter makes it possible to
access keys and values with type-specific methods).
char2ObjectEntrySet
in interface Char2ObjectMap<V>
char2ObjectEntrySet
in interface Char2ObjectSortedMap<V>
Char2ObjectMap.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 java.util.Map<java.lang.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 java.util.Map<java.lang.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 java.util.SortedMap<java.lang.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 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 |