Struct RingQueue 

pub struct RingQueue<T: Copy, const CAP: usize> { /* private fields */ }

Ring queue with random access

Allows reading data not only from the head, but also with arbitrary delay. Useful for delay effects and reverb.

Implementations

impl<T: Copy + Default, const CAP: usize> RingQueue<T, CAP>

pub fn new() -> Self

Create a new ring queue

pub fn push(&self, value: T)

Push an element (always succeeds)

pub fn read_delayed(&self, delay: usize) -> T

Read an element with delay

Arguments

• delay - delay in samples (0 = most recently written)

pub fn read_interpolated(&self, delay_frac: f64) -> T

where T: From<f64> + Into<f64>,

Read an element with fractional delay (linear interpolation)

pub fn read_at(&self, index: usize) -> T

Read an element by absolute index

pub fn push_slice(&self, slice: &[T])

Push a slice of data

pub fn read_slice_delayed(&self, delay: usize, output: &mut [T])

Read a slice of data with delay

pub fn write_pos(&self) -> usize

Current write position

pub const fn capacity(&self) -> usize

Capacity

pub fn len(&self) -> usize

Number of written elements (no more than CAP)

pub fn is_empty(&self) -> bool

Returns true if no elements have been written.

pub fn reset(&self)

Reset the write position

pub fn stats(&self) -> &QueueStats

Get statistics

Trait Implementations

impl<T: Copy + Default, const CAP: usize> Default for RingQueue<T, CAP>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Copy + Send, const CAP: usize> Send for RingQueue<T, CAP>

impl<T: Copy + Sync, const CAP: usize> Sync for RingQueue<T, CAP>