// 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
    }
}
