Skip to main content

DualWindowStft

Struct DualWindowStft 

Source
pub struct DualWindowStft { /* private fields */ }
Expand description

Dual-window STFT processor.

Uses a long analysis window for frequency resolution and a shorter synthesis window for low-latency output. The output latency equals the synthesis window size, not the analysis window size.

Implementations§

Source§

impl DualWindowStft

Source

pub fn new(analysis_size: usize, synthesis_size: usize, hop_size: usize) -> Self

Create a new dual-window STFT processor.

§Arguments
  • analysis_size - Analysis window size (determines frequency resolution)
  • synthesis_size - Synthesis window size (determines output latency)
  • hop_size - Hop size in samples
Source

pub fn analyze(&mut self, sample: f32) -> bool

Push a single sample. Returns true when a hop boundary is reached.

When true, the spectrum is available in freq_buffer_mut() for in-place modification. Call synthesize_in_place() after modifying.

Source

pub fn freq_buffer_mut(&mut self) -> &mut [Complex<f32>]

Access the frequency buffer for in-place modification after analyze() returns true.

Source

pub fn synthesize_in_place(&mut self)

Synthesize output from the current frequency buffer (after in-place modification).

Call this after analyze() returns true and the spectrum has been modified via freq_buffer_mut(). The output samples accumulate in the internal buffer and can be read via read_output().

Source

pub fn read_output(&mut self) -> f32

Read one output sample. Returns 0.0 if no output is ready yet.

Source

pub fn process_block<F>( &mut self, input: &[f32], output: &mut [f32], process_fn: F, )
where F: FnMut(&mut [Complex<f32>]),

Process a block: analyze, apply user function, synthesize.

§Arguments
  • input - Input samples
  • output - Output buffer (same length as input)
  • process_fn - Function to modify the spectrum (called at each hop boundary)
Source

pub fn latency_samples(&self) -> usize

Get the output latency in samples.

Source

pub fn reset(&mut self)

Reset all internal state.

Auto Trait Implementations§

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

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

Source§

fn into(self) -> U

Calls U::from(self).

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

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

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

Source§

type Error = Infallible

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

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

Performs the conversion.
Source§

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

Source§

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

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

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

Performs the conversion.