diff --git a/accord-core/src/main/java/accord/primitives/RangeDeps.java b/accord-core/src/main/java/accord/primitives/RangeDeps.java
index 14c4bef62..f939d2640 100644
--- a/accord-core/src/main/java/accord/primitives/RangeDeps.java
+++ b/accord-core/src/main/java/accord/primitives/RangeDeps.java
@@ -149,6 +149,11 @@ private RangeDeps(Range[] ranges, TxnId[] txnIds, int[] rangesToTxnIds, int[] tx
         this.txnIdsToRanges = txnIdsToRanges;
     }
 
+    public void forEach(RoutableKey key, Consumer<TxnId> forEach)
+    {
+        forEach(key, Consumer::accept, forEach, 0, null);
+    }
+
     @Inline
     public <P1, P2, P3, P4> int forEach(RoutableKey key, IndexedQuadConsumer<P1, P2, P3, P4> forEachScanOrCheckpoint, IndexedRangeQuadConsumer<P1, P2, P3, P4> forEachRange, P1 p1, P2 p2, P3 p3, P4 p4, int minIndex)
     {
@@ -270,7 +275,7 @@ public <P1> void forEachUniqueTxnId(RoutableKey key, P1 p1, BiConsumer<P1, TxnId
      */
     public void forEach(Range range, Consumer<TxnId> forEach)
     {
-        forEach(range, forEach, 0, null);
+        forEach(range, Consumer::accept, forEach, 0, null);
     }
 
     /**
diff --git a/accord-core/src/test/java/accord/primitives/RangeDepsTest.java b/accord-core/src/test/java/accord/primitives/RangeDepsTest.java
index 2a41b22e6..bbb9356b9 100644
--- a/accord-core/src/test/java/accord/primitives/RangeDepsTest.java
+++ b/accord-core/src/test/java/accord/primitives/RangeDepsTest.java
@@ -27,6 +27,7 @@
 import java.util.*;
 
 import static accord.primitives.Txn.Kind.Write;
+import static org.assertj.core.api.Assertions.assertThat;
 
 public class RangeDepsTest
 {
@@ -96,8 +97,12 @@ Set<TxnId> canonicalOverlaps(Range range)
 
         Set<TxnId> testOverlaps(Range range)
         {
+            List<TxnId> uniq = new ArrayList<>();
+            test.forEachUniqueTxnId(range, uniq::add);
             Set<TxnId> set = new TreeSet<>();
-            test.forEachUniqueTxnId(range, set::add);
+            test.forEach(range, set::add);
+            assertThat(uniq).doesNotHaveDuplicates()
+                            .containsExactlyInAnyOrderElementsOf(set);
             return set;
         }
 
@@ -114,8 +119,12 @@ Set<TxnId> canonicalOverlaps(RoutableKey key)
 
         Set<TxnId> testOverlaps(RoutableKey key)
         {
+            List<TxnId> uniq = new ArrayList<>();
+            test.forEachUniqueTxnId(key, uniq::add);
             Set<TxnId> set = new TreeSet<>();
-            test.forEachUniqueTxnId(key, set::add);
+            test.forEach(key, set::add);
+            assertThat(uniq).doesNotHaveDuplicates()
+                            .containsExactlyInAnyOrderElementsOf(set);
             return set;
         }