|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectmondrian.rolap.cache.HardSmartCache<K,V>
public class HardSmartCache<K,V>
An implementation of SmartCache that uses hard
references. Used for testing.
| Field Summary | |
|---|---|
(package private) java.util.Map<K,V> |
cache
|
| Constructor Summary | |
|---|---|
HardSmartCache()
|
|
| Method Summary | |
|---|---|
void |
clear()
|
V |
get(K key)
|
java.util.Iterator<java.util.Map.Entry<K,V>> |
iterator()
|
V |
put(K key,
V value)
Places a key/value pair into the queue. |
int |
size()
|
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
java.util.Map<K,V> cache
| Constructor Detail |
|---|
public HardSmartCache()
| Method Detail |
|---|
public V put(K key,
V value)
SmartCache
put in interface SmartCache<K,V>key - Keyvalue - Value
key or nullpublic V get(K key)
get in interface SmartCache<K,V>public void clear()
clear in interface SmartCache<K,V>public int size()
size in interface SmartCache<K,V>public java.util.Iterator<java.util.Map.Entry<K,V>> iterator()
iterator in interface java.lang.Iterable<java.util.Map.Entry<K,V>>
|
|
||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||