Skip to main content

DelayReader

Struct DelayReader 

Source
pub(crate) struct DelayReader {
    channel_info: ChannelInfo,
    delay_frames: [f32; 128],
    delay_line: Arc<RwLock<VecDeque<Block>>>,
    upmixed_block: Arc<RwLock<Option<UpmixedBlock>>>,
    delay_time: Param,
}
Expand description

https://webaudio.github.io/web-audio-api/#delayreader

…an object that has the same interface as an AudioNode, and that can read the audio data from the internal buffer of the DelayNode. It is connected to the same AudioNodes as the DelayNode it was created from.

Fields§

§channel_info: ChannelInfo§delay_frames: [f32; 128]§delay_line: Arc<RwLock<VecDeque<Block>>>§upmixed_block: Arc<RwLock<Option<UpmixedBlock>>>§delay_time: Param

Implementations§

Source§

impl DelayReader

Source

pub(super) fn new( buffer: Arc<RwLock<VecDeque<Block>>>, upmixed_block: Arc<RwLock<Option<UpmixedBlock>>>, delay_time: Param, channel_info: ChannelInfo, ) -> Self

Source

fn update_parameters(&mut self, info: &BlockInfo, tick: Tick) -> bool

Source

fn update_delay_frames(&mut self, tick: usize, value: f32)

1.18.4

When producing an output buffer, a DelayReader MUST yield exactly the audio that was written to the corresponding DelayWriter delayTime seconds ago.

We are processing tick t, where t ranges from 0 to (FRAMES_PER_BLOCK - 1). The DelayWriter is writing a frame into the delay line every tick. Let delay_frame = delay_time * sample_rate, at tick t. Now let’s process tick t + 1. delay_frame must increase by 1 to account for the new tick. There are FRAMES_PER_BLOCK - 1 - t ticks to process after tick t. So after processing all ticks (FRAMES_PER_BLOCK - 1), delay_frames[t] = delay_time * sample_rate + FRAMES_PER_BLOCK - 1 - t

Source

fn calc_output_channel_count(&self) -> u8

Calculates the output channel count https://webaudio.github.io/web-audio-api/#tail-time 4.3

When an AudioNode has a non-zero tail-time, and an output channel count that depends on the input channels count, the AudioNode’s tail-time must be taken into account when the input channel count changes.

When there is a decrease in input channel count, the change in output channel count MUST happen when the input that was received with greater channel count no longer affects the output.

When there is an increase in input channel count, the behavior depends on the AudioNode type:

  • For a DelayNode or a DynamicsCompressorNode, the number of output channels MUST increase when the input that was received with greater channel count begins to affect the output.

Therefore, we know that output channel count will be the highest channel count of the blocks read.

Source

fn upmix_block( &self, index: usize, channel_count: u8, block: &Block, ) -> UpmixedBlock

Source

pub(super) fn read(&mut self) -> Chunk

Read frames from the delay line at the values indexed around the specified delays.

Trait Implementations§

Source§

impl AudioNodeCommon for DelayReader

Source§

impl AudioNodeEngine for DelayReader

Source§

fn node_type(&self) -> AudioNodeType

Source§

fn process(&mut self, _inputs: Chunk, info: &BlockInfo) -> Chunk

Source§

fn get_param(&mut self, id: ParamType) -> &mut Param

Source§

fn mute_node(&mut self) -> Chunk

Source§

fn message(&mut self, msg: AudioNodeMessage, sample_rate: f32)

Source§

fn message_specific(&mut self, _: AudioNodeMessage, _sample_rate: f32)

Messages specific to this node
Source§

fn input_count(&self) -> u32

Source§

fn output_count(&self) -> u32

Source§

fn channel_count(&self) -> u8

Number of input channels for each input port
Source§

fn channel_count_mode(&self) -> ChannelCountMode

Source§

fn channel_interpretation(&self) -> ChannelInterpretation

Source§

fn set_channel_interpretation(&mut self, i: ChannelInterpretation)

Source§

fn set_channel_count(&mut self, c: u8)

Source§

fn set_channel_count_mode(&mut self, m: ChannelCountMode)

Source§

fn destination_data(&mut self) -> Option<Chunk>

If we’re the destination node, extract the contained data
Source§

fn set_listenerdata(&mut self, _: Block)

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> MaybeBoxed<Box<T>> for T

Source§

fn maybe_boxed(self) -> Box<T>

Convert
Source§

impl<T> MaybeBoxed<T> for T

Source§

fn maybe_boxed(self) -> T

Convert
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<T, S> SimdFrom<T, S> for T
where S: Simd,

Source§

fn simd_from(_simd: S, value: T) -> T

Source§

impl<F, T, S> SimdInto<T, S> for F
where T: SimdFrom<F, S>, S: Simd,

Source§

fn simd_into(self, simd: S) -> T

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.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> ErasedDestructor for T
where T: 'static,

Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,