From: Hal Fulton <hal9000@...>
Date: 2006-08-15T09:06:44+09:00
Subject: Re: A use case for an ordered hash

Austin Ziegler wrote:
> On 8/14/06, Martin DeMello <martindemello@gmail.com> wrote:
> 
>> OHash or Assoc or even Dict (though the latter at least implies an 
>> O(1) lookup).
> 
> 
> Wouldn't it be the same as Hash lookup? It's still got every other
> characteristic of a Hash; it just guarantees an order that defaults to
> insertion order.

OHash lookup should be as fast as Hash lookup.

Insertion would be slightly slower, and iteration (and to_a) would
be slowed down more.


Hal