I’ve been looking around for an implementation of a Multiset\/Bag in Ruby to ease the pain of recording some of our statistics.<\/p>\n\n\n\n
Some of the statistics we gather are most usefully stored as some form of “super” Set in which each unique element is stored together with a count of the number of times that element has occurred. These statistics are likely to have a large number of repeated elements, so this makes sense as it saves on space and processing.<\/p>\n\n\n\n
So, after an extensive search, I was surprised at the paucity of solutions for this problem.<\/p>\n\n\n\n
Eventually I hit upon<\/p>\n\n\n\n
http:\/\/maraigue.hhiro.net\/multiset\/index-en.php<\/a><\/p>\n\n\n\n It does exactly what I want, but I decided that I would add the following custom functions. These two functions return all the items in a Multiset with the highest\/lowest counts.<\/p>\n\n\n\n I’ve been looking around for an implementation of a Multiset\/Bag in Ruby to ease the pain of recording some of our statistics. Some of the statistics we gather are most usefully stored as some form of “super” Set in which … Continue reading class Multiset\n # Return all the items with the maximum count\n def max_values\n max_value = @items.values.max\n @items.select { |k, v| v == max_value }.map { |i| i[0] }\n end\n\n # Return all the items with the minimum count\n def min_values\n min_value = @items.values.min\n @items.select { |k, v| v == min_value }.map { |i| i[0] }\n end\nend<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"