@pajecawav/json2code 0.0.0-stage → 0.1.0

package/dist/targets/valibot/printer.mjs

@@ -0,0 +1,198 @@
+import { DiagnosticCode, createDiagnostic } from "../../diagnostics/errors.mjs";
+import { collectImports, defaultMatches, literal, quoteKey, regexLiteral, renderTsType } from "../shared.mjs";
+import { buildLazyGraph, nodeId } from "../zod/lazy.mjs";
+//#region src/targets/valibot/printer.ts
+/** Generates valibot v1 schemas from IR documents. */
+var ValibotPrinter = class {
+	name = "valibot";
+	async print(docs, ctx) {
+		const byId = new Map(docs.map((d) => [d.docId, d]));
+		const graph = buildLazyGraph(docs);
+		const files = [];
+		for (const doc of docs) files.push({
+			path: ctx.outputPath(doc.docId),
+			content: this.printDoc(doc, ctx, byId, graph)
+		});
+		return files;
+	}
+	printDoc(doc, ctx, byId, graph) {
+		const imports = collectImports(doc, ctx, byId);
+		const warnings = [];
+		const r = {
+			ctx,
+			byId,
+			graph,
+			warnings
+		};
+		const lines = [];
+		lines.push(`import * as v from ${JSON.stringify(ctx.options.importPaths.valibot ?? "valibot")};`);
+		const sorted = [...imports.entries()].toSorted(([a], [b]) => a.localeCompare(b));
+		for (const [, info] of sorted) lines.push(`import { ${[...info.names].toSorted().join(", ")} } from ${JSON.stringify(info.path)};`);
+		lines.push("");
+		for (const name of doc.exportOrder) {
+			const ir = doc.exports.get(name);
+			if (!ir) continue;
+			const exportName = ctx.resolveExportName(doc, name);
+			const cyclic = graph.isCyclic(nodeId(doc.docId, name));
+			if (cyclic) {
+				const aliasRef = (ref) => this.aliasRefExpr(ref, doc, r);
+				lines.push(`export type ${exportName} = ${renderTsType(ir, aliasRef, { readonlyArrays: false })};`);
+				lines.push("");
+			}
+			if (ir.meta?.deprecated) lines.push("/** @deprecated */");
+			const annotation = cyclic ? `: v.GenericSchema<unknown, ${exportName}>` : "";
+			lines.push(`export const ${exportName}${annotation} = ${this.exprOf(ir, doc, name, r)};`);
+			if (!cyclic) lines.push(`export type ${exportName} = v.InferOutput<typeof ${exportName}>;`);
+			lines.push("");
+		}
+		for (const warning of warnings) ctx.diagnostics.push(createDiagnostic(DiagnosticCode.UnknownKeyword, "warning", warning, { docId: doc.docId }));
+		return `${lines.join("\n").trimEnd()}\n`;
+	}
+	exprOf(ir, doc, name, r) {
+		let base;
+		switch (ir.kind) {
+			case "ref":
+				base = this.refExpr(ir.ref, doc, name, r);
+				break;
+			case "string":
+				base = this.stringExpr(ir);
+				break;
+			case "integer":
+			case "number":
+				base = this.numberExpr(ir);
+				break;
+			case "boolean":
+				base = ir.const !== void 0 ? `v.literal(${ir.const})` : "v.boolean()";
+				break;
+			case "null":
+				base = "v.null()";
+				break;
+			case "literal":
+				base = `v.literal(${literal(ir.value)})`;
+				break;
+			case "array":
+				base = this.arrayExpr(ir, doc, name, r);
+				break;
+			case "tuple":
+				base = this.tupleExpr(ir, doc, name, r);
+				break;
+			case "object":
+				base = this.objectExpr(ir, doc, name, r);
+				break;
+			case "record":
+				base = `v.record(v.string(), ${this.exprOf(ir.values, doc, name, r)})`;
+				break;
+			case "union":
+				if (ir.variants.length === 0) base = "v.never()";
+				else if (ir.variants.length === 1) {
+					const single = ir.variants[0];
+					base = single ? this.exprOf(single, doc, name, r) : "v.never()";
+				} else base = `v.union([${ir.variants.map((x) => this.exprOf(x, doc, name, r)).join(", ")}])`;
+				break;
+			case "intersection":
+				if (ir.variants.length === 0) base = "v.unknown()";
+				else if (ir.variants.length === 1) {
+					const single = ir.variants[0];
+					base = single ? this.exprOf(single, doc, name, r) : "v.unknown()";
+				} else base = `v.intersect([${ir.variants.map((x) => this.exprOf(x, doc, name, r)).join(", ")}])`;
+				break;
+			case "unknown": base = "v.unknown()";
+		}
+		if (ir.meta?.description) base = `v.pipe(${base}, v.description(${JSON.stringify(ir.meta.description)}))`;
+		return base;
+	}
+	refExpr(ref, doc, name, r) {
+		const target = r.byId.get(ref.docId);
+		const exportName = target ? r.ctx.resolveExportName(target, ref.exportName) : ref.exportName;
+		if (r.graph.needsLazy(nodeId(doc.docId, name), nodeId(ref.docId, ref.exportName))) return `v.lazy(() => ${exportName})`;
+		return exportName;
+	}
+	/** Ref renderer for structural aliases of cyclic exports. */
+	aliasRefExpr(ref, doc, r) {
+		if (ref.docId === doc.docId) {
+			if (!doc.exports.has(ref.exportName)) return "unknown";
+			const resolved = r.ctx.resolveExportName(doc, ref.exportName);
+			if (r.graph.isCyclic(nodeId(doc.docId, ref.exportName))) return resolved;
+			return `v.InferOutput<typeof ${resolved}>`;
+		}
+		const target = r.byId.get(ref.docId);
+		if (!target) return "unknown";
+		const exportName = r.ctx.resolveExportName(target, ref.exportName);
+		if (r.graph.isCyclic(nodeId(ref.docId, ref.exportName))) return exportName;
+		return `v.InferOutput<typeof ${exportName}>`;
+	}
+	stringExpr(ir) {
+		if (ir.const !== void 0) return `v.literal(${JSON.stringify(ir.const)})`;
+		if (ir.enum) {
+			if (ir.enum.length === 0) return "v.string()";
+			return `v.picklist([${ir.enum.map((x) => JSON.stringify(x)).join(", ")}])`;
+		}
+		const actions = [];
+		const format = stringFormatAction(ir.format);
+		if (format) actions.push(format);
+		if (ir.minLength !== void 0) actions.push(`v.minLength(${ir.minLength})`);
+		if (ir.maxLength !== void 0) actions.push(`v.maxLength(${ir.maxLength})`);
+		if (ir.pattern !== void 0) actions.push(`v.regex(${regexLiteral(ir.pattern)})`);
+		if (actions.length === 0) return "v.string()";
+		return `v.pipe(v.string(), ${actions.join(", ")})`;
+	}
+	numberExpr(ir) {
+		if (ir.const !== void 0) return `v.literal(${ir.const})`;
+		if (ir.enum) {
+			if (ir.enum.length === 0) return "v.number()";
+			return `v.union([${ir.enum.map((x) => `v.literal(${x})`).join(", ")}])`;
+		}
+		const actions = [];
+		if (ir.kind === "integer") actions.push("v.integer()");
+		if (ir.minimum !== void 0) actions.push(`v.minValue(${ir.minimum})`);
+		if (ir.maximum !== void 0) actions.push(`v.maxValue(${ir.maximum})`);
+		if (ir.exclusiveMinimum !== void 0) actions.push(`v.gtValue(${ir.exclusiveMinimum})`);
+		if (ir.exclusiveMaximum !== void 0) actions.push(`v.ltValue(${ir.exclusiveMaximum})`);
+		if (ir.multipleOf !== void 0) actions.push(`v.multipleOf(${ir.multipleOf})`);
+		if (actions.length === 0) return "v.number()";
+		return `v.pipe(v.number(), ${actions.join(", ")})`;
+	}
+	arrayExpr(ir, doc, name, r) {
+		const items = ir.items ? this.exprOf(ir.items, doc, name, r) : "v.unknown()";
+		const actions = [];
+		if (ir.minItems !== void 0) actions.push(`v.minLength(${ir.minItems})`);
+		if (ir.maxItems !== void 0) actions.push(`v.maxLength(${ir.maxItems})`);
+		if (ir.uniqueItems === true) r.warnings.push("uniqueItems is not supported by the valibot target and was ignored");
+		if (actions.length === 0) return `v.array(${items})`;
+		return `v.pipe(v.array(${items}), ${actions.join(", ")})`;
+	}
+	tupleExpr(ir, doc, name, r) {
+		return `v.tupleWithRest([${ir.items.map((i) => this.exprOf(i, doc, name, r)).join(", ")}], ${ir.additionalItems ? this.exprOf(ir.additionalItems, doc, name, r) : "v.never()"})`;
+	}
+	objectExpr(ir, doc, name, r) {
+		const required = new Set(ir.required);
+		const parts = [];
+		for (const [key, val] of ir.properties) {
+			let expr = this.exprOf(val, doc, name, r);
+			if (r.ctx.options.defaults && val.meta?.default !== void 0 && defaultMatches(val, val.meta.default)) expr = `v.optional(${expr}, ${JSON.stringify(val.meta?.default)})`;
+			else if (!required.has(key)) expr = `v.optional(${expr})`;
+			else if (r.ctx.options.defaults && val.meta?.default !== void 0 && !defaultMatches(val, val.meta.default)) r.warnings.push(`default ${JSON.stringify(val.meta.default)} does not match schema type and was ignored`);
+			parts.push(`${quoteKey(key)}: ${expr}`);
+		}
+		const entries = parts.length === 0 ? "{}" : `{ ${parts.join(", ")} }`;
+		if (ir.additionalProperties === false) return `v.strictObject(${entries})`;
+		if (ir.additionalProperties) return `v.objectWithRest(${entries}, ${this.exprOf(ir.additionalProperties, doc, name, r)})`;
+		return `v.object(${entries})`;
+	}
+};
+function stringFormatAction(format) {
+	switch (format) {
+		case "uuid": return "v.uuid()";
+		case "email": return "v.email()";
+		case "uri":
+		case "url": return "v.url()";
+		case "date": return "v.isoDate()";
+		case "date-time": return "v.isoDateTime()";
+		case "time": return "v.isoTime()";
+		default: return;
+	}
+}
+//#endregion
+export { ValibotPrinter };
+
+//# sourceMappingURL=printer.mjs.map

