AUDIO
Source snapshot · 12 October 2026

API reference / ravet_signal::LadderFilter

Struct LadderFilter 

pub struct LadderFilter { /* private fields */ }
Expand description

Native single-channel nonlinear feedback ladder. Saturator model: u=tanh(dx-ky4), four RC stages prewarped/trapezoidal. Selected modal taps share history; no implicit output normalization or sample interpolation.

Instantaneous F=u-tanh(c-lambdau) is monotone (lambda=kG^4>=0), solved on the amplitude-scaled [0,tanh(abs(c))] bracket with odd symmetry and bounded 64/32 iterations. Native equation/tanh rounding and actual staged residual are observations, not exact circuit algebra. The solve uses at most 67/35 tanh evaluations; the staged residual adds one (68/36 total). No allocation, locks or I/O, no callback deadline guarantee.

k = 0 explicitly skips feedback history; poisoned stages still return NaN. Source +/-Inf intentionally saturates with finite history; NaN/history poison propagates until reset. Finite drive overflow to infinity saturates. No universal arbitrary-modulation, overflow/headroom or alias-free claim. set_design retains trapezoidal integrator memory; replace_design resets it. Caller owns smoothing, headroom, nonlinear aliasing and denormal policy. tanh uses platform native math: bit-exact cross-platform results are not promised. State is trapezoidal integrator memory s=y+v, not voltage y; retuning retains s. Native32 low-cutoff rounding floors are qualified separately; there is no implicit precision lift or denormal flush.

Implementations§

§

impl LadderFilter

pub fn new(design: LadderDesign) -> Self

pub fn design(&self) -> LadderDesign

pub fn capacitor_state(&self) -> [f64; 4]

pub fn last_solve(&self) -> LadderSolveInfo

pub fn is_bypassed(&self) -> bool

pub fn set_bypassed(&mut self, bypassed: bool)

pub fn set_design(&mut self, design: LadderDesign)

pub fn replace_design(&mut self, design: LadderDesign)

pub fn reset(&mut self)

Clears capacitor/observation history, retaining design and bypass policy.

pub fn snap_to_zero(&mut self)

Explicitly clears only strictly subnormal capacitor states. No implicit callback-boundary snap; normal and nonfinite values remain unchanged.

pub fn process_sample(&mut self, x: f64) -> LadderOutputs

pub fn process( &mut self, input: &[f64], output: &mut [f64], mode: LadderMode, ) -> Result<(), LadderError>

Equal-length scalar-channel block, capped at 65536 samples. Full admission before history/output; empty preserves last solve.

pub fn process_in_place( &mut self, buffer: &mut [f64], mode: LadderMode, ) -> Result<(), LadderError>

Trait Implementations§

§

impl Clone for LadderFilter

§

fn clone(&self) -> LadderFilter

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · §

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

Performs copy-assignment from source. Read more
§

impl Debug for LadderFilter

§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

§

impl<T> Any for T
where T: 'static + ?Sized,

§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

impl<T> Borrow<T> for T
where T: ?Sized,

§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
§

impl<T> BorrowMut<T> for T
where T: ?Sized,

§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> CloneToUninit for T
where T: Clone,

§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

Performs copy-assignment from self to dest. Read more
§

impl<T> From<T> for T

§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T, U> Into<U> for T
where U: From<T>,

§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.