Struct BiquadRepr

pub struct BiquadRepr {
    pub(crate) repr: StrLeaf<BiquadRepr<f32, f32>>,
    pub(crate) _repr: (),
}

Fields

repr: StrLeaf<BiquadRepr<f32, f32>>

Biquad parameters

_repr: ()

Subtree access

Implementations

impl BiquadRepr

pub(crate) const __MINICONF_LOOKUP: KeyLookup = _

Trait Implementations

impl Clone for BiquadRepr

fn clone(&self) -> BiquadRepr

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BiquadRepr

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

Formats the value using the given formatter.

impl Default for BiquadRepr

fn default() -> Self

Returns the “default value” for a type.

impl TreeAny for BiquadRepr

fn ref_any_by_key<K>(&self, keys: K) -> Result<&dyn Any, Traversal>

where K: Keys,

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

fn mut_any_by_key<K>(&mut self, keys: K) -> Result<&mut dyn Any, Traversal>

where K: Keys,

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

fn ref_by_key<T, K>(&self, keys: K) -> Result<&T, Traversal>

where T: Any, K: IntoKeys,

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

fn mut_by_key<T, K>(&mut self, keys: K) -> Result<&mut T, Traversal>

where T: Any, K: IntoKeys,

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

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

fn deserialize_by_key<K, D>( &mut self, keys: K, de: D, ) -> Result<usize, Error<D::Error>>

where K: Keys, D: Deserializer<'de>,

Deserialize a leaf node by its keys.

impl TreeKey for BiquadRepr

fn traverse_all<W: Walk>() -> Result<W, W::Error>

Walk metadata about all paths.

fn traverse_by_key<K, F, E>(keys: K, func: F) -> Result<usize, Error<E>>

where K: Keys, F: FnMut(usize, Option<&'static str>, NonZero<usize>) -> Result<(), E>,

Traverse from the root to a leaf and call a function for each node.

fn transcode<N, K>(keys: K) -> Result<(N, Node), Traversal>

where K: IntoKeys, N: Transcode + Default,

Transcode keys to a new keys type representation

fn nodes<N, const D: usize>() -> NodeIter<Self, N, D>

where N: Transcode + Default,

Return an iterator over nodes of a given type

impl TreeSerialize for BiquadRepr

fn serialize_by_key<K, S>( &self, keys: K, ser: S, ) -> Result<usize, Error<S::Error>>

where K: Keys, S: Serializer,

Serialize a node by keys.