Python 3.0, rich comparisons and sorting order

[Steven Bethard]

Carlos Ribeiro <carribeiro <at> gmail.com> writes:
> For example: today's lists may contain objects of arbitrary types and
> can be sorted; even if the actual ordering may seem arbitrary, it
> works for most purposes. My question is: If Python 3.0 abolishes
> comparison between arbitrary types, how will generic sorting be
> handled?

Could you give an example of a list that you'd like to do this to?  I'm still 
having trouble imagining a list of disparate types that I call sort on...

Thanks,

Steve