Comment #13 on issue 2607 by asmeurer: as_numer_denom() is too slow http://code.google.com/p/sympy/issues/detail?id=2607
So this is not working so well. The problem is that the algorithm relies on *= type multiplication being fast, but currently it is not:
In [1]: n = numbered_symbols() In [13]: a = take(n, 1000) In [8]: def mul(l): ...: r = l[0] ...: for i in l[1:]: ...: r *= i ...: return r ...: In [14]: %timeit Mul(*a) 1 loops, best of 3: 1.02 ms per loop In [15]: %timeit mul(a) 1 loops, best of 3: 13.4 ms per loop See issue 683. -- You received this message because you are subscribed to the Google Groups "sympy-issues" 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-issues?hl=en.
