<ЦiuSSKrSSKrSSKrSSKrSSKJrJrJrJrJ r J r J r J r J r SSKrSSKJr SSKJr SSKJr SSKJr SSKJrJrJr SSKJr SS KJrJr SS KJ r SS K!J"r" SS K#J$r$ SS K%J&r& SSK'J(r( \ "S\ S9r)/SQr*S\R&S\+4Sjr,S\S\)4S\S\ \)\RZ444Sjr.S\ \+S\ \+S\ \+4Sjr/S\R`S\R`S\R`4Sjr1"SS \Rd5r3"S!S"\Rd5r4"S#S$\Rd5r5"S%S&\Rd5r6"S'S(\Rd5r7"S)S*\35r8"S+S,\Rd5r9"S-S.\Rd5r:"S/S0\Rd5r;"S1S2\Rd5r<"S3S4\Rd5r="S5S6\\5r>"S7S8\>\5r?"S9S:\>\5r@S;rAS<rB"S=S>\Rd5rC"S?S@\Rd5rD"SASB\Rd5rE"SCSD\Rd5rF"SESF\Rd5rG"SGSH\Rd5rH"SISJ\Rd5rI"SKSL\Rd5rJ"SMSN\Rd5rK"SOSP\Rd5rL"SQSR\Rd5rMSSrN\N"ST5rO\N"SU5rP\N"SV5rQ\N"SW5rR\N"SX5rS\N"SY5rT\N"SZ5rU\N"S[5rV\N"S\5rW\N"S]5rX\N"S^5rY\N"S_5rZ\N"S`5r[\N"Sa5r\Sbr]\]"ScSd5r^\]"SeSf5r_g)gN) AnyCallableIterableListOptional SupportsFloatTupleTypeVarUnion)Ssympify)Expr) Application)_torf fuzzy_andfuzzy_or) equal_valued) LatticeOp ShortCircuit)ordered)walk) PRECEDENCE)sift)int_oo_T)bound)FloorDivModularIndexingWhere PythonModModCleanDiv CeilToInt FloorToIntCeilDiv IntTrueDiv FloatTrueDivLShiftRShift!IsNonOverlappingAndDenseIndicator TruncToFloat TruncToInt RoundToInt RoundDecimalToFloatFloatPow PowByNaturalIdentityexprreturnc"UR=(a} [UR5S:H=(a^ URSR=(a> URSR=(a URSURSL$)Nrr)is_Addlen_args is_symbol)r5s [/var/www/html/ai-image-ml/venv/lib/python3.13/site-packages/torch/utils/_sympy/functions.py_is_symbols_binary_summationr>]sr  /  Oq  / JJqM # # / JJqM # # / JJqMA . f.c^[R"T5S[S[[[ R 44U4Sjj5nU$)Nargsr6c>T"U6n[SU55(a>[U[R5(d[R"[ U55nU$)Nc3V# UHn[U[R5v M! g7fN) isinstancesympyFloat.0as r= -_keep_float..inner..ls84az!U[[))4'))anyrFrGrHfloat)rBrr@s r=inner_keep_float..innerisM$%tH 848 8 8 u{{B B  E!H%Ar?) functoolswrapsrr rrGrH)r@rRs` r= _keep_floatrVhs@__QSU2u{{?3 Lr?xycSX4;agX:H$rE)rWrXs r=fuzzy_eqr[us v~ 6Mr?pqc^^S[RS[4SjmS[RS[4U4Sjjn[R"U"U5U"U55nX- X- p[ [ [RR[RRU555n[RRU5nUH$m[U4SjU55(dMUT-nM& U$)a Fast path for sympy.gcd, using a simple factoring strategy. We try to rewrite p and q in the form n*e*p1 + n*e*p2 and n*e*q0, where n is the greatest common integer factor and e is the largest syntactic common factor (i.e., common sub-expression) in p and q. Then the gcd returned is n*e, cancelling which we would be left with p1 + p2 and q0. Note that further factoring of p1 + p2 and q0 might be possible with sympy.factor (which uses domain-specific theories). E.g., we are unable to find that x*y + x + y + 1 is divisible by x + 1. More generally, when q is of the form q1 + q2 (instead of being already factored) it might be necessary to fall back on sympy.gcd. rWr6c[RRU5Vs/sH>n[U[[R 45(dM*[ [ U55PM@ nn[R"U5$s snfrE) rGMul make_argsrFintIntegerabsmathprod)rWarginteger_coefficientss r=integer_coefficient0simple_floordiv_gcd..integer_coefficientsgyy**1-+ -#U]]34 CCM- + yy-.. + s )A?A?r5c>[T[RRU55n[R "[ RU5$rE)maprGAddrarTreduceregcd)r5integer_factorsris r=integer_factor+simple_floordiv_gcd..integer_factors:), !4!4T!:* /::r?c3.># UH nTU;v M g7frErZ)rJ base_splitrWs r=rL&simple_floordiv_gcd..s=:qJs) rGBasicrbrerolistrlr`rarmall)r\r]rqro base_splits divisor_splitrirWs @@r=simple_floordiv_gcdr{{s"/u{{/s/;U[[;S; xxq)>!+<=C 7AGq15 EII  !4!4Q!782K.3YY-@-@-CM  == = ='C Jr?c F\rSrSr%SrSr\\S4\S'Sr \\S'Sr \ \S '\ S \ R4S j5r\ S \ R4S j5rS \ R"R$S \4Sjr\S\ R,S\ R,S \\ RS44Sj5rSrg)rz We maintain this so that: 1. We can use divisibility guards to simplify FloorDiv(a, b) to a / b. 2. Printing out the expression is nicer (compared to say, representing a//b as (a - a % b) / b) NB: This is Python-style floor division, round to -Inf r8.nargs# precedenceT is_integerr6c URS$NrrBselfs r=base FloorDiv.baseyy|r?c URS$Nrrrs r=divisorFloorDiv.divisorrr?printercURUR[SS- 5nURUR[SS- 5nSUSUS3$)NAtomg?(z//)) parenthesizerrr)rrrrs r= _sympystrFloorDiv._sympystrsW##DIIz&/AC/GH&&t||Z5G#5MN4&7)1%%r?rrNc* UR(a [S5eU[[*[R[R*4;a@U[[*[R[R*4;a[R $U[R LdU[R La[R $UR(a[R R$UR(a[US5(aU$UR(a([US5(a[R"US5$[U[R5(Ga"[U[R5(GaU[[*[R[R*4;d0U[[*[R[R*4;a[U5[U5- nU[R:Xa[$U[R*:Xa[*$[R "U5(a[R $[R""[R$"U55$[U[R"5(aJ[U[R"5(a+[R""['U5['U5-5$[U[(5(a)[)UR*SUR*SU-5$[U[R"5(aSn/n[R,R/U5H/nXb- nUR(dMUR1U5 XG- nM1 [3U5S:wa&[)U[R,"USS06- U5U-$[5X5n[US5(a5[U[R,5(a[R6"X5n[US5(d8[)[R8"X- 5[R8"X(- 55$g![R:a gf=f)Ndivision by zerorrevaluateF)is_zeroZeroDivisionErrorrrGoonanr Zerorrr`rFNumberrPreinfisnanrcfloorrbrrBrmraappendr:r{rosimplifyPolynomialError) clsrrrQ quotientstermstermquotientros r=eval FloorDiv.evals1 ??#$67 7 FVGUXXy9 9g  G HH XXI J ? 99  599 599 499  <<77<<  ??|GQ77K ??|GR8899T2& & tU\\ * *7ELL11&%((UXXI>>vw588)DDd eGn,ADHH} txxiwAyy }}TZZ]33 dEMM * *z'5==/Q/Q==Tc'l!:; ; dH % %DIIaL$))A,*@A A gu}} - -IE ++D1>&&&LL&)I 25zQTEIIu$Eu$EEwO  %d4CC## 7EII(F(Fii.Q''NN4:.w}0M($$   sBQ;;RRrZ)__name__ __module__ __qualname____firstlineno____doc__rr rb__annotations__rrboolpropertyrGrvrrprinting StrPrinterstrr classmethodrcr r__static_attributes__rZr?r=rrs"E5c?!JJ ekk&!:!:&s&P==P+0==P u{{D !PPr?rc \rSrSr%SrSr\\S4\S'Sr \ \S'Sr \\S '\ S \ RS \ RS \ RS \\ R 4Sj5rS \\ 4SjrS \\ 4SjrSrg)r i)zC ModularIndexing(a, b, c) => (a // b) % c where % is the C modulus .rTrrrrrmodulusr6cUS:XdUS:Xa[RR$[U[R5(aE[U[R5(a&[U[R5(aX-U-$US:waU[R "X5nUS:wa9[ [R"X- 5[R"X$- 5U5$[U[R5(Ga/nSnURHn[R "XsU-5X2-:wdM$[U[R5(aUS:d^[U[R5(aC[URS[R5(aURSS:aSn OURU5 M [U5[UR5:waU(a[ [U5X#5$[U[5(a*[ URSURSU-U5$g![Ra GNf=f)NrrTF)rGr rrFrcror rrrmrBr`rr:sumr)rrrrro new_terms all_positivers r=rModularIndexing.eval2s 191 77<<  tU]] + +7EMM227EMM22Ow. . !|ii.!8*tz2w}5 dEII & &-/I!%L 99TW#459JJ"477D1H"433&tyy|U]]CC IIaL1, (- !((." 9~TYY/L&s9~wHH dH % %"499Q<11GQ Q9$$   s AII-,I-cdURSSup[URUR5$Nr8)rBr[is_nonnegativerr\r]s r=_eval_is_nonnegative$ModularIndexing._eval_is_nonnegativegs,yy!}((!*:*:;;r?cdURSSup[URUR5$r)rBr[ is_positivers r=_eval_is_positive!ModularIndexing._eval_is_positiveks(yy!} q}}55r?rZN)rrrrrrr rbrrrrrrGrcrrvrrrrrZr?r=r r )s"E5c?!JJ2==2+0==2CH==2 %++ 22h6r?r c \rSrSr%SrSr\\S4\S'Sr \\S'S\ \ 4S jr S\ \ 4S jr S\ \ 4S jr\S \R"S \R"S\R"S\ \R"4Sj5rSrg)r!ipz Good ol' ternary operator r.rrrr6cURSR(a URSR(aS$S$Nrr8TrBrrs r=_eval_is_integerWhere._eval_is_integerxs.yy|..499Q<3J3JtTPTTr?cURSR(a URSR(aS$S$r)rBrrs r=rWhere._eval_is_nonnegative{s9yy|**tyy|/J/J   r?cURSR(a URSR(aS$S$rrBrrs r=rWhere._eval_is_positives.yy|//DIIaL4L4LtVRVVr?cr\r]c\U[R:XaU$U[R:XaU$grE)rGtruefalse)rrr\r]s r=r Where.evals(  ?H %++ Hr?rZN)rrrrrrr rbrrrrrrrrrGrvrrrZr?r=r!r!ps"E5c?!JU(4.U htn W8D>W  % 05  %++ r?r!c\rSrSr%Sr\\S4\S'Sr\\S'Sr \ \S'\ S \ RS \ RS \\ R4S j5rS \\ 4S jrS \\ 4SjrSrg)r"ir~.rrrTrr\r]r6cUR(a [S5eU[RLdXU*4;dUS:Xa[R$UR(aUR(aX-$UR(aHUS:XaBUR (a[R$UR (a[R$X- nUR(a[R$X:nUR(a#[U5(aUR(aU$[R"X5S:Xa[R$g)NModulo by zerorr8r)rrr r is_Numberis_evenis_oddOner is_BooleanrrrGr#rr\r]rQlesss r=rPythonMod.evals 99#$45 5 ;!A2w,!q&66M ;;1;;5L ;;16yyvv xxuu  E <<66M u ??tDzzammH 99Q?a 66Mr?cFURSR(aS$S$NrTrrs r=rPythonMod._eval_is_nonnegativeyy|//t9T9r?cFURSR(aS$S$r)rB is_negativers r=_eval_is_nonpositivePythonMod._eval_is_nonpositiverr?rZN)rrrrrr rbrrrrrrGrrrrrrrZr?r=r"r"s!E5c?!JJ*UZZ*EJJ*8EJJ3G**Z:htn::htn:r?r"c@\rSrSr%SrSr\\S'SrSr \ S5r Sr g) r#ir~rrTcUR(a [S5eU[RLdXU*4;dUS:Xa[R$UR(a/UR(aUS:dU5eUS:dU5eX-$UR(aHUS:XaBUR (a[R$UR (a[R$X- nUR(a[R$X:nUR(a%[U5(aUR(aU$ggg)Nrrrr8) rrr rrrrrrrrrrs r=rMod.evals 99#$45 5 ;!A2w,!q&66M ;;1;;6 1 66 1 65L ;;16yyvv xxuu  E <<66M u ??tDzzammH/.Os6  r)sympy.core.parametersrpopr"_satisfy_unique_summations_symbols frozenset_new_args_filterrzero_collapse_arguments_find_localzerosidentityr:rwrrr_argsetunique_summations_symbols)r original_args assumptionsrrrBr!objs r=rMinMaxBase.__new__Ks;??:/@/I/IJ6 6  77 F "  !!5!5d!;< )0..tC{C++D@K@<<  t9>:>># #ll3>>+> (A% 3  xx sDD! D!r6cT[U5S:wag[US[5(a USUS4O USUS4up#[U5(dg[U5(aUR U5$[U[5(a#[ USS5nUbUR U/U5$g)au One common case in some models is building expressions of the form max(max(max(a+b...), c+d), e+f) which is simplified to max(a+b, c+d, e+f, ...). For such expressions, we call the Max constructor X times (once for each nested max) and the expression gets flattened. An expensive cost in constructing those expressions is running _collapse_arguments and _find_localzeros. However, those two optimizations are unnecessary when the args to max are all of the form a+b, c+d, ..etc where each term uses a unique set of symbols. This function is used to detect such properties of the expressions we are building and if so inform that we do not need to run those optimizations. To detect those, we store a property in the expression that tells that this expression is a min/max operation over terms that use unique symbols "unique_summations_symbols". This property also memoize the set of symbols used in all the terms to make it faster to detect this property inductively. When we apply max to add a new term, all we need to do is check if the new term uses unique symbols (with respect to existing terms and itself). Example: t = Max(a+b, c+d) ==> satisfies the property Max(t, h+j) ==> h,j not in [a,b,c,d] => satisfy the property. The function returns None if the new expression does not satisfy the unique_summations_symbols property. Otherwise, it returns a new set of unique symbols. r8Nrrr!)r:rFrr>_unique_symbolsgetattr)rrBlhsrhslhs_unique_summations_symbolss r=r-MinMaxBase._satisfy_unique_summations_symbolsxs< t9>$q':..!Wd1g q'47#  ,C00 ( , ,&&t, , c: & &,30$- )-8**C52OPPr?N initial_setcUc [5OUnUHinUR5HRn[U[RR R 5(d gXS;a gURU5 MT Mk U$)z Return seen_symbols if all atoms in all args are all unique symbols, else returns None. initial_set can be used to represent initial value for seen_symbols N)setatomsrFrGcoresymbolSymboladd)rrBr- seen_symbolsrgelements r=r'MinMaxBase._unique_symbolssk!, 3su C99;!'5::+<+<+C+CDD, $$W- 'r?c |^^^U(dU$[[U55nT[La[mO[mUSR(Ga//4=nupEUHan[ U[[5HEnUR SR(dM#U[U[5RU5 MG Mc [RnUH1nUR SnUR(dM%Xx:S:XdM/UnM3 [Rn UH1nUR SnUR(dM%Xy:S:XdM/Un M3 T[La)UH"n U R(d OCX:S:XdM U nM$ O2T[:Xa(UH"n U R(d OX:S:XdM U n M$ Sn T[LaU[R:wa[mUn OU [R:wa[mU n U bg[[U55HOnXn [U T5(dMU R Sn T[:XaX:OX:S:XdMATRX'MQ UU4Sjm[U5H(uplXS-SVs/sH nT"X5PM snXS-S&M* UU4Sjn[U5S:aU"U5nU$s snf)aRemove redundant args. Examples ======== >>> from sympy import Min, Max >>> from sympy.abc import a, b, c, d, e Any arg in parent that appears in any parent-like function in any of the flat args of parent can be removed from that sub-arg: >>> Min(a, Max(b, Min(a, c, d))) Min(a, Max(b, Min(c, d))) If the arg of parent appears in an opposite-than parent function in any of the flat args of parent that function can be replaced with the arg: >>> Min(a, Max(b, Min(c, d, Max(a, e)))) Min(a, Max(b, Min(a, c, d))) rTNc |>[U[[45(dU$XR;nU(d3UR"URVs/sH nT"X15PM snSS06$[UT5(a:UR"URVs/sHo3U:wdM T"X15PM snSS06$U$s snfs snf)NrF)rFMinMaxrBfunc)airKcondirdos r=r@*MinMaxBase._collapse_arguments..dosb3*-- U4Sjn[XSS9up#U(dU$UVs/sHn[UR5PM nn[R"U6nU(dU$[ U5nUVs/sHoU- PM n n[ U 5(a/U V s/sH n T"U SS06PM n n UR T "U SS065 T"USS06n X[UT5$rE)rF)rgothers r=GMinMaxBase._collapse_arguments..factor_minmax../s :c5#9r?T)binaryrF)rr/rB intersectionrwrxr)rBis_other other_argsremaining_argsrgarg_setscommonnew_other_argsarg_set arg_sets_diffsother_args_diffother_args_factoredrrDs r= factor_minmax5MinMaxBase._collapse_arguments..factor_minmax.s9H)-dT)J &J 2<<#CHH H<%%x0F !&\N=EFX'v-XMF=!!FS"Tm5!##6J!KLLhh"3'' $S88## ! $sB%B9'B7(B9c [5nSnUHfnUR(aAUcUnMU[La [XE5nM1U[La [ XE5nMG[ SU35eURU5 Mh UcU$[U5S:XaU1$[U5S:Xa^[[U55nUS;aUR(aU[LaU$U1$US:XaUR(aU[LaU$U1$URU5 U$)aV Sequentially allocate values to localzeros. When a value is identified as being more extreme than another member it replaces that member; if this is never true, then the value is simply appended to the localzeros. Unlike the sympy implementation, we only look for zero and one, we don't do generic is connected test pairwise which is slow Nz impossible rr)gr) r/rr;maxr:minAssertionErrorr4r:nextiterrr)rvaluesoptions other_values num_valuerg other_values r=rMinMaxBase._find_localzerosfsu  C}}$ #Icz$' $7 $' $7 ,{3%-@AA  %    |  !;  |  !tL12KH$)C)C'*cz|B {BA~+"9"9'*cz|B {B#r?c:[SUR55$)Nc38# UHoRv M g7frE) is_algebraicrJr?s r=rL&MinMaxBase...(HArrrBrQs r=rEMinMaxBase.5(H(H#Hr?c:[SUR55$)Nc38# UHoRv M g7frE)is_antihermitianrvs r=rLrw-$*qFrryrzs r=rEr{u-$%FF-(r?c:[SUR55$)Nc38# UHoRv M g7frE)is_commutativervs r=rLrw+"(Q&rryrzs r=rEr{U+"#&&+&r?c:[SUR55$)Nc38# UHoRv M g7frE) is_complexrvs r=rLrw&DV||Vrryrzs r=rEr{&DQVV&D!Dr?c:[SUR55$)Nc38# UHoRv M g7frE) is_compositervs r=rLrwrxrryrzs r=rEr{r|r?c:[SUR55$)Nc38# UHoRv M g7frE)rrvs r=rLrw#>v!IIvrryrzs r=rEr{e#>qvv#>>r?c:[SUR55$)Nc38# UHoRv M g7frE) is_finitervs r=rLrws%B6akk6rryrzs r=rEr{s%B166%B Br?c:[SUR55$)Nc38# UHoRv M g7frE) is_hermitianrvs r=rLrwrxrryrzs r=rEr{r|r?c:[SUR55$)Nc38# UHoRv M g7frE) is_imaginaryrvs r=rLrwrxrryrzs r=rEr{r|r?c:[SUR55$)Nc38# UHoRv M g7frE) is_infinitervs r=rLrw'Fv! vrryrzs r=rEr{%'Fqvv'F"Fr?c:[SUR55$)Nc38# UHoRv M g7frE)rrvs r=rLrwrrryrzs r=rEr{rr?c:[SUR55$)Nc38# UHoRv M g7frE) is_irrationalrvs r=rLrw)J6a//6rryrzs r=rEr{E)J166)J$Jr?c:[SUR55$)Nc38# UHoRv M g7frErrvs r=rLrwrrryrzs r=rEr{rr?c:[SUR55$)Nc38# UHoRv M g7frE) is_nonintegerrvs r=rLrwrrryrzs r=rEr{rr?c:[SUR55$)Nc38# UHoRv M g7frErrvs r=rLrwrrryrzs r=rEr{rr?c:[SUR55$)Nc38# UHoRv M g7frE)is_nonpositivervs r=rLrwrrryrzs r=rEr{rr?c:[SUR55$)Nc38# UHoRv M g7frE) is_nonzerorvs r=rLrwrrryrzs r=rEr{rr?c:[SUR55$)Nc38# UHoRv M g7frE)rrvs r=rLrws"->-E-E)F G #ejj''../ 0$EEN4,,\IEH>MBOHHFDJFJEM?Mr?rcZ\rSrSrSr\R r\Rr Sr Sr Sr Sr g)r;iz5 Return, if possible, the maximum value of the list. c:[SUR55$)Nc38# UHoRv M g7frErrIs r=rL(Max._eval_is_positive..9y! yrrrBrs r=rMax._eval_is_positive9tyy999r?c:[SUR55$)Nc38# UHoRv M g7frErrIs r=rL+Max._eval_is_nonnegative..s<)Q(()rrrs r=rMax._eval_is_nonnegatives<$))<<.: 1 rrrBrs r=rMax._eval_is_negative: :::r?rZN)rrrrrr InfinityrNegativeInfinityrrrrrrZr?r=r;r;s, ::D!!H:=;r?r;cZ\rSrSrSr\R r\Rr Sr Sr Sr Sr g)r:iz5 Return, if possible, the minimum value of the list. c:[SUR55$)Nc38# UHoRv M g7frErrIs r=rL(Min._eval_is_positive..rrrrs r=rMin._eval_is_positiverr?c:[SUR55$)Nc38# UHoRv M g7frErrIs r=rL+Min._eval_is_nonnegative..s=9a))9rrrs r=rMin._eval_is_nonnegatives=499===r?c:[SUR55$)Nc38# UHoRv M g7frErrIs r=rL(Min._eval_is_negative..rrrrs r=rMin._eval_is_negativerr?rZN)rrrrrr rrrrrrrrrZr?r=r:r:s,  DzzH;>:r?r:cNSnUS:aU*nUS-S:XaSOSnU[X5-$)Nrrr8r) _safe_pow)rexpsigns r=safe_powr s6 D axu!GqLqb )D& &&r?cUS:a [S5eUS:Xag[XS-5nU[La[$X"-nU[R:a[$US-S:XaX0-nU[R:a[$U$)NrzExponent must be non-negative.rr8)r r rsysmaxsize)rexponenthalf_expresults r=r r s~!|9::1}!m,H6  F   !|q CKK M Mr?c8\rSrSr%SrSr\\S'\S5r Sr g)r3iT2rc[U[R5(aS[U[R5(a4[X5nU[*[4;aU$[R"U5$[U[R5(a[R "X5$U[[R 4;a9UR(a[$UR(a[R$ggrE) rFrGrcr rPowrrrzoo)rrr rQs r=rPowByNatural.eval s dEMM * *z#u}}/M/M#AfWf%%==# # c5== ) )99T' ' 6588$ $"" !!yy " %r?rZN) rrrrrrrbrrrrrZr?r=r3r3s#JJ!!r?r3c8\rSrSr%SrSr\\S'\S5r Sr g)r2iT<rc[U[R5(aK[U[R5(a+[R"[ U5[ U5-5$ggrE)rFrGrrHrP)rrr s r=r FloatPow.eval$sJ dELL ) )jell.K.K;;uT{eCj89 9/L )r?rZN rrrrrrrbrrrrrZr?r=r2r2s#GJ::r?r2c8\rSrSr%SrSr\\S'\S5r Sr g)r)i5TrrcUR(a [S5e[U[R5(aK[U[R5(a+[R "[ U5[ U5- 5$ggNr)rrrFrGrrHrPrs r=rFloatTrueDiv.eval:s] ??#$67 7 dELL ) )j%,,.O.O;;uT{U7^;< </P )r?rZNrrZr?r=r)r)5s#GJ==r?r)c8\rSrSr%SrSr\\S'\S5r Sr g)r(iNTrrcUR(a [S5e[U[R5(a[U[R5(aU[ [ *[R [R *4;d0U[ [ *[R [R *4;a+[R"[U5[U5- 5$[U[R5(aK[U[R5(a+[R"[U5[U5- 5$ggr!) rrrFrGrrrrHrPrcrbrs r=rIntTrueDiv.evalSs ??#$67 7 tU\\ * *7ELL11&%((UXXI>>vw588)DD ;;uT{U7^;< < dEMM * *z'5==/Q/Q;;s4y3w<78 80R *r?rZNrrZr?r=r(r(Ns#GJ99r?r(c(\rSrSrSr\S5rSrg)r,imTc [U5S-S:Xde[U5S-nUSUnXSnSSKJn [SU55(a=U"UVs/sHn[ U5PM snUVs/sHn[ U5PM sn5$US:Xa<USR (a USS:XagUSR (a USS:ag[SU55(aUS:wde[ [[ X45[R"S5S96upx[SUSS 55(aEUSS S -nU"UVs/sHn[ U5PM snUVs/sHn[ U5PM sn5$gs snfs snfs snfs snf) Nr8r)!eval_is_non_overlapping_and_densec3V# UHn[U[R5v M! g7frErFrGrcrIs r=rL9IsNonOverlappingAndDenseIndicator.eval..|s:Tz!U]]++TrNrc3V# UHn[U[R5v M! g7frEr*rIs r=rLr+s=Wz!U]]++WrN)keyc3V# UHn[U[R5v M! g7frEr*rIs r=rLr+sFA:a//rNr)*) r:%torch.fx.experimental.symbolic_shapesr(rxrbrzipsortedoperator itemgetter) rrBdimsizesstridesr(rKs_sizes s_stridess r=r&IsNonOverlappingAndDenseIndicator.evalps4y1}!!!$i1nQs t*  :T: : :4!&'AQ'')B'Q#a&')B  !8qz## aQx!!eAhl =W= = =!8O8"%E+1D1DQ1GH" GF"FFF!#2,.9%,-WSVW- /J 1A /JG()B@./JsE6*E; >FF rZNrrZr?r=r,r,msJ00r?r,c(\rSrSrSr\S5rSrg)r-iTc[U[R5(a3[R"[R "[ U555$grE)rFrGrrHretruncrPrs r=rTruncToFloat.evals8 fell + +;;tzz%-89 9 ,r?rZNrrrrrrrrrZr?r=r-r-sG::r?r-c(\rSrSrSr\S5rSrg)r.iTc.U[R[4;a[$U[R*[*4;a[*$[U[R5(a3[R "[ R"[U555$grE) rGrrrFrrcrer=rPrs r=rTruncToInt.evalsh ehh' 'M uxxi&) )7N fell + +==E&M!:; ; ,r?rZNrrZr?r=r.r.rr?r.c(\rSrSrSr\S5rSrg)r/iTcU[RLa[$U[R*La[*$[U[R5(a)[R "[ [U5S55$gr)rGrrrFrrcroundrPrs r=rRoundToInt.evalsZ UXX M ehhY 7N fell + +==uV}a!89 9 ,r?rZNrrZr?r=r/r/sJ::r?r/c(\rSrSrSr\S5rSrg)r0iTc[U[R5(aR[U[R5(a2[R"[ [ U5[U555$ggrE)rFrGrrcrHrErPrb)rrndigitss r=rRoundDecimal.evalsL fell + + 7EMM0R0R;;uU6]CLAB B1S +r?rZNr?rZr?r=r0r0sGCCr?r0c(\rSrSrSr\S5rSrg)r1iTc6U[R[R*4;aU$[U[R5(a[R"[ U55$U[ La[R$U[ *La[R*$grE)rGrrFrcrHrbrrs r=r ToFloat.evalsn ehh * *M femm , ,;;s6{+ + V 88O fW HH9  r?rZNr?rZr?r=r1r1sG  r?r1c.\rSrSrSrSrSrSrSrSr g) r4iz, Prevents expansion and other optimizations c(SURSS3$)Nz Identity(rrrrs r=__repr__Identity.__repr__s499Q<.**r?c4URSR$r)rBrrs r=rIdentity._eval_is_realsyy|###r?c4URSR$rrrs r=rIdentity._eval_is_integersyy|&&&r?rZN) rrrrrrrQrrrrZr?r=r4r4sJ+$'r?r4cb^"U4SjS[R5nST-nX!lX!lU$)Nc6>\rSrSrSrYr\U4Sj5rSrg)+make_opaque_unary_fn..OpaqueUnaryFni a Unlike the builtin sympy functions on real numbers like sympy.sqrt, these equivalents do not do any nontrivial reasoning besides constant propagation. This helps avoid performing transformations that are valid for real numbers but are invalid for floating point; in particular, while we are willing to make optimizations that change numerics for Tensor compute, we are NOT willing to make optimziations that change numerics for size compute. c>[U[R[R45(a4[R"[ [ T5"[ U555$U[R[R*[R[R*[[*4;agU[La[RnU[*La[R*nTS:Xa[R"US5$[ [T5"U5$g![a [ [T5"U5s$f=f)Nlog2r8) rFrGrcrHr(rerP OverflowErrorrrrlog)rrKnames r=r0make_opaque_unary_fn..OpaqueUnaryFn.evals!emmU[[9:: 3 ;;wtT':58'DEE uxx%((EII z6F7SS;A< A6> 99Q?*ud+A..%3"5$/223s2D D?>D?rZN) rrrrr_torch_handler_namerrr)r^sr= OpaqueUnaryFnrY s" #    r?raOpaqueUnaryFn_)rGFunctionrr)r^ranms` r=make_opaque_unary_fnre s2##J D B!# r?sqrtcoscoshsinsinhtantanhasinacosatanr r]asinhr[c^^^TS:Xa [SmOTS:Xa [SmO[ST35e"UUU4SjS[R5nST-UlU$) N bitwise_and BitwiseAnd bitwise_or BitwiseOrz unrecognized cD>\rSrSr%YrYr\\S'\U4Sj5r Sr g))make_opaque_bitwise_fn..BitwiseFniQrcD>UR(a'UR(a[[T5"X5$UR(a[R"U(aSOS5nUR(a[R"U(aSOS5n[ U[R[ 45(ab[ U[R[ 45(a=[R"[[T5"[ U5[ U555$g)Nrr)rr(r3rGrcrFrb)rrKb real_op_names r=r.make_opaque_bitwise_fn..BitwiseFn.evalUs|| x6q<<||MMq!a0||MMq!a0!emmS122zEMM3'88}}WX|%DSVSQRV%TUUr?rZN) rrrrr`rrbrrrr)r^precrzsr= BitwiseFnrwQs%" C    r?r} BitwiseFn_)rrjrGrcr)r^rzr}r|s`` @r=make_opaque_bitwise_fnrIsc },'  +&}TF344ENN$&,I r?rrand_rtor_)`rTrer3rtypingrrrrrrr r r rGr sympy.corersympy.core.exprrsympy.core.functionrsympy.core.logicrrrsympy.core.numbersrsympy.core.operationsrrsympy.core.sortingrsympy.core.traversalrsympy.printing.precedencersympy.utilities.iterablesrnumbersrr__all__rr>rHrVr[rvr{rcrr r!r"r#r$r%r&r'r*r+rr;r:r r r3r2r)r(r,r-r.r/r0r1r4reOpaqueUnaryFn_sqrtOpaqueUnaryFn_cosOpaqueUnaryFn_coshOpaqueUnaryFn_sinOpaqueUnaryFn_sinhOpaqueUnaryFn_tanOpaqueUnaryFn_tanhOpaqueUnaryFn_asinOpaqueUnaryFn_acosOpaqueUnaryFn_atanOpaqueUnaryFn_expOpaqueUnaryFn_logOpaqueUnaryFn_asinhOpaqueUnaryFn_log2rBitwiseFn_bitwise_andBitwiseFn_bitwise_orrZr?r=rs[       +77+9&%0* T'B 4uzzd 8CG$ #uR_7M2M)N 8D>htn )5;;)5;;)5;;)|mu~~m`D6ennD6NENNB8:8:x1%..1hx ; ; < < ;enn ; U^^ U^^ p?yp?f ;*k;$:*k:$'4!5>>!6 :u~~ :,=5>>=299>44p :5>> : < < : :<C5>>C enn  'u~~'"*\*&1(/)&1(/)&1(/)&1)&1)&1)&1(/(/*73)&1</}fE-lEBr?