Rjg6SSKrSSKrSSKrSSKrSSKJr SSKJrJrJ r SSK J r J r SSK r SSK Jr SSKJr SSKJr SSKJr SS KJrJrJr SS KJr SS KJrJr SS KJr SS K J!r! SSK"J#r# SSK$J%r% SSK&J'r' SSK(J)r)J*r* \(aSSKJ+r+ \ "S\S9r,\ "S5r-/SQr.S\ R$S\/4Sjr0S\\ \-/\,4S\\ \-/\,\ Rb-44Sjr2S\/S-S\/S-S\/S-4Sjr3S \ RhS!\ RhS\ Rh4S"jr5"S#S$\ Rl5r7"S%S&\ Rl5r8"S'S(\ Rl5r9"S)S*\ Rl5r:"S+S,\ Rl5r;"S-S.\75r<"S/S0\ Rl5r="S1S2\ Rl5r>"S3S4\ Rl5r?"S5S6\ Rl5r@"S7S8\ Rl5rA"S9S:\\5rB"S;S<\B\5rC"S=S>\B\5rDS?rES@rF"SASB\ Rl5rG"SCSD\ Rl5rH"SESF\ Rl5rI"SGSH\ Rl5rJ"SISJ\ Rl5rK"SKSL\ Rl5rL"SMSN\ Rl5rM"SOSP\ Rl5rN"SQSR\ Rl5rO"SSST\ Rl5rP"SUSV\ Rl5rQSWrR\R"SX5rS\R"SY5rT\R"SZ5rU\R"S[5rV\R"S\5rW\R"S]5rX\R"S^5rY\R"S_5rZ\R"S`5r[\R"Sa5r\\R"Sb5r]\R"Sc5r^\R"Sd5r_\R"Se5r`Sfra\a"SgSh5rb\a"SiSj5rc\a"SkSl5rdg)mN)Callable) SupportsFloat TYPE_CHECKINGTypeVar) TypeVarTupleUnpack)Ssympify)Expr) Application)_torf fuzzy_andfuzzy_or) equal_valued) LatticeOp ShortCircuit)ordered)walk) PRECEDENCE)sift) TorchVersion)int_oo is_infinite)Iterable_T)bound_Ts)FloorDivModularIndexingWhere PythonModModCleanDiv CeilToInt FloorToIntCeilDiv IntTrueDiv FloatTrueDivLShiftRShift!IsNonOverlappingAndDenseIndicator TruncToFloat TruncToInt RoundToInt RoundDecimalToFloatFloatPow PowByNaturalIdentityexprreturncd[U[R5=(a UR=(a} [ UR 5S:H=(a^ UR SR =(a> UR SR =(a UR SUR SL$)Nrr) isinstancesympyr is_Addlen_args is_symbol)r6s m/root/GenerationalWealth/GenerationalWealth/venv/lib/python3.13/site-packages/torch/utils/_sympy/functions.py_is_symbols_binary_summationrA\s 4$ / KK /  Oq  / JJqM # # / JJqM # #  / JJqMA . fc^[R"T5S[[S[[ R -4U4Sjj5nU$)Nargsr7c>T"U6n[SU55(a>[U[R5(d[R"[ U55nU$)Nc3V# UHn[U[R5v M! g7fN)r:r;Float.0as r@ -_keep_float..inner..ns84az!U[[))4'))anyr:r;rIfloat)rErrCs r@inner_keep_float..innerksMh 848 8 8 u{{B B  E!H%ArB) functoolswrapsrrrr;rI)rCrSs` r@ _keep_floatrWhsB__QVC[R%++%5 LrBxycSX4;agX:H$rH)rXrYs r@fuzzy_eqr\xs v~ 6MrBpqc^^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. rXr7c[RRU5Vs/sH>n[U[[R 45(dM*[ [ U55PM@ nn[R"U5$s snfrH) r;Mul make_argsr:intIntegerabsmathprod)rXarginteger_coefficientss r@integer_coefficient0simple_floordiv_gcd..integer_coefficientsgyy**1-+ -#U]]34 CCM- + yy-.. + s )A?A?r6c>[T[RRU55n[R "[ RU5$rH)mapr;AddrbrUreducerfgcd)r6integer_factorsrjs r@integer_factor+simple_floordiv_gcd..integer_factors:), !4!4T!:* /::rBc3.># UH nTU;v M g7frHr[)rK base_splitrXs r@rM&simple_floordiv_gcd..s=:qJs) r;Basicrcrfrplistrmrarbrnall)r]r^rrrp base_splits divisor_splitrjrXs @@r@simple_floordiv_gcdr|~s"/u{{/s/;U[[;S; xxq)>!+<=C 7AGq15 EII  !4!4Q!782K.3YY-@-@-CM  == = ='C JrBcV\rSrSr%SrSr\\S4\S'Sr \\S'Sr \ \S '\ S \ R4S j5r\ S \ R4S j5rS \ R"R$S \4Sjr\S\ R,S\ R,S \ RS-4Sj5rS \ S-4SjrSrg)r z 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 r9.nargs# precedenceT is_integerr7c URS$NrrEselfs r@base FloorDiv.baseyy|rBc URS$Nrrrs r@divisorFloorDiv.divisorrrBprintercURUR[SS- 5nURUR[SS- 5nSUSUS3$)NAtom?(z//)) parenthesizerrrrrrrs r@ _sympystrFloorDiv._sympystrsW##DIIz&/AC/GH&&t||Z5G#5MN4&7)1%%rBrrNc UR(a [S5e[U5(a [U5(a[R$U[RLdU[RLa[R$UR(a[R R $UR(a[US5(aU$UR(a([US5(a[R"US5$X:Xa[R R$[U[R5(a[U[R5(a[U5(d[U5(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(GaSn/n[R.R1U5HnXb- nSn[U[R5(am[3[R45[3S5:aGUR7[R85n [;SU 55n UR=(a U nO URnU(dMUR=U5 XG- nM [?U5S:wa&[+U[R."USS06- U5U-$[AX5n [U S5(a5[U[R.5(a[RB"X5n [U S5(d8[+[RD"X- 5[RD"X+- 55$g![RFa gf=f) Ndivision by zerorrz1.15.0c3># UHoRS:Hv M g7f)rN)r^)rKrRs r@rM FloorDiv.eval..s,Iy!SSAXysevaluateF)$is_zeroZeroDivisionErrorrr;nanr ZerorrraOner:NumberrQrfinfrisnanrdfloorrcr rErnrbr __version__atomsRationalryappendr=r|rpsimplifyPolynomialError) clsrrrR quotientstermstermquotientquotient_is_integer rationalsall_rationals_intsrps r@eval FloorDiv.evalsc ??#$67 7 t  W!5!599  599 599 499  <<77<<  ??|GQ77K ??|GR8899T2& & ?77;;  tU\\ * *7ELL11T""k'&:&:d eGn,ADHH} txxiwAyy }}TZZ]33 dEMM * *z'5==/Q/Q==Tc'l!:; ; dH % %DIIaL$))A,*@A A gu}} - -IE ++D1> '+#h 22|%%8 *8+!)u~~ >I),,Iy,I)I&*2*=*=*TBT'*2*=*='&&LL&)I%2(5zQTEIIu$Eu$EEwO  %d4CC## 7EII(F(Fii.Q''NN4:.w}0M($$   s BR))S?ScURSSup[URURURUR/5(agg)Nr9T)rEryris_nonnegativerr]r^s r@_eval_is_nonnegativeFloorDiv._eval_is_nonnegative3sAyy!}  allA,<,N>NO P PrBr[)__name__ __module__ __qualname____firstlineno____doc__rtuplerc__annotations__rrboolpropertyr;rwrrprinting StrPrinterstrr classmethodrdrr__static_attributes__r[rBr@r r s"E5c?!JJ ekk&!:!:&s&V V V%++PTBTVVpdTkrBr c \rSrSr%SrSr\\S4\S'Sr \ \S'Sr \\S '\ S \ RS \ RS \ RS \ RS-4Sj5rS \ S-4SjrSrg)r!i;zC ModularIndexing(a, b, c) => (a // b) % c where % is the C modulus .rTrrrrrmodulusr7NcUS: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)r;r rr:rdrpr!rrrnrErarr=sumr )rrrrrp new_terms all_positivers r@rModularIndexing.evalDs 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$)Nr9)rEr\rrs r@r$ModularIndexing._eval_is_nonnegativexs,yy!}((!*:*:;;rBr[)rrrrrrrrcrrrrrr;rdrwrrrr[rBr@r!r!;s"E5c?!JJ1==1+0==1CH==1 t 11f%%diilDIIaL4K4Kc4QRvha  rBr[N) rrrrrrrrrrr[rBr@r&r&"s%J;;!!rBr&c(\rSrSrSr\S5rSrg)r'i5TcnU[R[4;a[$U[R*[4;a[*$[U[R5(aU$[U[R 5(a3[R"[ R"[U555$grH) r;rrr:rdrrfrrQrs r@rFloorToInt.eval8sz ehh' 'M uxxi( (7N femm , ,M fell + +==E&M!:; ; ,rBr[Nrrrrrrrrr[rBr@r'r'5sJ<.ms6  r)sympy.core.parametersr#popr"_satisfy_unique_summations_symbols frozenset_new_args_filterrzero_collapse_arguments_find_localzerosidentityr=rxr rr_argsetunique_summations_symbols)r original_args assumptionsr#rrEr1objs r@rMinMaxBase.__new__is;??:/@/I/IJ6 6  77 F "  !!5!5d!;< )0..tC{C++D@K@<<  t9>:>># #ll3>>+> (A% 3  xx sDD! D!r7NcT[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. r9Nrrr1)r=r:r!rA_unique_symbolsgetattr)rrElhsrhslhs_unique_summations_symbolss r@r)-MinMaxBase._satisfy_unique_summations_symbolss< t9>$q':..!Wd1g q'47#  ,C00 ( , ,&&t, , c: & &,30$- )-8**C52OPPrB 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)setrr:r;coresymbolSymboladd)rrEr= seen_symbolsrhelements r@r7MinMaxBase._unique_symbolssk!, 3su C99;!'5::+<+<+C+CDD, $$W- 'rBc |^^^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)r:MinMaxrEfunc)airLcondirdos r@rO*MinMaxBase._collapse_arguments..do8sb3*-- 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$rH)r:)rhothers r@GMinMaxBase._collapse_arguments..factor_minmax..Ns :c5#9rBT)binaryrF)rr?rE intersectionrxryr)rEis_other other_argsremaining_argsrharg_setscommonnew_other_argsarg_set arg_sets_diffsother_args_diffother_args_factoredrrSs r@ factor_minmax5MinMaxBase._collapse_arguments..factor_minmaxMs9H)-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?rrJmaxrIminrrCr=nextiterrr)rvaluesoptions other_values num_valuerh other_values r@r.MinMaxBase._find_localzerossu  C}}$ #Icz$' $7 $' $7 ,{3%-@AA  %    |  !;  |  !tL12KH$)C)C'*cz|B {BA~+"9"9'*cz|B {B#rBc:[SUR55$)Nc38# UHoRv M g7frH) is_algebraicrKrNs r@rM&MinMaxBase...(HAr&rrEr`s r@rTMinMaxBase.5(H(H#HrBc:[SUR55$)Nc3:# UHnURv M g7frH)is_antihermitianrs r@rMr-A rrs r@rTru--(rBc:[SUR55$)Nc3:# UHnURv M g7frH)is_commutativers r@rMr+A rrrs r@rTrU++&rBc:[SUR55$)Nc38# UHoRv M g7frH) is_complexrs r@rMr&DV||Vr&rrs r@rTr&DQVV&D!DrBc:[SUR55$)Nc38# UHoRv M g7frH) is_compositers r@rMrrr&rrs r@rTrrrBc:[SUR55$)Nc38# UHoRv M g7frH)rrs r@rMr#>v!IIvr&rrs r@rTre#>qvv#>>rBc:[SUR55$)Nc38# UHoRv M g7frH) is_finiters r@rMrs%B6akk6r&rrs r@rTrs%B166%B BrBc:[SUR55$)Nc38# UHoRv M g7frH) is_hermitianrs r@rMrrr&rrs r@rTrrrBc:[SUR55$)Nc38# UHoRv M g7frH) is_imaginaryrs r@rMrrr&rrs r@rTrrrBc:[SUR55$)Nc38# UHoRv M g7frH)rrs r@rMr'Fv! vr&rrs r@rTr%'Fqvv'F"FrBc:[SUR55$)Nc38# UHoRv M g7frH)rrs r@rMrrr&rrs r@rTrrrBc:[SUR55$)Nc38# UHoRv M g7frH) is_irrationalrs r@rMr)J6a//6r&rrs r@rTrE)J166)J$JrBc:[SUR55$)Nc38# UHoRv M g7frHrrs r@rMrrr&rrs r@rTrrrBc:[SUR55$)Nc38# UHoRv M g7frH) is_nonintegerrs r@rMrrr&rrs r@rTrrrBc:[SUR55$)Nc3:# UHnURv M g7frHrrs r@rMrrrrrs r@rTrrrBc:[SUR55$)Nc3:# UHnURv M g7frH)is_nonpositivers r@rMrrrrrs r@rTrrrBc:[SUR55$)Nc38# UHoRv M g7frH) is_nonzerors r@rMrrr&rrs r@rTrrrBc:[SUR55$)Nc38# UHoRv M g7frH)rrs r@rMrs"MBOHHFDJFJEM?MrBr!cZ\rSrSrSr\R r\Rr Sr Sr Sr Sr g)rJiz5 Return, if possible, the maximum value of the list. c:[SUR55$)Nc38# UHoRv M g7frHrrJs r@rM(Max._eval_is_positive..9y! yr&rrErs r@rMax._eval_is_positives9tyy999rBc:[SUR55$)Nc38# UHoRv M g7frHrrJs r@rM+Max._eval_is_nonnegative..s<)Q(()r&rrs r@rMax._eval_is_nonnegatives<$))<<.: 1 r&rrErs r@rMax._eval_is_negatives: :::rBr[N)rrrrrr Infinityr,NegativeInfinityr/rrrrr[rBr@rJrJs, ::D!!H:=;rBrJcZ\rSrSrSr\R r\Rr Sr Sr Sr Sr g)rIiz5 Return, if possible, the minimum value of the list. c:[SUR55$)Nc38# UHoRv M g7frHrrJs r@rM(Min._eval_is_positive..rr&rrs r@rMin._eval_is_positives: :::rBc:[SUR55$)Nc38# UHoRv M g7frHrrJs r@rM+Min._eval_is_nonnegative..s=9a))9r&rrs r@rMin._eval_is_nonnegatives=499===rBc:[SUR55$)Nc38# UHoRv M g7frHrrJs r@rM(Min._eval_is_negative..rr&rrs r@rMin._eval_is_negatives9tyy999rBr[N)rrrrrr rr,rr/rrrrr[rBr@rIrIs,  DzzH;>:rBrIcNSnUS:aU*nUS-S:XaSOSnU[X5-$)Nrrr9r) _safe_pow)rexpsigns r@safe_powrs6 D axu!GqLqb )D& &&rBcUS:a [S5eUS:Xag[XS-5nU[La[$X"-nU[R:a[$US-S:XaX0-nU[R:a[$U$)NrzExponent must be non-negative.rr9)rrrsysmaxsize)rexponenthalf_expresults r@rrs~!|9::1}!m,H6  F   !|q CKK M MrBc8\rSrSr%SrSr\\S'\S5r Sr g)r4i+T2rc[U[R5(aS[U[R5(a4[X5nU[*[4;aU$[R"U5$[U[R5(a[R "X5$U[[R 4;a9UR(a[$UR(a[R$ggrH) r:r;rdrrPowrrrzoo)rrrrRs r@rPowByNatural.eval0s dEMM * *z#u}}/M/M#AfWf%%==# # c5== ) )99T' ' 6588$ $"" !!yy " %rBr[N) rrrrrrrcrrrrr[rBr@r4r4+s#JJ!!rBr4c8\rSrSr%SrSr\\S'\S5r Sr g)r3iFT<rc[U[R5(aK[U[R5(a+[R"[ U5[ U5-5$ggrH)r:r;rrIrQ)rrrs r@r FloatPow.evalKsJ dELL ) )jell.K.K;;uT{eCj89 9/L )rBr[N rrrrrrrcrrrrr[rBr@r3r3Fs#GJ::rBr3c8\rSrSr%SrSr\\S'\S5r Sr g)r*i\TrrcUR(a [S5e[U[R5(aK[U[R5(a+[R "[ U5[ U5- 5$ggNr)rrr:r;rrIrQrs r@rFloatTrueDiv.evalas] ??#$67 7 dELL ) )j%,,.O.O;;uT{U7^;< </P )rBr[Nr*r[rBr@r*r*\s#GJ==rBr*cF\rSrSr%SrSr\\S'\S5r S\ 4Sjr Sr g ) r)iuTrrc"UR(a [S5e[U[R5(aj[U[R5(aK[ U5(d[ U5(a+[R "[U5[U5- 5$[U[R5(aK[U[R5(a+[R "[U5[U5- 5$ggr-) rrr:r;rrrIrQrdrcrs r@rIntTrueDiv.evalzs ??#$67 7 tU\\ * *7ELL11T""k'&:&:;;uT{U7^;< < dEMM * *z'5==/Q/Q;;s4y3w<78 80R *rBr7cURURS[SS- 5nURURS[SS- 5nSUSUS3$)Nrrrrz((int)z/(int)r)rrErrs r@rIntTrueDiv._ccodes_##DIIaL*V2Ds2JK&&tyy|Z5G#5MNvVG9A..rBr[N) rrrrrrrcrrrrrrr[rBr@r)r)us/GJ 9 9//rBr)c(\rSrSrSr\S5rSrg)r-iTc T[U5S-S:wa[S[U535e[U5S-nUSUnXSnSSKJn [ SU55(a=U"UVs/sHn[ U5PM snUVs/sHn[ U5PM sn5$US:Xa<USR (a USS:XagUSR (a USS:ag[ SU55(aUS:Xa [S5e[[[X4S S 9[R"S5S 9S S 06upx[ S USS55(aEUSSS-nU"UVs/sHn[ U5PM snUVs/sHn[ U5PM sn5$gs snfs snfs snfs snf)Nr9rz*expected an even number of arguments, got )!eval_is_non_overlapping_and_densec3V# UHn[U[R5v M! g7frHr:r;rdrJs r@rM9IsNonOverlappingAndDenseIndicator.eval..s:Tz!U]]++TrOrc3V# UHn[U[R5v M! g7frHr8rJs r@rMr9s=Wz!U]]++WrOzdim must not be zeroT)strict)keyr;c3V# UHn[U[R5v M! g7frHr8rJs r@rMr9sFA:a//rOr)*) r=r%torch.fx.experimental.symbolic_shapesr6ryrcrzipsortedoperator itemgetter) rrEdimsizesstridesr6rLs_sizes s_stridess r@r&IsNonOverlappingAndDenseIndicator.evals t9q=A  Q>QRS>TU"" G F"FFF!#2,.9%,-WSVW- /J 1A /JK()BD./Js$F?F F 9F% r[Nrr[rBr@r-r-sJ55rBr-c(\rSrSrSr\S5rSrg)r.iTcU[R[R*4;aU$[U[R5(a3[R"[ R "[U555$grH)r;rr:rrIrftruncrQrs r@rTruncToFloat.evalsR ehh * *M fell + +;;tzz%-89 9 ,rBr[Nrrrrrrrrr[rBr@r.r.sG::rBr.c(\rSrSrSr\S5rSrg)r/iTc.U[R[4;a[$U[R*[*4;a[*$[U[R5(a3[R "[ R"[U555$grH) r;rrr:rrdrfrLrQrs r@rTruncToInt.evalsh ehh' 'M uxxi&) )7N fell + +==E&M!:; ; ,rBr[Nrr[rBr@r/r/sJ<URUS5nUbU$[TU] U5$)Nc X:$rHr[rLbs r@rT!Identity.__ge__..jafrB)rwsuper__ge__rrSout __class__s r@rIdentity.__ge__i.))%1DEos@57>%+@@rBcR>URUS5nUbU$[TU] U5$)Nc X:$rHr[r{s r@rT!Identity.__gt__..naerB)rwr__gt__rs r@rIdentity.__gt__m.))%1CDos@57>%+@@rBcR>URUS5nUbU$[TU] U5$)Nc X:*$rHr[r{s r@rT!Identity.__le__..rr~rB)rwr__le__rs r@rIdentity.__le__qrrBcR>URUS5nUbU$[TU] U5$)Nc X:$rHr[r{s r@rT!Identity.__lt__..vrrB)rwr__lt__rs r@rIdentity.__lt__urrBc2[URS5$r)rQrErs r@ __float__Identity.__float__ysTYYq\""rBr[)rrrrrrrr`rrrrrerfrorcrrrwrrrrrQrr __classcell__)rs@r@r5r5,sJ+#+4C4 $'KK 00  !!A AAAA#5##rBr5cb^"U4SjS[R5nST-nX!lX!lU$)Nc:>\rSrSrSrYr\r\U4Sj5r Sr g)+make_opaque_unary_fn..OpaqueUnaryFnia 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 optimizations 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)Nlog2r9) r:r;rdrIr8rfrQ OverflowErrorrr$rlog)rrLnames 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?r[N) rrrrr_torch_handler_namemake_opaque_unary_fn_torch_unpicklerrrr)rsr@ OpaqueUnaryFnrs( #/    rBrOpaqueUnaryFn_)r;Functionrr)rrnms` r@rr~s2$$L D B!# rBsqrtcoscoshsinsinhtantanhasinacosatanrrasinhrc^^^TS:Xa [SmO.TS:Xa [SmOTS:Xa [SmO[ST35e"UUU4SjS [R5nS T-nX2lX2lU$) N bitwise_and BitwiseAnd bitwise_xor BitwiseXor bitwise_or BitwiseOrz unrecognized ch>\rSrSr%YrYr\\S'\R"\ YS9r \ U4Sj5r Srg))make_opaque_bitwise_fn..BitwiseFnir) real_op_namecD>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)rr8rBr;rdr:rc)rrLr|rs r@r.make_opaque_bitwise_fn..BitwiseFn.evals|| x6q<<||MMq!a0||MMq!a0!emmS122zEMM3'88}}WX|%DSVSQRV%TUUrBr[N)rrrrrrrcrrUpartialmake_opaque_bitwise_fnrrrr)rprecrsr@ BitwiseFnrs=" C$,, "     rBr BitwiseFn_)rrr;rrr)rrrrrs`` @r@rrs~ },'  ,'  +&}TF344ENN*  B rBrand_ror_rxor)erUrfrBrcollections.abcrtypingrrrtyping_extensionsrrr;r sympy.corer sympy.core.exprr sympy.core.functionr sympy.core.logicrrrsympy.core.numbersrsympy.core.operationsrrsympy.core.sortingrsympy.core.traversalrsympy.printing.precedencersympy.utilities.iterablesrtorch.torch_versionrnumbersrrrrr__all__rrArIrWr\rwr|rr r!r"r#r$r%r&r'r(r+r,r!rJrIrrr4r3r*r)r-r.r/r0r1r2r5rOpaqueUnaryFn_sqrtOpaqueUnaryFn_cosOpaqueUnaryFn_coshOpaqueUnaryFn_sinOpaqueUnaryFn_sinhOpaqueUnaryFn_tanOpaqueUnaryFn_tanhOpaqueUnaryFn_asinOpaqueUnaryFn_acosOpaqueUnaryFn_atanOpaqueUnaryFn_expOpaqueUnaryFn_logOpaqueUnaryFn_asinhOpaqueUnaryFn_log2rBitwiseFn_bitwise_andBitwiseFn_bitwise_orBitwiseFn_bitwise_xorr[rBr@rs  $882  +77+9&%0*,(( T'5B 4 uzz d   r!"  vc{mR%++--.  t t t  )5;;)5;;)5;;)||u~~|~@BDBDL3%..3lx!!& < < ;enn ; U^^(U^^(w?yw?t ;*k;&:*k:&'4!5>>!6 :u~~ :,=5>>=2//F99z :5>> : < < : :<C5>>C enn  O#u~~O#d+^*&1(/)&1(/)&1(/)&1)&1)&1)&1(/(/*73)&1#L/}fE-lEB.}eDrB