\h4bSrSSKJr SSKJr \4SjrSr\4SjrSrS r S r \4S jr S r g )zOGeneric Rules for SymPy This file assumes knowledge of Basic and little else. )sift)newc^^UU4SjnU$)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 j>[[TUR55n[U5S:XaU$[U5[ U5:waET"UR /[ URU5VVs/sHup#U(aMUPM snnQ76$T"UR URS5$s snnf)zRemove identities r)listmapargssumlen __class__zip)expridsargxisidrs K/var/www/auris/envauris/lib/python3.13/site-packages/sympy/strategies/rl.py ident_removerm_id..ident_removes3tTYY'( s8q=K XS !t~~J+.tyy#+>H+>a+>HJ Jt~~tyy|4 4Is 1 B/ B/ )rrrs`` rrm_idr s& 5 c^^^UUU4SjnU$)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 ~>[URT 5nUR5VVs0sHup#U[[ T U55_M nnnUR5VVs/sH upVT"Xe5PM nnn[ U5[ UR5:wa[ [U5/UQ76$U$s snnfs snnf)z1Conglomerate together identical args x + x -> 2x )rr itemsr r setrtype) rgroupskr countsmatcntnewargscombinecountkeys r conglomerateglom..conglomerateFsdii%:@,,.I.wq!SUD)**.I5;\\^D^73$^D w<3tyy> )tDz,G, ,K JDs "B3#B9r)r'r&r%r(s``` rglomr*+s6 rc^^UU4SjnU$)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) cN>T"UR/[URTS9Q76$)N)r')r sortedr )rr'rs rsort_rlsort..sort_rl`s"4>>?F499#$>??rr)r'rr.s`` rsortr0Ss@ Nrc^^UU4SjnU$)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 $>[UR5Hpup[UT5(dMURSUURUURUS-SpTnT"URVs/sHnT"X24-U-6PM sn6s $ U$s snf)Nr) enumerater isinstance)rirfirstbtailABs r distribute_rl!distribute..distribute_rlus *FA#q!!!%2A ! diiA>O$!&&I&31uv~46&IJJ+ Js.B r)r9r:r;s`` r distributer=es  rc^^UU4SjnU$)zReplace expressions exactly c>UT:XaT$U$)Nr)rar7s rsubs_rlsubs..subs_rls 19HKrr)r@r7rAs`` rsubsrC~s NrcV[UR5S:XaURS$U$)zRule to unpack singleton args >>> from sympy.strategies import unpack >>> from sympy import Basic, S >>> unpack(Basic(S(2))) 2 rr)r r rs runpackrFs' 499~yy| rcURn/nURHAnURU:XaURUR5 M0URU5 MC U"UR/UQ76$)z8Flatten T(a, b, T(c, d), T2(e)) to T(a, b, c, d, T2(e)) )r r extendappend)rrclsr rs rflattenrKs\ ..C Dyy ==C  KK ! KK   t~~ % %%rcUR(aU$UR"[[[UR 556$)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_Atomfuncrr rebuildr rEs rrOrOs/ || yy$s7DII6788rN) __doc__sympy.utilities.iterablesrutilrrr*r0r=rCrFrKrOrrrrSsK+B%P$2  & 9r