Struct Ducker 

pub struct Ducker { /* private fields */ }

Sidechain ducker. Inputs are program channels followed by matching sidechain channels.

At most two channels are processed; the envelope follows the loudest sidechain channel.

Implementations

impl Ducker

pub fn new( threshold: f32, depth_db: f32, attack_ms: f32, release_ms: f32, ) -> Self

Creates a ducker with linear threshold and maximum attenuation in decibels.

The sign of depth_db is ignored and the attenuation is capped at 96 dB. A non-finite or non-positive threshold becomes 0.1.

pub fn set_bypass(&mut self, bypass: bool)

Enables transparent bypass while retaining envelope continuity.

Trait Implementations

impl Clone for Ducker

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Ducker

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

Formats the value using the given formatter.

impl Processor for Ducker

fn inputs_per_output(&self) -> usize

The program, then the sidechain.

fn history_samples(&self) -> u32

Additional source history for a cold seek, excluding algorithmic delay. Built-in recursive processors use a finite settling horizon; this is an approximation to uninterrupted playback, not a bit-exact state snapshot.

fn prepare(&mut self, sample_rate: u32, _max_block: usize)

Configures non-real-time state before processing begins.

fn process( &mut self, _ctx: &ProcessCtx, inputs: &[&[f32]], outputs: &mut [&mut [f32]], )

Processes planar channel slices supplied by the host.

fn reset(&mut self)

Clears signal history without changing authored parameters.

fn save_state(&self) -> StateBlob

Serializes history at an offline chunk boundary.

fn load_state(&mut self, state: &StateBlob) -> Result<(), StateError>

Restores history saved by a processor of the same type, prepared alike, whole or not at all.

fn latency_samples(&self) -> u32

Algorithmic delay that the graph host must compensate.