U Kv fFã@s:ddlZddd„Zd dd„Zdd„Zdd „Zdd d„ZdS)éNcCs<|dkrt|ƒ}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 úF/tmp/pip-unpacked-wheel-2v6byqio/statsmodels/nonparametric/kdetools.pyÚforrtsrcCsX|dkrt|ƒ}t|ddƒ}|d|…tjd||d…dfd}tj |¡|S)zE Inverse of forrt. Equivalent to Munro (1976) REVRT routine. Nérryð?)rÚintrrrZirfft)r rÚirr 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)rZarangeÚpiÚexpr) ZbwÚMÚRANGEÚJZFAC1ZJFACZBCZFACZkern_estr r rÚsilverman_transformsrc Cs\t ||¡}ztj|t|ƒdWSt |¡}tj|t t|ƒt|ƒ¡fYSXdS)zŠ Counts the number of elements of x that fall within the grid points v Notes ----- Using np.digitize and np.bincount )Z minlengthN)rZdigitizeZbincountrrÚzeros)ÚxÚvÚidxZbcr r rÚcounts's rcs"t ‡‡fdd„ttˆƒƒDƒ¡S)Ncs g|]}t ˆ|ˆˆ¡‘qSr )rÚsum)Ú.0r©Úaxisrr rÚ 7szkdesum..)rZasarrayÚranger)rr"r r!rÚkdesum6sr%)N)N)r)Znumpyrrrrrr%r r r rÚs