LRU策略的CachePool

最新推荐文章于 2025-06-02 17:26:43 发布

原创最新推荐文章于 2025-06-02 17:26:43 发布 · 631 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java #lru

java 专栏收录该内容

18 篇文章

订阅专栏

本文介绍了一个使用Java实现的对象缓存池，支持FIFO和LRU两种淘汰策略。该缓存池通过LinkedHashMap来实现，并提供了基本的增删查改和清理操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >


public class ObjectCachePool<K, V> {
    public static final int FIFO_POLICY = 1;
    public static final int LRU_POLICY = 2;
    private static final int DEFAULT_SIZE = 10;
    private Map<K, V> cacheObjects;

    public ObjectCachePool() {
        this(DEFAULT_SIZE);
    }

    public ObjectCachePool(final int size) {
        this(size, FIFO_POLICY);
    }

    public ObjectCachePool(final int size, final int policy) {
        switch (policy) {
        case FIFO_POLICY:
            cacheObjects = new LinkedHashMap<K, V>(size) {
                private static final long serialVersionUID = 1L;

                protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
                    return size() > size;
                }
            };
            break;
        case LRU_POLICY:
            cacheObjects = new LinkedHashMap<K, V>(size, 0.75f, true) {
                private static final long serialVersionUID = 1L;

                protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
                    return size() > size;
                }
            };
            break;
        default:
            throw new IllegalArgumentException("Unknown policy: " + policy);
        }
    }

    public void put(K key, V value) {
        cacheObjects.put(key, value);
    }

    public V get(K key) {
        return cacheObjects.get(key);
    }

    public void remove(K key) {
        cacheObjects.remove(key);
    }

    public void clear() {
        cacheObjects.clear();
    }
}