[Python-ideas] Automatic total ordering

[George Sakkis]

On Wed, Oct 15, 2008 at 1:55 PM, Guido van Rossum <guido at python.org> wrote:

Sure, but let's aim for 3.1.
>
> The goal for 3.0 is stability and getting it released!
>

Definitely, that's why it's posted on python-ideas and not on the python-3k
list.


>
> On Wed, Oct 15, 2008 at 7:57 AM, George Sakkis <george.sakkis at gmail.com>
> wrote:
> > Now that 3.x fixes the arbitrary object comparison wart and drops (?)
> > __cmp__, it seems it's a good time to do something with the missing rich
> > comparators gotcha, e.g. given a class that defines __eq__ and __lt__,
> > automatically provide the rest missing comparisons. Yes, it can be done
> with
> > a custom metaclass or (in 2.6+) with a class decorator [1] but (a) 99% of
> > the time that's what one expects so "explicit is better than implicit"
> > doesn't count and (b) a bulitin implementation might well be more
> efficient.
> > There might be arguments why this would be a bad idea but I really can't
> > think of any.
> >
> > George
> >
> > [1] http://www.voidspace.org.uk/python/weblog/arch_d7_2008_10_04.shtml
>
> --
> --Guido van Rossum (home page: http://www.python.org/~guido/<http://www.python.org/%7Eguido/>
> )
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/python-ideas/attachments/20081015/0b0e87fb/attachment.html>