Comment #35 on issue 2607 by asmeurer: as_numer_denom() is too slow http://code.google.com/p/sympy/issues/detail?id=2607
Does your as_numer_denom5() satisfy the requirements of together() that Mateusz mentioned in comment 29?
Last thought...what about building up the multiplications from a binary lookup of precomputed muls?
In theory, this would be good. But if you look at the method from as_numer_denom1(), it's doing basically this. The problem is that appending a Mul in SymPy is extremely inefficient. So you can try implementing something like this, but I don't have very high hopes for it.
-- 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.
