=20
> Well, that's just /one/ way to order a Hash.  You could as=20
> well order a=20
> Hash by the key's natural order (<=3D>).

Yes, but nothing extra needs to be added to Hash to get a=20
natural order enumeration - A hash.sort.each sorts that out.

An ordered hash almost always refers to insertion order, as
that's the order that is unrecoverable from a regular hash.

Dan.