// uses HashMap by default
static class MultiSet<A> {
  Map<A, Integer> map = new HashMap;
  
  public MultiSet(bool useTreeMap) {
    if (useTreeMap)
      map = new TreeMap;
  }
  
  public MultiSet() {
  }
  
  public MultiSet(Collection<A> c) {
    addAll(c);
  }

  public void add(A key) {
    add(key, 1);
  }
  
  public void addAll(Collection<A> c) {
    if (c != null) for (A a : c)
      add(a);
  }

  void addAll(MultiSet<A> ms) {
    for (A a : ms.keySet())
      add(a, ms.get(a));
  }
  
  public void add(A key, int count) {
    if (map.containsKey(key))
      map.put(key, map.get(key)+count);
    else
      map.put(key, count);
  }

  public int get(A key) {
    return key != null && map.containsKey(key) ? map.get(key) : 0;
  }
  
  public bool contains(A key) {
    ret map.containsKey(key);
  }

  public void remove(A key) {
    Integer i = map.get(key);
    if (i != null && i > 1)
      map.put(key, i - 1);
    else
      map.remove(key);
  }

  public List<A> topTen() { ret getTopTen(); }
  
  public List<A> getTopTen() { ret getTopTen(10); }
  public List<A> getTopTen(int maxSize) {
    List<A> list = getSortedListDescending();
    return list.size() > maxSize ? list.subList(0, maxSize) : list;
  }
  
  List<A> highestFirst() {
    ret getSortedListDescending();
  }

  List<A> lowestFirst() {
    ret reversedList(getSortedListDescending());
  }

  public List<A> getSortedListDescending() {
    List<A> list = new ArrayList<A>(map.keySet());
    Collections.sort(list, new Comparator<A>() {
      public int compare(A a, A b) {
        return map.get(b).compareTo(map.get(a));
      }
    });
    return list;
  }

  public int getNumberOfUniqueElements() {
    return map.size();
  }
  
  int uniqueSize() {
    ret map.size();
  }

  public Set<A> asSet() {
    return map.keySet();
  }

  Set<A> keySet() { // synonym for idiots
    return map.keySet();
  }
  
  public A getMostPopularEntry() {
    int max = 0;
    A a = null;
    for (Map.Entry<A,Integer> entry : map.entrySet()) {
      if (entry.getValue() > max) {
        max = entry.getValue();
        a = entry.getKey();
      }
    }
    return a;
  }

  public void removeAll(A key) {
    map.remove(key);
  }

  public int size() {
    int size = 0;
    for (int i : map.values())
      size += i;
    return size;
  }

  public MultiSet<A> mergeWith(MultiSet<A> set) {
    MultiSet<A> result = new MultiSet<A>();
    for (A a : set.asSet()) {
      result.add(a, set.get(a));
    }
    return result;
  }
  
  public boolean isEmpty() {
    return map.isEmpty();
  }
  
  public String toString() {
    return str(map);
  }
  
  public void clear() {
    map.clear();
  }
  
  Map<A, Int> asMap() {
    ret cloneMap(map);
  }
}