package/dist/targets/valibot/printer.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"printer.mjs","names":[],"sources":["../../../src/targets/valibot/printer.ts"],"sourcesContent":["import type { Ref, IRType, SourceDoc } from \"../../core/ir/types.js\";\nimport type { AbstractPrinter, PrintContext } from \"../../core/printer/abstract.js\";\nimport type { PrintedFile } from \"../../core/types.js\";\nimport { createDiagnostic, DiagnosticCode } from \"../../diagnostics/errors.js\";\nimport {\n\tcollectImports,\n\tdefaultMatches,\n\tliteral,\n\tquoteKey,\n\tregexLiteral,\n\trenderTsType,\n} from \"../shared.js\";\nimport { buildLazyGraph, nodeId, type LazyGraph } from \"../zod/lazy.js\";\n\ninterface RenderCtx {\n\treadonly ctx: PrintContext;\n\treadonly byId: Map<string, SourceDoc>;\n\treadonly graph: LazyGraph;\n\treadonly warnings: string[];\n}\n\n/** Generates valibot v1 schemas from IR documents. */\nexport class ValibotPrinter implements AbstractPrinter {\n\tpublic readonly name = \"valibot\";\n\n\tpublic async print(docs: readonly SourceDoc[], ctx: PrintContext): Promise<PrintedFile[]> {\n\t\tconst byId = new Map<string, SourceDoc>(docs.map(d => [d.docId, d] as const));\n\t\tconst graph = buildLazyGraph(docs);\n\t\tconst files: PrintedFile[] = [];\n\t\tfor (const doc of docs) {\n\t\t\tfiles.push({\n\t\t\t\tpath: ctx.outputPath(doc.docId),\n\t\t\t\tcontent: this.printDoc(doc, ctx, byId, graph),\n\t\t\t});\n\t\t}\n\t\treturn files;\n\t}\n\n\tprivate printDoc(\n\t\tdoc: SourceDoc,\n\t\tctx: PrintContext,\n\t\tbyId: Map<string, SourceDoc>,\n\t\tgraph: LazyGraph,\n\t): string {\n\t\tconst imports = collectImports(doc, ctx, byId);\n\t\tconst warnings: string[] = [];\n\t\tconst r: RenderCtx = { ctx, byId, graph, warnings };\n\n\t\tconst lines: string[] = [];\n\t\tlines.push(\n\t\t\t`import * as v from ${JSON.stringify(ctx.options.importPaths.valibot ?? \"valibot\")};`,\n\t\t);\n\t\tconst sorted = [...imports.entries()].toSorted(([a], [b]) => a.localeCompare(b));\n\t\tfor (const [, info] of sorted) {\n\t\t\tlines.push(\n\t\t\t\t`import { ${[...info.names].toSorted().join(\", \")} } from ${JSON.stringify(info.path)};`,\n\t\t\t);\n\t\t}\n\t\tlines.push(\"\");\n\n\t\tfor (const name of doc.exportOrder) {\n\t\t\tconst ir = doc.exports.get(name);\n\t\t\tif (!ir) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst exportName = ctx.resolveExportName(doc, name);\n\t\t\tconst cyclic = graph.isCyclic(nodeId(doc.docId, name));\n\t\t\tif (cyclic) {\n\t\t\t\t// structural alias doubles as the annotation type; it breaks the\n\t\t\t\t// const's self-inference cycle and is mutually recursive with others\n\t\t\t\tconst aliasRef = (ref: Ref): string => this.aliasRefExpr(ref, doc, r);\n\t\t\t\tlines.push(\n\t\t\t\t\t`export type ${exportName} = ${renderTsType(ir, aliasRef, { readonlyArrays: false })};`,\n\t\t\t\t);\n\t\t\t\tlines.push(\"\");\n\t\t\t}\n\t\t\tif (ir.meta?.deprecated) {\n\t\t\t\tlines.push(\"/** @deprecated */\");\n\t\t\t}\n\t\t\t// GenericSchema<Input, Output>: input stays `unknown` — optional fields\n\t\t\t// with defaults accept undefined at the input but not the output\n\t\t\tconst annotation = cyclic ? `: v.GenericSchema<unknown, ${exportName}>` : \"\";\n\t\t\tlines.push(\n\t\t\t\t`export const ${exportName}${annotation} = ${this.exprOf(ir, doc, name, r)};`,\n\t\t\t);\n\t\t\tif (!cyclic) {\n\t\t\t\tlines.push(`export type ${exportName} = v.InferOutput<typeof ${exportName}>;`);\n\t\t\t}\n\t\t\tlines.push(\"\");\n\t\t}\n\n\t\tfor (const warning of warnings) {\n\t\t\tctx.diagnostics.push(\n\t\t\t\tcreateDiagnostic(DiagnosticCode.UnknownKeyword, \"warning\", warning, {\n\t\t\t\t\tdocId: doc.docId,\n\t\t\t\t}),\n\t\t\t);\n\t\t}\n\t\treturn `${lines.join(\"\\n\").trimEnd()}\\n`;\n\t}\n\n\tprivate exprOf(ir: IRType, doc: SourceDoc, name: string, r: RenderCtx): string {\n\t\tlet base: string;\n\t\tswitch (ir.kind) {\n\t\t\tcase \"ref\":\n\t\t\t\tbase = this.refExpr(ir.ref, doc, name, r);\n\t\t\t\tbreak;\n\t\t\tcase \"string\":\n\t\t\t\tbase = this.stringExpr(ir);\n\t\t\t\tbreak;\n\t\t\tcase \"integer\":\n\t\t\tcase \"number\":\n\t\t\t\tbase = this.numberExpr(ir);\n\t\t\t\tbreak;\n\t\t\tcase \"boolean\":\n\t\t\t\tbase = ir.const !== undefined ? `v.literal(${ir.const})` : \"v.boolean()\";\n\t\t\t\tbreak;\n\t\t\tcase \"null\":\n\t\t\t\tbase = \"v.null()\";\n\t\t\t\tbreak;\n\t\t\tcase \"literal\":\n\t\t\t\tbase = `v.literal(${literal(ir.value)})`;\n\t\t\t\tbreak;\n\t\t\tcase \"array\":\n\t\t\t\tbase = this.arrayExpr(ir, doc, name, r);\n\t\t\t\tbreak;\n\t\t\tcase \"tuple\":\n\t\t\t\tbase = this.tupleExpr(ir, doc, name, r);\n\t\t\t\tbreak;\n\t\t\tcase \"object\":\n\t\t\t\tbase = this.objectExpr(ir, doc, name, r);\n\t\t\t\tbreak;\n\t\t\tcase \"record\":\n\t\t\t\tbase = `v.record(v.string(), ${this.exprOf(ir.values, doc, name, r)})`;\n\t\t\t\tbreak;\n\t\t\tcase \"union\": {\n\t\t\t\tif (ir.variants.length === 0) {\n\t\t\t\t\tbase = \"v.never()\";\n\t\t\t\t} else if (ir.variants.length === 1) {\n\t\t\t\t\tconst single = ir.variants[0];\n\t\t\t\t\tbase = single ? this.exprOf(single, doc, name, r) : \"v.never()\";\n\t\t\t\t} else {\n\t\t\t\t\tbase = `v.union([${ir.variants.map(x => this.exprOf(x, doc, name, r)).join(\", \")}])`;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase \"intersection\": {\n\t\t\t\tif (ir.variants.length === 0) {\n\t\t\t\t\tbase = \"v.unknown()\";\n\t\t\t\t} else if (ir.variants.length === 1) {\n\t\t\t\t\tconst single = ir.variants[0];\n\t\t\t\t\tbase = single ? this.exprOf(single, doc, name, r) : \"v.unknown()\";\n\t\t\t\t} else {\n\t\t\t\t\tbase = `v.intersect([${ir.variants.map(x => this.exprOf(x, doc, name, r)).join(\", \")}])`;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase \"unknown\":\n\t\t\t\tbase = \"v.unknown()\";\n\t\t\t\tbreak;\n\t\t}\n\t\tif (ir.meta?.description) {\n\t\t\tbase = `v.pipe(${base}, v.description(${JSON.stringify(ir.meta.description)}))`;\n\t\t}\n\t\treturn base;\n\t}\n\n\tprivate refExpr(ref: Ref, doc: SourceDoc, name: string, r: RenderCtx): string {\n\t\tconst target = r.byId.get(ref.docId);\n\t\tconst exportName = target\n\t\t\t? r.ctx.resolveExportName(target, ref.exportName)\n\t\t\t: ref.exportName;\n\t\tif (r.graph.needsLazy(nodeId(doc.docId, name), nodeId(ref.docId, ref.exportName))) {\n\t\t\treturn `v.lazy(() => ${exportName})`;\n\t\t}\n\t\treturn exportName;\n\t}\n\n\t/** Ref renderer for structural aliases of cyclic exports. */\n\tprivate aliasRefExpr(ref: Ref, doc: SourceDoc, r: RenderCtx): string {\n\t\tif (ref.docId === doc.docId) {\n\t\t\tif (!doc.exports.has(ref.exportName)) {\n\t\t\t\treturn \"unknown\";\n\t\t\t}\n\t\t\tconst resolved = r.ctx.resolveExportName(doc, ref.exportName);\n\t\t\tif (r.graph.isCyclic(nodeId(doc.docId, ref.exportName))) {\n\t\t\t\treturn resolved;\n\t\t\t}\n\t\t\treturn `v.InferOutput<typeof ${resolved}>`;\n\t\t}\n\t\tconst target = r.byId.get(ref.docId);\n\t\tif (!target) {\n\t\t\treturn \"unknown\";\n\t\t}\n\t\tconst exportName = r.ctx.resolveExportName(target, ref.exportName);\n\t\tif (r.graph.isCyclic(nodeId(ref.docId, ref.exportName))) {\n\t\t\treturn exportName;\n\t\t}\n\t\treturn `v.InferOutput<typeof ${exportName}>`;\n\t}\n\n\tprivate stringExpr(ir: Extract<IRType, { kind: \"string\" }>): string {\n\t\tif (ir.const !== undefined) {\n\t\t\treturn `v.literal(${JSON.stringify(ir.const)})`;\n\t\t}\n\t\tif (ir.enum) {\n\t\t\tif (ir.enum.length === 0) {\n\t\t\t\treturn \"v.string()\";\n\t\t\t}\n\t\t\treturn `v.picklist([${ir.enum.map(x => JSON.stringify(x)).join(\", \")}])`;\n\t\t}\n\t\tconst actions: string[] = [];\n\t\tconst format = stringFormatAction(ir.format);\n\t\tif (format) {\n\t\t\tactions.push(format);\n\t\t}\n\t\tif (ir.minLength !== undefined) {\n\t\t\tactions.push(`v.minLength(${ir.minLength})`);\n\t\t}\n\t\tif (ir.maxLength !== undefined) {\n\t\t\tactions.push(`v.maxLength(${ir.maxLength})`);\n\t\t}\n\t\tif (ir.pattern !== undefined) {\n\t\t\tactions.push(`v.regex(${regexLiteral(ir.pattern)})`);\n\t\t}\n\t\tif (actions.length === 0) {\n\t\t\treturn \"v.string()\";\n\t\t}\n\t\treturn `v.pipe(v.string(), ${actions.join(\", \")})`;\n\t}\n\n\tprivate numberExpr(ir: Extract<IRType, { kind: \"number\" | \"integer\" }>): string {\n\t\tif (ir.const !== undefined) {\n\t\t\treturn `v.literal(${ir.const})`;\n\t\t}\n\t\tif (ir.enum) {\n\t\t\tif (ir.enum.length === 0) {\n\t\t\t\treturn \"v.number()\";\n\t\t\t}\n\t\t\treturn `v.union([${ir.enum.map(x => `v.literal(${x})`).join(\", \")}])`;\n\t\t}\n\t\tconst actions: string[] = [];\n\t\tif (ir.kind === \"integer\") {\n\t\t\tactions.push(\"v.integer()\");\n\t\t}\n\t\tif (ir.minimum !== undefined) {\n\t\t\tactions.push(`v.minValue(${ir.minimum})`);\n\t\t}\n\t\tif (ir.maximum !== undefined) {\n\t\t\tactions.push(`v.maxValue(${ir.maximum})`);\n\t\t}\n\t\tif (ir.exclusiveMinimum !== undefined) {\n\t\t\tactions.push(`v.gtValue(${ir.exclusiveMinimum})`);\n\t\t}\n\t\tif (ir.exclusiveMaximum !== undefined) {\n\t\t\tactions.push(`v.ltValue(${ir.exclusiveMaximum})`);\n\t\t}\n\t\tif (ir.multipleOf !== undefined) {\n\t\t\tactions.push(`v.multipleOf(${ir.multipleOf})`);\n\t\t}\n\t\tif (actions.length === 0) {\n\t\t\treturn \"v.number()\";\n\t\t}\n\t\treturn `v.pipe(v.number(), ${actions.join(\", \")})`;\n\t}\n\n\tprivate arrayExpr(\n\t\tir: Extract<IRType, { kind: \"array\" }>,\n\t\tdoc: SourceDoc,\n\t\tname: string,\n\t\tr: RenderCtx,\n\t): string {\n\t\tconst items = ir.items ? this.exprOf(ir.items, doc, name, r) : \"v.unknown()\";\n\t\tconst actions: string[] = [];\n\t\tif (ir.minItems !== undefined) {\n\t\t\tactions.push(`v.minLength(${ir.minItems})`);\n\t\t}\n\t\tif (ir.maxItems !== undefined) {\n\t\t\tactions.push(`v.maxLength(${ir.maxItems})`);\n\t\t}\n\t\tif (ir.uniqueItems === true) {\n\t\t\tr.warnings.push(\"uniqueItems is not supported by the valibot target and was ignored\");\n\t\t}\n\t\tif (actions.length === 0) {\n\t\t\treturn `v.array(${items})`;\n\t\t}\n\t\treturn `v.pipe(v.array(${items}), ${actions.join(\", \")})`;\n\t}\n\n\tprivate tupleExpr(\n\t\tir: Extract<IRType, { kind: \"tuple\" }>,\n\t\tdoc: SourceDoc,\n\t\tname: string,\n\t\tr: RenderCtx,\n\t): string {\n\t\tconst items = ir.items.map(i => this.exprOf(i, doc, name, r)).join(\", \");\n\t\t// valibot tuples truncate extra items; a `never` rest enforces the exact\n\t\t// length (parity with the zod target), a schema rest validates the tail\n\t\tconst rest = ir.additionalItems\n\t\t\t? this.exprOf(ir.additionalItems, doc, name, r)\n\t\t\t: \"v.never()\";\n\t\treturn `v.tupleWithRest([${items}], ${rest})`;\n\t}\n\n\tprivate objectExpr(\n\t\tir: Extract<IRType, { kind: \"object\" }>,\n\t\tdoc: SourceDoc,\n\t\tname: string,\n\t\tr: RenderCtx,\n\t): string {\n\t\tconst required = new Set(ir.required);\n\t\tconst parts: string[] = [];\n\t\tfor (const [key, val] of ir.properties) {\n\t\t\tlet expr = this.exprOf(val, doc, name, r);\n\t\t\tconst hasDefault =\n\t\t\t\tr.ctx.options.defaults &&\n\t\t\t\tval.meta?.default !== undefined &&\n\t\t\t\tdefaultMatches(val, val.meta.default);\n\t\t\tif (hasDefault) {\n\t\t\t\texpr = `v.optional(${expr}, ${JSON.stringify(val.meta?.default)})`;\n\t\t\t} else if (!required.has(key)) {\n\t\t\t\texpr = `v.optional(${expr})`;\n\t\t\t} else if (\n\t\t\t\tr.ctx.options.defaults &&\n\t\t\t\tval.meta?.default !== undefined &&\n\t\t\t\t!defaultMatches(val, val.meta.default)\n\t\t\t) {\n\t\t\t\tr.warnings.push(\n\t\t\t\t\t`default ${JSON.stringify(val.meta.default)} does not match schema type and was ignored`,\n\t\t\t\t);\n\t\t\t}\n\t\t\tparts.push(`${quoteKey(key)}: ${expr}`);\n\t\t}\n\t\tconst entries = parts.length === 0 ? \"{}\" : `{ ${parts.join(\", \")} }`;\n\t\tif (ir.additionalProperties === false) {\n\t\t\treturn `v.strictObject(${entries})`;\n\t\t}\n\t\tif (ir.additionalProperties) {\n\t\t\treturn `v.objectWithRest(${entries}, ${this.exprOf(ir.additionalProperties, doc, name, r)})`;\n\t\t}\n\t\treturn `v.object(${entries})`;\n\t}\n}\n\nfunction stringFormatAction(format: string | undefined): string | undefined {\n\tswitch (format) {\n\t\tcase \"uuid\":\n\t\t\treturn \"v.uuid()\";\n\t\tcase \"email\":\n\t\t\treturn \"v.email()\";\n\t\tcase \"uri\":\n\t\tcase \"url\":\n\t\t\treturn \"v.url()\";\n\t\tcase \"date\":\n\t\t\treturn \"v.isoDate()\";\n\t\tcase \"date-time\":\n\t\t\treturn \"v.isoDateTime()\";\n\t\tcase \"time\":\n\t\t\treturn \"v.isoTime()\";\n\t\tdefault:\n\t\t\treturn undefined;\n\t}\n}\n"],"mappings":";;;;;AAsBA,IAAa,iBAAb,MAAuD;CACtD,OAAuB;CAEvB,MAAa,MAAM,MAA4B,KAA2C;EACzF,MAAM,OAAO,IAAI,IAAuB,KAAK,KAAI,MAAK,CAAC,EAAE,OAAO,CAAC,CAAU,CAAC;EAC5E,MAAM,QAAQ,eAAe,IAAI;EACjC,MAAM,QAAuB,CAAC;EAC9B,KAAK,MAAM,OAAO,MACjB,MAAM,KAAK;GACV,MAAM,IAAI,WAAW,IAAI,KAAK;GAC9B,SAAS,KAAK,SAAS,KAAK,KAAK,MAAM,KAAK;EAC7C,CAAC;EAEF,OAAO;CACR;CAEA,SACC,KACA,KACA,MACA,OACS;EACT,MAAM,UAAU,eAAe,KAAK,KAAK,IAAI;EAC7C,MAAM,WAAqB,CAAC;EAC5B,MAAM,IAAe;GAAE;GAAK;GAAM;GAAO;EAAS;EAElD,MAAM,QAAkB,CAAC;EACzB,MAAM,KACL,sBAAsB,KAAK,UAAU,IAAI,QAAQ,YAAY,WAAW,SAAS,EAAE,EACpF;EACA,MAAM,SAAS,CAAC,GAAG,QAAQ,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;EAC/E,KAAK,MAAM,GAAG,SAAS,QACtB,MAAM,KACL,YAAY,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,IAAI,EAAE,UAAU,KAAK,UAAU,KAAK,IAAI,EAAE,EACvF;EAED,MAAM,KAAK,EAAE;EAEb,KAAK,MAAM,QAAQ,IAAI,aAAa;GACnC,MAAM,KAAK,IAAI,QAAQ,IAAI,IAAI;GAC/B,IAAI,CAAC,IACJ;GAED,MAAM,aAAa,IAAI,kBAAkB,KAAK,IAAI;GAClD,MAAM,SAAS,MAAM,SAAS,OAAO,IAAI,OAAO,IAAI,CAAC;GACrD,IAAI,QAAQ;IAGX,MAAM,YAAY,QAAqB,KAAK,aAAa,KAAK,KAAK,CAAC;IACpE,MAAM,KACL,eAAe,WAAW,KAAK,aAAa,IAAI,UAAU,EAAE,gBAAgB,MAAM,CAAC,EAAE,EACtF;IACA,MAAM,KAAK,EAAE;GACd;GACA,IAAI,GAAG,MAAM,YACZ,MAAM,KAAK,oBAAoB;GAIhC,MAAM,aAAa,SAAS,8BAA8B,WAAW,KAAK;GAC1E,MAAM,KACL,gBAAgB,aAAa,WAAW,KAAK,KAAK,OAAO,IAAI,KAAK,MAAM,CAAC,EAAE,EAC5E;GACA,IAAI,CAAC,QACJ,MAAM,KAAK,eAAe,WAAW,0BAA0B,WAAW,GAAG;GAE9E,MAAM,KAAK,EAAE;EACd;EAEA,KAAK,MAAM,WAAW,UACrB,IAAI,YAAY,KACf,iBAAiB,eAAe,gBAAgB,WAAW,SAAS,EACnE,OAAO,IAAI,MACZ,CAAC,CACF;EAED,OAAO,GAAG,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ,EAAE;CACtC;CAEA,OAAe,IAAY,KAAgB,MAAc,GAAsB;EAC9E,IAAI;EACJ,QAAQ,GAAG,MAAX;GACC,KAAK;IACJ,OAAO,KAAK,QAAQ,GAAG,KAAK,KAAK,MAAM,CAAC;IACxC;GACD,KAAK;IACJ,OAAO,KAAK,WAAW,EAAE;IACzB;GACD,KAAK;GACL,KAAK;IACJ,OAAO,KAAK,WAAW,EAAE;IACzB;GACD,KAAK;IACJ,OAAO,GAAG,UAAU,KAAA,IAAY,aAAa,GAAG,MAAM,KAAK;IAC3D;GACD,KAAK;IACJ,OAAO;IACP;GACD,KAAK;IACJ,OAAO,aAAa,QAAQ,GAAG,KAAK,EAAE;IACtC;GACD,KAAK;IACJ,OAAO,KAAK,UAAU,IAAI,KAAK,MAAM,CAAC;IACtC;GACD,KAAK;IACJ,OAAO,KAAK,UAAU,IAAI,KAAK,MAAM,CAAC;IACtC;GACD,KAAK;IACJ,OAAO,KAAK,WAAW,IAAI,KAAK,MAAM,CAAC;IACvC;GACD,KAAK;IACJ,OAAO,wBAAwB,KAAK,OAAO,GAAG,QAAQ,KAAK,MAAM,CAAC,EAAE;IACpE;GACD,KAAK;IACJ,IAAI,GAAG,SAAS,WAAW,GAC1B,OAAO;SACD,IAAI,GAAG,SAAS,WAAW,GAAG;KACpC,MAAM,SAAS,GAAG,SAAS;KAC3B,OAAO,SAAS,KAAK,OAAO,QAAQ,KAAK,MAAM,CAAC,IAAI;IACrD,OACC,OAAO,YAAY,GAAG,SAAS,KAAI,MAAK,KAAK,OAAO,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;IAElF;GAED,KAAK;IACJ,IAAI,GAAG,SAAS,WAAW,GAC1B,OAAO;SACD,IAAI,GAAG,SAAS,WAAW,GAAG;KACpC,MAAM,SAAS,GAAG,SAAS;KAC3B,OAAO,SAAS,KAAK,OAAO,QAAQ,KAAK,MAAM,CAAC,IAAI;IACrD,OACC,OAAO,gBAAgB,GAAG,SAAS,KAAI,MAAK,KAAK,OAAO,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;IAEtF;GAED,KAAK,WACJ,OAAO;EAET;EACA,IAAI,GAAG,MAAM,aACZ,OAAO,UAAU,KAAK,kBAAkB,KAAK,UAAU,GAAG,KAAK,WAAW,EAAE;EAE7E,OAAO;CACR;CAEA,QAAgB,KAAU,KAAgB,MAAc,GAAsB;EAC7E,MAAM,SAAS,EAAE,KAAK,IAAI,IAAI,KAAK;EACnC,MAAM,aAAa,SAChB,EAAE,IAAI,kBAAkB,QAAQ,IAAI,UAAU,IAC9C,IAAI;EACP,IAAI,EAAE,MAAM,UAAU,OAAO,IAAI,OAAO,IAAI,GAAG,OAAO,IAAI,OAAO,IAAI,UAAU,CAAC,GAC/E,OAAO,gBAAgB,WAAW;EAEnC,OAAO;CACR;;CAGA,aAAqB,KAAU,KAAgB,GAAsB;EACpE,IAAI,IAAI,UAAU,IAAI,OAAO;GAC5B,IAAI,CAAC,IAAI,QAAQ,IAAI,IAAI,UAAU,GAClC,OAAO;GAER,MAAM,WAAW,EAAE,IAAI,kBAAkB,KAAK,IAAI,UAAU;GAC5D,IAAI,EAAE,MAAM,SAAS,OAAO,IAAI,OAAO,IAAI,UAAU,CAAC,GACrD,OAAO;GAER,OAAO,wBAAwB,SAAS;EACzC;EACA,MAAM,SAAS,EAAE,KAAK,IAAI,IAAI,KAAK;EACnC,IAAI,CAAC,QACJ,OAAO;EAER,MAAM,aAAa,EAAE,IAAI,kBAAkB,QAAQ,IAAI,UAAU;EACjE,IAAI,EAAE,MAAM,SAAS,OAAO,IAAI,OAAO,IAAI,UAAU,CAAC,GACrD,OAAO;EAER,OAAO,wBAAwB,WAAW;CAC3C;CAEA,WAAmB,IAAiD;EACnE,IAAI,GAAG,UAAU,KAAA,GAChB,OAAO,aAAa,KAAK,UAAU,GAAG,KAAK,EAAE;EAE9C,IAAI,GAAG,MAAM;GACZ,IAAI,GAAG,KAAK,WAAW,GACtB,OAAO;GAER,OAAO,eAAe,GAAG,KAAK,KAAI,MAAK,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;EACtE;EACA,MAAM,UAAoB,CAAC;EAC3B,MAAM,SAAS,mBAAmB,GAAG,MAAM;EAC3C,IAAI,QACH,QAAQ,KAAK,MAAM;EAEpB,IAAI,GAAG,cAAc,KAAA,GACpB,QAAQ,KAAK,eAAe,GAAG,UAAU,EAAE;EAE5C,IAAI,GAAG,cAAc,KAAA,GACpB,QAAQ,KAAK,eAAe,GAAG,UAAU,EAAE;EAE5C,IAAI,GAAG,YAAY,KAAA,GAClB,QAAQ,KAAK,WAAW,aAAa,GAAG,OAAO,EAAE,EAAE;EAEpD,IAAI,QAAQ,WAAW,GACtB,OAAO;EAER,OAAO,sBAAsB,QAAQ,KAAK,IAAI,EAAE;CACjD;CAEA,WAAmB,IAA6D;EAC/E,IAAI,GAAG,UAAU,KAAA,GAChB,OAAO,aAAa,GAAG,MAAM;EAE9B,IAAI,GAAG,MAAM;GACZ,IAAI,GAAG,KAAK,WAAW,GACtB,OAAO;GAER,OAAO,YAAY,GAAG,KAAK,KAAI,MAAK,aAAa,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,EAAE;EACnE;EACA,MAAM,UAAoB,CAAC;EAC3B,IAAI,GAAG,SAAS,WACf,QAAQ,KAAK,aAAa;EAE3B,IAAI,GAAG,YAAY,KAAA,GAClB,QAAQ,KAAK,cAAc,GAAG,QAAQ,EAAE;EAEzC,IAAI,GAAG,YAAY,KAAA,GAClB,QAAQ,KAAK,cAAc,GAAG,QAAQ,EAAE;EAEzC,IAAI,GAAG,qBAAqB,KAAA,GAC3B,QAAQ,KAAK,aAAa,GAAG,iBAAiB,EAAE;EAEjD,IAAI,GAAG,qBAAqB,KAAA,GAC3B,QAAQ,KAAK,aAAa,GAAG,iBAAiB,EAAE;EAEjD,IAAI,GAAG,eAAe,KAAA,GACrB,QAAQ,KAAK,gBAAgB,GAAG,WAAW,EAAE;EAE9C,IAAI,QAAQ,WAAW,GACtB,OAAO;EAER,OAAO,sBAAsB,QAAQ,KAAK,IAAI,EAAE;CACjD;CAEA,UACC,IACA,KACA,MACA,GACS;EACT,MAAM,QAAQ,GAAG,QAAQ,KAAK,OAAO,GAAG,OAAO,KAAK,MAAM,CAAC,IAAI;EAC/D,MAAM,UAAoB,CAAC;EAC3B,IAAI,GAAG,aAAa,KAAA,GACnB,QAAQ,KAAK,eAAe,GAAG,SAAS,EAAE;EAE3C,IAAI,GAAG,aAAa,KAAA,GACnB,QAAQ,KAAK,eAAe,GAAG,SAAS,EAAE;EAE3C,IAAI,GAAG,gBAAgB,MACtB,EAAE,SAAS,KAAK,oEAAoE;EAErF,IAAI,QAAQ,WAAW,GACtB,OAAO,WAAW,MAAM;EAEzB,OAAO,kBAAkB,MAAM,KAAK,QAAQ,KAAK,IAAI,EAAE;CACxD;CAEA,UACC,IACA,KACA,MACA,GACS;EAOT,OAAO,oBANO,GAAG,MAAM,KAAI,MAAK,KAAK,OAAO,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,IAMpC,EAAE,KAHpB,GAAG,kBACb,KAAK,OAAO,GAAG,iBAAiB,KAAK,MAAM,CAAC,IAC5C,YACwC;CAC5C;CAEA,WACC,IACA,KACA,MACA,GACS;EACT,MAAM,WAAW,IAAI,IAAI,GAAG,QAAQ;EACpC,MAAM,QAAkB,CAAC;EACzB,KAAK,MAAM,CAAC,KAAK,QAAQ,GAAG,YAAY;GACvC,IAAI,OAAO,KAAK,OAAO,KAAK,KAAK,MAAM,CAAC;GAKxC,IAHC,EAAE,IAAI,QAAQ,YACd,IAAI,MAAM,YAAY,KAAA,KACtB,eAAe,KAAK,IAAI,KAAK,OAAO,GAEpC,OAAO,cAAc,KAAK,IAAI,KAAK,UAAU,IAAI,MAAM,OAAO,EAAE;QAC1D,IAAI,CAAC,SAAS,IAAI,GAAG,GAC3B,OAAO,cAAc,KAAK;QACpB,IACN,EAAE,IAAI,QAAQ,YACd,IAAI,MAAM,YAAY,KAAA,KACtB,CAAC,eAAe,KAAK,IAAI,KAAK,OAAO,GAErC,EAAE,SAAS,KACV,WAAW,KAAK,UAAU,IAAI,KAAK,OAAO,EAAE,4CAC7C;GAED,MAAM,KAAK,GAAG,SAAS,GAAG,EAAE,IAAI,MAAM;EACvC;EACA,MAAM,UAAU,MAAM,WAAW,IAAI,OAAO,KAAK,MAAM,KAAK,IAAI,EAAE;EAClE,IAAI,GAAG,yBAAyB,OAC/B,OAAO,kBAAkB,QAAQ;EAElC,IAAI,GAAG,sBACN,OAAO,oBAAoB,QAAQ,IAAI,KAAK,OAAO,GAAG,sBAAsB,KAAK,MAAM,CAAC,EAAE;EAE3F,OAAO,YAAY,QAAQ;CAC5B;AACD;AAEA,SAAS,mBAAmB,QAAgD;CAC3E,QAAQ,QAAR;EACC,KAAK,QACJ,OAAO;EACR,KAAK,SACJ,OAAO;EACR,KAAK;EACL,KAAK,OACJ,OAAO;EACR,KAAK,QACJ,OAAO;EACR,KAAK,aACJ,OAAO;EACR,KAAK,QACJ,OAAO;EACR,SACC;CACF;AACD"}

