nobu.nokada / softhome.net wrote:
> Hi,
> 
> At Thu, 2 Dec 2004 15:51:46 +0900,
> Yukihiro Matsumoto wrote in [ruby-talk:122141]:
> 
>>Nobu himself made a patch to preserve hash order.  I have not decided
>>yet to merge it.  The only concern is performance.
> 
> 
> The performance wouldn't increase for insertion, iteration and
> lookup, but do for direct deleting (except for st_delete_safe).
> And the memory usage increases 2 pointers for each hash
> entries.

Hm, 2 pointers for each hash entry, that's an increase of 50%. On the 
other side, 8 bytes more per hash entry isn't very much (if it's useful 
enough).

Regards,

   Michael