构建高效可申缩的结果缓存

public interface Computable<A, V> {
    V comput(A arg);
}

import java.util.concurrent.*;

/**
 * 构建高效可申缩的结果缓存
 * <p>
 * author: shiruiqiang
 * time: 31/01/2017 23:11
 **/
public class Memoizer<A, V> implements Computable<A, V>{
    private final ConcurrentHashMap<A, Future<V>> cache = new ConcurrentHashMap<A, Future<V>>();
    private Computable<A, V> c;
    public Memoizer(Computable c) {
        this.c = c;
    }
    public V comput(A arg) {
        while(true) {
            Future<V> f = cache.get(arg);
            if (f == null) { // 检查是否已经开始计算
                Callable<V> task = new Callable<V>() {
                    @Override
                    public V call() throws Exception {
                        return c.comput(arg);
                    }
                };
                FutureTask<V> ft = new FutureTask(task);
                f = cache.putIfAbsent(arg, ft); // 原子操作,不会重复计算
                if (f == null) {
                    f = ft;
                    ft.run();
                }
            }
            try {
                f.get(); // 阻塞,等待结果.如果已经在缓存中则不会阻塞
            } catch(CancellationException e) {
                cache.remove(arg, f);
            } catch (Exception e) {
                e.printStackTrace();
            }
        }
    }
}