在java中实现固定大小的hashMap

创建一个固定大小的hashMap

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

public class MaxSizeHashMap<K, V> extends LinkedHashMap<K, V> {
    private final int maxSize;

    public MaxSizeHashMap(int maxSize) {
        this.maxSize = maxSize;
    }


    //
    //Returns true if this map should remove its eldest entry. 
    //This method is invoked by put and putAll after inserting a new entry into the map. 
    //It provides the implementor with the opportunity to remove the eldest entry each time a new 
    //one is added. This is useful if the map represents a cache: 
    //    it allows the map to reduce memory consumption by deleting stale entries. 
    //
    @Override
    protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
        return size() > maxSize;
    }
}

使用

 	@Test
    public void testMaxSizeMap(){
        MaxSizeHashMap<String,String> map = new MaxSizeHashMap<>(10);
        for(int i=0;i<100;i++){
            map.put(""+i,""+i);
        }
        System.out.println(map.size());  //10  保留最后存入map的10个数据
    }

参考地址1:https://www.cnblogs.com/scottgu/p/4118428.html
参考地址2:https://blog.youkuaiyun.com/ClementAD/article/details/50596178