+ i|Rt^RIHtHtHtHt^RIHtHt^RI H t H t H t ^RI HtHtHt^RIHtHtHt^RIHt] .t]]].t].tRtRtR tR tR tRR ltR t Rt!RRlt"R#)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)coreca\\\\\\ 3p\ ;QJdV3RlV4F 'gK R# R#!V3RlV44#)c3<<"TFp\SV4xK R#5iN issubclass).0aopops& r/Users/tonyclaw/.openclaw/workspace/skills/math-calculator/venv/lib/python3.14/site-packages/sympy/unify/usympy.py $sympy_associative..s8isz"c""iTF)rrr r r r any)r assoc_opssf rsympy_associativer s>&&%yII 38i83383838i8 88ca\\\\\3p\ ;QJdV3RlV4F 'gK R# R#!V3RlV44#)c3<<"TFp\SV4xK R#5irr)rcoprs& rr$sympy_commutative..s7hsz"c""hrTF)rrr r r r)rcomm_opssf rsympy_commutativer's<VUL) >'8'>>r!c@\V\4'gR#\VP4'dR#\ VP\ 4'dI\ ;QJd&RVP4F 'dK R# R#!RVP44#R#)FTc3L"TFp\V4PxK R#5ir) constructis_commutative)rargs& rr!is_commutative.."sCFS9S>00Fs"$N)r)rr'rrrallargsr*s&rr0r0sk a " "!$$sCAFFCssCsCsCAFFCCCr!caV3RlpV#)c<\VS4;'g/\V\4;'d\VPS4#r)r)rrr)r+typs&r matchtypemk_matchtype..matchtype%s<1c"BB1h'AAJqttS,A Cr!)r7r8sf r mk_matchtyper;$sC r!ctaVS9d \V4#\V\\34'dV#\V\4'dVP'dV#\ VP \;QJd%.V3RlVP4FNK 54#!V3RlVP444#)z$Turn a SymPy object into a Compound c3<<"TFp\VS4xK R#5ir deconstruct)rr1 variabless& rrdeconstruct..3sH#+c955r) rr)rris_Atomr __class__tupler4)sr@s&frr?r?*sI~{!h -.. a  1999 AKKEHHE JJHHH JJr!ca\S\\34'd SP#\S\4'gS#\ ;QJd#V3Rl\ 4F 'gK RM RM!V3Rl\ 44'd+SP!\\SP4RR/#\ ;QJd#V3Rl\4F 'gK RM RM!V3Rl\44'd;\P!SP.\\SP4O5!#SP!\\SP4!#)z$Turn a Compound into a SymPy object c3P<"TFp\SPV4xK R#5irrrrclsts& rrconstruct..;s! =,osZc " "orM)r)rrr1rreval_false_legalrmapr/r4basic_new_legalr__new__)rKsfrr/r/5s!h -..uu a " " s =,< =sss =,< ===ttSAFF+o > >o > > >}}QTT;C 166$:;;ttSAFF+,,r!c*\\V44#)zRRebuild a SymPy expression. This removes harm caused by Expr-Rules interactions. )r/r?)rEs&rrebuildrUBs [^ $$r!Nc +a"V3RlpT;'g/pVP4UUu/uFwrgV!V4V!V4bK ppp\P!V!V4V!V4V3R\R\/VBpVF<p V P4UUu/uFwrg\ V4\ V4bK uppxK> R#uuppiuuppi5i)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<\VS4#rr>)r+r@s&runify..ss {1i0r!r,r0N)itemsrunifyr,r0r/) r+yrEr@kwargsdeconskvdsds &&&f, rr[r[IsT1F RA*+'')4)$!F1I )A4 F1Ivay! /4B /4B /(. /B67ggi@iday|Yq\)i@@ 5As&CB;A C C/C)r:)Nr:)#__doc__ sympy.corerrrrsympy.core.operationsrrsympy.matricesrr r sympy.sets.setsr r r sympy.unify.corerrr sympy.unifyrrRrPillegalr r'r,r0r;r?r/rUr[r:r!rrksu3 ,+455::==,S), +98?D J -%3Ar!