|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractReference2IntMap
it.unimi.dsi.fastutil.objects.Reference2IntMaps.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.objects.AbstractReference2IntMap |
AbstractReference2IntMap.BasicEntry |
| Nested classes inherited from class it.unimi.dsi.fastutil.objects.Reference2IntMap |
Reference2IntMap.Entry |
| Field Summary | |
static long |
serialVersionUID
|
| Method Summary | |
void |
clear()
|
Object |
clone()
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in keySet(). |
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()
|
Object |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
int |
getInt(Object k)
Returns the value to which the given key is mapped. |
Set |
keySet()
Returns a type-specific-set view of the keys of this map. |
int |
put(Object 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.objects.AbstractReference2IntMap |
equals, getDefRetValue, hashCode, isEmpty, remove, removeInt, 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(Object k,
int v)
Reference2IntMap
put in interface Reference2IntMapput in class AbstractReference2IntMappublic Object get(Object ok)
AbstractReference2IntMapnull 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 AbstractReference2IntMappublic boolean containsKey(Object k)
AbstractReference2IntMapAbstractReference2IntMap.keySet().
containsKey in interface MapcontainsKey in class AbstractReference2IntMappublic boolean containsValue(int v)
AbstractReference2IntMapAbstractReference2IntMap.values().
containsValue in interface Reference2IntMapcontainsValue in class AbstractReference2IntMappublic int defaultReturnValue()
Reference2IntMap
defaultReturnValue in interface Reference2IntMapdefaultReturnValue in class AbstractReference2IntMappublic void defaultReturnValue(int defRetValue)
Reference2IntMapget(), 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 Reference2IntMapdefaultReturnValue in class AbstractReference2IntMappublic void putAll(Map m)
AbstractReference2IntMap
putAll in interface MapputAll in class AbstractReference2IntMapm - a map.public Set entrySet()
entrySet in interface Mappublic Set keySet()
AbstractReference2IntMapThe 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 AbstractReference2IntMappublic Collection values()
AbstractReference2IntMapThe 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 AbstractReference2IntMap
public Object put(Object k,
Object v)
AbstractReference2IntMapnull 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 AbstractReference2IntMappublic boolean containsValue(Object ov)
containsValue in interface MapcontainsValue in class AbstractReference2IntMappublic int getInt(Object k)
Reference2IntMap
getInt in interface Reference2IntMapk - the key.
Map.get(Object)public int size()
size in interface Mappublic void clear()
clear in interface Mapclear in class AbstractReference2IntMappublic Object clone()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||