Function radn::flow::traversible::algorithms::contains::n_contains

pub fn n_contains<'a, T: MonadFail<'a, ()>, A: 'a + Send + Clone, D: 'a + PartialEq>(
    comparator: &'a dyn Comparator<A>,
    n_set: Arc<dyn TraversibleBinaryNode<'a, T, A, D>>,
    key: A
) -> T::F<()>