From: Martin DeMello <martindemello@...>
Date: 2006-08-15T01:15:09+09:00
Subject: Re: A use case for an ordered hash

On 8/14/06, Austin Ziegler <halostatue@gmail.com> 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.

True, I suppose you could do it with a doubly linked list overlaid on
a hash. Was thinking of sorted order.

martin