> I have also just caught a glimpse of an idea of a hint dependency > graph. However, I wonder how feasible it would be to create one which > would be sufficiently general to always work. I haven't thought too > much on that matter, but I'm afraid that the cost of eliminating loops > may sometimes be too dramatic, in the sense that it would disable > expand to do something which it currently can do.
Another way to think about this problem is to consider certain expressions to be "attractors" for hints. e.g. a Mul is an attractor for the mul hint. So the expression tree could be scanned with `has` (e.g. expr.has(Mul)) to see if a certain expression should be applied. So rather than blindly trying to apply all hints, only the "attracted hints" would be applied at a given step. But maybe this violates the KISS principle, I don't know. -- 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.
