@kubb/ast 5.0.0-beta.89 → 5.0.0-beta.91

package/dist/index.cjs

@@ -1085,41 +1085,6 @@ const VISITOR_KEYS = Object.fromEntries(nodeDefs.flatMap((def) => def.children ?
 * definition's `visitorKey`.
 */
 const VISITOR_KEY_BY_KIND = Object.fromEntries(nodeDefs.flatMap((def) => def.visitorKey ? [[def.kind, def.visitorKey]] : []));
-/**
-* Creates a small async concurrency limiter.
-*
-* At most `concurrency` tasks are in flight at once. Extra tasks are queued.
-*
-* @example
-* ```ts
-* const limit = createLimit(2)
-* for (const task of [taskA, taskB, taskC]) {
-*   await limit(() => task())
-* }
-* // only 2 tasks run at the same time
-* ```
-*/
-function createLimit(concurrency) {
-	let active = 0;
-	const queue = [];
-	function next() {
-		if (active < concurrency && queue.length > 0) {
-			active++;
-			queue.shift()();
-		}
-	}
-	return function limit(fn) {
-		return new Promise((resolve, reject) => {
-			queue.push(() => {
-				Promise.resolve(fn()).then(resolve, reject).finally(() => {
-					active--;
-					next();
-				});
-			});
-			next();
-		});
-	};
-}
 const visitorKeysByKind = VISITOR_KEYS;
 /**
 * Returns `true` when `value` is an AST node (an object carrying a `kind`).
@@ -1155,9 +1120,9 @@ function* getChildren(node, recurse) {
 * context. The result is a replacement node, a collected value, or `undefined`
 * when no callback is registered for the kind.
 *
-* Shared by `walk`, `transform`, and `collectLazy` so node-kind dispatch lives
-* in one place. `TResult` is the caller's expected return: the same node type
-* for `transform`, the collected value type for `collectLazy`, ignored for `walk`.
+* Shared by `transform` and `collectLazy` so node-kind dispatch lives in one place.
+* `TResult` is the caller's expected return: the same node type for `transform`,
+* the collected value type for `collectLazy`.
 */
 function applyVisitor(node, visitor, parent) {
 	const key = VISITOR_KEY_BY_KIND[node.kind];
@@ -1165,37 +1130,6 @@ function applyVisitor(node, visitor, parent) {
 	const fn = visitor[key];
 	return fn?.(node, { parent });
 }
-/**
-* Async depth-first traversal for side effects. Visitor return values are
-* ignored. Use `transform` when you want to rewrite nodes.
-*
-* Sibling nodes at each depth run concurrently up to `options.concurrency`
-* (defaults to `WALK_CONCURRENCY`). Higher values overlap I/O-bound visitor
-* work. Lower values reduce memory pressure.
-*
-* @example Log every operation
-* ```ts
-* await walk(root, {
-*   operation(node) {
-*     console.log(node.operationId)
-*   },
-* })
-* ```
-*
-* @example Only visit the root node
-* ```ts
-* await walk(root, { depth: 'shallow', input: () => {} })
-* ```
-*/
-async function walk(node, options) {
-	return _walk(node, options, (options.depth ?? visitorDepths.deep) === visitorDepths.deep, createLimit(options.concurrency ?? 30), void 0);
-}
-async function _walk(node, visitor, recurse, limit, parent) {
-	await limit(() => applyVisitor(node, visitor, parent));
-	let pending;
-	for (const child of getChildren(node, recurse)) (pending ??= []).push(_walk(child, visitor, recurse, limit, node));
-	if (pending) await Promise.all(pending);
-}
 function transform(node, options) {
 	const { depth, parent, ...visitor } = options;
 	return transformNode(node, visitor, (depth ?? visitorDepths.deep) === visitorDepths.deep, parent);
@@ -1978,8 +1912,7 @@ var exports_exports = /* @__PURE__ */ __exportAll({
 	syncSchemaRef: () => syncSchemaRef,
 	textDef: () => textDef,
 	transform: () => transform,
-	typeDef: () => typeDef,
-	walk: () => walk
+	typeDef: () => typeDef
 });
 //#endregion
 exports.applyMacros = applyMacros;
@@ -2046,6 +1979,5 @@ exports.syncSchemaRef = syncSchemaRef;
 exports.textDef = textDef;
 exports.transform = transform;
 exports.typeDef = typeDef;
-exports.walk = walk;
 
 //# sourceMappingURL=index.cjs.map