Hi,

In message "Re: Ordered Hashes in 1.9?"
    on Tue, 9 Oct 2007 11:41:50 +0900, murphy <murphy / rubychan.de> writes:

|Does it affect speed? I would expect:
|* deletion and insertion to be a bit slower (more pointers to set);
|* travering a hash (which is more common) to be faster;
|* fetching a value by key to be as fast as before (no list involved).

Your observation is right.

							matz.