let's keep the arrays

Author: molpopgen

src/edge_differences.rs

@@ -1,3 +1,4 @@
+use crate::EdgeId;
 use crate::NodeId;
 use crate::Position;
 use crate::TreeSequence;
@@ -75,13 +76,26 @@ pub type EdgeRemoval = EdgeDifference<Removal>;
 /// Manages iteration over trees to obtain
 /// edge differences.
 pub struct EdgeDifferencesIterator<'ts> {
-    treeseq: &'ts TreeSequence,
+    edge_left: &'ts [Position],
+    edge_right: &'ts [Position],
+    edge_parent: &'ts [NodeId],
+    edge_child: &'ts [NodeId],
+    insertion_order: &'ts [EdgeId],
+    removal_orderr: &'ts [EdgeId],
     left: f64,
 }
 
 impl<'ts> EdgeDifferencesIterator<'ts> {
     pub(crate) fn new(treeseq: &'ts TreeSequence) -> Self {
-        Self{treeseq, left: 0.}
+        Self {
+            edge_left: treeseq.tables().edges().left_slice(),
+            edge_right: treeseq.tables().edges().right_slice(),
+            edge_parent: treeseq.tables().edges().parent_slice(),
+            edge_child: treeseq.tables().edges().child_slice(),
+            insertion_order: treeseq.edge_insertion_order(),
+            removal_orderr: treeseq.edge_removal_order(),
+            left: 0.,
+        }
     }
 }