Trait radn::flow::binary::BinaryTreesEmpty

pub trait BinaryTreesEmpty<'a>: MonadTrees<'a> {
    // Required methods
    fn empty(&self) -> Self::Tree;
    fn split_key_empty(
        &self,
        tree: Self::Tree,
        key: Self::Key
    ) -> BTWrap<'a, Self, KeySplit<Self>>;
}

Required Methods

fn empty(&self) -> Self::Tree

fn split_key_empty( &self, tree: Self::Tree, key: Self::Key ) -> BTWrap<'a, Self, KeySplit<Self>>

Implementors

impl<'a, A: 'a + Send + Sync + Ord + Clone> BinaryTreesEmpty<'a> for Trees<A>

impl<'a, BT> BinaryTreesEmpty<'a> for BalancedTrees<BT>where BT: BinaryTreesUnbalanced<'a> + BinaryTreesEmpty<'a>,

impl<'a, BT> BinaryTreesEmpty<'a> for BoundTrees<BT>where BT: BinaryTreesBindable<'a> + BinaryTreesEmpty<'a> + WithComparator,

impl<'a, Ctx: Context<'a>, A: Mentionable<'a, Ctx> + Clone, C: 'a + Comparator<A>, E: 'a + Send> BinaryTreesEmpty<'a> for TreeContext2<'a, Ctx, A, C, E>