|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface Cache<K,V>
A Cache
is a collection of values that are indexed by keys and that are stored for an
unspecified amount of time (which the implementor of Cache
may further specify).
Method Summary | |
---|---|
void |
clear()
Remove all values stored in this cache. |
V |
get(K key)
If key was used in a previous call to put , this call may
return the value of that call. |
int |
getCapacity()
Returns the maximum number of elements the cache can hold. |
int |
getSize()
Returns the current size of the cache. |
V |
put(K key,
V value)
Store value in the cache, indexed by key. |
V |
remove(K key)
Removes the object associated with key and returns that object. |
int |
setCapacity(int capacity)
Set the maximum number of elements the cache can hold. |
Collection<V> |
values()
|
Method Detail |
---|
V put(K key, V value)
get
with the
same (equal
) key will retrieve the same (==
) value.
Multiple calls to put
with the same key and value
are idempotent. A set of calls to put
with the same key but
different values has only the affect of the last call (assuming there were
no intervening calls to get
).
key
- keyvalue
- value
V get(K key)
put
, this call may
return the value of that call. Otherwise it returns null
.
key
- key
V remove(K key)
key
- key
int getCapacity()
int setCapacity(int capacity)
capacity
- capacity
int getSize()
void clear()
get
will return null
.
Collection<V> values()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |