I just added this feature to Guava, see here for the Javadoc. Edit: usage example of Multisets.copyHighestCountFirst() as per the original question: Multiset<DeviceType> histogram = getDeviceStats(); for (DeviceType type : Multisets.copyHighestCountFirst(histogram).elementSet()) { System.out.println(type + “: ” + histogram.count(type)); }
There isn’t. See Python’s standard library – is there a module for balanced binary tree? for a general discussion of the equivalents of C++ tree containers (map, set, multimap, multiset) in Python. The closest I can think of is to use a dictionary mapping integers to counts (also integers). However this doesn’t get you the … Read more
Some use cases: multimap With ZIP code as a key, all people which have that ZIP code With account ID as key, all open orders of that person/account A dictionary, with per keyword various explanations multiset is in essence a map with a key and a integer count. The inventory of a shop, all products … Read more
auto itr = my_multiset.find(value); if(itr!=my_multiset.end()){ my_multiset.erase(itr); } I would imagine there is a cleaner way of accomplishing the same. But this gets the job done.