!7

// by default, elements are put to front when added
// (not when accessed)
sclass MRUCache<A, B> extends LinkedHashMap<A, B> {
  int maxSize = 10;

  *() {}
  *(int *maxSize) {}
  
  protected bool removeEldestEntry(Map.Entry eldest) {
    ret size() > maxSize;
  }
}

p {
  MRUCache<S, Int> cache = new(100);
  L<S> words = words2(loadSnippet(#1008407));
  print(n(words, "words"));
  for (S word : words)
    cache.put(word, toInt(cache.get(word))+1);
  pnl(cache);
}