> Each failure of type (2) would require a more specific approach. > However, I'll try once again to push through the idea of defining > sympy.utilities.sympysort in the following way: > > sympysort(x) = sorted(x, key=default_sort_key)
Using this in the codebase still requires that something be imported. An advantage of importing only default_sort_key (which could be aliased as sympy_key) is that you can sort in place and not create a new list: ``` foo.sort(key=sympy_key) # assuming sympy_key = default_sort_key ``` BTW, in 1375 I include fixes (hopefully) for circuitutils, expr, guide, recurr, and iterables. Someone who understands the quantum gate workings should review the sorting that is implemented in circuitutils. /c -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
