sclass MultiSetAndTopTen<A> {

  int maxEntries = 100000, topTenTargetLength = 10;

  Map<A, Long> ms;

  L<A> topTen;

  *() {}

  *(Map<A, Long> *ms, L<A> *topTen) {}

  void add(A a) {

    long count = longMultiSet_add(ms, a);

    insertToTopTen(a, count);

    if (l(ms) >= maxEntries)

      longMultiSet_dropBottomPart(ms, l(ms)-iround(maxEntries*0.9));

  }

  void insertToTopTen(A a, long count) {

    int originalIndex = indexOf(topTen, a);

    int i = originalIndex < 0 ? l(topTen) : originalIndex;

    while (i > 0 && count >= toLong(ms.get(topTen.get(i-1))))

      --i;

    if (i >= topTenTargetLength || i == originalIndex) ret;

    if (originalIndex >= 0) topTen.remove(originalIndex);

    topTen.add(i, a);

    truncateList(topTen, topTenTargetLength);

  }

  void printTopTen {

    printAsciiHeading("TOP TEN (OF " + l(ms) + ")");

    pnl(map(topTen, func(S s) { s + " - " + ms.get(s) }));

  }

  void newTopTen(int size) {

    topTenTargetLength = size;

    replaceCollection(topTen, takeFirst(size, sortByDescScore(keys(ms), ms)));

  }

}