|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.chars.AbstractChar2IntMap
it.unimi.dsi.fastutil.chars.Char2IntMaps.EmptyMap
An immutable class representing an empty type-specific map.
This class may be useful to implement your own in case you subclass a type-specific map.
| Nested Class Summary |
| Nested classes inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2IntMap |
AbstractChar2IntMap.BasicEntry |
| Nested classes inherited from class it.unimi.dsi.fastutil.chars.Char2IntMap |
Char2IntMap.Entry |
| Field Summary | |
static long |
serialVersionUID
|
| Method Summary | |
void |
clear()
|
Object |
clone()
|
boolean |
containsKey(char k)
Checks whether the given value is contained in keySet(). |
boolean |
containsKey(Object ok)
|
boolean |
containsValue(int v)
Checks whether the given value is contained in values(). |
boolean |
containsValue(Object ov)
|
int |
defaultReturnValue()
Gets the default return value. |
void |
defaultReturnValue(int defRetValue)
Sets the default return value. |
Set |
entrySet()
|
int |
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.
|
Set |
keySet()
Returns a type-specific-set view of the keys of this map. |
int |
put(char k,
int v)
Adds a pair to the map. |
Object |
put(Object k,
Object v)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
void |
putAll(Map m)
Puts all pairs in the given map. |
int |
size()
|
Collection |
values()
Returns a type-specific-set view of the values of this map. |
| Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2IntMap |
equals, getDefRetValue, hashCode, isEmpty, remove, remove, setDefRetValue, toString |
| Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
| Field Detail |
public static final long serialVersionUID
| Method Detail |
public int put(char k,
int v)
Char2IntMap
put in interface Char2IntMapput in class AbstractChar2IntMappublic Object get(Object ok)
AbstractChar2IntMapnull 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 AbstractChar2IntMappublic boolean containsKey(char k)
AbstractChar2IntMapAbstractChar2IntMap.keySet().
containsKey in interface Char2IntMapcontainsKey in class AbstractChar2IntMappublic boolean containsValue(int v)
AbstractChar2IntMapAbstractChar2IntMap.values().
containsValue in interface Char2IntMapcontainsValue in class AbstractChar2IntMappublic int defaultReturnValue()
Char2IntMap
defaultReturnValue in interface Char2IntMapdefaultReturnValue in class AbstractChar2IntMappublic void defaultReturnValue(int defRetValue)
Char2IntMapget(), put() and remove() to
denote that the map does not contain the specified key. It must be
0/false/null by default.
defaultReturnValue in interface Char2IntMapdefaultReturnValue in class AbstractChar2IntMappublic void putAll(Map m)
AbstractChar2IntMap
putAll in interface MapputAll in class AbstractChar2IntMapm - a map.public Set entrySet()
entrySet in interface Mappublic Set keySet()
AbstractChar2IntMapThe view is backed by the set returned by Map.entrySet(). Note that
no attempt is made at caching the result of this method, as this would
require adding some attributes that lightweight implementations would
not need. Subclasses may easily override this policy by calling
this method and caching the result, but implementors are encouraged to
write more efficient ad-hoc implementations.
keySet in interface MapkeySet in class AbstractChar2IntMappublic Collection values()
AbstractChar2IntMapThe view is backed by the set returned by Map.entrySet(). Note that
no attempt is made at caching the result of this method, as this would
require adding some attributes that lightweight implementations would
not need. Subclasses may easily override this policy by calling
this method and caching the result, but implementors are encouraged to
write more efficient ad-hoc implementations.
values in interface Mapvalues in class AbstractChar2IntMap
public Object put(Object k,
Object v)
AbstractChar2IntMapnull 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 AbstractChar2IntMappublic int get(char k)
Char2IntMap
get in interface Char2IntMapk - the key.
Map.get(Object)public boolean containsKey(Object ok)
containsKey in interface MapcontainsKey in class AbstractChar2IntMappublic boolean containsValue(Object ov)
containsValue in interface MapcontainsValue in class AbstractChar2IntMappublic int size()
size in interface Mappublic void clear()
clear in interface Mapclear in class AbstractChar2IntMappublic Object clone()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||