From: Nick Brown <nick@...>
Date: 2011-02-26T01:57:34+09:00
Subject: Are Hash speeds documented?

Are the lookup, insertion, deletion, and sort costs of Hash objects
documented anywhere? I would be interested in average-case
and worst-case times... are they linear, logarithmic, exponential, etc.
in time?

Also, is there a way to 'tune' hashes so that they use underlying
algorithms which are faster at, say, look-ups over inserts or
vice-versa? That would be killer.

-- 
Posted via http://www.ruby-forum.com/.