\c@ sqddlmZmZddlmZddlmZmZmZddl m Z dZ dZ dZ d S( i(tprint_functiontdivisioni(trl(tdo_onetexhausttswitch(ttop_downcK s<|r1ttttjt|j|SdSdS(sR Full simultaneous exact substitution Examples ======== >>> from sympy.strategies.tools import subs >>> from sympy import Basic >>> mapping = {1: 4, 4: 1, Basic(5): Basic(6, 7)} >>> expr = Basic(1, Basic(2, 3), Basic(4, Basic(5))) >>> subs(mapping)(expr) Basic(4, Basic(2, 3), Basic(1, Basic(6, 7))) cS s|S(N((tx((s5lib/python2.7/site-packages/sympy/strategies/tools.pyttN(RRtmapRtsubstziptitems(tdtkwargs((s5lib/python2.7/site-packages/sympy/strategies/tools.pyR s +cO stttt||S(s Strategy for canonicalization Apply each rule in a bottom_up fashion through the tree. Do each one in turn. Keep doing this until there is no change. (RRR(trulesR((s5lib/python2.7/site-packages/sympy/strategies/tools.pytcanonscC s tt|S(sQ Apply rules based on the expression type inputs: ruletypes -- a dict mapping {Type: rule} >>> from sympy.strategies import rm_id, typed >>> from sympy import Add, Mul >>> rm_zeros = rm_id(lambda x: x==0) >>> rm_ones = rm_id(lambda x: x==1) >>> remove_idents = typed({Add: rm_zeros, Mul: rm_ones}) (Rttype(t ruletypes((s5lib/python2.7/site-packages/sympy/strategies/tools.pyttyped"s N(t __future__RRR RtcoreRRRttraverseRR RR(((s5lib/python2.7/site-packages/sympy/strategies/tools.pyts