Struct SchroederReverb 

pub struct SchroederReverb { /* private fields */ }

Allocation-free prepared Schroeder reverb with four combs and two allpasses.

Implementations

impl SchroederReverb

pub fn new(room_size: f32, damping: f32, wet: f32) -> Self

Creates a reverb with room, damping, and wet controls clamped to the unit interval. Non-finite values fall back to 0.7, 0.3, and 0.25.

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

Enables transparent bypass while the tail continues evolving.

pub fn tail_samples(&self, sample_rate: u32) -> u64

How long the reverb rings after its input stops, in samples at sample_rate, prepared or not: until its slowest frequencies (the lowest, which the damping filter passes) have fallen 60 dB through the longest comb, plus the allpasses’ own 60 dB. A bound for these room and damping values, not a fixed length: a room of 1 rings about four seconds.

Trait Implementations

impl Clone for SchroederReverb

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 SchroederReverb

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

Formats the value using the given formatter.

impl Processor for SchroederReverb

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 inputs_per_output(&self) -> usize

How many input channels the processor reads for each output channel: 1 for an effect, 2 for one that also reads a second bus after the first (a sidechain, or the other side of a crossfade). A crate::ProcessorChain gives each node only its own channels, so it takes only processors that read one.

fn latency_samples(&self) -> u32

Algorithmic delay that the graph host must compensate.