Markus wrote:
> But my point was, without some details it is very hard to respond
> meaningfully to your questions.  At least, you seem to see a single
> meaningful was to connect what to me are marginally related things.

Yes, true.

> On the other hand, do you mean that you would like Hash.each et. al. to
> proceed through the items in the hash in a predictable way?  If so:
> 
>         Do you mean that the order should be determined by the keys,
>         regardless of how they are inserted?  If so, how do you want to
>         order items whose keys are not comparable?

I want insertion order.

>         Do you mean that the order should be determined by the order in
>         which the pairs are added?  If so, what do you do when the value
>         at a key is replaced?  Or just changed (internally modified)?  

Replaced/modified values -- a very good question to which I have
given no thought.

>         
> Or are you just wanting arrays that take arbitrary subscripts?
> 

Probably so, yes. With the condition that a convenient syntax for
literals should exist.


Hal