Struct rustfft::algorithm::butterflies::Butterfly32

pub struct Butterfly32<T> { /* fields omitted */ }

Methods

impl<T: FFTnum> Butterfly32<T>

pub fn new(inverse: bool) -> Self

Trait Implementations

impl<T: FFTnum> FFTButterfly<T> for Butterfly32<T>

unsafe fn process_inplace(&self, buffer: &mut [Complex<T>])

Computes the FFT in-place in the given buffer

unsafe fn process_multi_inplace(&self, buffer: &mut [Complex<T>])

Divides the given buffer into chunks of length self.len() and computes an in-place FFT on each chunk

impl<T: FFTnum> FFT<T> for Butterfly32<T>

fn process(&self, input: &mut [Complex<T>], output: &mut [Complex<T>])

Computes an FFT on the input buffer and places the result in the output buffer.

fn process_multi(&self, input: &mut [Complex<T>], output: &mut [Complex<T>])

Divides the input and output buffers into chunks of length self.len(), then computes an FFT on each chunk.

impl<T> Length for Butterfly32<T>

fn len(&self) -> usize

The FFT size that this algorithm can process

impl<T> IsInverse for Butterfly32<T>

fn is_inverse(&self) -> bool

Returns false if this instance computes forward FFTs, true for inverse FFTs