package/dist/targets/zod/lazy.d.mts

@@ -0,0 +1,29 @@
+import { SourceDoc } from "../../core/ir/types.mjs";
+//#region src/targets/zod/lazy.d.ts
+/** Global node id: `${docId}#${exportName}`. */
+export type NodeId = string;
+export declare function nodeId(docId: string, exportName: string): NodeId;
+export interface LazyGraph {
+  /** Whether the ref edge `from → to` must be rendered as `z.lazy(() => …)` / `v.lazy(() => …)`. */
+  readonly needsLazy: (from: NodeId, to: NodeId) => boolean;
+  /** Whether the node participates in a reference cycle (self-loop or larger). */
+  readonly isCyclic: (node: NodeId) => boolean;
+}
+/**
+ * Builds a lazy-rendering graph over the global export set.
+ *
+ * A ref must be wrapped in `z.lazy(() => X)` / `v.lazy(() => X)` when:
+ * - it is a self-reference, or
+ * - it points to an export declared later in the same file (TDZ at module evaluation), or
+ * - it participates in a cycle in the global import graph (circular ESM would read
+ *   an uninitialized binding at evaluation time). The cycle may run through OTHER
+ *   exports of the involved documents, so document-level reachability is checked
+ *   in addition to node-level: a ref into a document that (transitively) imports
+ *   the current one must be lazy even when the two exports themselves are acyclic.
+ *
+ * A node "participates in a cycle" when it can reach itself; such exports need a
+ * structural type alias + generic annotation to break TS inference circularity.
+ */
+export declare function buildLazyGraph(docs: readonly SourceDoc[]): LazyGraph;
+//#endregion
+//# sourceMappingURL=lazy.d.mts.map

