o þ0GfFã@s:ddlZd dd„Zd dd„Zdd„Zdd „Zd d d „ZdS)éNcCs<|durt|ƒ}tj ||¡|}tj|j|dd…jfS)z: RFFT with order like Munro (1976) FORTT routine. Nééÿÿÿÿ)ÚlenÚnpÚfftZrfftÚr_ÚrealÚimag)ÚXÚmÚy©r úBlib/python3.10/site-packages/statsmodels/nonparametric/kdetools.pyÚforrtsrcCsX|durt|ƒ}t|ddƒ}|d|…tjd||d…dfd}tj |¡|S)zE Inverse of forrt. Equivalent to Munro (1976) REVRT routine. Nérryð?)rÚintrrrZirfft)r r Úir r r rÚrevrt s (rc Cs|t |dd¡}dtj||d}|d|}dd|d|tjd}t | ¡|}tj||dd…f}|S)z€ FFT of Gaussian kernel following to Silverman AS 176. Notes ----- Underflow is intentional as a dampener. rrgUUUUUUÕ?gð?r)rZarangeZpiZexpr) ZbwÚMÚRANGEÚJZFAC1ZJFACZBCZFACZkern_estr r rÚsilverman_transforms rc CsVt ||¡}z tj|t|ƒdWSt |¡}tj|t t|ƒt|ƒ¡fYS)zŠ Counts the number of elements of x that fall within the grid points v Notes ----- Using np.digitize and np.bincount )Z minlength)rZdigitizeZbincountrrZzeros)ÚxÚvÚidxZbcr r rÚcounts's  $rcs"t ‡‡fdd„ttˆƒƒDƒ¡S)Ncs g|] }t ˆ|ˆˆ¡‘qSr )rÚsum)Ú.0r©Úaxisrr rÚ 7s zkdesum..)rZasarrayÚranger)rrr rrÚkdesum6s"r")N)r)Znumpyrrrrrr"r r r rÚs