On Wed, 5 Apr 2006, Dave Burt wrote:

> 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/

that one has some errors.  i've patched it in my alib, also on the raa.  feel
free to lift it.

fyi.

-a
-- 
share your knowledge.  it's a way to achieve immortality.
- h.h. the 14th dali lama