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

Tuple Fields

0: Box<dyn Node>

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

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

Converts to this type from the input type.

impl Into<Box<dyn Node>> for BoxedNode

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

Converts this type into the (usually inferred) input type.

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.