Ed+^dZddlmZddlmZefdZdZefdZdZd Z d Z efd Z d Z d S)zP Generic Rules for SymPy This file assumes knowledge of Basic and little else. )sift)newcfd}|S)a Create 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 identites then we keep one Basic(0) See Also: unpack c@tt|j}t|dkr|St|t |kr+|jgdt |j|DRS|j|jdS)z Remove identities rcg|] \}}|| Sr ).0argxs 3lib/python3.11/site-packages/sympy/strategies/rl.py z/rm_id..ident_remove..$s!HHHaaHHHH)listmapargssumlen __class__zip)expridsisidrs r ident_removezrm_id..ident_removes3tTY''(( s88q= 5K XXS ! 53t~JHH3ty#+>+>HHHJJJ J3t~ty|44 4rr )rrrs`` r rm_idr s*& 5 5 5 5 5 5 rcfd}|S)a6 Create 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 c0t|j}fd|D}fd|D}t|t|jkrt t |g|RS|S)z2 Conglomerate together identical args x + x -> 2x c Ri|]#\}}|tt|$Sr )rr)r krcounts r z.glom..conglomerate..Hs1IIIwq$!SUD))**IIIrc.g|]\}}||Sr r )r matcntcombines r rz.glom..conglomerate..Is)DDDc773$$DDDr)rritemssetrtype)rgroupscountsnewargsr%r keys r conglomeratezglom..conglomerateEsdi%%IIII&,,..IIIDDDDV\\^^DDD w<<3ty>> ) tDzz,G,,, ,Krr )r,r r%r-s``` r glomr.*s06 rcfd}|S)z Create 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) cH|jgt|jRS)N)r,)rsortedr)rr,rs r sort_rlzsort..sort_rl^s,s4>?F49#$>$>$>????rr )r,rr2s`` r sortr3Qs-@@@@@@ Nrcfd}|S)aW 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 ct|jD]^\}}t|rI|jd||j||j|dzdc}fd|jDcS_|S)Nrc(g|]}|fzzSr r )r r Afirsttails r rz5distribute..distribute_rl..vs+III311uv~46IIIr) enumerater isinstance)rir br8r9r7Bs @@r distribute_rlz!distribute..distribute_rlrs ** K KFAs#q!! K!%2A2 ! di!oq$qIIIIII!&IIIJJJJ K rr )r7r>r?s`` r distributer@bs*  rcfd}|S)z Replace expressions exactly c|krS|S)Nr )rar=s r subs_rlzsubs..subs_rl|s 19 HKrr )rCr=rDs`` r subsrEzs) NrcPt|jdkr |jdS|S)z Rule to unpack singleton args >>> from sympy.strategies import unpack >>> from sympy import Basic, S >>> unpack(Basic(S(2))) 2 rr)rrrs r unpackrHs* 49~~y| rc|j}g}|jD]=}|j|kr||j(||>||jg|RS)z9 Flatten T(a, b, T(c, d), T2(e)) to T(a, b, c, d, T2(e)) )rrextendappend)rrclsrr s r flattenrMst .C Dy =C   KK ! ! ! ! KK     3t~ % % % %%rcr|jr|S|jttt|jS)z Rebuild 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_AtomfuncrrrebuildrrGs r rQrQs6 |9 ty$s7DI667788rN) __doc__sympy.utilities.iterablesrutilrrr.r3r@rErHrMrQr rr rUs+*****@%%%N"0    & & & & 9 9 9 9 9r