1. | A LRU (Least Recently Used) cache replacement policy | | |
2. | A Map that is size-limited using an LRU algorithm | | |
3. | A random cache replacement policy | | |
4. | A second chance FIFO (First In First Out) cache replacement policy | | |
5. | An LRU (Least Recently Used) cache replacement policy | | |
6. | Async LRU List | | |
7. | FIFO First In First Out cache replacement policy | | |
8. | Implementation of a Least Recently Used cache policy | | |
9. | Generic LRU Cache | | |
|
10. | LRU Cache | | |
11. | A Least Recently Used Cache | | |
12. | The class that implements a simple LRU cache | | |
13. | Map implementation for cache usage | | |
14. | Weak Cache Map | | |
15. | Provider for the application cache directories. | | |
16. | Fixed length cache with a LRU replacement policy. | | |
17. | A small LRU object cache. | | |
18. | A least recently used (LRU) cache. | | |
19. | LRU Cache 2 | | |
20. | A cache that purges values according to their frequency and recency of use and other qualitative values. | | |
21. | A thread-safe cache that keeps its values as java.lang.ref.SoftReference so that the cache is, in effect, managed by the JVM and kept as small as is required | | |
22. | Cache LRU | | |
23. | A FastCache is a map implemented with soft references, optimistic copy-on-write updates, and approximate count-based pruning. | | |
24. | A HardFastCache is a map implemented with hard references, optimistic copy-on-write updates, and approximate count-based pruning. | | |