From c4a206da02ba2c459d1f268bd555e6210701f68b Mon Sep 17 00:00:00 2001
From: Mark Thom <markjordanthom@gmail.com>
Date: Fri, 2 Mar 2018 22:31:34 -0700
Subject: [PATCH] simplify heap_iter.rs

---
 src/prolog/heap_iter.rs | 10 +++-------
 1 file changed, 3 insertions(+), 7 deletions(-)

diff --git a/src/prolog/heap_iter.rs b/src/prolog/heap_iter.rs
index a61f4a0e..909442fa 100644
--- a/src/prolog/heap_iter.rs
+++ b/src/prolog/heap_iter.rs
@@ -167,9 +167,7 @@ impl<HeapCellIter> Iterator for HeapCellAcyclicIterator<HeapCellIter>
 
     fn next(&mut self) -> Option<Self::Item> {
         while let Some(addr) = self.iter.stack().pop() {
-            if self.seen.contains(&addr) {
-                continue;
-            } else {
+            if !self.seen.contains(&addr) {
                 self.iter.stack().push(addr.clone());
                 self.seen.insert(addr);
                 break;
@@ -201,11 +199,9 @@ impl<HeapCellIter> Iterator for HeapCellZippedAcyclicIterator<HeapCellIter>
 
     fn next(&mut self) -> Option<Self::Item> {
         while let (Some(a1), Some(a2)) = (self.i1.stack().pop(), self.i2.stack().pop()) {
-            if self.seen.contains(&(a1.clone(), a2.clone())) {
-                continue;
-            } else {
+            if !self.seen.contains(&(a1.clone(), a2.clone())) {
                 self.i1.stack().push(a1.clone());
-                self.i2.stack().push(a2.clone());                
+                self.i2.stack().push(a2.clone());
                 self.seen.insert((a1, a2));
 
                 break;
-- 
2.54.0