Lru simple cache

LruCache.java

//
// simple least recently used cache
//

import java.util.LinkedHashMap;
import java.util.*;

class LruCache {

  private LinkedHashMap cache = new LinkedHashMap<String, String>() {

    private int maxSizeEntries = 10000;

    @Override
    protected boolean removeEldestEntry(Map.Entry<String, String> eldest) {

      if (size() <= maxSizeEntries) {
        return false;
      }

      Iterator<Map.Entry<String, String>> it = entrySet().iterator();
      while (it.hasNext()) {
        if (size() <= maxSizeEntries) {
          return false;
        }

        it.next();
        it.remove();
      }

      return false;
    }

  };

}