simple-graph-query 2.1.2 → 2.1.4

package/dist/simple-graph-query.bundle.js

@@ -48599,7 +48599,8 @@ function dotJoin(left, right) {
     if (result.some(tuple => tuple.length === 0)) {
         throw new Error("Join would create a relation of arity 0");
     }
-    return result;
+    // Deduplicate results to ensure set semantics
+    return deduplicateTuples(result);
 }
 function bitwidthWraparound(value, bitwidth) {
     const modulus = Math.pow(2, bitwidth); // total number of Int values
@@ -48742,9 +48743,16 @@ class ForgeExprEvaluator extends AbstractParseTreeVisitor_1.AbstractParseTreeVis
     getIden() {
         const instanceTypes = this.instanceData.getTypes();
         const result = [];
+        // Track unique atom IDs to avoid duplicates
+        const seenAtomIds = new Set();
         for (const t of instanceTypes) {
             const typeAtoms = t.atoms;
             typeAtoms.forEach((atom) => {
+                // Skip if we've already seen this atom ID
+                if (seenAtomIds.has(atom.id)) {
+                    return;
+                }
+                seenAtomIds.add(atom.id);
                 let value = atom.id;
                 // do some type conversions so we don't return a string if the value
                 // is a number or boolean
@@ -50001,7 +50009,15 @@ class ForgeExprEvaluator extends AbstractParseTreeVisitor_1.AbstractParseTreeVis
         const typeNames = this.instanceData.getTypes().map((t) => t.id);
         if (typeNames.includes(identifier)) {
             const typeAtoms = this.instanceData.getTypes().find(t => t.id === identifier)?.atoms || [];
-            const desiredValues = typeAtoms.map((atom) => atom.id);
+            // Deduplicate atoms by ID to handle data sources with duplicate entries
+            const uniqueAtomIds = new Set();
+            const desiredValues = [];
+            for (const atom of typeAtoms) {
+                if (!uniqueAtomIds.has(atom.id)) {
+                    uniqueAtomIds.add(atom.id);
+                    desiredValues.push(atom.id);
+                }
+            }
             result = desiredValues.map((singleValue) => [singleValue]);
         }
         for (const typeObj of this.instanceData.getTypes()) {
@@ -50120,7 +50136,15 @@ class ForgeExprEvaluator extends AbstractParseTreeVisitor_1.AbstractParseTreeVis
             if (!intType) {
                 throw new Error('Type "Int" not found in instance data');
             }
-            const intVals = intType.atoms.map((atom) => [Number(atom.id)]);
+            // Deduplicate atoms by ID to handle data sources with duplicate entries
+            const uniqueAtomIds = new Set();
+            const intVals = [];
+            for (const atom of intType.atoms) {
+                if (!uniqueAtomIds.has(atom.id)) {
+                    uniqueAtomIds.add(atom.id);
+                    intVals.push([Number(atom.id)]);
+                }
+            }
             return intVals;
         }
         return this.visitChildren(ctx);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "simple-graph-query",
-  "version": "2.1.2",
+  "version": "2.1.4",
   "description": "TypeScript evaluator for Forge expressions with browser-compatible UMD bundle",
   "main": "dist/simple-graph-query.bundle.js",
   "types": "dist/index.d.ts",