-
Notifications
You must be signed in to change notification settings - Fork 65
/
Copy pathboxed.rs
123 lines (107 loc) · 3.16 KB
/
boxed.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
use crate::{Buffer, Input, Node};
use core::fmt;
use core::ops::{Deref, DerefMut};
/// A wrapper around a `Box<dyn Node>`.
///
/// Provides the necessary `Sized` implementation to allow for compatibility with the graph process
/// function.
pub struct BoxedNode<const N: usize>(pub Box<dyn Node<N>>);
/// A wrapper around a `Box<dyn Node>`.
///
/// Provides the necessary `Sized` implementation to allow for compatibility with the graph process
/// function.
///
/// Useful when the ability to send nodes from one thread to another is required. E.g. this is
/// common when initialising nodes or the audio graph itself on one thread before sending them to
/// the audio thread.
pub struct BoxedNodeSend<const N: usize>(pub Box<dyn Node<N> + Send>);
impl<const N: usize> BoxedNode<N> {
/// Create a new `BoxedNode` around the given `node`.
///
/// This is short-hand for `BoxedNode::from(Box::new(node))`.
pub fn new<T>(node: T) -> Self
where
T: 'static + Node<N>,
{
Self::from(Box::new(node))
}
}
impl<const N: usize> BoxedNodeSend<N> {
/// Create a new `BoxedNode` around the given `node`.
///
/// This is short-hand for `BoxedNode::from(Box::new(node))`.
pub fn new<T>(node: T) -> Self
where
T: 'static + Node<N> + Send,
{
Self::from(Box::new(node))
}
}
impl<const N: usize> Node<N> for BoxedNode<N> {
fn process(&mut self, inputs: &[Input<N>], output: &mut [Buffer<N>]) {
self.0.process(inputs, output)
}
}
impl<const N: usize> Node<N> for BoxedNodeSend<N> {
fn process(&mut self, inputs: &[Input<N>], output: &mut [Buffer<N>]) {
self.0.process(inputs, output)
}
}
impl<T, const N: usize> From<Box<T>> for BoxedNode<N>
where
T: 'static + Node<N>,
{
fn from(n: Box<T>) -> Self {
BoxedNode(n as Box<dyn Node<N>>)
}
}
impl<T, const N: usize> From<Box<T>> for BoxedNodeSend<N>
where
T: 'static + Node<N> + Send,
{
fn from(n: Box<T>) -> Self {
BoxedNodeSend(n as Box<dyn Node<N> + Send>)
}
}
impl<const N: usize> Into<Box<dyn Node<N>>> for BoxedNode<N> {
fn into(self) -> Box<dyn Node<N>> {
self.0
}
}
impl<const N: usize> Into<Box<dyn Node<N> + Send>> for BoxedNodeSend<N> {
fn into(self) -> Box<dyn Node<N> + Send> {
self.0
}
}
impl<const N: usize> fmt::Debug for BoxedNode<N> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
f.debug_struct("BoxedNode").finish()
}
}
impl<const N: usize> fmt::Debug for BoxedNodeSend<N> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
f.debug_struct("BoxedNodeSend").finish()
}
}
impl<const N: usize> Deref for BoxedNode<N> {
type Target = Box<dyn Node<N>>;
fn deref(&self) -> &Self::Target {
&self.0
}
}
impl<const N: usize> Deref for BoxedNodeSend<N> {
type Target = Box<dyn Node<N> + Send>;
fn deref(&self) -> &Self::Target {
&self.0
}
}
impl<const N: usize> DerefMut for BoxedNode<N> {
fn deref_mut(&mut self) -> &mut Self::Target {
&mut self.0
}
}
impl<const N: usize> DerefMut for BoxedNodeSend<N> {
fn deref_mut(&mut self) -> &mut Self::Target {
&mut self.0
}
}