|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.chars.AbstractChar2ReferenceMap
it.unimi.dsi.fastutil.chars.AbstractChar2ReferenceSortedMap
it.unimi.dsi.fastutil.chars.Char2ReferenceRBTreeMap
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 inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2ReferenceMap |
AbstractChar2ReferenceMap.BasicEntry |
| Field Summary | |
static long |
serialVersionUID
|
| Constructor Summary | |
Char2ReferenceRBTreeMap()
Creates a new empty tree map. |
|
Char2ReferenceRBTreeMap(Char2ReferenceMap m)
Creates a new tree map copying a given map. |
|
Char2ReferenceRBTreeMap(Char2ReferenceSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Char2ReferenceRBTreeMap(Comparator c)
Creates a new empty tree map with the given comparator. |
|
Char2ReferenceRBTreeMap(Map m)
Creates a new tree map copying a given map. |
|
Char2ReferenceRBTreeMap(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(char k)
Checks whether the given value is contained in keySet(). |
boolean |
containsValue(Object v)
Checks whether the given value is contained in values(). |
Set |
entrySet()
|
char |
firstCharKey()
|
Object |
firstKey()
Delegates to the corresponding type-specific method. |
Object |
get(char 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.
|
Char2ReferenceSortedMap |
headMap(char to)
|
boolean |
isEmpty()
|
Set |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
char |
lastCharKey()
|
Object |
lastKey()
Delegates to the corresponding type-specific method. |
Object |
put(char k,
Object 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.
|
Object |
remove(char 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()
|
Char2ReferenceSortedMap |
subMap(char from,
char to)
|
Char2ReferenceSortedMap |
tailMap(char from)
|
Collection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2ReferenceSortedMap |
headMap, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2ReferenceMap |
containsKey, 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.chars.Char2ReferenceMap |
defaultReturnValue, defaultReturnValue, getDefRetValue, setDefRetValue |
| Methods inherited from interface java.util.Map |
containsKey, equals, hashCode, putAll |
| Methods inherited from interface java.util.SortedMap |
headMap, subMap, tailMap |
| Field Detail |
public static final long serialVersionUID
| Constructor Detail |
public Char2ReferenceRBTreeMap()
public Char2ReferenceRBTreeMap(Comparator c)
c - a Comparator.public Char2ReferenceRBTreeMap(Map m)
m - a Map to be copied into the new tree map.public Char2ReferenceRBTreeMap(SortedMap m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Char2ReferenceRBTreeMap(Char2ReferenceMap m)
m - a type-specific map to be copied into the new tree map.public Char2ReferenceRBTreeMap(Char2ReferenceSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.| Method Detail |
public final Object put(char k,
Object v)
Char2ReferenceMap
put in interface Char2ReferenceMapput in class AbstractChar2ReferenceMappublic final Object remove(char k)
Char2ReferenceMap
remove in interface Char2ReferenceMapremove in class AbstractChar2ReferenceMap
public Object put(Object ok,
Object ov)
AbstractChar2ReferenceMapnull 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 AbstractChar2ReferenceMappublic Object remove(Object ok)
AbstractChar2ReferenceMapnull 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 AbstractChar2ReferenceMappublic boolean containsValue(Object v)
AbstractChar2ReferenceMapAbstractChar2ReferenceMap.values().
containsValue in interface MapcontainsValue in class AbstractChar2ReferenceMappublic void clear()
clear in interface Mapclear in class AbstractChar2ReferenceMappublic boolean containsKey(char k)
AbstractChar2ReferenceMapAbstractChar2ReferenceMap.keySet().
containsKey in interface Char2ReferenceMapcontainsKey in class AbstractChar2ReferenceMappublic int size()
size in interface Mappublic boolean isEmpty()
isEmpty in interface MapisEmpty in class AbstractChar2ReferenceMappublic Object get(char k)
Char2ReferenceMap
get in interface Char2ReferenceMapk - the key.
Map.get(Object)public Object get(Object ok)
AbstractChar2ReferenceMapnull 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 AbstractChar2ReferenceMappublic char firstCharKey()
firstCharKey in interface Char2ReferenceSortedMapSortedMap.firstKey()public char lastCharKey()
lastCharKey in interface Char2ReferenceSortedMapSortedMap.lastKey()public Object firstKey()
AbstractChar2ReferenceSortedMap
firstKey in interface SortedMapfirstKey in class AbstractChar2ReferenceSortedMappublic Object lastKey()
AbstractChar2ReferenceSortedMap
lastKey in interface SortedMaplastKey in class AbstractChar2ReferenceSortedMappublic 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 AbstractChar2ReferenceSortedMappublic 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 AbstractChar2ReferenceMappublic Comparator comparator()
comparator in interface SortedMappublic Char2ReferenceSortedMap headMap(char to)
headMap in interface Char2ReferenceSortedMapSortedMap.headMap(Object)public Char2ReferenceSortedMap tailMap(char from)
tailMap in interface Char2ReferenceSortedMapSortedMap.tailMap(Object)
public Char2ReferenceSortedMap subMap(char from,
char to)
subMap in interface Char2ReferenceSortedMapSortedMap.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 | |||||||||