Struct SseF32Butterfly16 

pub struct SseF32Butterfly16<T> {
    bf4: SseF32Butterfly4<T>,
    twiddles_packed: [__m128; 6],
    twiddle1: __m128,
    twiddle3: __m128,
    twiddle9: __m128,
}

Fields

bf4: SseF32Butterfly4<T>

twiddles_packed: [__m128; 6]

twiddle1: __m128

twiddle3: __m128

twiddle9: __m128

Implementations

impl<T: FftNum> SseF32Butterfly16<T>

pub fn new(direction: FftDirection) -> Self

unsafe fn perform_fft_contiguous(&self, buffer: impl SseArrayMut<f32>)

pub(crate) unsafe fn perform_parallel_fft_contiguous( &self, buffer: impl SseArrayMut<f32>, )

Trait Implementations

impl<T> Direction for SseF32Butterfly16<T>

fn fft_direction(&self) -> FftDirection

Returns FftDirection::Forward if this instance computes forward FFTs, or FftDirection::Inverse for inverse FFTs

impl<T: FftNum> Fft<T> for SseF32Butterfly16<T>

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

Divides input and output into chunks of self.len(), and computes a FFT on each chunk while keeping input untouched.

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

Divides input and output into chunks of size self.len(), and computes a FFT on each chunk.

fn process_with_scratch( &self, buffer: &mut [Complex<T>], _scratch: &mut [Complex<T>], )

Divides buffer into chunks of size self.len(), and computes a FFT on each chunk.

fn get_inplace_scratch_len(&self) -> usize

Returns the size of the scratch buffer required by process_with_scratch

fn get_outofplace_scratch_len(&self) -> usize

Returns the size of the scratch buffer required by process_outofplace_with_scratch

fn get_immutable_scratch_len(&self) -> usize

Returns the size of the scratch buffer required by process_immutable_with_scratch

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

Computes a FFT in-place.

impl<T> Length for SseF32Butterfly16<T>

fn len(&self) -> usize

The FFT size that this algorithm can process