From: ara.t.howard@... Date: 2006-08-22T05:35:11+09:00 Subject: Re: A use case for an ordered hash On Tue, 22 Aug 2006, Robert Dober wrote: > On 8/21/06, Martin DeMello wrote: >> >> On 8/22/06, Robert Dober wrote: >> > >> > First there would be the SortedHash and all you sayed was true about it >> > (save that iteration would be slower, which seems wrong to me). >> > And then there might be the OrderedHash, which is a Hash without any >> > overhead, just offering different access methods, >> > which would implement order this might be a bad idea, as the access >> sorting >> > can so easily be done ourselfs. >> >> The thing is, there's no way to preserve insertion order in a hash > > > You did it, thank you, I was *not* talking about InsertionOrder in Hash, > which is of course a > *very* important one, so I want three now!!! > SortedHash > OrderableHash (maybe better naming) > HistoricalHash (the name's a joke of course ;) my alib has an orderedhash which maintains insertion order. fyi. -a -- to foster inner awareness, introspection, and reasoning is more efficient than meditation and prayer. - h.h. the 14th dali lama