[−][src]Enum miniaudio::ResampleAlgorithm
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
Fields of Speex
quality: u32
Methods
impl ResampleAlgorithm
[src]
pub fn algorithm_type(&self) -> ResampleAlgorithmType
[src]
Trait Implementations
impl Clone for ResampleAlgorithm
[src]
fn clone(&self) -> ResampleAlgorithm
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl Copy for ResampleAlgorithm
[src]
impl PartialEq<ResampleAlgorithm> for ResampleAlgorithm
[src]
fn eq(&self, other: &ResampleAlgorithm) -> bool
[src]
fn ne(&self, other: &ResampleAlgorithm) -> bool
[src]
impl StructuralPartialEq for ResampleAlgorithm
[src]
Auto Trait Implementations
impl RefUnwindSafe for ResampleAlgorithm
impl Send for ResampleAlgorithm
impl Sync for ResampleAlgorithm
impl Unpin for ResampleAlgorithm
impl UnwindSafe for ResampleAlgorithm
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,