Functions — github.com/RustAudio/dsp-chain

CodeHub MCPcopy Create free account

hub / github.com/RustAudio/dsp-chain / functions

Functions58 in github.com/RustAudio/dsp-chain

⨍ Functions 58 ◇ Types & classes 10

↓ 7 callersMethodprepare_visit_order

Prepare the visit order for the graph in its current state. This is called whenever the **Graph** is mutated in some way that may change the flow of

src/graph.rs:648

↓ 5 callersMethodinputs

A "walker" object that may be used to step through the inputs of the given node. Unlike the `Inputs` type, `WalkInputs` does not borrow the `Graph`.

src/graph.rs:442

↓ 4 callersMethodnext_edge

(&mut self, graph: &Graph<F, N>)

src/graph.rs:710

↓ 4 callersFunctionresize_buffer_to

Resize the given buffer to the given target length.

src/graph.rs:776

↓ 3 callersMethodadd_input

Add a new node weight to the graph as an input to the wait at the given `dest` node index. src -> new edge -> dest Returns an index to both the new

src/graph.rs:408

↓ 3 callersMethodoutputs

A "walker" object that may be used to step through the outputs of the given node. Unlike the `Outputs` type, `WalkOutputs` does not borrow the **Grap

src/graph.rs:453

↓ 3 callersMethodremove_edge

Remove the connection described by the edge at the given index. Returns true if an edge was removed, returns false if there was no edge at the given

src/graph.rs:365

↓ 2 callersMethodadd_node

Add a node to the dsp graph. This computes in **O(1)** time.

src/graph.rs:222

↓ 2 callersMethodaudio_requested_from

Request audio from the node at the given index. Panics** if there is no node for the given index.

src/graph.rs:546

↓ 2 callersMethodnext

(&mut self, graph: &Graph<F, N>)

src/graph.rs:704

↓ 2 callersMethodset_master

Set the master node for the **Graph**. Graph** will check to see if a node exists for the given index before assigning. Graph**'s **Node** implement

src/graph.rs:207

↓ 1 callersMethodadd_connection

Adds an edge from `src` to `dest`. That is, `src` is now an input to `dest`. Returns an error instead if the input would create a cycle in the graph.

src/graph.rs:298

↓ 1 callersMethodadd_output

Add a new node weight to the graph as an output to the wait at the given `src` node index. src -> new edge -> dest Returns an index to both the new

src/graph.rs:429

↓ 1 callersMethodaudio_requested

(&mut self, output: &mut [F], sample_hz: f64)

src/graph.rs:681

↓ 1 callersMethodaudio_requested

(&mut self, buffer: &mut [[f32; CHANNELS]], sample_hz: f64)

examples/volume.rs:79

↓ 1 callersMethodaudio_requested

Here we'll override the audio_requested method and generate a sine wave.

examples/synth.rs:104

↓ 1 callersMethoddry

↓ 1 callersMethodinto_dag

Takes ownership of the **Graph** and returns the underlying **Dag**.

src/graph.rs:168

↓ 1 callersMethodnext_node

(&mut self, graph: &Graph<F, N>)

src/graph.rs:716

↓ 1 callersMethodnode

A reference to the node at the given index (or `None` if it doesn't exist).

src/graph.rs:228

↓ 1 callersMethodnode_count

The total number of nodes in the **Graph**.

src/graph.rs:184

↓ 1 callersMethodremove_node

Remove a node from the dsp graph. Resets the master to None if the index matches the current master index. Note:** This method may shift (and in tur

src/graph.rs:273

↓ 1 callersFunctionsine_wave

Return a sine wave for the given phase.

examples/volume.rs:95

↓ 1 callersFunctionsine_wave

Return a sine wave for the given phase.

examples/synth.rs:119

↓ 1 callersMethodvisit_order

A "walker" type that may be used to step through all node indices in the order in which they will be visited when audio is requested from the **Graph*

src/graph.rs:461

↓ 1 callersMethodvisit_order_rev

A "walker" type that may be used to step through all node indices in the order in which they will be visited when audio is requested from the **Graph*

src/graph.rs:471

↓ 1 callersMethodwet

Methodadd_connections

The same as [`add_connection`](./struct.Graph.html#method.add_connection) but adds multiple connections to the **Graph**. Rather than checking for int

src/graph.rs:331

Methodaudio_requested

(&mut self, buffer: &mut [F], sample_hz: f64)

Clear all dsp nodes.

src/graph.rs:526

Methodclear_disconnected

Clear all dsp nodes that have no inputs or outputs. Returns the number of nodes removed. Note: this may shift (and in turn invalidate) previously re

src/graph.rs:508

Methodconnection

A reference to the connection at the given index (or `None` if it doesn't exist).

src/graph.rs:250

Methodconnection_count

The total number of connections in the **Graph**.

src/graph.rs:189

A reference to the underlying **Dag**.

src/graph.rs:163

Methoddescription

src/graph.rs:795

Following the call to the `Node`'s `audio_requested` method, the `Graph` will sum together some of the original (dry) signal with some of the processe

Methodfind_connection

Find and return the index to the edge that describes the connection where `src` is an input to `dest`. Computes in **O(e')** time, where **e'** is th

src/graph.rs:356

(&self, f: &mut ::std::fmt::Formatter)

src/graph.rs:789

(&'a self, index: NodeIndex)

src/graph.rs:656

Methodindex_mut

(&mut self, index: NodeIndex)

src/graph.rs:663

Methodindex_twice_mut

Index the **Graph** by two `NodeIndex`s at once. Panics** if the indices are equal or if they are out of bounds.

src/graph.rs:262

Methodinto_pet_graph

Takes ownership of the **Graph** and returns the internal **Dag**'s underlying **PetGraph**.

src/graph.rs:179

examples/volume.rs:12

examples/synth.rs:24

Methodmaster_index

Return the **Graph**'s master index if there is one. Graph**'s **Node** implementation will request audio from the node at `maybe_master` when the `N

src/graph.rs:197

Constructor for a new dsp Graph. [`with_capacity`](./struct.Graph.html#method.with_capacity) is recommended if you have a rough idea of the number of

src/graph.rs:137

Methodnew_connection

src/graph.rs:335

A mutable reference to the node at the given index (or `None` if it doesn't exist).

src/graph.rs:233

Methodnodes_mut

An iterator yielding mutable access to all nodes. The order in which nodes are yielded matches the order of their indices.

src/graph.rs:245

Methodpet_graph

A reference to the internal **Dag**'s underlying **PetGraph**.

src/graph.rs:174

Methodprepare_buffers

Prepare the buffers for all nodes within the Graph.

src/graph.rs:533

Methodraw_edges

Read only access to the internal edge array.

src/graph.rs:255

Methodraw_nodes

Read only access to the internal node array.

src/graph.rs:238

Methodremove_all_input_connections

Remove all incoming connections to the node at the given index. Return the number of connections removed.

src/graph.rs:480

Methodremove_all_output_connections

Remove all outgoing connections from the node at the given index. Return the number of connections removed.

src/graph.rs:493

Methodremove_connection

Find and remove any connection between a and b if there is one, whether it is *a -> b* or b -> a*. We know that their may only be one edge as our API

src/graph.rs:384

Following the call to the `Node`'s `audio_requested` method, the `Graph` will sum together some of the original (dry) signal with some of the processe

Methodwith_capacity

Constructor for a new dsp Graph with some minimum capacity. - **nodes** is the capacity for the underlying **Dag**'s node `Vec`. - **connections** is

src/graph.rs:153