package/dist/targets/zod/lazy.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lazy.d.mts","names":[],"sources":["../../../src/targets/zod/lazy.ts"],"mappings":";;;YAIY;wBAEI,OAAO,eAAe,qBAAqB;iBAI1C;;WAEP,YAAY,MAAM,QAAQ,IAAI;;WAE9B,WAAW,MAAM;;;;;;;;;;;;;;;;;wBAkBX,eAAe,eAAe,cAAc"}

package/dist/targets/zod/lazy.mjs

@@ -0,0 +1,100 @@
+import { visitRefs } from "../../core/ir/visit.mjs";
+//#region src/targets/zod/lazy.ts
+function nodeId(docId, exportName) {
+	return `${docId}#${exportName}`;
+}
+/**
+* Builds a lazy-rendering graph over the global export set.
+*
+* A ref must be wrapped in `z.lazy(() => X)` / `v.lazy(() => X)` when:
+* - it is a self-reference, or
+* - it points to an export declared later in the same file (TDZ at module evaluation), or
+* - it participates in a cycle in the global import graph (circular ESM would read
+*   an uninitialized binding at evaluation time). The cycle may run through OTHER
+*   exports of the involved documents, so document-level reachability is checked
+*   in addition to node-level: a ref into a document that (transitively) imports
+*   the current one must be lazy even when the two exports themselves are acyclic.
+*
+* A node "participates in a cycle" when it can reach itself; such exports need a
+* structural type alias + generic annotation to break TS inference circularity.
+*/
+function buildLazyGraph(docs) {
+	const nodeIds = /* @__PURE__ */ new Set();
+	const edges = /* @__PURE__ */ new Map();
+	const indexInDoc = /* @__PURE__ */ new Map();
+	const docOf = /* @__PURE__ */ new Map();
+	const docEdges = /* @__PURE__ */ new Map();
+	for (const doc of docs) doc.exportOrder.forEach((name, index) => {
+		const id = nodeId(doc.docId, name);
+		nodeIds.add(id);
+		indexInDoc.set(id, index);
+		docOf.set(id, doc.docId);
+	});
+	for (const doc of docs) for (const name of doc.exportOrder) {
+		const ir = doc.exports.get(name);
+		if (!ir) continue;
+		const from = nodeId(doc.docId, name);
+		const targets = [];
+		visitRefs(ir, (ref) => {
+			const to = nodeId(ref.docId, ref.exportName);
+			if (nodeIds.has(to) && !targets.includes(to)) {
+				targets.push(to);
+				const fromDocs = docEdges.get(doc.docId);
+				if (fromDocs) fromDocs.add(ref.docId);
+				else docEdges.set(doc.docId, /* @__PURE__ */ new Set([ref.docId]));
+			}
+		});
+		edges.set(from, targets);
+	}
+	const reachCache = /* @__PURE__ */ new Map();
+	const reachableFrom = (start) => {
+		const cached = reachCache.get(start);
+		if (cached) return cached;
+		const visited = /* @__PURE__ */ new Set();
+		reachCache.set(start, visited);
+		const stack = [...edges.get(start) ?? []];
+		while (stack.length > 0) {
+			const current = stack.pop();
+			if (current === void 0 || visited.has(current)) continue;
+			visited.add(current);
+			for (const next of edges.get(current) ?? []) stack.push(next);
+		}
+		return visited;
+	};
+	const docReachCache = /* @__PURE__ */ new Map();
+	const docsReachableFrom = (start) => {
+		const cached = docReachCache.get(start);
+		if (cached) return cached;
+		const visited = /* @__PURE__ */ new Set();
+		docReachCache.set(start, visited);
+		const stack = [...docEdges.get(start) ?? []];
+		while (stack.length > 0) {
+			const current = stack.pop();
+			if (current === void 0 || visited.has(current)) continue;
+			visited.add(current);
+			for (const next of docEdges.get(current) ?? []) stack.push(next);
+		}
+		return visited;
+	};
+	const isCyclic = (node) => reachableFrom(node).has(node);
+	const needsLazy = (from, to) => {
+		if (from === to) return true;
+		const fromDoc = docOf.get(from);
+		const toDoc = docOf.get(to);
+		if (fromDoc !== void 0 && fromDoc === toDoc) {
+			const fromIndex = indexInDoc.get(from);
+			const toIndex = indexInDoc.get(to);
+			if (fromIndex !== void 0 && toIndex !== void 0 && toIndex > fromIndex) return true;
+		}
+		if (fromDoc !== void 0 && toDoc !== void 0 && fromDoc !== toDoc) return docsReachableFrom(toDoc).has(fromDoc);
+		return reachableFrom(to).has(from);
+	};
+	return {
+		needsLazy,
+		isCyclic
+	};
+}
+//#endregion
+export { buildLazyGraph, nodeId };
+
+//# sourceMappingURL=lazy.mjs.map

