@poe-platform/safe-js 0.1.454 → 0.1.455

package/dist/safe-js/chunks/{chunk-IOBAVJXI.js → chunk-JB2Z6L3C.js}

@@ -27,7 +27,7 @@ import {
   validateMigrationSemantics,
   validateSnapshotData,
   validateSnapshotMigration
-} from "./chunk-GYKATDHU.js";
+} from "./chunk-TZUXEKIQ.js";
 
 // packages/safe-js/src/migrate.ts
 import { createHash } from "node:crypto";
@@ -8249,4 +8249,4 @@ export {
   parseMcpConfig,
   makeMcpModule
 };
-//# sourceMappingURL=chunk-IOBAVJXI.js.map
+//# sourceMappingURL=chunk-JB2Z6L3C.js.map

package/dist/safe-js/chunks/{chunk-GYKATDHU.js → chunk-TZUXEKIQ.js}

@@ -30729,6 +30729,91 @@ function defineDataProperty2(target, key, value) {
   });
 }
 
+// packages/safe-js/src/interp/globals/set-operations.ts
+var setOperationNames = ["union", "intersection", "difference", "symmetricDifference", "isSubsetOf", "isSupersetOf", "isDisjointFrom"];
+function createSetOperation(name, budget) {
+  return createSandboxClosure({
+    guest: true,
+    sandbox: true,
+    name,
+    length: 1,
+    call: async ([other], context) => {
+      const receiver = context?.thisValue;
+      if (!isSandboxSet(receiver)) throw new TypeError(`Set.prototype.${name} requires a Set receiver.`);
+      if (typeof other !== "object" || other === null) throw new TypeError("Expected a set-like object.");
+      const read = async (object, key) => context?.getProperty !== void 0 ? context.getProperty(object, key) : readPropertyDescriptor(getSandboxPropertyDescriptor(object, key, budget) ?? { value: void 0 }, object, context);
+      const iterationContext = { ...context, thisValue: receiver, stack: context?.stack ?? [], getProperty: read };
+      const result = createSandboxSet([]);
+      let iterator;
+      let current;
+      let has;
+      let keys;
+      const release = retainValues(budget, () => [receiver, other, result, current, has, keys, iterator?.retainedValue]);
+      const checkpoint = createDataCheckpoint(budget, context);
+      const add = (value) => {
+        budget.visitNode();
+        if (result.values.has(value)) return;
+        budget.allocateCollectionEntries(result.values.size + 1);
+        result.values.add(value);
+        checkpoint(result, 1 + (budget.limits.dataSize === void 0 ? 0 : measureSandboxData([value])));
+      };
+      try {
+        const numericSize = await sandboxNumber(await read(other, "size"), budget, context);
+        if (Number.isNaN(numericSize)) throw new TypeError("Invalid set-like size.");
+        const size = Math.trunc(numericSize);
+        if (size < 0) throw new RangeError("Negative set-like size.");
+        has = await read(other, "has");
+        if (!isSandboxClosure(has)) throw new TypeError("Set-like has must be callable.");
+        keys = await read(other, "keys");
+        if (!isSandboxClosure(keys)) throw new TypeError("Set-like keys must be callable.");
+        if (name === "isSubsetOf" && receiver.values.size > size || name === "isSupersetOf" && receiver.values.size < size) return false;
+        const visitReceiver = name === "isSubsetOf" || (name === "intersection" || name === "difference" || name === "isDisjointFrom") && receiver.values.size <= size;
+        if (name === "union" || name === "symmetricDifference")
+          iterator = await getSandboxIteratorFromMethod(other, keys, budget, iterationContext);
+        if (name === "union" || name === "symmetricDifference" || name === "difference")
+          for (const value of receiver.values) add(value);
+        if (visitReceiver) {
+          const target = name === "difference" ? result : receiver;
+          const cursor = enterKeyedCollectionCallback(target, target.values, budget);
+          try {
+            for (let next = cursor.next(); !next.done; next = cursor.next()) {
+              current = next.value;
+              const found = Boolean(await invokeBuiltinClosure(has, [current], budget, context, other));
+              if (name === "isSubsetOf" && !found || name === "isDisjointFrom" && found) return false;
+              if (name === "intersection" && found) add(current);
+              if (name === "difference" && found) result.values.delete(current);
+              current = void 0;
+            }
+          } finally {
+            cursor.leave();
+          }
+        } else {
+          iterator ??= await getSandboxIteratorFromMethod(other, keys, budget, iterationContext);
+          while (true) {
+            budget.visitNode();
+            const next = await iterator.next();
+            if ((await readIteratorResult(iterator, next, "done")).value) break;
+            current = (await readIteratorResult(iterator, next, "value")).value;
+            const found = receiver.values.has(current);
+            if (name === "isSupersetOf" && !found || name === "isDisjointFrom" && found) {
+              await closeIterator(iterator);
+              return false;
+            }
+            if (name === "union" || name === "intersection" && found || name === "symmetricDifference" && !found) add(current);
+            else if (name === "difference" || name === "symmetricDifference" && found) result.values.delete(current);
+            current = void 0;
+          }
+        }
+        if (name === "isSubsetOf" || name === "isSupersetOf" || name === "isDisjointFrom") return true;
+        checkpoint(result, 0, true);
+        return allocateProducedSandboxValue(result, budget);
+      } finally {
+        release();
+      }
+    }
+  });
+}
+
 // packages/safe-js/src/interp/globals/collection-prototypes.ts
 function installCollectionPrototypes(budget, mapConstructor, setConstructor) {
   const mapMethods = Object.fromEntries([...mapMethodNames].map((name) => [name, createSandboxClosure({
@@ -30760,6 +30845,7 @@ function installCollectionPrototypes(budget, mapConstructor, setConstructor) {
     }
   })]));
   setMethods.keys = setMethods.values;
+  for (const name of setOperationNames) setMethods[name] = createSetOperation(name, budget);
   const mapSize = createSandboxClosure({
     guest: true,
     sandbox: true,
@@ -55895,4 +55981,4 @@ The above copyright notice and this permission notice shall be included in all c
 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 
 */
-//# sourceMappingURL=chunk-GYKATDHU.js.map
+//# sourceMappingURL=chunk-TZUXEKIQ.js.map