Move to mom::impls

src/nested/map/mom/impls/mod.rs

@@ -1,3 +1,4 @@
 //! Module containing MOM implementations in sub-modules
 pub mod zvec;
 
+pub mod ported_from_mom_builder;

src/nested/mom/build_tree.rs → src/nested/map/mom/impls/ported_from_mom_builder/build_tree.rs

@@ -34,11 +34,11 @@
 //! 4. The recursion interrupts when we cannot merge (children group is incomplete or merge is
 //!    invalid) or we are at the root nodes.
 
-use crate::nested::mom::exclusive_option::ExclusiveOption;
-use crate::nested::mom::norder_leaves::NorderLeaves;
-use crate::nested::mom::state::merge_states::MergeStates;
-use crate::nested::mom::tree::{Tree, TreeMutRef};
-use crate::nested::mom::tree_config::TreeConfig;
+use super::exclusive_option::ExclusiveOption;
+use super::norder_leaves::NorderLeaves;
+use super::state::merge_states::MergeStates;
+use super::tree::{Tree, TreeMutRef};
+use super::tree_config::TreeConfig;
 use itertools::Itertools;
 
 /// A structure to build a tree from a fallible iterator over the leaf states.

src/nested/mom/norder_leaves.rs → src/nested/map/mom/impls/ported_from_mom_builder/norder_leaves.rs

@@ -1,6 +1,6 @@
 //! A data structure for storing the leaves of a tree of a given depth.
 
-use crate::nested::mom::error::Error;
+use super::error::Error;
 use std::ops::Range;
 
 /// A data structure for storing the leaves of a tree of a given depth. The leaves are stored as a

src/nested/mom/state/min_max_mean.rs → src/nested/map/mom/impls/ported_from_mom_builder/state/min_max_mean.rs

@@ -1,5 +1,5 @@
-use crate::nested::mom::state::merge_is_valid::MergeIsValid;
-use crate::nested::mom::state::merge_states::MergeStates;
+use super::merge_is_valid::MergeIsValid;
+use super::merge_states::MergeStates;
 use serde::{Deserialize, Serialize};
 use num_traits::Float;
 

src/nested/mom/state/value/exctly_equal_merger.rs → src/nested/map/mom/impls/ported_from_mom_builder/state/value/exctly_equal_merger.rs

@@ -1,5 +1,5 @@
-use crate::nested::mom::state::merge_states::MergeStates;
-use crate::nested::mom::state::value::value_state::ValueState;
+use crate::nested::map::mom::impls::ported_from_mom_builder::state::merge_states::MergeStates;
+use super::value_state::ValueState;
 use serde::{Deserialize, Serialize};
 use std::marker::PhantomData;
 

src/nested/mom/state/value/sum_until.rs → src/nested/map/mom/impls/ported_from_mom_builder/state/value/sum_until.rs

@@ -1,6 +1,6 @@
-use crate::nested::mom::state::merge_is_valid::MergeIsValid;
-use crate::nested::mom::state::merge_states::MergeStates;
-use crate::nested::mom::state::value::ValueState;
+use crate::nested::map::mom::impls::ported_from_mom_builder::state::merge_is_valid::MergeIsValid;
+use crate::nested::map::mom::impls::ported_from_mom_builder::state::merge_states::MergeStates;
+use super::ValueState;
 use num_traits::Zero;
 use serde::{Deserialize, Serialize};
 

src/nested/mom/tree.rs → src/nested/map/mom/impls/ported_from_mom_builder/tree.rs

@@ -1,6 +1,6 @@
 //! Tree and related types.
 
-use crate::nested::mom::norder_leaves::NorderLeaves;
+use super::norder_leaves::NorderLeaves;
 
 /// Tree is a vector of [NorderLeaves] representing leaves at a given depth. Index denotes the norder
 /// (depth) of the tree.

src/nested/mod.rs

@@ -27,7 +27,6 @@ use self::{
 pub mod bmoc;
 pub mod gpu;
 pub mod map;
-pub mod mom;
 pub mod zordercurve;
 
 // We use an array here since operations on f64 are not yet stable for `const fn` :o/