maybe the right solution is to speed up sorting, perhaps by a better comparison routine. Having a function whose results differ from call to call is something to be avoided when possible.
On Sunday, June 11, 2017 at 10:21:33 PM UTC-7, Nils Bruin wrote: > > How attached are people to creating deterministic output where none is > warranted? > > Currently, there is a "sort" routine in f.roots which creates a 60% > overhead: > > sage: C=ComplexField(100) > sage: %timeit f.roots(multiplicities=False) > 1000 loops, best of 3: 703 µs per loop > sage: %timeit [C(a) for a in F.polroots(precision=C.prec())] > The slowest run took 4.22 times longer than the fastest. This could mean > that an intermediate result is being cached. > 1000 loops, best of 3: 432 µs per loop > > Is it really worth that much to enforce output to be in some arbitrary > order? > > I'd hope we can do away with this and instead just sort stuff in doctests, > if people want to test their floating point results using string matching. > -- 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.
