[Python-Dev] binary trees.

[Vladimir 'Yu' Stepanov]

Josiah Carlson wrote:
> And you can actually compare str and unicode, so, if you have a str that
> is greater than the unicode, you run into this issue.  With unicode
> becoming str in Py3k, we may not run into this issue much then, unless
> bytes are comparable to str, in which case we end up witht the same
> problems.
>
> Actually, according to my google of "python dev total ordering", it
> gives me...
>
> http://mail.python.org/pipermail/python-dev/2003-March/034169.html
> http://mail.python.org/pipermail/python-list/2003-March/154142.html
>
> Which were earlier discussions on this topic, which are quite topical. 
> The ultimate solution is to choose a total ordering on types and
> consider the problem solved.  Then list.sort(
>   

Under the second reference there was a question. complex it can be
partially comparable with int, long, float? In fact 1 == 1+0j?