Trait radn::flow::traversible::TraversibleBinaryNode

pub trait TraversibleBinaryNode<'a, T: Monad<'a>, A: 'a, D: 'a + PartialEq>: 'a + Send + Sync {
    // Required methods
    fn split(&self) -> Split<'a, T, A, D>;
    fn to_tree(self: Arc<Self>) -> Arc<dyn TraversibleBinaryTree<'a, T, A, D>>;
}

Required Methods

fn split(&self) -> Split<'a, T, A, D>

fn to_tree(self: Arc<Self>) -> Arc<dyn TraversibleBinaryTree<'a, T, A, D>>

Implementors

impl<'a, T: Monad<'a>, A: 'a + Send + Sync + Clone> TraversibleBinaryNode<'a, T, A, UnbalancedData> for UnbalancedNode<'a, T, A>