azrael / cream.org wrote:
> On Tue, Apr 04, 2006 at 11:13:47PM +0900, Dave Burt wrote:
>> You can use SortedHash. You can get it from the RAA. It preserves sort
>> order.
> 
> I assume a SortedHash is a tree of some kind? Probably Red-Black Tree,
> or similar. In which case, this is not what he wants. He wants the keys
> to be read out in the order in which they were inserted, he doesn't want
> *sorting* per se, at all.

Sorry about the error. The name of the package I'm thinking of is
actually OrderedHash, and it is what he wants - it preserves (insertion)
order.

http://raa.ruby-lang.org/project/orderedhash/

Cheers,
Dave