From: Austin Ziegler Date: 2004-12-03T00:56:32+09:00 Subject: Re: ordered hash ? On Fri, 3 Dec 2004 00:28:17 +0900, Nikolai Weibull wrote: > * Austin Ziegler [Dec 02, 2004 16:00]: > > > > Is there a pure-ruby ordered hash? I'm looking for something that > > > > will preserve the order in which key/value pairs were entered. The > > > > one on RAA is buggy http://raa.ruby-lang.org/project/orderedhash/ > > > Having an ordered Hash is like saying that arrays should be indexed > > > by strings--it's simply not what they are meant to be. > > Be that as it may, it is still necessary to have an insertion-ordered > > hash-like object. > I just gave you one--you seem to have missed the gist of my posting. > (You chopped it right off it seems...) Which one? The Treap you said is comparison ordered, and you didn't make it clear whether the SkipList is insertion ordered. The order for PDF::Writer *must* be insertion ordered. I'll happily use RDSL in a future version of PDF::Writer rather than the hackish ohash implementation that I have, but ... -austin -- Austin Ziegler * halostatue@gmail.com * Alternate: austin@halostatue.ca