From: "Iñaki Baz Castillo" Date: 2011-06-22T18:45:41+09:00 Subject: Re: How to order a hash based on its keys? 2011/6/22 Anurag Priyam : >> the same class. In my tests rbtree is better for deleting elements but >> worse than a Hash for inserting them. > > Since we are talking about performance benchmarks too, Ruby 1.9's > ordered hashes also exhibit faster reads than writes. > > [1]: http://www.igvita.com/2009/02/04/ruby-19-internals-ordered-hash/ My benchmark was tested using Ruby 1.9 ;) -- Iñaki Baz Castillo