From: Hal Fulton <hal9000@...>
Date: 2005-12-09T13:50:03+09:00
Subject: Re: ordered/sorted hash

James Edward Gray II wrote:
> 
> You could easily wrap a Hash and provide an each() that sorted before  
> yielding.
> 

I've been discussing this off and on for years. What you say is true,
and it's also true that we can easily write a class that acts like an
ordered hash.

The problem is literals or constants. Nothing I do will ensure that
the hash  { x=>a, y=>b, z=>c }  will be iterated over in that
original specified order.


Hal