Struct ComplexFft 

pub struct ComplexFft<T: Transcendental> { /* private fields */ }

Radix-2 Decimation-In-Time (DIT) complex FFT.

Supports sizes that are powers of two. All scratch buffers are pre-allocated at construction time — process() performs zero heap allocations.

Implementations

impl<T: Transcendental> ComplexFft<T>

pub fn new(size: usize) -> Self

Create a new complex FFT for the given size.

Panics

Panics if size is not a power of two.

pub fn size(&self) -> usize

Returns the FFT size.

pub fn forward(&self, data: &mut [Complex<T>])

Forward complex FFT — interleaved Complex<T> API.

Panics

Panics if data.len() != self.size().

pub fn inverse(&self, data: &mut [Complex<T>])

Inverse complex FFT — interleaved Complex<T> API.

Result is scaled by 1/N.

Panics

Panics if data.len() != self.size().

pub fn forward_soa(&self, re: &mut [T], im: &mut [T])

Forward complex FFT — SoA (Structure of Arrays) API.

Operates on separate real and imaginary arrays. Both must have length self.size(). Zero heap allocations in the process path.

With the simd feature, f32/f64 variants use hardware SIMD via F32x4/F64x2 for the butterfly arithmetic.

pub fn inverse_soa(&self, re: &mut [T], im: &mut [T])

Inverse complex FFT — SoA API.

Result is scaled by 1/N.