Struct dasp_graph::BoxedNode

pub struct BoxedNode(pub Box<dyn Node>);

A wrapper around a Box<dyn Node>.

Provides the necessary Sized implementation to allow for compatibility with the graph process function.

Implementations

impl BoxedNode

pub fn new<T>(node: T) -> Self where
    T: 'static + Node, 

Create a new BoxedNode around the given node.

This is short-hand for BoxedNode::from(Box::new(node)).

Methods from Deref<Target = Box<dyn Node>>

Trait Implementations

impl Debug for BoxedNode

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl Deref for BoxedNode

type Target = Box<dyn Node>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl DerefMut for BoxedNode

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<T> From<Box<T>> for BoxedNode where
    T: 'static + Node, 

fn from(n: Box<T>) -> Self

Performs the conversion.

impl Into<Box<dyn Node + 'static>> for BoxedNode

fn into(self) -> Box<dyn Node>

Performs the conversion.

impl Node for BoxedNode

fn process(&mut self, inputs: &[Input], output: &mut [Buffer])

Process some audio given a list of the node's inputs and write the result to the output buffers.