Struct RingBufferStft 

pub struct RingBufferStft { /* private fields */ }

Ring-buffer STFT processor for low-latency, online signal analysis.

Maintains a circular sample buffer of length window_size. Samples pushed via push are written into the ring; once at least hop_size new samples have arrived a complete frame is produced without any extra allocation.

Implementations

impl RingBufferStft

pub fn new(config: RingBufferStftConfig) -> Result<RingBufferStft, FFTError>

Create a new processor from config.

Errors

Returns FFTError::ValueError if:

• window_size is not a power of two or is less than 4.
• hop_size is zero or larger than window_size.

pub fn push(&mut self, samples: &[f32]) -> Vec<StftFrame>

Push new samples into the processor.

Returns all complete frames generated from the incoming data. A frame is emitted every hop_size samples.

pub fn flush(&mut self) -> Vec<StftFrame>

Flush any remaining buffered samples by zero-padding to the next frame boundary and emitting the final frames.

pub fn reconstruct( &mut self, frame: &StftFrame, modified_spectrum: Option<&[(f32, f32)]>, ) -> Result<Vec<f32>, FFTError>

Overlap-add reconstruction.

Computes the IFFT of modified_spectrum (or of the original spectrum stored in frame if modified_spectrum is None), applies the window function, and accumulates the result in the internal OLA buffer.

Returns hop_size reconstructed samples (the oldest hop’s worth of completed output).

Errors

Returns FFTError::ValueError if overlap-add was not enabled in the config, or if the spectrum length is wrong.

pub fn latency(&self) -> usize

Latency in samples (window_size - hop_size).

pub fn n_freq_bins(&self) -> usize

Number of one-sided frequency bins (window_size / 2 + 1).