< :the previous in number  ^ :the list in numerical order  > :the next in number  P :the previous (in thread)  N :the next (in thread) |<:the top of this thread >|:the next thread  ^ :the parent (reply-to) _:the child (an article replying to this) >:the elder article having the same parent <:the youger article having the same parent ---:split window and show thread lists  | :split window (vertically) and show thread lists  ~ :close the thread frame .:the index ..:the index of indices

Subject: Re: ordered hash ?
From: nobu.nokada@ f o . t
Date: Fri, 3 Dec 2004 11:38:24 +0900
References: 122139 122141
In-reply-to: 122141

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.

-- 
Nobu Nakada