package/dist/targets/zod/lazy.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"lazy.mjs","names":[],"sources":["../../../src/targets/zod/lazy.ts"],"sourcesContent":["import type { SourceDoc } from \"../../core/ir/types.js\";\nimport { visitRefs } from \"../../core/ir/visit.js\";\n\n/** Global node id: `${docId}#${exportName}`. */\nexport type NodeId = string;\n\nexport function nodeId(docId: string, exportName: string): NodeId {\n\treturn `${docId}#${exportName}`;\n}\n\nexport interface LazyGraph {\n\t/** Whether the ref edge `from → to` must be rendered as `z.lazy(() => …)` / `v.lazy(() => …)`. */\n\treadonly needsLazy: (from: NodeId, to: NodeId) => boolean;\n\t/** Whether the node participates in a reference cycle (self-loop or larger). */\n\treadonly isCyclic: (node: NodeId) => boolean;\n}\n\n/**\n * Builds a lazy-rendering graph over the global export set.\n *\n * A ref must be wrapped in `z.lazy(() => X)` / `v.lazy(() => X)` when:\n * - it is a self-reference, or\n * - it points to an export declared later in the same file (TDZ at module evaluation), or\n * - it participates in a cycle in the global import graph (circular ESM would read\n *   an uninitialized binding at evaluation time). The cycle may run through OTHER\n *   exports of the involved documents, so document-level reachability is checked\n *   in addition to node-level: a ref into a document that (transitively) imports\n *   the current one must be lazy even when the two exports themselves are acyclic.\n *\n * A node \"participates in a cycle\" when it can reach itself; such exports need a\n * structural type alias + generic annotation to break TS inference circularity.\n */\nexport function buildLazyGraph(docs: readonly SourceDoc[]): LazyGraph {\n\tconst nodeIds = new Set<NodeId>();\n\tconst edges = new Map<NodeId, NodeId[]>();\n\tconst indexInDoc = new Map<NodeId, number>();\n\tconst docOf = new Map<NodeId, string>();\n\tconst docEdges = new Map<string, Set<string>>();\n\n\tfor (const doc of docs) {\n\t\tdoc.exportOrder.forEach((name, index) => {\n\t\t\tconst id = nodeId(doc.docId, name);\n\t\t\tnodeIds.add(id);\n\t\t\tindexInDoc.set(id, index);\n\t\t\tdocOf.set(id, doc.docId);\n\t\t});\n\t}\n\tfor (const doc of docs) {\n\t\tfor (const name of doc.exportOrder) {\n\t\t\tconst ir = doc.exports.get(name);\n\t\t\tif (!ir) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst from = nodeId(doc.docId, name);\n\t\t\tconst targets: NodeId[] = [];\n\t\t\tvisitRefs(ir, ref => {\n\t\t\t\tconst to = nodeId(ref.docId, ref.exportName);\n\t\t\t\tif (nodeIds.has(to) && !targets.includes(to)) {\n\t\t\t\t\ttargets.push(to);\n\t\t\t\t\tconst fromDocs = docEdges.get(doc.docId);\n\t\t\t\t\tif (fromDocs) {\n\t\t\t\t\t\tfromDocs.add(ref.docId);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tdocEdges.set(doc.docId, new Set([ref.docId]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\t\tedges.set(from, targets);\n\t\t}\n\t}\n\n\tconst reachCache = new Map<NodeId, Set<NodeId>>();\n\tconst reachableFrom = (start: NodeId): Set<NodeId> => {\n\t\tconst cached = reachCache.get(start);\n\t\tif (cached) {\n\t\t\treturn cached;\n\t\t}\n\t\tconst visited = new Set<NodeId>();\n\t\treachCache.set(start, visited);\n\t\tconst stack: NodeId[] = [...(edges.get(start) ?? [])];\n\t\twhile (stack.length > 0) {\n\t\t\tconst current = stack.pop();\n\t\t\tif (current === undefined || visited.has(current)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tvisited.add(current);\n\t\t\tfor (const next of edges.get(current) ?? []) {\n\t\t\t\tstack.push(next);\n\t\t\t}\n\t\t}\n\t\treturn visited;\n\t};\n\n\tconst docReachCache = new Map<string, Set<string>>();\n\tconst docsReachableFrom = (start: string): Set<string> => {\n\t\tconst cached = docReachCache.get(start);\n\t\tif (cached) {\n\t\t\treturn cached;\n\t\t}\n\t\tconst visited = new Set<string>();\n\t\tdocReachCache.set(start, visited);\n\t\tconst stack: string[] = [...(docEdges.get(start) ?? [])];\n\t\twhile (stack.length > 0) {\n\t\t\tconst current = stack.pop();\n\t\t\tif (current === undefined || visited.has(current)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tvisited.add(current);\n\t\t\tfor (const next of docEdges.get(current) ?? []) {\n\t\t\t\tstack.push(next);\n\t\t\t}\n\t\t}\n\t\treturn visited;\n\t};\n\n\tconst isCyclic = (node: NodeId): boolean => reachableFrom(node).has(node);\n\n\tconst needsLazy = (from: NodeId, to: NodeId): boolean => {\n\t\tif (from === to) {\n\t\t\treturn true;\n\t\t}\n\t\tconst fromDoc = docOf.get(from);\n\t\tconst toDoc = docOf.get(to);\n\t\tif (fromDoc !== undefined && fromDoc === toDoc) {\n\t\t\tconst fromIndex = indexInDoc.get(from);\n\t\t\tconst toIndex = indexInDoc.get(to);\n\t\t\tif (fromIndex !== undefined && toIndex !== undefined && toIndex > fromIndex) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tif (fromDoc !== undefined && toDoc !== undefined && fromDoc !== toDoc) {\n\t\t\t// the target document (transitively) imports ours: circular ESM\n\t\t\treturn docsReachableFrom(toDoc).has(fromDoc);\n\t\t}\n\t\treturn reachableFrom(to).has(from);\n\t};\n\n\treturn { needsLazy, isCyclic };\n}\n"],"mappings":";;AAMA,SAAgB,OAAO,OAAe,YAA4B;CACjE,OAAO,GAAG,MAAM,GAAG;AACpB;;;;;;;;;;;;;;;;AAwBA,SAAgB,eAAe,MAAuC;CACrE,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,wBAAQ,IAAI,IAAsB;CACxC,MAAM,6BAAa,IAAI,IAAoB;CAC3C,MAAM,wBAAQ,IAAI,IAAoB;CACtC,MAAM,2BAAW,IAAI,IAAyB;CAE9C,KAAK,MAAM,OAAO,MACjB,IAAI,YAAY,SAAS,MAAM,UAAU;EACxC,MAAM,KAAK,OAAO,IAAI,OAAO,IAAI;EACjC,QAAQ,IAAI,EAAE;EACd,WAAW,IAAI,IAAI,KAAK;EACxB,MAAM,IAAI,IAAI,IAAI,KAAK;CACxB,CAAC;CAEF,KAAK,MAAM,OAAO,MACjB,KAAK,MAAM,QAAQ,IAAI,aAAa;EACnC,MAAM,KAAK,IAAI,QAAQ,IAAI,IAAI;EAC/B,IAAI,CAAC,IACJ;EAED,MAAM,OAAO,OAAO,IAAI,OAAO,IAAI;EACnC,MAAM,UAAoB,CAAC;EAC3B,UAAU,KAAI,QAAO;GACpB,MAAM,KAAK,OAAO,IAAI,OAAO,IAAI,UAAU;GAC3C,IAAI,QAAQ,IAAI,EAAE,KAAK,CAAC,QAAQ,SAAS,EAAE,GAAG;IAC7C,QAAQ,KAAK,EAAE;IACf,MAAM,WAAW,SAAS,IAAI,IAAI,KAAK;IACvC,IAAI,UACH,SAAS,IAAI,IAAI,KAAK;SAEtB,SAAS,IAAI,IAAI,uBAAO,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;GAE9C;EACD,CAAC;EACD,MAAM,IAAI,MAAM,OAAO;CACxB;CAGD,MAAM,6BAAa,IAAI,IAAyB;CAChD,MAAM,iBAAiB,UAA+B;EACrD,MAAM,SAAS,WAAW,IAAI,KAAK;EACnC,IAAI,QACH,OAAO;EAER,MAAM,0BAAU,IAAI,IAAY;EAChC,WAAW,IAAI,OAAO,OAAO;EAC7B,MAAM,QAAkB,CAAC,GAAI,MAAM,IAAI,KAAK,KAAK,CAAC,CAAE;EACpD,OAAO,MAAM,SAAS,GAAG;GACxB,MAAM,UAAU,MAAM,IAAI;GAC1B,IAAI,YAAY,KAAA,KAAa,QAAQ,IAAI,OAAO,GAC/C;GAED,QAAQ,IAAI,OAAO;GACnB,KAAK,MAAM,QAAQ,MAAM,IAAI,OAAO,KAAK,CAAC,GACzC,MAAM,KAAK,IAAI;EAEjB;EACA,OAAO;CACR;CAEA,MAAM,gCAAgB,IAAI,IAAyB;CACnD,MAAM,qBAAqB,UAA+B;EACzD,MAAM,SAAS,cAAc,IAAI,KAAK;EACtC,IAAI,QACH,OAAO;EAER,MAAM,0BAAU,IAAI,IAAY;EAChC,cAAc,IAAI,OAAO,OAAO;EAChC,MAAM,QAAkB,CAAC,GAAI,SAAS,IAAI,KAAK,KAAK,CAAC,CAAE;EACvD,OAAO,MAAM,SAAS,GAAG;GACxB,MAAM,UAAU,MAAM,IAAI;GAC1B,IAAI,YAAY,KAAA,KAAa,QAAQ,IAAI,OAAO,GAC/C;GAED,QAAQ,IAAI,OAAO;GACnB,KAAK,MAAM,QAAQ,SAAS,IAAI,OAAO,KAAK,CAAC,GAC5C,MAAM,KAAK,IAAI;EAEjB;EACA,OAAO;CACR;CAEA,MAAM,YAAY,SAA0B,cAAc,IAAI,CAAC,CAAC,IAAI,IAAI;CAExE,MAAM,aAAa,MAAc,OAAwB;EACxD,IAAI,SAAS,IACZ,OAAO;EAER,MAAM,UAAU,MAAM,IAAI,IAAI;EAC9B,MAAM,QAAQ,MAAM,IAAI,EAAE;EAC1B,IAAI,YAAY,KAAA,KAAa,YAAY,OAAO;GAC/C,MAAM,YAAY,WAAW,IAAI,IAAI;GACrC,MAAM,UAAU,WAAW,IAAI,EAAE;GACjC,IAAI,cAAc,KAAA,KAAa,YAAY,KAAA,KAAa,UAAU,WACjE,OAAO;EAET;EACA,IAAI,YAAY,KAAA,KAAa,UAAU,KAAA,KAAa,YAAY,OAE/D,OAAO,kBAAkB,KAAK,CAAC,CAAC,IAAI,OAAO;EAE5C,OAAO,cAAc,EAAE,CAAC,CAAC,IAAI,IAAI;CAClC;CAEA,OAAO;EAAE;EAAW;CAAS;AAC9B"}

package/dist/targets/zod/printer.d.mts

@@ -0,0 +1,21 @@
+import { SourceDoc } from "../../core/ir/types.mjs";
+import { AbstractPrinter, PrintContext } from "../../core/printer/abstract.mjs";
+import { PrintedFile } from "../../core/types.mjs";
+//#region src/targets/zod/printer.d.ts
+/** Generates zod v4 schemas from IR documents. */
+export declare class ZodPrinter implements AbstractPrinter {
+  readonly name = "zod";
+  print(docs: readonly SourceDoc[], ctx: PrintContext): Promise<PrintedFile[]>;
+  private printDoc;
+  private exprOf;
+  private refExpr;
+  /** Ref renderer for structural aliases of cyclic exports. */
+  private aliasRefExpr;
+  private stringExpr;
+  private numberExpr;
+  private arrayExpr;
+  private tupleExpr;
+  private objectExpr;
+}
+//#endregion
+//# sourceMappingURL=printer.d.mts.map

package/dist/targets/zod/printer.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"printer.d.mts","names":[],"sources":["../../../src/targets/zod/printer.ts"],"mappings":";;;;;qBAsBa,sBAAsB;WAClB;EAEhB,MAAmB,eAAe,aAAa,KAAK,eAAe,QAAQ;UAanE;UA0DA;UAiEA;;UAYA;UAsBA;UAuBA;UA6BA;UAoBA;UAcA"}

package/dist/targets/zod/printer.mjs

