Struct BiquadRepr

pub struct BiquadRepr<T>
where
    T: Coefficient + AsPrimitive<f32> + AsPrimitive<T>,
    f32: AsPrimitive<T>,
{
    pub(crate) _typ: (),
    pub(crate) repr: BiquadRepr<f32, T>,
    pub(crate) _update: (),
    pub(crate) iir: Biquad<T>,
    pub(crate) period: f32,
    pub(crate) b_scale: f32,
    pub(crate) y_scale: f32,
}

Fields

_typ: ()

Biquad representation type

repr: BiquadRepr<f32, T>

Biquad parameters Biquad representation subtree access

_update: ()

Update trigger. TODO: Needs explicit trigger for serial-settings

iir: Biquad<T>

Built raw IIR

period: f32

b_scale: f32

y_scale: f32

Trait Implementations

impl<T> Clone for BiquadRepr<T>

where T: Coefficient + AsPrimitive<f32> + AsPrimitive<T> + Clone, f32: AsPrimitive<T>,

fn clone(&self) -> BiquadRepr<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for BiquadRepr<T>

where T: Coefficient + AsPrimitive<f32> + AsPrimitive<T> + Debug, f32: AsPrimitive<T>,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> Default for BiquadRepr<T>

where T: Coefficient + AsPrimitive<f32> + AsPrimitive<T>, f32: AsPrimitive<T>,

fn default() -> Self

Returns the “default value” for a type.

impl<T> TreeAny for BiquadRepr<T>

where T: Coefficient + AsPrimitive<f32> + AsPrimitive<T>, f32: AsPrimitive<T>, BiquadRepr<f32, T>: TreeAny,

fn ref_any_by_key(&self, keys: impl Keys) -> Result<&dyn Any, ValueError>

Obtain a reference to a dyn Any trait object for a leaf node.

fn mut_any_by_key( &mut self, keys: impl Keys, ) -> Result<&mut dyn Any, ValueError>

Obtain a mutable reference to a dyn Any trait object for a leaf node.

fn ref_by_key<T>(&self, keys: impl IntoKeys) -> Result<&T, ValueError>

where T: Any,

Obtain a reference to a leaf of known type by key.

fn mut_by_key<T>(&mut self, keys: impl IntoKeys) -> Result<&mut T, ValueError>

where T: Any,

Obtain a mutable reference to a leaf of known type by key.

impl<'de, T> TreeDeserialize<'de> for BiquadRepr<T>

where T: Coefficient + AsPrimitive<f32> + AsPrimitive<T>, f32: AsPrimitive<T>, BiquadRepr<f32, T>: TreeDeserialize<'de>,

fn deserialize_by_key<D: Deserializer<'de>>( &mut self, keys: impl Keys, de: D, ) -> Result<(), SerdeError<D::Error>>

Deserialize a leaf node by its keys.

fn probe_by_key<D: Deserializer<'de>>( keys: impl Keys, de: D, ) -> Result<(), SerdeError<D::Error>>

Blind deserialize a leaf node by its keys.

impl<T> TreeSchema for BiquadRepr<T>

where T: Coefficient + AsPrimitive<f32> + AsPrimitive<T>, f32: AsPrimitive<T>, BiquadRepr<f32, T>: TreeSchema,

const SCHEMA: &'static Schema

Schema for this tree level

impl<T> TreeSerialize for BiquadRepr<T>

where T: Coefficient + AsPrimitive<f32> + AsPrimitive<T>, f32: AsPrimitive<T>, BiquadRepr<f32, T>: TreeSerialize,

fn serialize_by_key<S: Serializer>( &self, keys: impl Keys, ser: S, ) -> Result<S::Ok, SerdeError<S::Error>>

Serialize a node by keys.