Struct idsp::hbf::HbfIntCascade

pub struct HbfIntCascade { /* private fields */ }

Half-band interpolation filter cascade with optimal taps.

This is a no_alloc version without trait objects. The price to pay is fixed and maximal memory usage independent of block size and cascade length.

See HBF_TAPS. Only in-place processing is implemented. Supports rate changes of 1, 2, 4, 8, and 16.

Implementations

impl HbfIntCascade

pub fn set_depth(&mut self, n: usize)

Set cascade depth

Sets the number of HBF filter stages to apply.

pub fn depth(&self) -> usize

Cascade depth

The number of HBF filter stages to apply.

Trait Implementations

impl Clone for HbfIntCascade

fn clone(&self) -> HbfIntCascade

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for HbfIntCascade

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

Formats the value using the given formatter.

impl Default for HbfIntCascade

fn default() -> Self

Returns the “default value” for a type.

impl Filter for HbfIntCascade

type Item = f32

Input/output item type.

fn block_size(&self) -> (usize, usize)

Return the block size granularity and the maximum block size.

fn response_length(&self) -> usize

Finite impulse response length in numer of output items minus one Get this many to drain all previous memory

fn process_block<'a>( &mut self, x: Option<&[Self::Item]>, y: &'a mut [Self::Item], ) -> &'a mut [Self::Item]

Process a block of items.

impl Copy for HbfIntCascade