@@ -0,0 +1,193 @@
+import { DiagnosticCode, createDiagnostic } from "../../diagnostics/errors.mjs";
+import { collectImports, defaultMatches, literal, quoteKey, regexLiteral, renderTsType } from "../shared.mjs";
+import { buildLazyGraph, nodeId } from "./lazy.mjs";
+//#region src/targets/zod/printer.ts
+/** Generates zod v4 schemas from IR documents. */
+var ZodPrinter = class {
+	name = "zod";
+	async print(docs, ctx) {
+		const byId = new Map(docs.map((d) => [d.docId, d]));
+		const graph = buildLazyGraph(docs);
+		const files = [];
+		for (const doc of docs) files.push({
+			path: ctx.outputPath(doc.docId),
+			content: this.printDoc(doc, ctx, byId, graph)
+		});
+		return files;
+	}
+	printDoc(doc, ctx, byId, graph) {
+		const imports = collectImports(doc, ctx, byId);
+		const warnings = [];
+		const r = {
+			ctx,
+			byId,
+			graph,
+			warnings
+		};
+		const lines = [];
+		lines.push(`import { z } from ${JSON.stringify(ctx.options.importPaths.zod ?? "zod")};`);
+		const sorted = [...imports.entries()].toSorted(([a], [b]) => a.localeCompare(b));
+		for (const [, info] of sorted) {
+			const names = [...info.names].toSorted();
+			lines.push(`import { ${names.join(", ")} } from ${JSON.stringify(info.path)};`);
+		}
+		lines.push("");
+		for (const name of doc.exportOrder) {
+			const ir = doc.exports.get(name);
+			if (!ir) continue;
+			const exportName = ctx.resolveExportName(doc, name);
+			const cyclic = graph.isCyclic(nodeId(doc.docId, name));
+			if (cyclic) {
+				const aliasRef = (ref) => this.aliasRefExpr(ref, doc, r);
+				lines.push(`export type ${exportName} = ${renderTsType(ir, aliasRef, { readonlyArrays: false })};`);
+				lines.push("");
+			}
+			if (ir.meta?.deprecated) lines.push("/** @deprecated */");
+			const annotation = cyclic ? `: z.ZodType<${exportName}>` : "";
+			lines.push(`export const ${exportName}${annotation} = ${this.exprOf(ir, doc, name, r)};`);
+			if (!cyclic) lines.push(`export type ${exportName} = z.infer<typeof ${exportName}>;`);
+			lines.push("");
+		}
+		for (const warning of warnings) ctx.diagnostics.push(createDiagnostic(DiagnosticCode.UnknownKeyword, "warning", warning, { docId: doc.docId }));
+		return `${lines.join("\n").trimEnd()}\n`;
+	}
+	exprOf(ir, doc, name, r) {
+		let base;
+		switch (ir.kind) {
+			case "ref":
+				base = this.refExpr(ir.ref, doc, name, r);
+				break;
+			case "string":
+				base = this.stringExpr(ir);
+				break;
+			case "integer":
+			case "number":
+				base = this.numberExpr(ir);
+				break;
+			case "boolean":
+				base = ir.const !== void 0 ? `z.literal(${ir.const})` : "z.boolean()";
+				break;
+			case "null":
+				base = "z.null()";
+				break;
+			case "literal":
+				base = `z.literal(${literal(ir.value)})`;
+				break;
+			case "array":
+				base = this.arrayExpr(ir, doc, name, r);
+				break;
+			case "tuple":
+				base = this.tupleExpr(ir, doc, name, r);
+				break;
+			case "object":
+				base = this.objectExpr(ir, doc, name, r);
+				break;
+			case "record":
+				base = `z.record(z.string(), ${this.exprOf(ir.values, doc, name, r)})`;
+				break;
+			case "union":
+				if (ir.variants.length === 0) base = "z.never()";
+				else if (ir.variants.length === 1) {
+					const single = ir.variants[0];
+					base = single ? this.exprOf(single, doc, name, r) : "z.never()";
+				} else base = `z.union([${ir.variants.map((v) => this.exprOf(v, doc, name, r)).join(", ")}])`;
+				break;
+			case "intersection":
+				if (ir.variants.length === 0) base = "z.unknown()";
+				else base = ir.variants.map((v) => this.exprOf(v, doc, name, r)).reduce((acc, v) => `z.intersection(${acc}, ${v})`);
+				break;
+			case "unknown": base = "z.unknown()";
+		}
+		if (ir.meta?.description) base = `${base}.describe(${JSON.stringify(ir.meta.description)})`;
+		return base;
+	}
+	refExpr(ref, doc, name, r) {
+		const target = r.byId.get(ref.docId);
+		const exportName = target ? r.ctx.resolveExportName(target, ref.exportName) : ref.exportName;
+		if (r.graph.needsLazy(nodeId(doc.docId, name), nodeId(ref.docId, ref.exportName))) return `z.lazy(() => ${exportName})`;
+		return exportName;
+	}
+	/** Ref renderer for structural aliases of cyclic exports. */
+	aliasRefExpr(ref, doc, r) {
+		if (ref.docId === doc.docId) {
+			if (!doc.exports.has(ref.exportName)) return "unknown";
+			const resolved = r.ctx.resolveExportName(doc, ref.exportName);
+			if (r.graph.isCyclic(nodeId(doc.docId, ref.exportName))) return resolved;
+			return `z.infer<typeof ${resolved}>`;
+		}
+		const target = r.byId.get(ref.docId);
+		if (!target) return "unknown";
+		const exportName = r.ctx.resolveExportName(target, ref.exportName);
+		if (r.graph.isCyclic(nodeId(ref.docId, ref.exportName))) return exportName;
+		return `z.infer<typeof ${exportName}>`;
+	}
+	stringExpr(ir) {
+		if (ir.const !== void 0) return `z.literal(${JSON.stringify(ir.const)})`;
+		if (ir.enum) {
+			if (ir.enum.length === 0) return "z.string()";
+			return `z.enum([${ir.enum.map((v) => JSON.stringify(v)).join(", ")}])`;
+		}
+		let expr = stringFormatBase(ir.format);
+		if (ir.minLength !== void 0) expr += `.min(${ir.minLength})`;
+		if (ir.maxLength !== void 0) expr += `.max(${ir.maxLength})`;
+		if (ir.pattern !== void 0) expr += `.regex(${regexLiteral(ir.pattern)})`;
+		return expr;
+	}
+	numberExpr(ir) {
+		if (ir.const !== void 0) return `z.literal(${ir.const})`;
+		if (ir.enum) {
+			if (ir.enum.length === 0) return ir.kind === "integer" ? "z.int()" : "z.number()";
+			return `z.union([${ir.enum.map((v) => `z.literal(${v})`).join(", ")}])`;
+		}
+		let expr = ir.kind === "integer" ? "z.int()" : "z.number()";
+		if (ir.minimum !== void 0) expr += `.min(${ir.minimum})`;
+		if (ir.maximum !== void 0) expr += `.max(${ir.maximum})`;
+		if (ir.exclusiveMinimum !== void 0) expr += `.gt(${ir.exclusiveMinimum})`;
+		if (ir.exclusiveMaximum !== void 0) expr += `.lt(${ir.exclusiveMaximum})`;
+		if (ir.multipleOf !== void 0) expr += `.multipleOf(${ir.multipleOf})`;
+		return expr;
+	}
+	arrayExpr(ir, doc, name, r) {
+		let expr = `z.array(${ir.items ? this.exprOf(ir.items, doc, name, r) : "z.unknown()"})`;
+		if (ir.minItems !== void 0) expr += `.min(${ir.minItems})`;
+		if (ir.maxItems !== void 0) expr += `.max(${ir.maxItems})`;
+		if (ir.uniqueItems === true) r.warnings.push("uniqueItems is not supported by the zod target and was ignored");
+		return expr;
+	}
+	tupleExpr(ir, doc, name, r) {
+		let expr = `z.tuple([${ir.items.map((i) => this.exprOf(i, doc, name, r)).join(", ")}])`;
+		if (ir.additionalItems) expr += `.rest(${this.exprOf(ir.additionalItems, doc, name, r)})`;
+		return expr;
+	}
+	objectExpr(ir, doc, name, r) {
+		const required = new Set(ir.required);
+		const parts = [];
+		for (const [key, val] of ir.properties) {
+			let expr = this.exprOf(val, doc, name, r);
+			if (r.ctx.options.defaults && val.meta?.default !== void 0 && defaultMatches(val, val.meta.default)) expr = `${expr}.default(${JSON.stringify(val.meta?.default)})`;
+			else if (!required.has(key)) expr = `${expr}.optional()`;
+			else if (r.ctx.options.defaults && val.meta?.default !== void 0 && !defaultMatches(val, val.meta.default)) r.warnings.push(`default ${JSON.stringify(val.meta.default)} does not match schema type and was ignored`);
+			parts.push(`${quoteKey(key)}: ${expr}`);
+		}
+		let expr = parts.length === 0 ? "z.object({})" : `z.object({ ${parts.join(", ")} })`;
+		if (ir.additionalProperties === false) expr = `${expr}.strict()`;
+		else if (ir.additionalProperties) expr = `${expr}.catchall(${this.exprOf(ir.additionalProperties, doc, name, r)})`;
+		return expr;
+	}
+};
+function stringFormatBase(format) {
+	switch (format) {
+		case "uuid": return "z.uuid()";
+		case "email": return "z.email()";
+		case "uri":
+		case "url": return "z.url()";
+		case "date": return "z.iso.date()";
+		case "date-time": return "z.iso.datetime()";
+		case "time": return "z.iso.time()";
+		default: return "z.string()";
+	}
+}
+//#endregion
+export { ZodPrinter };
+
+//# sourceMappingURL=printer.mjs.map

