From: Austin Ziegler Date: 2006-08-26T22:53:11+09:00 Subject: Re: A use case for an ordered hash On 8/26/06, surf wrote: > I was curious about this, so I had to try it: Note: There are about a dozen implementations of an insertion ordered hash-like objects. I've written one. Hal has probably written one. Ara Howard has written one, I think. All that's being discussed is whether it's worthwhile making a C version that has a *new* literal syntax to create insertion ordered hash-like objects. The main concerns are (1) what literal syntax, and (2) what name. Since we're talking something *new*, we're not talking something that would affect the performance for people who don't need the functionality. Just saying that we can implement this in Ruby -- or proviing such an implementation -- isn't helpful in the least. We know this. We've done this. We're looking for something different. -austin -- Austin Ziegler * halostatue@gmail.com * http://www.halostatue.ca/ * austin@halostatue.ca * http://www.halostatue.ca/feed/ * austin@zieglers.ca