Metadata-Version: 2.1
Name: fastfft
Version: 0.2.0
Summary: Discrete Fourier transform implementation by the analog of the Cooley-Tukey algorithm.
Home-page: https://github.com/BSaaber/fastfft
Author: Maxim Movshin
Author-email: maxim-movshin@yandex.ru
License: MIT
Project-URL: Documentation, https://github.com/BSaaber/fastfft
Project-URL: Code, https://github.com/BSaaber/fastfft
Project-URL: Issue tracker, https://github.com/BSaaber/fastfft/issues
Classifier: Development Status :: 1 - Planning
Classifier: License :: OSI Approved :: MIT License
Classifier: Intended Audience :: Education
Classifier: Intended Audience :: Science/Research
Classifier: Topic :: Scientific/Engineering
Classifier: Topic :: Scientific/Engineering :: Mathematics
Classifier: Natural Language :: English
Classifier: Operating System :: OS Independent
Classifier: Programming Language :: C++
Classifier: Programming Language :: Cython
Classifier: Programming Language :: Python
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.4
Classifier: Programming Language :: Python :: 3.5
Classifier: Programming Language :: Python :: 3.6
Classifier: Programming Language :: Python :: 3.7
Classifier: Programming Language :: Python :: 3.8
Classifier: Programming Language :: Python :: 3.10
Classifier: Programming Language :: Python :: 3.11
Classifier: Programming Language :: Python :: 3 :: Only
Classifier: Programming Language :: Python :: Implementation :: CPython
Requires-Python: >=3.4
Description-Content-Type: text/markdown
Provides-Extra: dev
License-File: LICENSE.txt

# FASTFFT
import
```
from fastfft.fft import fft2
```
use
```
fft([[1, 2], [3, 4]])
```
