we need stuff to be pub

Author: molpopgen

tests/test_edge_difference_iteration.rs

@@ -0,0 +1,78 @@
+fn make_treeseq() -> tskit::TreeSequence {
+    let mut tables = tskit::TableCollection::new(1000.).unwrap();
+    tables
+        .add_node(0, 2.0, tskit::PopulationId::NULL, tskit::IndividualId::NULL)
+        .unwrap();
+    tables
+        .add_node(0, 1.0, tskit::PopulationId::NULL, tskit::IndividualId::NULL)
+        .unwrap();
+    tables
+        .add_node(
+            tskit::NodeFlags::new_sample(),
+            0.0,
+            tskit::PopulationId::NULL,
+            tskit::IndividualId::NULL,
+        )
+        .unwrap();
+    tables
+        .add_node(
+            tskit::NodeFlags::new_sample(),
+            0.0,
+            tskit::PopulationId::NULL,
+            tskit::IndividualId::NULL,
+        )
+        .unwrap();
+    tables
+        .add_node(
+            tskit::NodeFlags::new_sample(),
+            0.0,
+            tskit::PopulationId::NULL,
+            tskit::IndividualId::NULL,
+        )
+        .unwrap();
+    tables
+        .add_node(
+            tskit::NodeFlags::new_sample(),
+            0.0,
+            tskit::PopulationId::NULL,
+            tskit::IndividualId::NULL,
+        )
+        .unwrap();
+    tables.add_edge(500., 1000., 0, 1).unwrap();
+    tables.add_edge(0., 500., 0, 2).unwrap();
+    tables.add_edge(0., 1000., 0, 3).unwrap();
+    tables.add_edge(500., 1000., 1, 2).unwrap();
+    tables.add_edge(0., 1000., 1, 4).unwrap();
+    tables.add_edge(0., 1000., 1, 5).unwrap();
+
+    tables
+        .full_sort(tskit::TableSortOptions::default())
+        .unwrap();
+
+    tables.build_index().unwrap();
+
+    tables
+        .tree_sequence(tskit::TreeSequenceFlags::default())
+        .unwrap()
+}
+
+#[test]
+fn test_collect_edge_diff_iterators() {
+    let ts = make_treeseq();
+
+    let diffs = ts.edge_differences_iter().collect::<Vec<_>>();
+
+    for (di, dj) in diffs.iter().zip(ts.edge_differences_iter()) {
+        for (ri, rj) in di.removals().zip(dj.removals()) {
+            assert_eq!(ri.parent(), rj.parent());
+            assert_eq!(ri.child(), rj.child());
+            assert_eq!(ri.left(), rj.left());
+            assert_eq!(ri.right(), rj.right());
+        }
+    }
+
+    let removals = diffs.iter().map(|i| i.removals()).collect::<Vec<_>>();
+    let insertions = diffs.iter().map(|i| i.insertions()).collect::<Vec<_>>();
+
+    let removal_order = ts.edge_removal_order();
+}