LRUCache

package common;

import java.util.LinkedHashMap;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

/**
 *
 * @Title: LRUCache.java
 * @Copyright: Copyright (c) 2011
 * @Description: <br>LRUCache 本地缓存
 *               <br>
 * @Company: renren.com
 * @Created on 2014-1-14 下午1:25:55
 * @author youle.heng
 */
public class LRUCache <K, V> extends LinkedHashMap<K, V> {
   
    private static final long serialVersionUID = -8021134033779621716L;

    private final int maxCapacity;

    private static final float DEFAULT_LOAD_FACTOR = 0.75f;

    private final Lock lock = new ReentrantLock();

    public LRUCache(int maxCapacity) {
        super(maxCapacity, DEFAULT_LOAD_FACTOR, true);
        this.maxCapacity = maxCapacity;
    }

    @Override
    protected boolean removeEldestEntry(java.util.Map.Entry<K, V> eldest) {
        return size() > maxCapacity;
    }

    /**
     * Weather contains someone Object according to a key
     * @param key
     */
    @Override
    public boolean containsKey(Object key) {
        lock.lock();
        try {
            return super.containsKey(key);
        } finally {
            lock.unlock();
        }
    }

    /**
     * Get one Object according to a key
     * @param key
     */
    @Override
    public V get(Object key) {
        lock.lock();
        try {
            return super.get(key);
        } finally {
            lock.unlock();
        }
    }

    /**
     * Put an Object to cache
     * @param key,value
     */
    @Override
    public V put(K key, V value) {
        lock.lock();
        try {
            return super.put(key, value);
        } finally {
            lock.unlock();
        }
    }

    /**
     * The cache's size
     */
    public int size() {
        lock.lock();
        try {
            return super.size();
        } finally {
            lock.unlock();
        }
    }

    /**
     * clear the cache
     */
    public void clear() {
        lock.lock();
        try {
            super.clear();
        } finally {
            lock.unlock();
        }
    }

    /**
     * Delete one Object from cache
     *
     * @param key
     */
    public void delete(Object key) {
        lock.lock();
        try {
            super.remove(key);
        } finally {
            lock.unlock();
        }
    }

}

new 一个能存储50个值的LRUCache对象

LRUCache<String,String> mc = new LRUCache<String,String>(50); 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值