From: khaines@...
Date: 2007-03-02T04:38:38+09:00
Subject: Re: Sorting a Hash

On Fri, 2 Mar 2007, Nasir Khan wrote:

> One could perhaps overload the []= method and maintain a sorted parallel
> array in the Hash object (this is what I did in my case).

Works great in some cases, but array's function means that some operations 
are very slow.

I have a class library in IOWA that I extracted some time ago as a 
microproject that provides a structure that provides both hashlike and 
arraylike access semantics using a linked list with a hash key -> node 
index.

http://rubyforge.org/frs/download.php/12908/LinkedList_0.99.2.9.tar.gz


Kirk Haines