Re: Ordered Hash Usefulness

< :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


On Nov 13, 3:53 pm, "Devi Web Development" <devi.webmas... / gmail.com>
wrote:
> On Nov 12, 2007 7:56 AM, James Edward Gray II <ja... / grayproductions.net> wrote:
>
> > That little challenge made me wish for some Ruby 1.9 elements, like
> > an ordered Hash.
>
> > James Edward Gray II
>
> I've been wondering what the real usefulness of an ordered hash is.
> Lately I've found that when I initially think of an ordered hash I
> really want one of the following constructs
>
> (1) An array of pairs

Slow lookup times.

> (2) A hash with multiple keys for a value.

How does that behave like an ordered hash?

Thanks,
T.