pub struct BiquadRepr {
pub(crate) _typ: (),
pub(crate) repr: BiquadRepr<f32, f32>,
}
Fields§
§_typ: ()
Biquad parameters
repr: BiquadRepr<f32, f32>
Trait Implementations§
Source§impl Clone for BiquadRepr
impl Clone for BiquadRepr
Source§fn clone(&self) -> BiquadRepr
fn clone(&self) -> BiquadRepr
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl Debug for BiquadRepr
impl Debug for BiquadRepr
Source§impl Default for BiquadRepr
impl Default for BiquadRepr
Source§impl TreeAny for BiquadRepr
impl TreeAny for BiquadRepr
Source§fn ref_any_by_key(&self, keys: impl Keys) -> Result<&dyn Any, ValueError>
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.Source§fn mut_any_by_key(
&mut self,
keys: impl Keys,
) -> Result<&mut dyn Any, ValueError>
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.Source§fn ref_by_key<T>(&self, keys: impl IntoKeys) -> Result<&T, ValueError>where
T: Any,
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.
Source§fn mut_by_key<T>(&mut self, keys: impl IntoKeys) -> Result<&mut T, ValueError>where
T: Any,
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.
Source§impl<'de> TreeDeserialize<'de> for BiquadRepr
impl<'de> TreeDeserialize<'de> for BiquadRepr
Source§fn deserialize_by_key<D: Deserializer<'de>>(
&mut self,
keys: impl Keys,
de: D,
) -> Result<(), SerdeError<D::Error>>
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. Read more
Source§fn probe_by_key<D: Deserializer<'de>>(
keys: impl Keys,
de: D,
) -> Result<(), SerdeError<D::Error>>
fn probe_by_key<D: Deserializer<'de>>( keys: impl Keys, de: D, ) -> Result<(), SerdeError<D::Error>>
Blind deserialize a leaf node by its keys. Read more
Source§impl TreeSchema for BiquadRepr
impl TreeSchema for BiquadRepr
Source§impl TreeSerialize for BiquadRepr
impl TreeSerialize for BiquadRepr
Source§fn serialize_by_key<S: Serializer>(
&self,
keys: impl Keys,
ser: S,
) -> Result<S::Ok, SerdeError<S::Error>>
fn serialize_by_key<S: Serializer>( &self, keys: impl Keys, ser: S, ) -> Result<S::Ok, SerdeError<S::Error>>
Serialize a node by keys. Read more
Auto Trait Implementations§
impl Freeze for BiquadRepr
impl RefUnwindSafe for BiquadRepr
impl Send for BiquadRepr
impl Sync for BiquadRepr
impl Unpin for BiquadRepr
impl UnwindSafe for BiquadRepr
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T, M> ForwardCompat<T, M> for T
impl<T, M> ForwardCompat<T, M> for T
§impl<T> ReverseCompat<T> for T
impl<T> ReverseCompat<T> for T
§fn reverse(self) -> Reverse<T>
fn reverse(self) -> Reverse<T>
Create an e-h-c wrapper around and e-h object Available methods depend on the wrapped type
§fn reverse_cell(self) -> Reverse<RefCell<T>>
fn reverse_cell(self) -> Reverse<RefCell<T>>
Create an e-h-c reverse compatibility wrapper using a ref-cell for interior mutability (required for InputPin types)