| java.lang.Object
 de.odysseus.el.tree.impl.Cache
| Cache | | final public class Cache implements TreeCache(Code) | | Simple (thread-safe) LRU cache.
After the cache size reached a certain limit, the least recently used entry is removed,
when adding a new entry.
author:
Christoph Beck |
| Constructor Summary | |
| public | Cache(int size)
Constructor. | | public | Cache(int size, Map<String, Tree> secondary)
Constructor. |
| Cache | | public Cache(int size)(Code) | | Constructor.
Use a
WeakHashMap as secondary map.
Parameters:
size - maximum primary cache size |
| Cache | | public Cache(int size, Map<String, Tree> secondary)(Code) | | Constructor.
If the least recently used entry is removed from the primary cache, it is added to
the secondary map.
Parameters:
size - maximum primary cache size
Parameters:
secondary - the secondary map (may be null) |
|
|