Struct rustdct::algorithm::Dct1Naive

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

Naive O(n^2 ) DCT Type 1 implementation

This implementation is primarily used to test other DCT1 algorithms. For small scratch sizes, this is actually faster than DCT1ViaFFT because we don't have to pay the cost associated with converting the problem to a FFT.

// Computes a naive DCT1 of size 23
use rustdct::Dct1;
use rustdct::algorithm::Dct1Naive;

let len = 23;

let dct = Dct1Naive::new(len);

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

Implementations

impl<T: DctNum> Dct1Naive<T>

pub fn new(len: usize) -> Self

Trait Implementations

impl<T: DctNum> Dct1<T> for Dct1Naive<T>

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

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

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

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

impl<T> Length for Dct1Naive<T>

pub fn len(&self) -> usize

The FFT size that this algorithm can process

impl<T> RequiredScratch for Dct1Naive<T>

pub fn get_scratch_len(&self) -> usize