|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractObject2CharFunction<K>
it.unimi.dsi.fastutil.objects.AbstractObject2CharMap<K>
it.unimi.dsi.fastutil.objects.AbstractObject2CharSortedMap<K>
it.unimi.dsi.fastutil.objects.Object2CharAVLTreeMap<K>
public class Object2CharAVLTreeMap<K>
A type-specific AVL 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.objects.AbstractObject2CharSortedMap |
---|
AbstractObject2CharSortedMap.KeySetIterator<K>, AbstractObject2CharSortedMap.ValuesCollection, AbstractObject2CharSortedMap.ValuesIterator<K> |
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2CharMap |
---|
AbstractObject2CharMap.BasicEntry<K> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2CharSortedMap |
---|
Object2CharSortedMap.FastSortedEntrySet<K> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2CharMap |
---|
Object2CharMap.FastEntrySet<K> |
Field Summary | |
---|---|
protected Comparator<? super K> |
actualComparator
This map's actual comparator; it may differ from storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping. |
protected int |
count
Number of entries in this map. |
protected ObjectSortedSet<Object2CharMap.Entry<K>> |
entries
Cached set of entries. |
protected it.unimi.dsi.fastutil.objects.Object2CharAVLTreeMap.Entry<K> |
firstEntry
The first key in this map. |
protected ObjectSortedSet<K> |
keys
Cached set of keys. |
protected it.unimi.dsi.fastutil.objects.Object2CharAVLTreeMap.Entry<K> |
lastEntry
The last key in this map. |
protected boolean |
modified
The value of this variable remembers, after a put()
or a remove() , whether the domain of the map
has been modified. |
static long |
serialVersionUID
|
protected Comparator<? super K> |
storedComparator
This map's comparator, as provided in the constructor. |
protected it.unimi.dsi.fastutil.objects.Object2CharAVLTreeMap.Entry<K> |
tree
A reference to the root entry. |
protected CharCollection |
values
Cached collection of values. |
Fields inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2CharFunction |
---|
defRetValue |
Constructor Summary | |
---|---|
Object2CharAVLTreeMap()
Creates a new empty tree map. |
|
Object2CharAVLTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator. |
|
Object2CharAVLTreeMap(K[] k,
char[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Object2CharAVLTreeMap(K[] k,
char[] v,
Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Object2CharAVLTreeMap(Map<? extends K,? extends Character> m)
Creates a new tree map copying a given map. |
|
Object2CharAVLTreeMap(Object2CharMap<? extends K> m)
Creates a new tree map copying a given map. |
|
Object2CharAVLTreeMap(Object2CharSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Object2CharAVLTreeMap(SortedMap<K,Character> m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
Method Summary | |
---|---|
void |
clear()
Removes all associations from this function (optional operation). |
Object2CharAVLTreeMap<K> |
clone()
Returns a deep copy of this tree map. |
Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering. |
boolean |
containsKey(Object k)
Checks whether the given value is contained in AbstractObject2CharMap.keySet() . |
boolean |
containsValue(char v)
Checks whether the given value is contained in AbstractObject2CharMap.values() . |
K |
firstKey()
|
Character |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
char |
getChar(Object k)
Returns the value to which the given key is mapped. |
Object2CharSortedMap<K> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly less than toKey . |
boolean |
isEmpty()
|
ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
K |
lastKey()
|
ObjectSortedSet<Object2CharMap.Entry<K>> |
object2CharEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map. |
char |
put(K k,
char v)
Adds a pair to the map. |
Character |
put(K ok,
Character ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
Character |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
char |
removeChar(Object k)
Removes the mapping with the given key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists. |
Object2CharSortedMap<K> |
subMap(K from,
K to)
Returns a view of the portion of this sorted map whose keys range from fromKey , inclusive, to toKey , exclusive. |
Object2CharSortedMap<K> |
tailMap(K 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.objects.AbstractObject2CharSortedMap |
---|
entrySet |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2CharMap |
---|
containsValue, equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2CharFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from class java.lang.Object |
---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2CharFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from interface java.util.Map |
---|
containsValue, equals, hashCode, putAll |
Field Detail |
---|
protected transient it.unimi.dsi.fastutil.objects.Object2CharAVLTreeMap.Entry<K> tree
protected int count
protected transient it.unimi.dsi.fastutil.objects.Object2CharAVLTreeMap.Entry<K> firstEntry
protected transient it.unimi.dsi.fastutil.objects.Object2CharAVLTreeMap.Entry<K> lastEntry
protected transient volatile ObjectSortedSet<Object2CharMap.Entry<K>> entries
protected transient volatile ObjectSortedSet<K> keys
protected transient volatile CharCollection values
protected transient boolean modified
put()
or a remove()
, whether the domain of the map
has been modified.
protected Comparator<? super K> storedComparator
protected transient Comparator<? super K> actualComparator
storedComparator
because it is
always a type-specific comparator, so it could be derived from the former by wrapping.
public static final long serialVersionUID
Constructor Detail |
---|
public Object2CharAVLTreeMap()
public Object2CharAVLTreeMap(Comparator<? super K> c)
c
- a (possibly type-specific) comparator.public Object2CharAVLTreeMap(Map<? extends K,? extends Character> m)
m
- a Map
to be copied into the new tree map.public Object2CharAVLTreeMap(SortedMap<K,Character> m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Object2CharAVLTreeMap(Object2CharMap<? extends K> m)
m
- a type-specific map to be copied into the new tree map.public Object2CharAVLTreeMap(Object2CharSortedMap<K> m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.public Object2CharAVLTreeMap(K[] k, char[] v, Comparator<? super K> 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 Object2CharAVLTreeMap(K[] k, char[] 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.Method Detail |
---|
public char put(K k, char v)
Object2CharFunction
put
in interface Object2CharFunction<K>
put
in class AbstractObject2CharFunction<K>
k
- the key.v
- the value.
Function.put(Object,Object)
public char removeChar(Object k)
Object2CharFunction
removeChar
in interface Object2CharFunction<K>
removeChar
in class AbstractObject2CharFunction<K>
Function.remove(Object)
public Character put(K ok, Character ov)
AbstractObject2CharFunction
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<K,Character>
put
in interface Map<K,Character>
put
in class AbstractObject2CharFunction<K>
ok
- the key.ov
- the value.
null
if no value was present for the given key.Map.put(Object,Object)
public Character remove(Object ok)
AbstractObject2CharFunction
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<K,Character>
remove
in interface Map<K,Character>
remove
in class AbstractObject2CharFunction<K>
null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(char v)
AbstractObject2CharMap
AbstractObject2CharMap.values()
.
containsValue
in interface Object2CharMap<K>
containsValue
in class AbstractObject2CharMap<K>
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<K,Character>
clear
in interface Map<K,Character>
clear
in class AbstractObject2CharFunction<K>
Map.clear()
public boolean containsKey(Object k)
AbstractObject2CharMap
AbstractObject2CharMap.keySet()
.
containsKey
in interface Function<K,Character>
containsKey
in interface Map<K,Character>
containsKey
in class AbstractObject2CharMap<K>
k
- the key.
key
.Map.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<K,Character>
size
in interface Map<K,Character>
public boolean isEmpty()
isEmpty
in interface Map<K,Character>
isEmpty
in class AbstractObject2CharMap<K>
public char getChar(Object k)
Object2CharFunction
getChar
in interface Object2CharFunction<K>
k
- the key.
Function.get(Object)
public Character get(Object ok)
AbstractObject2CharFunction
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.
get
in interface Function<K,Character>
get
in interface Map<K,Character>
get
in class AbstractObject2CharFunction<K>
ok
- the key.
null
if no value was present for the given key.Map.get(Object)
public K firstKey()
firstKey
in interface SortedMap<K,Character>
public K lastKey()
lastKey
in interface SortedMap<K,Character>
public ObjectSortedSet<Object2CharMap.Entry<K>> object2CharEntrySet()
Object2CharSortedMap
object2CharEntrySet
in interface Object2CharMap<K>
object2CharEntrySet
in interface Object2CharSortedMap<K>
Object2CharSortedMap.entrySet()
public ObjectSortedSet<K> 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 Object2CharMap<K>
keySet
in interface Object2CharSortedMap<K>
keySet
in interface Map<K,Character>
keySet
in interface SortedMap<K,Character>
keySet
in class AbstractObject2CharSortedMap<K>
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 Object2CharMap<K>
values
in interface Object2CharSortedMap<K>
values
in interface Map<K,Character>
values
in interface SortedMap<K,Character>
values
in class AbstractObject2CharSortedMap<K>
Map.values()
public Comparator<? super K> comparator()
Object2CharSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Object2CharSortedMap<K>
comparator
in interface SortedMap<K,Character>
SortedMap.comparator()
public Object2CharSortedMap<K> headMap(K to)
Object2CharSortedMap
toKey
.
Note that this specification strengthens the one given in SortedMap.headMap(Object)
.
headMap
in interface Object2CharSortedMap<K>
headMap
in interface SortedMap<K,Character>
SortedMap.headMap(Object)
public Object2CharSortedMap<K> tailMap(K from)
Object2CharSortedMap
fromKey
.
Note that this specification strengthens the one given in SortedMap.tailMap(Object)
.
tailMap
in interface Object2CharSortedMap<K>
tailMap
in interface SortedMap<K,Character>
SortedMap.tailMap(Object)
public Object2CharSortedMap<K> subMap(K from, K to)
Object2CharSortedMap
fromKey
, inclusive, to toKey
, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object)
.
subMap
in interface Object2CharSortedMap<K>
subMap
in interface SortedMap<K,Character>
SortedMap.subMap(Object,Object)
public Object2CharAVLTreeMap<K> 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 Object
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |