> In this particular case, it's determining if an Add is positive by > peeling off one term at a time (see line 440 of add.py), which I think > should be changed (not only is this needlessly recursive, but it's > also inefficient, because it recomputes Add.flatten each time, making > it a O(n**2) operation).
If I'm not mistaken, it hasn't done this since about 4500 commits ago :-) (SHA1 40853ad65801838c45b5). But it *is* recursive. -- 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.
