Struct Dst1ConvertToFft 

pub struct Dst1ConvertToFft<T> { /* private fields */ }

DST Type 1 implementation that converts the problem into a FFT of size 2 * (n + 1)

// Computes a DST Type 1 of size 1234
use rustdct::Dst1;
use rustdct::algorithm::Dst1ConvertToFft;
use rustdct::rustfft::FftPlanner;

let len = 1234;

let mut planner = FftPlanner::new();
let fft = planner.plan_fft_forward(2 * (len + 1));

let dct = Dst1ConvertToFft::new(fft);

let mut buffer = vec![0f32; len];
dct.process_dst1(&mut buffer);

Implementations

impl<T: DctNum> Dst1ConvertToFft<T>

pub fn new(inner_fft: Arc<dyn Fft<T>>) -> Self

Creates a new DST1 context that will process signals of length inner_fft.len() / 2 - 1.

Trait Implementations

impl<T: DctNum> Dst1<T> for Dst1ConvertToFft<T>

fn process_dst1_with_scratch(&self, buffer: &mut [T], scratch: &mut [T])

Computes the DST Type 1 on the provided buffer, in-place. Uses the provided scratch buffer as scratch space.

fn process_dst1(&self, buffer: &mut [T])

Computes the DST Type 1 on the provided buffer, in-place.

impl<T> Length for Dst1ConvertToFft<T>

fn len(&self) -> usize

The FFT size that this algorithm can process

impl<T: DctNum> RequiredScratch for Dst1ConvertToFft<T>

fn get_scratch_len(&self) -> usize