Yukihiro Matsumoto
9/18/2008 1:03:00 PM
Hi,
In message "Re: Preserve insert order in a Hash"
on Thu, 18 Sep 2008 21:44:23 +0900, "Rick DeNatale" <rick.denatale@gmail.com> writes:
|> No. hash reference operation does not touch order information, only
|> for iteration. Memory consumption increased a bit.
|>
|
|If I remember correctly, it's been a while since I looked at the code, 1.9
|implements this by using a singly linked list which introduces a small
|overhead only when elements are either added or deleted.
You're right. Thank you for pointing out.
matz.