zod-compiler 1.23.0 → 1.23.2

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

@@ -1,108 +1,71 @@
-import { declareFastTemps, emitEffectCallable, emitRuntimeHelper, escapeString, extendPath, extendStaticPath, hasMutation, keyMembershipTest, outputAlwaysDefined, } from "../context.js";
+import { declareFastTemps, emitEffectCallable, emitRuntimeHelper, escapeString, extendPath, extendStaticPath, hasMutation, keyMembershipTest, outputAlwaysDefined } from "../context.js";
 import { emit } from "../emit.js";
 import { invalidType, unrecognizedKeys } from "../emit-issue.js";
 import { ZC_AB_DECL } from "../issue-decls.js";
-import { orderByRuntimeCost } from "../fast-size.js";
 import { refineCheck, superRefineCheck, superRefineFastTest } from "./effect.js";
-export function slowObject(ir, g) {
-    let code = emit `
+import { orderByRuntimeCost } from "../fast-size.js";
+//#region src/core/codegen/schemas/object.ts
+function slowObject(ir, g) {
+	let code = emit`
     if(typeof ${g.input}!=="object"||${g.input}===null||Array.isArray(${g.input})){
       ${invalidType(g, "object")}
     }else{`;
-    // Strip mode (zod's default z.object() output) rebuilds a FRESH object from
-    // the declared keys, so it always writes back. Otherwise clone only when a
-    // property mutates the value.
-    const strip = ir.stripUnknownKeys === true;
-    const needsClone = strip ||
-        (ir.catchall !== undefined && hasMutation(ir.catchall)) ||
-        Object.values(ir.properties).some(hasMutation);
-    const objVar = g.temp("o");
-    if (!strip) {
-        // Spread, not Object.assign: V8's CloneObjectIC makes `{...x}` ~25% faster
-        // on the whole safeParse call for mutation-bearing schemas.
-        code += needsClone ? `var ${objVar}={...${g.input}};` : `var ${objVar}=${g.input};`;
-    }
-    // Object-level refines are gated on zod's ABORT rule, not on "did anything
-    // fail": zod parses the properties (plus the strict/catchall passes) into the
-    // payload and then skips its check chain only when `util.aborted` holds — i.e.
-    // when one of those issues is non-continuable. A property that failed its own
-    // `min`/format check reports a CONTINUABLE issue, so the outer refine still
-    // runs and both messages surface; a property that failed to parse at all
-    // (`invalid_type`, an unrecognized key, a bad record key) aborts and
-    // suppresses it. Snapshot the issue count before the properties so the scan
-    // covers exactly this node's own parse, as zod's fresh sub-payload does.
-    const refineMark = ir.checks && ir.checks.length > 0 ? g.temp("rm") : "";
-    if (refineMark)
-        code += `var ${refineMark}=${g.issues}.length;`;
-    const suppressAbsent = new Set(ir.suppressAbsentKeys ?? []);
-    /** Strip only: per-property output slot + whether it is always in the result. */
-    const slots = [];
-    for (const [key, propIR] of Object.entries(ir.properties)) {
-        const keyStr = escapeString(key);
-        const propPath = extendStaticPath(g.path, key);
-        // Strip validates the value read from the INPUT, held in a local, and
-        // assembles the result afterwards. Reading through the half-built copy (the
-        // previous shape) both cost a megamorphic access per key — the copy's map
-        // changes with every key added — and diverged from zod, which parses
-        // `input[key]` and so accepts a value found on the prototype.
-        const propExpr = strip ? g.temp("sv") : `${objVar}[${keyStr}]`;
-        if (strip) {
-            code += `var ${propExpr}=${g.input}[${keyStr}];`;
-            slots.push({ always: outputAlwaysDefined(propIR), keyStr, value: propExpr });
-        }
-        const propCode = g.visit(propIR, { input: propExpr, output: propExpr, path: propPath });
-        if (suppressAbsent.has(key)) {
-            // Mirrors zod's handlePropertyResult: optional-out fallback props run,
-            // but their issues are discarded when the key is absent from the input.
-            const beforeVar = g.temp("ob");
-            code += emit `
+	const strip = ir.stripUnknownKeys === true;
+	const needsClone = strip || ir.catchall !== void 0 && hasMutation(ir.catchall) || Object.values(ir.properties).some(hasMutation);
+	const objVar = g.temp("o");
+	if (!strip) code += needsClone ? `var ${objVar}={...${g.input}};` : `var ${objVar}=${g.input};`;
+	const refineMark = ir.checks && ir.checks.length > 0 ? g.temp("rm") : "";
+	if (refineMark) code += `var ${refineMark}=${g.issues}.length;`;
+	const suppressAbsent = new Set(ir.suppressAbsentKeys ?? []);
+	/** Strip only: per-property output slot + whether it is always in the result. */
+	const slots = [];
+	for (const [key, propIR] of Object.entries(ir.properties)) {
+		const keyStr = escapeString(key);
+		const propPath = extendStaticPath(g.path, key);
+		const propExpr = strip ? g.temp("sv") : `${objVar}[${keyStr}]`;
+		if (strip) {
+			code += `var ${propExpr}=${g.input}[${keyStr}];`;
+			slots.push({
+				always: outputAlwaysDefined(propIR),
+				keyStr,
+				value: propExpr
+			});
+		}
+		const propCode = g.visit(propIR, {
+			input: propExpr,
+			output: propExpr,
+			path: propPath
+		});
+		if (suppressAbsent.has(key)) {
+			const beforeVar = g.temp("ob");
+			code += emit`
         var ${beforeVar}=${g.issues}.length;
         ${propCode}
         if(!(${keyStr} in ${strip ? g.input : objVar})&&${g.issues}.length>${beforeVar}){
           ${g.issues}.length=${beforeVar};
         }`;
-        }
-        else {
-            code += propCode;
-        }
-    }
-    if (strip) {
-        // Assemble the result in shape order (zod's key order), taking as long a
-        // LEADING run of always-present keys as possible into one object literal:
-        // V8 stamps a literal out of a cached boilerplate map in a single
-        // allocation, where adding keys one at a time walks a transition chain and
-        // re-checks the map on every store — measured 8.1x (20 keys) / 2.8x (7
-        // keys, one optional) on the whole safeParse.
-        //
-        // Everything after the first conditional key is appended so insertion order
-        // still matches zod. The per-key test is zod's own: keep the key when the
-        // parsed value is defined, or when it was present on the input at all
-        // (`key in input`, prototype included — an own `k: undefined` survives).
-        const literal = [];
-        let appends = "";
-        let leading = true;
-        for (const slot of slots) {
-            if (leading && slot.always) {
-                literal.push(`${slot.keyStr}:${slot.value}`);
-                continue;
-            }
-            leading = false;
-            appends += slot.always
-                ? `${objVar}[${slot.keyStr}]=${slot.value};`
-                : `if(${slot.value}!==undefined||(${slot.keyStr} in ${g.input})){${objVar}[${slot.keyStr}]=${slot.value};}`;
-        }
-        code += `var ${objVar}={${literal.join(",")}};${appends}`;
-    }
-    // Strict unknown-key pass — zod's handleCatchall, byte-exact: for-in over
-    // the ORIGINAL input (inherited enumerable keys count, no hasOwnProperty),
-    // ALL unknown keys collected into one issue, pushed AFTER property issues
-    // and before object-level refines.
-    if (ir.strict) {
-        const keys = Object.keys(ir.properties);
-        const ukVar = g.temp("uk");
-        const kVar = g.temp("k");
-        const test = keyMembershipTest(g.ctx, keys, kVar);
-        code += emit `
+		} else code += propCode;
+	}
+	if (strip) {
+		const literal = [];
+		let appends = "";
+		let leading = true;
+		for (const slot of slots) {
+			if (leading && slot.always) {
+				literal.push(`${slot.keyStr}:${slot.value}`);
+				continue;
+			}
+			leading = false;
+			appends += slot.always ? `${objVar}[${slot.keyStr}]=${slot.value};` : `if(${slot.value}!==undefined||(${slot.keyStr} in ${g.input})){${objVar}[${slot.keyStr}]=${slot.value};}`;
+		}
+		code += `var ${objVar}={${literal.join(",")}};${appends}`;
+	}
+	if (ir.strict) {
+		const keys = Object.keys(ir.properties);
+		const ukVar = g.temp("uk");
+		const kVar = g.temp("k");
+		const test = keyMembershipTest(g.ctx, keys, kVar);
+		code += emit`
       var ${ukVar}=null;
       for(var ${kVar} in ${g.input}){
         if(!(${test})){(${ukVar}=${ukVar}||[]).push(${kVar});}
@@ -110,156 +73,106 @@ export function slowObject(ir, g) {
       if(${ukVar}!==null){
         ${unrecognizedKeys(g, ukVar)}
       }`;
-    }
-    // .catchall(schema): validate every key NOT in the shape, mirroring zod's
-    // handleCatchall — same bare for-in over the ORIGINAL input as the strict
-    // pass (inherited enumerable keys count, no hasOwnProperty guard), each
-    // issue reported at the key. Runs after the properties, as zod does.
-    //
-    // The key's slot is BOTH the input and the output, exactly as a shape
-    // property's is: a value-rewriting catchall (coerce, .trim(), a default)
-    // writes through the same expression it later re-reads, so splitting them
-    // makes the rewrite invisible to its own checks.
-    //
-    // When the catchall mutates, objVar is a clone, and each unknown key is
-    // copied into it before validation — which also reproduces zod, whose fresh
-    // output object gains an OWN key for every for-in key it saw, inherited ones
-    // included. A non-mutating catchall writes nothing, so objVar is the input
-    // and the object stays pass-through by reference.
-    if (ir.catchall) {
-        const keys = Object.keys(ir.properties);
-        const kVar = g.temp("ck");
-        const test = keyMembershipTest(g.ctx, keys, kVar);
-        const slot = `${objVar}[${kVar}]`;
-        const seed = needsClone ? `${slot}=${g.input}[${kVar}];` : "";
-        code += emit `
+	}
+	if (ir.catchall) {
+		const keys = Object.keys(ir.properties);
+		const kVar = g.temp("ck");
+		const test = keyMembershipTest(g.ctx, keys, kVar);
+		const slot = `${objVar}[${kVar}]`;
+		const seed = needsClone ? `${slot}=${g.input}[${kVar}];` : "";
+		code += emit`
       for(var ${kVar} in ${g.input}){
         if(!(${test})){
           ${seed}
           ${g.visit(ir.catchall, {
-            input: slot,
-            output: slot,
-            path: extendPath(g.path, kVar),
-        })}
+			input: slot,
+			output: slot,
+			path: extendPath(g.path, kVar)
+		})}
         }
       }`;
-    }
-    if (needsClone) {
-        code += `${g.output}=${objVar};`;
-    }
-    // Object-level refine effects: z.object({...}).refine(fn), suppressed when the
-    // parse phase aborted (see refineMark). One gate covers every effect: each of
-    // them can only add a continuable `custom` issue, so zod's per-check
-    // re-evaluation of `isAborted` can never flip between them.
-    if (ir.checks && ir.checks.length > 0) {
-        let refines = "";
-        for (const check of ir.checks) {
-            refines +=
-                check.kind === "super_refine_effect"
-                    ? superRefineCheck(check, objVar, g)
-                    : refineCheck(check, objVar, g);
-        }
-        const aborted = emitRuntimeHelper(g.ctx, "__zcAb", ZC_AB_DECL);
-        code += `if(!${aborted}(${g.issues},${refineMark})){${refines}}`;
-    }
-    code += `}\n`;
-    return code;
+	}
+	if (needsClone) code += `${g.output}=${objVar};`;
+	if (ir.checks && ir.checks.length > 0) {
+		let refines = "";
+		for (const check of ir.checks) refines += check.kind === "super_refine_effect" ? superRefineCheck(check, objVar, g) : refineCheck(check, objVar, g);
+		const aborted = emitRuntimeHelper(g.ctx, "__zcAb", ZC_AB_DECL);
+		code += `if(!${aborted}(${g.issues},${refineMark})){${refines}}`;
+	}
+	code += `}\n`;
+	return code;
 }
 /**
- * Property entries in the order their fast-checks should be `&&`-chained:
- * cheapest first, declaration order preserved among equals (Array#sort is
- * stable). Valid input runs every conjunct whatever the order, so this costs
- * nothing on the hot path; a REJECT stops at the first false conjunct, so
- * pricing a `z.email()` behind the `kind` literal that actually discriminates
- * is what makes union probing and `.is()` misses cheap (see
- * estimateRuntimeCost). The SLOW path keeps declaration order — that one's
- * output is the issue list, whose order is part of zod parity.
- */
+* Property entries in the order their fast-checks should be `&&`-chained:
+* cheapest first, declaration order preserved among equals (Array#sort is
+* stable). Valid input runs every conjunct whatever the order, so this costs
+* nothing on the hot path; a REJECT stops at the first false conjunct, so
+* pricing a `z.email()` behind the `kind` literal that actually discriminates
+* is what makes union probing and `.is()` misses cheap (see
+* estimateRuntimeCost). The SLOW path keeps declaration order — that one's
+* output is the issue list, whose order is part of zod parity.
+*/
 function orderedProperties(ir, g) {
-    return orderByRuntimeCost(Object.entries(ir.properties), ([, propIR]) => propIR, g.ctx);
+	return orderByRuntimeCost(Object.entries(ir.properties), ([, propIR]) => propIR, g.ctx);
 }
 /**
- * Property/strict/refine fast-checks for an object, WITHOUT the leading
- * `typeof===object && !==null && !Array.isArray` type-guard. Returns the
- * conjunct parts (joinable with `&&`), or null if any child is fast-ineligible.
- *
- * `skipKey`, when given, omits that one property's check. Used by the
- * discriminated-union fast path (via `g.discSkipKey`): the enclosing `switch`
- * has already matched the discriminator's value, so re-checking it is redundant.
- */
+* Property/strict/refine fast-checks for an object, WITHOUT the leading
+* `typeof===object && !==null && !Array.isArray` type-guard. Returns the
+* conjunct parts (joinable with `&&`), or null if any child is fast-ineligible.
+*
+* `skipKey`, when given, omits that one property's check. Used by the
+* discriminated-union fast path (via `g.discSkipKey`): the enclosing `switch`
+* has already matched the discriminator's value, so re-checking it is redundant.
+*/
 function fastObjectBody(ir, g, skipKey) {
-    const x = g.input;
-    const parts = [];
-    for (const [key, propIR] of orderedProperties(ir, g)) {
-        if (key === skipKey)
-            continue;
-        const propExpr = `${x}[${escapeString(key)}]`;
-        const propCheck = g.visit(propIR, { input: propExpr });
-        if (propCheck === null)
-            return null; // All-or-nothing
-        parts.push(propCheck);
-    }
-    // Strict unknown-key pass: hosted boolean helper (a for-in loop cannot live
-    // in the && chain). Same for-in iteration as the slow path — fast/slow
-    // agreement is load-bearing under the __zcFinD deferral. The membership set is
-    // the FULL key list (the discriminator is a recognized key), independent of
-    // skipKey, which only suppresses re-validating the discriminator's value.
-    if (ir.strict) {
-        const keys = Object.keys(ir.properties);
-        const fnName = g.temp("so");
-        const test = keyMembershipTest(g.ctx, keys, "k");
-        g.ctx.preamble.push(`function ${fnName}(o){for(var k in o){if(!(${test}))return false;}return true;}`);
-        parts.push(`${fnName}(${x})`);
-    }
-    // .catchall(schema): same hosted for-in as strict, but each unrecognized key
-    // is checked against the catchall rather than rejected outright. The value is
-    // hoisted into a local for the same reason fastRecord does it — repeated
-    // `o[k]` computed loads are not eliminated across check boundaries.
-    if (ir.catchall) {
-        const kv = g.temp("cak");
-        const vv = g.temp("cav");
-        const catchallGen = g.scoped(vv);
-        const valCheck = catchallGen.visit(ir.catchall, { input: vv });
-        if (valCheck === null)
-            return null;
-        if (valCheck !== "true") {
-            const fnName = g.temp("co");
-            const test = keyMembershipTest(g.ctx, Object.keys(ir.properties), kv);
-            g.ctx.preamble.push(`function ${fnName}(o){${declareFastTemps(catchallGen.scope)}var ${kv},${vv};for(${kv} in o){if(!(${test})){${vv}=o[${kv}];if(!(${valCheck}))return false;}}return true;}`);
-            parts.push(`${fnName}(${x})`);
-        }
-    }
-    // Object-level refine effects (appended last — run after property checks short-circuit)
-    if (ir.checks) {
-        for (const check of ir.checks) {
-            if (check.kind === "refine_effect") {
-                parts.push(`${emitEffectCallable(g.ctx, check)}(${x})`);
-            }
-            else if (check.kind === "super_refine_effect") {
-                parts.push(superRefineFastTest(check, x, g));
-            }
-        }
-    }
-    return parts;
+	const x = g.input;
+	const parts = [];
+	for (const [key, propIR] of orderedProperties(ir, g)) {
+		if (key === skipKey) continue;
+		const propExpr = `${x}[${escapeString(key)}]`;
+		const propCheck = g.visit(propIR, { input: propExpr });
+		if (propCheck === null) return null;
+		parts.push(propCheck);
+	}
+	if (ir.strict) {
+		const keys = Object.keys(ir.properties);
+		const fnName = g.temp("so");
+		const test = keyMembershipTest(g.ctx, keys, "k");
+		g.ctx.preamble.push(`function ${fnName}(o){for(var k in o){if(!(${test}))return false;}return true;}`);
+		parts.push(`${fnName}(${x})`);
+	}
+	if (ir.catchall) {
+		const kv = g.temp("cak");
+		const vv = g.temp("cav");
+		const catchallGen = g.scoped(vv);
+		const valCheck = catchallGen.visit(ir.catchall, { input: vv });
+		if (valCheck === null) return null;
+		if (valCheck !== "true") {
+			const fnName = g.temp("co");
+			const test = keyMembershipTest(g.ctx, Object.keys(ir.properties), kv);
+			g.ctx.preamble.push(`function ${fnName}(o){${declareFastTemps(catchallGen.scope)}var ${kv},${vv};for(${kv} in o){if(!(${test})){${vv}=o[${kv}];if(!(${valCheck}))return false;}}return true;}`);
+			parts.push(`${fnName}(${x})`);
+		}
+	}
+	if (ir.checks) {
+		for (const check of ir.checks) if (check.kind === "refine_effect") parts.push(`${emitEffectCallable(g.ctx, check)}(${x})`);
+		else if (check.kind === "super_refine_effect") parts.push(superRefineFastTest(check, x, g));
+	}
+	return parts;
 }
-export function fastObject(ir, g) {
-    // A strip object still gets an expression. Stripping reshapes the OUTPUT, not
-    // the verdict, so this remains an exact acceptance predicate — which is what
-    // `.is()` installs, and what the build path reuses to validate the subtrees it
-    // passes through by reference. What it must NOT do is stand in for the parse
-    // result: generateValidator withholds the `data:input` shortcut whenever the
-    // schema rebuilds (see rebuildsOutput).
-    const x = g.input;
-    const body = fastObjectBody(ir, g, g.discSkipKey);
-    if (body === null)
-        return null;
-    // Discriminated-union option: the enclosing switch (and the caller's guard)
-    // already established object-ness and the discriminator value, so emit only
-    // the remaining checks — no leading type-guard. An option with nothing left
-    // to check accepts unconditionally ("true").
-    if (g.discSkipKey !== undefined) {
-        return body.length > 0 ? body.join("&&") : "true";
-    }
-    return [`typeof ${x}==="object"`, `${x}!==null`, `!Array.isArray(${x})`, ...body].join("&&");
+function fastObject(ir, g) {
+	const x = g.input;
+	const body = fastObjectBody(ir, g, g.discSkipKey);
+	if (body === null) return null;
+	if (g.discSkipKey !== void 0) return body.length > 0 ? body.join("&&") : "true";
+	return [
+		`typeof ${x}==="object"`,
+		`${x}!==null`,
+		`!Array.isArray(${x})`,
+		...body
+	].join("&&");
 }
+//#endregion
+export { fastObject, slowObject };
+
 //# sourceMappingURL=object.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"object.js","sourceRoot":"","sources":["../../../../src/core/codegen/schemas/object.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,gBAAgB,EAChB,kBAAkB,EAClB,iBAAiB,EACjB,YAAY,EACZ,UAAU,EACV,gBAAgB,EAChB,WAAW,EACX,iBAAiB,EACjB,mBAAmB,GACpB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAClC,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACjE,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AACrD,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAEjF,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,4EAA4E;IAC5E,2EAA2E;IAC3E,8BAA8B;IAC9B,MAAM,KAAK,GAAG,EAAE,CAAC,gBAAgB,KAAK,IAAI,CAAC;IAC3C,MAAM,UAAU,GACd,KAAK;QACL,CAAC,EAAE,CAAC,QAAQ,KAAK,SAAS,IAAI,WAAW,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC;QACvD,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3B,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,2EAA2E;QAC3E,4DAA4D;QAC5D,IAAI,IAAI,UAAU,CAAC,CAAC,CAAC,OAAO,MAAM,QAAQ,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,OAAO,MAAM,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC;IACtF,CAAC;IAED,2EAA2E;IAC3E,8EAA8E;IAC9E,+EAA+E;IAC/E,8EAA8E;IAC9E,4EAA4E;IAC5E,yEAAyE;IACzE,qEAAqE;IACrE,4EAA4E;IAC5E,yEAAyE;IACzE,MAAM,UAAU,GAAG,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACzE,IAAI,UAAU;QAAE,IAAI,IAAI,OAAO,UAAU,IAAI,CAAC,CAAC,MAAM,UAAU,CAAC;IAEhE,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,kBAAkB,IAAI,EAAE,CAAC,CAAC;IAC5D,iFAAiF;IACjF,MAAM,KAAK,GAAyD,EAAE,CAAC;IAEvE,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC;QAC1D,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;QACjC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC/C,sEAAsE;QACtE,4EAA4E;QAC5E,0EAA0E;QAC1E,qEAAqE;QACrE,8DAA8D;QAC9D,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI,MAAM,GAAG,CAAC;QAC/D,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,IAAI,OAAO,QAAQ,IAAI,CAAC,CAAC,KAAK,IAAI,MAAM,IAAI,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,mBAAmB,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC/E,CAAC;QACD,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QACxF,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5B,uEAAuE;YACvE,wEAAwE;YACxE,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,IAAI,IAAI,CAAA;cACJ,SAAS,IAAI,CAAC,CAAC,MAAM;UACzB,QAAQ;eACH,MAAM,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,CAAC,MAAM,WAAW,SAAS;YAC1E,CAAC,CAAC,MAAM,WAAW,SAAS;UAC9B,CAAC;QACP,CAAC;aAAM,CAAC;YACN,IAAI,IAAI,QAAQ,CAAC;QACnB,CAAC;IACH,CAAC;IAED,IAAI,KAAK,EAAE,CAAC;QACV,yEAAyE;QACzE,0EAA0E;QAC1E,kEAAkE;QAClE,2EAA2E;QAC3E,uEAAuE;QACvE,8CAA8C;QAC9C,EAAE;QACF,4EAA4E;QAC5E,0EAA0E;QAC1E,sEAAsE;QACtE,yEAAyE;QACzE,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,IAAI,OAAO,GAAG,EAAE,CAAC;QACjB,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,OAAO,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC3B,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;gBAC7C,SAAS;YACX,CAAC;YACD,OAAO,GAAG,KAAK,CAAC;YAChB,OAAO,IAAI,IAAI,CAAC,MAAM;gBACpB,CAAC,CAAC,GAAG,MAAM,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,GAAG;gBAC5C,CAAC,CAAC,MAAM,IAAI,CAAC,KAAK,kBAAkB,IAAI,CAAC,MAAM,OAAO,CAAC,CAAC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC;QAChH,CAAC;QACD,IAAI,IAAI,OAAO,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,OAAO,EAAE,CAAC;IAC5D,CAAC;IAED,0EAA0E;IAC1E,2EAA2E;IAC3E,0EAA0E;IAC1E,mCAAmC;IACnC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;QACd,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAClD,IAAI,IAAI,IAAI,CAAA;YACJ,KAAK;gBACD,IAAI,OAAO,CAAC,CAAC,KAAK;eACnB,IAAI,OAAO,KAAK,IAAI,KAAK,cAAc,IAAI;;WAE/C,KAAK;UACN,gBAAgB,CAAC,CAAC,EAAE,KAAK,CAAC;QAC5B,CAAC;IACP,CAAC;IAED,0EAA0E;IAC1E,0EAA0E;IAC1E,wEAAwE;IACxE,qEAAqE;IACrE,EAAE;IACF,sEAAsE;IACtE,yEAAyE;IACzE,0EAA0E;IAC1E,iDAAiD;IACjD,EAAE;IACF,wEAAwE;IACxE,4EAA4E;IAC5E,6EAA6E;IAC7E,2EAA2E;IAC3E,kDAAkD;IAClD,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC;QAChB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,MAAM,IAAI,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,GAAG,MAAM,IAAI,IAAI,GAAG,CAAC;QAClC,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,KAAK,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9D,IAAI,IAAI,IAAI,CAAA;gBACA,IAAI,OAAO,CAAC,CAAC,KAAK;eACnB,IAAI;YACP,IAAI;YACJ,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,QAAQ,EAAE;YACrB,KAAK,EAAE,IAAI;YACX,MAAM,EAAE,IAAI;YACZ,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC;SAC/B,CAAC;;QAEJ,CAAC;IACP,CAAC;IAED,IAAI,UAAU,EAAE,CAAC;QACf,IAAI,IAAI,GAAG,CAAC,CAAC,MAAM,IAAI,MAAM,GAAG,CAAC;IACnC,CAAC;IAED,+EAA+E;IAC/E,8EAA8E;IAC9E,qEAAqE;IACrE,4DAA4D;IAC5D,IAAI,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtC,IAAI,OAAO,GAAG,EAAE,CAAC;QACjB,KAAK,MAAM,KAAK,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;YAC9B,OAAO;gBACL,KAAK,CAAC,IAAI,KAAK,qBAAqB;oBAClC,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;oBACpC,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,OAAO,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC/D,IAAI,IAAI,OAAO,OAAO,IAAI,CAAC,CAAC,MAAM,IAAI,UAAU,MAAM,OAAO,GAAG,CAAC;IACnE,CAAC;IAED,IAAI,IAAI,KAAK,CAAC;IACd,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,iBAAiB,CAAC,EAAY,EAAE,CAAU;IACjD,OAAO,kBAAkB,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;AAC1F,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,cAAc,CAAC,EAAY,EAAE,CAAU,EAAE,OAAgB;IAChE,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IAClB,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,iBAAiB,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;QACrD,IAAI,GAAG,KAAK,OAAO;YAAE,SAAS;QAC9B,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC;QAC9C,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;QACvD,IAAI,SAAS,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,CAAC,iBAAiB;QACtD,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxB,CAAC;IAED,4EAA4E;IAC5E,uEAAuE;IACvE,+EAA+E;IAC/E,4EAA4E;IAC5E,0EAA0E;IAC1E,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;QACd,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;QACxC,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QACjD,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CACjB,YAAY,MAAM,4BAA4B,IAAI,+BAA+B,CAClF,CAAC;QACF,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAED,6EAA6E;IAC7E,8EAA8E;IAC9E,yEAAyE;IACzE,oEAAoE;IACpE,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC;QAChB,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,MAAM,WAAW,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACjC,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/D,IAAI,QAAQ,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QACnC,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,IAAI,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,CAAC;YACtE,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CACjB,YAAY,MAAM,OAAO,gBAAgB,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,eAAe,IAAI,MAAM,EAAE,MAAM,EAAE,UAAU,QAAQ,gCAAgC,CAC3K,CAAC;YACF,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,wFAAwF;IACxF,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;gBACnC,KAAK,CAAC,IAAI,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC1D,CAAC;iBAAM,IAAI,KAAK,CAAC,IAAI,KAAK,qBAAqB,EAAE,CAAC;gBAChD,KAAK,CAAC,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,EAAY,EAAE,CAAU;IACjD,8EAA8E;IAC9E,6EAA6E;IAC7E,+EAA+E;IAC/E,6EAA6E;IAC7E,6EAA6E;IAC7E,wCAAwC;IACxC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IAClB,MAAM,IAAI,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC;IAClD,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC/B,4EAA4E;IAC5E,4EAA4E;IAC5E,4EAA4E;IAC5E,6CAA6C;IAC7C,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QAChC,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACpD,CAAC;IACD,OAAO,CAAC,UAAU,CAAC,aAAa,EAAE,GAAG,CAAC,SAAS,EAAE,kBAAkB,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC/F,CAAC"}
+{"version":3,"file":"object.js","names":[],"sources":["../../../../src/core/codegen/schemas/object.ts"],"sourcesContent":["import type { ObjectIR, SchemaIR } from \"../../types.js\";\nimport type { FastGen, SlowGen } from \"../context.js\";\nimport {\n  declareFastTemps,\n  emitEffectCallable,\n  emitRuntimeHelper,\n  escapeString,\n  extendPath,\n  extendStaticPath,\n  hasMutation,\n  keyMembershipTest,\n  outputAlwaysDefined,\n} from \"../context.js\";\nimport { emit } from \"../emit.js\";\nimport { invalidType, unrecognizedKeys } from \"../emit-issue.js\";\nimport { ZC_AB_DECL } from \"../issue-decls.js\";\nimport { orderByRuntimeCost } from \"../fast-size.js\";\nimport { refineCheck, superRefineCheck, superRefineFastTest } from \"./effect.js\";\n\nexport function slowObject(ir: SchemaIR & { type: \"object\" }, g: SlowGen): string {\n  let code = emit`\n    if(typeof ${g.input}!==\"object\"||${g.input}===null||Array.isArray(${g.input})){\n      ${invalidType(g, \"object\")}\n    }else{`;\n\n  // Strip mode (zod's default z.object() output) rebuilds a FRESH object from\n  // the declared keys, so it always writes back. Otherwise clone only when a\n  // property mutates the value.\n  const strip = ir.stripUnknownKeys === true;\n  const needsClone =\n    strip ||\n    (ir.catchall !== undefined && hasMutation(ir.catchall)) ||\n    Object.values(ir.properties).some(hasMutation);\n  const objVar = g.temp(\"o\");\n  if (!strip) {\n    // Spread, not Object.assign: V8's CloneObjectIC makes `{...x}` ~25% faster\n    // on the whole safeParse call for mutation-bearing schemas.\n    code += needsClone ? `var ${objVar}={...${g.input}};` : `var ${objVar}=${g.input};`;\n  }\n\n  // Object-level refines are gated on zod's ABORT rule, not on \"did anything\n  // fail\": zod parses the properties (plus the strict/catchall passes) into the\n  // payload and then skips its check chain only when `util.aborted` holds — i.e.\n  // when one of those issues is non-continuable. A property that failed its own\n  // `min`/format check reports a CONTINUABLE issue, so the outer refine still\n  // runs and both messages surface; a property that failed to parse at all\n  // (`invalid_type`, an unrecognized key, a bad record key) aborts and\n  // suppresses it. Snapshot the issue count before the properties so the scan\n  // covers exactly this node's own parse, as zod's fresh sub-payload does.\n  const refineMark = ir.checks && ir.checks.length > 0 ? g.temp(\"rm\") : \"\";\n  if (refineMark) code += `var ${refineMark}=${g.issues}.length;`;\n\n  const suppressAbsent = new Set(ir.suppressAbsentKeys ?? []);\n  /** Strip only: per-property output slot + whether it is always in the result. */\n  const slots: { always: boolean; keyStr: string; value: string }[] = [];\n\n  for (const [key, propIR] of Object.entries(ir.properties)) {\n    const keyStr = escapeString(key);\n    const propPath = extendStaticPath(g.path, key);\n    // Strip validates the value read from the INPUT, held in a local, and\n    // assembles the result afterwards. Reading through the half-built copy (the\n    // previous shape) both cost a megamorphic access per key — the copy's map\n    // changes with every key added — and diverged from zod, which parses\n    // `input[key]` and so accepts a value found on the prototype.\n    const propExpr = strip ? g.temp(\"sv\") : `${objVar}[${keyStr}]`;\n    if (strip) {\n      code += `var ${propExpr}=${g.input}[${keyStr}];`;\n      slots.push({ always: outputAlwaysDefined(propIR), keyStr, value: propExpr });\n    }\n    const propCode = g.visit(propIR, { input: propExpr, output: propExpr, path: propPath });\n    if (suppressAbsent.has(key)) {\n      // Mirrors zod's handlePropertyResult: optional-out fallback props run,\n      // but their issues are discarded when the key is absent from the input.\n      const beforeVar = g.temp(\"ob\");\n      code += emit`\n        var ${beforeVar}=${g.issues}.length;\n        ${propCode}\n        if(!(${keyStr} in ${strip ? g.input : objVar})&&${g.issues}.length>${beforeVar}){\n          ${g.issues}.length=${beforeVar};\n        }`;\n    } else {\n      code += propCode;\n    }\n  }\n\n  if (strip) {\n    // Assemble the result in shape order (zod's key order), taking as long a\n    // LEADING run of always-present keys as possible into one object literal:\n    // V8 stamps a literal out of a cached boilerplate map in a single\n    // allocation, where adding keys one at a time walks a transition chain and\n    // re-checks the map on every store — measured 8.1x (20 keys) / 2.8x (7\n    // keys, one optional) on the whole safeParse.\n    //\n    // Everything after the first conditional key is appended so insertion order\n    // still matches zod. The per-key test is zod's own: keep the key when the\n    // parsed value is defined, or when it was present on the input at all\n    // (`key in input`, prototype included — an own `k: undefined` survives).\n    const literal: string[] = [];\n    let appends = \"\";\n    let leading = true;\n    for (const slot of slots) {\n      if (leading && slot.always) {\n        literal.push(`${slot.keyStr}:${slot.value}`);\n        continue;\n      }\n      leading = false;\n      appends += slot.always\n        ? `${objVar}[${slot.keyStr}]=${slot.value};`\n        : `if(${slot.value}!==undefined||(${slot.keyStr} in ${g.input})){${objVar}[${slot.keyStr}]=${slot.value};}`;\n    }\n    code += `var ${objVar}={${literal.join(\",\")}};${appends}`;\n  }\n\n  // Strict unknown-key pass — zod's handleCatchall, byte-exact: for-in over\n  // the ORIGINAL input (inherited enumerable keys count, no hasOwnProperty),\n  // ALL unknown keys collected into one issue, pushed AFTER property issues\n  // and before object-level refines.\n  if (ir.strict) {\n    const keys = Object.keys(ir.properties);\n    const ukVar = g.temp(\"uk\");\n    const kVar = g.temp(\"k\");\n    const test = keyMembershipTest(g.ctx, keys, kVar);\n    code += emit`\n      var ${ukVar}=null;\n      for(var ${kVar} in ${g.input}){\n        if(!(${test})){(${ukVar}=${ukVar}||[]).push(${kVar});}\n      }\n      if(${ukVar}!==null){\n        ${unrecognizedKeys(g, ukVar)}\n      }`;\n  }\n\n  // .catchall(schema): validate every key NOT in the shape, mirroring zod's\n  // handleCatchall — same bare for-in over the ORIGINAL input as the strict\n  // pass (inherited enumerable keys count, no hasOwnProperty guard), each\n  // issue reported at the key. Runs after the properties, as zod does.\n  //\n  // The key's slot is BOTH the input and the output, exactly as a shape\n  // property's is: a value-rewriting catchall (coerce, .trim(), a default)\n  // writes through the same expression it later re-reads, so splitting them\n  // makes the rewrite invisible to its own checks.\n  //\n  // When the catchall mutates, objVar is a clone, and each unknown key is\n  // copied into it before validation — which also reproduces zod, whose fresh\n  // output object gains an OWN key for every for-in key it saw, inherited ones\n  // included. A non-mutating catchall writes nothing, so objVar is the input\n  // and the object stays pass-through by reference.\n  if (ir.catchall) {\n    const keys = Object.keys(ir.properties);\n    const kVar = g.temp(\"ck\");\n    const test = keyMembershipTest(g.ctx, keys, kVar);\n    const slot = `${objVar}[${kVar}]`;\n    const seed = needsClone ? `${slot}=${g.input}[${kVar}];` : \"\";\n    code += emit`\n      for(var ${kVar} in ${g.input}){\n        if(!(${test})){\n          ${seed}\n          ${g.visit(ir.catchall, {\n            input: slot,\n            output: slot,\n            path: extendPath(g.path, kVar),\n          })}\n        }\n      }`;\n  }\n\n  if (needsClone) {\n    code += `${g.output}=${objVar};`;\n  }\n\n  // Object-level refine effects: z.object({...}).refine(fn), suppressed when the\n  // parse phase aborted (see refineMark). One gate covers every effect: each of\n  // them can only add a continuable `custom` issue, so zod's per-check\n  // re-evaluation of `isAborted` can never flip between them.\n  if (ir.checks && ir.checks.length > 0) {\n    let refines = \"\";\n    for (const check of ir.checks) {\n      refines +=\n        check.kind === \"super_refine_effect\"\n          ? superRefineCheck(check, objVar, g)\n          : refineCheck(check, objVar, g);\n    }\n    const aborted = emitRuntimeHelper(g.ctx, \"__zcAb\", ZC_AB_DECL);\n    code += `if(!${aborted}(${g.issues},${refineMark})){${refines}}`;\n  }\n\n  code += `}\\n`;\n  return code;\n}\n\n/**\n * Property entries in the order their fast-checks should be `&&`-chained:\n * cheapest first, declaration order preserved among equals (Array#sort is\n * stable). Valid input runs every conjunct whatever the order, so this costs\n * nothing on the hot path; a REJECT stops at the first false conjunct, so\n * pricing a `z.email()` behind the `kind` literal that actually discriminates\n * is what makes union probing and `.is()` misses cheap (see\n * estimateRuntimeCost). The SLOW path keeps declaration order — that one's\n * output is the issue list, whose order is part of zod parity.\n */\nfunction orderedProperties(ir: ObjectIR, g: FastGen): [string, SchemaIR][] {\n  return orderByRuntimeCost(Object.entries(ir.properties), ([, propIR]) => propIR, g.ctx);\n}\n\n/**\n * Property/strict/refine fast-checks for an object, WITHOUT the leading\n * `typeof===object && !==null && !Array.isArray` type-guard. Returns the\n * conjunct parts (joinable with `&&`), or null if any child is fast-ineligible.\n *\n * `skipKey`, when given, omits that one property's check. Used by the\n * discriminated-union fast path (via `g.discSkipKey`): the enclosing `switch`\n * has already matched the discriminator's value, so re-checking it is redundant.\n */\nfunction fastObjectBody(ir: ObjectIR, g: FastGen, skipKey?: string): string[] | null {\n  const x = g.input;\n  const parts: string[] = [];\n\n  for (const [key, propIR] of orderedProperties(ir, g)) {\n    if (key === skipKey) continue;\n    const propExpr = `${x}[${escapeString(key)}]`;\n    const propCheck = g.visit(propIR, { input: propExpr });\n    if (propCheck === null) return null; // All-or-nothing\n    parts.push(propCheck);\n  }\n\n  // Strict unknown-key pass: hosted boolean helper (a for-in loop cannot live\n  // in the && chain). Same for-in iteration as the slow path — fast/slow\n  // agreement is load-bearing under the __zcFinD deferral. The membership set is\n  // the FULL key list (the discriminator is a recognized key), independent of\n  // skipKey, which only suppresses re-validating the discriminator's value.\n  if (ir.strict) {\n    const keys = Object.keys(ir.properties);\n    const fnName = g.temp(\"so\");\n    const test = keyMembershipTest(g.ctx, keys, \"k\");\n    g.ctx.preamble.push(\n      `function ${fnName}(o){for(var k in o){if(!(${test}))return false;}return true;}`,\n    );\n    parts.push(`${fnName}(${x})`);\n  }\n\n  // .catchall(schema): same hosted for-in as strict, but each unrecognized key\n  // is checked against the catchall rather than rejected outright. The value is\n  // hoisted into a local for the same reason fastRecord does it — repeated\n  // `o[k]` computed loads are not eliminated across check boundaries.\n  if (ir.catchall) {\n    const kv = g.temp(\"cak\");\n    const vv = g.temp(\"cav\");\n    const catchallGen = g.scoped(vv);\n    const valCheck = catchallGen.visit(ir.catchall, { input: vv });\n    if (valCheck === null) return null;\n    if (valCheck !== \"true\") {\n      const fnName = g.temp(\"co\");\n      const test = keyMembershipTest(g.ctx, Object.keys(ir.properties), kv);\n      g.ctx.preamble.push(\n        `function ${fnName}(o){${declareFastTemps(catchallGen.scope)}var ${kv},${vv};for(${kv} in o){if(!(${test})){${vv}=o[${kv}];if(!(${valCheck}))return false;}}return true;}`,\n      );\n      parts.push(`${fnName}(${x})`);\n    }\n  }\n\n  // Object-level refine effects (appended last — run after property checks short-circuit)\n  if (ir.checks) {\n    for (const check of ir.checks) {\n      if (check.kind === \"refine_effect\") {\n        parts.push(`${emitEffectCallable(g.ctx, check)}(${x})`);\n      } else if (check.kind === \"super_refine_effect\") {\n        parts.push(superRefineFastTest(check, x, g));\n      }\n    }\n  }\n\n  return parts;\n}\n\nexport function fastObject(ir: ObjectIR, g: FastGen): string | null {\n  // A strip object still gets an expression. Stripping reshapes the OUTPUT, not\n  // the verdict, so this remains an exact acceptance predicate — which is what\n  // `.is()` installs, and what the build path reuses to validate the subtrees it\n  // passes through by reference. What it must NOT do is stand in for the parse\n  // result: generateValidator withholds the `data:input` shortcut whenever the\n  // schema rebuilds (see rebuildsOutput).\n  const x = g.input;\n  const body = fastObjectBody(ir, g, g.discSkipKey);\n  if (body === null) return null;\n  // Discriminated-union option: the enclosing switch (and the caller's guard)\n  // already established object-ness and the discriminator value, so emit only\n  // the remaining checks — no leading type-guard. An option with nothing left\n  // to check accepts unconditionally (\"true\").\n  if (g.discSkipKey !== undefined) {\n    return body.length > 0 ? body.join(\"&&\") : \"true\";\n  }\n  return [`typeof ${x}===\"object\"`, `${x}!==null`, `!Array.isArray(${x})`, ...body].join(\"&&\");\n}\n"],"mappings":";;;;;;;AAmBA,SAAgB,WAAW,IAAmC,GAAoB;CAChF,IAAI,OAAO,IAAI;gBACD,EAAE,MAAM,eAAe,EAAE,MAAM,yBAAyB,EAAE,MAAM;QACxE,YAAY,GAAG,QAAQ,EAAE;;CAM/B,MAAM,QAAQ,GAAG,qBAAqB;CACtC,MAAM,aACJ,SACC,GAAG,aAAa,KAAA,KAAa,YAAY,GAAG,QAAQ,KACrD,OAAO,OAAO,GAAG,UAAU,CAAC,CAAC,KAAK,WAAW;CAC/C,MAAM,SAAS,EAAE,KAAK,GAAG;CACzB,IAAI,CAAC,OAGH,QAAQ,aAAa,OAAO,OAAO,OAAO,EAAE,MAAM,MAAM,OAAO,OAAO,GAAG,EAAE,MAAM;CAYnF,MAAM,aAAa,GAAG,UAAU,GAAG,OAAO,SAAS,IAAI,EAAE,KAAK,IAAI,IAAI;CACtE,IAAI,YAAY,QAAQ,OAAO,WAAW,GAAG,EAAE,OAAO;CAEtD,MAAM,iBAAiB,IAAI,IAAI,GAAG,sBAAsB,CAAC,CAAC;;CAE1D,MAAM,QAA8D,CAAC;CAErE,KAAK,MAAM,CAAC,KAAK,WAAW,OAAO,QAAQ,GAAG,UAAU,GAAG;EACzD,MAAM,SAAS,aAAa,GAAG;EAC/B,MAAM,WAAW,iBAAiB,EAAE,MAAM,GAAG;EAM7C,MAAM,WAAW,QAAQ,EAAE,KAAK,IAAI,IAAI,GAAG,OAAO,GAAG,OAAO;EAC5D,IAAI,OAAO;GACT,QAAQ,OAAO,SAAS,GAAG,EAAE,MAAM,GAAG,OAAO;GAC7C,MAAM,KAAK;IAAE,QAAQ,oBAAoB,MAAM;IAAG;IAAQ,OAAO;GAAS,CAAC;EAC7E;EACA,MAAM,WAAW,EAAE,MAAM,QAAQ;GAAE,OAAO;GAAU,QAAQ;GAAU,MAAM;EAAS,CAAC;EACtF,IAAI,eAAe,IAAI,GAAG,GAAG;GAG3B,MAAM,YAAY,EAAE,KAAK,IAAI;GAC7B,QAAQ,IAAI;cACJ,UAAU,GAAG,EAAE,OAAO;UAC1B,SAAS;eACJ,OAAO,MAAM,QAAQ,EAAE,QAAQ,OAAO,KAAK,EAAE,OAAO,UAAU,UAAU;YAC3E,EAAE,OAAO,UAAU,UAAU;;EAErC,OACE,QAAQ;CAEZ;CAEA,IAAI,OAAO;EAYT,MAAM,UAAoB,CAAC;EAC3B,IAAI,UAAU;EACd,IAAI,UAAU;EACd,KAAK,MAAM,QAAQ,OAAO;GACxB,IAAI,WAAW,KAAK,QAAQ;IAC1B,QAAQ,KAAK,GAAG,KAAK,OAAO,GAAG,KAAK,OAAO;IAC3C;GACF;GACA,UAAU;GACV,WAAW,KAAK,SACZ,GAAG,OAAO,GAAG,KAAK,OAAO,IAAI,KAAK,MAAM,KACxC,MAAM,KAAK,MAAM,iBAAiB,KAAK,OAAO,MAAM,EAAE,MAAM,KAAK,OAAO,GAAG,KAAK,OAAO,IAAI,KAAK,MAAM;EAC5G;EACA,QAAQ,OAAO,OAAO,IAAI,QAAQ,KAAK,GAAG,EAAE,IAAI;CAClD;CAMA,IAAI,GAAG,QAAQ;EACb,MAAM,OAAO,OAAO,KAAK,GAAG,UAAU;EACtC,MAAM,QAAQ,EAAE,KAAK,IAAI;EACzB,MAAM,OAAO,EAAE,KAAK,GAAG;EACvB,MAAM,OAAO,kBAAkB,EAAE,KAAK,MAAM,IAAI;EAChD,QAAQ,IAAI;YACJ,MAAM;gBACF,KAAK,MAAM,EAAE,MAAM;eACpB,KAAK,MAAM,MAAM,GAAG,MAAM,aAAa,KAAK;;WAEhD,MAAM;UACP,iBAAiB,GAAG,KAAK,EAAE;;CAEnC;CAiBA,IAAI,GAAG,UAAU;EACf,MAAM,OAAO,OAAO,KAAK,GAAG,UAAU;EACtC,MAAM,OAAO,EAAE,KAAK,IAAI;EACxB,MAAM,OAAO,kBAAkB,EAAE,KAAK,MAAM,IAAI;EAChD,MAAM,OAAO,GAAG,OAAO,GAAG,KAAK;EAC/B,MAAM,OAAO,aAAa,GAAG,KAAK,GAAG,EAAE,MAAM,GAAG,KAAK,MAAM;EAC3D,QAAQ,IAAI;gBACA,KAAK,MAAM,EAAE,MAAM;eACpB,KAAK;YACR,KAAK;YACL,EAAE,MAAM,GAAG,UAAU;GACrB,OAAO;GACP,QAAQ;GACR,MAAM,WAAW,EAAE,MAAM,IAAI;EAC/B,CAAC,EAAE;;;CAGX;CAEA,IAAI,YACF,QAAQ,GAAG,EAAE,OAAO,GAAG,OAAO;CAOhC,IAAI,GAAG,UAAU,GAAG,OAAO,SAAS,GAAG;EACrC,IAAI,UAAU;EACd,KAAK,MAAM,SAAS,GAAG,QACrB,WACE,MAAM,SAAS,wBACX,iBAAiB,OAAO,QAAQ,CAAC,IACjC,YAAY,OAAO,QAAQ,CAAC;EAEpC,MAAM,UAAU,kBAAkB,EAAE,KAAK,UAAU,UAAU;EAC7D,QAAQ,OAAO,QAAQ,GAAG,EAAE,OAAO,GAAG,WAAW,KAAK,QAAQ;CAChE;CAEA,QAAQ;CACR,OAAO;AACT;;;;;;;;;;;AAYA,SAAS,kBAAkB,IAAc,GAAkC;CACzE,OAAO,mBAAmB,OAAO,QAAQ,GAAG,UAAU,IAAI,GAAG,YAAY,QAAQ,EAAE,GAAG;AACxF;;;;;;;;;;AAWA,SAAS,eAAe,IAAc,GAAY,SAAmC;CACnF,MAAM,IAAI,EAAE;CACZ,MAAM,QAAkB,CAAC;CAEzB,KAAK,MAAM,CAAC,KAAK,WAAW,kBAAkB,IAAI,CAAC,GAAG;EACpD,IAAI,QAAQ,SAAS;EACrB,MAAM,WAAW,GAAG,EAAE,GAAG,aAAa,GAAG,EAAE;EAC3C,MAAM,YAAY,EAAE,MAAM,QAAQ,EAAE,OAAO,SAAS,CAAC;EACrD,IAAI,cAAc,MAAM,OAAO;EAC/B,MAAM,KAAK,SAAS;CACtB;CAOA,IAAI,GAAG,QAAQ;EACb,MAAM,OAAO,OAAO,KAAK,GAAG,UAAU;EACtC,MAAM,SAAS,EAAE,KAAK,IAAI;EAC1B,MAAM,OAAO,kBAAkB,EAAE,KAAK,MAAM,GAAG;EAC/C,EAAE,IAAI,SAAS,KACb,YAAY,OAAO,2BAA2B,KAAK,8BACrD;EACA,MAAM,KAAK,GAAG,OAAO,GAAG,EAAE,EAAE;CAC9B;CAMA,IAAI,GAAG,UAAU;EACf,MAAM,KAAK,EAAE,KAAK,KAAK;EACvB,MAAM,KAAK,EAAE,KAAK,KAAK;EACvB,MAAM,cAAc,EAAE,OAAO,EAAE;EAC/B,MAAM,WAAW,YAAY,MAAM,GAAG,UAAU,EAAE,OAAO,GAAG,CAAC;EAC7D,IAAI,aAAa,MAAM,OAAO;EAC9B,IAAI,aAAa,QAAQ;GACvB,MAAM,SAAS,EAAE,KAAK,IAAI;GAC1B,MAAM,OAAO,kBAAkB,EAAE,KAAK,OAAO,KAAK,GAAG,UAAU,GAAG,EAAE;GACpE,EAAE,IAAI,SAAS,KACb,YAAY,OAAO,MAAM,iBAAiB,YAAY,KAAK,EAAE,MAAM,GAAG,GAAG,GAAG,OAAO,GAAG,cAAc,KAAK,KAAK,GAAG,KAAK,GAAG,SAAS,SAAS,+BAC7I;GACA,MAAM,KAAK,GAAG,OAAO,GAAG,EAAE,EAAE;EAC9B;CACF;CAGA,IAAI,GAAG,QACA;OAAA,MAAM,SAAS,GAAG,QACrB,IAAI,MAAM,SAAS,iBACjB,MAAM,KAAK,GAAG,mBAAmB,EAAE,KAAK,KAAK,EAAE,GAAG,EAAE,EAAE;OACjD,IAAI,MAAM,SAAS,uBACxB,MAAM,KAAK,oBAAoB,OAAO,GAAG,CAAC,CAAC;CAAA;CAKjD,OAAO;AACT;AAEA,SAAgB,WAAW,IAAc,GAA2B;CAOlE,MAAM,IAAI,EAAE;CACZ,MAAM,OAAO,eAAe,IAAI,GAAG,EAAE,WAAW;CAChD,IAAI,SAAS,MAAM,OAAO;CAK1B,IAAI,EAAE,gBAAgB,KAAA,GACpB,OAAO,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,IAAI;CAE7C,OAAO;EAAC,UAAU,EAAE;EAAc,GAAG,EAAE;EAAU,kBAAkB,EAAE;EAAI,GAAG;CAAI,CAAC,CAAC,KAAK,IAAI;AAC7F"}

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

@@ -1,5 +1,6 @@
-import type { OptionalIR, SchemaIR } from "../../types.js";
-import type { FastGen, SlowGen } from "../context.js";
+import { OptionalIR, SchemaIR } from "../../types.js";
+import { FastGen, SlowGen } from "../context.js";
+//#region src/core/codegen/schemas/optional.d.ts
 /**
  * Zod's `.optional()` short-circuits `undefined → undefined`, EXCEPT when its
  * inner chain applies a default to undefined: `z.string().default("d").optional()`
@@ -9,9 +10,11 @@ import type { FastGen, SlowGen } from "../context.js";
  * a value; `catch`, object-field defaults, and plain types do not, so the optional
  * legitimately short-circuits there. Peel optional/nullable wrappers to decide.
  */
-export declare function innerAppliesDefaultOnUndefined(ir: SchemaIR): boolean;
-export declare function slowOptional(ir: SchemaIR & {
-    type: "optional";
+declare function innerAppliesDefaultOnUndefined(ir: SchemaIR): boolean;
+declare function slowOptional(ir: SchemaIR & {
+  type: "optional";
 }, g: SlowGen): string;
-export declare function fastOptional(ir: OptionalIR, g: FastGen): string | null;
+declare function fastOptional(ir: OptionalIR, g: FastGen): string | null;
+//#endregion
+export { fastOptional, innerAppliesDefaultOnUndefined, slowOptional };
 //# sourceMappingURL=optional.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"optional.d.ts","sourceRoot":"","sources":["../../../../src/core/codegen/schemas/optional.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;AAItD;;;;;;;;GAQG;AACH,wBAAgB,8BAA8B,CAAC,EAAE,EAAE,QAAQ,GAAG,OAAO,CAIpE;AAED,wBAAgB,YAAY,CAAC,EAAE,EAAE,QAAQ,GAAG;IAAE,IAAI,EAAE,UAAU,CAAA;CAAE,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,CAcpF;AAED,wBAAgB,YAAY,CAAC,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAOtE"}
+{"version":3,"file":"optional.d.ts","names":[],"sources":["../../../../src/core/codegen/schemas/optional.ts"],"mappings":";;;;;;;;;;;;iBAcgB,+BAA+B,IAAI;iBAMnC,aAAa,IAAI;EAAa;GAAoB,GAAG;iBAgBrD,aAAa,IAAI,YAAY,GAAG"}

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

@@ -1,42 +1,34 @@
 import { fastSentinelWrapper } from "../context.js";
 import { emit } from "../emit.js";
+//#region src/core/codegen/schemas/optional.ts
 /**
- * Zod's `.optional()` short-circuits `undefined → undefined`, EXCEPT when its
- * inner chain applies a default to undefined: `z.string().default("d").optional()`
- * yields "d", not undefined (the default fires THROUGH the optional, and through
- * any nullable/optional wrappers between them — `default().nullish()`,
- * `default().optional().nullable()`, ...). Only `default` consumes undefined into
- * a value; `catch`, object-field defaults, and plain types do not, so the optional
- * legitimately short-circuits there. Peel optional/nullable wrappers to decide.
- */
-export function innerAppliesDefaultOnUndefined(ir) {
-    let cur = ir;
-    while (cur.type === "optional" || cur.type === "nullable")
-        cur = cur.inner;
-    return cur.type === "default";
+* Zod's `.optional()` short-circuits `undefined → undefined`, EXCEPT when its
+* inner chain applies a default to undefined: `z.string().default("d").optional()`
+* yields "d", not undefined (the default fires THROUGH the optional, and through
+* any nullable/optional wrappers between them — `default().nullish()`,
+* `default().optional().nullable()`, ...). Only `default` consumes undefined into
+* a value; `catch`, object-field defaults, and plain types do not, so the optional
+* legitimately short-circuits there. Peel optional/nullable wrappers to decide.
+*/
+function innerAppliesDefaultOnUndefined(ir) {
+	let cur = ir;
+	while (cur.type === "optional" || cur.type === "nullable") cur = cur.inner;
+	return cur.type === "default";
 }
-export function slowOptional(ir, g) {
-    // Pass-through wrapper: forward the union abort flag (zod returns the inner
-    // payload unchanged, so a pipe inner's `aborted` must reach the option).
-    const fwd = { aborted: g.aborted };
-    // When the inner chain handles undefined (a default), undefined must flow into
-    // it so the default applies — the inner code already gates on undefined itself.
-    if (innerAppliesDefaultOnUndefined(ir.inner)) {
-        return `${g.visit(ir.inner, fwd)}\n`;
-    }
-    return `${emit `
+function slowOptional(ir, g) {
+	const fwd = { aborted: g.aborted };
+	if (innerAppliesDefaultOnUndefined(ir.inner)) return `${g.visit(ir.inner, fwd)}\n`;
+	return `${emit`
     if(${g.input}!==undefined){
       ${g.visit(ir.inner, fwd)}
     }
   `}\n`;
 }
-export function fastOptional(ir, g) {
-    // Same rule as the slow path: an inner default needs undefined to reach it, so
-    // drop the `===undefined` shortcut (which would let safeParse return the raw
-    // undefined before the eager slow path applies the default). The inner
-    // fast-default expr already returns false on undefined, routing to the slow path.
-    if (innerAppliesDefaultOnUndefined(ir.inner))
-        return g.visit(ir.inner);
-    return fastSentinelWrapper(g, ir.inner, "===undefined", "||");
+function fastOptional(ir, g) {
+	if (innerAppliesDefaultOnUndefined(ir.inner)) return g.visit(ir.inner);
+	return fastSentinelWrapper(g, ir.inner, "===undefined", "||");
 }
+//#endregion
+export { fastOptional, innerAppliesDefaultOnUndefined, slowOptional };
+
 //# sourceMappingURL=optional.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"optional.js","sourceRoot":"","sources":["../../../../src/core/codegen/schemas/optional.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAC;AACpD,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAElC;;;;;;;;GAQG;AACH,MAAM,UAAU,8BAA8B,CAAC,EAAY;IACzD,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,OAAO,GAAG,CAAC,IAAI,KAAK,UAAU,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU;QAAE,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC;IAC3E,OAAO,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC;AAChC,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,EAAmC,EAAE,CAAU;IAC1E,4EAA4E;IAC5E,yEAAyE;IACzE,MAAM,GAAG,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;IACnC,+EAA+E;IAC/E,gFAAgF;IAChF,IAAI,8BAA8B,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7C,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC;IACvC,CAAC;IACD,OAAO,GAAG,IAAI,CAAA;SACP,CAAC,CAAC,KAAK;QACR,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC;;GAE3B,IAAI,CAAC;AACR,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,EAAc,EAAE,CAAU;IACrD,+EAA+E;IAC/E,6EAA6E;IAC7E,uEAAuE;IACvE,kFAAkF;IAClF,IAAI,8BAA8B,CAAC,EAAE,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;IACvE,OAAO,mBAAmB,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC;AAChE,CAAC"}
+{"version":3,"file":"optional.js","names":[],"sources":["../../../../src/core/codegen/schemas/optional.ts"],"sourcesContent":["import type { OptionalIR, SchemaIR } from \"../../types.js\";\nimport type { FastGen, SlowGen } from \"../context.js\";\nimport { fastSentinelWrapper } from \"../context.js\";\nimport { emit } from \"../emit.js\";\n\n/**\n * Zod's `.optional()` short-circuits `undefined → undefined`, EXCEPT when its\n * inner chain applies a default to undefined: `z.string().default(\"d\").optional()`\n * yields \"d\", not undefined (the default fires THROUGH the optional, and through\n * any nullable/optional wrappers between them — `default().nullish()`,\n * `default().optional().nullable()`, ...). Only `default` consumes undefined into\n * a value; `catch`, object-field defaults, and plain types do not, so the optional\n * legitimately short-circuits there. Peel optional/nullable wrappers to decide.\n */\nexport function innerAppliesDefaultOnUndefined(ir: SchemaIR): boolean {\n  let cur = ir;\n  while (cur.type === \"optional\" || cur.type === \"nullable\") cur = cur.inner;\n  return cur.type === \"default\";\n}\n\nexport function slowOptional(ir: SchemaIR & { type: \"optional\" }, g: SlowGen): string {\n  // Pass-through wrapper: forward the union abort flag (zod returns the inner\n  // payload unchanged, so a pipe inner's `aborted` must reach the option).\n  const fwd = { aborted: g.aborted };\n  // When the inner chain handles undefined (a default), undefined must flow into\n  // it so the default applies — the inner code already gates on undefined itself.\n  if (innerAppliesDefaultOnUndefined(ir.inner)) {\n    return `${g.visit(ir.inner, fwd)}\\n`;\n  }\n  return `${emit`\n    if(${g.input}!==undefined){\n      ${g.visit(ir.inner, fwd)}\n    }\n  `}\\n`;\n}\n\nexport function fastOptional(ir: OptionalIR, g: FastGen): string | null {\n  // Same rule as the slow path: an inner default needs undefined to reach it, so\n  // drop the `===undefined` shortcut (which would let safeParse return the raw\n  // undefined before the eager slow path applies the default). The inner\n  // fast-default expr already returns false on undefined, routing to the slow path.\n  if (innerAppliesDefaultOnUndefined(ir.inner)) return g.visit(ir.inner);\n  return fastSentinelWrapper(g, ir.inner, \"===undefined\", \"||\");\n}\n"],"mappings":";;;;;;;;;;;;AAcA,SAAgB,+BAA+B,IAAuB;CACpE,IAAI,MAAM;CACV,OAAO,IAAI,SAAS,cAAc,IAAI,SAAS,YAAY,MAAM,IAAI;CACrE,OAAO,IAAI,SAAS;AACtB;AAEA,SAAgB,aAAa,IAAqC,GAAoB;CAGpF,MAAM,MAAM,EAAE,SAAS,EAAE,QAAQ;CAGjC,IAAI,+BAA+B,GAAG,KAAK,GACzC,OAAO,GAAG,EAAE,MAAM,GAAG,OAAO,GAAG,EAAE;CAEnC,OAAO,GAAG,IAAI;SACP,EAAE,MAAM;QACT,EAAE,MAAM,GAAG,OAAO,GAAG,EAAE;;IAE3B;AACJ;AAEA,SAAgB,aAAa,IAAgB,GAA2B;CAKtE,IAAI,+BAA+B,GAAG,KAAK,GAAG,OAAO,EAAE,MAAM,GAAG,KAAK;CACrE,OAAO,oBAAoB,GAAG,GAAG,OAAO,gBAAgB,IAAI;AAC9D"}

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

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

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

@@ -1 +1 @@
-{"version":3,"file":"pipe.d.ts","sourceRoot":"","sources":["../../../../src/core/codegen/schemas/pipe.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AACvD,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAEtD,wBAAgB,QAAQ,CAAC,EAAE,EAAE,QAAQ,GAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,CAe5E;AAED,wBAAgB,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAU9D"}
+{"version":3,"file":"pipe.d.ts","names":[],"sources":["../../../../src/core/codegen/schemas/pipe.ts"],"mappings":";;;iBAGgB,SAAS,IAAI;EAAa;GAAgB,GAAG;iBAiB7C,SAAS,IAAI,QAAQ,GAAG"}