Enum ResampleAlgorithm 

pub enum ResampleAlgorithm {
    Linear {
        lpf_order: u32,
        lpf_nyquist_factor: f64,
    },
    Speex {
        quality: u32,
    },
}

The choice of resampling algorithm depends on your situation and requirements. The linear resampler is the most efficient and has the least amount of latency, but at the expense of poorer quality. The Speex resampler is higher quality, but slower with more latency. It also performs several heap allocations internally for memory management.

Variants

Linear

Fields

lpf_order: u32

lpf_nyquist_factor: f64

Speex

Fields

quality: u32

Implementations

impl ResampleAlgorithm

pub fn algorithm_type(&self) -> ResampleAlgorithmType

Trait Implementations

impl Clone for ResampleAlgorithm

fn clone(&self) -> ResampleAlgorithm

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl PartialEq for ResampleAlgorithm

fn eq(&self, other: &ResampleAlgorithm) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for ResampleAlgorithm

impl StructuralPartialEq for ResampleAlgorithm