zod-compiler 1.23.0 → 1.23.2

package/dist/core/codegen/dedupe.js

@@ -1,272 +1,180 @@
-/**
- * File-level schema deduplication.
- *
- * When several schemas in one file share structurally identical sub-trees
- * (a reused `Address` object, a `{ id, name }` row, an exported schema that is
- * also embedded in another), the error-collecting "slow walk" for that shape
- * is generated ONCE as a shared `__zcSw_N(input, path, issues)` function and
- * every occurrence calls it instead of inlining a fresh copy.
- *
- * Two invariants keep this free of runtime cost and footguns:
- *
- *  1. **Slow walk only.** The fast path (the `&&` boolean chain that validates
- *     valid input with zero allocations) is NEVER shared — it stays fully
- *     inlined so the hot path is byte-for-byte what it was before. Only the
- *     cold, bulky error walk (64–77% of generated bytes) is shared.
- *
- *  2. **No per-export references.** A shared body lives at MODULE scope, while
- *     `__rf[]` — the array of retained Zod schemas and captured callbacks — is
- *     declared inside each export's IIFE. So a shape may be shared only when
- *     nothing in it resolves through `__rf`: no `default`, `catch`, `fallback`,
- *     captured `transform`, or captured `refine`/`superRefine`. Zero-capture
- *     callbacks are fine — they are hosted from source text into the shared
- *     block's own preamble.
- *
- * Sharing used to additionally require the whole ROOT to be mutation-free, so
- * that a body which wrote nothing back could not lose an output value. That
- * excluded a genuine `z.object()` — it strips, so its walk PRODUCES a rebuilt
- * object — which, once `z.object()` began always stripping, meant the feature
- * stopped firing for essentially every real schema: a realistic module of four
- * schemas reusing two sub-shapes shared nothing and shipped 29.6 KB where the
- * `strictObject` spelling of the same thing shipped 16.7 KB.
- *
- * The write-back problem is solved directly instead: a shared walk RETURNS its
- * value and call sites assign it (`slot = __zcSw_N(slot, path, issues)`), so a
- * stripping object, a coercion or a `.trim()` delivers its rewritten value
- * through the call exactly as an inlined walk delivers it through `g.output`.
- */
 import { createSlowGen, generateSlow } from "./slow-path.js";
+//#region src/core/codegen/dedupe.ts
 /**
- * Minimum subtree weight (≈ node count, +1 per check) for a repeated shape to
- * be worth a shared function. Below this the call + dynamic-path overhead
- * outweighs the duplicated inline walk; ~4 admits a 3-field object or an
- * array-of-object while skipping bare primitives and thin wrappers.
- */
+* Minimum subtree weight (≈ node count, +1 per check) for a repeated shape to
+* be worth a shared function. Below this the call + dynamic-path overhead
+* outweighs the duplicated inline walk; ~4 admits a 3-field object or an
+* array-of-object while skipping bare primitives and thin wrappers.
+*/
 const MIN_SHARED_WEIGHT = 4;
 /** Leading marker of a shared block; used to skip re-injection on watch/HMR re-runs. */
