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