Changes between Initial Version and Version 1 of Ticket #16397, comment 10


Ignore:
Timestamp:
09/05/14 20:03:11 (7 years ago)
Author:
vbraun
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #16397, comment 10

    initial v1  
    11The problem is IMHO what to do with Python 3. Sure we can play the two different comparisons (cmp vs. rich) in Python 2 against each other, but in Py3 there will be only one comparison. So either
    2 * Comparison is always symbolic, and sorting will have to call `__bool__` on the symbolic inequalities. Slow and we then need to make that a total order instead of returning `False` all the time. Slow.
     2* Comparison is always symbolic, and sorting will have to call `__bool__` on the symbolic inequalities. We then need to make that a total order instead of returning `False` all the time. Slow.
    33* Comparison is never symbolic, and you need to call `x.symbolic_less(y)`. Could be beautified by the preparser. The actual comparison returns the internal term order. Fast.
    44Thought? Maybe that topic is more fodder for sage-devel...