@kubb/ast 5.0.0-beta.53 → 5.0.0-beta.54

package/dist/index.cjs

@@ -1969,10 +1969,20 @@ function createRefNode(node, canonical) {
 		example: node.example
 	});
 }
-function applyDedupe(node, canonicalBySignature, skipRootMatch = false) {
-	if (canonicalBySignature.size === 0) return node;
+function applyDedupe(node, plan, skipRootMatch = false) {
+	const { canonicalBySignature, aliasNames } = plan;
+	if (canonicalBySignature.size === 0 && aliasNames.size === 0) return node;
 	const root = node;
 	return transform(node, { schema(schemaNode) {
+		if (schemaNode.type === "ref") {
+			const target = schemaNode.ref ? require_utils.extractRefName(schemaNode.ref) : schemaNode.name;
+			const canonical = target ? aliasNames.get(target) : void 0;
+			return canonical ? {
+				...schemaNode,
+				name: canonical.name,
+				ref: canonical.ref
+			} : void 0;
+		}
 		const signature = signatureOf(schemaNode);
 		if (skipRootMatch && schemaNode === root) return void 0;
 		const canonical = canonicalBySignature.get(signature);
@@ -1996,9 +2006,11 @@ function cleanDefinition(node, name) {
 * Scans a forest of schema and operation nodes and produces a {@link DedupePlan}.
 *
 * A shape that occurs at least `minOccurrences` times is deduplicated: if any occurrence
-* is a named top-level schema, that name becomes the canonical (so other top-level duplicates
-* and inline copies turn into references to it). Otherwise a new definition is hoisted using
-* `nameFor`. The plan is then applied per node with {@link applyDedupe}.
+* is a named top-level schema, the first one becomes the canonical (so other top-level
+* duplicates and inline copies turn into references to it). Every other top-level name with
+* the same content is recorded in `aliasNames`, so refs to it can be repointed at the
+* canonical. Otherwise a new definition is hoisted using `nameFor`. The plan is then applied
+* per node with {@link applyDedupe}.
 *
 * @example
 * ```ts
@@ -2020,11 +2032,11 @@ function buildDedupePlan(roots, options) {
 		const group = groups.get(signature);
 		if (group) {
 			group.count++;
-			if (isTopLevel && !group.topLevelName) group.topLevelName = schemaNode.name;
+			if (isTopLevel) group.topLevelNames.push(schemaNode.name);
 		} else groups.set(signature, {
 			count: 1,
 			representative: schemaNode,
-			topLevelName: isTopLevel ? schemaNode.name : void 0
+			topLevelNames: isTopLevel ? [schemaNode.name] : []
 		});
 	}
 	for (const root of roots) {
@@ -2032,14 +2044,18 @@ function buildDedupePlan(roots, options) {
 		for (const schemaNode of collectLazy(root, { schema: (node) => node })) record(schemaNode);
 	}
 	const canonicalBySignature = /* @__PURE__ */ new Map();
+	const aliasNames = /* @__PURE__ */ new Map();
 	const pendingHoists = [];
 	for (const [signature, group] of groups) {
 		if (group.count < minOccurrences) continue;
-		if (group.topLevelName) {
-			canonicalBySignature.set(signature, {
-				name: group.topLevelName,
-				ref: refFor(group.topLevelName)
-			});
+		const [firstName, ...duplicateNames] = group.topLevelNames;
+		if (firstName) {
+			const canonical = {
+				name: firstName,
+				ref: refFor(firstName)
+			};
+			canonicalBySignature.set(signature, canonical);
+			for (const duplicate of duplicateNames) aliasNames.set(duplicate, canonical);
 			continue;
 		}
 		const name = nameFor(group.representative, signature);
@@ -2055,7 +2071,11 @@ function buildDedupePlan(roots, options) {
 	}
 	return {
 		canonicalBySignature,
-		hoisted: pendingHoists.map(({ name, representative }) => cleanDefinition(applyDedupe(representative, canonicalBySignature, true), name))
+		aliasNames,
+		hoisted: pendingHoists.map(({ name, representative }) => cleanDefinition(applyDedupe(representative, {
+			canonicalBySignature,
+			aliasNames
+		}, true), name))
 	};
 }
 //#endregion