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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152

// The MIT License (MIT)

// Copyright (c) 2016 RustAudio Developers

// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:

// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.

// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.

use crate::{Buffer, Input, Message, Node};
use core::fmt;
use core::ops::{Deref, DerefMut};
use hashbrown::HashMap;

/// 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: &mut HashMap<usize, Input<N>>, output: &mut [Buffer<N>]) {
        self.0.process(inputs, output)
    }
    fn send_msg(&mut self, info: Message) {
        self.0.send_msg(info)
    }
}

impl<const N: usize> Node<N> for BoxedNodeSend<N> {
    fn process(&mut self, inputs: &mut HashMap<usize, Input<N>>, output: &mut [Buffer<N>]) {
        self.0.process(inputs, output)
    }
    fn send_msg(&mut self, info: Message) {
        self.0.send_msg(info)
    }
}

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> From<BoxedNode<N>> for Box<dyn Node<N>> {
    fn from(value: BoxedNode<N>) -> Self {
        value.0
    }
}

impl<const N: usize> From<BoxedNodeSend<N>> for Box<dyn Node<N> + Send> {
    fn from(value: BoxedNodeSend<N>) -> Self {
        value.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
    }
}