9jxBSSKJr SSKrSSKJr SSKJr SSKJr SSKJ r SSK J r SSK r \R"SS S S S S S5rSrSrSSjrSrSrSSjr\R*=rr\R."SS/\ "5QSPSP7SSS9r\R."SSSSS S!S"S#S$S%S&S/ \ "5QSPSPS'PS(P7S)S*S9r\R4r\R."S+S/\ "5QSPSP7S,S-S9rS.rS/r\R."S0SS\4SS \4S!S"\4S#S$\4S%S&\4S/ \ "5QSPSPS'\4PS(\4P7S1S2S9rS3r\R."S0SS\4SS \4S!S"\4S#S$\4S%S&\4S/ \ "5QSPSPS'\4PS(\4P7S15r \R."S4S5/\ "S65QS7PS8P7S9S:S9r!S;r"SS?S@SASBSCSDSESFSGSHS5\#4/ \ "S6\#SI9QS7\#4PS8\#4PSJ\#4PSK\#4P7SL\"SMSNSOSP9r$SQr%\R."SRS>S?S@SASBSCSDSESFSGSHS5\%4/ \ "S6\%SI9QS7\%4PS8\%4PSJ\%4PSK\%4P7SS\"STSUSVSP9r&\R."SWS>S?S@SASBSCSDSESFSGSHSX/ \ "S6SYSI9QSZPS[PSJPSKP7SLS\S9r'\R."S]S>S?S@SASBSCSDSESFSGSHS^/ \ "S6S_SI9QS`PSaPSJPSKP7SSSbS9r(Scr)\R."SdSeSfSgShSiSjSkSlSmSnSoSp/ \ "SqSrSsSI9QStPSuPSvPSwP7Sx\)SySz9r*SS{jr+SS}jr,SS~jr-\R\R_S|S9S5r0SSjr1g)) annotationsN)_core)_routines_math)fusion) stride_tricks) bf16_loopz T x1, T x2zT yzx1 * x2za + bzy = a0 dot_productcURS:wdURS:wa [S5eURRS;dURRS;ag[ XU5(agg)Nz&Only 1d inputs are supported currentlybuidirectfft)ndimNotImplementedErrordtypekind_fftconv_faster)in1in2modes I/home/wildlama/miniconda3/lib/python3.13/site-packages/cupy/_math/misc.py_choose_conv_methodrsX xx1}A !"JKK yy~~#))..E"9s&& cg)zB .. seealso:: :func: `scipy.signal._signaltools._fftconv_faster` T)xhrs rrr&s rcURS:Xa [S5eURS:Xa [S5eURS:a [S5eURUR:aXpUR5nUR5n[ XU5nUS:Xa[ XU5nU$US:Xa[ XU5nU$[S5e) aRReturns the discrete, linear convolution of two one-dimensional sequences. Args: a (cupy.ndarray): first 1-dimensional input. v (cupy.ndarray): second 1-dimensional input. mode (str, optional): `valid`, `same`, `full` Returns: cupy.ndarray: Discrete, linear convolution of a and v. .. seealso:: :func:`numpy.convolve` rza cannot be emptyzv cannot be emptyr z"v cannot be multidimensional arrayrrzUnsupported method)size ValueErrorrravelr _dot_convolve _fft_convolve)avrmethodouts rconvolver)/s vv{,--vv{,--vvz=>>vv1  A  A t ,F A$' J 5A$' J-..rcSnURSURS:aXpSURSS-- nURRS:XdURRS:Xa4[RR[RR pTO3[RR [RRpT[R"X5nURSURSpSSK n U RRRXx-S- 5n U"X 5n U"X5n U"X-U 5n US:Xa SXx-S- pO.US:XaUS- S-U-nX-nOUS:XaUS- UpO [S 5eU S X24n URS ;a[R"U 5n U RUS S 9$)Nrr cfullsamevalidz5acceptable mode flags are `valid`, `same`, or `full`..iuFcopy)shaperrcupyrifftrfftirfft result_typecupyx.scipy.fftscipy next_fast_lenr!aroundastype)a1a2roffsetrr6rn1n2cupyxout_sizefa1fa2r(startends rr$r$Rs F xx|bhhrl"BRXXb\A%% xx}}rxx}}3HHLL$((--THHMM488>>T   R $E XXb\288B<{{,,RWq[9H b C b C sy( #C v~! s aA &j !VRs CE E c59n C zzTkk# ::e%: ((rc@SnURUR:aXpSURS-- n[R"X5nURURpeURUSS9nURUSS9nUS:Xa!XV-S- n[R"XS- 5nO?US:Xa,UnUS- S-U-n[R"XS- U- U45nO US:XaXV- S-nUR Sn [ R"UWU4X45n[XSSS 2SS 9n U $) Nrr r,Fr2r.r/r0r+)axis) r r5r9r>padstridesr as_strided _dot_kernel) r?r@rrArrBrCrEpad_sizestrideoutputs rr#r#ys! F wwBRWWq[   R $E WWbgg 5u %B 5u %B v~7Q; XXbq& ! Fq=6) XXb6H,h7 8 7Q; ZZ]F  ! !"xnv6F GB "XA .F Mrc[R"5(a$[R"[RXX#S9$UR XUS9$)aClips the values of an array to a given interval. This is equivalent to ``maximum(minimum(a, a_max), a_min)``, while this function is more efficient. Args: a (cupy.ndarray): The source array. a_min (scalar, cupy.ndarray or None): The left side of the interval. When it is ``None``, it is ignored. a_max (scalar, cupy.ndarray or None): The right side of the interval. When it is ``None``, it is ignored. out (cupy.ndarray): Output array. Returns: cupy.ndarray: Clipped array. .. seealso:: :func:`numpy.clip` Notes ----- When `a_min` is greater than `a_max`, `clip` returns an array in which all values are equal to `a_max`. r()r _is_fusing _call_ufunc_mathclip)r%a_mina_maxr(s rrXrXsF0!!%**"#E< < 66%C6 ((r cupy_cbrtze->ezf->fzd->dzout0 = cbrt(in0)zJElementwise cube root function. .. seealso:: :data:`numpy.cbrt` )doc cupy_squarezb->bzB->Bzh->hzH->Hzi->izI->Izl->lzL->Lzq->qzQ->QzF->FzD->Dzout0 = in0 * in0zIElementwise square function. .. seealso:: :data:`numpy.square` cupy_fabszout0 = abs(in0)zuCalculates absolute values element-wise. Only real values are handled. .. seealso:: :data:`numpy.fabs` zout0 = in0 > 0z out0 = in0 / abs(in0) cupy_signzout0 = (in0 > 0) - (in0 < 0)zElementwise sign function. It returns -1, 0, or 1 depending on the sign of the input. .. seealso:: :data:`numpy.sign` z if (in0.real() == 0) { out0 = (in0.imag() > 0) - (in0.imag() < 0); } else { out0 = (in0.real() > 0) - (in0.real() < 0); } cupy_heavisideee->er,ff->fdd->dz if (isnan(in0)) { out0 = in0; } else if (in0 == 0) { out0 = in1; } else { out0 = (in0 > 0); } zTCompute the Heaviside step function. .. seealso:: :data:`numpy.heaviside` z; #ifndef NAN #define NAN __int_as_float(0x7fffffff) #endif zLout0 = (isnan(in0) | isnan(in1)) ? out0_type(NAN) : out0_type(max(in0, in1)) cupy_maximumz??->?zbb->bzBB->Bzhh->hzHH->Hzii->izII->Izll->lzLL->Lzqq->qzQQ->Q)codezFF->FzDD->Dzout0 = max(in0, in1)zTakes the maximum of two arrays elementwise. If NaN appears, it returns the NaN. .. seealso:: :data:`numpy.maximum` )OP_MAXr r max)preambler\ cutensor_op scatter_opzLout0 = (isnan(in0) | isnan(in1)) ? out0_type(NAN) : out0_type(min(in0, in1)) cupy_minimumzout0 = min(in0, in1)zTakes the minimum of two arrays elementwise. If NaN appears, it returns the NaN. .. seealso:: :data:`numpy.minimum` )OP_MINr r min cupy_fmax)raout0 = fmax(in0, in1)ro)rbro)rcrozTakes the maximum of two arrays elementwise. If NaN appears, it returns the other operand. .. seealso:: :data:`numpy.fmax` cupy_fmin)raout0 = fmin(in0, in1)rq)rbrq)rcrqzTakes the minimum of two arrays elementwise. If NaN appears, it returns the other operand. .. seealso:: :data:`numpy.fmin` a template __device__ T nan_to_num(T x, T nan, T posinf, T neginf) { if (isnan(x)) return nan; if (isinf(x)) return x > 0 ? posinf : neginf; return x; } template __device__ complex nan_to_num(complex x, T nan, T posinf, T neginf) { T re = nan_to_num(x.real(), nan, posinf, neginf); T im = nan_to_num(x.imag(), nan, posinf, neginf); return complex(re, im); } cupy_nan_to_num_z????->?zbbbb->bzBBBB->Bzhhhh->hzHHHH->Hziiii->izIIII->Izllll->lzLLLL->Lzqqqq->qzQQQQ->Q)zeeee->e%out0 = nan_to_num(in0, in1, in2, in3)r rs)zffff->frs)zdddd->drs)zFfff->Frs)zDddd->Drsz out0 = in0zQElementwise nan_to_num function. .. seealso:: :func:`numpy.nan_to_num` )rhr\cjURS;a.[R"URR55nURS;aSnOMUcJUbGU(a [R"U5R O[R"U5R n[R"X5$)NFDefdr)charr5rlowerfinformrg asanyarray)rrnegs r_check_nan_infr}sy zzT 5::++-. zz  s%(DJJu  ! !djj.?.C.C ??1 $$rTc"[U[R5(d[R"SU5nOU(a[R"U5OUnUR n[ X&5n[ X6S5n[ XFS5n[XX4US9$)zReplace NaN with zero and infinity with large finite numbers (default behaviour) or with the numbers defined by the user using the `nan`, `posinf` and/or `neginf` keywords. .. seealso:: :func:`numpy.nan_to_num` rFTrT) isinstancer5ndarrayr. empty_likerr} _nan_to_num)rr3nanposinfneginfr(rs r nan_to_numrsq a & &iiA$(dooa a IIE  $C F5 1F F4 0F qv3 77rc~[URR[R5(dU$US:a9[ R "URR5nURU-n[R"[R"UR5U:5(a URnU$)aIf input is complex with all imaginary parts close to zero, return real parts. "Close to zero" is defined as `tol` * (machine epsilon of the type for `a`). .. warning:: This function may synchronize the device. .. seealso:: :func:`numpy.real_if_close` r ) issubclassrtyper5complexfloatingnumpyrzepsallabsoluteimagreal)r%tolfs r real_if_closers} aggllD$8$8 9 9 Qw KK %eeck xx aff%+,, FF Hr)for_each_devicecSnUS- nSnU(aSnOSnUS- nU[RRR- nSn[R"XUSUS 9$) Nzraw V x, raw U idx, z2raw W fx, raw Y fy, U len, raw Y left, raw Y rightzZ yztypedef double real_t; ztypedef Z real_t; ztypedef Z value_t; a U x_idx = idx[i] - 1; if ( _isnan(x[i]) ) { y = x[i]; } else if (x_idx < 0) { y = left[0]; } else if (x[i] == fx[len - 1]) { // searchsorted cannot handle both of the boundary points, // so we must detect and correct ourselves... y = fy[len - 1]; } else if (x_idx >= len - 1) { y = right[0]; } else if (x[i] == fx[x_idx]) { y = fy[x_idx]; } else { const Z slope = (value_t)(fy[x_idx+1] - fy[x_idx]) / \ ((real_t)fx[x_idx+1] - (real_t)fx[x_idx]); Z out = slope * ((real_t)x[i] - (real_t)fx[x_idx]) \ + (value_t)fy[x_idx]; if (_isnan(out)) { out = slope * ((real_t)x[i] - (real_t)fx[x_idx+1]) \ + (value_t)fy[x_idx+1]; if (_isnan(out) && (fy[x_idx] == fy[x_idx+1])) { out = fy[x_idx]; } } y = out; } cupy_interp)rh)r5_sortingsearch _preambleElementwiseKernel) is_complex in_params out_paramsrhres r_get_interp_kernelrsp&I EEIJ-( &&H  $$...H D6  ! !t]X GGrc URS:wdURS:wa [S5eURUR:wa [S5eURS:Xa [S5eURR(d [ S5e[ R"X5n[ R"U[ R5(d)[SRU[ R55eUGbUS:Xa [S 5e[U5nSnSnUR[ R5nUR[ R5nX-nX-n[ R"U5nXnX'n[ R"US SU- XSSU-45n[ R"US SX"SS45nURR(deURR(deUR R"S :XaS OS n[ R$"UR&US9n [ R("XSS9n UcUSO[ R*"X2R 5nUcUS O[ R*"XBR 5n[-US :H5n U "X XURX4U 5 U $)aOne-dimensional linear interpolation. Args: x (cupy.ndarray): a 1D array of points on which the interpolation is performed. xp (cupy.ndarray): a 1D array of points on which the function values (``fp``) are known. fp (cupy.ndarray): a 1D array containing the function values at the the points ``xp``. left (float or complex): value to return if ``x < xp[0]``. Default is ``fp[0]``. right (float or complex): value to return if ``x > xp[-1]``. Default is ``fp[-1]``. period (None or float): a period for the x-coordinates. Parameters ``left`` and ``right`` are ignored if ``period`` is specified. Default is ``None``. Returns: cupy.ndarray: The interpolated values, same shape as ``x``. .. note:: This function may synchronize if ``left`` or ``right`` is not already on the device. .. seealso:: :func:`numpy.interp` r zxp and fp must be 1D arraysz$fp and xp are not of the same lengthrzarray of sample points is emptyz-Non-C-contiguous x is currently not supportedzACannot cast array data from {} to {} according to the rule 'safe'Nzperiod must be a non-zero valuer+r-Dd)rright)side)rr!r flags c_contiguousrr5 common_typecan_castfloat64 TypeErrorformatabsr>argsort concatenaterremptyr4 searchsortedarrayr) rxpfpleftrperiodx_dtypeasort_xp out_dtyperRidxkerns rinterprsM: ww!|rww!|677 ww"''?@@ ww!|:;; 77  !#./ /q%G ==$,, / /C68 8 Q;>? ?V HHT\\ " YYt|| $  <<# \ \   r"#wv~ra76>B C   r"#wqG4 5xx$$$$xx$$$$xx}}+I ZZy 1F   B 0CL2a5djjxx&@DmBrFE88)DE i3. /D$v6 Mr)r.)N)TgNN)d)NNN)2 __future__rr5r cupy._corerrWrcupy.libr cupy._utilrrReductionKernelrOrrr)r$r#rXsqrt sqrt_fixed create_ufunccbrtsquarerfabs_unsigned_sign _complex_signsign_legacy_complex_sign _legacy_sign heaviside_float_preamble_float_maximummaximum_float_minimumminimumfmaxfmin_nan_to_num_preamblerr}rr_utilmemoizerrrrrrs" ." ##       F$)N8)DJJz  *ik*6*6*       VVVVVVVV VCkC#)C+1C39C;AC   >>  *ik*6*6*   "   fn %v/G fn %v/G fn % 7k7"7$*7 m 7 &}5 7 #  "!! fn %v/G fn %v/G fn % EkE"E$*E "# E'-.B%C E #     .y|.W.g.   ( -    gw'7G gw ~ ' ~  ~  ~  ~   !U' 4,-    gw'7G gw ~ ' ~  ~  ~  ~   !U' 4,  gw'7G gw'/0(  (       &  gw'7G gw'/0(  (       &&   9i 9iI/ 01BC 0 / 0/ 0/ 0/ 0 ! # 0%8& ,D)(G*(GVLr