From: "Mladen Jablanović" <jablan@...>
Date: 2009-07-30T00:15:05+09:00
Subject: Re: Indexing hash with longer strings faster?

You pointed to the right direction here!

Although your example gives me 100 as result (all the hashes are
unique), here's what suggests that hash collision indeed is the reason
of the slowness:

>> [*0..99].map{|i| [*0..99].map{|j| [i.to_s,j.to_s].hash}}.flatten.uniq.size
=> 1756
>> [*0..99].map{|i| [*0..99].map{|j| [i.to_s + '00000',j.to_s + '00000'].hash}}.flatten.uniq.size
=> 10000

Can you please just post the ruby 1.9 results here?

Thanks!