mrds::trees::unbalanced

src/flow/traversible.rs

@@ -1,7 +1,6 @@
 //! Traversible binary trees.
 
 pub mod algorithms;
-pub mod unbalanced;
 
 use std::rc::Rc;
 

src/lib.rs

@@ -3,6 +3,7 @@
 
 pub mod flow;
 pub mod func;
+pub mod mrds;
 pub mod rcore;
 pub mod rstd;
 #[cfg(test)]

src/mrds.rs

@@ -0,0 +1,7 @@
+//! # Memory-resident data strucures
+//! Provided as examples of implementing [`flow`] traits.
+
+#[cfg(doc)]
+use crate::flow;
+
+pub mod trees;

src/mrds/trees.rs

@@ -0,0 +1 @@
+pub mod unbalanced;

src/mrds/trees/unbalanced.rs

@@ -2,12 +2,11 @@
 //!
 //! Intended for testing.
 
-use std::fmt::Display;
+use std::{fmt::Display, rc::*};
 
+use crate::flow::traversible::*;
 use crate::func::*;
 
-use super::*;
-
 pub struct UnbalancedData;
 
 impl PartialEq for UnbalancedData {
@@ -172,7 +171,7 @@ impl<'a, T: Monad<'a>, A: 'a> UnbalancedConstructor<'a, T, A> {
 mod tests {
     use rand::{Rng, SeedableRng};
 
-    use crate::rstd::tracing::*;
+    use crate::{flow::comparator::*, rstd::tracing::*};
 
     use super::{algorithms::contains::*, algorithms::subset::*, *};