Robert Dober wrote:
> On 8/15/06, Hal Fulton <hal9000 / hypermetrics.com> wrote:
>>
>> OHash lookup should be as fast as Hash lookup.
>>
>> Insertion would be slightly slower,
> 
> Not necessarily
> that was why I suggested an
> OrderedHash (where insertion would not be slower )
> and a
> SortedHash (where indeed insertion would be slower)
> 
> and iteration (and to_a) would
> 
>> be slowed down more.

I meant an ordered hash would be slowed down simply
because you are storing an extra piece of information.



Hal