From: Austin Ziegler <halostatue@...>
Date: 2006-08-14T21:10:36+09:00
Subject: Re: A use case for an ordered hash

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.

-austin
-- 
Austin Ziegler * halostatue@gmail.com * http://www.halostatue.ca/
               * austin@halostatue.ca * http://www.halostatue.ca/feed/
               * austin@zieglers.ca