pub enum PeqModel {
Pk,
HpPk,
HpPkLp,
LsPk,
LsPkHs,
FreePkFree,
Free,
}Expand description
PEQ model types that define the structure and constraints of the equalizer.
Variants§
Implementations§
Trait Implementations§
impl Copy for PeqModel
impl Eq for PeqModel
Source§impl PeqLayout for PeqModel
impl PeqLayout for PeqModel
Source§fn params_per_filter(&self) -> usize
fn params_per_filter(&self) -> usize
Number of scalar parameters stored for each filter.
Source§fn layout(&self) -> ParamLayout
fn layout(&self) -> ParamLayout
Position of each semantic parameter within a filter group.
Source§fn get_filter_params(&self, x: &[f64], i: usize) -> FilterParams
fn get_filter_params(&self, x: &[f64], i: usize) -> FilterParams
Extract the parameters for the
i-th filter.Source§fn set_filter_params(&self, x: &mut [f64], i: usize, params: &FilterParams)
fn set_filter_params(&self, x: &mut [f64], i: usize, params: &FilterParams)
Write the parameters for the
i-th filter into an existing vector.Source§fn determine_filter_type(
&self,
i: usize,
num_filters: usize,
type_param: Option<f64>,
) -> BiquadFilterType
fn determine_filter_type( &self, i: usize, num_filters: usize, type_param: Option<f64>, ) -> BiquadFilterType
Determine the biquad type for filter
i given the model and optional type
parameter.Source§fn initial_guess_filter(
&self,
i: usize,
num_filters: usize,
lower_bounds: &[f64],
upper_bounds: &[f64],
min_db: f64,
max_freq: f64,
) -> Vec<f64>
fn initial_guess_filter( &self, i: usize, num_filters: usize, lower_bounds: &[f64], upper_bounds: &[f64], min_db: f64, max_freq: f64, ) -> Vec<f64>
Build an initial-guess parameter group for filter
i.Source§fn num_filters(&self, x: &[f64]) -> usize
fn num_filters(&self, x: &[f64]) -> usize
Number of filters represented by a parameter vector.
Source§fn append_filter_params(&self, x: &mut Vec<f64>, params: &FilterParams)
fn append_filter_params(&self, x: &mut Vec<f64>, params: &FilterParams)
Append a filter’s parameters to a vector (used when building a vector from
scratch, e.g.
peq2x).impl StructuralPartialEq for PeqModel
Auto Trait Implementations§
impl Freeze for PeqModel
impl RefUnwindSafe for PeqModel
impl Send for PeqModel
impl Sync for PeqModel
impl Unpin for PeqModel
impl UnsafeUnpin for PeqModel
impl UnwindSafe for PeqModel
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreimpl<T> MaybeParallel for T
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.