|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.bytes.AbstractByte2ShortMap
it.unimi.dsi.fastutil.bytes.Byte2ShortMaps.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.bytes.AbstractByte2ShortMap |
AbstractByte2ShortMap.BasicEntry |
| Nested classes inherited from class it.unimi.dsi.fastutil.bytes.Byte2ShortMap |
Byte2ShortMap.Entry |
| Field Summary | |
static long |
serialVersionUID
|
| Method Summary | |
void |
clear()
|
Object |
clone()
|
boolean |
containsKey(byte k)
Checks whether the given value is contained in keySet(). |
boolean |
containsKey(Object ok)
|
boolean |
containsValue(Object ov)
|
boolean |
containsValue(short v)
Checks whether the given value is contained in values(). |
short |
defaultReturnValue()
Gets the default return value. |
void |
defaultReturnValue(short defRetValue)
Sets the default return value. |
Set |
entrySet()
|
short |
get(byte 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. |
short |
put(byte k,
short 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.bytes.AbstractByte2ShortMap |
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 short put(byte k,
short v)
Byte2ShortMap
put in interface Byte2ShortMapput in class AbstractByte2ShortMappublic Object get(Object ok)
AbstractByte2ShortMapnull 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 AbstractByte2ShortMappublic boolean containsKey(byte k)
AbstractByte2ShortMapAbstractByte2ShortMap.keySet().
containsKey in interface Byte2ShortMapcontainsKey in class AbstractByte2ShortMappublic boolean containsValue(short v)
AbstractByte2ShortMapAbstractByte2ShortMap.values().
containsValue in interface Byte2ShortMapcontainsValue in class AbstractByte2ShortMappublic short defaultReturnValue()
Byte2ShortMap
defaultReturnValue in interface Byte2ShortMapdefaultReturnValue in class AbstractByte2ShortMappublic void defaultReturnValue(short defRetValue)
Byte2ShortMapget(), 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 Byte2ShortMapdefaultReturnValue in class AbstractByte2ShortMappublic void putAll(Map m)
AbstractByte2ShortMap
putAll in interface MapputAll in class AbstractByte2ShortMapm - a map.public Set entrySet()
entrySet in interface Mappublic Set keySet()
AbstractByte2ShortMapThe 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 AbstractByte2ShortMappublic Collection values()
AbstractByte2ShortMapThe 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 AbstractByte2ShortMap
public Object put(Object k,
Object v)
AbstractByte2ShortMapnull 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 AbstractByte2ShortMappublic short get(byte k)
Byte2ShortMap
get in interface Byte2ShortMapk - the key.
Map.get(Object)public boolean containsKey(Object ok)
containsKey in interface MapcontainsKey in class AbstractByte2ShortMappublic boolean containsValue(Object ov)
containsValue in interface MapcontainsValue in class AbstractByte2ShortMappublic int size()
size in interface Mappublic void clear()
clear in interface Mapclear in class AbstractByte2ShortMappublic Object clone()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||