@kubb/ast 5.0.0-beta.13 → 5.0.0-beta.15

package/dist/index.cjs

@@ -533,32 +533,36 @@ function createLimit(concurrency) {
 * // returns parameters, requestBody schema (if present), and responses
 * ```
 */
-function getChildren(node, recurse) {
+function* getChildren(node, recurse) {
 	switch (node.kind) {
-		case "Input": return [...node.schemas, ...node.operations];
-		case "Output": return [];
-		case "Operation": return [
-			...node.parameters,
-			...node.requestBody?.content?.flatMap((c) => c.schema ? [c.schema] : []) ?? [],
-			...node.responses
-		];
-		case "Schema": {
-			const children = [];
-			if (!recurse) return [];
-			if ("properties" in node && node.properties.length > 0) children.push(...node.properties);
-			if ("items" in node && node.items) children.push(...node.items);
-			if ("members" in node && node.members) children.push(...node.members);
-			if ("additionalProperties" in node && node.additionalProperties && node.additionalProperties !== true) children.push(node.additionalProperties);
-			return children;
-		}
-		case "Property": return [node.schema];
-		case "Parameter": return [node.schema];
-		case "Response": return node.schema ? [node.schema] : [];
-		case "FunctionParameter":
-		case "ParameterGroup":
-		case "FunctionParameters":
-		case "Type": return [];
-		default: return [];
+		case "Input":
+			yield* node.schemas;
+			yield* node.operations;
+			break;
+		case "Output": break;
+		case "Operation":
+			yield* node.parameters;
+			if (node.requestBody?.content) {
+				for (const c of node.requestBody.content) if (c.schema) yield c.schema;
+			}
+			yield* node.responses;
+			break;
+		case "Schema":
+			if (!recurse) break;
+			if ("properties" in node && node.properties.length > 0) yield* node.properties;
+			if ("items" in node && node.items) yield* node.items;
+			if ("members" in node && node.members) yield* node.members;
+			if ("additionalProperties" in node && node.additionalProperties && node.additionalProperties !== true) yield node.additionalProperties;
+			break;
+		case "Property":
+			yield node.schema;
+			break;
+		case "Parameter":
+			yield node.schema;
+			break;
+		case "Response":
+			if (node.schema) yield node.schema;
+			break;
 	}
 }
 /**
@@ -745,10 +749,9 @@ function transform(node, options) {
 * const values = collect(root, { depth: 'shallow', root: () => 'root' })
 * ```
 */
-function collect(node, options) {
+function* collectLazy(node, options) {
 	const { depth, parent, ...visitor } = options;
 	const recurse = (depth ?? visitorDepths.deep) === visitorDepths.deep;
-	const results = [];
 	let v;
 	switch (node.kind) {
 		case "Input":
@@ -776,12 +779,14 @@ function collect(node, options) {
 		case "ParameterGroup":
 		case "FunctionParameters": break;
 	}
-	if (v !== void 0) results.push(v);
-	for (const child of getChildren(node, recurse)) for (const item of collect(child, {
+	if (v !== void 0) yield v;
+	for (const child of getChildren(node, recurse)) yield* collectLazy(child, {
 		...options,
 		parent: node
-	})) results.push(item);
-	return results;
+	});
+}
+function collect(node, options) {
+	return Array.from(collectLazy(node, options));
 }
 //#endregion
 //#region src/utils.ts
@@ -1281,14 +1286,23 @@ function resolveRefName(node) {
 * }
 * ```
 */
-function collectReferencedSchemaNames(node, out = /* @__PURE__ */ new Set()) {
-	if (!node) return out;
+const schemaRefCache = /* @__PURE__ */ new WeakMap();
+function collectSchemaRefs(node) {
+	const cached = schemaRefCache.get(node);
+	if (cached) return cached;
+	const refs = /* @__PURE__ */ new Set();
 	collect(node, { schema(child) {
 		if (child.type === "ref") {
 			const name = resolveRefName(child);
-			if (name) out.add(name);
+			if (name) refs.add(name);
 		}
 	} });
+	schemaRefCache.set(node, refs);
+	return refs;
+}
+function collectReferencedSchemaNames(node, out = /* @__PURE__ */ new Set()) {
+	if (!node) return out;
+	for (const name of collectSchemaRefs(node)) out.add(name);
 	return out;
 }
 /**
@@ -1331,7 +1345,7 @@ function collectUsedSchemaNames(operations, schemas) {
 			if (namedSchema) visitSchema(namedSchema);
 		}
 	}
-	for (const op of operations) for (const schema of collect(op, {
+	for (const op of operations) for (const schema of collectLazy(op, {
 		depth: "shallow",
 		schema: (node) => node
 	})) visitSchema(schema);
@@ -1380,11 +1394,12 @@ function findCircularSchemas(schemas) {
 */
 function containsCircularRef(node, { circularSchemas, excludeName }) {
 	if (!node || circularSchemas.size === 0) return false;
-	return collect(node, { schema(child) {
+	for (const _ of collectLazy(node, { schema(child) {
 		if (child.type !== "ref") return void 0;
 		const name = resolveRefName(child);
 		return name && name !== excludeName && circularSchemas.has(name) ? true : void 0;
-	} }).length > 0;
+	} })) return true;
+	return false;
 }
 //#endregion
 //#region src/factory.ts
@@ -2158,23 +2173,27 @@ function setDiscriminatorEnum({ node, propertyName, values, enumName }) {
 * ])
 * ```
 */
-function mergeAdjacentObjects(members) {
-	return members.reduce((acc, member) => {
+function* mergeAdjacentObjectsLazy(members) {
+	let acc;
+	for (const member of members) {
 		const objectMember = narrowSchema(member, "object");
-		if (objectMember && !objectMember.name) {
-			const previous = acc.at(-1);
-			const previousObject = previous ? narrowSchema(previous, "object") : void 0;
-			if (previousObject && !previousObject.name) {
-				acc[acc.length - 1] = createSchema({
-					...previousObject,
-					properties: [...previousObject.properties ?? [], ...objectMember.properties ?? []]
+		if (objectMember && !objectMember.name && acc !== void 0) {
+			const accObject = narrowSchema(acc, "object");
+			if (accObject && !accObject.name) {
+				acc = createSchema({
+					...accObject,
+					properties: [...accObject.properties ?? [], ...objectMember.properties ?? []]
 				});
-				return acc;
+				continue;
 			}
 		}
-		acc.push(member);
-		return acc;
-	}, []);
+		if (acc !== void 0) yield acc;
+		acc = member;
+	}
+	if (acc !== void 0) yield acc;
+}
+function mergeAdjacentObjects(members) {
+	return [...mergeAdjacentObjectsLazy(members)];
 }
 /**
 * Removes enum members that are covered by broader scalar primitives in the same union.
@@ -2219,6 +2238,7 @@ exports.caseParams = caseParams;
 exports.childName = childName;
 exports.collect = collect;
 exports.collectImports = collectImports;
+exports.collectLazy = collectLazy;
 exports.collectReferencedSchemaNames = collectReferencedSchemaNames;
 exports.collectUsedSchemaNames = collectUsedSchemaNames;
 exports.containsCircularRef = containsCircularRef;
@@ -2262,6 +2282,7 @@ exports.isSchemaNode = isSchemaNode;
 exports.isStringType = isStringType;
 exports.mediaTypes = mediaTypes;
 exports.mergeAdjacentObjects = mergeAdjacentObjects;
+exports.mergeAdjacentObjectsLazy = mergeAdjacentObjectsLazy;
 exports.narrowSchema = narrowSchema;
 exports.nodeKinds = nodeKinds;
 exports.resolveRefName = resolveRefName;