|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractObject2ByteMap
it.unimi.dsi.fastutil.objects.Object2ByteMaps.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.AbstractObject2ByteMap |
AbstractObject2ByteMap.BasicEntry |
Nested classes inherited from class it.unimi.dsi.fastutil.objects.Object2ByteMap |
Object2ByteMap.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(byte v)
Checks whether the given value is contained in values() . |
boolean |
containsValue(Object ov)
|
byte |
defaultReturnValue()
Gets the default return value. |
void |
defaultReturnValue(byte 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.
|
byte |
getByte(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. |
byte |
put(Object k,
byte 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.AbstractObject2ByteMap |
equals, getDefRetValue, hashCode, isEmpty, remove, removeByte, 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 byte put(Object k, byte v)
Object2ByteMap
put
in interface Object2ByteMap
put
in class AbstractObject2ByteMap
public Object get(Object ok)
AbstractObject2ByteMap
null
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 Map
get
in class AbstractObject2ByteMap
public boolean containsKey(Object k)
AbstractObject2ByteMap
AbstractObject2ByteMap.keySet()
.
containsKey
in interface Map
containsKey
in class AbstractObject2ByteMap
public boolean containsValue(byte v)
AbstractObject2ByteMap
AbstractObject2ByteMap.values()
.
containsValue
in interface Object2ByteMap
containsValue
in class AbstractObject2ByteMap
public byte defaultReturnValue()
Object2ByteMap
defaultReturnValue
in interface Object2ByteMap
defaultReturnValue
in class AbstractObject2ByteMap
public void defaultReturnValue(byte defRetValue)
Object2ByteMap
get()
, 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 Object2ByteMap
defaultReturnValue
in class AbstractObject2ByteMap
public void putAll(Map m)
AbstractObject2ByteMap
putAll
in interface Map
putAll
in class AbstractObject2ByteMap
m
- a map.public Set entrySet()
entrySet
in interface Map
public Set keySet()
AbstractObject2ByteMap
The 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 Map
keySet
in class AbstractObject2ByteMap
public Collection values()
AbstractObject2ByteMap
The 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 Map
values
in class AbstractObject2ByteMap
public Object put(Object k, Object v)
AbstractObject2ByteMap
null
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 Map
put
in class AbstractObject2ByteMap
public boolean containsValue(Object ov)
containsValue
in interface Map
containsValue
in class AbstractObject2ByteMap
public byte getByte(Object k)
Object2ByteMap
getByte
in interface Object2ByteMap
k
- the key.
Map.get(Object)
public int size()
size
in interface Map
public void clear()
clear
in interface Map
clear
in class AbstractObject2ByteMap
public Object clone()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |