From: Rick DeNatale <rick.denatale@...>
Date: 2006-08-23T10:28:27+09:00
Subject: Re: Why Does Hash Apparently Reorder Its Internal Representation And Other Associated Ponderings

On 8/21/06, Hal Fulton <hal9000@hypermetrics.com> wrote:
> Isak wrote:
> >
> > I don't think 'ordered' is a good name for something sorted by
> > _insertion order_.
>
> The fact that something can be "sorted" at all is only because it
> has an order, i.e., is sequential.

 Uh, no.

Whether it can be sorted depends on whether the contents are comparable.

irb(main):004:0> class Foo
irb(main):005:1> end
=> nil
irb(main):006:0> [Foo.new, Foo.new].sort
NoMethodError: undefined method `<=>' for #<Foo:0xb7dfe658>
        from (irb):6:in `sort'
        from (irb):6
        from :0



-- 
Rick DeNatale

My blog on Ruby
http://talklikeaduck.denhaven2.com/