|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.ints.AbstractInt2CharMap
it.unimi.dsi.fastutil.ints.AbstractInt2CharSortedMap
it.unimi.dsi.fastutil.ints.Int2CharAVLTreeMap
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 inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2CharMap |
AbstractInt2CharMap.BasicEntry |
| Field Summary | |
static long |
serialVersionUID
|
| Constructor Summary | |
Int2CharAVLTreeMap()
Creates a new empty tree map. |
|
Int2CharAVLTreeMap(Comparator c)
Creates a new empty tree map with the given comparator. |
|
Int2CharAVLTreeMap(Int2CharMap m)
Creates a new tree map copying a given map. |
|
Int2CharAVLTreeMap(Int2CharSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Int2CharAVLTreeMap(Map m)
Creates a new tree map copying a given map. |
|
Int2CharAVLTreeMap(SortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
| Method Summary | |
void |
clear()
|
Object |
clone()
Returns a deep copy of this tree map. |
Comparator |
comparator()
|
boolean |
containsKey(int k)
Checks whether the given value is contained in keySet(). |
boolean |
containsValue(char v)
Checks whether the given value is contained in values(). |
Set |
entrySet()
|
int |
firstIntKey()
|
Object |
firstKey()
Delegates to the corresponding type-specific method. |
char |
get(int k)
Returns the value to which the given key is mapped. |
Object |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
Int2CharSortedMap |
headMap(int to)
|
boolean |
isEmpty()
|
Set |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
int |
lastIntKey()
|
Object |
lastKey()
Delegates to the corresponding type-specific method. |
char |
put(int k,
char v)
Adds a pair to the map. |
Object |
put(Object ok,
Object ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
char |
remove(int k)
Removes the mapping with the given key. |
Object |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
int |
size()
|
Int2CharSortedMap |
subMap(int from,
int to)
|
Int2CharSortedMap |
tailMap(int from)
|
Collection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2CharSortedMap |
headMap, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2CharMap |
containsKey, containsValue, defaultReturnValue, defaultReturnValue, equals, getDefRetValue, hashCode, putAll, setDefRetValue, toString |
| Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2CharMap |
defaultReturnValue, defaultReturnValue, getDefRetValue, setDefRetValue |
| Methods inherited from interface java.util.Map |
containsKey, containsValue, equals, hashCode, putAll |
| Methods inherited from interface java.util.SortedMap |
headMap, subMap, tailMap |
| Field Detail |
public static final long serialVersionUID
| Constructor Detail |
public Int2CharAVLTreeMap()
public Int2CharAVLTreeMap(Comparator c)
c - a Comparator.public Int2CharAVLTreeMap(Map m)
m - a Map to be copied into the new tree map.public Int2CharAVLTreeMap(SortedMap m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Int2CharAVLTreeMap(Int2CharMap m)
m - a type-specific map to be copied into the new tree map.public Int2CharAVLTreeMap(Int2CharSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.| Method Detail |
public final char put(int k,
char v)
Int2CharMap
put in interface Int2CharMapput in class AbstractInt2CharMappublic final char remove(int k)
Int2CharMap
remove in interface Int2CharMapremove in class AbstractInt2CharMap
public Object put(Object ok,
Object ov)
AbstractInt2CharMapnull 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 Mapput in class AbstractInt2CharMappublic Object remove(Object ok)
AbstractInt2CharMapnull 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 Mapremove in class AbstractInt2CharMappublic boolean containsValue(char v)
AbstractInt2CharMapAbstractInt2CharMap.values().
containsValue in interface Int2CharMapcontainsValue in class AbstractInt2CharMappublic void clear()
clear in interface Mapclear in class AbstractInt2CharMappublic boolean containsKey(int k)
AbstractInt2CharMapAbstractInt2CharMap.keySet().
containsKey in interface Int2CharMapcontainsKey in class AbstractInt2CharMappublic int size()
size in interface Mappublic boolean isEmpty()
isEmpty in interface MapisEmpty in class AbstractInt2CharMappublic char get(int k)
Int2CharMap
get in interface Int2CharMapk - the key.
Map.get(Object)public Object get(Object ok)
AbstractInt2CharMapnull 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 Mapget in class AbstractInt2CharMappublic int firstIntKey()
firstIntKey in interface Int2CharSortedMapSortedMap.firstKey()public int lastIntKey()
lastIntKey in interface Int2CharSortedMapSortedMap.lastKey()public Object firstKey()
AbstractInt2CharSortedMap
firstKey in interface SortedMapfirstKey in class AbstractInt2CharSortedMappublic Object lastKey()
AbstractInt2CharSortedMap
lastKey in interface SortedMaplastKey in class AbstractInt2CharSortedMappublic Set entrySet()
entrySet in interface Mappublic Set 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 MapkeySet in class AbstractInt2CharSortedMappublic Collection 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 Mapvalues in class AbstractInt2CharMappublic Comparator comparator()
comparator in interface SortedMappublic Int2CharSortedMap headMap(int to)
headMap in interface Int2CharSortedMapSortedMap.headMap(Object)public Int2CharSortedMap tailMap(int from)
tailMap in interface Int2CharSortedMapSortedMap.tailMap(Object)
public Int2CharSortedMap subMap(int from,
int to)
subMap in interface Int2CharSortedMapSortedMap.subMap(Object,Object)public 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.
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||