| Java Source Code / Java Documentation » Cache » OSCache » com.opensymphony.oscache.base.algorithm |
| com.opensymphony.oscache.base.algorithm | ||
Provides the classes that implement the caching algorithms used by OSCache, all of
which are based on a derivative of Doug Lea's ConcurrentReaderHashMap.
Package SpecificationRelated DocumentationFor overviews, tutorials, examples, guides, and tool documentation, please see: For further information on Doug Lea's concurrency package, please see: | ||
| Java Source File Name | Type | Comment |
| AbstractConcurrentReadCache.java | Class | A version of Hashtable that supports mostly-concurrent reading, but exclusive writing. Because reads are not limited to periods without writes, a concurrent reader policy is weaker than a classic reader/writer policy, but is generally faster and allows more concurrency. |
| FIFOCache.java | Class | FIFO (First In First Out) based queue algorithm for the cache. |
| LRUCache.java | Class | LRU (Least Recently Used) algorithm for the cache. Since release 2.3 this class requires Java 1.4
to use the |
| TestAbstractCache.java | Class | Test class for the AbstractCache class. |
| TestCompleteAlgorithm.java | Class | Test class for the com.opensymphony.oscache.base.algorithm package. |
| TestFIFOCache.java | Class | Test class for the FIFOCache class. |
| TestLRUCache.java | Class | Test class for the LRUCache class. |
| TestQueueCache.java | Class | Test class for the QueueCache class, which is the base class for FIFO and LIFO algorithm classes. |
| TestUnlimitedCache.java | Class | Test class for the Unlimited cache algorithm. |
| UnlimitedCache.java | Class | A simple unlimited cache that has no upper bound to the number of cache entries it can contain. |