ó
    Eñi0  ã                   ó  • S r SSKJrJrJrJrJrJrJrJ	r	J
r
JrJrJrJrJrJrJrJrJr  SSKJrJrJrJrJrJrJrJr  SSKJrJrJ r   SSK!J"r"J#r#J$r$J%r%J&r&J'r'  SSK(J)r)J*r*J+r+J,r,  SSK-J.r.J/r/  / SQr0S	S
K1J2r2  \2" \35      r4C2g)aÀ	  
==============================================
Discrete Fourier transforms (:mod:`scipy.fft`)
==============================================

.. currentmodule:: scipy.fft

Fast Fourier Transforms (FFTs)
==============================

.. autosummary::
   :toctree: generated/

   fft - Fast (discrete) Fourier Transform (FFT)
   ifft - Inverse FFT
   fft2 - 2-D FFT
   ifft2 - 2-D inverse FFT
   fftn - N-D FFT
   ifftn - N-D inverse FFT
   rfft - FFT of strictly real-valued sequence
   irfft - Inverse of rfft
   rfft2 - 2-D FFT of real sequence
   irfft2 - Inverse of rfft2
   rfftn - N-D FFT of real sequence
   irfftn - Inverse of rfftn
   hfft - FFT of a Hermitian sequence (real spectrum)
   ihfft - Inverse of hfft
   hfft2 - 2-D FFT of a Hermitian sequence
   ihfft2 - Inverse of hfft2
   hfftn - N-D FFT of a Hermitian sequence
   ihfftn - Inverse of hfftn

Discrete Sin and Cosine Transforms (DST and DCT)
================================================

.. autosummary::
   :toctree: generated/

   dct - Discrete cosine transform
   idct - Inverse discrete cosine transform
   dctn - N-D Discrete cosine transform
   idctn - N-D Inverse discrete cosine transform
   dst - Discrete sine transform
   idst - Inverse discrete sine transform
   dstn - N-D Discrete sine transform
   idstn - N-D Inverse discrete sine transform

Fast Hankel Transforms
======================

.. autosummary::
   :toctree: generated/

   fht - Fast Hankel transform
   ifht - Inverse of fht

Helper functions
================

.. autosummary::
   :toctree: generated/

   fftshift - Shift the zero-frequency component to the center of the spectrum
   ifftshift - The inverse of `fftshift`
   fftfreq - Return the Discrete Fourier Transform sample frequencies
   rfftfreq - DFT sample frequencies (for usage with rfft, irfft)
   fhtoffset - Compute an optimal offset for the Fast Hankel Transform
   next_fast_len - Find the optimal length to zero-pad an FFT for speed
   prev_fast_len - Find the maximum slice length that results in a fast FFT
   set_workers - Context manager to set default number of workers
   get_workers - Get the current default number of workers

Backend control
===============

.. autosummary::
   :toctree: generated/

   set_backend - Context manager to set the backend within a fixed scope
   skip_backend - Context manager to skip a backend within a fixed scope
   set_global_backend - Sets the global fft backend
   register_backend - Register a backend for permanent use

é   )ÚfftÚifftÚfft2Úifft2ÚfftnÚifftnÚrfftÚirfftÚrfft2Úirfft2ÚrfftnÚirfftnÚhfftÚihfftÚhfft2Úihfft2ÚhfftnÚihfftn)ÚdctÚidctÚdstÚidstÚdctnÚidctnÚdstnÚidstn)ÚfhtÚifhtÚ	fhtoffset)Únext_fast_lenÚprev_fast_lenÚfftfreqÚrfftfreqÚfftshiftÚ	ifftshift)Úset_backendÚskip_backendÚset_global_backendÚregister_backend)Úset_workersÚget_workers))r   r   r   r   r   r   r	   r
   r   r   r   r   r   r   r   r   r   r   r"   r#   r$   r%   r    r!   r   r   r   r   r   r   r   r   r   r   r   r&   r'   r(   r)   r+   r*   é    )ÚPytestTesterN)5Ú__doc__Ú_basicr   r   r   r   r   r   r	   r
   r   r   r   r   r   r   r   r   r   r   Ú_realtransformsr   r   r   r   r   r   r   r   Ú_fftlogr   r   r   Ú_helperr    r!   r"   r#   r$   r%   Ú_backendr&   r'   r(   r)   Ú_pocketfft.helperr*   r+   Ú__all__Úscipy._lib._testutilsr-   Ú__name__Útest© ó    ÚO/home/mande/repo/quber/.venv/lib/python3.13/site-packages/scipy/fft/__init__.pyÚ<module>r<      sg   ðñS÷j/÷ /÷ /÷ /÷ /÷ L× KÓ Kß )Ñ )÷#÷ #÷)ó )ç 7ò
"€õ /Ù�HÓ€Ùr:   