@speclynx/apidom-core 4.10.0 → 4.11.1

package/CHANGELOG.md

@@ -3,6 +3,20 @@
 All notable changes to this project will be documented in this file.
 See [Conventional Commits](https://conventionalcommits.org) for commit guidelines.
 
+## [4.11.1](https://github.com/speclynx/apidom/compare/v4.11.0...v4.11.1) (2026-06-10)
+
+**Note:** Version bump only for package @speclynx/apidom-core
+
+# [4.11.0](https://github.com/speclynx/apidom/compare/v4.10.1...v4.11.0) (2026-06-10)
+
+### Features
+
+- **traverse:** skipVisited 'enter-only' mode and path.revisited ([#333](https://github.com/speclynx/apidom/issues/333)) ([fe944df](https://github.com/speclynx/apidom/commit/fe944df0eaab437a65d5761e6a3e14d490d2d3d6))
+
+## [4.10.1](https://github.com/speclynx/apidom/compare/v4.10.0...v4.10.1) (2026-05-20)
+
+**Note:** Version bump only for package @speclynx/apidom-core
+
 # [4.10.0](https://github.com/speclynx/apidom/compare/v4.9.1...v4.10.0) (2026-05-12)
 
 **Note:** Version bump only for package @speclynx/apidom-core

package/dist/apidom-core.browser.js

@@ -16343,8 +16343,10 @@ class Composer {
             }
         }
         if (afterDoc) {
-            Array.prototype.push.apply(doc.errors, this.errors);
-            Array.prototype.push.apply(doc.warnings, this.warnings);
+            for (let i = 0; i < this.errors.length; ++i)
+                doc.errors.push(this.errors[i]);
+            for (let i = 0; i < this.warnings.length; ++i)
+                doc.warnings.push(this.warnings[i]);
         }
         else {
             doc.errors = this.errors;
@@ -20418,7 +20420,7 @@ class Lexer {
             const n = (yield* this.pushCount(1)) + (yield* this.pushSpaces(true));
             this.indentNext = this.indentValue + 1;
             this.indentValue += n;
-            return yield* this.parseBlockStart();
+            return 'block-start';
         }
         return 'doc';
     }
@@ -20739,32 +20741,36 @@ class Lexer {
         return 0;
     }
     *pushIndicators() {
-        switch (this.charAt(0)) {
-            case '!':
-                return ((yield* this.pushTag()) +
-                    (yield* this.pushSpaces(true)) +
-                    (yield* this.pushIndicators()));
-            case '&':
-                return ((yield* this.pushUntil(isNotAnchorChar)) +
-                    (yield* this.pushSpaces(true)) +
-                    (yield* this.pushIndicators()));
-            case '-': // this is an error
-            case '?': // this is an error outside flow collections
-            case ':': {
-                const inFlow = this.flowLevel > 0;
-                const ch1 = this.charAt(1);
-                if (isEmpty(ch1) || (inFlow && flowIndicatorChars.has(ch1))) {
-                    if (!inFlow)
-                        this.indentNext = this.indentValue + 1;
-                    else if (this.flowKey)
-                        this.flowKey = false;
-                    return ((yield* this.pushCount(1)) +
-                        (yield* this.pushSpaces(true)) +
-                        (yield* this.pushIndicators()));
+        let n = 0;
+        loop: while (true) {
+            switch (this.charAt(0)) {
+                case '!':
+                    n += yield* this.pushTag();
+                    n += yield* this.pushSpaces(true);
+                    continue loop;
+                case '&':
+                    n += yield* this.pushUntil(isNotAnchorChar);
+                    n += yield* this.pushSpaces(true);
+                    continue loop;
+                case '-': // this is an error
+                case '?': // this is an error outside flow collections
+                case ':': {
+                    const inFlow = this.flowLevel > 0;
+                    const ch1 = this.charAt(1);
+                    if (isEmpty(ch1) || (inFlow && flowIndicatorChars.has(ch1))) {
+                        if (!inFlow)
+                            this.indentNext = this.indentValue + 1;
+                        else if (this.flowKey)
+                            this.flowKey = false;
+                        n += yield* this.pushCount(1);
+                        n += yield* this.pushSpaces(true);
+                        continue loop;
+                    }
                 }
             }
+            break loop;
         }
-        return 0;
+        return n;
     }
     *pushTag() {
         if (this.charAt(1) === '<') {
@@ -20955,6 +20961,14 @@ function getFirstKeyStartProps(prev) {
     }
     return prev.splice(i, prev.length);
 }
+function arrayPushArray(target, source) {
+    // May exhaust call stack with large `source` array
+    if (source.length < 1e5)
+        Array.prototype.push.apply(target, source);
+    else
+        for (let i = 0; i < source.length; ++i)
+            target.push(source[i]);
+}
 function fixFlowSeqItems(fc) {
     if (fc.start.type === 'flow-seq-start') {
         for (const it of fc.items) {
@@ -20967,12 +20981,12 @@ function fixFlowSeqItems(fc) {
                 delete it.key;
                 if (isFlowToken(it.value)) {
                     if (it.value.end)
-                        Array.prototype.push.apply(it.value.end, it.sep);
+                        arrayPushArray(it.value.end, it.sep);
                     else
                         it.value.end = it.sep;
                 }
                 else
-                    Array.prototype.push.apply(it.start, it.sep);
+                    arrayPushArray(it.start, it.sep);
                 delete it.sep;
             }
         }
@@ -21390,7 +21404,7 @@ class Parser {
                         const prev = map.items[map.items.length - 2];
                         const end = prev?.value?.end;
                         if (Array.isArray(end)) {
-                            Array.prototype.push.apply(end, it.start);
+                            arrayPushArray(end, it.start);
                             end.push(this.sourceToken);
                             map.items.pop();
                             return;
@@ -21605,7 +21619,7 @@ class Parser {
                         const prev = seq.items[seq.items.length - 2];
                         const end = prev?.value?.end;
                         if (Array.isArray(end)) {
-                            Array.prototype.push.apply(end, it.start);
+                            arrayPushArray(end, it.start);
                             end.push(this.sourceToken);
                             seq.items.pop();
                             return;
@@ -27992,6 +28006,14 @@ class Path {
    */
   inList;
 
+  /**
+   * True when this node is a non-descending revisit of an already-visited node
+   * (only under skipVisited: 'enter-only'). Children are not traversed.
+   * Set on both the enter and the matching leave phase, so it is meaningful
+   * in either phase.
+   */
+  revisited = false;
+
   /**
    * Internal state for traversal control.
    */
@@ -28576,6 +28598,10 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+/**
+ * Controls handling of already-visited nodes during traversal.
+ * @public
+ */
 /**
  * Options for the traverse function.
  * @public
@@ -28583,6 +28609,12 @@ __webpack_require__.r(__webpack_exports__);
 // =============================================================================
 // Internal types for generator
 // =============================================================================
+
+const normalizeSkipVisited = v => {
+  if (v === true) return 'skip';
+  if (v === false || v === undefined) return 'never';
+  return v;
+};
 // =============================================================================
 // Core generator
 // =============================================================================
@@ -28600,7 +28632,7 @@ function* traverseGenerator(root, visitor, options) {
     mutationFn
   } = options;
   const keyMapIsFunction = typeof keyMap === 'function';
-  const visitedNodes = skipVisited ? new WeakSet() : null;
+  const visitedNodes = skipVisited !== 'never' ? new WeakSet() : null;
   let stack;
   let inArray = Array.isArray(root);
   let keys = [root];
@@ -28615,6 +28647,7 @@ function* traverseGenerator(root, visitor, options) {
     index += 1;
     const isLeaving = index === keys.length;
     let key;
+    let revisitNoDescend = false;
     const isEdited = isLeaving && edits.length !== 0;
     if (isLeaving) {
       key = ancestors.length === 0 ? undefined : currentPath?.key;
@@ -28656,6 +28689,7 @@ function* traverseGenerator(root, visitor, options) {
         edits = stack.edits;
         const parentInArray = stack.inArray;
         parentPath = stack.parentPath;
+        revisitNoDescend = stack.revisitNoDescend;
         stack = stack.prev;
 
         // Push the edited node to parent's edits for propagation up the tree
@@ -28687,15 +28721,22 @@ function* traverseGenerator(root, visitor, options) {
       }
 
       // Skip already-visited nodes (handles DAG structures from cloneShallow)
-      if (skipVisited && !isLeaving) {
+      if (skipVisited !== 'never' && !isLeaving) {
         if (visitedNodes.has(node)) {
-          continue;
+          if (skipVisited === 'enter-only') {
+            // fire enter/leave for this occurrence, but don't re-descend
+            revisitNoDescend = true;
+          } else {
+            continue;
+          }
+        } else {
+          visitedNodes.add(node);
         }
-        visitedNodes.add(node);
       }
 
       // Always create Path for the current node (needed for parentPath chain)
       currentPath = new _Path_mjs__WEBPACK_IMPORTED_MODULE_2__.Path(node, parent, parentPath, key, inArray);
+      currentPath.revisited = revisitNoDescend;
       const visitFn = (0,_visitors_mjs__WEBPACK_IMPORTED_MODULE_3__.getVisitFn)(visitor, nodeTypeGetter(node), isLeaving);
       if (visitFn) {
         // Assign state to visitor
@@ -28759,10 +28800,13 @@ function* traverseGenerator(root, visitor, options) {
         keys,
         edits,
         parentPath,
+        revisitNoDescend,
         prev: stack
       };
       inArray = Array.isArray(node);
-      if (inArray) {
+      if (revisitNoDescend) {
+        keys = [];
+      } else if (inArray) {
         keys = node;
       } else if (keyMapIsFunction) {
         keys = keyMap(node);
@@ -28837,7 +28881,7 @@ const traverse = (root, visitor, options = {}) => {
     nodePredicate: options.nodePredicate ?? _visitors_mjs__WEBPACK_IMPORTED_MODULE_3__.isNode,
     nodeCloneFn: options.nodeCloneFn ?? _visitors_mjs__WEBPACK_IMPORTED_MODULE_3__.cloneNode,
     detectCycles: options.detectCycles ?? true,
-    skipVisited: options.skipVisited ?? false,
+    skipVisited: normalizeSkipVisited(options.skipVisited),
     mutable: options.mutable ?? false,
     mutationFn: options.mutationFn ?? _visitors_mjs__WEBPACK_IMPORTED_MODULE_3__.mutateNode
   };
@@ -28869,7 +28913,7 @@ const traverseAsync = async (root, visitor, options = {}) => {
     nodePredicate: options.nodePredicate ?? _visitors_mjs__WEBPACK_IMPORTED_MODULE_3__.isNode,
     nodeCloneFn: options.nodeCloneFn ?? _visitors_mjs__WEBPACK_IMPORTED_MODULE_3__.cloneNode,
     detectCycles: options.detectCycles ?? true,
-    skipVisited: options.skipVisited ?? false,
+    skipVisited: normalizeSkipVisited(options.skipVisited),
     mutable: options.mutable ?? false,
     mutationFn: options.mutationFn ?? _visitors_mjs__WEBPACK_IMPORTED_MODULE_3__.mutateNode
   };
@@ -29337,7 +29381,9 @@ mergeVisitors[Symbol.for('nodejs.util.promisify.custom')] = mergeVisitorsAsync;
  * @internal
  */
 function createPathProxy(originalPath, currentNode) {
-  return new _Path_mjs__WEBPACK_IMPORTED_MODULE_4__.Path(currentNode, originalPath.parent, originalPath.parentPath, originalPath.key, originalPath.inList);
+  const proxy = new _Path_mjs__WEBPACK_IMPORTED_MODULE_4__.Path(currentNode, originalPath.parent, originalPath.parentPath, originalPath.key, originalPath.inList);
+  proxy.revisited = originalPath.revisited;
+  return proxy;
 }
 
 /***/ }