From a6cd7405bea88b3940dc5817f33f8f75b6c84755 Mon Sep 17 00:00:00 2001
From: "Kevin R. Thornton" <krthornt@uci.edu>
Date: Mon, 23 Oct 2023 09:42:47 -0700
Subject: [PATCH] remove print

---
 examples/haploid_wright_fisher_simple_edge_buffer.rs | 6 ------
 1 file changed, 6 deletions(-)

diff --git a/examples/haploid_wright_fisher_simple_edge_buffer.rs b/examples/haploid_wright_fisher_simple_edge_buffer.rs
index 9fcd9dd2..4d6725b7 100644
--- a/examples/haploid_wright_fisher_simple_edge_buffer.rs
+++ b/examples/haploid_wright_fisher_simple_edge_buffer.rs
@@ -122,7 +122,6 @@ fn simulate(
 
     let mut buffer = EdgeBuffer::default();
     for birth_time in (0..num_generations).rev() {
-        println!("bt = {birth_time:?}");
         for c in children.iter_mut() {
             let bt = f64::from(birth_time);
             let child = tables.add_node(0, bt, -1, -1)?;
@@ -141,15 +140,10 @@ fn simulate(
         if birth_time % simplify_interval == 0 {
             //tables.sort(&bookmark, tskit::TableSortOptions::default())?;
             for &parent in buffer.parent.iter().rev() {
-                println!("{parent:?}");
                 let mut last = buffer.last.get(&parent).cloned();
                 while let Some(previous) = last {
                     let edge = &buffer.edges[previous];
                     tables.add_edge(edge.left, edge.right, parent, edge.child)?;
-                    println!("adding {edge:?}");
-                    tables.check_integrity(
-                        tskit::TableIntegrityCheckFlags::default().check_edge_ordering(),
-                    )?;
                     last = edge.previous;
                 }
             }