On Thu, Sep 6, 2018 at 11:40 AM David Coudert <david.coud...@gmail.com> wrote: > > Comparisons like u < v are used in many places in the code of graphs. > We can try to use hash(u) < hash(v) instead, but this is certainly not the > smartest solution.
I have a long-outstanding proposal for a SafeSortable utility that would help with these cases. I would prefer a solution like this (with the exact details negotiable): https://trac.sagemath.org/ticket/25981 -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
