feat: state-based store for cross references

Efficiently store cross references even if default ref(*, *): false.

Uses propagation rules instead of view queries to reason about type constraints
and multiplicity.

1 files changed, 10 insertions, 0 deletions

diff --git a/subprojects/language-semantics/src/test/java/tools/refinery/language/semantics/internal/DecisionTreeTests.java b/subprojects/language-semantics/src/test/java/tools/refinery/language/semantics/internal/DecisionTreeTests.java
index 2320de2c..61ce850f 100644
--- a/subprojects/language-semantics/src/test/java/tools/refinery/language/semantics/internal/DecisionTreeTests.java
+++ b/subprojects/language-semantics/src/test/java/tools/refinery/language/semantics/internal/DecisionTreeTests.java
@@ -276,6 +276,16 @@ class DecisionTreeTests {
                 assertThat(sut.getReducedValue(), is(TruthValue.TRUE));
         }
 
+        @Test
+        void overwriteWildcardAllTest() {
+                var first = new DecisionTree(2, TruthValue.UNKNOWN);
+                first.mergeValue(Tuple.of(-1, -1), TruthValue.FALSE);
+                var second = new DecisionTree(2, null);
+                second.mergeValue(Tuple.of(1, -1), TruthValue.TRUE);
+                first.overwriteValues(second);
+                assertThat(first.majorityValue(), is(TruthValue.FALSE));
+        }
+
         private Map<Tuple, TruthValue> iterateAll(DecisionTree sut, TruthValue defaultValue, int nodeCount) {
                 var cursor = sut.getCursor(defaultValue, nodeCount);
                 var map = new LinkedHashMap<Tuple, TruthValue>();