Berger, Daniel
7/25/2006 4:51:00 PM
> -----Original Message-----
> From: Paul Battley [mailto:pbattley@gmail.com]
> Sent: Tuesday, July 25, 2006 10:44 AM
> To: ruby-talk ML
> Subject: Re: Hash order bug?
>
>
> On 25/07/06, dblack@wobblini.net <dblack@wobblini.net> wrote:
> > The question came up during a lunch here at OSCON (with me, Jim
> > Weirich, Pat Eyler, and a fellow named Nicolas whose last name I'm
> > afraid I don't remember) as to whether making hashes ordered in a
> > future Ruby would break any existing code. I think the
> answer is no,
> > which is kind of interesting considering what a major
> change it would
> > be. It's a case where the feature would be purely additive.
>
> I think that would depend on whether {:a => 1, :b => 2} ==
> {:b => 2, :a => 1}. If that's the same, everything should be
> fine. If it's different, I know that it would break a number
> of my tests, if nothing else.
>
> Paul.
Oh, yeah, that brings up the whole Comparable bugbear. I didn't think
about that.
/me votes to just leave it alone
- Dan
This communication is the property of Qwest and may contain confidential or
privileged information. Unauthorized use of this communication is strictly
prohibited and may be unlawful. If you have received this communication
in error, please immediately notify the sender by reply e-mail and destroy
all copies of the communication and any attachments.