Find keep duplicates in Ruby hashes

问题:

I have an array of hashes where I need to find and store matches based on one matching value between the hashes.

a = [{:id => 1, :name => "Jim", :email => "[e-mail]"}, 
     {:id => 2, :name => "Paul", :email => "[e-mail]"}, 
     {:id => 3, :name => "Tom", :email => "[e-mail]"}, 
     {:id => 1, :name => "Jim", :email => "[e-mail]"}, 
     {:id => 5, :name => "Tom", :email => "[e-mail]"}, 
     {:id => 6, :name => "Jim", :email => "[e-mail]"}]

So I would want to return

b = [{:id => 1, :name => "Jim", :email => "[e-mail]"},  
     {:id => 3, :name => "Tom", :email => "[e-mail]"}, 
     {:id => 5, :name => "Tom", :email => "[e-mail]"}, 
     {:id => 6, :name => "Jim", :email => "[e-mail]"}]

Notes: I can sort the data (csv) by :name after the fact so they don't have to be nicely grouped, just accurate. Also it's not necessary two of the same, it could be 3 or 10 or more.

Also, the data is about 22,000 rows.

回答1:

I tested this and it will do exactly what you want:

b = a.group_by { |h| h[:name] }.values.select { |a| a.size > 1 }.flatten

However, you might want to look at some of the intermediate objects produced in that calculation and see if those are more useful to you.