greg wrote: > David M. Cooke wrote: > >>>To solve that, I would suggest a fourth category of "arbitrary >>>ordering", but that's probably Py3k material. >> >>We've got that: use hash(). >>[1+2j, 3+4j].sort(key=hash) > > What about objects that are not hashable? > > The purpose of arbitrary ordering would be to provide > an ordering for all objects, whatever they might be.
How about id(), then? And so the circle is completed... -- Robert Kern [EMAIL PROTECTED] "In the fields of hell where the grass grows high Are the graves of dreams allowed to die." -- Richard Harter -- http://mail.python.org/mailman/listinfo/python-list