Struct FilterRepr

pub struct FilterRepr<T> { /* private fields */ }

Standard biquad parametrizations

Trait Implementations

impl<T: Clone> Clone for FilterRepr<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for FilterRepr<T>

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

Formats the value using the given formatter.

impl<T: Float + FloatConst> Default for FilterRepr<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> TreeAny for FilterRepr<T>

where Leaf<T>: TreeAny, Leaf<Shape<T>>: TreeAny,

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, T> TreeDeserialize<'de> for FilterRepr<T>

where Leaf<T>: TreeDeserialize<'de>, Leaf<Shape<T>>: TreeDeserialize<'de>,

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<T> TreeKey for FilterRepr<T>

where Leaf<T>: TreeKey, Leaf<Shape<T>>: TreeKey,

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<T> TreeSerialize for FilterRepr<T>

where Leaf<T>: TreeSerialize, Leaf<Shape<T>>: TreeSerialize,

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.