package/dist/targets/zod/printer.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"printer.mjs","names":[],"sources":["../../../src/targets/zod/printer.ts"],"sourcesContent":["import type { IRType, Ref, SourceDoc } from \"../../core/ir/types.js\";\nimport type { AbstractPrinter, PrintContext } from \"../../core/printer/abstract.js\";\nimport type { PrintedFile } from \"../../core/types.js\";\nimport { createDiagnostic, DiagnosticCode } from \"../../diagnostics/errors.js\";\nimport {\n\tcollectImports,\n\tdefaultMatches,\n\tliteral,\n\tquoteKey,\n\tregexLiteral,\n\trenderTsType,\n} from \"../shared.js\";\nimport { buildLazyGraph, nodeId, type LazyGraph } from \"./lazy.js\";\n\ninterface RenderCtx {\n\treadonly ctx: PrintContext;\n\treadonly byId: Map<string, SourceDoc>;\n\treadonly graph: LazyGraph;\n\treadonly warnings: string[];\n}\n\n/** Generates zod v4 schemas from IR documents. */\nexport class ZodPrinter implements AbstractPrinter {\n\tpublic readonly name = \"zod\";\n\n\tpublic async print(docs: readonly SourceDoc[], ctx: PrintContext): Promise<PrintedFile[]> {\n\t\tconst byId = new Map<string, SourceDoc>(docs.map(d => [d.docId, d] as const));\n\t\tconst graph = buildLazyGraph(docs);\n\t\tconst files: PrintedFile[] = [];\n\t\tfor (const doc of docs) {\n\t\t\tfiles.push({\n\t\t\t\tpath: ctx.outputPath(doc.docId),\n\t\t\t\tcontent: this.printDoc(doc, ctx, byId, graph),\n\t\t\t});\n\t\t}\n\t\treturn files;\n\t}\n\n\tprivate printDoc(\n\t\tdoc: SourceDoc,\n\t\tctx: PrintContext,\n\t\tbyId: Map<string, SourceDoc>,\n\t\tgraph: LazyGraph,\n\t): string {\n\t\tconst imports = collectImports(doc, ctx, byId);\n\t\tconst warnings: string[] = [];\n\t\tconst r: RenderCtx = { ctx, byId, graph, warnings };\n\n\t\tconst lines: string[] = [];\n\t\tlines.push(`import { z } from ${JSON.stringify(ctx.options.importPaths.zod ?? \"zod\")};`);\n\t\tconst sorted = [...imports.entries()].toSorted(([a], [b]) => a.localeCompare(b));\n\t\tfor (const [, info] of sorted) {\n\t\t\tconst names = [...info.names].toSorted();\n\t\t\tlines.push(`import { ${names.join(\", \")} } from ${JSON.stringify(info.path)};`);\n\t\t}\n\t\tlines.push(\"\");\n\n\t\tfor (const name of doc.exportOrder) {\n\t\t\tconst ir = doc.exports.get(name);\n\t\t\tif (!ir) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst exportName = ctx.resolveExportName(doc, name);\n\t\t\tconst cyclic = graph.isCyclic(nodeId(doc.docId, name));\n\t\t\tif (cyclic) {\n\t\t\t\t// structural alias doubles as the annotation type; it breaks the\n\t\t\t\t// const's self-inference cycle and is mutually recursive with others\n\t\t\t\tconst aliasRef = (ref: Ref): string => this.aliasRefExpr(ref, doc, r);\n\t\t\t\tlines.push(\n\t\t\t\t\t`export type ${exportName} = ${renderTsType(ir, aliasRef, { readonlyArrays: false })};`,\n\t\t\t\t);\n\t\t\t\tlines.push(\"\");\n\t\t\t}\n\t\t\tif (ir.meta?.deprecated) {\n\t\t\t\tlines.push(\"/** @deprecated */\");\n\t\t\t}\n\t\t\tconst annotation = cyclic ? `: z.ZodType<${exportName}>` : \"\";\n\t\t\tlines.push(\n\t\t\t\t`export const ${exportName}${annotation} = ${this.exprOf(ir, doc, name, r)};`,\n\t\t\t);\n\t\t\tif (!cyclic) {\n\t\t\t\tlines.push(`export type ${exportName} = z.infer<typeof ${exportName}>;`);\n\t\t\t}\n\t\t\tlines.push(\"\");\n\t\t}\n\n\t\tfor (const warning of warnings) {\n\t\t\tctx.diagnostics.push(\n\t\t\t\tcreateDiagnostic(DiagnosticCode.UnknownKeyword, \"warning\", warning, {\n\t\t\t\t\tdocId: doc.docId,\n\t\t\t\t}),\n\t\t\t);\n\t\t}\n\t\treturn `${lines.join(\"\\n\").trimEnd()}\\n`;\n\t}\n\n\tprivate exprOf(ir: IRType, doc: SourceDoc, name: string, r: RenderCtx): string {\n\t\tlet base: string;\n\t\tswitch (ir.kind) {\n\t\t\tcase \"ref\":\n\t\t\t\tbase = this.refExpr(ir.ref, doc, name, r);\n\t\t\t\tbreak;\n\t\t\tcase \"string\":\n\t\t\t\tbase = this.stringExpr(ir);\n\t\t\t\tbreak;\n\t\t\tcase \"integer\":\n\t\t\tcase \"number\":\n\t\t\t\tbase = this.numberExpr(ir);\n\t\t\t\tbreak;\n\t\t\tcase \"boolean\":\n\t\t\t\tbase = ir.const !== undefined ? `z.literal(${ir.const})` : \"z.boolean()\";\n\t\t\t\tbreak;\n\t\t\tcase \"null\":\n\t\t\t\tbase = \"z.null()\";\n\t\t\t\tbreak;\n\t\t\tcase \"literal\":\n\t\t\t\tbase = `z.literal(${literal(ir.value)})`;\n\t\t\t\tbreak;\n\t\t\tcase \"array\":\n\t\t\t\tbase = this.arrayExpr(ir, doc, name, r);\n\t\t\t\tbreak;\n\t\t\tcase \"tuple\":\n\t\t\t\tbase = this.tupleExpr(ir, doc, name, r);\n\t\t\t\tbreak;\n\t\t\tcase \"object\":\n\t\t\t\tbase = this.objectExpr(ir, doc, name, r);\n\t\t\t\tbreak;\n\t\t\tcase \"record\":\n\t\t\t\tbase = `z.record(z.string(), ${this.exprOf(ir.values, doc, name, r)})`;\n\t\t\t\tbreak;\n\t\t\tcase \"union\": {\n\t\t\t\tif (ir.variants.length === 0) {\n\t\t\t\t\tbase = \"z.never()\";\n\t\t\t\t} else if (ir.variants.length === 1) {\n\t\t\t\t\tconst single = ir.variants[0];\n\t\t\t\t\tbase = single ? this.exprOf(single, doc, name, r) : \"z.never()\";\n\t\t\t\t} else {\n\t\t\t\t\tbase = `z.union([${ir.variants.map(v => this.exprOf(v, doc, name, r)).join(\", \")}])`;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase \"intersection\": {\n\t\t\t\tif (ir.variants.length === 0) {\n\t\t\t\t\tbase = \"z.unknown()\";\n\t\t\t\t} else {\n\t\t\t\t\tbase = ir.variants\n\t\t\t\t\t\t.map(v => this.exprOf(v, doc, name, r))\n\t\t\t\t\t\t.reduce((acc, v) => `z.intersection(${acc}, ${v})`);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase \"unknown\":\n\t\t\t\tbase = \"z.unknown()\";\n\t\t\t\tbreak;\n\t\t}\n\t\tif (ir.meta?.description) {\n\t\t\tbase = `${base}.describe(${JSON.stringify(ir.meta.description)})`;\n\t\t}\n\t\treturn base;\n\t}\n\n\tprivate refExpr(ref: Ref, doc: SourceDoc, name: string, r: RenderCtx): string {\n\t\tconst target = r.byId.get(ref.docId);\n\t\tconst exportName = target\n\t\t\t? r.ctx.resolveExportName(target, ref.exportName)\n\t\t\t: ref.exportName;\n\t\tif (r.graph.needsLazy(nodeId(doc.docId, name), nodeId(ref.docId, ref.exportName))) {\n\t\t\treturn `z.lazy(() => ${exportName})`;\n\t\t}\n\t\treturn exportName;\n\t}\n\n\t/** Ref renderer for structural aliases of cyclic exports. */\n\tprivate aliasRefExpr(ref: Ref, doc: SourceDoc, r: RenderCtx): string {\n\t\tif (ref.docId === doc.docId) {\n\t\t\tif (!doc.exports.has(ref.exportName)) {\n\t\t\t\treturn \"unknown\";\n\t\t\t}\n\t\t\tconst resolved = r.ctx.resolveExportName(doc, ref.exportName);\n\t\t\tif (r.graph.isCyclic(nodeId(doc.docId, ref.exportName))) {\n\t\t\t\treturn resolved;\n\t\t\t}\n\t\t\treturn `z.infer<typeof ${resolved}>`;\n\t\t}\n\t\tconst target = r.byId.get(ref.docId);\n\t\tif (!target) {\n\t\t\treturn \"unknown\";\n\t\t}\n\t\tconst exportName = r.ctx.resolveExportName(target, ref.exportName);\n\t\tif (r.graph.isCyclic(nodeId(ref.docId, ref.exportName))) {\n\t\t\treturn exportName;\n\t\t}\n\t\treturn `z.infer<typeof ${exportName}>`;\n\t}\n\n\tprivate stringExpr(ir: Extract<IRType, { kind: \"string\" }>): string {\n\t\tif (ir.const !== undefined) {\n\t\t\treturn `z.literal(${JSON.stringify(ir.const)})`;\n\t\t}\n\t\tif (ir.enum) {\n\t\t\tif (ir.enum.length === 0) {\n\t\t\t\treturn \"z.string()\";\n\t\t\t}\n\t\t\treturn `z.enum([${ir.enum.map(v => JSON.stringify(v)).join(\", \")}])`;\n\t\t}\n\t\tlet expr = stringFormatBase(ir.format);\n\t\tif (ir.minLength !== undefined) {\n\t\t\texpr += `.min(${ir.minLength})`;\n\t\t}\n\t\tif (ir.maxLength !== undefined) {\n\t\t\texpr += `.max(${ir.maxLength})`;\n\t\t}\n\t\tif (ir.pattern !== undefined) {\n\t\t\texpr += `.regex(${regexLiteral(ir.pattern)})`;\n\t\t}\n\t\treturn expr;\n\t}\n\n\tprivate numberExpr(ir: Extract<IRType, { kind: \"number\" | \"integer\" }>): string {\n\t\tif (ir.const !== undefined) {\n\t\t\treturn `z.literal(${ir.const})`;\n\t\t}\n\t\tif (ir.enum) {\n\t\t\tif (ir.enum.length === 0) {\n\t\t\t\treturn ir.kind === \"integer\" ? \"z.int()\" : \"z.number()\";\n\t\t\t}\n\t\t\treturn `z.union([${ir.enum.map(v => `z.literal(${v})`).join(\", \")}])`;\n\t\t}\n\t\tlet expr = ir.kind === \"integer\" ? \"z.int()\" : \"z.number()\";\n\t\tif (ir.minimum !== undefined) {\n\t\t\texpr += `.min(${ir.minimum})`;\n\t\t}\n\t\tif (ir.maximum !== undefined) {\n\t\t\texpr += `.max(${ir.maximum})`;\n\t\t}\n\t\tif (ir.exclusiveMinimum !== undefined) {\n\t\t\texpr += `.gt(${ir.exclusiveMinimum})`;\n\t\t}\n\t\tif (ir.exclusiveMaximum !== undefined) {\n\t\t\texpr += `.lt(${ir.exclusiveMaximum})`;\n\t\t}\n\t\tif (ir.multipleOf !== undefined) {\n\t\t\texpr += `.multipleOf(${ir.multipleOf})`;\n\t\t}\n\t\treturn expr;\n\t}\n\n\tprivate arrayExpr(\n\t\tir: Extract<IRType, { kind: \"array\" }>,\n\t\tdoc: SourceDoc,\n\t\tname: string,\n\t\tr: RenderCtx,\n\t): string {\n\t\tconst items = ir.items ? this.exprOf(ir.items, doc, name, r) : \"z.unknown()\";\n\t\tlet expr = `z.array(${items})`;\n\t\tif (ir.minItems !== undefined) {\n\t\t\texpr += `.min(${ir.minItems})`;\n\t\t}\n\t\tif (ir.maxItems !== undefined) {\n\t\t\texpr += `.max(${ir.maxItems})`;\n\t\t}\n\t\tif (ir.uniqueItems === true) {\n\t\t\tr.warnings.push(\"uniqueItems is not supported by the zod target and was ignored\");\n\t\t}\n\t\treturn expr;\n\t}\n\n\tprivate tupleExpr(\n\t\tir: Extract<IRType, { kind: \"tuple\" }>,\n\t\tdoc: SourceDoc,\n\t\tname: string,\n\t\tr: RenderCtx,\n\t): string {\n\t\tconst items = ir.items.map(i => this.exprOf(i, doc, name, r)).join(\", \");\n\t\tlet expr = `z.tuple([${items}])`;\n\t\tif (ir.additionalItems) {\n\t\t\texpr += `.rest(${this.exprOf(ir.additionalItems, doc, name, r)})`;\n\t\t}\n\t\treturn expr;\n\t}\n\n\tprivate objectExpr(\n\t\tir: Extract<IRType, { kind: \"object\" }>,\n\t\tdoc: SourceDoc,\n\t\tname: string,\n\t\tr: RenderCtx,\n\t): string {\n\t\tconst required = new Set(ir.required);\n\t\tconst parts: string[] = [];\n\t\tfor (const [key, val] of ir.properties) {\n\t\t\tlet expr = this.exprOf(val, doc, name, r);\n\t\t\tconst hasDefault =\n\t\t\t\tr.ctx.options.defaults &&\n\t\t\t\tval.meta?.default !== undefined &&\n\t\t\t\tdefaultMatches(val, val.meta.default);\n\t\t\tif (hasDefault) {\n\t\t\t\texpr = `${expr}.default(${JSON.stringify(val.meta?.default)})`;\n\t\t\t} else if (!required.has(key)) {\n\t\t\t\texpr = `${expr}.optional()`;\n\t\t\t} else if (\n\t\t\t\tr.ctx.options.defaults &&\n\t\t\t\tval.meta?.default !== undefined &&\n\t\t\t\t!defaultMatches(val, val.meta.default)\n\t\t\t) {\n\t\t\t\tr.warnings.push(\n\t\t\t\t\t`default ${JSON.stringify(val.meta.default)} does not match schema type and was ignored`,\n\t\t\t\t);\n\t\t\t}\n\t\t\tparts.push(`${quoteKey(key)}: ${expr}`);\n\t\t}\n\t\tlet expr = parts.length === 0 ? \"z.object({})\" : `z.object({ ${parts.join(\", \")} })`;\n\t\tif (ir.additionalProperties === false) {\n\t\t\texpr = `${expr}.strict()`;\n\t\t} else if (ir.additionalProperties) {\n\t\t\texpr = `${expr}.catchall(${this.exprOf(ir.additionalProperties, doc, name, r)})`;\n\t\t}\n\t\treturn expr;\n\t}\n}\n\nfunction stringFormatBase(format: string | undefined): string {\n\tswitch (format) {\n\t\tcase \"uuid\":\n\t\t\treturn \"z.uuid()\";\n\t\tcase \"email\":\n\t\t\treturn \"z.email()\";\n\t\tcase \"uri\":\n\t\tcase \"url\":\n\t\t\treturn \"z.url()\";\n\t\tcase \"date\":\n\t\t\treturn \"z.iso.date()\";\n\t\tcase \"date-time\":\n\t\t\treturn \"z.iso.datetime()\";\n\t\tcase \"time\":\n\t\t\treturn \"z.iso.time()\";\n\t\tdefault:\n\t\t\treturn \"z.string()\";\n\t}\n}\n"],"mappings":";;;;;AAsBA,IAAa,aAAb,MAAmD;CAClD,OAAuB;CAEvB,MAAa,MAAM,MAA4B,KAA2C;EACzF,MAAM,OAAO,IAAI,IAAuB,KAAK,KAAI,MAAK,CAAC,EAAE,OAAO,CAAC,CAAU,CAAC;EAC5E,MAAM,QAAQ,eAAe,IAAI;EACjC,MAAM,QAAuB,CAAC;EAC9B,KAAK,MAAM,OAAO,MACjB,MAAM,KAAK;GACV,MAAM,IAAI,WAAW,IAAI,KAAK;GAC9B,SAAS,KAAK,SAAS,KAAK,KAAK,MAAM,KAAK;EAC7C,CAAC;EAEF,OAAO;CACR;CAEA,SACC,KACA,KACA,MACA,OACS;EACT,MAAM,UAAU,eAAe,KAAK,KAAK,IAAI;EAC7C,MAAM,WAAqB,CAAC;EAC5B,MAAM,IAAe;GAAE;GAAK;GAAM;GAAO;EAAS;EAElD,MAAM,QAAkB,CAAC;EACzB,MAAM,KAAK,qBAAqB,KAAK,UAAU,IAAI,QAAQ,YAAY,OAAO,KAAK,EAAE,EAAE;EACvF,MAAM,SAAS,CAAC,GAAG,QAAQ,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;EAC/E,KAAK,MAAM,GAAG,SAAS,QAAQ;GAC9B,MAAM,QAAQ,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,SAAS;GACvC,MAAM,KAAK,YAAY,MAAM,KAAK,IAAI,EAAE,UAAU,KAAK,UAAU,KAAK,IAAI,EAAE,EAAE;EAC/E;EACA,MAAM,KAAK,EAAE;EAEb,KAAK,MAAM,QAAQ,IAAI,aAAa;GACnC,MAAM,KAAK,IAAI,QAAQ,IAAI,IAAI;GAC/B,IAAI,CAAC,IACJ;GAED,MAAM,aAAa,IAAI,kBAAkB,KAAK,IAAI;GAClD,MAAM,SAAS,MAAM,SAAS,OAAO,IAAI,OAAO,IAAI,CAAC;GACrD,IAAI,QAAQ;IAGX,MAAM,YAAY,QAAqB,KAAK,aAAa,KAAK,KAAK,CAAC;IACpE,MAAM,KACL,eAAe,WAAW,KAAK,aAAa,IAAI,UAAU,EAAE,gBAAgB,MAAM,CAAC,EAAE,EACtF;IACA,MAAM,KAAK,EAAE;GACd;GACA,IAAI,GAAG,MAAM,YACZ,MAAM,KAAK,oBAAoB;GAEhC,MAAM,aAAa,SAAS,eAAe,WAAW,KAAK;GAC3D,MAAM,KACL,gBAAgB,aAAa,WAAW,KAAK,KAAK,OAAO,IAAI,KAAK,MAAM,CAAC,EAAE,EAC5E;GACA,IAAI,CAAC,QACJ,MAAM,KAAK,eAAe,WAAW,oBAAoB,WAAW,GAAG;GAExE,MAAM,KAAK,EAAE;EACd;EAEA,KAAK,MAAM,WAAW,UACrB,IAAI,YAAY,KACf,iBAAiB,eAAe,gBAAgB,WAAW,SAAS,EACnE,OAAO,IAAI,MACZ,CAAC,CACF;EAED,OAAO,GAAG,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ,EAAE;CACtC;CAEA,OAAe,IAAY,KAAgB,MAAc,GAAsB;EAC9E,IAAI;EACJ,QAAQ,GAAG,MAAX;GACC,KAAK;IACJ,OAAO,KAAK,QAAQ,GAAG,KAAK,KAAK,MAAM,CAAC;IACxC;GACD,KAAK;IACJ,OAAO,KAAK,WAAW,EAAE;IACzB;GACD,KAAK;GACL,KAAK;IACJ,OAAO,KAAK,WAAW,EAAE;IACzB;GACD,KAAK;IACJ,OAAO,GAAG,UAAU,KAAA,IAAY,aAAa,GAAG,MAAM,KAAK;IAC3D;GACD,KAAK;IACJ,OAAO;IACP;GACD,KAAK;IACJ,OAAO,aAAa,QAAQ,GAAG,KAAK,EAAE;IACtC;GACD,KAAK;IACJ,OAAO,KAAK,UAAU,IAAI,KAAK,MAAM,CAAC;IACtC;GACD,KAAK;IACJ,OAAO,KAAK,UAAU,IAAI,KAAK,MAAM,CAAC;IACtC;GACD,KAAK;IACJ,OAAO,KAAK,WAAW,IAAI,KAAK,MAAM,CAAC;IACvC;GACD,KAAK;IACJ,OAAO,wBAAwB,KAAK,OAAO,GAAG,QAAQ,KAAK,MAAM,CAAC,EAAE;IACpE;GACD,KAAK;IACJ,IAAI,GAAG,SAAS,WAAW,GAC1B,OAAO;SACD,IAAI,GAAG,SAAS,WAAW,GAAG;KACpC,MAAM,SAAS,GAAG,SAAS;KAC3B,OAAO,SAAS,KAAK,OAAO,QAAQ,KAAK,MAAM,CAAC,IAAI;IACrD,OACC,OAAO,YAAY,GAAG,SAAS,KAAI,MAAK,KAAK,OAAO,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;IAElF;GAED,KAAK;IACJ,IAAI,GAAG,SAAS,WAAW,GAC1B,OAAO;SAEP,OAAO,GAAG,SACR,KAAI,MAAK,KAAK,OAAO,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC,CACtC,QAAQ,KAAK,MAAM,kBAAkB,IAAI,IAAI,EAAE,EAAE;IAEpD;GAED,KAAK,WACJ,OAAO;EAET;EACA,IAAI,GAAG,MAAM,aACZ,OAAO,GAAG,KAAK,YAAY,KAAK,UAAU,GAAG,KAAK,WAAW,EAAE;EAEhE,OAAO;CACR;CAEA,QAAgB,KAAU,KAAgB,MAAc,GAAsB;EAC7E,MAAM,SAAS,EAAE,KAAK,IAAI,IAAI,KAAK;EACnC,MAAM,aAAa,SAChB,EAAE,IAAI,kBAAkB,QAAQ,IAAI,UAAU,IAC9C,IAAI;EACP,IAAI,EAAE,MAAM,UAAU,OAAO,IAAI,OAAO,IAAI,GAAG,OAAO,IAAI,OAAO,IAAI,UAAU,CAAC,GAC/E,OAAO,gBAAgB,WAAW;EAEnC,OAAO;CACR;;CAGA,aAAqB,KAAU,KAAgB,GAAsB;EACpE,IAAI,IAAI,UAAU,IAAI,OAAO;GAC5B,IAAI,CAAC,IAAI,QAAQ,IAAI,IAAI,UAAU,GAClC,OAAO;GAER,MAAM,WAAW,EAAE,IAAI,kBAAkB,KAAK,IAAI,UAAU;GAC5D,IAAI,EAAE,MAAM,SAAS,OAAO,IAAI,OAAO,IAAI,UAAU,CAAC,GACrD,OAAO;GAER,OAAO,kBAAkB,SAAS;EACnC;EACA,MAAM,SAAS,EAAE,KAAK,IAAI,IAAI,KAAK;EACnC,IAAI,CAAC,QACJ,OAAO;EAER,MAAM,aAAa,EAAE,IAAI,kBAAkB,QAAQ,IAAI,UAAU;EACjE,IAAI,EAAE,MAAM,SAAS,OAAO,IAAI,OAAO,IAAI,UAAU,CAAC,GACrD,OAAO;EAER,OAAO,kBAAkB,WAAW;CACrC;CAEA,WAAmB,IAAiD;EACnE,IAAI,GAAG,UAAU,KAAA,GAChB,OAAO,aAAa,KAAK,UAAU,GAAG,KAAK,EAAE;EAE9C,IAAI,GAAG,MAAM;GACZ,IAAI,GAAG,KAAK,WAAW,GACtB,OAAO;GAER,OAAO,WAAW,GAAG,KAAK,KAAI,MAAK,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;EAClE;EACA,IAAI,OAAO,iBAAiB,GAAG,MAAM;EACrC,IAAI,GAAG,cAAc,KAAA,GACpB,QAAQ,QAAQ,GAAG,UAAU;EAE9B,IAAI,GAAG,cAAc,KAAA,GACpB,QAAQ,QAAQ,GAAG,UAAU;EAE9B,IAAI,GAAG,YAAY,KAAA,GAClB,QAAQ,UAAU,aAAa,GAAG,OAAO,EAAE;EAE5C,OAAO;CACR;CAEA,WAAmB,IAA6D;EAC/E,IAAI,GAAG,UAAU,KAAA,GAChB,OAAO,aAAa,GAAG,MAAM;EAE9B,IAAI,GAAG,MAAM;GACZ,IAAI,GAAG,KAAK,WAAW,GACtB,OAAO,GAAG,SAAS,YAAY,YAAY;GAE5C,OAAO,YAAY,GAAG,KAAK,KAAI,MAAK,aAAa,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,EAAE;EACnE;EACA,IAAI,OAAO,GAAG,SAAS,YAAY,YAAY;EAC/C,IAAI,GAAG,YAAY,KAAA,GAClB,QAAQ,QAAQ,GAAG,QAAQ;EAE5B,IAAI,GAAG,YAAY,KAAA,GAClB,QAAQ,QAAQ,GAAG,QAAQ;EAE5B,IAAI,GAAG,qBAAqB,KAAA,GAC3B,QAAQ,OAAO,GAAG,iBAAiB;EAEpC,IAAI,GAAG,qBAAqB,KAAA,GAC3B,QAAQ,OAAO,GAAG,iBAAiB;EAEpC,IAAI,GAAG,eAAe,KAAA,GACrB,QAAQ,eAAe,GAAG,WAAW;EAEtC,OAAO;CACR;CAEA,UACC,IACA,KACA,MACA,GACS;EAET,IAAI,OAAO,WADG,GAAG,QAAQ,KAAK,OAAO,GAAG,OAAO,KAAK,MAAM,CAAC,IAAI,cACnC;EAC5B,IAAI,GAAG,aAAa,KAAA,GACnB,QAAQ,QAAQ,GAAG,SAAS;EAE7B,IAAI,GAAG,aAAa,KAAA,GACnB,QAAQ,QAAQ,GAAG,SAAS;EAE7B,IAAI,GAAG,gBAAgB,MACtB,EAAE,SAAS,KAAK,gEAAgE;EAEjF,OAAO;CACR;CAEA,UACC,IACA,KACA,MACA,GACS;EAET,IAAI,OAAO,YADG,GAAG,MAAM,KAAI,MAAK,KAAK,OAAO,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,IACxC,EAAE;EAC7B,IAAI,GAAG,iBACN,QAAQ,SAAS,KAAK,OAAO,GAAG,iBAAiB,KAAK,MAAM,CAAC,EAAE;EAEhE,OAAO;CACR;CAEA,WACC,IACA,KACA,MACA,GACS;EACT,MAAM,WAAW,IAAI,IAAI,GAAG,QAAQ;EACpC,MAAM,QAAkB,CAAC;EACzB,KAAK,MAAM,CAAC,KAAK,QAAQ,GAAG,YAAY;GACvC,IAAI,OAAO,KAAK,OAAO,KAAK,KAAK,MAAM,CAAC;GAKxC,IAHC,EAAE,IAAI,QAAQ,YACd,IAAI,MAAM,YAAY,KAAA,KACtB,eAAe,KAAK,IAAI,KAAK,OAAO,GAEpC,OAAO,GAAG,KAAK,WAAW,KAAK,UAAU,IAAI,MAAM,OAAO,EAAE;QACtD,IAAI,CAAC,SAAS,IAAI,GAAG,GAC3B,OAAO,GAAG,KAAK;QACT,IACN,EAAE,IAAI,QAAQ,YACd,IAAI,MAAM,YAAY,KAAA,KACtB,CAAC,eAAe,KAAK,IAAI,KAAK,OAAO,GAErC,EAAE,SAAS,KACV,WAAW,KAAK,UAAU,IAAI,KAAK,OAAO,EAAE,4CAC7C;GAED,MAAM,KAAK,GAAG,SAAS,GAAG,EAAE,IAAI,MAAM;EACvC;EACA,IAAI,OAAO,MAAM,WAAW,IAAI,iBAAiB,cAAc,MAAM,KAAK,IAAI,EAAE;EAChF,IAAI,GAAG,yBAAyB,OAC/B,OAAO,GAAG,KAAK;OACT,IAAI,GAAG,sBACb,OAAO,GAAG,KAAK,YAAY,KAAK,OAAO,GAAG,sBAAsB,KAAK,MAAM,CAAC,EAAE;EAE/E,OAAO;CACR;AACD;AAEA,SAAS,iBAAiB,QAAoC;CAC7D,QAAQ,QAAR;EACC,KAAK,QACJ,OAAO;EACR,KAAK,SACJ,OAAO;EACR,KAAK;EACL,KAAK,OACJ,OAAO;EACR,KAAK,QACJ,OAAO;EACR,KAAK,aACJ,OAAO;EACR,KAAK,QACJ,OAAO;EACR,SACC,OAAO;CACT;AACD"}