This crates provides
no_std building blocks for performing fast Fourier transforms. This
crate provides low level implementations with a low-level API, so you are probably looking for
fourier crate instead.
Implements a mixed-radix Stockham autosort algorithm for multiples of 2 and 3.
Implements Bluestein's algorithm for arbitrary FFT sizes.
Specifies a type of transform to perform.
The interface for performing FFTs.
Floating-point types used for performing fast Fourier transforms.