map of fixed size (removes eldest by access elements)

FixedMapExample.java

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

class FixedMap<K,V> extends LinkedHashMap<K,V> {
    private int max_capacity;

    public FixedMap(int initial_capacity, int max_capacity) {
        super(initial_capacity, 0.75f, true);
        this.max_capacity = max_capacity;
    }

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

public class FixedMapExample {
	public static void main(String args[]) {
		int maxCapacity = 10;
		FixedMap fMap = new FixedMap(5,maxCapacity);
		for(int i = 0;i < maxCapacity + 5;i++) {
			fMap.put(i,i);
			System.out.println("accessing fMap.get(0): " + fMap.get(0));
		}
		System.out.println("map with fixed size: " + fMap);
	}
}