Struct realfft::RealToComplexOdd

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

Implementations

impl<T: FftNum> RealToComplexOdd<T>

pub fn new(length: usize, fft_planner: &mut FftPlanner<T>) -> Self

Create a new RealToComplex FFT for input data of a given length, and uses the given FftPlanner to build the inner FFT. Panics if the length is not odd.

Trait Implementations

impl<T: FftNum> RealToComplex<T> for RealToComplexOdd<T>

fn process(
    &self,
    input: &mut [T],
    output: &mut [Complex<T>]
) -> Result<(), Box<dyn Error>>

Transform a vector of N real-valued samples, storing the result in the N/2+1 (with N/2 rounded down) element long complex output vector. The input buffer is used as scratch space, so the contents of input should be considered garbage after calling. It also allocates additional scratch space as needed. An error is returned if any of the given slices has the wrong length.

fn process_with_scratch(
    &self,
    input: &mut [T],
    output: &mut [Complex<T>],
    scratch: &mut [Complex<T>]
) -> Result<(), Box<dyn Error>>

Transform a vector of N real-valued samples, storing the result in the N/2+1 (with N/2 rounded down) element long complex output vector. The input buffer is used as scratch space, so the contents of input should be considered garbage after calling. It also uses the provided scratch vector instead of allocating, which will be faster if it is called more than once. An error is returned if any of the given slices has the wrong length.

fn get_scratch_len(&self) -> usize

Get the length of the scratch space needed for process_with_scratch.

fn len(&self) -> usize

Get the number of points that this FFT can process.

fn make_input_vec(&self) -> Vec<T>

Convenience method to make an input vector of the right type and length.

fn make_output_vec(&self) -> Vec<Complex<T>>

Convenience method to make an output vector of the right type and length.

fn make_scratch_vec(&self) -> Vec<Complex<T>>

Convenience method to make a scratch vector of the right type and length.