Java中的分段LRU Cache

import java.util.LinkedHashMap;
import java.util.Map;

class SegmentedLRUCache<K, V> {
    private final int segmentCount;
    private final Map<K, V>[] segments;

    public SegmentedLRUCache(int segmentCount, int capacityPerSegment) {
        this.segmentCount = segmentCount;
        this.segments = new LinkedHashMap[segmentCount];
        for (int i = 0; i < segmentCount; i++) {
            segments[i] = new LinkedHashMap<K, V>(capacityPerSegment, 0.75f, true) {
                protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
                    return size() > capacityPerSegment;
                }
            };
        }
    }

    private int getSegmentIndex(K key) {
        return Math.abs(key.hashCode()) % segmentCount;
    }

    public V get(K key) {
        int index = getSegmentIndex(key);
        return segments[index].get(key);
    }

    public void put(K key, V value) {
        int index = getSegmentIndex(key);
        segments[index].put(key, value);
    }

    public void remove(K key) {
        int index = getSegmentIndex(key);
        segments[index].remove(key);
    }
}