\h|SrSSKJrJrJrJr SSKJrJr SSK J r J r J r SSK JrJrJr SSKJrJrJr SSKJr \ /r\\\/r\/rSrS rS rS rS rSS jrSr Sr!SSjr"g)zSymPy interface to Unification engine See sympy.unify for module level docstring See sympy.unify.core for algorithmic docstring )BasicAddMulPow)AssocOp LatticeOp)MatAddMatMul MatrixExpr)Union Intersection FiniteSet)CompoundVariable CondVariable)corecn^[[[[[[ 4n[ U4SjU55$)Nc3<># UHn[TU5v M g7fN issubclass).0aopops J/var/www/auris/envauris/lib/python3.13/site-packages/sympy/unify/usympy.py $sympy_associative..s8isz"c""i)rr r r r rany)r assoc_opss` rsympy_associativer!s&&&%yII 8i8 88cd^[[[[[4n[ U4SjU55$)Nc3<># UHn[TU5v M g7frr)rcoprs rr$sympy_commutative..s7hsz"c""hr)rr r r rr)rcomm_opss` rsympy_commutativer(s$VUL)'8'>>r"c[U[5(dg[UR5(ag[ UR[ 5(a[ SUR55$g)NFTc3L# UHn[U5Rv M g7fr) constructis_commutative)rargs rr!is_commutative.."sCFS9S>00Fs"$)r*rr(rrrallargsr+s rr1r1sO a " "!$$CAFFCCCr"c^U4SjnU$)Nc>[UT5=(d- [U[5=(a [URT5$r)r*rrr)r,typs r matchtypemk_matchtype..matchtype%s31c"B1h'AJqttS,A Cr")r8r9s` r mk_matchtyper<$sC r"c^UT;a [U5$[U[[45(aU$[U[5(aUR(aU$[ UR [U4SjUR555$)z$Turn a SymPy object into a Compound c3<># UHn[UT5v M g7fr deconstruct)rr2 variabless rrdeconstruct..3sH#+c955r) rr*rris_Atomr __class__tupler5)srAs `rr@r@*sjI~{!h -.. a  199 AKKHHH JJr"c ^[T[[45(a TR$[T[5(dT$[ U4Sj[ 55(a*TR"[[TR5SS06$[ U4Sj[55(a9[R"TR/[[TR5Q76$TR"[[TR56$)z$Turn a Compound into a SymPy object c3P># UHn[TRU5v M g7frrrrclsts rrconstruct..;s! =,# UHn[TRU5v M g7frrIrJs rrrM=s >osZc " "orN)r*rrr2rreval_false_legalrmapr0r5basic_new_legalr__new__)rLs`rr0r05s!h -..uu a " " =,< ===ttSAFF+o > > >}}QTT;C 166$:;;ttSAFF+,,r"c*[[U55$)zRRebuild a SymPy expression. This removes harm caused by Expr-Rules interactions. )r0r@)rFs rrebuildrVBs [^ $$r"Nc +^# U4SjnU=(d 0nUR5VVs0sHupgU"U5U"U5_M nnn[R"U"U5U"U5U4[[S.UD6nUH=n U R5VVs0sHupg[ U5[ U5_M snnv M? gs snnfs snnf7f)aStructural 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} c>[UT5$rr?)r,rAs runify..ss {1i0r")r-r1N)itemsrunifyr-r1r0) r,yrFrAkwargsdeconskvdsds ` rr\r\IsT1F RA*+'')4)$!F1I )A4 F1Ivay! /4B4B /(. /B67ggi@iday|Yq\)i@@ 5As%CB:A C!C/C)r;)Nr;)#__doc__ sympy.corerrrrsympy.core.operationsrrsympy.matricesr r r sympy.sets.setsr r rsympy.unify.corerrr sympy.unifyrrSrQillegalr!r(r-r1r<r@r0rVr\r;r"rrlsu3 ,+455::==,S), +98?D J -%3Ar"