B ¤ŠãZËã@sRddlmZddlmZddlZddd„Zddd„Zdd „Zd d „Z dd d „Z dS)é)Údivision)ÚrangeNcCs<|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úAlib/python3.7/site-packages/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Úintrr rZirfft)r r ÚirrrrÚrevrts (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_estrrrÚsilverman_transforms rc CsTt ||¡}ytj|t|ƒdSt |¡}tj|t t|ƒt|ƒ¡fSdS)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 Zzeros)ÚxÚvÚidxZbcrrrÚcounts)s   rcs"t ‡‡fdd„ttˆƒƒDƒ¡S)Ncs g|]}t ˆ|ˆˆ¡‘qSr)rÚsum)Ú.0r)Úaxisrrrú 9szkdesum..)rZasarrayrr)rr r)r rrÚkdesum8sr")N)N)r) Z __future__rZstatsmodels.compat.pythonrZnumpyrrrrrr"rrrrÚs