Experiment with a different approach

Author: triceo

core/src/main/java/ai/timefold/solver/core/impl/bavet/common/AbstractJoinNode.java

@@ -169,14 +169,7 @@ private void processOutTupleUpdate(LeftTuple_ leftTuple, UniTuple<Right_> rightT
     private static <Tuple_ extends AbstractTuple> @Nullable Tuple_ findOutTuple(IndexedSet<Tuple_> outTupleSet,
             IndexedSet<Tuple_> referenceOutTupleSet, int outputStoreIndexOutSet) {
         // Hack: the outTuple has no left/right input tuple reference, use the left/right outSet reference instead.
-        var list = outTupleSet.asList();
-        for (var i = 0; i < list.size(); i++) { // Avoid allocating iterators.
-            var outTuple = list.get(i);
-            if (referenceOutTupleSet == outTuple.getStore(outputStoreIndexOutSet)) {
-                return outTuple;
-            }
-        }
-        return null;
+        return outTupleSet.findFirst(outTuple -> referenceOutTupleSet == outTuple.getStore(outputStoreIndexOutSet));
     }
 
     protected final void retractOutTuple(OutTuple_ outTuple) {

core/src/main/java/ai/timefold/solver/core/impl/bavet/common/index/IndexedSet.java

@@ -10,6 +10,7 @@
 import java.util.List;
 import java.util.Objects;
 import java.util.function.Consumer;
+import java.util.function.Predicate;
 
 /**
  * {@link ArrayList}-backed set which allows to {@link #remove(Object)} an element
@@ -139,6 +140,19 @@ public void forEach(Consumer<T> tupleConsumer) {
         }
     }
 
+    public @Nullable T findFirst(Predicate<T> tupleConsumer) {
+        if (elementList == null) {
+            return null;
+        }
+        for (var i = 0; i < elementList.size(); i++) {
+            var element = elementList.get(i);
+            if (element != null && tupleConsumer.test(element)) {
+                return element;
+            }
+        }
+        return null;
+    }
+
     public boolean isEmpty() {
         return size() == 0;
     }