I have a Hash like this
{ 55 => {:value=>61, :rating=>-147},
89 => {:value=>72, :rating=>-175},
78 => {:value=>64, :rating=>-155},
84 => {:value=>90, :rating=>-220},
95 => {:value=>39, :rating=>-92},
46 => {:value=>97, :rating=>-237},
52 => {:value=>73, :rating=>-177},
64 => {:value=>69, :rating=>-167},
86 => {:value=>68, :rating=>-165},
53 => {:value=>20, :rating=>-45}
}
How can i sort it by :rating? Or maybe i should use some different structure?
Hashes in Ruby can't be sorted (at least not before 1.9)
This means that looping through a Hash won't necessarily yield the information in the right order for you. However, it's trivial to loop through Hashed data in a particular order by converting it to an Array first, and in fact calling the sort methods on a Hash will convert it into an Array for you:
So in your case:
I would change the data structure to an array of hashes:
You can sort this kind of structure easily with
To get the hash-like functionality of fetching a record by id you can define a new method on my_array:
so after that you can do
instead of
There might be a better data structure, but (I'm assuming this is ruby) it's possible to do in Ruby by using the inline sort style to basically tell it how to compare the two. Here's a concrete example: