+ i4dRt^RIHt^RIHt]3RltRt]3RltRtRt Rt ]3R lt R t R #) zOGeneric Rules for SymPy This file assumes knowledge of Basic and little else. )sift)newcaaVV3RlpV#)aCreate a rule to remove identities. isid - fn :: x -> Bool --- whether or not this element is an identity. Examples ======== >>> from sympy.strategies import rm_id >>> from sympy import Basic, S >>> remove_zeros = rm_id(lambda x: x==0) >>> remove_zeros(Basic(S(1), S(0), S(2))) Basic(1, 2) >>> remove_zeros(Basic(S(0), S(0))) # If only identities then we keep one Basic(0) See Also: unpack c x<\\SVP44p\V4^8XdV#\V4\ V48wdGS!VP .\ VPV4UUu.uFwr#V'dKVNK uppO5!#S!VP VP^,4#uuppi)zRemove identities )listmapargssumlen __class__zip)expridsargxisidrs& s/Users/tonyclaw/.openclaw/workspace/skills/math-calculator/venv/lib/python3.14/site-packages/sympy/strategies/rl.py ident_removerm_id..ident_removes3tTYY'( s8q=K XS !t~~J+.tyy#+>H+>a+>HJ Jt~~tyy|4 4Is 3 B6 B6 )rrrsff rrm_idr s& 5 caaaVVV3RlpV#)aCreate a rule to conglomerate identical args. Examples ======== >>> from sympy.strategies import glom >>> from sympy import Add >>> from sympy.abc import x >>> key = lambda x: x.as_coeff_Mul()[1] >>> count = lambda x: x.as_coeff_Mul()[0] >>> combine = lambda cnt, arg: cnt * arg >>> rl = glom(key, count, combine) >>> rl(Add(x, -x, 3*x, 2, 3, evaluate=False)) 3*x + 5 Wait, how are key, count and combine supposed to work? >>> key(2*x) x >>> count(2*x) 2 >>> combine(2, x) 2*x c ~<\VPS 4pVP4UUu/uFwr#V\\ S V44bK pppVP4UUu.uF wrVS!We4NK ppp\ V4\ VP48wd\ \V4.VO5!#V#uuppiuuppi)z1Conglomerate together identical args x + x -> 2x )rritemsr rsetrtype) r groupskrcountsmatcntnewargscombinecountkeys & r conglomerateglom..conglomerateFsdii%:@,,.I.wq!SUD)**.I5;\\^D^73$^D w<3tyy> )tDz,G, ,K JDs !B3"B9r)r%r$r#r&sfff rglomr(+s6 rcaaVV3RlpV#)zCreate a rule to sort by a key function. Examples ======== >>> from sympy.strategies import sort >>> from sympy import Basic, S >>> sort_rl = sort(str) >>> sort_rl(Basic(S(3), S(1), S(2))) Basic(1, 2, 3) cV<S!VP.\VPSR7O5!#))r%)r sortedr)r r%rs&rsort_rlsort..sort_rl`s"4>>?F499#$>??rr)r%rr,sff rsortr.Ss@ NrcaaVV3RlpV#)a*Turns an A containing Bs into a B of As where A, B are container types >>> from sympy.strategies import distribute >>> from sympy import Add, Mul, symbols >>> x, y = symbols('x,y') >>> dist = distribute(Mul, Add) >>> expr = Mul(2, x+y, evaluate=False) >>> expr 2*(x + y) >>> dist(expr) 2*x + 2*y c H<\VP4Fwr\VS4'gKVPRVVPV,VPV^,RrTpS!VPUu.uFpS!W23,V,!NK up!u# V#uupiN) enumerater isinstance)r irfirstbtailABs& r distribute_rl!distribute..distribute_rlus *FA#q!!!%2A ! diiA>O$!&&I&31uv~46&IJJ+ Js7B r)r8r9r:sff r distributer<es  rcaaVV3RlpV#)zReplace expressions exactly c<VS8XdS#V#r1r)r ar6s&rsubs_rlsubs..subs_rls 19HKrr)r?r6r@sff rsubsrB~s Nrc`\VP4^8XdVP^,#V#)zRule to unpack singleton args >>> from sympy.strategies import unpack >>> from sympy import Basic, S >>> unpack(Basic(S(2))) 2 )r rr s&runpackrEs' 499~yy| rcVPp.pVPFBpVPV8XdVPVP4K1VPV4KD V!VP.VO5!#)z8Flatten T(a, b, T(c, d), T2(e)) to T(a, b, c, d, T2(e)) )r rextendappend)r rclsrrs&& rflattenrJs\ ..C Dyy ==C  KK ! KK   t~~ % %%rcVP'dV#VP!\\\VP 44!#)zRebuild a SymPy tree. Explanation =========== This function recursively calls constructors in the expression tree. This forces canonicalization and removes ugliness introduced by the use of Basic.__new__ )is_AtomfuncrrrebuildrrDs&rrNrNs1 ||| yy$s7DII6788rN) __doc__sympy.utilities.iterablesrutilrrr(r.r<rBrErJrNrrrrRsK+B%P$2  & 9r