@swagger-api/apidom-parser-adapter-openapi-json-3-1 1.9.0 → 1.10.0

package/CHANGELOG.md

@@ -3,6 +3,10 @@
 All notable changes to this project will be documented in this file.
 See [Conventional Commits](https://conventionalcommits.org) for commit guidelines.
 
+# [1.10.0](https://github.com/swagger-api/apidom/compare/v1.9.0...v1.10.0) (2026-04-01)
+
+**Note:** Version bump only for package @swagger-api/apidom-parser-adapter-openapi-json-3-1
+
 # [1.9.0](https://github.com/swagger-api/apidom/compare/v1.8.0...v1.9.0) (2026-03-30)
 
 **Note:** Version bump only for package @swagger-api/apidom-parser-adapter-openapi-json-3-1

package/dist/apidom-parser-adapter-openapi-json-3-1.browser.js

@@ -18479,14 +18479,12 @@
 
   let parser = null;
   let parserInitLock = null;
-  let currentTree = null;
+  const activeTrees = new Set();
+  const MAX_ACTIVE_TREES = 5;
 
   /**
    * Lexical Analysis of source string using WebTreeSitter.
    * This is WebAssembly version of TreeSitters Lexical Analysis.
-   *
-   * Given JavaScript doesn't support true parallelism, this
-   * code should be as lazy as possible and temporal safety should be fine.
    * @public
    */
   const analyze$2 = async source => {
@@ -18507,9 +18505,28 @@
     } else if (parser === null) {
       throw new ApiDOMError('Error while initializing web-tree-sitter and loading tree-sitter-json grammar.');
     }
-    currentTree = parser.parse(source);
+
+    // prevent WASM OOM during concurrency spikes by evicting oldest trees
+    // when the pool exceeds threshold; tree.delete() is idempotent so
+    // callers that still hold a reference can safely call delete() again
+    if (activeTrees.size >= MAX_ACTIVE_TREES) {
+      const treesToEvict = [...activeTrees];
+      activeTrees.clear();
+      for (const oldTree of treesToEvict) {
+        oldTree.delete();
+      }
+    }
+    const tree = parser.parse(source);
+    activeTrees.add(tree);
+
+    // remove from tracking when caller deletes
+    const originalDelete = tree.delete;
+    tree.delete = function deleteAndUntrack() {
+      activeTrees.delete(this);
+      originalDelete.call(this);
+    };
     parser.reset();
-    return currentTree;
+    return tree;
   };
 
   class TreeCursorSyntaxNode {
@@ -19163,13 +19180,17 @@
     if (!detectionRegExp$1.test(source)) {
       return false;
     }
+    let cst = null;
     try {
-      const cst = await analyze$2(source);
+      cst = await analyze$2(source);
       const isError = cst.rootNode.type !== 'ERROR';
-      cst.delete();
       return isError;
     } catch {
       return false;
+    } finally {
+      if (cst !== null) {
+        cst.delete();
+      }
     }
   };
 
@@ -19188,19 +19209,22 @@
     sourceMap = false,
     syntacticAnalysis = 'direct'
   } = {}) => {
-    const cst = await analyze$2(source);
-    let apiDOM;
-    if (syntacticAnalysis === 'indirect') {
-      apiDOM = analyze(cst, {
-        sourceMap
-      });
-    } else {
-      apiDOM = analyze$1(cst, {
+    let cst = null;
+    try {
+      cst = await analyze$2(source);
+      if (syntacticAnalysis === 'indirect') {
+        return analyze(cst, {
+          sourceMap
+        });
+      }
+      return analyze$1(cst, {
         sourceMap
       });
+    } finally {
+      if (cst !== null) {
+        cst.delete();
+      }
     }
-    cst.delete();
-    return apiDOM;
   };
 
   /**