|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.shorts.AbstractShort2LongMap
it.unimi.dsi.fastutil.shorts.Short2LongMaps.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.shorts.AbstractShort2LongMap |
AbstractShort2LongMap.BasicEntry |
| Nested classes inherited from class it.unimi.dsi.fastutil.shorts.Short2LongMap |
Short2LongMap.Entry |
| Field Summary | |
static long |
serialVersionUID
|
| Method Summary | |
void |
clear()
|
Object |
clone()
|
boolean |
containsKey(Object ok)
|
boolean |
containsKey(short k)
Checks whether the given value is contained in keySet(). |
boolean |
containsValue(long v)
Checks whether the given value is contained in values(). |
boolean |
containsValue(Object ov)
|
long |
defaultReturnValue()
Gets the default return value. |
void |
defaultReturnValue(long 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.
|
long |
get(short 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. |
Object |
put(Object k,
Object v)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
long |
put(short k,
long v)
Adds a pair to the map. |
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.shorts.AbstractShort2LongMap |
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 long put(short k,
long v)
Short2LongMap
put in interface Short2LongMapput in class AbstractShort2LongMappublic Object get(Object ok)
AbstractShort2LongMapnull 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 AbstractShort2LongMappublic boolean containsKey(short k)
AbstractShort2LongMapAbstractShort2LongMap.keySet().
containsKey in interface Short2LongMapcontainsKey in class AbstractShort2LongMappublic boolean containsValue(long v)
AbstractShort2LongMapAbstractShort2LongMap.values().
containsValue in interface Short2LongMapcontainsValue in class AbstractShort2LongMappublic long defaultReturnValue()
Short2LongMap
defaultReturnValue in interface Short2LongMapdefaultReturnValue in class AbstractShort2LongMappublic void defaultReturnValue(long defRetValue)
Short2LongMapget(), 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 Short2LongMapdefaultReturnValue in class AbstractShort2LongMappublic void putAll(Map m)
AbstractShort2LongMap
putAll in interface MapputAll in class AbstractShort2LongMapm - a map.public Set entrySet()
entrySet in interface Mappublic Set keySet()
AbstractShort2LongMapThe 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 AbstractShort2LongMappublic Collection values()
AbstractShort2LongMapThe 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 AbstractShort2LongMap
public Object put(Object k,
Object v)
AbstractShort2LongMapnull 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 AbstractShort2LongMappublic long get(short k)
Short2LongMap
get in interface Short2LongMapk - the key.
Map.get(Object)public boolean containsKey(Object ok)
containsKey in interface MapcontainsKey in class AbstractShort2LongMappublic boolean containsValue(Object ov)
containsValue in interface MapcontainsValue in class AbstractShort2LongMappublic int size()
size in interface Mappublic void clear()
clear in interface Mapclear in class AbstractShort2LongMappublic Object clone()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||