Yc[dZddlZddlZgdZddZddZddZddZdd Z dd Z dd Z dd Z dd Z ddZddZdZddZdS)zttj||||S)z%Slow move_sum for unaccelerated dtypeaxis) move_funcnpnansumawindow min_countrs 4lib/python3.11/site-packages/bottleneck/slow/move.pyrr RY694 @ @ @@c>ttj||||S)z&Slow move_mean for unaccelerated dtyper)rrnanmeanrs rrrs RZFID A A AArc@ttj|||||S)z%Slow move_std for unaccelerated dtyperddof)rrnanstdrrrrrs rrr RY694d K K KKrc@ttj|||||S)z%Slow move_var for unaccelerated dtyper)rrnanvarr!s rrr$r"rc>ttj||||S)z%Slow move_min for unaccelerated dtyper)rrnanminrs rrr)rrc>ttj||||S)z%Slow move_max for unaccelerated dtyper)rrnanmaxrs rrr.rrc0d}t|||||S)z(Slow move_argmin for unaccelerated dtypecvtj|d}tdg|jz}tddd||<|t |} tj||}n#t $r|}tj|}tj |tj |tj || tj }|jdkr tj}n%tj||}tj||<YnwxYw|SNFcopyr r)wherer)rarrayslicendimtuple nanargmin ValueErrorr-isnancopytoinfargminastypefloat64nanallrrflipidxmasks rr8zmove_argmin..argmin6s HQU # # #d }qv%4r**T eDkkN #,qt,,,CC # # #A8A;;D Iat , , , ,)AD)))00<.argmaxPs HQU # # #d }qv%4r**T eDkkN #,qt,,,CC # # #A8A;;D Ia"& - - - -)AD)))00<ttj||||S)z(Slow move_median for unaccelerated dtyper)rr nanmedianrs rr r gs R\1fid C C CCrc4tt||||S)z&Slow move_rank for unaccelerated dtyper)rlastrankrs rr r ls Xq&)$ ? ? ??rc tj|d}||}n3|}||krd}t|||fz|dkrtd|jdkrtd|td|d krtd ||j|krtd t |jjtjrtj |}ntj |j}tdg|jz} t| } tj5tjd t!|j|D]d} t#|| d z} t| d z| z | d z| |<| | |<||t%| fd |i||t%| <e dddn #1swxYwYt'||||} tj|| <|S)z>Generic moving window function implemented with a python loop.Fr,Nz1min_count (%d) cannot be greater than window (%d)rz&`min_count` must be greater than zero.z(moving window functions require ndim > 0z)An `axis` value of None is not supported.z`window` must be at least 1.z`window` is too long.ignorer)rr/r4r1shape issubclassdtypetypeinexact empty_likeemptyr0listwarningscatch_warnings simplefilterrangeminr2_maskr;)funcrrrrkwargsmcmsgyidx1idx2iwinr?s rrrtsy AG   ; GECSB</00 0 1W GEFF Fv{ECDDD FDEEE z97888  20111!', ++ M!   HQW   $KK=16 !D ::D  " "GGh'''qwt}%% G GAfa!e$$Cq1us{AE22DJDJ!T!E$KK.FFtFvFFAeDkkNN  GGGGGGGGGGGGGGGG 62t $ $C VAcF Hs;BGG #G c6||k|}tdg|jz}tdg|jz}tdg|jz}t|d||<td| ||<td|||<t|}t|}t|}||}|||z }t j|jtj} ||k| |<|||k| |<| S)NrP)cumsumr0r1r2rrTrNbool_) rrrrnrarbidx3nidx1r?s rr[r[s aA $KK=16 !D $KK=16 !D $KK=16 !Dvt$$DJtfW%%DJtV$$DJ ;;D ;;D ;;D dGE AdGOE (17"( + + +C !CI$)#CI Jrc*tj|d}|j}|jdkrt |j}||tj||j}| tj |jdkr|jdkr tj }|Stdg|z}tdd||<t|}tdg|z}d||<t|}tj ||}||}||k|} ||k|} | | z| zdz d z }||dz z }d |d z z}|dkr/|dkrd}tj ||r tj }nRtj||dkdtj|tj ||tj |S) a The ranking of the last element along the axis, ignoring NaNs. The ranking is normalized to be between -1 and 1 instead of the more common 1 and N. The results are adjusted for ties. Parameters ---------- a : ndarray Input array. If `a` is not an array, a conversion is attempted. axis : int, optional The axis over which to rank. By default (axis=-1) the ranking (and reducing) is performed over the last axis. Returns ------- d : array In the case of, for example, a 2d array of shape (n, m) and axis=1, the output will contain the rank (normalized to be between -1 and 1 and adjusted for ties) of the the last element of each row. The output in this example will have shape (n,). Examples -------- Create an array: >>> y1 = larry([1, 2, 3]) What is the rank of the last element (the value 3 in this example)? It is the largest element so the rank is 1.0: >>> import numpy as np >>> from la.afunc import lastrank >>> x1 = np.array([1, 2, 3]) >>> lastrank(x1) 1.0 Now let's try an example where the last element has the smallest value: >>> x2 = np.array([3, 2, 1]) >>> lastrank(x2) -1.0 Here's an example where the last element is not the minimum or maximum value: >>> x3 = np.array([1, 3, 4, 5, 2]) >>> lastrank(x3) -0.5 Fr,rrfrLNr g?g@g?)rr/r1sizerUrNpoprTrPfillr;r0r2r5sumputmask) rrr1rNrindlastindlast2ri a_indlastges rrJrJsj A 6Dv{QW  $ HU!' * * * rv FaK afk AT{{md"G"dOOGDMGnnGd }t#HHTNXH (1++4  A' I QD!!A aT""A QSCA QW A q3wA qy5 6 A 8AhK  A 1a1fa    1bhq{++RV444 Hr)Nr )Nr r)r )__doc__rVnumpyr__all__rrrrrrr r r r rr[rJrrr|sa>>   AAAA BBBB LLLL LLLL AAAA AAAA >>>>4>>>>4DDDD @@@@# # # # L,U U U U U U r