diff --git a/differential-dataflow/examples/interpreted.rs b/differential-dataflow/examples/interpreted.rs
index 646ea6c2e..87aab361b 100644
--- a/differential-dataflow/examples/interpreted.rs
+++ b/differential-dataflow/examples/interpreted.rs
@@ -28,7 +28,7 @@ fn main() {
         let graph = GraphMMap::new(&filename);
         let nodes = graph.nodes();
         let edges = (0..nodes).filter(move |node| node % peers == index)
-                              .flat_map(|node| graph.edges(node).iter().cloned().map(move |dst| ((node as u32, dst))))
+                              .flat_map(|node| graph.edges(node).iter().cloned().map(move |dst| (node as u32, dst)))
                               .map(|(src, dst)| ((src, dst), Default::default(), 1))
                               .collect::<Vec<_>>();
 
@@ -42,7 +42,7 @@ fn main() {
 }
 
 fn interpret<G>(edges: &Collection<G, Edge>, relations: &[(usize, usize)]) -> Collection<G, Vec<Node>>
-where 
+where
     G: Scope<Timestamp: Lattice+Hash+Ord>,
 {
 
diff --git a/dogsdogsdogs/examples/dogsdogsdogs.rs b/dogsdogsdogs/examples/dogsdogsdogs.rs
index 6f906df35..82098a794 100644
--- a/dogsdogsdogs/examples/dogsdogsdogs.rs
+++ b/dogsdogsdogs/examples/dogsdogsdogs.rs
@@ -23,7 +23,7 @@ fn main() {
         let graph = GraphMMap::new(&filename);
         let nodes = graph.nodes();
         let edges = (0..nodes).filter(move |node| node % peers == index)
-                              .flat_map(|node| graph.edges(node).iter().cloned().map(move |dst| ((node as u32, dst))))
+                              .flat_map(|node| graph.edges(node).iter().cloned().map(move |dst| (node as u32, dst)))
                               .map(|(src, dst)| ((src, dst), Default::default(), 1))
                               .collect::<Vec<_>>();
 
diff --git a/dogsdogsdogs/examples/ngo.rs b/dogsdogsdogs/examples/ngo.rs
index a87ff090f..ccec6040d 100644
--- a/dogsdogsdogs/examples/ngo.rs
+++ b/dogsdogsdogs/examples/ngo.rs
@@ -28,7 +28,7 @@ fn main() {
         let graph = GraphMMap::new(&filename);
         let nodes = graph.nodes();
         let edges = (0..nodes).filter(move |node| node % peers == index)
-                              .flat_map(|node| graph.edges(node).iter().cloned().map(move |dst| ((node as u32, dst))))
+                              .flat_map(|node| graph.edges(node).iter().cloned().map(move |dst| (node as u32, dst)))
                               .map(|(src, dst)| ((src, dst), Default::default(), 1))
                               .collect::<Vec<_>>();