Struct RadixN 

pub(crate) struct RadixN<T> {
    twiddles: Box<[Complex<T>]>,
    base_fft: Arc<dyn Fft<T>>,
    base_len: usize,
    factors: Box<[TransposeFactor]>,
    butterflies: Box<[InternalRadixFactor<T>]>,
    len: usize,
    direction: FftDirection,
    inplace_scratch_len: usize,
    outofplace_scratch_len: usize,
    immut_scratch_len: usize,
}

Fields

twiddles: Box<[Complex<T>]>

base_fft: Arc<dyn Fft<T>>

base_len: usize

factors: Box<[TransposeFactor]>

butterflies: Box<[InternalRadixFactor<T>]>

len: usize

direction: FftDirection

inplace_scratch_len: usize

outofplace_scratch_len: usize

immut_scratch_len: usize

Implementations

impl<T: FftNum> RadixN<T>

pub fn new(factors: &[RadixFactor], base_fft: Arc<dyn Fft<T>>) -> Self

Constructs a RadixN instance which computes FFTs of length factor_product * base_fft.len()

fn inplace_scratch_len(&self) -> usize

fn outofplace_scratch_len(&self) -> usize

fn immut_scratch_len(&self) -> usize

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

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

Trait Implementations

impl<T> Direction for RadixN<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 RadixN<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 RadixN<T>

fn len(&self) -> usize

The FFT size that this algorithm can process