zod-compiler 1.23.0 → 1.23.2

package/dist/core/codegen/schemas/pipe.js

@@ -1,30 +1,23 @@
-export function slowPipe(ir, g) {
-    // zod's handlePipeResult: run `in`; if it produced ANY issue the pipe aborts —
-    // `out` does NOT run, and (inside a union) the option is flagged aborted so it
-    // loses union pruning even when `in`'s only issue is a non-aborting code (e.g.
-    // a `custom` refine). When the pipe is not a union option, `g.aborted` is
-    // undefined and only the short-circuit applies. Capturing the issue count
-    // before `in` detects whether `in` added issues regardless of what they are.
-    const lenVar = g.temp("pl");
-    const inCode = g.visit(ir.in);
-    // Forward `aborted` into `out` too: zod returns the `out` payload directly, so
-    // an abort-bearing `out` (a nested pipe/codec/transform whose own step fails)
-    // must propagate its abort up to this option.
-    const outCode = g.visit(ir.out, { input: g.output, output: g.output, aborted: g.aborted });
-    const abortBranch = g.aborted ? `else{${g.aborted}=true;}` : "";
-    return `var ${lenVar}=${g.issues}.length;\n${inCode}\nif(${g.issues}.length===${lenVar}){${outCode}}${abortBranch}\n`;
+//#region src/core/codegen/schemas/pipe.ts
+function slowPipe(ir, g) {
+	const lenVar = g.temp("pl");
+	const inCode = g.visit(ir.in);
+	const outCode = g.visit(ir.out, {
+		input: g.output,
+		output: g.output,
+		aborted: g.aborted
+	});
+	const abortBranch = g.aborted ? `else{${g.aborted}=true;}` : "";
+	return `var ${lenVar}=${g.issues}.length;\n${inCode}\nif(${g.issues}.length===${lenVar}){${outCode}}${abortBranch}\n`;
 }
-export function fastPipe(ir, g) {
-    // Only eligible if `out` is the same as `in` (non-transform pipe)
-    // We check `in` only — if the pipe has a transform, `out` would be a fallback
-    const inCheck = g.visit(ir.in);
-    if (inCheck === null)
-        return null;
-    // Check if out schema is eligible (non-fallback)
-    const outCheck = g.visit(ir.out);
-    if (outCheck === null)
-        return null;
-    // Both in and out must pass
-    return inCheck === "true" ? outCheck : outCheck === "true" ? inCheck : `${inCheck}&&${outCheck}`;
+function fastPipe(ir, g) {
+	const inCheck = g.visit(ir.in);
+	if (inCheck === null) return null;
+	const outCheck = g.visit(ir.out);
+	if (outCheck === null) return null;
+	return inCheck === "true" ? outCheck : outCheck === "true" ? inCheck : `${inCheck}&&${outCheck}`;
 }
+//#endregion
+export { fastPipe, slowPipe };
+
 //# sourceMappingURL=pipe.js.map

package/dist/core/codegen/schemas/pipe.js.map

@@ -1 +1 @@
-{"version":3,"file":"pipe.js","sourceRoot":"","sources":["../../../../src/core/codegen/schemas/pipe.ts"],"names":[],"mappings":"AAGA,MAAM,UAAU,QAAQ,CAAC,EAA+B,EAAE,CAAU;IAClE,+EAA+E;IAC/E,+EAA+E;IAC/E,+EAA+E;IAC/E,0EAA0E;IAC1E,0EAA0E;IAC1E,6EAA6E;IAC7E,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9B,+EAA+E;IAC/E,8EAA8E;IAC9E,8CAA8C;IAC9C,MAAM,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;IAC3F,MAAM,WAAW,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,OAAO,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;IAChE,OAAO,OAAO,MAAM,IAAI,CAAC,CAAC,MAAM,aAAa,MAAM,QAAQ,CAAC,CAAC,MAAM,aAAa,MAAM,KAAK,OAAO,IAAI,WAAW,IAAI,CAAC;AACxH,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,EAAU,EAAE,CAAU;IAC7C,kEAAkE;IAClE,8EAA8E;IAC9E,MAAM,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC/B,IAAI,OAAO,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAClC,iDAAiD;IACjD,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACjC,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACnC,4BAA4B;IAC5B,OAAO,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,KAAK,QAAQ,EAAE,CAAC;AACnG,CAAC"}
+{"version":3,"file":"pipe.js","names":[],"sources":["../../../../src/core/codegen/schemas/pipe.ts"],"sourcesContent":["import type { PipeIR, SchemaIR } from \"../../types.js\";\nimport type { FastGen, SlowGen } from \"../context.js\";\n\nexport function slowPipe(ir: SchemaIR & { type: \"pipe\" }, g: SlowGen): string {\n  // zod's handlePipeResult: run `in`; if it produced ANY issue the pipe aborts —\n  // `out` does NOT run, and (inside a union) the option is flagged aborted so it\n  // loses union pruning even when `in`'s only issue is a non-aborting code (e.g.\n  // a `custom` refine). When the pipe is not a union option, `g.aborted` is\n  // undefined and only the short-circuit applies. Capturing the issue count\n  // before `in` detects whether `in` added issues regardless of what they are.\n  const lenVar = g.temp(\"pl\");\n  const inCode = g.visit(ir.in);\n  // Forward `aborted` into `out` too: zod returns the `out` payload directly, so\n  // an abort-bearing `out` (a nested pipe/codec/transform whose own step fails)\n  // must propagate its abort up to this option.\n  const outCode = g.visit(ir.out, { input: g.output, output: g.output, aborted: g.aborted });\n  const abortBranch = g.aborted ? `else{${g.aborted}=true;}` : \"\";\n  return `var ${lenVar}=${g.issues}.length;\\n${inCode}\\nif(${g.issues}.length===${lenVar}){${outCode}}${abortBranch}\\n`;\n}\n\nexport function fastPipe(ir: PipeIR, g: FastGen): string | null {\n  // Only eligible if `out` is the same as `in` (non-transform pipe)\n  // We check `in` only — if the pipe has a transform, `out` would be a fallback\n  const inCheck = g.visit(ir.in);\n  if (inCheck === null) return null;\n  // Check if out schema is eligible (non-fallback)\n  const outCheck = g.visit(ir.out);\n  if (outCheck === null) return null;\n  // Both in and out must pass\n  return inCheck === \"true\" ? outCheck : outCheck === \"true\" ? inCheck : `${inCheck}&&${outCheck}`;\n}\n"],"mappings":";AAGA,SAAgB,SAAS,IAAiC,GAAoB;CAO5E,MAAM,SAAS,EAAE,KAAK,IAAI;CAC1B,MAAM,SAAS,EAAE,MAAM,GAAG,EAAE;CAI5B,MAAM,UAAU,EAAE,MAAM,GAAG,KAAK;EAAE,OAAO,EAAE;EAAQ,QAAQ,EAAE;EAAQ,SAAS,EAAE;CAAQ,CAAC;CACzF,MAAM,cAAc,EAAE,UAAU,QAAQ,EAAE,QAAQ,WAAW;CAC7D,OAAO,OAAO,OAAO,GAAG,EAAE,OAAO,YAAY,OAAO,OAAO,EAAE,OAAO,YAAY,OAAO,IAAI,QAAQ,GAAG,YAAY;AACpH;AAEA,SAAgB,SAAS,IAAY,GAA2B;CAG9D,MAAM,UAAU,EAAE,MAAM,GAAG,EAAE;CAC7B,IAAI,YAAY,MAAM,OAAO;CAE7B,MAAM,WAAW,EAAE,MAAM,GAAG,GAAG;CAC/B,IAAI,aAAa,MAAM,OAAO;CAE9B,OAAO,YAAY,SAAS,WAAW,aAAa,SAAS,UAAU,GAAG,QAAQ,IAAI;AACxF"}

package/dist/core/codegen/schemas/readonly.d.ts

@@ -1,7 +1,10 @@
-import type { ReadonlyIR, SchemaIR } from "../../types.js";
-import type { FastGen, SlowGen } from "../context.js";
-export declare function slowReadonly(ir: SchemaIR & {
-    type: "readonly";
+import { ReadonlyIR, SchemaIR } from "../../types.js";
+import { FastGen, SlowGen } from "../context.js";
+//#region src/core/codegen/schemas/readonly.d.ts
+declare function slowReadonly(ir: SchemaIR & {
+  type: "readonly";
 }, g: SlowGen): string;
-export declare function fastReadonly(ir: ReadonlyIR, g: FastGen): string | null;
+declare function fastReadonly(ir: ReadonlyIR, g: FastGen): string | null;
+//#endregion
+export { fastReadonly, slowReadonly };
 //# sourceMappingURL=readonly.d.ts.map

package/dist/core/codegen/schemas/readonly.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"readonly.d.ts","sourceRoot":"","sources":["../../../../src/core/codegen/schemas/readonly.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC3D,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAEtD,wBAAgB,YAAY,CAAC,EAAE,EAAE,QAAQ,GAAG;IAAE,IAAI,EAAE,UAAU,CAAA;CAAE,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,CAGpF;AAED,wBAAgB,YAAY,CAAC,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAEtE"}
+{"version":3,"file":"readonly.d.ts","names":[],"sources":["../../../../src/core/codegen/schemas/readonly.ts"],"mappings":";;;iBAGgB,aAAa,IAAI;EAAa;GAAoB,GAAG;iBAKrD,aAAa,IAAI,YAAY,GAAG"}

package/dist/core/codegen/schemas/readonly.js

@@ -1,8 +1,11 @@
-export function slowReadonly(ir, g) {
-    // Pass-through wrapper: forward the union abort flag (see slowOptional).
-    return g.visit(ir.inner, { aborted: g.aborted });
+//#region src/core/codegen/schemas/readonly.ts
+function slowReadonly(ir, g) {
+	return g.visit(ir.inner, { aborted: g.aborted });
 }
-export function fastReadonly(ir, g) {
-    return g.visit(ir.inner);
+function fastReadonly(ir, g) {
+	return g.visit(ir.inner);
 }
+//#endregion
+export { fastReadonly, slowReadonly };
+
 //# sourceMappingURL=readonly.js.map

package/dist/core/codegen/schemas/readonly.js.map

@@ -1 +1 @@
-{"version":3,"file":"readonly.js","sourceRoot":"","sources":["../../../../src/core/codegen/schemas/readonly.ts"],"names":[],"mappings":"AAGA,MAAM,UAAU,YAAY,CAAC,EAAmC,EAAE,CAAU;IAC1E,yEAAyE;IACzE,OAAO,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;AACnD,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,EAAc,EAAE,CAAU;IACrD,OAAO,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC"}
+{"version":3,"file":"readonly.js","names":[],"sources":["../../../../src/core/codegen/schemas/readonly.ts"],"sourcesContent":["import type { ReadonlyIR, SchemaIR } from \"../../types.js\";\nimport type { FastGen, SlowGen } from \"../context.js\";\n\nexport function slowReadonly(ir: SchemaIR & { type: \"readonly\" }, g: SlowGen): string {\n  // Pass-through wrapper: forward the union abort flag (see slowOptional).\n  return g.visit(ir.inner, { aborted: g.aborted });\n}\n\nexport function fastReadonly(ir: ReadonlyIR, g: FastGen): string | null {\n  return g.visit(ir.inner);\n}\n"],"mappings":";AAGA,SAAgB,aAAa,IAAqC,GAAoB;CAEpF,OAAO,EAAE,MAAM,GAAG,OAAO,EAAE,SAAS,EAAE,QAAQ,CAAC;AACjD;AAEA,SAAgB,aAAa,IAAgB,GAA2B;CACtE,OAAO,EAAE,MAAM,GAAG,KAAK;AACzB"}

package/dist/core/codegen/schemas/record.d.ts

@@ -1,7 +1,10 @@
-import type { RecordIR, SchemaIR } from "../../types.js";
-import type { FastGen, SlowGen } from "../context.js";
-export declare function slowRecord(ir: SchemaIR & {
-    type: "record";
+import { RecordIR, SchemaIR } from "../../types.js";
+import { FastGen, SlowGen } from "../context.js";
+//#region src/core/codegen/schemas/record.d.ts
+declare function slowRecord(ir: SchemaIR & {
+  type: "record";
 }, g: SlowGen): string;
-export declare function fastRecord(ir: RecordIR, g: FastGen): string | null;
+declare function fastRecord(ir: RecordIR, g: FastGen): string | null;
+//#endregion
+export { fastRecord, slowRecord };
 //# sourceMappingURL=record.d.ts.map

package/dist/core/codegen/schemas/record.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"record.d.ts","sourceRoot":"","sources":["../../../../src/core/codegen/schemas/record.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AACzD,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAMtD,wBAAgB,UAAU,CAAC,EAAE,EAAE,QAAQ,GAAG;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,CA2ChF;AAED,wBAAgB,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CA0ClE"}
+{"version":3,"file":"record.d.ts","names":[],"sources":["../../../../src/core/codegen/schemas/record.ts"],"mappings":";;;iBAOgB,WAAW,IAAI;EAAa;GAAkB,GAAG;iBA6CjD,WAAW,IAAI,UAAU,GAAG"}

package/dist/core/codegen/schemas/record.js

@@ -2,82 +2,69 @@ import { declareFastTemps, emitRuntimeHelper, extendPath, hasMutation } from "..
 import { emit } from "../emit.js";
 import { invalidType } from "../emit-issue.js";
 import { ZC_FZ_DECL, ZC_HOP_DECL } from "../issue-decls.js";
-export function slowRecord(ir, g) {
-    let code = emit `
+//#region src/core/codegen/schemas/record.ts
+function slowRecord(ir, g) {
+	let code = emit`
     if(typeof ${g.input}!=="object"||${g.input}===null||Array.isArray(${g.input})){
       ${invalidType(g, "record")}
     }else{`;
-    if (hasMutation(ir.valueType)) {
-        code += `${g.output}={...${g.input}};`;
-    }
-    const keyVar = g.temp("rkey");
-    const keyIssuesVar = g.temp("rki");
-    const keyPath = extendPath(g.path, keyVar);
-    const valExpr = `${g.input}[${keyVar}]`;
-    // for-in + hasOwnProperty guard instead of Object.keys(): identical
-    // own-enumerable string-key set and iteration order, no keys-array
-    // allocation. When the value type mutates (coerce/default/.trim()) the clone
-    // above has already replaced g.input, so this iterates the clone exactly as
-    // the Object.keys form did — the key set is stable (values change, keys
-    // don't). Records whose values mutate run this path eagerly, so they get the
-    // same speedup the fast path does.
-    const hop = emitRuntimeHelper(g.ctx, "__zcHop", ZC_HOP_DECL);
-    // The key is validated at a RELATIVE path and its issues are finalized before
-    // being nested, mirroring zod: `issues: keyResult.issues.map(finalizeIssue)`
-    // over a payload zod ran fresh. Nested issues never reach the top-level
-    // finalization loop (it walks only the outer array), so an unfinalized nest
-    // leaked absolute paths and the raw `input` into the reported error.
-    const fz = emitRuntimeHelper(g.ctx, "__zcFz", ZC_FZ_DECL);
-    code += emit `
+	if (hasMutation(ir.valueType)) code += `${g.output}={...${g.input}};`;
+	const keyVar = g.temp("rkey");
+	const keyIssuesVar = g.temp("rki");
+	const keyPath = extendPath(g.path, keyVar);
+	const valExpr = `${g.input}[${keyVar}]`;
+	const hop = emitRuntimeHelper(g.ctx, "__zcHop", ZC_HOP_DECL);
+	const fz = emitRuntimeHelper(g.ctx, "__zcFz", ZC_FZ_DECL);
+	code += emit`
     for(var ${keyVar} in ${g.input}){
       if(!${hop}.call(${g.input},${keyVar}))continue;
       var ${keyIssuesVar}=[];
-      ${g.visit(ir.keyType, { input: keyVar, output: keyVar, path: "[]", issues: keyIssuesVar })}
+      ${g.visit(ir.keyType, {
+		input: keyVar,
+		output: keyVar,
+		path: "[]",
+		issues: keyIssuesVar
+	})}
       if(${keyIssuesVar}.length>0){
-        ${g.issues}.push({code:"invalid_key",origin:"record"${g.typeMsg === undefined ? "" : `,message:${JSON.stringify(g.typeMsg)}`},input:${keyVar},path:${keyPath},issues:${fz}(${keyIssuesVar})});
+        ${g.issues}.push({code:"invalid_key",origin:"record"${g.typeMsg === void 0 ? "" : `,message:${JSON.stringify(g.typeMsg)}`},input:${keyVar},path:${keyPath},issues:${fz}(${keyIssuesVar})});
       }else{
-        ${g.visit(ir.valueType, { input: valExpr, output: valExpr, path: keyPath })}
+        ${g.visit(ir.valueType, {
+		input: valExpr,
+		output: valExpr,
+		path: keyPath
+	})}
       }
     }
   }`;
-    return `${code}\n`;
+	return `${code}\n`;
 }
-export function fastRecord(ir, g) {
-    const x = g.input;
-    const parts = [`typeof ${x}==="object"`, `${x}!==null`, `!Array.isArray(${x})`];
-    // Object.keys only yields strings — a plain unconstrained string key schema
-    // is always satisfied, so skip generating its check entirely.
-    const plainStringKey = ir.keyType.type === "string" && ir.keyType.checks.length === 0 && ir.keyType.coerce !== true;
-    const kv = g.temp("rk");
-    const vv = g.temp("rv");
-    // Key + value checks share one fresh scope — they live in the same emitted
-    // helper function, size-gated independently of the caller.
-    const body = g.scoped(kv);
-    const keyCheck = plainStringKey ? "true" : body.visit(ir.keyType, { input: kv });
-    // Hoist o[k] into a loop variable: computed-key lookups don't get V8's load
-    // elimination across check boundaries, so each repeated o[k] would re-walk
-    // the (often dictionary-mode) object.
-    const valCheck = body.visit(ir.valueType, { input: vv });
-    if (keyCheck === null || valCheck === null)
-        return null;
-    const conditions = [];
-    if (keyCheck !== "true")
-        conditions.push(keyCheck);
-    if (valCheck !== "true")
-        conditions.push(valCheck);
-    if (conditions.length > 0) {
-        const helperName = g.temp("rf");
-        const valAssign = valCheck !== "true" ? `${vv}=o[${kv}];` : "";
-        // for-in (no Object.keys array allocation) + hasOwnProperty guard. The
-        // guard restricts iteration to own enumerable string keys — the exact set
-        // Object.keys/the slow path produce — so inherited enumerable props can't
-        // make the fast check disagree with the deferred slow walk. Measured 2.9x
-        // (5 keys) to 5.8x (20 keys) faster than the Object.keys form; the hoisted
-        // __zcHop.call inlines, making the guard ~free vs an unguarded for-in.
-        const hop = emitRuntimeHelper(g.ctx, "__zcHop", ZC_HOP_DECL);
-        g.ctx.preamble.push(`function ${helperName}(o){${declareFastTemps(body.scope)}var ${kv},${vv};for(${kv} in o){if(${hop}.call(o,${kv})){${valAssign}if(!(${conditions.join("&&")})){return false;}}}return true;}`);
-        parts.push(`${helperName}(${x})`);
-    }
-    return parts.join("&&");
+function fastRecord(ir, g) {
+	const x = g.input;
+	const parts = [
+		`typeof ${x}==="object"`,
+		`${x}!==null`,
+		`!Array.isArray(${x})`
+	];
+	const plainStringKey = ir.keyType.type === "string" && ir.keyType.checks.length === 0 && ir.keyType.coerce !== true;
+	const kv = g.temp("rk");
+	const vv = g.temp("rv");
+	const body = g.scoped(kv);
+	const keyCheck = plainStringKey ? "true" : body.visit(ir.keyType, { input: kv });
+	const valCheck = body.visit(ir.valueType, { input: vv });
+	if (keyCheck === null || valCheck === null) return null;
+	const conditions = [];
+	if (keyCheck !== "true") conditions.push(keyCheck);
+	if (valCheck !== "true") conditions.push(valCheck);
+	if (conditions.length > 0) {
+		const helperName = g.temp("rf");
+		const valAssign = valCheck !== "true" ? `${vv}=o[${kv}];` : "";
+		const hop = emitRuntimeHelper(g.ctx, "__zcHop", ZC_HOP_DECL);
+		g.ctx.preamble.push(`function ${helperName}(o){${declareFastTemps(body.scope)}var ${kv},${vv};for(${kv} in o){if(${hop}.call(o,${kv})){${valAssign}if(!(${conditions.join("&&")})){return false;}}}return true;}`);
+		parts.push(`${helperName}(${x})`);
+	}
+	return parts.join("&&");
 }
+//#endregion
+export { fastRecord, slowRecord };
+
 //# sourceMappingURL=record.js.map

package/dist/core/codegen/schemas/record.js.map

@@ -1 +1 @@
-{"version":3,"file":"record.js","sourceRoot":"","sources":["../../../../src/core/codegen/schemas/record.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC7F,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAClC,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAC/C,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAE5D,MAAM,UAAU,UAAU,CAAC,EAAiC,EAAE,CAAU;IACtE,IAAI,IAAI,GAAG,IAAI,CAAA;gBACD,CAAC,CAAC,KAAK,gBAAgB,CAAC,CAAC,KAAK,0BAA0B,CAAC,CAAC,KAAK;QACvE,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC;WACrB,CAAC;IAEV,IAAI,WAAW,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;QAC9B,IAAI,IAAI,GAAG,CAAC,CAAC,MAAM,QAAQ,CAAC,CAAC,KAAK,IAAI,CAAC;IACzC,CAAC;IAED,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,MAAM,YAAY,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC3C,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,KAAK,IAAI,MAAM,GAAG,CAAC;IACxC,oEAAoE;IACpE,mEAAmE;IACnE,6EAA6E;IAC7E,4EAA4E;IAC5E,wEAAwE;IACxE,6EAA6E;IAC7E,mCAAmC;IACnC,MAAM,GAAG,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;IAE7D,8EAA8E;IAC9E,6EAA6E;IAC7E,wEAAwE;IACxE,4EAA4E;IAC5E,qEAAqE;IACrE,MAAM,EAAE,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;IAE1D,IAAI,IAAI,IAAI,CAAA;cACA,MAAM,OAAO,CAAC,CAAC,KAAK;YACtB,GAAG,SAAS,CAAC,CAAC,KAAK,IAAI,MAAM;YAC7B,YAAY;QAChB,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;WACrF,YAAY;UACb,CAAC,CAAC,MAAM,4CAA4C,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,UAAU,MAAM,SAAS,OAAO,WAAW,EAAE,IAAI,YAAY;;UAEvL,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,SAAS,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;;;IAG/E,CAAC;IACH,OAAO,GAAG,IAAI,IAAI,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,EAAY,EAAE,CAAU;IACjD,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IAClB,MAAM,KAAK,GAAa,CAAC,UAAU,CAAC,aAAa,EAAE,GAAG,CAAC,SAAS,EAAE,kBAAkB,CAAC,GAAG,CAAC,CAAC;IAE1F,4EAA4E;IAC5E,8DAA8D;IAC9D,MAAM,cAAc,GAClB,EAAE,CAAC,OAAO,CAAC,IAAI,KAAK,QAAQ,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC;IAE/F,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,2EAA2E;IAC3E,2DAA2D;IAC3D,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC1B,MAAM,QAAQ,GAAG,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;IACjF,4EAA4E;IAC5E,2EAA2E;IAC3E,sCAAsC;IACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,SAAS,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;IACzD,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAExD,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,IAAI,QAAQ,KAAK,MAAM;QAAE,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnD,IAAI,QAAQ,KAAK,MAAM;QAAE,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAEnD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,SAAS,GAAG,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/D,uEAAuE;QACvE,0EAA0E;QAC1E,0EAA0E;QAC1E,0EAA0E;QAC1E,2EAA2E;QAC3E,uEAAuE;QACvE,MAAM,GAAG,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;QAC7D,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CACjB,YAAY,UAAU,OAAO,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,aAAa,GAAG,WAAW,EAAE,MAAM,SAAS,QAAQ,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,kCAAkC,CAC9L,CAAC;QACF,KAAK,CAAC,IAAI,CAAC,GAAG,UAAU,IAAI,CAAC,GAAG,CAAC,CAAC;IACpC,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}
+{"version":3,"file":"record.js","names":[],"sources":["../../../../src/core/codegen/schemas/record.ts"],"sourcesContent":["import type { RecordIR, SchemaIR } from \"../../types.js\";\nimport type { FastGen, SlowGen } from \"../context.js\";\nimport { declareFastTemps, emitRuntimeHelper, extendPath, hasMutation } from \"../context.js\";\nimport { emit } from \"../emit.js\";\nimport { invalidType } from \"../emit-issue.js\";\nimport { ZC_FZ_DECL, ZC_HOP_DECL } from \"../issue-decls.js\";\n\nexport function slowRecord(ir: SchemaIR & { type: \"record\" }, g: SlowGen): string {\n  let code = emit`\n    if(typeof ${g.input}!==\"object\"||${g.input}===null||Array.isArray(${g.input})){\n      ${invalidType(g, \"record\")}\n    }else{`;\n\n  if (hasMutation(ir.valueType)) {\n    code += `${g.output}={...${g.input}};`;\n  }\n\n  const keyVar = g.temp(\"rkey\");\n  const keyIssuesVar = g.temp(\"rki\");\n  const keyPath = extendPath(g.path, keyVar);\n  const valExpr = `${g.input}[${keyVar}]`;\n  // for-in + hasOwnProperty guard instead of Object.keys(): identical\n  // own-enumerable string-key set and iteration order, no keys-array\n  // allocation. When the value type mutates (coerce/default/.trim()) the clone\n  // above has already replaced g.input, so this iterates the clone exactly as\n  // the Object.keys form did — the key set is stable (values change, keys\n  // don't). Records whose values mutate run this path eagerly, so they get the\n  // same speedup the fast path does.\n  const hop = emitRuntimeHelper(g.ctx, \"__zcHop\", ZC_HOP_DECL);\n\n  // The key is validated at a RELATIVE path and its issues are finalized before\n  // being nested, mirroring zod: `issues: keyResult.issues.map(finalizeIssue)`\n  // over a payload zod ran fresh. Nested issues never reach the top-level\n  // finalization loop (it walks only the outer array), so an unfinalized nest\n  // leaked absolute paths and the raw `input` into the reported error.\n  const fz = emitRuntimeHelper(g.ctx, \"__zcFz\", ZC_FZ_DECL);\n\n  code += emit`\n    for(var ${keyVar} in ${g.input}){\n      if(!${hop}.call(${g.input},${keyVar}))continue;\n      var ${keyIssuesVar}=[];\n      ${g.visit(ir.keyType, { input: keyVar, output: keyVar, path: \"[]\", issues: keyIssuesVar })}\n      if(${keyIssuesVar}.length>0){\n        ${g.issues}.push({code:\"invalid_key\",origin:\"record\"${g.typeMsg === undefined ? \"\" : `,message:${JSON.stringify(g.typeMsg)}`},input:${keyVar},path:${keyPath},issues:${fz}(${keyIssuesVar})});\n      }else{\n        ${g.visit(ir.valueType, { input: valExpr, output: valExpr, path: keyPath })}\n      }\n    }\n  }`;\n  return `${code}\\n`;\n}\n\nexport function fastRecord(ir: RecordIR, g: FastGen): string | null {\n  const x = g.input;\n  const parts: string[] = [`typeof ${x}===\"object\"`, `${x}!==null`, `!Array.isArray(${x})`];\n\n  // Object.keys only yields strings — a plain unconstrained string key schema\n  // is always satisfied, so skip generating its check entirely.\n  const plainStringKey =\n    ir.keyType.type === \"string\" && ir.keyType.checks.length === 0 && ir.keyType.coerce !== true;\n\n  const kv = g.temp(\"rk\");\n  const vv = g.temp(\"rv\");\n  // Key + value checks share one fresh scope — they live in the same emitted\n  // helper function, size-gated independently of the caller.\n  const body = g.scoped(kv);\n  const keyCheck = plainStringKey ? \"true\" : body.visit(ir.keyType, { input: kv });\n  // Hoist o[k] into a loop variable: computed-key lookups don't get V8's load\n  // elimination across check boundaries, so each repeated o[k] would re-walk\n  // the (often dictionary-mode) object.\n  const valCheck = body.visit(ir.valueType, { input: vv });\n  if (keyCheck === null || valCheck === null) return null;\n\n  const conditions: string[] = [];\n  if (keyCheck !== \"true\") conditions.push(keyCheck);\n  if (valCheck !== \"true\") conditions.push(valCheck);\n\n  if (conditions.length > 0) {\n    const helperName = g.temp(\"rf\");\n    const valAssign = valCheck !== \"true\" ? `${vv}=o[${kv}];` : \"\";\n    // for-in (no Object.keys array allocation) + hasOwnProperty guard. The\n    // guard restricts iteration to own enumerable string keys — the exact set\n    // Object.keys/the slow path produce — so inherited enumerable props can't\n    // make the fast check disagree with the deferred slow walk. Measured 2.9x\n    // (5 keys) to 5.8x (20 keys) faster than the Object.keys form; the hoisted\n    // __zcHop.call inlines, making the guard ~free vs an unguarded for-in.\n    const hop = emitRuntimeHelper(g.ctx, \"__zcHop\", ZC_HOP_DECL);\n    g.ctx.preamble.push(\n      `function ${helperName}(o){${declareFastTemps(body.scope)}var ${kv},${vv};for(${kv} in o){if(${hop}.call(o,${kv})){${valAssign}if(!(${conditions.join(\"&&\")})){return false;}}}return true;}`,\n    );\n    parts.push(`${helperName}(${x})`);\n  }\n\n  return parts.join(\"&&\");\n}\n"],"mappings":";;;;;AAOA,SAAgB,WAAW,IAAmC,GAAoB;CAChF,IAAI,OAAO,IAAI;gBACD,EAAE,MAAM,eAAe,EAAE,MAAM,yBAAyB,EAAE,MAAM;QACxE,YAAY,GAAG,QAAQ,EAAE;;CAG/B,IAAI,YAAY,GAAG,SAAS,GAC1B,QAAQ,GAAG,EAAE,OAAO,OAAO,EAAE,MAAM;CAGrC,MAAM,SAAS,EAAE,KAAK,MAAM;CAC5B,MAAM,eAAe,EAAE,KAAK,KAAK;CACjC,MAAM,UAAU,WAAW,EAAE,MAAM,MAAM;CACzC,MAAM,UAAU,GAAG,EAAE,MAAM,GAAG,OAAO;CAQrC,MAAM,MAAM,kBAAkB,EAAE,KAAK,WAAW,WAAW;CAO3D,MAAM,KAAK,kBAAkB,EAAE,KAAK,UAAU,UAAU;CAExD,QAAQ,IAAI;cACA,OAAO,MAAM,EAAE,MAAM;YACvB,IAAI,QAAQ,EAAE,MAAM,GAAG,OAAO;YAC9B,aAAa;QACjB,EAAE,MAAM,GAAG,SAAS;EAAE,OAAO;EAAQ,QAAQ;EAAQ,MAAM;EAAM,QAAQ;CAAa,CAAC,EAAE;WACtF,aAAa;UACd,EAAE,OAAO,2CAA2C,EAAE,YAAY,KAAA,IAAY,KAAK,YAAY,KAAK,UAAU,EAAE,OAAO,IAAI,SAAS,OAAO,QAAQ,QAAQ,UAAU,GAAG,GAAG,aAAa;;UAExL,EAAE,MAAM,GAAG,WAAW;EAAE,OAAO;EAAS,QAAQ;EAAS,MAAM;CAAQ,CAAC,EAAE;;;;CAIlF,OAAO,GAAG,KAAK;AACjB;AAEA,SAAgB,WAAW,IAAc,GAA2B;CAClE,MAAM,IAAI,EAAE;CACZ,MAAM,QAAkB;EAAC,UAAU,EAAE;EAAc,GAAG,EAAE;EAAU,kBAAkB,EAAE;CAAE;CAIxF,MAAM,iBACJ,GAAG,QAAQ,SAAS,YAAY,GAAG,QAAQ,OAAO,WAAW,KAAK,GAAG,QAAQ,WAAW;CAE1F,MAAM,KAAK,EAAE,KAAK,IAAI;CACtB,MAAM,KAAK,EAAE,KAAK,IAAI;CAGtB,MAAM,OAAO,EAAE,OAAO,EAAE;CACxB,MAAM,WAAW,iBAAiB,SAAS,KAAK,MAAM,GAAG,SAAS,EAAE,OAAO,GAAG,CAAC;CAI/E,MAAM,WAAW,KAAK,MAAM,GAAG,WAAW,EAAE,OAAO,GAAG,CAAC;CACvD,IAAI,aAAa,QAAQ,aAAa,MAAM,OAAO;CAEnD,MAAM,aAAuB,CAAC;CAC9B,IAAI,aAAa,QAAQ,WAAW,KAAK,QAAQ;CACjD,IAAI,aAAa,QAAQ,WAAW,KAAK,QAAQ;CAEjD,IAAI,WAAW,SAAS,GAAG;EACzB,MAAM,aAAa,EAAE,KAAK,IAAI;EAC9B,MAAM,YAAY,aAAa,SAAS,GAAG,GAAG,KAAK,GAAG,MAAM;EAO5D,MAAM,MAAM,kBAAkB,EAAE,KAAK,WAAW,WAAW;EAC3D,EAAE,IAAI,SAAS,KACb,YAAY,WAAW,MAAM,iBAAiB,KAAK,KAAK,EAAE,MAAM,GAAG,GAAG,GAAG,OAAO,GAAG,YAAY,IAAI,UAAU,GAAG,KAAK,UAAU,OAAO,WAAW,KAAK,IAAI,EAAE,iCAC9J;EACA,MAAM,KAAK,GAAG,WAAW,GAAG,EAAE,EAAE;CAClC;CAEA,OAAO,MAAM,KAAK,IAAI;AACxB"}

package/dist/core/codegen/schemas/recursive-ref.d.ts

@@ -1,12 +1,15 @@
-import type { RecursionTargetIR, RecursiveRefIR } from "../../types.js";
-import type { FastGen, SlowGen } from "../context.js";
-export declare function slowRecursiveRef(ir: RecursiveRefIR, g: SlowGen): string;
-export declare function fastRecursiveRef(ir: RecursiveRefIR, g: FastGen): string | null;
+import { RecursionTargetIR, RecursiveRefIR } from "../../types.js";
+import { FastGen, SlowGen } from "../context.js";
+//#region src/core/codegen/schemas/recursive-ref.d.ts
+declare function slowRecursiveRef(ir: RecursiveRefIR, g: SlowGen): string;
+declare function fastRecursiveRef(ir: RecursiveRefIR, g: FastGen): string | null;
 /**
  * In-place site of a non-root recursion target (the recursive sub-schema where
  * it sits in the larger tree). Validating it = calling its hosted validator,
  * exactly like a back-edge, so both reuse the recursion-call emitters.
  */
-export declare function slowRecursionTarget(ir: RecursionTargetIR, g: SlowGen): string;
-export declare function fastRecursionTarget(ir: RecursionTargetIR, g: FastGen): string | null;
+declare function slowRecursionTarget(ir: RecursionTargetIR, g: SlowGen): string;
+declare function fastRecursionTarget(ir: RecursionTargetIR, g: FastGen): string | null;
+//#endregion
+export { fastRecursionTarget, fastRecursiveRef, slowRecursionTarget, slowRecursiveRef };
 //# sourceMappingURL=recursive-ref.d.ts.map

package/dist/core/codegen/schemas/recursive-ref.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"recursive-ref.d.ts","sourceRoot":"","sources":["../../../../src/core/codegen/schemas/recursive-ref.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AACxE,OAAO,KAAK,EAAkB,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAyDtE,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,CAEvE;AAED,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAE9E;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,iBAAiB,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,CAE7E;AAED,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,iBAAiB,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAEpF"}
+{"version":3,"file":"recursive-ref.d.ts","names":[],"sources":["../../../../src/core/codegen/schemas/recursive-ref.ts"],"mappings":";;;iBA0DgB,iBAAiB,IAAI,gBAAgB,GAAG;iBAIxC,iBAAiB,IAAI,gBAAgB,GAAG;;;;;;iBASxC,oBAAoB,IAAI,mBAAmB,GAAG;iBAI9C,oBAAoB,IAAI,mBAAmB,GAAG"}

package/dist/core/codegen/schemas/recursive-ref.js

@@ -1,25 +1,26 @@
 import { emit } from "../emit.js";
+//#region src/core/codegen/schemas/recursive-ref.ts
 /**
- * Resolve the slow (safeParse-shaped) validator name for a recursion target.
- * refId 0 / no table ⇒ the root, which is the schema's own `safeParse_<name>`.
- */
+* Resolve the slow (safeParse-shaped) validator name for a recursion target.
+* refId 0 / no table ⇒ the root, which is the schema's own `safeParse_<name>`.
+*/
 function slowTargetName(ctx, refId) {
-    const t = ctx.recTargets?.get(refId ?? 0);
-    return t && !t.isRoot ? t.slowName : ctx.fnName;
+	const t = ctx.recTargets?.get(refId ?? 0);
+	return t && !t.isRoot ? t.slowName : ctx.fnName;
 }
 /**
- * Emit a recursion call on the slow (issue-collecting) path: invoke the hosted
- * validator for the target shape, then either merge its issues with the current
- * path prefix or write back its (possibly mutated) data. Shared by both the
- * back-edge (`recursiveRef`) and the in-place target site (`recursionTarget`).
- */
+* Emit a recursion call on the slow (issue-collecting) path: invoke the hosted
+* validator for the target shape, then either merge its issues with the current
+* path prefix or write back its (possibly mutated) data. Shared by both the
+* back-edge (`recursiveRef`) and the in-place target site (`recursionTarget`).
+*/
 function slowRecursionCall(refId, g) {
-    const fn = slowTargetName(g.ctx, refId);
-    const n = g.ctx.counter++;
-    const rVar = `__rec_r${n}`;
-    const iVar = `__rec_i${n}`;
-    const jVar = `__rec_j${n}`;
-    return `${emit `
+	const fn = slowTargetName(g.ctx, refId);
+	const n = g.ctx.counter++;
+	const rVar = `__rec_r${n}`;
+	const iVar = `__rec_i${n}`;
+	const jVar = `__rec_j${n}`;
+	return `${emit`
     var ${rVar}=${fn}(${g.input});
     if(!${rVar}.success){
       var ${iVar}=${rVar}.error.issues;
@@ -33,39 +34,38 @@ function slowRecursionCall(refId, g) {
   `}\n`;
 }
 /**
- * Resolve the fast (boolean) validator name for a recursion target, allocating
- * the root's lazily (mirrors the historical single-target behavior). Returns a
- * call expression on the target's hosted fast-check.
- */
+* Resolve the fast (boolean) validator name for a recursion target, allocating
+* the root's lazily (mirrors the historical single-target behavior). Returns a
+* call expression on the target's hosted fast-check.
+*/
 function fastRecursionCall(refId, g) {
-    const ctx = g.ctx;
-    const t = ctx.recTargets?.get(refId ?? 0);
-    if (!t || t.isRoot) {
-        // Root recursion (refId 0, or a standalone generator call with no table):
-        // the root fast expression is hosted under this name by generateValidator.
-        ctx.recFastName ??= `__fcr_${ctx.counter++}`;
-        if (t)
-            t.fastName = ctx.recFastName;
-        return `${ctx.recFastName}(${g.input})`;
-    }
-    // Non-root target: name pre-allocated by generateValidator before the walk.
-    return `${t.fastName}(${g.input})`;
+	const ctx = g.ctx;
+	const t = ctx.recTargets?.get(refId ?? 0);
+	if (!t || t.isRoot) {
+		ctx.recFastName ??= `__fcr_${ctx.counter++}`;
+		if (t) t.fastName = ctx.recFastName;
+		return `${ctx.recFastName}(${g.input})`;
+	}
+	return `${t.fastName}(${g.input})`;
 }
-export function slowRecursiveRef(ir, g) {
-    return slowRecursionCall(ir.refId, g);
+function slowRecursiveRef(ir, g) {
+	return slowRecursionCall(ir.refId, g);
 }
-export function fastRecursiveRef(ir, g) {
-    return fastRecursionCall(ir.refId, g);
+function fastRecursiveRef(ir, g) {
+	return fastRecursionCall(ir.refId, g);
 }
 /**
- * In-place site of a non-root recursion target (the recursive sub-schema where
- * it sits in the larger tree). Validating it = calling its hosted validator,
- * exactly like a back-edge, so both reuse the recursion-call emitters.
- */
-export function slowRecursionTarget(ir, g) {
-    return slowRecursionCall(ir.refId, g);
+* In-place site of a non-root recursion target (the recursive sub-schema where
+* it sits in the larger tree). Validating it = calling its hosted validator,
+* exactly like a back-edge, so both reuse the recursion-call emitters.
+*/
+function slowRecursionTarget(ir, g) {
+	return slowRecursionCall(ir.refId, g);
 }
-export function fastRecursionTarget(ir, g) {
-    return fastRecursionCall(ir.refId, g);
+function fastRecursionTarget(ir, g) {
+	return fastRecursionCall(ir.refId, g);
 }
+//#endregion
+export { fastRecursionTarget, fastRecursiveRef, slowRecursionTarget, slowRecursiveRef };
+
 //# sourceMappingURL=recursive-ref.js.map

package/dist/core/codegen/schemas/recursive-ref.js.map

@@ -1 +1 @@
-{"version":3,"file":"recursive-ref.js","sourceRoot":"","sources":["../../../../src/core/codegen/schemas/recursive-ref.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAElC;;;GAGG;AACH,SAAS,cAAc,CAAC,GAAmB,EAAE,KAAyB;IACpE,MAAM,CAAC,GAAG,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;IAC1C,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;AAClD,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,KAAyB,EAAE,CAAU;IAC9D,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACxC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;IAC1B,MAAM,IAAI,GAAG,UAAU,CAAC,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,EAAE,CAAC;IAC3B,OAAO,GAAG,IAAI,CAAA;UACN,IAAI,IAAI,EAAE,IAAI,CAAC,CAAC,KAAK;UACrB,IAAI;YACF,IAAI,IAAI,IAAI;gBACR,IAAI,MAAM,IAAI,IAAI,IAAI,WAAW,IAAI;UAC3C,CAAC,CAAC,MAAM,aAAa,IAAI,IAAI,IAAI;iBAC1B,CAAC,CAAC,IAAI,WAAW,IAAI,IAAI,IAAI;;;QAGtC,CAAC,CAAC,MAAM,IAAI,IAAI;;GAErB,IAAI,CAAC;AACR,CAAC;AAED;;;;GAIG;AACH,SAAS,iBAAiB,CAAC,KAAyB,EAAE,CAAU;IAC9D,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;IAClB,MAAM,CAAC,GAAG,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;IAC1C,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QACnB,0EAA0E;QAC1E,2EAA2E;QAC3E,GAAG,CAAC,WAAW,KAAK,SAAS,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC;QAC7C,IAAI,CAAC;YAAE,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,WAAW,CAAC;QACpC,OAAO,GAAG,GAAG,CAAC,WAAW,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC;IAC1C,CAAC;IACD,4EAA4E;IAC5E,OAAO,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC;AACrC,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,EAAkB,EAAE,CAAU;IAC7D,OAAO,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,EAAkB,EAAE,CAAU;IAC7D,OAAO,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,EAAqB,EAAE,CAAU;IACnE,OAAO,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,EAAqB,EAAE,CAAU;IACnE,OAAO,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC"}
+{"version":3,"file":"recursive-ref.js","names":[],"sources":["../../../../src/core/codegen/schemas/recursive-ref.ts"],"sourcesContent":["import type { RecursionTargetIR, RecursiveRefIR } from \"../../types.js\";\nimport type { CodeGenContext, FastGen, SlowGen } from \"../context.js\";\nimport { emit } from \"../emit.js\";\n\n/**\n * Resolve the slow (safeParse-shaped) validator name for a recursion target.\n * refId 0 / no table ⇒ the root, which is the schema's own `safeParse_<name>`.\n */\nfunction slowTargetName(ctx: CodeGenContext, refId: number | undefined): string {\n  const t = ctx.recTargets?.get(refId ?? 0);\n  return t && !t.isRoot ? t.slowName : ctx.fnName;\n}\n\n/**\n * Emit a recursion call on the slow (issue-collecting) path: invoke the hosted\n * validator for the target shape, then either merge its issues with the current\n * path prefix or write back its (possibly mutated) data. Shared by both the\n * back-edge (`recursiveRef`) and the in-place target site (`recursionTarget`).\n */\nfunction slowRecursionCall(refId: number | undefined, g: SlowGen): string {\n  const fn = slowTargetName(g.ctx, refId);\n  const n = g.ctx.counter++;\n  const rVar = `__rec_r${n}`;\n  const iVar = `__rec_i${n}`;\n  const jVar = `__rec_j${n}`;\n  return `${emit`\n    var ${rVar}=${fn}(${g.input});\n    if(!${rVar}.success){\n      var ${iVar}=${rVar}.error.issues;\n      for(var ${jVar}=0;${jVar}<${iVar}.length;${jVar}++){\n        ${g.issues}.push({...${iVar}[${jVar}],\n          path:${g.path}.concat(${iVar}[${jVar}].path)});\n      }\n    }else{\n      ${g.output}=${rVar}.data;\n    }\n  `}\\n`;\n}\n\n/**\n * Resolve the fast (boolean) validator name for a recursion target, allocating\n * the root's lazily (mirrors the historical single-target behavior). Returns a\n * call expression on the target's hosted fast-check.\n */\nfunction fastRecursionCall(refId: number | undefined, g: FastGen): string {\n  const ctx = g.ctx;\n  const t = ctx.recTargets?.get(refId ?? 0);\n  if (!t || t.isRoot) {\n    // Root recursion (refId 0, or a standalone generator call with no table):\n    // the root fast expression is hosted under this name by generateValidator.\n    ctx.recFastName ??= `__fcr_${ctx.counter++}`;\n    if (t) t.fastName = ctx.recFastName;\n    return `${ctx.recFastName}(${g.input})`;\n  }\n  // Non-root target: name pre-allocated by generateValidator before the walk.\n  return `${t.fastName}(${g.input})`;\n}\n\nexport function slowRecursiveRef(ir: RecursiveRefIR, g: SlowGen): string {\n  return slowRecursionCall(ir.refId, g);\n}\n\nexport function fastRecursiveRef(ir: RecursiveRefIR, g: FastGen): string | null {\n  return fastRecursionCall(ir.refId, g);\n}\n\n/**\n * In-place site of a non-root recursion target (the recursive sub-schema where\n * it sits in the larger tree). Validating it = calling its hosted validator,\n * exactly like a back-edge, so both reuse the recursion-call emitters.\n */\nexport function slowRecursionTarget(ir: RecursionTargetIR, g: SlowGen): string {\n  return slowRecursionCall(ir.refId, g);\n}\n\nexport function fastRecursionTarget(ir: RecursionTargetIR, g: FastGen): string | null {\n  return fastRecursionCall(ir.refId, g);\n}\n"],"mappings":";;;;;;AAQA,SAAS,eAAe,KAAqB,OAAmC;CAC9E,MAAM,IAAI,IAAI,YAAY,IAAI,SAAS,CAAC;CACxC,OAAO,KAAK,CAAC,EAAE,SAAS,EAAE,WAAW,IAAI;AAC3C;;;;;;;AAQA,SAAS,kBAAkB,OAA2B,GAAoB;CACxE,MAAM,KAAK,eAAe,EAAE,KAAK,KAAK;CACtC,MAAM,IAAI,EAAE,IAAI;CAChB,MAAM,OAAO,UAAU;CACvB,MAAM,OAAO,UAAU;CACvB,MAAM,OAAO,UAAU;CACvB,OAAO,GAAG,IAAI;UACN,KAAK,GAAG,GAAG,GAAG,EAAE,MAAM;UACtB,KAAK;YACH,KAAK,GAAG,KAAK;gBACT,KAAK,KAAK,KAAK,GAAG,KAAK,UAAU,KAAK;UAC5C,EAAE,OAAO,YAAY,KAAK,GAAG,KAAK;iBAC3B,EAAE,KAAK,UAAU,KAAK,GAAG,KAAK;;;QAGvC,EAAE,OAAO,GAAG,KAAK;;IAErB;AACJ;;;;;;AAOA,SAAS,kBAAkB,OAA2B,GAAoB;CACxE,MAAM,MAAM,EAAE;CACd,MAAM,IAAI,IAAI,YAAY,IAAI,SAAS,CAAC;CACxC,IAAI,CAAC,KAAK,EAAE,QAAQ;EAGlB,IAAI,gBAAgB,SAAS,IAAI;EACjC,IAAI,GAAG,EAAE,WAAW,IAAI;EACxB,OAAO,GAAG,IAAI,YAAY,GAAG,EAAE,MAAM;CACvC;CAEA,OAAO,GAAG,EAAE,SAAS,GAAG,EAAE,MAAM;AAClC;AAEA,SAAgB,iBAAiB,IAAoB,GAAoB;CACvE,OAAO,kBAAkB,GAAG,OAAO,CAAC;AACtC;AAEA,SAAgB,iBAAiB,IAAoB,GAA2B;CAC9E,OAAO,kBAAkB,GAAG,OAAO,CAAC;AACtC;;;;;;AAOA,SAAgB,oBAAoB,IAAuB,GAAoB;CAC7E,OAAO,kBAAkB,GAAG,OAAO,CAAC;AACtC;AAEA,SAAgB,oBAAoB,IAAuB,GAA2B;CACpF,OAAO,kBAAkB,GAAG,OAAO,CAAC;AACtC"}

package/dist/core/codegen/schemas/set.d.ts

@@ -1,7 +1,10 @@
-import type { SchemaIR, SetIR } from "../../types.js";
-import type { FastGen, SlowGen } from "../context.js";
-export declare function slowSet(ir: SchemaIR & {
-    type: "set";
+import { SchemaIR, SetIR } from "../../types.js";
+import { FastGen, SlowGen } from "../context.js";
+//#region src/core/codegen/schemas/set.d.ts
+declare function slowSet(ir: SchemaIR & {
+  type: "set";
 }, g: SlowGen): string;
-export declare function fastSet(ir: SetIR, g: FastGen): string | null;
+declare function fastSet(ir: SetIR, g: FastGen): string | null;
+//#endregion
+export { fastSet, slowSet };
 //# sourceMappingURL=set.d.ts.map

package/dist/core/codegen/schemas/set.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"set.d.ts","sourceRoot":"","sources":["../../../../src/core/codegen/schemas/set.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACtD,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAKtD,wBAAgB,OAAO,CAAC,EAAE,EAAE,QAAQ,GAAG;IAAE,IAAI,EAAE,KAAK,CAAA;CAAE,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,CA4D1E;AAED,wBAAgB,OAAO,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAoC5D"}
+{"version":3,"file":"set.d.ts","names":[],"sources":["../../../../src/core/codegen/schemas/set.ts"],"mappings":";;;iBAMgB,QAAQ,IAAI;EAAa;GAAe,GAAG;iBA8D3C,QAAQ,IAAI,OAAO,GAAG"}