U «Ì0e|ã@sÚdZddlmZmZmZmZddlmZmZddl m Z m Z m Z ddl mZmZmZddlmZmZmZddlmZe gZeeegZegZdd „Zd d „Zd d „Zdd„Zdd„Zddd„Zdd„Z dd„Z!ddd„Z"dS)z‚ SymPy interface to Unification engine See sympy.unify for module level docstring See sympy.unify.core for algorithmic docstring é)ÚBasicÚAddÚMulÚPow)ÚAssocOpÚ LatticeOp)ÚMatAddÚMatMulÚ MatrixExpr)ÚUnionÚ IntersectionÚ FiniteSet)ÚCompoundÚVariableÚ CondVariable)Úcorecs&ttttttf}t‡fdd„|DƒƒS)Nc3s|]}tˆ|ƒVqdS©N©Ú issubclass)Ú.0Zaop©Úop©ú6/tmp/pip-unpacked-wheel-_6tpq7m6/sympy/unify/usympy.pyÚ sz$sympy_associative..)rrr r r r Úany)rZ assoc_opsrrrÚsympy_associativesrcs$tttttf}t‡fdd„|DƒƒS)Nc3s|]}tˆ|ƒVqdSrr)rZcoprrrrsz$sympy_commutative..)rrr r r r)rZcomm_opsrrrÚsympy_commutativesrcCst|tƒot|jƒSr)Ú isinstancerrr©ÚxrrrÚis_associativesr!cCs@t|tƒsdSt|jƒrdSt|jtƒr.)rrrrrrÚallÚargsrrrrr#s    r#cs‡fdd„}|S)Ncs t|ˆƒpt|tƒot|jˆƒSr)rrrrr©ÚtyprrÚ matchtype%s ÿzmk_matchtype..matchtyper)r)r*rr(rÚ mk_matchtype$s r+rcsV|ˆkrt|ƒSt|ttfƒr"|St|tƒr2|jr6|St|jt‡fdd„|jDƒƒƒS)z% Turn a SymPy object into a Compound c3s|]}t|ˆƒVqdSr©Ú deconstructr$©Ú variablesrrr3szdeconstruct..) rrrrZis_AtomrÚ __class__Útupler')Úsr/rr.rr-*sÿr-cs–tˆttfƒrˆjStˆtƒs"ˆSt‡fdd„tDƒƒrPˆjtt ˆj ƒddiŽSt‡fdd„t Dƒƒr€t j ˆjftt ˆj ƒžŽSˆjtt ˆj ƒŽSdS)z% Turn a Compound into a SymPy object c3s|]}tˆj|ƒVqdSr©rr©rÚcls©Útrrr;szconstruct..ÚevaluateFc3s|]}tˆj|ƒVqdSrr3r4r6rrr=sN)rrrr%rrÚeval_false_legalrÚmapr"r'Úbasic_new_legalrÚ__new__r6rr6rr"5s r"cCs tt|ƒƒS)z[ Rebuild a SymPy expression. This removes harm caused by Expr-Rules interactions. )r"r-)r2rrrÚrebuildBsr=Nc+sp‡fdd„‰|pi}‡fdd„| ¡Dƒ}tjˆ|ƒˆ|ƒ|fttdœ|—Ž}|D]}dd„| ¡DƒVqRdS)af Structural unification of two expressions/patterns. Examples ======== >>> from sympy.unify.usympy import unify >>> from sympy import Basic, S >>> from sympy.abc import x, y, z, p, q >>> next(unify(Basic(S(1), S(2)), Basic(S(1), x), variables=[x])) {x: 2} >>> expr = 2*x + y + z >>> pattern = 2*p + q >>> next(unify(expr, pattern, {}, variables=(p, q))) {p: x, q: y + z} Unification supports commutative and associative matching >>> expr = x + y + z >>> pattern = p + q >>> len(list(unify(expr, pattern, {}, variables=(p, q)))) 12 Symbols not indicated to be variables are treated as literal, else they are wild-like and match anything in a sub-expression. >>> expr = x*y*z + 3 >>> pattern = x*y + 3 >>> next(unify(expr, pattern, {}, variables=[x, y])) {x: y, y: x*z} The x and y of the pattern above were in a Mul and matched factors in the Mul of expr. Here, a single symbol matches an entire term: >>> expr = x*y + 3 >>> pattern = p + 3 >>> next(unify(expr, pattern, {}, variables=[p])) {p: x*y} cs t|ˆƒSrr,rr.rrÚsózunify..csi|]\}}ˆ|ƒˆ|ƒ“qSrr©rÚkÚv)ÚdeconsrrÚ uszunify..)r!r#cSsi|]\}}t|ƒt|ƒ“qSr)r"r@rrrrD|sN)ÚitemsrÚunifyr!r#)r Úyr2r/ÚkwargsZdsÚdr)rCr/rrFIs* þýrF)r)Nr)#Ú__doc__Z sympy.corerrrrZsympy.core.operationsrrZsympy.matricesrr r Zsympy.sets.setsr r r Zsympy.unify.corerrrZ sympy.unifyrr;r9Úillegalrrr!r#r+r-r"r=rFrrrrÚs$