-export const SHARED_BLOCK_MARKER = "/* zod-compiler shared */";
+const SHARED_BLOCK_MARKER = "/* zod-compiler shared */";
 const EMPTY_PLAN = {
-    refFor: () => undefined,
-    code: "",
-    usedHelpers: new Set(),
-    isEmpty: true,
+	refFor: () => void 0,
+	code: "",
+	usedHelpers: /* @__PURE__ */ new Set(),
+	isEmpty: true
 };
 /**
- * Build the shared-schema plan for one file's root schemas. Returns
- * {@link EMPTY_PLAN} (a no-op) when nothing repeats — the common case, so files
- * without internal duplication pay only a single linear analysis pass.
- */
-export function createSharedSchemaPlan(roots, mode) {
-    const keyMemo = new Map();
-    const weightMemo = new Map();
-    const stats = new Map();
-    for (const root of roots) {
-        collect(root, keyMemo, weightMemo, stats);
-    }
-    const selected = [...stats.values()]
-        .filter((c) => c.count >= 2 &&
-        c.weight >= MIN_SHARED_WEIGHT &&
-        !containsRecursiveRef(c.ir) &&
-        !referencesExportRefs(c.ir))
-        // Largest shapes first so the biggest wins get the lowest indices; tie-break
-        // on the structural key for deterministic, reproducible output.
-        .sort((a, b) => b.weight - a.weight || cmp(keyOf(a.ir, keyMemo), keyOf(b.ir, keyMemo)));
-    if (selected.length === 0)
-        return EMPTY_PLAN;
-    const refs = new Map();
-    selected.forEach((c, i) => refs.set(keyOf(c.ir, keyMemo), { name: `__zcSw_${i}` }));
-    const refFor = (ir) => refs.get(keyOf(ir, keyMemo));
-    const ctx = {
-        preamble: [],
-        counter: 0,
-        fnName: "__zcShared",
-        regexCache: new Map(),
-        mode,
-        usedHelpers: new Set(),
-    };
-    // Generation consults the plan so a shared candidate nested inside another
-    // shared candidate becomes a `__zcSw_*` call rather than a second inline copy.
-    // Containment is strictly size-decreasing, so the shared functions form a DAG;
-    // hoisted declarations make call order irrelevant.
-    ctx.sharedSchemas = { refFor, code: "", usedHelpers: ctx.usedHelpers, isEmpty: false };
-    const fns = [];
-    for (const c of selected) {
-        const ref = refs.get(keyOf(c.ir, keyMemo));
-        if (ref === undefined)
-            continue;
-        // Generate the candidate's body INLINE (the root is passed to generateSlow,
-        // not visit(), so it never replaces itself with a call); only its children
-        // route through visit() and may resolve to other shared refs.
-        const body = generateSlow(c.ir, createSlowGen("input", "input", "path", "_e", ctx));
-        // `input` is both the read and the write slot (createSlowGen above passes it
-        // as input AND output), so a walk that rewrites — a stripping object, a
-        // coercion, an overwrite check — leaves its result there. Returning it is
-        // what lets the caller receive that value; a walk that rewrites nothing
-        // returns its argument unchanged.
-        fns.push(`function ${ref.name}(input,path,_e){\n${body}\nreturn input;\n}`);
-    }
-    return {
-        refFor,
-        code: [SHARED_BLOCK_MARKER, ...ctx.preamble, ...fns].join("\n"),
-        usedHelpers: ctx.usedHelpers,
-        isEmpty: false,
-    };
+* Build the shared-schema plan for one file's root schemas. Returns
+* {@link EMPTY_PLAN} (a no-op) when nothing repeats — the common case, so files
+* without internal duplication pay only a single linear analysis pass.
+*/
+function createSharedSchemaPlan(roots, mode) {
+	const keyMemo = /* @__PURE__ */ new Map();
+	const weightMemo = /* @__PURE__ */ new Map();
+	const stats = /* @__PURE__ */ new Map();
+	for (const root of roots) collect(root, keyMemo, weightMemo, stats);
+	const selected = [...stats.values()].filter((c) => c.count >= 2 && c.weight >= MIN_SHARED_WEIGHT && !containsRecursiveRef(c.ir) && !referencesExportRefs(c.ir)).sort((a, b) => b.weight - a.weight || cmp(keyOf(a.ir, keyMemo), keyOf(b.ir, keyMemo)));
+	if (selected.length === 0) return EMPTY_PLAN;
+	const refs = /* @__PURE__ */ new Map();
+	selected.forEach((c, i) => refs.set(keyOf(c.ir, keyMemo), { name: `__zcSw_${i}` }));
+	const refFor = (ir) => refs.get(keyOf(ir, keyMemo));
+	const ctx = {
+		preamble: [],
+		counter: 0,
+		fnName: "__zcShared",
+		regexCache: /* @__PURE__ */ new Map(),
+		mode,
+		usedHelpers: /* @__PURE__ */ new Set()
+	};
+	ctx.sharedSchemas = {
+		refFor,
+		code: "",
+		usedHelpers: ctx.usedHelpers,
+		isEmpty: false
+	};
+	const fns = [];
+	for (const c of selected) {
+		const ref = refs.get(keyOf(c.ir, keyMemo));
+		if (ref === void 0) continue;
+		const body = generateSlow(c.ir, createSlowGen("input", "input", "path", "_e", ctx));
+		fns.push(`function ${ref.name}(input,path,_e){\n${body}\nreturn input;\n}`);
+	}
+	return {
+		refFor,
+		code: [
+			SHARED_BLOCK_MARKER,
+			...ctx.preamble,
+			...fns
+		].join("\n"),
+		usedHelpers: ctx.usedHelpers,
+		isEmpty: false
+	};
 }
-// A shared sub-schema is called as `slot = __zcSw_N(slot, path, issues)`: the
-// walk pushes directly into the caller's `issues` array (no result object, no
-// per-call issue copy) and returns the parsed value, which the call site assigns
-// back into the slot the inlined walk would have written. Call sites are emitted
-// by slow-path.ts (nested occurrences) and index.ts (a shared root), keyed off
-// `ref.name`.
 /**
- * Does the subtree resolve anything through the per-export `__rf[]` array —
- * a retained Zod schema (`default`, `catch`, `fallback`) or a captured callback
- * (`transform`, `refine`, `superRefine`)?
- *
- * Those names exist only inside an export's own IIFE, so a module-scope shared
- * body referencing them would be unbound. A zero-capture callback carries
- * `source` instead of `refIndex` and is hosted into the shared block's preamble,
- * so it does not disqualify a shape.
- */
+* Does the subtree resolve anything through the per-export `__rf[]` array —
+* a retained Zod schema (`default`, `catch`, `fallback`) or a captured callback
+* (`transform`, `refine`, `superRefine`)?
+*
+* Those names exist only inside an export's own IIFE, so a module-scope shared
+* body referencing them would be unbound. A zero-capture callback carries
+* `source` instead of `refIndex` and is hosted into the shared block's preamble,
+* so it does not disqualify a shape.
+*/
 function referencesExportRefs(ir) {
-    switch (ir.type) {
-        case "default":
-        case "catch":
-        case "fallback":
-            // `refIndex` is mandatory on these — the value/schema lives on the export.
-            return true;
-        case "effect":
-            if (ir.refIndex !== undefined)
-                return true;
-            break;
-        case "string":
-        case "number":
-        case "object":
-        case "array":
-            if (ir.checks?.some((c) => "refIndex" in c && c.refIndex !== undefined))
-                return true;
-            break;
-        default:
-            break;
-    }
-    return childSchemas(ir).some(referencesExportRefs);
+	switch (ir.type) {
+		case "default":
+		case "catch":
+		case "fallback": return true;
+		case "effect":
+			if (ir.refIndex !== void 0) return true;
+			break;
+		case "string":
+		case "number":
+		case "object":
+		case "array":
+			if (ir.checks?.some((c) => "refIndex" in c && c.refIndex !== void 0)) return true;
+			break;
+		default: break;
+	}
+	return childSchemas(ir).some(referencesExportRefs);
 }
-// ─── Candidate collection ────────────────────────────────────────────────────
 function collect(ir, keyMemo, weightMemo, stats) {
-    const key = keyOf(ir, keyMemo);
-    const existing = stats.get(key);
-    if (existing) {
-        existing.count++;
-    }
-    else {
-        stats.set(key, { ir, count: 1, weight: weightOf(ir, weightMemo) });
-    }
-    for (const child of childSchemas(ir))
-        collect(child, keyMemo, weightMemo, stats);
+	const key = keyOf(ir, keyMemo);
+	const existing = stats.get(key);
+	if (existing) existing.count++;
+	else stats.set(key, {
+		ir,
+		count: 1,
+		weight: weightOf(ir, weightMemo)
+	});
+	for (const child of childSchemas(ir)) collect(child, keyMemo, weightMemo, stats);
 }
 /** Direct child SchemaIR nodes (the structural recursion shared by every pass). */
 function childSchemas(ir) {
-    switch (ir.type) {
-        case "object":
-            return Object.values(ir.properties);
-        case "array":
-            return [ir.element];
-        case "tuple":
-            return ir.rest === null ? ir.items : [...ir.items, ir.rest];
-        case "record":
-        case "map":
-            return [ir.keyType, ir.valueType];
-        case "set":
-            return [ir.valueType];
-        case "union":
-        case "discriminatedUnion":
-            return ir.options;
-        case "intersection":
-            return [ir.left, ir.right];
-        case "optional":
-        case "nullable":
-        case "readonly":
-        case "default":
-        case "catch":
-            return [ir.inner];
-        case "pipe":
-            return [ir.in, ir.out];
-        case "effect":
-        case "recursionTarget":
-            return [ir.inner];
-        default:
-            return [];
-    }
+	switch (ir.type) {
+		case "object": return Object.values(ir.properties);
+		case "array": return [ir.element];
+		case "tuple": return ir.rest === null ? ir.items : [...ir.items, ir.rest];
+		case "record":
+		case "map": return [ir.keyType, ir.valueType];
+		case "set": return [ir.valueType];
+		case "union":
+		case "discriminatedUnion": return ir.options;
+		case "intersection": return [ir.left, ir.right];
+		case "optional":
+		case "nullable":
+		case "readonly":
+		case "default":
+		case "catch": return [ir.inner];
+		case "pipe": return [ir.in, ir.out];
+		case "effect":
+		case "recursionTarget": return [ir.inner];
+		default: return [];
+	}
 }
 /** Subtree weight ≈ node count plus one per check; memoized for O(total) cost. */
 function weightOf(ir, memo) {
-    const hit = memo.get(ir);
-    if (hit !== undefined)
-        return hit;
-    const checks = ir.checks;
-    let weight = 1 + (Array.isArray(checks) ? checks.length : 0);
-    for (const child of childSchemas(ir))
-        weight += weightOf(child, memo);
-    memo.set(ir, weight);
-    return weight;
+	const hit = memo.get(ir);
+	if (hit !== void 0) return hit;
+	const checks = ir.checks;
+	let weight = 1 + (Array.isArray(checks) ? checks.length : 0);
+	for (const child of childSchemas(ir)) weight += weightOf(child, memo);
+	memo.set(ir, weight);
+	return weight;
 }
 function containsRecursiveRef(ir) {
-    if (ir.type === "recursiveRef")
-        return true;
-    return childSchemas(ir).some(containsRecursiveRef);
+	if (ir.type === "recursiveRef") return true;
+	return childSchemas(ir).some(containsRecursiveRef);
 }
-// ─── Structural keys ─────────────────────────────────────────────────────────
 /**
- * Stable structural key for an IR node, memoized by node identity so each
- * subtree is serialized exactly once (the whole pass is O(total nodes), not
- * O(nodes × depth)). Two nodes share a key iff they are structurally identical
- * — including every check, literal value, and error message — so deduplicated
- * schemas produce byte-identical validation and issues.
- */
+* Stable structural key for an IR node, memoized by node identity so each
+* subtree is serialized exactly once (the whole pass is O(total nodes), not
+* O(nodes × depth)). Two nodes share a key iff they are structurally identical
+* — including every check, literal value, and error message — so deduplicated
+* schemas produce byte-identical validation and issues.
+*/
 function keyOf(ir, memo) {
-    const hit = memo.get(ir);
-    if (hit !== undefined)
-        return hit;
-    const obj = ir;
-    const key = `{${Object.keys(obj)
-        .filter((k) => obj[k] !== undefined)
-        .sort()
-        .map((k) => `${k}:${encodeValue(obj[k], memo)}`)
-        .join(",")}}`;
-    memo.set(ir, key);
-    return key;
+	const hit = memo.get(ir);
+	if (hit !== void 0) return hit;
+	const obj = ir;
+	const key = `{${Object.keys(obj).filter((k) => obj[k] !== void 0).sort().map((k) => `${k}:${encodeValue(obj[k], memo)}`).join(",")}}`;
+	memo.set(ir, key);
+	return key;
 }
 /**
- * Encode any IR field value. A nested SchemaIR is detected by a string `type`
- * field (checks carry `kind`, union `cases` carry `value`/`option` — only real
- * schema nodes have `type`) and routed through {@link keyOf} for subtree
- * memoization; everything else is serialized in sorted-key order.
- */
+* Encode any IR field value. A nested SchemaIR is detected by a string `type`
+* field (checks carry `kind`, union `cases` carry `value`/`option` — only real
+* schema nodes have `type`) and routed through {@link keyOf} for subtree
+* memoization; everything else is serialized in sorted-key order.
+*/
 function encodeValue(value, memo) {
-    if (typeof value === "bigint")
-        return `#${value}`;
-    if (value === null)
-        return "null";
-    // Non-finite numbers must stay distinct: JSON.stringify maps Infinity, -Infinity
-    // and NaN all to "null", which would merge e.g. .min(Infinity) with .min(NaN).
-    if (typeof value === "number" && !Number.isFinite(value))
-        return `n!${value}`;
-    if (Array.isArray(value))
-        return `[${value.map((v) => encodeValue(v, memo)).join(",")}]`;
-    if (typeof value === "object") {
-        if (typeof value.type === "string") {
-            return keyOf(value, memo);
-        }
-        const obj = value;
-        return `{${Object.keys(obj)
-            .filter((k) => obj[k] !== undefined)
-            .sort()
-            .map((k) => `${k}:${encodeValue(obj[k], memo)}`)
-            .join(",")}}`;
-    }
-    return JSON.stringify(value) ?? "undefined";
+	if (typeof value === "bigint") return `#${value}`;
+	if (value === null) return "null";
+	if (typeof value === "number" && !Number.isFinite(value)) return `n!${value}`;
+	if (Array.isArray(value)) return `[${value.map((v) => encodeValue(v, memo)).join(",")}]`;
+	if (typeof value === "object") {
+		if (typeof value.type === "string") return keyOf(value, memo);
+		const obj = value;
+		return `{${Object.keys(obj).filter((k) => obj[k] !== void 0).sort().map((k) => `${k}:${encodeValue(obj[k], memo)}`).join(",")}}`;
+	}
+	return JSON.stringify(value) ?? "undefined";
 }
 function cmp(a, b) {
-    return a < b ? -1 : a > b ? 1 : 0;
+	return a < b ? -1 : a > b ? 1 : 0;
 }
+//#endregion
+export { SHARED_BLOCK_MARKER, createSharedSchemaPlan };
+
 //# sourceMappingURL=dedupe.js.map

package/dist/core/codegen/dedupe.js.map

@@ -1 +1 @@
-{"version":3,"file":"dedupe.js","sourceRoot":"","sources":["../../../src/core/codegen/dedupe.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AAIH,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAsB7D;;;;;GAKG;AACH,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAE5B,wFAAwF;AACxF,MAAM,CAAC,MAAM,mBAAmB,GAAG,2BAA2B,CAAC;AAE/D,MAAM,UAAU,GAAqB;IACnC,MAAM,EAAE,GAAG,EAAE,CAAC,SAAS;IACvB,IAAI,EAAE,EAAE;IACR,WAAW,EAAE,IAAI,GAAG,EAAE;IACtB,OAAO,EAAE,IAAI;CACd,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CACpC,KAA0B,EAC1B,IAAiB;IAEjB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,MAAM,KAAK,GAAG,IAAI,GAAG,EAA2D,CAAC;IAEjF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,OAAO,CAAC,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;IAC5C,CAAC;IAED,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;SACjC,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,KAAK,IAAI,CAAC;QACZ,CAAC,CAAC,MAAM,IAAI,iBAAiB;QAC7B,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3B,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,CAAC,CAC9B;QACD,6EAA6E;QAC7E,gEAAgE;SAC/D,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IAE1F,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,UAAU,CAAC;IAE7C,MAAM,IAAI,GAAG,IAAI,GAAG,EAA2B,CAAC;IAChD,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAEpF,MAAM,MAAM,GAAG,CAAC,EAAY,EAA+B,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;IAE3F,MAAM,GAAG,GAAmB;QAC1B,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,CAAC;QACV,MAAM,EAAE,YAAY;QACpB,UAAU,EAAE,IAAI,GAAG,EAAE;QACrB,IAAI;QACJ,WAAW,EAAE,IAAI,GAAG,EAAE;KACvB,CAAC;IACF,2EAA2E;IAC3E,+EAA+E;IAC/E,+EAA+E;IAC/E,mDAAmD;IACnD,GAAG,CAAC,aAAa,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,WAAW,EAAE,GAAG,CAAC,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAEvF,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;QAC3C,IAAI,GAAG,KAAK,SAAS;YAAE,SAAS;QAChC,4EAA4E;QAC5E,2EAA2E;QAC3E,8DAA8D;QAC9D,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE,EAAE,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QACpF,6EAA6E;QAC7E,wEAAwE;QACxE,0EAA0E;QAC1E,wEAAwE;QACxE,kCAAkC;QAClC,GAAG,CAAC,IAAI,CAAC,YAAY,GAAG,CAAC,IAAI,qBAAqB,IAAI,oBAAoB,CAAC,CAAC;IAC9E,CAAC;IAED,OAAO;QACL,MAAM;QACN,IAAI,EAAE,CAAC,mBAAmB,EAAE,GAAG,GAAG,CAAC,QAAQ,EAAE,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QAC/D,WAAW,EAAE,GAAG,CAAC,WAAW;QAC5B,OAAO,EAAE,KAAK;KACf,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,8EAA8E;AAC9E,iFAAiF;AACjF,iFAAiF;AACjF,+EAA+E;AAC/E,cAAc;AAEd;;;;;;;;;GASG;AACH,SAAS,oBAAoB,CAAC,EAAY;IACxC,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;QAChB,KAAK,SAAS,CAAC;QACf,KAAK,OAAO,CAAC;QACb,KAAK,UAAU;YACb,2EAA2E;YAC3E,OAAO,IAAI,CAAC;QACd,KAAK,QAAQ;YACX,IAAI,EAAE,CAAC,QAAQ,KAAK,SAAS;gBAAE,OAAO,IAAI,CAAC;YAC3C,MAAM;QACR,KAAK,QAAQ,CAAC;QACd,KAAK,QAAQ,CAAC;QACd,KAAK,QAAQ,CAAC;QACd,KAAK,OAAO;YACV,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC;gBAAE,OAAO,IAAI,CAAC;YACrF,MAAM;QACR;YACE,MAAM;IACV,CAAC;IACD,OAAO,YAAY,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;AACrD,CAAC;AAED,gFAAgF;AAEhF,SAAS,OAAO,CACd,EAAY,EACZ,OAA8B,EAC9B,UAAiC,EACjC,KAAmE;IAEnE,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChC,IAAI,QAAQ,EAAE,CAAC;QACb,QAAQ,CAAC,KAAK,EAAE,CAAC;IACnB,CAAC;SAAM,CAAC;QACN,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;IACrE,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,EAAE,CAAC;QAAE,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;AACnF,CAAC;AAED,mFAAmF;AACnF,SAAS,YAAY,CAAC,EAAY;IAChC,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;QAChB,KAAK,QAAQ;YACX,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;QACtC,KAAK,OAAO;YACV,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;QACtB,KAAK,OAAO;YACV,OAAO,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QAC9D,KAAK,QAAQ,CAAC;QACd,KAAK,KAAK;YACR,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC;QACpC,KAAK,KAAK;YACR,OAAO,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;QACxB,KAAK,OAAO,CAAC;QACb,KAAK,oBAAoB;YACvB,OAAO,EAAE,CAAC,OAAO,CAAC;QACpB,KAAK,cAAc;YACjB,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QAC7B,KAAK,UAAU,CAAC;QAChB,KAAK,UAAU,CAAC;QAChB,KAAK,UAAU,CAAC;QAChB,KAAK,SAAS,CAAC;QACf,KAAK,OAAO;YACV,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QACpB,KAAK,MAAM;YACT,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QACzB,KAAK,QAAQ,CAAC;QACd,KAAK,iBAAiB;YACpB,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QACpB;YACE,OAAO,EAAE,CAAC;IACd,CAAC;AACH,CAAC;AAED,kFAAkF;AAClF,SAAS,QAAQ,CAAC,EAAY,EAAE,IAA2B;IACzD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACzB,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,GAAG,CAAC;IAClC,MAAM,MAAM,GAAI,EAAsC,CAAC,MAAM,CAAC;IAC9D,IAAI,MAAM,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,EAAE,CAAC;QAAE,MAAM,IAAI,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACtE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACrB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,oBAAoB,CAAC,EAAY;IACxC,IAAI,EAAE,CAAC,IAAI,KAAK,cAAc;QAAE,OAAO,IAAI,CAAC;IAC5C,OAAO,YAAY,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;AACrD,CAAC;AAED,gFAAgF;AAEhF;;;;;;GAMG;AACH,SAAS,KAAK,CAAC,EAAY,EAAE,IAA2B;IACtD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACzB,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,GAAG,CAAC;IAClC,MAAM,GAAG,GAAG,EAAwC,CAAC;IACrD,MAAM,GAAG,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;SAC7B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC;SACnC,IAAI,EAAE;SACN,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;SAC/C,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAChB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAClB,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,SAAS,WAAW,CAAC,KAAc,EAAE,IAA2B;IAC9D,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,KAAK,EAAE,CAAC;IAClD,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAClC,iFAAiF;IACjF,+EAA+E;IAC/E,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,KAAK,EAAE,CAAC;IAC9E,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IACzF,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,IAAI,OAAQ,KAA4B,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3D,OAAO,KAAK,CAAC,KAAiB,EAAE,IAAI,CAAC,CAAC;QACxC,CAAC;QACD,MAAM,GAAG,GAAG,KAAgC,CAAC;QAC7C,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;aACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC;aACnC,IAAI,EAAE;aACN,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;aAC/C,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAClB,CAAC;IACD,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,WAAW,CAAC;AAC9C,CAAC;AAED,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS;IAC/B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC"}
+{"version":3,"file":"dedupe.js","names":[],"sources":["../../../src/core/codegen/dedupe.ts"],"sourcesContent":["/**\n * File-level schema deduplication.\n *\n * When several schemas in one file share structurally identical sub-trees\n * (a reused `Address` object, a `{ id, name }` row, an exported schema that is\n * also embedded in another), the error-collecting \"slow walk\" for that shape\n * is generated ONCE as a shared `__zcSw_N(input, path, issues)` function and\n * every occurrence calls it instead of inlining a fresh copy.\n *\n * Two invariants keep this free of runtime cost and footguns:\n *\n *  1. **Slow walk only.** The fast path (the `&&` boolean chain that validates\n *     valid input with zero allocations) is NEVER shared — it stays fully\n *     inlined so the hot path is byte-for-byte what it was before. Only the\n *     cold, bulky error walk (64–77% of generated bytes) is shared.\n *\n *  2. **No per-export references.** A shared body lives at MODULE scope, while\n *     `__rf[]` — the array of retained Zod schemas and captured callbacks — is\n *     declared inside each export's IIFE. So a shape may be shared only when\n *     nothing in it resolves through `__rf`: no `default`, `catch`, `fallback`,\n *     captured `transform`, or captured `refine`/`superRefine`. Zero-capture\n *     callbacks are fine — they are hosted from source text into the shared\n *     block's own preamble.\n *\n * Sharing used to additionally require the whole ROOT to be mutation-free, so\n * that a body which wrote nothing back could not lose an output value. That\n * excluded a genuine `z.object()` — it strips, so its walk PRODUCES a rebuilt\n * object — which, once `z.object()` began always stripping, meant the feature\n * stopped firing for essentially every real schema: a realistic module of four\n * schemas reusing two sub-shapes shared nothing and shipped 29.6 KB where the\n * `strictObject` spelling of the same thing shipped 16.7 KB.\n *\n * The write-back problem is solved directly instead: a shared walk RETURNS its\n * value and call sites assign it (`slot = __zcSw_N(slot, path, issues)`), so a\n * stripping object, a coercion or a `.trim()` delivers its rewritten value\n * through the call exactly as an inlined walk delivers it through `g.output`.\n */\n\nimport type { SchemaIR } from \"../types.js\";\nimport type { CodeGenContext, CodegenMode } from \"./context.js\";\nimport { createSlowGen, generateSlow } from \"./slow-path.js\";\n\n/** A shared slow-walk validator hosted at module scope. */\nexport interface SharedSchemaRef {\n  /** Name of the `function __zcSw_N(input, path, issues)` declaration. */\n  readonly name: string;\n}\n\nexport interface SharedSchemaPlan {\n  /**\n   * Shared ref for an IR node, or undefined when the node is not a shared\n   * candidate. Keyed by structural identity (memoized), so repeated lookups\n   * during codegen are O(1).\n   */\n  refFor(ir: SchemaIR): SharedSchemaRef | undefined;\n  /** Module-scope declarations (shared preamble + `__zcSw_N` functions). `\"\"` when empty. */\n  readonly code: string;\n  /** Runtime helper names referenced by the shared block (lean mode). */\n  readonly usedHelpers: Set<string>;\n  readonly isEmpty: boolean;\n}\n\n/**\n * Minimum subtree weight (≈ node count, +1 per check) for a repeated shape to\n * be worth a shared function. Below this the call + dynamic-path overhead\n * outweighs the duplicated inline walk; ~4 admits a 3-field object or an\n * array-of-object while skipping bare primitives and thin wrappers.\n */\nconst MIN_SHARED_WEIGHT = 4;\n\n/** Leading marker of a shared block; used to skip re-injection on watch/HMR re-runs. */\nexport const SHARED_BLOCK_MARKER = \"/* zod-compiler shared */\";\n\nconst EMPTY_PLAN: SharedSchemaPlan = {\n  refFor: () => undefined,\n  code: \"\",\n  usedHelpers: new Set(),\n  isEmpty: true,\n};\n\n/**\n * Build the shared-schema plan for one file's root schemas. Returns\n * {@link EMPTY_PLAN} (a no-op) when nothing repeats — the common case, so files\n * without internal duplication pay only a single linear analysis pass.\n */\nexport function createSharedSchemaPlan(\n  roots: readonly SchemaIR[],\n  mode: CodegenMode,\n): SharedSchemaPlan {\n  const keyMemo = new Map<SchemaIR, string>();\n  const weightMemo = new Map<SchemaIR, number>();\n  const stats = new Map<string, { ir: SchemaIR; count: number; weight: number }>();\n\n  for (const root of roots) {\n    collect(root, keyMemo, weightMemo, stats);\n  }\n\n  const selected = [...stats.values()]\n    .filter(\n      (c) =>\n        c.count >= 2 &&\n        c.weight >= MIN_SHARED_WEIGHT &&\n        !containsRecursiveRef(c.ir) &&\n        !referencesExportRefs(c.ir),\n    )\n    // Largest shapes first so the biggest wins get the lowest indices; tie-break\n    // on the structural key for deterministic, reproducible output.\n    .sort((a, b) => b.weight - a.weight || cmp(keyOf(a.ir, keyMemo), keyOf(b.ir, keyMemo)));\n\n  if (selected.length === 0) return EMPTY_PLAN;\n\n  const refs = new Map<string, SharedSchemaRef>();\n  selected.forEach((c, i) => refs.set(keyOf(c.ir, keyMemo), { name: `__zcSw_${i}` }));\n\n  const refFor = (ir: SchemaIR): SharedSchemaRef | undefined => refs.get(keyOf(ir, keyMemo));\n\n  const ctx: CodeGenContext = {\n    preamble: [],\n    counter: 0,\n    fnName: \"__zcShared\",\n    regexCache: new Map(),\n    mode,\n    usedHelpers: new Set(),\n  };\n  // Generation consults the plan so a shared candidate nested inside another\n  // shared candidate becomes a `__zcSw_*` call rather than a second inline copy.\n  // Containment is strictly size-decreasing, so the shared functions form a DAG;\n  // hoisted declarations make call order irrelevant.\n  ctx.sharedSchemas = { refFor, code: \"\", usedHelpers: ctx.usedHelpers, isEmpty: false };\n\n  const fns: string[] = [];\n  for (const c of selected) {\n    const ref = refs.get(keyOf(c.ir, keyMemo));\n    if (ref === undefined) continue;\n    // Generate the candidate's body INLINE (the root is passed to generateSlow,\n    // not visit(), so it never replaces itself with a call); only its children\n    // route through visit() and may resolve to other shared refs.\n    const body = generateSlow(c.ir, createSlowGen(\"input\", \"input\", \"path\", \"_e\", ctx));\n    // `input` is both the read and the write slot (createSlowGen above passes it\n    // as input AND output), so a walk that rewrites — a stripping object, a\n    // coercion, an overwrite check — leaves its result there. Returning it is\n    // what lets the caller receive that value; a walk that rewrites nothing\n    // returns its argument unchanged.\n    fns.push(`function ${ref.name}(input,path,_e){\\n${body}\\nreturn input;\\n}`);\n  }\n\n  return {\n    refFor,\n    code: [SHARED_BLOCK_MARKER, ...ctx.preamble, ...fns].join(\"\\n\"),\n    usedHelpers: ctx.usedHelpers,\n    isEmpty: false,\n  };\n}\n\n// A shared sub-schema is called as `slot = __zcSw_N(slot, path, issues)`: the\n// walk pushes directly into the caller's `issues` array (no result object, no\n// per-call issue copy) and returns the parsed value, which the call site assigns\n// back into the slot the inlined walk would have written. Call sites are emitted\n// by slow-path.ts (nested occurrences) and index.ts (a shared root), keyed off\n// `ref.name`.\n\n/**\n * Does the subtree resolve anything through the per-export `__rf[]` array —\n * a retained Zod schema (`default`, `catch`, `fallback`) or a captured callback\n * (`transform`, `refine`, `superRefine`)?\n *\n * Those names exist only inside an export's own IIFE, so a module-scope shared\n * body referencing them would be unbound. A zero-capture callback carries\n * `source` instead of `refIndex` and is hosted into the shared block's preamble,\n * so it does not disqualify a shape.\n */\nfunction referencesExportRefs(ir: SchemaIR): boolean {\n  switch (ir.type) {\n    case \"default\":\n    case \"catch\":\n    case \"fallback\":\n      // `refIndex` is mandatory on these — the value/schema lives on the export.\n      return true;\n    case \"effect\":\n      if (ir.refIndex !== undefined) return true;\n      break;\n    case \"string\":\n    case \"number\":\n    case \"object\":\n    case \"array\":\n      if (ir.checks?.some((c) => \"refIndex\" in c && c.refIndex !== undefined)) return true;\n      break;\n    default:\n      break;\n  }\n  return childSchemas(ir).some(referencesExportRefs);\n}\n\n// ─── Candidate collection ────────────────────────────────────────────────────\n\nfunction collect(\n  ir: SchemaIR,\n  keyMemo: Map<SchemaIR, string>,\n  weightMemo: Map<SchemaIR, number>,\n  stats: Map<string, { ir: SchemaIR; count: number; weight: number }>,\n): void {\n  const key = keyOf(ir, keyMemo);\n  const existing = stats.get(key);\n  if (existing) {\n    existing.count++;\n  } else {\n    stats.set(key, { ir, count: 1, weight: weightOf(ir, weightMemo) });\n  }\n  for (const child of childSchemas(ir)) collect(child, keyMemo, weightMemo, stats);\n}\n\n/** Direct child SchemaIR nodes (the structural recursion shared by every pass). */\nfunction childSchemas(ir: SchemaIR): SchemaIR[] {\n  switch (ir.type) {\n    case \"object\":\n      return Object.values(ir.properties);\n    case \"array\":\n      return [ir.element];\n    case \"tuple\":\n      return ir.rest === null ? ir.items : [...ir.items, ir.rest];\n    case \"record\":\n    case \"map\":\n      return [ir.keyType, ir.valueType];\n    case \"set\":\n      return [ir.valueType];\n    case \"union\":\n    case \"discriminatedUnion\":\n      return ir.options;\n    case \"intersection\":\n      return [ir.left, ir.right];\n    case \"optional\":\n    case \"nullable\":\n    case \"readonly\":\n    case \"default\":\n    case \"catch\":\n      return [ir.inner];\n    case \"pipe\":\n      return [ir.in, ir.out];\n    case \"effect\":\n    case \"recursionTarget\":\n      return [ir.inner];\n    default:\n      return [];\n  }\n}\n\n/** Subtree weight ≈ node count plus one per check; memoized for O(total) cost. */\nfunction weightOf(ir: SchemaIR, memo: Map<SchemaIR, number>): number {\n  const hit = memo.get(ir);\n  if (hit !== undefined) return hit;\n  const checks = (ir as { checks?: readonly unknown[] }).checks;\n  let weight = 1 + (Array.isArray(checks) ? checks.length : 0);\n  for (const child of childSchemas(ir)) weight += weightOf(child, memo);\n  memo.set(ir, weight);\n  return weight;\n}\n\nfunction containsRecursiveRef(ir: SchemaIR): boolean {\n  if (ir.type === \"recursiveRef\") return true;\n  return childSchemas(ir).some(containsRecursiveRef);\n}\n\n// ─── Structural keys ─────────────────────────────────────────────────────────\n\n/**\n * Stable structural key for an IR node, memoized by node identity so each\n * subtree is serialized exactly once (the whole pass is O(total nodes), not\n * O(nodes × depth)). Two nodes share a key iff they are structurally identical\n * — including every check, literal value, and error message — so deduplicated\n * schemas produce byte-identical validation and issues.\n */\nfunction keyOf(ir: SchemaIR, memo: Map<SchemaIR, string>): string {\n  const hit = memo.get(ir);\n  if (hit !== undefined) return hit;\n  const obj = ir as unknown as Record<string, unknown>;\n  const key = `{${Object.keys(obj)\n    .filter((k) => obj[k] !== undefined)\n    .sort()\n    .map((k) => `${k}:${encodeValue(obj[k], memo)}`)\n    .join(\",\")}}`;\n  memo.set(ir, key);\n  return key;\n}\n\n/**\n * Encode any IR field value. A nested SchemaIR is detected by a string `type`\n * field (checks carry `kind`, union `cases` carry `value`/`option` — only real\n * schema nodes have `type`) and routed through {@link keyOf} for subtree\n * memoization; everything else is serialized in sorted-key order.\n */\nfunction encodeValue(value: unknown, memo: Map<SchemaIR, string>): string {\n  if (typeof value === \"bigint\") return `#${value}`;\n  if (value === null) return \"null\";\n  // Non-finite numbers must stay distinct: JSON.stringify maps Infinity, -Infinity\n  // and NaN all to \"null\", which would merge e.g. .min(Infinity) with .min(NaN).\n  if (typeof value === \"number\" && !Number.isFinite(value)) return `n!${value}`;\n  if (Array.isArray(value)) return `[${value.map((v) => encodeValue(v, memo)).join(\",\")}]`;\n  if (typeof value === \"object\") {\n    if (typeof (value as { type?: unknown }).type === \"string\") {\n      return keyOf(value as SchemaIR, memo);\n    }\n    const obj = value as Record<string, unknown>;\n    return `{${Object.keys(obj)\n      .filter((k) => obj[k] !== undefined)\n      .sort()\n      .map((k) => `${k}:${encodeValue(obj[k], memo)}`)\n      .join(\",\")}}`;\n  }\n  return JSON.stringify(value) ?? \"undefined\";\n}\n\nfunction cmp(a: string, b: string): number {\n  return a < b ? -1 : a > b ? 1 : 0;\n}\n"],"mappings":";;;;;;;;AAoEA,MAAM,oBAAoB;;AAG1B,MAAa,sBAAsB;AAEnC,MAAM,aAA+B;CACnC,cAAc,KAAA;CACd,MAAM;CACN,6BAAa,IAAI,IAAI;CACrB,SAAS;AACX;;;;;;AAOA,SAAgB,uBACd,OACA,MACkB;CAClB,MAAM,0BAAU,IAAI,IAAsB;CAC1C,MAAM,6BAAa,IAAI,IAAsB;CAC7C,MAAM,wBAAQ,IAAI,IAA6D;CAE/E,KAAK,MAAM,QAAQ,OACjB,QAAQ,MAAM,SAAS,YAAY,KAAK;CAG1C,MAAM,WAAW,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC,CACjC,QACE,MACC,EAAE,SAAS,KACX,EAAE,UAAU,qBACZ,CAAC,qBAAqB,EAAE,EAAE,KAC1B,CAAC,qBAAqB,EAAE,EAAE,CAC9B,CAAC,CAGA,MAAM,GAAG,MAAM,EAAE,SAAS,EAAE,UAAU,IAAI,MAAM,EAAE,IAAI,OAAO,GAAG,MAAM,EAAE,IAAI,OAAO,CAAC,CAAC;CAExF,IAAI,SAAS,WAAW,GAAG,OAAO;CAElC,MAAM,uBAAO,IAAI,IAA6B;CAC9C,SAAS,SAAS,GAAG,MAAM,KAAK,IAAI,MAAM,EAAE,IAAI,OAAO,GAAG,EAAE,MAAM,UAAU,IAAI,CAAC,CAAC;CAElF,MAAM,UAAU,OAA8C,KAAK,IAAI,MAAM,IAAI,OAAO,CAAC;CAEzF,MAAM,MAAsB;EAC1B,UAAU,CAAC;EACX,SAAS;EACT,QAAQ;EACR,4BAAY,IAAI,IAAI;EACpB;EACA,6BAAa,IAAI,IAAI;CACvB;CAKA,IAAI,gBAAgB;EAAE;EAAQ,MAAM;EAAI,aAAa,IAAI;EAAa,SAAS;CAAM;CAErF,MAAM,MAAgB,CAAC;CACvB,KAAK,MAAM,KAAK,UAAU;EACxB,MAAM,MAAM,KAAK,IAAI,MAAM,EAAE,IAAI,OAAO,CAAC;EACzC,IAAI,QAAQ,KAAA,GAAW;EAIvB,MAAM,OAAO,aAAa,EAAE,IAAI,cAAc,SAAS,SAAS,QAAQ,MAAM,GAAG,CAAC;EAMlF,IAAI,KAAK,YAAY,IAAI,KAAK,oBAAoB,KAAK,mBAAmB;CAC5E;CAEA,OAAO;EACL;EACA,MAAM;GAAC;GAAqB,GAAG,IAAI;GAAU,GAAG;EAAG,CAAC,CAAC,KAAK,IAAI;EAC9D,aAAa,IAAI;EACjB,SAAS;CACX;AACF;;;;;;;;;;;AAmBA,SAAS,qBAAqB,IAAuB;CACnD,QAAQ,GAAG,MAAX;EACE,KAAK;EACL,KAAK;EACL,KAAK,YAEH,OAAO;EACT,KAAK;GACH,IAAI,GAAG,aAAa,KAAA,GAAW,OAAO;GACtC;EACF,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;GACH,IAAI,GAAG,QAAQ,MAAM,MAAM,cAAc,KAAK,EAAE,aAAa,KAAA,CAAS,GAAG,OAAO;GAChF;EACF,SACE;CACJ;CACA,OAAO,aAAa,EAAE,CAAC,CAAC,KAAK,oBAAoB;AACnD;AAIA,SAAS,QACP,IACA,SACA,YACA,OACM;CACN,MAAM,MAAM,MAAM,IAAI,OAAO;CAC7B,MAAM,WAAW,MAAM,IAAI,GAAG;CAC9B,IAAI,UACF,SAAS;MAET,MAAM,IAAI,KAAK;EAAE;EAAI,OAAO;EAAG,QAAQ,SAAS,IAAI,UAAU;CAAE,CAAC;CAEnE,KAAK,MAAM,SAAS,aAAa,EAAE,GAAG,QAAQ,OAAO,SAAS,YAAY,KAAK;AACjF;;AAGA,SAAS,aAAa,IAA0B;CAC9C,QAAQ,GAAG,MAAX;EACE,KAAK,UACH,OAAO,OAAO,OAAO,GAAG,UAAU;EACpC,KAAK,SACH,OAAO,CAAC,GAAG,OAAO;EACpB,KAAK,SACH,OAAO,GAAG,SAAS,OAAO,GAAG,QAAQ,CAAC,GAAG,GAAG,OAAO,GAAG,IAAI;EAC5D,KAAK;EACL,KAAK,OACH,OAAO,CAAC,GAAG,SAAS,GAAG,SAAS;EAClC,KAAK,OACH,OAAO,CAAC,GAAG,SAAS;EACtB,KAAK;EACL,KAAK,sBACH,OAAO,GAAG;EACZ,KAAK,gBACH,OAAO,CAAC,GAAG,MAAM,GAAG,KAAK;EAC3B,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,SACH,OAAO,CAAC,GAAG,KAAK;EAClB,KAAK,QACH,OAAO,CAAC,GAAG,IAAI,GAAG,GAAG;EACvB,KAAK;EACL,KAAK,mBACH,OAAO,CAAC,GAAG,KAAK;EAClB,SACE,OAAO,CAAC;CACZ;AACF;;AAGA,SAAS,SAAS,IAAc,MAAqC;CACnE,MAAM,MAAM,KAAK,IAAI,EAAE;CACvB,IAAI,QAAQ,KAAA,GAAW,OAAO;CAC9B,MAAM,SAAU,GAAuC;CACvD,IAAI,SAAS,KAAK,MAAM,QAAQ,MAAM,IAAI,OAAO,SAAS;CAC1D,KAAK,MAAM,SAAS,aAAa,EAAE,GAAG,UAAU,SAAS,OAAO,IAAI;CACpE,KAAK,IAAI,IAAI,MAAM;CACnB,OAAO;AACT;AAEA,SAAS,qBAAqB,IAAuB;CACnD,IAAI,GAAG,SAAS,gBAAgB,OAAO;CACvC,OAAO,aAAa,EAAE,CAAC,CAAC,KAAK,oBAAoB;AACnD;;;;;;;;AAWA,SAAS,MAAM,IAAc,MAAqC;CAChE,MAAM,MAAM,KAAK,IAAI,EAAE;CACvB,IAAI,QAAQ,KAAA,GAAW,OAAO;CAC9B,MAAM,MAAM;CACZ,MAAM,MAAM,IAAI,OAAO,KAAK,GAAG,CAAC,CAC7B,QAAQ,MAAM,IAAI,OAAO,KAAA,CAAS,CAAC,CACnC,KAAK,CAAC,CACN,KAAK,MAAM,GAAG,EAAE,GAAG,YAAY,IAAI,IAAI,IAAI,GAAG,CAAC,CAC/C,KAAK,GAAG,EAAE;CACb,KAAK,IAAI,IAAI,GAAG;CAChB,OAAO;AACT;;;;;;;AAQA,SAAS,YAAY,OAAgB,MAAqC;CACxE,IAAI,OAAO,UAAU,UAAU,OAAO,IAAI;CAC1C,IAAI,UAAU,MAAM,OAAO;CAG3B,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GAAG,OAAO,KAAK;CACtE,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,IAAI,MAAM,KAAK,MAAM,YAAY,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;CACtF,IAAI,OAAO,UAAU,UAAU;EAC7B,IAAI,OAAQ,MAA6B,SAAS,UAChD,OAAO,MAAM,OAAmB,IAAI;EAEtC,MAAM,MAAM;EACZ,OAAO,IAAI,OAAO,KAAK,GAAG,CAAC,CACxB,QAAQ,MAAM,IAAI,OAAO,KAAA,CAAS,CAAC,CACnC,KAAK,CAAC,CACN,KAAK,MAAM,GAAG,EAAE,GAAG,YAAY,IAAI,IAAI,IAAI,GAAG,CAAC,CAC/C,KAAK,GAAG,EAAE;CACf;CACA,OAAO,KAAK,UAAU,KAAK,KAAK;AAClC;AAEA,SAAS,IAAI,GAAW,GAAmB;CACzC,OAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;AAClC"}

package/dist/core/codegen/emit-issue.d.ts

@@ -1,79 +1,55 @@
-/**
- * Issue object emit helpers.
- *
- * Each helper returns a string of the form `_e.push(...)` (or equivalent on a
- * caller-supplied issues variable). Two emit modes:
- *
- *  - inline (CLI .compiled.ts): emits the literal `{code:"too_small",...}` object.
- *  - lean (unplugin): emits a call like `__zcTS(min,origin,inclusive,input,path)`
- *    and registers the helper in `ctx.usedHelpers` so the transform layer can
- *    construct the corresponding `import` from `"virtual:zod-compiler/runtime"`.
- *
- * Centralizing all issue emission here means schema codegen files don't carry
- * the inline/lean branching; they just call `tooSmall(g, ...)` etc.
- *
- * Message resolution mirrors Zod, which consults the error map of the
- * INSTANCE that created the issue:
- *  - check-created issues (min/max/format/refine): per-check message only
- *    (options.message, extracted from `.min(3, "msg")`)
- *  - schema-created issues (invalid_type, enum/literal invalid_value, tuple
- *    length, invalid_union, invalid_key): schema-level message (g.typeMsg,
- *    from `z.string({ error: "msg" })`)
- * Helpers default per the most common call-site kind; size-issue emitters
- * accept `useTypeMsg: true` for node-level uses (tuple), and invalidValue
- * accepts `useTypeMsg: false` for check-level uses (file mime).
- * When no message lands, the __zcFin finalizer applies the locale default.
- */
-import type { CodeGenContext } from "./context.js";
+import { CodeGenContext } from "./context.js";
+//#region src/core/codegen/emit-issue.d.ts
 /** Common slim slice of SlowGen + FastGen needed for issue emission. */
 interface IssueGen {
-    readonly issues: string;
-    readonly input: string;
-    readonly path: string;
-    readonly ctx: CodeGenContext;
-    readonly typeMsg?: string | undefined;
+  readonly issues: string;
+  readonly input: string;
+  readonly path: string;
+  readonly ctx: CodeGenContext;
+  readonly typeMsg?: string | undefined;
 }
-export declare function tooSmall(g: IssueGen, minimum: string | number, origin: string, inclusive: boolean, options?: {
-    exact?: boolean;
-    input?: string;
-    path?: string;
-    message?: string | undefined;
-    /** Set for node-level issues (tuple length) where schema error applies. */
-    useTypeMsg?: boolean;
+declare function tooSmall(g: IssueGen, minimum: string | number, origin: string, inclusive: boolean, options?: {
+  exact?: boolean;
+  input?: string;
+  path?: string;
+  message?: string | undefined;
+  /** Set for node-level issues (tuple length) where schema error applies. */
+  useTypeMsg?: boolean;
 }): string;
-export declare function tooBig(g: IssueGen, maximum: string | number, origin: string, inclusive: boolean, options?: {
-    exact?: boolean;
-    input?: string;
-    path?: string;
-    message?: string | undefined;
-    /** Set for node-level issues (tuple length) where schema error applies. */
-    useTypeMsg?: boolean;
+declare function tooBig(g: IssueGen, maximum: string | number, origin: string, inclusive: boolean, options?: {
+  exact?: boolean;
+  input?: string;
+  path?: string;
+  message?: string | undefined;
+  /** Set for node-level issues (tuple length) where schema error applies. */
+  useTypeMsg?: boolean;
 }): string;
-export declare function invalidType(g: IssueGen, expected: string, options?: {
-    input?: string;
-    path?: string;
-    extra?: string;
-    message?: string | undefined;
+declare function invalidType(g: IssueGen, expected: string, options?: {
+  input?: string;
+  path?: string;
+  extra?: string;
+  message?: string | undefined;
 }): string;
-export declare function invalidFormat(g: IssueGen, format: string | {
-    expr: string;
+declare function invalidFormat(g: IssueGen, format: string | {
+  expr: string;
 }, options?: {
-    input?: string;
-    path?: string;
-    extra?: string;
-    message?: string | undefined;
+  input?: string;
+  path?: string;
+  extra?: string;
+  message?: string | undefined;
 }): string;
-export declare function unrecognizedKeys(g: IssueGen, keysExpr: string, options?: {
-    input?: string;
-    path?: string;
-    message?: string | undefined;
+declare function unrecognizedKeys(g: IssueGen, keysExpr: string, options?: {
+  input?: string;
+  path?: string;
+  message?: string | undefined;
 }): string;
-export declare function invalidValue(g: IssueGen, valuesExpr: string, options?: {
-    input?: string;
-    path?: string;
-    message?: string | undefined;
-    /** Set to false for check-level issues (file mime) where schema error does not apply. */
-    useTypeMsg?: boolean;
+declare function invalidValue(g: IssueGen, valuesExpr: string, options?: {
+  input?: string;
+  path?: string;
+  message?: string | undefined;
+  /** Set to false for check-level issues (file mime) where schema error does not apply. */
+  useTypeMsg?: boolean;
 }): string;
-export {};
+//#endregion
+export { invalidFormat, invalidType, invalidValue, tooBig, tooSmall, unrecognizedKeys };
 //# sourceMappingURL=emit-issue.d.ts.map

package/dist/core/codegen/emit-issue.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"emit-issue.d.ts","sourceRoot":"","sources":["../../../src/core/codegen/emit-issue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAGnD,wEAAwE;AACxE,UAAU,QAAQ;IAChB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,EAAE,cAAc,CAAC;IAC7B,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACvC;AAyBD,wBAAgB,QAAQ,CACtB,CAAC,EAAE,QAAQ,EACX,OAAO,EAAE,MAAM,GAAG,MAAM,EACxB,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,OAAO,EAClB,OAAO,CAAC,EAAE;IACR,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7B,2EAA2E;IAC3E,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB,GACA,MAAM,CA6BR;AAED,wBAAgB,MAAM,CACpB,CAAC,EAAE,QAAQ,EACX,OAAO,EAAE,MAAM,GAAG,MAAM,EACxB,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,OAAO,EAClB,OAAO,CAAC,EAAE;IACR,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7B,2EAA2E;IAC3E,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB,GACA,MAAM,CA6BR;AAED,wBAAgB,WAAW,CACzB,CAAC,EAAE,QAAQ,EACX,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,GACxF,MAAM,CAcR;AAED,wBAAgB,aAAa,CAC3B,CAAC,EAAE,QAAQ,EACX,MAAM,EAAE,MAAM,GAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,EACjC,OAAO,CAAC,EAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,GACxF,MAAM,CAgBR;AAED,wBAAgB,gBAAgB,CAC9B,CAAC,EAAE,QAAQ,EACX,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,GACxE,MAAM,CAaR;AAED,wBAAgB,YAAY,CAC1B,CAAC,EAAE,QAAQ,EACX,UAAU,EAAE,MAAM,EAClB,OAAO,CAAC,EAAE;IACR,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7B,yFAAyF;IACzF,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB,GACA,MAAM,CAaR"}
+{"version":3,"file":"emit-issue.d.ts","names":[],"sources":["../../../src/core/codegen/emit-issue.ts"],"mappings":";;;UA+BU;WACC;WACA;WACA;WACA,KAAK;WACL;;iBA0BK,SACd,GAAG,UACH,0BACA,gBACA,oBACA;EACE;EACA;EACA;EACA;;EAEA;;iBAiCY,OACd,GAAG,UACH,0BACA,gBACA,oBACA;EACE;EACA;EACA;EACA;;EAEA;;iBAiCY,YACd,GAAG,UACH,kBACA;EAAY;EAAgB;EAAe;EAAgB;;iBAiB7C,cACd,GAAG,UACH;EAAmB;GACnB;EAAY;EAAgB;EAAe;EAAgB;;iBAmB7C,iBACd,GAAG,UACH,kBACA;EAAY;EAAgB;EAAe;;iBAgB7B,aACd,GAAG,UACH,oBACA;EACE;EACA;EACA;;EAEA"}