zod-compiler 1.26.1 → 1.26.2

package/dist/core/codegen/context.js

@@ -100,17 +100,62 @@ function emitRfDelegate(ctx, refIndex) {
 	if (!ctx.preamble.includes(decl)) ctx.preamble.push(decl);
 	return name;
 }
-/** Capture a pristine Zod method without allocating a bound function. */
-function emitRfMethod(ctx, refIndex) {
-	const name = `__rfm_${refIndex}`;
-	const decl = `var ${name}=__rf[${refIndex}].safeParse;`;
+/**
+* Identifier `generateIIFE` binds the retained Zod schema to, once per export.
+*
+* Compact delegation reaches the schema through this binding rather than
+* through `__rf[]`. Routing it through the array meant every compact validator
+* — the common case being one with no fallback refs at all — declared a
+* one-element `var __rf=[__zs];` whose only reads were `__rf[0]`, i.e. an array
+* allocation per compiled schema at module init to alias a binding that was
+* already in scope. Naming the schema directly also keeps the reference a
+* foldable constant instead of an element load (the same reason
+* {@link emitEffectCallable} aliases its `__rf[N]` into a preamble binding).
+*/
+const RETAINED_SCHEMA_VAR = "__zs";
+/**
+* Capture the retained schema's pristine `safeParse` without allocating a bound
+* function. Declared in the preamble, which `generateIIFE` places after the
+* `__zs` binding and before the trailing `__zcMkv` call — so the capture is
+* zod's own implementation, never the compiled delegate that call installs
+* (see {@link emitRfDelegate} for the recursion this avoids).
+*/
+function emitRetainedMethod(ctx) {
+	const name = "__rfm_z";
+	const decl = `var ${name}=${RETAINED_SCHEMA_VAR}.safeParse;`;
 	if (!ctx.preamble.includes(decl)) ctx.preamble.push(decl);
 	return name;
 }
 /**
+* Is a RegExp built with these flags safe to share between validators?
+*
+* `g` and `y` make the object STATEFUL: `.test()` advances `lastIndex` and the
+* next call resumes from there. Generated code is already correct about this —
+* every flagged site emits a `lastIndex=0` reset first (see `lastIndexReset` in
+* schemas/string.ts, the only generator that passes flags through) — so pooling
+* them would in fact work today.
+*
+* They are held back anyway, because the pool changes what a future lapse
+* costs. A missing reset on a validator-local regex misbehaves inside one
+* export, deterministically. On a pooled one it misbehaves across exports, and
+* only in the order the module happens to evaluate them. Flagged patterns are
+* rare enough that the sharing is not worth buying that failure mode. Every
+* other flag (`i`, `m`, `s`, `u`, `v`, `d`) is pure configuration and pools like
+* any other constant.
+*/
+function isPoolableRegex(flags) {
+	return flags === void 0 || !/[gy]/.test(flags);
+}
+/**
 * Resolve a regex pattern to a runtime variable name.
-* Lean mode short-circuits well-known patterns to virtual-module names so the
-* bundler can dedup across files; everything else is cached + declared in the
+*
+* Three layers, widest first. Lean mode short-circuits well-known patterns to
+* virtual-module names, deduping them across the whole bundle. What is left is
+* pooled at FILE level when two or more validators build the identical RegExp —
+* the same bargain Sets get, and a larger one in practice: a repeated enum is
+* one `new Set([...])`, while a repeated `z.iso.datetime()` or shared
+* `.regex()` is a several-hundred-byte pattern plus a RegExp construction per
+* validator at module init. Anything still unique is cached and declared in the
 * per-IIFE preamble exactly once per pattern.
 */
 function emitRegex(ctx, prefix, pattern, flags) {
@@ -124,10 +169,10 @@ function emitRegex(ctx, prefix, pattern, flags) {
 	const cacheKey = flags ? `${flags}\u0000${pattern}` : pattern;
 	const cached = ctx.regexCache.get(cacheKey);
 	if (cached) return cached;
-	const name = `__re_${prefix}_${ctx.counter++}`;
 	const flagsArg = flags ? `,${escapeString(flags)}` : "";
-	const testSource = flags ? null : fastTestSource(pattern);
-	ctx.preamble.push(`var ${name}=new RegExp(${escapeString(testSource ?? pattern)}${flagsArg});`);
+	const initializer = `new RegExp(${escapeString((flags ? null : fastTestSource(pattern)) ?? pattern)}${flagsArg})`;
+	const localPrefix = `re_${prefix}`;
+	const name = isPoolableRegex(flags) ? emitPooledConstant(ctx, "Rx", localPrefix, initializer) : emitConstant(ctx, localPrefix, initializer);
 	ctx.regexCache.set(cacheKey, name);
 	return name;
 }
@@ -174,18 +219,32 @@ function emitConstant(ctx, prefix, initializer) {
 	ctx.valueCache.set(initializer, name);
 	return name;
 }
-/** Declare a `new Set([...])` in the preamble and return its variable name. */
-function emitSet(ctx, prefix, values) {
-	const initializer = `new Set(${JSON.stringify([...values])})`;
-	const sharedName = ctx.sharedSetNames?.get(initializer);
+/**
+* Declare a poolable constant in the preamble and return its variable name —
+* unless the file pipeline has already decided to hoist this exact initializer
+* to module scope, in which case the shared name is returned and nothing is
+* declared locally.
+*
+* The pipeline learns which initializers repeat by running codegen once and
+* collecting what was reported here, so every poolable constant must route
+* through this function rather than calling {@link emitConstant} directly.
+*/
+function emitPooledConstant(ctx, kind, localPrefix, initializer) {
+	const sharedName = ctx.sharedConstantNames?.get(initializer);
 	if (sharedName !== void 0) return sharedName;
-	const name = emitConstant(ctx, `set_${prefix}`, initializer);
-	ctx.onSetConstant?.({
+	const name = emitConstant(ctx, localPrefix, initializer);
+	ctx.onConstant?.({
+		kind,
 		name,
 		initializer
 	});
 	return name;
 }
+/** Declare a `new Set([...])` in the preamble and return its variable name. */
+function emitSet(ctx, prefix, values) {
+	const initializer = `new Set(${JSON.stringify([...values])})`;
+	return emitPooledConstant(ctx, "Set", `set_${prefix}`, initializer);
+}
 /**
 * Shape-key count at or below which the unknown-key pass compares with an
 * inline `===` chain rather than a hashed lookup.
@@ -466,6 +525,6 @@ function checkPriority(a, b) {
 	return (CHECK_PRIORITY[a.kind] ?? 99) - (CHECK_PRIORITY[b.kind] ?? 99);
 }
 //#endregion
-export { ENUM_INLINE_THRESHOLD, KEY_MEMBERSHIP_INLINE_THRESHOLD, checkPriority, declareFastTemps, emitConstant, emitEffectCallable, emitEffectFn, emitRegex, emitRegexSourceString, emitRfDelegate, emitRfMethod, emitRuntimeHelper, emitSet, emitTemp, escapeString, extendPath, extendStaticPath, extendStaticPathIndex, fastSentinelWrapper, hasMutation, hasSourceForm, keyMembershipTest, literalToJs, outputAlwaysDefined, rejectsUndefined, tuplePadsShortInput };
+export { ENUM_INLINE_THRESHOLD, KEY_MEMBERSHIP_INLINE_THRESHOLD, RETAINED_SCHEMA_VAR, checkPriority, declareFastTemps, emitConstant, emitEffectCallable, emitEffectFn, emitPooledConstant, emitRegex, emitRegexSourceString, emitRetainedMethod, emitRfDelegate, emitRuntimeHelper, emitSet, emitTemp, escapeString, extendPath, extendStaticPath, extendStaticPathIndex, fastSentinelWrapper, hasMutation, hasSourceForm, keyMembershipTest, literalToJs, outputAlwaysDefined, rejectsUndefined, tuplePadsShortInput };
 
 //# sourceMappingURL=context.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"context.js","names":[],"sources":["../../../src/core/codegen/context.ts"],"sourcesContent":["import type {\n  BigIntCheckIR,\n  CheckIR,\n  DateCheckIR,\n  LiteralValue,\n  SchemaIR,\n  SetCheckIR,\n} from \"../types.js\";\nimport type { SharedSchemaPlan } from \"./dedupe.js\";\nimport {\n  fastTestSource,\n  lookupWellKnownRegex,\n  wellKnownRegexSourceName,\n} from \"./well-known-regex.js\";\n\n/** Codegen output mode. \"inline\" emits self-contained code (CLI .compiled.ts). \"lean\" emits references to imports from \"virtual:zod-compiler/runtime\" (unplugin). */\nexport type CodegenMode = \"inline\" | \"lean\";\n\n/** A Set declaration emitted while generating one validator. */\nexport interface GeneratedSetConstant {\n  readonly name: string;\n  readonly initializer: string;\n}\n\nexport interface CodeGenResult {\n  code: string;\n  functionDef: string;\n  /** Number of fallback schemas referenced by __rf[N] in the generated code. 0 = no fallbacks. */\n  refCount: number;\n  /**\n   * Helper names referenced by this schema in lean mode (e.g. \"__zcTS\", \"__zcReEmail\").\n   * Used by the unplugin transform to construct the `import { ... } from \"virtual:zod-compiler/runtime\"` line.\n   * Always empty in inline mode.\n   */\n  usedHelpers: Set<string>;\n  /**\n   * Name of the hosted fast-check boolean function in the preamble (null when\n   * the schema has no Fast Path). generateIIFE passes it to __zcMkv so parse()\n   * and parseAsync() can return valid input without allocating an\n   * intermediate SafeParseResult.\n   */\n  fastFnName: string | null;\n  /**\n   * True when `fastFnName` is a TOTAL predicate: `fc(input) === true` iff the\n   * schema accepts `input` (mutation-free schemas, where a fast-check failure\n   * can never become a slow-path success). generateIIFE installs it as the\n   * zero-allocation `.is()` guard. False for partial fast paths\n   * (default/catch — `fc` only shortcuts present-and-valid input, so a `false`\n   * result does NOT imply rejection) and for schemas with no fast path, such as\n   * coercion; `.is()` then derives from `safeParse(input).success`.\n   */\n  fastTotal: boolean;\n  /**\n   * Hosted predicate installed as `.is()`, when it differs from `fastFnName`.\n   * A schema that rebuilds its output has no by-reference shortcut (so\n   * `fastFnName` is null) yet still has an exact acceptance predicate, because\n   * stripping reshapes the payload and never the verdict.\n   */\n  isFnName?: string | null;\n  /**\n   * Compact mode only: the `__rf[N]` index this validator delegates its cold\n   * error path to (the schema itself, captured as a fresh root RefEntry). When\n   * set, the pipeline appends a `{ schema, accessPath: \"\" }` entry at this index\n   * so `generateIIFE` materializes `__rf[N]` as the original Zod schema. Absent\n   * for every non-compact (fully compiled) validator.\n   */\n  rootDelegateRefIndex?: number;\n}\n\n/** Hosted-validator names for one recursion target (see CodeGenContext.recTargets). */\nexport interface RecTargetGen {\n  /** True for the root target (refId 0) — reuses the schema's own functions. */\n  isRoot: boolean;\n  /**\n   * safeParse-shaped slow validator name: `safeParse_<name>` for the root,\n   * `__rsp_N` for a non-root target. `slowRecursiveRef` calls this.\n   */\n  slowName: string;\n  /**\n   * Boolean fast-check name (`__fcr_N`). Allocated lazily for the root (mirrors\n   * recFastName), eagerly for non-root targets. Absent until the fast path\n   * reaches a ref to this target.\n   */\n  fastName?: string;\n  /** Inner IR hosted as the standalone validator body (non-root targets only). */\n  inner?: SchemaIR;\n}\n\n/** Shared mutable state for code generation. Fast and slow paths share the same instance. */\nexport interface CodeGenContext {\n  preamble: string[];\n  counter: number;\n  fnName: string;\n  /** Deduplicates regex patterns: same pattern string → same preamble variable name. */\n  regexCache: Map<string, string>;\n  /** Codegen output mode. */\n  mode: CodegenMode;\n  /** Names of helpers from \"virtual:zod-compiler/runtime\" referenced in this schema (lean mode only). */\n  usedHelpers: Set<string>;\n  /**\n   * Name of the fast-path boolean helper for the ROOT recursion target\n   * (refId 0), allocated on first fastRecursiveRef visit. generateValidator\n   * wraps the root fast expression as `function <name>(input){return <expr>;}`\n   * so recursive refs can call it. undefined = root has no recursion on the\n   * fast path.\n   */\n  recFastName?: string;\n  /**\n   * Hosted-validator name table for recursion targets, keyed by refId. Entry 0\n   * is the root (the schema's own `safeParse_<name>` / `recFastName`); entries\n   * ≥ 1 are non-root targets hosted as standalone `__rsp_N` (slow) / `__fcr_N`\n   * (fast) helpers. `recursiveRef`/`recursionTarget` generators look up the\n   * call target here. Undefined when not generating a full validator (e.g. unit\n   * tests calling a single generator) — treated as root-only.\n   */\n  recTargets?: Map<number, RecTargetGen>;\n  /** Dedup cache for hosted zero-capture effect functions: source text → preamble var. */\n  effectFnCache?: Map<string, string>;\n  /** Dedup cache for constant preamble declarations: initializer text → preamble var. */\n  valueCache?: Map<string, string>;\n  /** Reports generated Sets so the file pipeline can share exact duplicates across validators. */\n  onSetConstant?: ((constant: GeneratedSetConstant) => void) | undefined;\n  /** Exact Set initializer → file-level name, populated by the pipeline's second codegen pass. */\n  sharedSetNames?: ReadonlyMap<string, string> | undefined;\n  /** Name of the build path's FAIL sentinel, declared once per validator. */\n  buildFailName?: string;\n  /** Hosted build-function name per recursion target refId, so back-edges resolve. */\n  buildRecNames?: Map<number, string>;\n  /**\n   * Set by the build path when it emitted a `.default()` substitution. Such a\n   * schema ACCEPTS an input its fast expression rejects — `fastDefault` demands a\n   * present value, since the fast path's contract is `data === input` and a\n   * substituted default is not the input — so the expression is no longer an\n   * exact acceptance predicate and must not be installed as `.is()`. Stripping,\n   * by contrast, reshapes only the payload, which is why a build-path schema\n   * otherwise still hands its predicate over.\n   */\n  buildSubstitutesValue?: boolean;\n  /** Memo for estimateFastCost (size-gated fast-check extraction). Lazily created. */\n  fastSizeCache?: WeakMap<SchemaIR, number>;\n  /** Memo for estimateRuntimeCost (cheapest-first check ordering). Lazily created. */\n  fastRuntimeCostCache?: WeakMap<SchemaIR, number>;\n  /**\n   * File-level shared slow-walk plan. Set only when generating a mutation-free\n   * schema (so shared walks stay on the deferred cold path); the slow-path\n   * visit() consults it to replace a repeated sub-IR with a `__zcSw_N` call.\n   */\n  sharedSchemas?: SharedSchemaPlan;\n}\n\n// ─── Slow Path context ────────────────────────────────────────────────────────\n\n/** Context object for slow-path (error-collecting) generator functions. */\nexport interface SlowGen {\n  readonly input: string;\n  readonly output: string;\n  readonly path: string;\n  readonly issues: string;\n  readonly ctx: CodeGenContext;\n  /**\n   * Schema-level static error message of the node being generated\n   * (z.string({ error: \"...\" })). Default message for issues this node emits\n   * when the individual check has no message of its own. Set by generateSlow()\n   * from ir.typeMessage; never inherited by child nodes.\n   */\n  readonly typeMsg?: string | undefined;\n\n  /**\n   * Name of a boolean variable that this node sets to `true` when it aborts in\n   * the zod sense (`payload.aborted`) — currently only a pipe/codec whose `in`\n   * step fails (zod's `handlePipeResult` sets `left.aborted = true`). A `union`\n   * allocates one per option and reads it during pruning so a pipe option whose\n   * `in` failed counts as aborted even when its only issue is a non-aborting\n   * `custom`/check-level code. Undefined when the node is not inside an\n   * abort-tracking option, in which case the abort is a no-op.\n   *\n   * Unlike input/output/path/issues, this is NOT inherited by `visit()`: it is\n   * cleared at every boundary unless a node explicitly forwards it (the\n   * pass-through wrappers optional/nullable/readonly do), mirroring how zod\n   * propagates `payload.aborted` through transparent wrappers but not across\n   * container boundaries.\n   */\n  readonly aborted?: string | undefined;\n\n  /**\n   * Recursively generate validation for a child IR node.\n   * input/output/path/issues are inherited from parent unless overridden;\n   * `aborted` is the exception — it is only set when explicitly passed (see the\n   * `aborted` field doc), so it never leaks into container children.\n   * Union generators use `{ issues }` to redirect child errors to temporary arrays.\n   * Container generators use `{ input, output, path }` for element traversal.\n   */\n  visit(\n    ir: SchemaIR,\n    overrides?: {\n      input?: string;\n      output?: string;\n      path?: string;\n      issues?: string;\n      // `| undefined` (unlike the others): pass-through wrappers forward\n      // `g.aborted` verbatim, which is undefined outside an abort-tracking option.\n      aborted?: string | undefined;\n    },\n  ): string;\n\n  /** Generate a unique temp variable name: `__${prefix}_${counter++}` */\n  temp(prefix: string): string;\n\n  /** Add a regex to preamble and return the variable name. */\n  regex(prefix: string, pattern: string, flags?: string): string;\n\n  /** Add a Set to preamble and return the variable name. */\n  set(prefix: string, values: readonly unknown[]): string;\n}\n\n/** Slow-path generator function signature — registered in slowRegistry. */\nexport type SlowGenerator<T extends SchemaIR = SchemaIR> = (ir: T, g: SlowGen) => string;\n\n// ─── Fast Path context ────────────────────────────────────────────────────────\n\n/**\n * Per-emitted-function size accumulator for size-gated fast-check extraction.\n * Shared by every node inlined into the same function; a fresh instance starts\n * each hosted helper (and the root). See fast-size.ts / generateFast.\n */\nexport interface FastScope {\n  used: number;\n  /**\n   * `var` temps that the function this scope is assembling must declare, in\n   * allocation order. Populated by {@link FastGen.local}; every site that\n   * materializes a function body from a fresh scope emits\n   * {@link declareFastTemps} at the top of that body.\n   *\n   * Function-scoped (never module-scoped) is load-bearing: a recursive\n   * validator re-enters itself while an outer frame still holds a live temp,\n   * and each invocation needs its own binding.\n   */\n  temps: string[];\n}\n\n/** `var a,b;` declaration for a scope's temps, or \"\" when it allocated none. */\nexport function declareFastTemps(scope: FastScope): string {\n  return scope.temps.length > 0 ? `var ${scope.temps.join(\",\")};` : \"\";\n}\n\n/**\n * Fast check for a wrapper that compares its input against a sentinel and\n * otherwise delegates to an inner schema — `optional` (`===undefined`),\n * `nullable` (`===null`) and `default` (`!==undefined`).\n *\n * Written naively these read the input TWICE: once for the sentinel test and\n * again inside the inner check (which may itself read it several more times —\n * `typeof x===\"string\"&&x.length>=3&&x.length<=20`). V8's load elimination\n * removes the repeats only while the access is monomorphic; on the polymorphic\n * and megamorphic call sites real payloads produce (an array of objects with\n * differing key order, anything out of `JSON.parse`) every repeat is a fresh\n * megamorphic lookup. Binding the value to a local once is worth 1.1-1.7x on\n * the whole object check when the optional key is present, and is neutral when\n * it is absent.\n *\n * Only hoisted when the input is a property access; a bare local (an array\n * element variable, a record value) is already a single load, so it keeps the\n * shorter form and byte-identical output.\n */\nexport function fastSentinelWrapper(\n  g: FastGen,\n  innerIR: SchemaIR,\n  sentinel: string,\n  joiner: \"&&\" | \"||\",\n): string | null {\n  if (!isPropertyAccess(g.input)) {\n    const inner = g.visit(innerIR);\n    return inner === null ? null : `(${g.input}${sentinel}${joiner}(${inner}))`;\n  }\n  const value = g.local(\"w\");\n  const inner = g.visit(innerIR, { input: value });\n  if (inner === null) return null;\n  return `((${value}=${g.input})${sentinel}${joiner}(${inner}))`;\n}\n\n/** True for an expression that performs a property load (`x[\"a\"]`, `x.a`, `x[0][1]`). */\nfunction isPropertyAccess(expr: string): boolean {\n  return expr.includes(\"[\") || expr.includes(\".\");\n}\n\n/** Context object for fast-path (boolean expression) generator functions. */\nexport interface FastGen {\n  readonly input: string;\n  readonly ctx: CodeGenContext;\n\n  /**\n   * Whether the CURRENT node may be hoisted into its own boolean helper when it\n   * (with the already-emitted siblings) would overflow the function size cap.\n   * False for the root and for a helper's own top node — those are already their\n   * own function — but their children are extractable. See generateFast.\n   */\n  readonly extractable: boolean;\n\n  /** Accumulated size (≈ chars) of the function currently being assembled. */\n  readonly scope: FastScope;\n\n  /**\n   * Set on the gen for a discriminated-union option only: the discriminator\n   * key. Signals `fastObject` to omit its type-guard and skip re-checking that\n   * property (the switch already matched its value). Never propagated to child\n   * nodes — nested objects keep their own guard.\n   */\n  readonly discSkipKey?: string | undefined;\n\n  /**\n   * Recursively generate fast-check expression for a child IR node.\n   * Returns null if any child is ineligible for fast path.\n   */\n  visit(ir: SchemaIR, overrides?: { input?: string; discSkipKey?: string }): string | null;\n\n  /**\n   * A FastGen for emitting a SEPARATE function body (a hand-built preamble\n   * helper such as a discriminated-union switch or an array-element loop). It\n   * carries a FRESH size accumulator, so the helper's own content is size-gated\n   * against the cap independently of the caller — without this, a helper's body\n   * accrues to the caller's scope while the helper itself grows unbounded.\n   */\n  scoped(input: string): FastGen;\n\n  /** Generate a unique temp variable name. */\n  temp(prefix: string): string;\n\n  /**\n   * Allocate a unique name AND record it on this scope so the enclosing\n   * emitted function declares it as a `var` (see {@link FastScope.temps}).\n   * Use for a value bound inside an expression — `(t=x[\"k\"])===undefined` —\n   * where `temp()` alone would leave the name undeclared.\n   */\n  local(prefix: string): string;\n\n  /** Add a regex to preamble and return the variable name. */\n  regex(prefix: string, pattern: string, flags?: string): string;\n}\n\n/** Fast-path generator function signature — registered in fastRegistry. */\nexport type FastGenerator<T extends SchemaIR = SchemaIR> = (ir: T, g: FastGen) => string | null;\n\n// ─── Shared emit helpers (used by both slow-path and fast-path factories) ────\n\n/** Allocate a fresh `__${prefix}_${n}` identifier and bump the shared counter. */\nexport function emitTemp(ctx: CodeGenContext, prefix: string): string {\n  return `__${prefix}_${ctx.counter++}`;\n}\n\n/**\n * Host a zero-capture effect function (refine predicate, transform,\n * overwrite) in the preamble and return its variable name. The inline\n * `(${source})(x)` form evaluates the function expression — allocating a\n * function object — on EVERY parse at every effect site, including inside\n * the \"zero-allocation\" fast chain. V8's escape analysis erases that in\n * optimized frames, but interpreter/baseline/deopt frames pay it, and the\n * full source text re-parses as bytecode at each site. Zero-capture sources\n * reference only their own parameters and safe globals by construction, so\n * a single preamble binding is semantically identical. Deduped per schema\n * by source text.\n */\nexport function emitEffectFn(ctx: CodeGenContext, source: string): string {\n  ctx.effectFnCache ??= new Map();\n  const cached = ctx.effectFnCache.get(source);\n  if (cached !== undefined) return cached;\n  const name = `__ef_${ctx.counter++}`;\n  ctx.preamble.push(`var ${name}=(${source});`);\n  ctx.effectFnCache.set(source, name);\n  return name;\n}\n\n/**\n * Callable expression for a user callback — a refine predicate or a transform.\n *\n * A zero-capture callback is hosted from its source text; one that CAPTURES\n * outer variables is called by reference through `__rf[N]` — the user's own\n * function object, reached from the schema — instead of costing the schema its\n * compiled path. The reference is aliased into a preamble binding rather than\n * re-read per call, for the same reason call-invoked helpers are (a per-call\n * array element load is not a foldable callee).\n */\nexport function emitEffectCallable(\n  ctx: CodeGenContext,\n  effect: { refIndex?: number | undefined; source?: string | undefined },\n): string {\n  if (effect.refIndex !== undefined) return emitConstant(ctx, \"rfn\", `__rf[${effect.refIndex}]`);\n  if (effect.source === undefined) {\n    throw new Error(\"effect has neither inlineable source nor a reference index\");\n  }\n  return emitEffectFn(ctx, effect.source);\n}\n\n/**\n * Pristine fallback delegate: declare `var __rfp_N=__rf[N].safeParse.bind(__rf[N]);`\n * in the preamble and return the variable name. Generated code must NEVER read\n * `__rf[N].safeParse` at parse time: `__zcMkv` installs the compiled safeParse as\n * an OWN property on the original schema object, and whenever `__rf[N]` is that\n * same object the read resolves to the compiled delegate itself — infinite\n * recursion (RangeError on every parse). The fallback entry and the __zcMkv\n * target ARE the same object in compile mode (schemaExpr is the compile()\n * argument identifier) and the CLI emitter ((__src_X as any).schema); in\n * autoDiscover mode they are two textually identical constructions that any\n * downstream CSE/dedup transform (babel-plugin-zod-hoist in a field incident)\n * collapses back into one. Capturing at IIFE evaluation — before the trailing\n * `return __zcMkv(...)` mutates anything — pins zod's own implementation; the\n * worst case under cross-validator merges is delegating to an equivalent\n * compiled validator (whose own delegates were captured even earlier), never\n * a cycle.\n */\nexport function emitRfDelegate(ctx: CodeGenContext, refIndex: number): string {\n  const name = `__rfp_${refIndex}`;\n  const decl = `var ${name}=__rf[${refIndex}].safeParse.bind(__rf[${refIndex}]);`;\n  if (!ctx.preamble.includes(decl)) {\n    ctx.preamble.push(decl);\n  }\n  return name;\n}\n\n/** Capture a pristine Zod method without allocating a bound function. */\nexport function emitRfMethod(ctx: CodeGenContext, refIndex: number): string {\n  const name = `__rfm_${refIndex}`;\n  const decl = `var ${name}=__rf[${refIndex}].safeParse;`;\n  if (!ctx.preamble.includes(decl)) {\n    ctx.preamble.push(decl);\n  }\n  return name;\n}\n\n/**\n * Resolve a regex pattern to a runtime variable name.\n * Lean mode short-circuits well-known patterns to virtual-module names so the\n * bundler can dedup across files; everything else is cached + declared in the\n * per-IIFE preamble exactly once per pattern.\n */\nexport function emitRegex(\n  ctx: CodeGenContext,\n  prefix: string,\n  pattern: string,\n  flags?: string,\n): string {\n  if (ctx.mode === \"lean\" && !flags) {\n    const wellKnown = lookupWellKnownRegex(pattern);\n    if (wellKnown !== null) {\n      ctx.usedHelpers.add(wellKnown);\n      return wellKnown;\n    }\n  }\n  const cacheKey = flags ? `${flags}\\u0000${pattern}` : pattern;\n  const cached = ctx.regexCache.get(cacheKey);\n  if (cached) return cached;\n  const name = `__re_${prefix}_${ctx.counter++}`;\n  const flagsArg = flags ? `,${escapeString(flags)}` : \"\";\n  // Flag-less patterns may carry a faster behavior-equivalent rewrite (a\n  // well-known table entry, repeat unrolling, or both); the regex OBJECT uses\n  // it while issue sites keep reporting the original pattern (see slowString).\n  const testSource = flags ? null : fastTestSource(pattern);\n  ctx.preamble.push(`var ${name}=new RegExp(${escapeString(testSource ?? pattern)}${flagsArg});`);\n  ctx.regexCache.set(cacheKey, name);\n  return name;\n}\n\n/**\n * Resolve the ORIGINAL `/source/flags` pattern string of a regex for issue\n * reporting. Only needed when emitRegex swapped in a faster equivalent test\n * pattern (the runtime regex's toString() would leak the rewrite). Lean mode\n * references the shared `<name>Src` virtual export so the original pattern\n * stays a single bundle-wide string; inline mode declares it once per IIFE.\n */\nexport function emitRegexSourceString(ctx: CodeGenContext, pattern: string): string {\n  if (ctx.mode === \"lean\") {\n    const srcName = wellKnownRegexSourceName(pattern);\n    if (srcName !== null) {\n      ctx.usedHelpers.add(srcName);\n      return srcName;\n    }\n  }\n  const cacheKey = `src\\u0000${pattern}`;\n  const cached = ctx.regexCache.get(cacheKey);\n  if (cached) return cached;\n  const name = `__res_${ctx.counter++}`;\n  ctx.preamble.push(`var ${name}=${escapeString(`/${pattern}/`)};`);\n  ctx.regexCache.set(cacheKey, name);\n  return name;\n}\n\n/**\n * Declare a constant value in the preamble and return its variable name,\n * reusing an earlier declaration of the SAME initializer.\n *\n * Value tables are reached from both halves of a validator — an enum's `Set`\n * from its fast check and again from its slow walk, a strict shape's key table\n * likewise — and repeat across sibling properties that share a value list. One\n * declaration per USE emitted the payload two or four times: measured 17% of a\n * 20-value enum schema's generated bytes, 16% for an object with two identical\n * enums. Keyed by initializer text, so only identical payloads collapse.\n */\nexport function emitConstant(ctx: CodeGenContext, prefix: string, initializer: string): string {\n  ctx.valueCache ??= new Map();\n  const cached = ctx.valueCache.get(initializer);\n  if (cached !== undefined) return cached;\n  const name = `__${prefix}_${ctx.counter++}`;\n  ctx.preamble.push(`var ${name}=${initializer};`);\n  ctx.valueCache.set(initializer, name);\n  return name;\n}\n\n/** Declare a `new Set([...])` in the preamble and return its variable name. */\nexport function emitSet(ctx: CodeGenContext, prefix: string, values: readonly unknown[]): string {\n  const initializer = `new Set(${JSON.stringify([...values])})`;\n  const sharedName = ctx.sharedSetNames?.get(initializer);\n  if (sharedName !== undefined) return sharedName;\n  const name = emitConstant(ctx, `set_${prefix}`, initializer);\n  ctx.onSetConstant?.({ name, initializer });\n  return name;\n}\n\n/**\n * Shape-key count at or below which the unknown-key pass compares with an\n * inline `===` chain rather than a hashed lookup.\n *\n * This is deliberately NOT {@link ENUM_INLINE_THRESHOLD}: the two look alike but\n * are different workloads. An enum compares schema literals against arbitrary\n * INPUT strings, which may be long, share prefixes, and are not necessarily\n * internalized — so a hashed set earns its keep quickly. A shape-key test\n * compares them against keys arriving from `for-in`, i.e. the object's own\n * internalized key strings, so every arm of the chain is a pointer compare that\n * V8 predicts perfectly, while `table[k]` / `set.has(k)` pays a string hash and\n * probe per key.\n *\n * Measured over a strict object's for-in pass (JSON-parsed input, 8 rotated\n * shapes), `===` chain vs the previous `{k:1}` table: 3.7x at 6 keys, 3.8x at\n * 10, 3.1x at 20, 3.1x at 48 — the chain still leads at 64 (283 ns vs 690) and\n * only loses past ~96, where `Set.has` (not the table, which never wins at any\n * size) takes over. 64 sits below that crossover and above any realistic shape.\n */\nexport const KEY_MEMBERSHIP_INLINE_THRESHOLD = 64;\n\n/**\n * Boolean membership test for one key variable against a fixed key list.\n * Empty list recognizes nothing.\n *\n * `Set.has` is the large-shape fallback rather than a `{key:1}` object table:\n * the table is also `__proto__`-hostile (an own `__proto__` key cannot be set\n * by an object literal, so that key would silently read as unknown), which the\n * Set has no trouble with.\n */\nexport function keyMembershipTest(\n  ctx: CodeGenContext,\n  keys: readonly string[],\n  keyVar: string,\n): string {\n  if (keys.length === 0) return \"false\";\n  if (keys.length <= KEY_MEMBERSHIP_INLINE_THRESHOLD) {\n    return keys.map((k) => `${keyVar}===${escapeString(k)}`).join(\"||\");\n  }\n  return `${emitSet(ctx, \"ks\", keys)}.has(${keyVar})`;\n}\n\n/**\n * Enum values at or below this count use inline === checks instead of Set.has().\n * Measured on V8: for ≤5 values, an === chain beats Set.has by up to ~3x with\n * realistic (distinct-prefix, JSON-parsed) values — V8 internalizes strings on\n * successful comparison, making subsequent arms pointer-equality — and is no\n * worse than Set.has even with adversarial shared-prefix values.\n */\nexport const ENUM_INLINE_THRESHOLD = 5;\n\nconst CHECK_PRIORITY: Record<string, number> = {\n  // Cheapest: length/size comparisons (O(1))\n  min_length: 10,\n  max_length: 11,\n  length_equals: 12,\n  min_size: 13,\n  max_size: 14,\n  // Number format checks (comparison + bitwise)\n  number_format: 15,\n  // Range comparisons\n  greater_than: 20,\n  less_than: 21,\n  bigint_greater_than: 20,\n  bigint_less_than: 21,\n  date_greater_than: 22,\n  date_less_than: 23,\n  // Modulo\n  multiple_of: 30,\n  bigint_multiple_of: 30,\n  // String prefix/suffix (O(prefix/suffix length))\n  starts_with: 40,\n  ends_with: 41,\n  // String search (O(n·m) worst case)\n  includes: 42,\n  // Regex (most expensive)\n  string_format: 50,\n};\n\nexport function escapeString(s: string | number): string {\n  return JSON.stringify(s);\n}\n\n/** The {@link LiteralValue}s that {@link literalToJs} can spell. */\nexport type SourceFormLiteral = string | number | boolean | null | bigint | undefined;\n\n/**\n * Can {@link literalToJs} render this value as JS source that strict-equals it?\n *\n * Total by construction — it NAMES the value kinds that have a source form\n * rather than excluding the ones that don't, so every reference value falls out\n * on the false side. That matters because `literalToJs` used to end in a bare\n * `JSON.stringify`, which does not fail loudly on the values it cannot spell:\n * for a symbol it RETURNS `undefined` (the value, not a string), so\n * `z.literal(sym)` compiled to the comparison `x===undefined` — rejecting the\n * symbol it was built from and accepting `undefined`. An object is mis-rendered\n * the other way: `{}` stringifies to `\"{}\"`, and `x==={}` is never true, so the\n * very object the schema was built from was rejected. Both take the runtime\n * membership path instead (see the literal generator).\n */\nexport function hasSourceForm(v: LiteralValue): v is SourceFormLiteral {\n  if (v === null) return true;\n  const t = typeof v;\n  return t === \"string\" || t === \"number\" || t === \"boolean\" || t === \"bigint\" || t === \"undefined\";\n}\n\n/**\n * JS source for a primitive literal value (literal schemas, discriminator\n * case labels). JSON.stringify covers string/number/boolean/null; bigint\n * needs the `n` suffix (JSON.stringify throws and String(5n) renders a\n * number literal that never strict-equals a bigint); undefined isn't JSON.\n *\n * The parameter type is deliberately NARROWER than {@link LiteralValue}: every\n * caller must first prove its value is spellable with {@link hasSourceForm}.\n */\nexport function literalToJs(v: SourceFormLiteral): string {\n  if (typeof v === \"bigint\") return `${v}n`;\n  if (v === undefined) return \"undefined\";\n  // JSON.stringify maps NaN/±Infinity to \"null\"; emit them as JS expressions so a\n  // non-finite numeric literal round-trips (z.literal(Infinity) must compare\n  // against Infinity, not null). String(NaN)=\"NaN\", String(Infinity)=\"Infinity\",\n  // String(-Infinity)=\"-Infinity\" — all valid JS that evaluate to the value.\n  if (typeof v === \"number\" && !Number.isFinite(v)) return String(v);\n  return JSON.stringify(v);\n}\n\n/**\n * Helpers that generated code invokes through `Function.prototype.call`, and\n * which therefore must be aliased into a module-local binding in lean mode.\n *\n * V8 folds a local `const` callee into a constant and inlines straight through\n * `x.call(...)`; an IMPORTED binding is a cell it will not fold, so the same\n * expression stays a generic property load plus a generic call — measured 4.5x\n * (5 keys) to 6.5x (20 keys) slower on the record fast path, 35.9 ns vs 7.2 ns\n * for a 5-key record. Aliasing the import into the IIFE recovers all of it\n * (7.4 ns). A DIRECT call to an imported function (`__zcFsr(v,s)`) is not\n * penalized — measured identical — and neither is an imported RegExp receiver,\n * so only the `.call` sites are listed here.\n */\nconst CALL_INVOKED_HELPERS: ReadonlySet<string> = new Set([\"__zcHop\"]);\n\n/**\n * Reference a shared runtime helper (e.g. __zcFsr) from generated code.\n * Lean mode: registers it for the `virtual:zod-compiler/runtime` import.\n * Inline mode: declares it once in the per-IIFE preamble.\n */\nexport function emitRuntimeHelper(ctx: CodeGenContext, name: string, decl: string): string {\n  if (ctx.mode === \"lean\") {\n    ctx.usedHelpers.add(name);\n    if (CALL_INVOKED_HELPERS.has(name)) return emitConstant(ctx, \"lh\", name);\n  } else if (!ctx.preamble.includes(decl)) {\n    ctx.preamble.push(decl);\n  }\n  return name;\n}\n\n/**\n * Extend a path expression with one or more scalar segment expressions\n * (escaped string literals, numeric literals, or loop-variable names).\n *\n * Path expressions are only ever composed by these helpers starting from the\n * `[]` root, so any path that looks like an array literal IS one — the new\n * segment is spliced in to keep issue paths a single array allocation\n * (`[\"data\",\"items\",__i_7]`) instead of an allocation per nesting level\n * (`[\"data\"].concat(\"items\").concat(__i_7)`). Opaque expressions fall back\n * to .concat().\n */\nexport function extendPath(parentPath: string, segExpr: string): string {\n  if (parentPath === \"[]\") return `[${segExpr}]`;\n  if (parentPath.startsWith(\"[\") && parentPath.endsWith(\"]\")) {\n    return `${parentPath.slice(0, -1)},${segExpr}]`;\n  }\n  return `${parentPath}.concat(${segExpr})`;\n}\n\n/** Extend a path expression with a static string key. */\nexport function extendStaticPath(parentPath: string, key: string): string {\n  return extendPath(parentPath, escapeString(key));\n}\n\n/** Extend a path expression with a numeric index. */\nexport function extendStaticPathIndex(parentPath: string, index: number): string {\n  return extendPath(parentPath, String(index));\n}\n\n/**\n * A superRefine callback receives zod's payload, whose `value` is public,\n * typed, writable API ($RefinementCtx extends ParsePayload) — so any node\n * carrying one MAY rewrite its value and must be treated as mutating. Which\n * callbacks actually do is undecidable here; the emitted fast check settles it\n * at runtime by refusing when the value changed (see ZC_SR_OK_DECL), so a\n * non-mutating callback still exits through the fast path.\n */\nfunction hasSuperRefine(checks: readonly { kind: string }[] | undefined): boolean {\n  return checks !== undefined && checks.some((c) => c.kind === \"super_refine_effect\");\n}\n\n/**\n * Check if a SchemaIR tree produces output that is not the input itself —\n * either value-mutating operations (coerce, default, catch, overwrite) that\n * write back to the input expression, or a strip object that rebuilds a fresh\n * object from its known keys. Used by container generators to decide whether to\n * clone (so the rebuilt/mutated value never writes through to the caller's\n * input), by generateValidator to keep such schemas off the by-reference fast\n * path, and by the shared-walk dedup + intersection extractor to exclude them.\n */\n/**\n * Can this tuple's output be LONGER than its input?\n *\n * `handleTupleResult` assigns `final.value[i] = result.value` for every item it\n * runs, and $ZodTuple runs every item below `optStart` even when the input is\n * shorter — so a required slot past the end is written with the `undefined` its\n * schema returned, extending the array. `z.tuple([z.any(), z.any()])` therefore\n * answers `[\"x\"]` with `[\"x\", undefined]`, length 2. A required item that\n * REJECTS undefined can't produce that: the parse fails and the value is never\n * read. So the extension is possible exactly when some required item accepts\n * `undefined` — which also makes the tuple a mutating node, since its output is\n * then not its input.\n */\nexport function tuplePadsShortInput(ir: SchemaIR & { type: \"tuple\" }): boolean {\n  return ir.items.some((item, index) => index < ir.optStart && !rejectsUndefined(item));\n}\n\nexport function hasMutation(ir: SchemaIR): boolean {\n  switch (ir.type) {\n    case \"string\":\n      // url checks trim (and optionally normalize) the value; overwrite\n      // effects (.trim(), .toLowerCase()) rewrite it.\n      return (\n        ir.coerce === true ||\n        hasSuperRefine(ir.checks) ||\n        ir.checks.some(\n          (c) =>\n            c.kind === \"overwrite_effect\" || (c.kind === \"string_format\" && c.format === \"url\"),\n        )\n      );\n    case \"number\":\n      return ir.coerce === true || hasSuperRefine(ir.checks);\n    case \"boolean\":\n    case \"bigint\":\n    case \"date\":\n      return ir.coerce === true;\n    case \"default\":\n    case \"catch\":\n    case \"effect\":\n    case \"fallback\":\n    case \"stringBool\":\n      return true;\n    case \"object\":\n      // A strip object produces a FRESH output (only the declared keys), so it\n      // mutates: parents must clone before it writes back, it never takes the\n      // by-reference fast path, and intersections of strip objects delegate to\n      // zod (see extractIntersection's hasMutation guard) — matching zod's\n      // parse-both-sides-then-merge semantics instead of over-stripping.\n      return (\n        ir.stripUnknownKeys === true ||\n        hasSuperRefine(ir.checks) ||\n        (ir.catchall !== undefined && hasMutation(ir.catchall)) ||\n        Object.values(ir.properties).some((p) => hasMutation(p))\n      );\n    case \"array\":\n      return hasSuperRefine(ir.checks) || hasMutation(ir.element);\n    case \"tuple\":\n      return (\n        ir.items.some(hasMutation) ||\n        (ir.rest !== null && hasMutation(ir.rest)) ||\n        tuplePadsShortInput(ir)\n      );\n    case \"record\":\n      return hasMutation(ir.valueType);\n    // A freezing readonly produces a value that is not its input, exactly as a\n    // strip object does — so it must never take a by-reference shortcut.\n    case \"readonly\":\n      return ir.freeze === true || hasMutation(ir.inner);\n    case \"optional\":\n    case \"nullable\":\n    case \"recursionTarget\":\n    case \"zodDelegate\":\n      return hasMutation(ir.inner);\n    case \"union\":\n    case \"discriminatedUnion\":\n      return ir.options.some(hasMutation);\n    case \"intersection\":\n      return hasMutation(ir.left) || hasMutation(ir.right);\n    case \"pipe\":\n      return hasMutation(ir.in) || hasMutation(ir.out);\n    case \"set\":\n      return hasMutation(ir.valueType);\n    case \"map\":\n      return hasMutation(ir.keyType) || hasMutation(ir.valueType);\n    case \"file\":\n      return false;\n    default:\n      return false;\n  }\n}\n\n/**\n * Is a defaulted property's key guaranteed to appear in the stripped output?\n *\n * Distinct from {@link rejectsUndefined}, which asks whether `undefined` is\n * REJECTED — a `.default()` accepts it and yet still produces a defined value, so\n * only this question earns the key a slot in the output object literal. The two\n * answers coincide everywhere else.\n *\n * Sound for both branches of a default: the substituted value is defined\n * (`alwaysDefined`, checked against the schema at extraction time), and the inner\n * branch runs only when `input[key] !== undefined`, which implies `key in input`\n * — so zod's presence test keeps the key whatever the inner produced.\n */\nexport function outputAlwaysDefined(ir: SchemaIR): boolean {\n  return ir.type === \"default\" ? ir.alwaysDefined === true : rejectsUndefined(ir);\n}\n\n/**\n * Does this schema reject `undefined` outright?\n *\n * Read as \"can this slot be ABSENT from the input\" by the tuple build, whose\n * output length depends on it — zod marks a defaulted or optional item\n * `optin: \"optional\"` and accepts a shorter array. Conservative: anything that\n * might accept, produce, or default to `undefined` answers false.\n */\nexport function rejectsUndefined(ir: SchemaIR): boolean {\n  switch (ir.type) {\n    // Coercion turns undefined into a value (`String(undefined)`), so a\n    // coercing primitive is NOT a rejector.\n    case \"string\":\n    case \"number\":\n    case \"boolean\":\n    case \"bigint\":\n    case \"date\":\n      return ir.coerce !== true;\n    case \"symbol\":\n    case \"null\":\n    case \"nan\":\n    case \"never\":\n    case \"enum\":\n    case \"object\":\n    case \"array\":\n    case \"tuple\":\n    case \"record\":\n    case \"set\":\n    case \"map\":\n    case \"file\":\n    case \"templateLiteral\":\n    case \"discriminatedUnion\":\n    case \"stringBool\":\n      return true;\n    case \"literal\":\n      return !ir.values.includes(undefined);\n    case \"union\":\n      return ir.options.every(rejectsUndefined);\n    case \"intersection\":\n      return rejectsUndefined(ir.left) || rejectsUndefined(ir.right);\n    case \"nullable\":\n    case \"readonly\":\n    case \"recursionTarget\":\n    case \"zodDelegate\":\n      return rejectsUndefined(ir.inner);\n    default:\n      // optional / any / unknown / undefined / void / default / catch /\n      // fallback / effect / pipe / recursiveRef — each can yield undefined,\n      // or is opaque enough that we must not assume otherwise.\n      return false;\n  }\n}\n\n/**\n * Sort comparator for CheckIR: cheapest/most-discriminating checks first.\n * Used by fast-path generators after filtering out refine_effect entries.\n */\nexport function checkPriority(\n  a: CheckIR | BigIntCheckIR | DateCheckIR | SetCheckIR,\n  b: CheckIR | BigIntCheckIR | DateCheckIR | SetCheckIR,\n): number {\n  return (CHECK_PRIORITY[a.kind] ?? 99) - (CHECK_PRIORITY[b.kind] ?? 99);\n}\n"],"mappings":";;;AAiPA,SAAgB,iBAAiB,OAA0B;CACzD,OAAO,MAAM,MAAM,SAAS,IAAI,OAAO,MAAM,MAAM,KAAK,GAAG,EAAE,KAAK;AACpE;;;;;;;;;;;;;;;;;;;;AAqBA,SAAgB,oBACd,GACA,SACA,UACA,QACe;CACf,IAAI,CAAC,iBAAiB,EAAE,KAAK,GAAG;EAC9B,MAAM,QAAQ,EAAE,MAAM,OAAO;EAC7B,OAAO,UAAU,OAAO,OAAO,IAAI,EAAE,QAAQ,WAAW,OAAO,GAAG,MAAM;CAC1E;CACA,MAAM,QAAQ,EAAE,MAAM,GAAG;CACzB,MAAM,QAAQ,EAAE,MAAM,SAAS,EAAE,OAAO,MAAM,CAAC;CAC/C,IAAI,UAAU,MAAM,OAAO;CAC3B,OAAO,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,WAAW,OAAO,GAAG,MAAM;AAC7D;;AAGA,SAAS,iBAAiB,MAAuB;CAC/C,OAAO,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG;AAChD;;AA8DA,SAAgB,SAAS,KAAqB,QAAwB;CACpE,OAAO,KAAK,OAAO,GAAG,IAAI;AAC5B;;;;;;;;;;;;;AAcA,SAAgB,aAAa,KAAqB,QAAwB;CACxE,IAAI,kCAAkB,IAAI,IAAI;CAC9B,MAAM,SAAS,IAAI,cAAc,IAAI,MAAM;CAC3C,IAAI,WAAW,KAAA,GAAW,OAAO;CACjC,MAAM,OAAO,QAAQ,IAAI;CACzB,IAAI,SAAS,KAAK,OAAO,KAAK,IAAI,OAAO,GAAG;CAC5C,IAAI,cAAc,IAAI,QAAQ,IAAI;CAClC,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,mBACd,KACA,QACQ;CACR,IAAI,OAAO,aAAa,KAAA,GAAW,OAAO,aAAa,KAAK,OAAO,QAAQ,OAAO,SAAS,EAAE;CAC7F,IAAI,OAAO,WAAW,KAAA,GACpB,MAAM,IAAI,MAAM,4DAA4D;CAE9E,OAAO,aAAa,KAAK,OAAO,MAAM;AACxC;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,eAAe,KAAqB,UAA0B;CAC5E,MAAM,OAAO,SAAS;CACtB,MAAM,OAAO,OAAO,KAAK,QAAQ,SAAS,wBAAwB,SAAS;CAC3E,IAAI,CAAC,IAAI,SAAS,SAAS,IAAI,GAC7B,IAAI,SAAS,KAAK,IAAI;CAExB,OAAO;AACT;;AAGA,SAAgB,aAAa,KAAqB,UAA0B;CAC1E,MAAM,OAAO,SAAS;CACtB,MAAM,OAAO,OAAO,KAAK,QAAQ,SAAS;CAC1C,IAAI,CAAC,IAAI,SAAS,SAAS,IAAI,GAC7B,IAAI,SAAS,KAAK,IAAI;CAExB,OAAO;AACT;;;;;;;AAQA,SAAgB,UACd,KACA,QACA,SACA,OACQ;CACR,IAAI,IAAI,SAAS,UAAU,CAAC,OAAO;EACjC,MAAM,YAAY,qBAAqB,OAAO;EAC9C,IAAI,cAAc,MAAM;GACtB,IAAI,YAAY,IAAI,SAAS;GAC7B,OAAO;EACT;CACF;CACA,MAAM,WAAW,QAAQ,GAAG,MAAM,QAAQ,YAAY;CACtD,MAAM,SAAS,IAAI,WAAW,IAAI,QAAQ;CAC1C,IAAI,QAAQ,OAAO;CACnB,MAAM,OAAO,QAAQ,OAAO,GAAG,IAAI;CACnC,MAAM,WAAW,QAAQ,IAAI,aAAa,KAAK,MAAM;CAIrD,MAAM,aAAa,QAAQ,OAAO,eAAe,OAAO;CACxD,IAAI,SAAS,KAAK,OAAO,KAAK,cAAc,aAAa,cAAc,OAAO,IAAI,SAAS,GAAG;CAC9F,IAAI,WAAW,IAAI,UAAU,IAAI;CACjC,OAAO;AACT;;;;;;;;AASA,SAAgB,sBAAsB,KAAqB,SAAyB;CAClF,IAAI,IAAI,SAAS,QAAQ;EACvB,MAAM,UAAU,yBAAyB,OAAO;EAChD,IAAI,YAAY,MAAM;GACpB,IAAI,YAAY,IAAI,OAAO;GAC3B,OAAO;EACT;CACF;CACA,MAAM,WAAW,YAAY;CAC7B,MAAM,SAAS,IAAI,WAAW,IAAI,QAAQ;CAC1C,IAAI,QAAQ,OAAO;CACnB,MAAM,OAAO,SAAS,IAAI;CAC1B,IAAI,SAAS,KAAK,OAAO,KAAK,GAAG,aAAa,IAAI,QAAQ,EAAE,EAAE,EAAE;CAChE,IAAI,WAAW,IAAI,UAAU,IAAI;CACjC,OAAO;AACT;;;;;;;;;;;;AAaA,SAAgB,aAAa,KAAqB,QAAgB,aAA6B;CAC7F,IAAI,+BAAe,IAAI,IAAI;CAC3B,MAAM,SAAS,IAAI,WAAW,IAAI,WAAW;CAC7C,IAAI,WAAW,KAAA,GAAW,OAAO;CACjC,MAAM,OAAO,KAAK,OAAO,GAAG,IAAI;CAChC,IAAI,SAAS,KAAK,OAAO,KAAK,GAAG,YAAY,EAAE;CAC/C,IAAI,WAAW,IAAI,aAAa,IAAI;CACpC,OAAO;AACT;;AAGA,SAAgB,QAAQ,KAAqB,QAAgB,QAAoC;CAC/F,MAAM,cAAc,WAAW,KAAK,UAAU,CAAC,GAAG,MAAM,CAAC,EAAE;CAC3D,MAAM,aAAa,IAAI,gBAAgB,IAAI,WAAW;CACtD,IAAI,eAAe,KAAA,GAAW,OAAO;CACrC,MAAM,OAAO,aAAa,KAAK,OAAO,UAAU,WAAW;CAC3D,IAAI,gBAAgB;EAAE;EAAM;CAAY,CAAC;CACzC,OAAO;AACT;;;;;;;;;;;;;;;;;;;;AAqBA,MAAa,kCAAkC;;;;;;;;;;AAW/C,SAAgB,kBACd,KACA,MACA,QACQ;CACR,IAAI,KAAK,WAAW,GAAG,OAAO;CAC9B,IAAI,KAAK,UAAA,IACP,OAAO,KAAK,KAAK,MAAM,GAAG,OAAO,KAAK,aAAa,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI;CAEpE,OAAO,GAAG,QAAQ,KAAK,MAAM,IAAI,EAAE,OAAO,OAAO;AACnD;;;;;;;;AASA,MAAa,wBAAwB;AAErC,MAAM,iBAAyC;CAE7C,YAAY;CACZ,YAAY;CACZ,eAAe;CACf,UAAU;CACV,UAAU;CAEV,eAAe;CAEf,cAAc;CACd,WAAW;CACX,qBAAqB;CACrB,kBAAkB;CAClB,mBAAmB;CACnB,gBAAgB;CAEhB,aAAa;CACb,oBAAoB;CAEpB,aAAa;CACb,WAAW;CAEX,UAAU;CAEV,eAAe;AACjB;AAEA,SAAgB,aAAa,GAA4B;CACvD,OAAO,KAAK,UAAU,CAAC;AACzB;;;;;;;;;;;;;;;AAmBA,SAAgB,cAAc,GAAyC;CACrE,IAAI,MAAM,MAAM,OAAO;CACvB,MAAM,IAAI,OAAO;CACjB,OAAO,MAAM,YAAY,MAAM,YAAY,MAAM,aAAa,MAAM,YAAY,MAAM;AACxF;;;;;;;;;;AAWA,SAAgB,YAAY,GAA8B;CACxD,IAAI,OAAO,MAAM,UAAU,OAAO,GAAG,EAAE;CACvC,IAAI,MAAM,KAAA,GAAW,OAAO;CAK5B,IAAI,OAAO,MAAM,YAAY,CAAC,OAAO,SAAS,CAAC,GAAG,OAAO,OAAO,CAAC;CACjE,OAAO,KAAK,UAAU,CAAC;AACzB;;;;;;;;;;;;;;AAeA,MAAM,uCAA4C,IAAI,IAAI,CAAC,SAAS,CAAC;;;;;;AAOrE,SAAgB,kBAAkB,KAAqB,MAAc,MAAsB;CACzF,IAAI,IAAI,SAAS,QAAQ;EACvB,IAAI,YAAY,IAAI,IAAI;EACxB,IAAI,qBAAqB,IAAI,IAAI,GAAG,OAAO,aAAa,KAAK,MAAM,IAAI;CACzE,OAAO,IAAI,CAAC,IAAI,SAAS,SAAS,IAAI,GACpC,IAAI,SAAS,KAAK,IAAI;CAExB,OAAO;AACT;;;;;;;;;;;;AAaA,SAAgB,WAAW,YAAoB,SAAyB;CACtE,IAAI,eAAe,MAAM,OAAO,IAAI,QAAQ;CAC5C,IAAI,WAAW,WAAW,GAAG,KAAK,WAAW,SAAS,GAAG,GACvD,OAAO,GAAG,WAAW,MAAM,GAAG,EAAE,EAAE,GAAG,QAAQ;CAE/C,OAAO,GAAG,WAAW,UAAU,QAAQ;AACzC;;AAGA,SAAgB,iBAAiB,YAAoB,KAAqB;CACxE,OAAO,WAAW,YAAY,aAAa,GAAG,CAAC;AACjD;;AAGA,SAAgB,sBAAsB,YAAoB,OAAuB;CAC/E,OAAO,WAAW,YAAY,OAAO,KAAK,CAAC;AAC7C;;;;;;;;;AAUA,SAAS,eAAe,QAA0D;CAChF,OAAO,WAAW,KAAA,KAAa,OAAO,MAAM,MAAM,EAAE,SAAS,qBAAqB;AACpF;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,oBAAoB,IAA2C;CAC7E,OAAO,GAAG,MAAM,MAAM,MAAM,UAAU,QAAQ,GAAG,YAAY,CAAC,iBAAiB,IAAI,CAAC;AACtF;AAEA,SAAgB,YAAY,IAAuB;CACjD,QAAQ,GAAG,MAAX;EACE,KAAK,UAGH,OACE,GAAG,WAAW,QACd,eAAe,GAAG,MAAM,KACxB,GAAG,OAAO,MACP,MACC,EAAE,SAAS,sBAAuB,EAAE,SAAS,mBAAmB,EAAE,WAAW,KACjF;EAEJ,KAAK,UACH,OAAO,GAAG,WAAW,QAAQ,eAAe,GAAG,MAAM;EACvD,KAAK;EACL,KAAK;EACL,KAAK,QACH,OAAO,GAAG,WAAW;EACvB,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,cACH,OAAO;EACT,KAAK,UAMH,OACE,GAAG,qBAAqB,QACxB,eAAe,GAAG,MAAM,KACvB,GAAG,aAAa,KAAA,KAAa,YAAY,GAAG,QAAQ,KACrD,OAAO,OAAO,GAAG,UAAU,CAAC,CAAC,MAAM,MAAM,YAAY,CAAC,CAAC;EAE3D,KAAK,SACH,OAAO,eAAe,GAAG,MAAM,KAAK,YAAY,GAAG,OAAO;EAC5D,KAAK,SACH,OACE,GAAG,MAAM,KAAK,WAAW,KACxB,GAAG,SAAS,QAAQ,YAAY,GAAG,IAAI,KACxC,oBAAoB,EAAE;EAE1B,KAAK,UACH,OAAO,YAAY,GAAG,SAAS;EAGjC,KAAK,YACH,OAAO,GAAG,WAAW,QAAQ,YAAY,GAAG,KAAK;EACnD,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,eACH,OAAO,YAAY,GAAG,KAAK;EAC7B,KAAK;EACL,KAAK,sBACH,OAAO,GAAG,QAAQ,KAAK,WAAW;EACpC,KAAK,gBACH,OAAO,YAAY,GAAG,IAAI,KAAK,YAAY,GAAG,KAAK;EACrD,KAAK,QACH,OAAO,YAAY,GAAG,EAAE,KAAK,YAAY,GAAG,GAAG;EACjD,KAAK,OACH,OAAO,YAAY,GAAG,SAAS;EACjC,KAAK,OACH,OAAO,YAAY,GAAG,OAAO,KAAK,YAAY,GAAG,SAAS;EAC5D,KAAK,QACH,OAAO;EACT,SACE,OAAO;CACX;AACF;;;;;;;;;;;;;;AAeA,SAAgB,oBAAoB,IAAuB;CACzD,OAAO,GAAG,SAAS,YAAY,GAAG,kBAAkB,OAAO,iBAAiB,EAAE;AAChF;;;;;;;;;AAUA,SAAgB,iBAAiB,IAAuB;CACtD,QAAQ,GAAG,MAAX;EAGE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,QACH,OAAO,GAAG,WAAW;EACvB,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,cACH,OAAO;EACT,KAAK,WACH,OAAO,CAAC,GAAG,OAAO,SAAS,KAAA,CAAS;EACtC,KAAK,SACH,OAAO,GAAG,QAAQ,MAAM,gBAAgB;EAC1C,KAAK,gBACH,OAAO,iBAAiB,GAAG,IAAI,KAAK,iBAAiB,GAAG,KAAK;EAC/D,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,eACH,OAAO,iBAAiB,GAAG,KAAK;EAClC,SAIE,OAAO;CACX;AACF;;;;;AAMA,SAAgB,cACd,GACA,GACQ;CACR,QAAQ,eAAe,EAAE,SAAS,OAAO,eAAe,EAAE,SAAS;AACrE"}
+{"version":3,"file":"context.js","names":[],"sources":["../../../src/core/codegen/context.ts"],"sourcesContent":["import type {\n  BigIntCheckIR,\n  CheckIR,\n  DateCheckIR,\n  LiteralValue,\n  SchemaIR,\n  SetCheckIR,\n} from \"../types.js\";\nimport type { SharedSchemaPlan } from \"./dedupe.js\";\nimport {\n  fastTestSource,\n  lookupWellKnownRegex,\n  wellKnownRegexSourceName,\n} from \"./well-known-regex.js\";\n\n/** Codegen output mode. \"inline\" emits self-contained code (CLI .compiled.ts). \"lean\" emits references to imports from \"virtual:zod-compiler/runtime\" (unplugin). */\nexport type CodegenMode = \"inline\" | \"lean\";\n\n/**\n * Kind of a poolable constant. Decides the shared identifier's prefix, so a\n * module-scope pool stays readable (`__zcSet_0`, …) rather than opaque.\n */\nexport type ConstantKind = \"Bf\" | \"Rx\" | \"Set\";\n\n/**\n * A poolable constant declaration emitted while generating one validator.\n *\n * Reported to the file pipeline, which pools initializers used by two or more\n * validators into a single module-scope declaration. Only value constants\n * qualify: they are allocated once at module init and read identically from\n * anywhere, so hoisting one out of a validator changes neither its identity nor\n * the hot path.\n *\n * Generated FAST-PATH functions are deliberately not poolable, even when two\n * validators emit byte-identical ones: sharing a function merges its call sites\n * onto a single feedback vector, which is exactly the polymorphism the fast\n * path is inlined to avoid. Cold slow walks are a different bargain and are\n * shared — by their own mechanism, `__zcSw_N` (see dedupe.ts).\n */\nexport interface GeneratedConstant {\n  readonly kind: ConstantKind;\n  readonly name: string;\n  readonly initializer: string;\n}\n\nexport interface CodeGenResult {\n  code: string;\n  functionDef: string;\n  /** Number of fallback schemas referenced by __rf[N] in the generated code. 0 = no fallbacks. */\n  refCount: number;\n  /**\n   * Helper names referenced by this schema in lean mode (e.g. \"__zcTS\", \"__zcReEmail\").\n   * Used by the unplugin transform to construct the `import { ... } from \"virtual:zod-compiler/runtime\"` line.\n   * Always empty in inline mode.\n   */\n  usedHelpers: Set<string>;\n  /**\n   * Name of the hosted fast-check boolean function in the preamble (null when\n   * the schema has no Fast Path). generateIIFE passes it to __zcMkv so parse()\n   * and parseAsync() can return valid input without allocating an\n   * intermediate SafeParseResult.\n   */\n  fastFnName: string | null;\n  /**\n   * True when `fastFnName` is a TOTAL predicate: `fc(input) === true` iff the\n   * schema accepts `input` (mutation-free schemas, where a fast-check failure\n   * can never become a slow-path success). generateIIFE installs it as the\n   * zero-allocation `.is()` guard. False for partial fast paths\n   * (default/catch — `fc` only shortcuts present-and-valid input, so a `false`\n   * result does NOT imply rejection) and for schemas with no fast path, such as\n   * coercion; `.is()` then derives from `safeParse(input).success`.\n   */\n  fastTotal: boolean;\n  /**\n   * Hosted predicate installed as `.is()`, when it differs from `fastFnName`.\n   * A schema that rebuilds its output has no by-reference shortcut (so\n   * `fastFnName` is null) yet still has an exact acceptance predicate, because\n   * stripping reshapes the payload and never the verdict.\n   */\n  isFnName?: string | null;\n  /**\n   * Compact mode only: this validator reads {@link RETAINED_SCHEMA_VAR}\n   * directly, so `generateIIFE` must bind it even when the schema has no\n   * fallback refs of its own. Absent for every non-compact (fully compiled)\n   * validator.\n   */\n  usesRetainedSchema?: boolean;\n}\n\n/** Hosted-validator names for one recursion target (see CodeGenContext.recTargets). */\nexport interface RecTargetGen {\n  /** True for the root target (refId 0) — reuses the schema's own functions. */\n  isRoot: boolean;\n  /**\n   * safeParse-shaped slow validator name: `safeParse_<name>` for the root,\n   * `__rsp_N` for a non-root target. `slowRecursiveRef` calls this.\n   */\n  slowName: string;\n  /**\n   * Boolean fast-check name (`__fcr_N`). Allocated lazily for the root (mirrors\n   * recFastName), eagerly for non-root targets. Absent until the fast path\n   * reaches a ref to this target.\n   */\n  fastName?: string;\n  /** Inner IR hosted as the standalone validator body (non-root targets only). */\n  inner?: SchemaIR;\n}\n\n/** Shared mutable state for code generation. Fast and slow paths share the same instance. */\nexport interface CodeGenContext {\n  preamble: string[];\n  counter: number;\n  fnName: string;\n  /** Deduplicates regex patterns: same pattern string → same preamble variable name. */\n  regexCache: Map<string, string>;\n  /** Codegen output mode. */\n  mode: CodegenMode;\n  /** Names of helpers from \"virtual:zod-compiler/runtime\" referenced in this schema (lean mode only). */\n  usedHelpers: Set<string>;\n  /**\n   * Name of the fast-path boolean helper for the ROOT recursion target\n   * (refId 0), allocated on first fastRecursiveRef visit. generateValidator\n   * wraps the root fast expression as `function <name>(input){return <expr>;}`\n   * so recursive refs can call it. undefined = root has no recursion on the\n   * fast path.\n   */\n  recFastName?: string;\n  /**\n   * Hosted-validator name table for recursion targets, keyed by refId. Entry 0\n   * is the root (the schema's own `safeParse_<name>` / `recFastName`); entries\n   * ≥ 1 are non-root targets hosted as standalone `__rsp_N` (slow) / `__fcr_N`\n   * (fast) helpers. `recursiveRef`/`recursionTarget` generators look up the\n   * call target here. Undefined when not generating a full validator (e.g. unit\n   * tests calling a single generator) — treated as root-only.\n   */\n  recTargets?: Map<number, RecTargetGen>;\n  /** Dedup cache for hosted zero-capture effect functions: source text → preamble var. */\n  effectFnCache?: Map<string, string>;\n  /** Dedup cache for constant preamble declarations: initializer text → preamble var. */\n  valueCache?: Map<string, string>;\n  /** Reports poolable constants so the file pipeline can share exact duplicates across validators. */\n  onConstant?: ((constant: GeneratedConstant) => void) | undefined;\n  /** Exact initializer → file-level name, populated by the pipeline's second codegen pass. */\n  sharedConstantNames?: ReadonlyMap<string, string> | undefined;\n  /** Name of the build path's FAIL sentinel, declared once per validator. */\n  buildFailName?: string;\n  /** Hosted build-function name per recursion target refId, so back-edges resolve. */\n  buildRecNames?: Map<number, string>;\n  /**\n   * Set by the build path when it emitted a `.default()` substitution. Such a\n   * schema ACCEPTS an input its fast expression rejects — `fastDefault` demands a\n   * present value, since the fast path's contract is `data === input` and a\n   * substituted default is not the input — so the expression is no longer an\n   * exact acceptance predicate and must not be installed as `.is()`. Stripping,\n   * by contrast, reshapes only the payload, which is why a build-path schema\n   * otherwise still hands its predicate over.\n   */\n  buildSubstitutesValue?: boolean;\n  /** Memo for estimateFastCost (size-gated fast-check extraction). Lazily created. */\n  fastSizeCache?: WeakMap<SchemaIR, number>;\n  /** Memo for estimateRuntimeCost (cheapest-first check ordering). Lazily created. */\n  fastRuntimeCostCache?: WeakMap<SchemaIR, number>;\n  /**\n   * File-level shared slow-walk plan. Set only when generating a mutation-free\n   * schema (so shared walks stay on the deferred cold path); the slow-path\n   * visit() consults it to replace a repeated sub-IR with a `__zcSw_N` call.\n   */\n  sharedSchemas?: SharedSchemaPlan;\n}\n\n// ─── Slow Path context ────────────────────────────────────────────────────────\n\n/** Context object for slow-path (error-collecting) generator functions. */\nexport interface SlowGen {\n  readonly input: string;\n  readonly output: string;\n  readonly path: string;\n  readonly issues: string;\n  readonly ctx: CodeGenContext;\n  /**\n   * Schema-level static error message of the node being generated\n   * (z.string({ error: \"...\" })). Default message for issues this node emits\n   * when the individual check has no message of its own. Set by generateSlow()\n   * from ir.typeMessage; never inherited by child nodes.\n   */\n  readonly typeMsg?: string | undefined;\n\n  /**\n   * Name of a boolean variable that this node sets to `true` when it aborts in\n   * the zod sense (`payload.aborted`) — currently only a pipe/codec whose `in`\n   * step fails (zod's `handlePipeResult` sets `left.aborted = true`). A `union`\n   * allocates one per option and reads it during pruning so a pipe option whose\n   * `in` failed counts as aborted even when its only issue is a non-aborting\n   * `custom`/check-level code. Undefined when the node is not inside an\n   * abort-tracking option, in which case the abort is a no-op.\n   *\n   * Unlike input/output/path/issues, this is NOT inherited by `visit()`: it is\n   * cleared at every boundary unless a node explicitly forwards it (the\n   * pass-through wrappers optional/nullable/readonly do), mirroring how zod\n   * propagates `payload.aborted` through transparent wrappers but not across\n   * container boundaries.\n   */\n  readonly aborted?: string | undefined;\n\n  /**\n   * Recursively generate validation for a child IR node.\n   * input/output/path/issues are inherited from parent unless overridden;\n   * `aborted` is the exception — it is only set when explicitly passed (see the\n   * `aborted` field doc), so it never leaks into container children.\n   * Union generators use `{ issues }` to redirect child errors to temporary arrays.\n   * Container generators use `{ input, output, path }` for element traversal.\n   */\n  visit(\n    ir: SchemaIR,\n    overrides?: {\n      input?: string;\n      output?: string;\n      path?: string;\n      issues?: string;\n      // `| undefined` (unlike the others): pass-through wrappers forward\n      // `g.aborted` verbatim, which is undefined outside an abort-tracking option.\n      aborted?: string | undefined;\n    },\n  ): string;\n\n  /** Generate a unique temp variable name: `__${prefix}_${counter++}` */\n  temp(prefix: string): string;\n\n  /** Add a regex to preamble and return the variable name. */\n  regex(prefix: string, pattern: string, flags?: string): string;\n\n  /** Add a Set to preamble and return the variable name. */\n  set(prefix: string, values: readonly unknown[]): string;\n}\n\n/** Slow-path generator function signature — registered in slowRegistry. */\nexport type SlowGenerator<T extends SchemaIR = SchemaIR> = (ir: T, g: SlowGen) => string;\n\n// ─── Fast Path context ────────────────────────────────────────────────────────\n\n/**\n * Per-emitted-function size accumulator for size-gated fast-check extraction.\n * Shared by every node inlined into the same function; a fresh instance starts\n * each hosted helper (and the root). See fast-size.ts / generateFast.\n */\nexport interface FastScope {\n  used: number;\n  /**\n   * `var` temps that the function this scope is assembling must declare, in\n   * allocation order. Populated by {@link FastGen.local}; every site that\n   * materializes a function body from a fresh scope emits\n   * {@link declareFastTemps} at the top of that body.\n   *\n   * Function-scoped (never module-scoped) is load-bearing: a recursive\n   * validator re-enters itself while an outer frame still holds a live temp,\n   * and each invocation needs its own binding.\n   */\n  temps: string[];\n}\n\n/** `var a,b;` declaration for a scope's temps, or \"\" when it allocated none. */\nexport function declareFastTemps(scope: FastScope): string {\n  return scope.temps.length > 0 ? `var ${scope.temps.join(\",\")};` : \"\";\n}\n\n/**\n * Fast check for a wrapper that compares its input against a sentinel and\n * otherwise delegates to an inner schema — `optional` (`===undefined`),\n * `nullable` (`===null`) and `default` (`!==undefined`).\n *\n * Written naively these read the input TWICE: once for the sentinel test and\n * again inside the inner check (which may itself read it several more times —\n * `typeof x===\"string\"&&x.length>=3&&x.length<=20`). V8's load elimination\n * removes the repeats only while the access is monomorphic; on the polymorphic\n * and megamorphic call sites real payloads produce (an array of objects with\n * differing key order, anything out of `JSON.parse`) every repeat is a fresh\n * megamorphic lookup. Binding the value to a local once is worth 1.1-1.7x on\n * the whole object check when the optional key is present, and is neutral when\n * it is absent.\n *\n * Only hoisted when the input is a property access; a bare local (an array\n * element variable, a record value) is already a single load, so it keeps the\n * shorter form and byte-identical output.\n */\nexport function fastSentinelWrapper(\n  g: FastGen,\n  innerIR: SchemaIR,\n  sentinel: string,\n  joiner: \"&&\" | \"||\",\n): string | null {\n  if (!isPropertyAccess(g.input)) {\n    const inner = g.visit(innerIR);\n    return inner === null ? null : `(${g.input}${sentinel}${joiner}(${inner}))`;\n  }\n  const value = g.local(\"w\");\n  const inner = g.visit(innerIR, { input: value });\n  if (inner === null) return null;\n  return `((${value}=${g.input})${sentinel}${joiner}(${inner}))`;\n}\n\n/** True for an expression that performs a property load (`x[\"a\"]`, `x.a`, `x[0][1]`). */\nfunction isPropertyAccess(expr: string): boolean {\n  return expr.includes(\"[\") || expr.includes(\".\");\n}\n\n/** Context object for fast-path (boolean expression) generator functions. */\nexport interface FastGen {\n  readonly input: string;\n  readonly ctx: CodeGenContext;\n\n  /**\n   * Whether the CURRENT node may be hoisted into its own boolean helper when it\n   * (with the already-emitted siblings) would overflow the function size cap.\n   * False for the root and for a helper's own top node — those are already their\n   * own function — but their children are extractable. See generateFast.\n   */\n  readonly extractable: boolean;\n\n  /** Accumulated size (≈ chars) of the function currently being assembled. */\n  readonly scope: FastScope;\n\n  /**\n   * Set on the gen for a discriminated-union option only: the discriminator\n   * key. Signals `fastObject` to omit its type-guard and skip re-checking that\n   * property (the switch already matched its value). Never propagated to child\n   * nodes — nested objects keep their own guard.\n   */\n  readonly discSkipKey?: string | undefined;\n\n  /**\n   * Recursively generate fast-check expression for a child IR node.\n   * Returns null if any child is ineligible for fast path.\n   */\n  visit(ir: SchemaIR, overrides?: { input?: string; discSkipKey?: string }): string | null;\n\n  /**\n   * A FastGen for emitting a SEPARATE function body (a hand-built preamble\n   * helper such as a discriminated-union switch or an array-element loop). It\n   * carries a FRESH size accumulator, so the helper's own content is size-gated\n   * against the cap independently of the caller — without this, a helper's body\n   * accrues to the caller's scope while the helper itself grows unbounded.\n   */\n  scoped(input: string): FastGen;\n\n  /** Generate a unique temp variable name. */\n  temp(prefix: string): string;\n\n  /**\n   * Allocate a unique name AND record it on this scope so the enclosing\n   * emitted function declares it as a `var` (see {@link FastScope.temps}).\n   * Use for a value bound inside an expression — `(t=x[\"k\"])===undefined` —\n   * where `temp()` alone would leave the name undeclared.\n   */\n  local(prefix: string): string;\n\n  /** Add a regex to preamble and return the variable name. */\n  regex(prefix: string, pattern: string, flags?: string): string;\n}\n\n/** Fast-path generator function signature — registered in fastRegistry. */\nexport type FastGenerator<T extends SchemaIR = SchemaIR> = (ir: T, g: FastGen) => string | null;\n\n// ─── Shared emit helpers (used by both slow-path and fast-path factories) ────\n\n/** Allocate a fresh `__${prefix}_${n}` identifier and bump the shared counter. */\nexport function emitTemp(ctx: CodeGenContext, prefix: string): string {\n  return `__${prefix}_${ctx.counter++}`;\n}\n\n/**\n * Host a zero-capture effect function (refine predicate, transform,\n * overwrite) in the preamble and return its variable name. The inline\n * `(${source})(x)` form evaluates the function expression — allocating a\n * function object — on EVERY parse at every effect site, including inside\n * the \"zero-allocation\" fast chain. V8's escape analysis erases that in\n * optimized frames, but interpreter/baseline/deopt frames pay it, and the\n * full source text re-parses as bytecode at each site. Zero-capture sources\n * reference only their own parameters and safe globals by construction, so\n * a single preamble binding is semantically identical. Deduped per schema\n * by source text.\n */\nexport function emitEffectFn(ctx: CodeGenContext, source: string): string {\n  ctx.effectFnCache ??= new Map();\n  const cached = ctx.effectFnCache.get(source);\n  if (cached !== undefined) return cached;\n  const name = `__ef_${ctx.counter++}`;\n  ctx.preamble.push(`var ${name}=(${source});`);\n  ctx.effectFnCache.set(source, name);\n  return name;\n}\n\n/**\n * Callable expression for a user callback — a refine predicate or a transform.\n *\n * A zero-capture callback is hosted from its source text; one that CAPTURES\n * outer variables is called by reference through `__rf[N]` — the user's own\n * function object, reached from the schema — instead of costing the schema its\n * compiled path. The reference is aliased into a preamble binding rather than\n * re-read per call, for the same reason call-invoked helpers are (a per-call\n * array element load is not a foldable callee).\n */\nexport function emitEffectCallable(\n  ctx: CodeGenContext,\n  effect: { refIndex?: number | undefined; source?: string | undefined },\n): string {\n  if (effect.refIndex !== undefined) return emitConstant(ctx, \"rfn\", `__rf[${effect.refIndex}]`);\n  if (effect.source === undefined) {\n    throw new Error(\"effect has neither inlineable source nor a reference index\");\n  }\n  return emitEffectFn(ctx, effect.source);\n}\n\n/**\n * Pristine fallback delegate: declare `var __rfp_N=__rf[N].safeParse.bind(__rf[N]);`\n * in the preamble and return the variable name. Generated code must NEVER read\n * `__rf[N].safeParse` at parse time: `__zcMkv` installs the compiled safeParse as\n * an OWN property on the original schema object, and whenever `__rf[N]` is that\n * same object the read resolves to the compiled delegate itself — infinite\n * recursion (RangeError on every parse). The fallback entry and the __zcMkv\n * target ARE the same object in compile mode (schemaExpr is the compile()\n * argument identifier) and the CLI emitter ((__src_X as any).schema); in\n * autoDiscover mode they are two textually identical constructions that any\n * downstream CSE/dedup transform (babel-plugin-zod-hoist in a field incident)\n * collapses back into one. Capturing at IIFE evaluation — before the trailing\n * `return __zcMkv(...)` mutates anything — pins zod's own implementation; the\n * worst case under cross-validator merges is delegating to an equivalent\n * compiled validator (whose own delegates were captured even earlier), never\n * a cycle.\n */\nexport function emitRfDelegate(ctx: CodeGenContext, refIndex: number): string {\n  const name = `__rfp_${refIndex}`;\n  const decl = `var ${name}=__rf[${refIndex}].safeParse.bind(__rf[${refIndex}]);`;\n  if (!ctx.preamble.includes(decl)) {\n    ctx.preamble.push(decl);\n  }\n  return name;\n}\n\n/**\n * Identifier `generateIIFE` binds the retained Zod schema to, once per export.\n *\n * Compact delegation reaches the schema through this binding rather than\n * through `__rf[]`. Routing it through the array meant every compact validator\n * — the common case being one with no fallback refs at all — declared a\n * one-element `var __rf=[__zs];` whose only reads were `__rf[0]`, i.e. an array\n * allocation per compiled schema at module init to alias a binding that was\n * already in scope. Naming the schema directly also keeps the reference a\n * foldable constant instead of an element load (the same reason\n * {@link emitEffectCallable} aliases its `__rf[N]` into a preamble binding).\n */\nexport const RETAINED_SCHEMA_VAR = \"__zs\";\n\n/**\n * Capture the retained schema's pristine `safeParse` without allocating a bound\n * function. Declared in the preamble, which `generateIIFE` places after the\n * `__zs` binding and before the trailing `__zcMkv` call — so the capture is\n * zod's own implementation, never the compiled delegate that call installs\n * (see {@link emitRfDelegate} for the recursion this avoids).\n */\nexport function emitRetainedMethod(ctx: CodeGenContext): string {\n  const name = \"__rfm_z\";\n  const decl = `var ${name}=${RETAINED_SCHEMA_VAR}.safeParse;`;\n  if (!ctx.preamble.includes(decl)) {\n    ctx.preamble.push(decl);\n  }\n  return name;\n}\n\n/**\n * Is a RegExp built with these flags safe to share between validators?\n *\n * `g` and `y` make the object STATEFUL: `.test()` advances `lastIndex` and the\n * next call resumes from there. Generated code is already correct about this —\n * every flagged site emits a `lastIndex=0` reset first (see `lastIndexReset` in\n * schemas/string.ts, the only generator that passes flags through) — so pooling\n * them would in fact work today.\n *\n * They are held back anyway, because the pool changes what a future lapse\n * costs. A missing reset on a validator-local regex misbehaves inside one\n * export, deterministically. On a pooled one it misbehaves across exports, and\n * only in the order the module happens to evaluate them. Flagged patterns are\n * rare enough that the sharing is not worth buying that failure mode. Every\n * other flag (`i`, `m`, `s`, `u`, `v`, `d`) is pure configuration and pools like\n * any other constant.\n */\nfunction isPoolableRegex(flags: string | undefined): boolean {\n  return flags === undefined || !/[gy]/.test(flags);\n}\n\n/**\n * Resolve a regex pattern to a runtime variable name.\n *\n * Three layers, widest first. Lean mode short-circuits well-known patterns to\n * virtual-module names, deduping them across the whole bundle. What is left is\n * pooled at FILE level when two or more validators build the identical RegExp —\n * the same bargain Sets get, and a larger one in practice: a repeated enum is\n * one `new Set([...])`, while a repeated `z.iso.datetime()` or shared\n * `.regex()` is a several-hundred-byte pattern plus a RegExp construction per\n * validator at module init. Anything still unique is cached and declared in the\n * per-IIFE preamble exactly once per pattern.\n */\nexport function emitRegex(\n  ctx: CodeGenContext,\n  prefix: string,\n  pattern: string,\n  flags?: string,\n): string {\n  if (ctx.mode === \"lean\" && !flags) {\n    const wellKnown = lookupWellKnownRegex(pattern);\n    if (wellKnown !== null) {\n      ctx.usedHelpers.add(wellKnown);\n      return wellKnown;\n    }\n  }\n  const cacheKey = flags ? `${flags}\\u0000${pattern}` : pattern;\n  const cached = ctx.regexCache.get(cacheKey);\n  if (cached) return cached;\n  const flagsArg = flags ? `,${escapeString(flags)}` : \"\";\n  // Flag-less patterns may carry a faster behavior-equivalent rewrite (a\n  // well-known table entry, repeat unrolling, or both); the regex OBJECT uses\n  // it while issue sites keep reporting the original pattern (see slowString).\n  const testSource = flags ? null : fastTestSource(pattern);\n  const initializer = `new RegExp(${escapeString(testSource ?? pattern)}${flagsArg})`;\n  const localPrefix = `re_${prefix}`;\n  const name = isPoolableRegex(flags)\n    ? emitPooledConstant(ctx, \"Rx\", localPrefix, initializer)\n    : emitConstant(ctx, localPrefix, initializer);\n  ctx.regexCache.set(cacheKey, name);\n  return name;\n}\n\n/**\n * Resolve the ORIGINAL `/source/flags` pattern string of a regex for issue\n * reporting. Only needed when emitRegex swapped in a faster equivalent test\n * pattern (the runtime regex's toString() would leak the rewrite). Lean mode\n * references the shared `<name>Src` virtual export so the original pattern\n * stays a single bundle-wide string; inline mode declares it once per IIFE.\n */\nexport function emitRegexSourceString(ctx: CodeGenContext, pattern: string): string {\n  if (ctx.mode === \"lean\") {\n    const srcName = wellKnownRegexSourceName(pattern);\n    if (srcName !== null) {\n      ctx.usedHelpers.add(srcName);\n      return srcName;\n    }\n  }\n  const cacheKey = `src\\u0000${pattern}`;\n  const cached = ctx.regexCache.get(cacheKey);\n  if (cached) return cached;\n  const name = `__res_${ctx.counter++}`;\n  ctx.preamble.push(`var ${name}=${escapeString(`/${pattern}/`)};`);\n  ctx.regexCache.set(cacheKey, name);\n  return name;\n}\n\n/**\n * Declare a constant value in the preamble and return its variable name,\n * reusing an earlier declaration of the SAME initializer.\n *\n * Value tables are reached from both halves of a validator — an enum's `Set`\n * from its fast check and again from its slow walk, a strict shape's key table\n * likewise — and repeat across sibling properties that share a value list. One\n * declaration per USE emitted the payload two or four times: measured 17% of a\n * 20-value enum schema's generated bytes, 16% for an object with two identical\n * enums. Keyed by initializer text, so only identical payloads collapse.\n */\nexport function emitConstant(ctx: CodeGenContext, prefix: string, initializer: string): string {\n  ctx.valueCache ??= new Map();\n  const cached = ctx.valueCache.get(initializer);\n  if (cached !== undefined) return cached;\n  const name = `__${prefix}_${ctx.counter++}`;\n  ctx.preamble.push(`var ${name}=${initializer};`);\n  ctx.valueCache.set(initializer, name);\n  return name;\n}\n\n/**\n * Declare a poolable constant in the preamble and return its variable name —\n * unless the file pipeline has already decided to hoist this exact initializer\n * to module scope, in which case the shared name is returned and nothing is\n * declared locally.\n *\n * The pipeline learns which initializers repeat by running codegen once and\n * collecting what was reported here, so every poolable constant must route\n * through this function rather than calling {@link emitConstant} directly.\n */\nexport function emitPooledConstant(\n  ctx: CodeGenContext,\n  kind: ConstantKind,\n  localPrefix: string,\n  initializer: string,\n): string {\n  const sharedName = ctx.sharedConstantNames?.get(initializer);\n  if (sharedName !== undefined) return sharedName;\n  const name = emitConstant(ctx, localPrefix, initializer);\n  ctx.onConstant?.({ kind, name, initializer });\n  return name;\n}\n\n/** Declare a `new Set([...])` in the preamble and return its variable name. */\nexport function emitSet(ctx: CodeGenContext, prefix: string, values: readonly unknown[]): string {\n  const initializer = `new Set(${JSON.stringify([...values])})`;\n  return emitPooledConstant(ctx, \"Set\", `set_${prefix}`, initializer);\n}\n\n/**\n * Shape-key count at or below which the unknown-key pass compares with an\n * inline `===` chain rather than a hashed lookup.\n *\n * This is deliberately NOT {@link ENUM_INLINE_THRESHOLD}: the two look alike but\n * are different workloads. An enum compares schema literals against arbitrary\n * INPUT strings, which may be long, share prefixes, and are not necessarily\n * internalized — so a hashed set earns its keep quickly. A shape-key test\n * compares them against keys arriving from `for-in`, i.e. the object's own\n * internalized key strings, so every arm of the chain is a pointer compare that\n * V8 predicts perfectly, while `table[k]` / `set.has(k)` pays a string hash and\n * probe per key.\n *\n * Measured over a strict object's for-in pass (JSON-parsed input, 8 rotated\n * shapes), `===` chain vs the previous `{k:1}` table: 3.7x at 6 keys, 3.8x at\n * 10, 3.1x at 20, 3.1x at 48 — the chain still leads at 64 (283 ns vs 690) and\n * only loses past ~96, where `Set.has` (not the table, which never wins at any\n * size) takes over. 64 sits below that crossover and above any realistic shape.\n */\nexport const KEY_MEMBERSHIP_INLINE_THRESHOLD = 64;\n\n/**\n * Boolean membership test for one key variable against a fixed key list.\n * Empty list recognizes nothing.\n *\n * `Set.has` is the large-shape fallback rather than a `{key:1}` object table:\n * the table is also `__proto__`-hostile (an own `__proto__` key cannot be set\n * by an object literal, so that key would silently read as unknown), which the\n * Set has no trouble with.\n */\nexport function keyMembershipTest(\n  ctx: CodeGenContext,\n  keys: readonly string[],\n  keyVar: string,\n): string {\n  if (keys.length === 0) return \"false\";\n  if (keys.length <= KEY_MEMBERSHIP_INLINE_THRESHOLD) {\n    return keys.map((k) => `${keyVar}===${escapeString(k)}`).join(\"||\");\n  }\n  return `${emitSet(ctx, \"ks\", keys)}.has(${keyVar})`;\n}\n\n/**\n * Enum values at or below this count use inline === checks instead of Set.has().\n * Measured on V8: for ≤5 values, an === chain beats Set.has by up to ~3x with\n * realistic (distinct-prefix, JSON-parsed) values — V8 internalizes strings on\n * successful comparison, making subsequent arms pointer-equality — and is no\n * worse than Set.has even with adversarial shared-prefix values.\n */\nexport const ENUM_INLINE_THRESHOLD = 5;\n\nconst CHECK_PRIORITY: Record<string, number> = {\n  // Cheapest: length/size comparisons (O(1))\n  min_length: 10,\n  max_length: 11,\n  length_equals: 12,\n  min_size: 13,\n  max_size: 14,\n  // Number format checks (comparison + bitwise)\n  number_format: 15,\n  // Range comparisons\n  greater_than: 20,\n  less_than: 21,\n  bigint_greater_than: 20,\n  bigint_less_than: 21,\n  date_greater_than: 22,\n  date_less_than: 23,\n  // Modulo\n  multiple_of: 30,\n  bigint_multiple_of: 30,\n  // String prefix/suffix (O(prefix/suffix length))\n  starts_with: 40,\n  ends_with: 41,\n  // String search (O(n·m) worst case)\n  includes: 42,\n  // Regex (most expensive)\n  string_format: 50,\n};\n\nexport function escapeString(s: string | number): string {\n  return JSON.stringify(s);\n}\n\n/** The {@link LiteralValue}s that {@link literalToJs} can spell. */\nexport type SourceFormLiteral = string | number | boolean | null | bigint | undefined;\n\n/**\n * Can {@link literalToJs} render this value as JS source that strict-equals it?\n *\n * Total by construction — it NAMES the value kinds that have a source form\n * rather than excluding the ones that don't, so every reference value falls out\n * on the false side. That matters because `literalToJs` used to end in a bare\n * `JSON.stringify`, which does not fail loudly on the values it cannot spell:\n * for a symbol it RETURNS `undefined` (the value, not a string), so\n * `z.literal(sym)` compiled to the comparison `x===undefined` — rejecting the\n * symbol it was built from and accepting `undefined`. An object is mis-rendered\n * the other way: `{}` stringifies to `\"{}\"`, and `x==={}` is never true, so the\n * very object the schema was built from was rejected. Both take the runtime\n * membership path instead (see the literal generator).\n */\nexport function hasSourceForm(v: LiteralValue): v is SourceFormLiteral {\n  if (v === null) return true;\n  const t = typeof v;\n  return t === \"string\" || t === \"number\" || t === \"boolean\" || t === \"bigint\" || t === \"undefined\";\n}\n\n/**\n * JS source for a primitive literal value (literal schemas, discriminator\n * case labels). JSON.stringify covers string/number/boolean/null; bigint\n * needs the `n` suffix (JSON.stringify throws and String(5n) renders a\n * number literal that never strict-equals a bigint); undefined isn't JSON.\n *\n * The parameter type is deliberately NARROWER than {@link LiteralValue}: every\n * caller must first prove its value is spellable with {@link hasSourceForm}.\n */\nexport function literalToJs(v: SourceFormLiteral): string {\n  if (typeof v === \"bigint\") return `${v}n`;\n  if (v === undefined) return \"undefined\";\n  // JSON.stringify maps NaN/±Infinity to \"null\"; emit them as JS expressions so a\n  // non-finite numeric literal round-trips (z.literal(Infinity) must compare\n  // against Infinity, not null). String(NaN)=\"NaN\", String(Infinity)=\"Infinity\",\n  // String(-Infinity)=\"-Infinity\" — all valid JS that evaluate to the value.\n  if (typeof v === \"number\" && !Number.isFinite(v)) return String(v);\n  return JSON.stringify(v);\n}\n\n/**\n * Helpers that generated code invokes through `Function.prototype.call`, and\n * which therefore must be aliased into a module-local binding in lean mode.\n *\n * V8 folds a local `const` callee into a constant and inlines straight through\n * `x.call(...)`; an IMPORTED binding is a cell it will not fold, so the same\n * expression stays a generic property load plus a generic call — measured 4.5x\n * (5 keys) to 6.5x (20 keys) slower on the record fast path, 35.9 ns vs 7.2 ns\n * for a 5-key record. Aliasing the import into the IIFE recovers all of it\n * (7.4 ns). A DIRECT call to an imported function (`__zcFsr(v,s)`) is not\n * penalized — measured identical — and neither is an imported RegExp receiver,\n * so only the `.call` sites are listed here.\n */\nconst CALL_INVOKED_HELPERS: ReadonlySet<string> = new Set([\"__zcHop\"]);\n\n/**\n * Reference a shared runtime helper (e.g. __zcFsr) from generated code.\n * Lean mode: registers it for the `virtual:zod-compiler/runtime` import.\n * Inline mode: declares it once in the per-IIFE preamble.\n */\nexport function emitRuntimeHelper(ctx: CodeGenContext, name: string, decl: string): string {\n  if (ctx.mode === \"lean\") {\n    ctx.usedHelpers.add(name);\n    if (CALL_INVOKED_HELPERS.has(name)) return emitConstant(ctx, \"lh\", name);\n  } else if (!ctx.preamble.includes(decl)) {\n    ctx.preamble.push(decl);\n  }\n  return name;\n}\n\n/**\n * Extend a path expression with one or more scalar segment expressions\n * (escaped string literals, numeric literals, or loop-variable names).\n *\n * Path expressions are only ever composed by these helpers starting from the\n * `[]` root, so any path that looks like an array literal IS one — the new\n * segment is spliced in to keep issue paths a single array allocation\n * (`[\"data\",\"items\",__i_7]`) instead of an allocation per nesting level\n * (`[\"data\"].concat(\"items\").concat(__i_7)`). Opaque expressions fall back\n * to .concat().\n */\nexport function extendPath(parentPath: string, segExpr: string): string {\n  if (parentPath === \"[]\") return `[${segExpr}]`;\n  if (parentPath.startsWith(\"[\") && parentPath.endsWith(\"]\")) {\n    return `${parentPath.slice(0, -1)},${segExpr}]`;\n  }\n  return `${parentPath}.concat(${segExpr})`;\n}\n\n/** Extend a path expression with a static string key. */\nexport function extendStaticPath(parentPath: string, key: string): string {\n  return extendPath(parentPath, escapeString(key));\n}\n\n/** Extend a path expression with a numeric index. */\nexport function extendStaticPathIndex(parentPath: string, index: number): string {\n  return extendPath(parentPath, String(index));\n}\n\n/**\n * A superRefine callback receives zod's payload, whose `value` is public,\n * typed, writable API ($RefinementCtx extends ParsePayload) — so any node\n * carrying one MAY rewrite its value and must be treated as mutating. Which\n * callbacks actually do is undecidable here; the emitted fast check settles it\n * at runtime by refusing when the value changed (see ZC_SR_OK_DECL), so a\n * non-mutating callback still exits through the fast path.\n */\nfunction hasSuperRefine(checks: readonly { kind: string }[] | undefined): boolean {\n  return checks !== undefined && checks.some((c) => c.kind === \"super_refine_effect\");\n}\n\n/**\n * Check if a SchemaIR tree produces output that is not the input itself —\n * either value-mutating operations (coerce, default, catch, overwrite) that\n * write back to the input expression, or a strip object that rebuilds a fresh\n * object from its known keys. Used by container generators to decide whether to\n * clone (so the rebuilt/mutated value never writes through to the caller's\n * input), by generateValidator to keep such schemas off the by-reference fast\n * path, and by the shared-walk dedup + intersection extractor to exclude them.\n */\n/**\n * Can this tuple's output be LONGER than its input?\n *\n * `handleTupleResult` assigns `final.value[i] = result.value` for every item it\n * runs, and $ZodTuple runs every item below `optStart` even when the input is\n * shorter — so a required slot past the end is written with the `undefined` its\n * schema returned, extending the array. `z.tuple([z.any(), z.any()])` therefore\n * answers `[\"x\"]` with `[\"x\", undefined]`, length 2. A required item that\n * REJECTS undefined can't produce that: the parse fails and the value is never\n * read. So the extension is possible exactly when some required item accepts\n * `undefined` — which also makes the tuple a mutating node, since its output is\n * then not its input.\n */\nexport function tuplePadsShortInput(ir: SchemaIR & { type: \"tuple\" }): boolean {\n  return ir.items.some((item, index) => index < ir.optStart && !rejectsUndefined(item));\n}\n\nexport function hasMutation(ir: SchemaIR): boolean {\n  switch (ir.type) {\n    case \"string\":\n      // url checks trim (and optionally normalize) the value; overwrite\n      // effects (.trim(), .toLowerCase()) rewrite it.\n      return (\n        ir.coerce === true ||\n        hasSuperRefine(ir.checks) ||\n        ir.checks.some(\n          (c) =>\n            c.kind === \"overwrite_effect\" || (c.kind === \"string_format\" && c.format === \"url\"),\n        )\n      );\n    case \"number\":\n      return ir.coerce === true || hasSuperRefine(ir.checks);\n    case \"boolean\":\n    case \"bigint\":\n    case \"date\":\n      return ir.coerce === true;\n    case \"default\":\n    case \"catch\":\n    case \"effect\":\n    case \"fallback\":\n    case \"stringBool\":\n      return true;\n    case \"object\":\n      // A strip object produces a FRESH output (only the declared keys), so it\n      // mutates: parents must clone before it writes back, it never takes the\n      // by-reference fast path, and intersections of strip objects delegate to\n      // zod (see extractIntersection's hasMutation guard) — matching zod's\n      // parse-both-sides-then-merge semantics instead of over-stripping.\n      return (\n        ir.stripUnknownKeys === true ||\n        hasSuperRefine(ir.checks) ||\n        (ir.catchall !== undefined && hasMutation(ir.catchall)) ||\n        Object.values(ir.properties).some((p) => hasMutation(p))\n      );\n    case \"array\":\n      return hasSuperRefine(ir.checks) || hasMutation(ir.element);\n    case \"tuple\":\n      return (\n        ir.items.some(hasMutation) ||\n        (ir.rest !== null && hasMutation(ir.rest)) ||\n        tuplePadsShortInput(ir)\n      );\n    case \"record\":\n      return hasMutation(ir.valueType);\n    // A freezing readonly produces a value that is not its input, exactly as a\n    // strip object does — so it must never take a by-reference shortcut.\n    case \"readonly\":\n      return ir.freeze === true || hasMutation(ir.inner);\n    case \"optional\":\n    case \"nullable\":\n    case \"recursionTarget\":\n    case \"zodDelegate\":\n      return hasMutation(ir.inner);\n    case \"union\":\n    case \"discriminatedUnion\":\n      return ir.options.some(hasMutation);\n    case \"intersection\":\n      return hasMutation(ir.left) || hasMutation(ir.right);\n    case \"pipe\":\n      return hasMutation(ir.in) || hasMutation(ir.out);\n    case \"set\":\n      return hasMutation(ir.valueType);\n    case \"map\":\n      return hasMutation(ir.keyType) || hasMutation(ir.valueType);\n    case \"file\":\n      return false;\n    default:\n      return false;\n  }\n}\n\n/**\n * Is a defaulted property's key guaranteed to appear in the stripped output?\n *\n * Distinct from {@link rejectsUndefined}, which asks whether `undefined` is\n * REJECTED — a `.default()` accepts it and yet still produces a defined value, so\n * only this question earns the key a slot in the output object literal. The two\n * answers coincide everywhere else.\n *\n * Sound for both branches of a default: the substituted value is defined\n * (`alwaysDefined`, checked against the schema at extraction time), and the inner\n * branch runs only when `input[key] !== undefined`, which implies `key in input`\n * — so zod's presence test keeps the key whatever the inner produced.\n */\nexport function outputAlwaysDefined(ir: SchemaIR): boolean {\n  return ir.type === \"default\" ? ir.alwaysDefined === true : rejectsUndefined(ir);\n}\n\n/**\n * Does this schema reject `undefined` outright?\n *\n * Read as \"can this slot be ABSENT from the input\" by the tuple build, whose\n * output length depends on it — zod marks a defaulted or optional item\n * `optin: \"optional\"` and accepts a shorter array. Conservative: anything that\n * might accept, produce, or default to `undefined` answers false.\n */\nexport function rejectsUndefined(ir: SchemaIR): boolean {\n  switch (ir.type) {\n    // Coercion turns undefined into a value (`String(undefined)`), so a\n    // coercing primitive is NOT a rejector.\n    case \"string\":\n    case \"number\":\n    case \"boolean\":\n    case \"bigint\":\n    case \"date\":\n      return ir.coerce !== true;\n    case \"symbol\":\n    case \"null\":\n    case \"nan\":\n    case \"never\":\n    case \"enum\":\n    case \"object\":\n    case \"array\":\n    case \"tuple\":\n    case \"record\":\n    case \"set\":\n    case \"map\":\n    case \"file\":\n    case \"templateLiteral\":\n    case \"discriminatedUnion\":\n    case \"stringBool\":\n      return true;\n    case \"literal\":\n      return !ir.values.includes(undefined);\n    case \"union\":\n      return ir.options.every(rejectsUndefined);\n    case \"intersection\":\n      return rejectsUndefined(ir.left) || rejectsUndefined(ir.right);\n    case \"nullable\":\n    case \"readonly\":\n    case \"recursionTarget\":\n    case \"zodDelegate\":\n      return rejectsUndefined(ir.inner);\n    default:\n      // optional / any / unknown / undefined / void / default / catch /\n      // fallback / effect / pipe / recursiveRef — each can yield undefined,\n      // or is opaque enough that we must not assume otherwise.\n      return false;\n  }\n}\n\n/**\n * Sort comparator for CheckIR: cheapest/most-discriminating checks first.\n * Used by fast-path generators after filtering out refine_effect entries.\n */\nexport function checkPriority(\n  a: CheckIR | BigIntCheckIR | DateCheckIR | SetCheckIR,\n  b: CheckIR | BigIntCheckIR | DateCheckIR | SetCheckIR,\n): number {\n  return (CHECK_PRIORITY[a.kind] ?? 99) - (CHECK_PRIORITY[b.kind] ?? 99);\n}\n"],"mappings":";;;AAqQA,SAAgB,iBAAiB,OAA0B;CACzD,OAAO,MAAM,MAAM,SAAS,IAAI,OAAO,MAAM,MAAM,KAAK,GAAG,EAAE,KAAK;AACpE;;;;;;;;;;;;;;;;;;;;AAqBA,SAAgB,oBACd,GACA,SACA,UACA,QACe;CACf,IAAI,CAAC,iBAAiB,EAAE,KAAK,GAAG;EAC9B,MAAM,QAAQ,EAAE,MAAM,OAAO;EAC7B,OAAO,UAAU,OAAO,OAAO,IAAI,EAAE,QAAQ,WAAW,OAAO,GAAG,MAAM;CAC1E;CACA,MAAM,QAAQ,EAAE,MAAM,GAAG;CACzB,MAAM,QAAQ,EAAE,MAAM,SAAS,EAAE,OAAO,MAAM,CAAC;CAC/C,IAAI,UAAU,MAAM,OAAO;CAC3B,OAAO,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,WAAW,OAAO,GAAG,MAAM;AAC7D;;AAGA,SAAS,iBAAiB,MAAuB;CAC/C,OAAO,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG;AAChD;;AA8DA,SAAgB,SAAS,KAAqB,QAAwB;CACpE,OAAO,KAAK,OAAO,GAAG,IAAI;AAC5B;;;;;;;;;;;;;AAcA,SAAgB,aAAa,KAAqB,QAAwB;CACxE,IAAI,kCAAkB,IAAI,IAAI;CAC9B,MAAM,SAAS,IAAI,cAAc,IAAI,MAAM;CAC3C,IAAI,WAAW,KAAA,GAAW,OAAO;CACjC,MAAM,OAAO,QAAQ,IAAI;CACzB,IAAI,SAAS,KAAK,OAAO,KAAK,IAAI,OAAO,GAAG;CAC5C,IAAI,cAAc,IAAI,QAAQ,IAAI;CAClC,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,mBACd,KACA,QACQ;CACR,IAAI,OAAO,aAAa,KAAA,GAAW,OAAO,aAAa,KAAK,OAAO,QAAQ,OAAO,SAAS,EAAE;CAC7F,IAAI,OAAO,WAAW,KAAA,GACpB,MAAM,IAAI,MAAM,4DAA4D;CAE9E,OAAO,aAAa,KAAK,OAAO,MAAM;AACxC;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,eAAe,KAAqB,UAA0B;CAC5E,MAAM,OAAO,SAAS;CACtB,MAAM,OAAO,OAAO,KAAK,QAAQ,SAAS,wBAAwB,SAAS;CAC3E,IAAI,CAAC,IAAI,SAAS,SAAS,IAAI,GAC7B,IAAI,SAAS,KAAK,IAAI;CAExB,OAAO;AACT;;;;;;;;;;;;;AAcA,MAAa,sBAAsB;;;;;;;;AASnC,SAAgB,mBAAmB,KAA6B;CAC9D,MAAM,OAAO;CACb,MAAM,OAAO,OAAO,KAAK,GAAG,oBAAoB;CAChD,IAAI,CAAC,IAAI,SAAS,SAAS,IAAI,GAC7B,IAAI,SAAS,KAAK,IAAI;CAExB,OAAO;AACT;;;;;;;;;;;;;;;;;;AAmBA,SAAS,gBAAgB,OAAoC;CAC3D,OAAO,UAAU,KAAA,KAAa,CAAC,OAAO,KAAK,KAAK;AAClD;;;;;;;;;;;;;AAcA,SAAgB,UACd,KACA,QACA,SACA,OACQ;CACR,IAAI,IAAI,SAAS,UAAU,CAAC,OAAO;EACjC,MAAM,YAAY,qBAAqB,OAAO;EAC9C,IAAI,cAAc,MAAM;GACtB,IAAI,YAAY,IAAI,SAAS;GAC7B,OAAO;EACT;CACF;CACA,MAAM,WAAW,QAAQ,GAAG,MAAM,QAAQ,YAAY;CACtD,MAAM,SAAS,IAAI,WAAW,IAAI,QAAQ;CAC1C,IAAI,QAAQ,OAAO;CACnB,MAAM,WAAW,QAAQ,IAAI,aAAa,KAAK,MAAM;CAKrD,MAAM,cAAc,cAAc,cADf,QAAQ,OAAO,eAAe,OAAO,MACK,OAAO,IAAI,SAAS;CACjF,MAAM,cAAc,MAAM;CAC1B,MAAM,OAAO,gBAAgB,KAAK,IAC9B,mBAAmB,KAAK,MAAM,aAAa,WAAW,IACtD,aAAa,KAAK,aAAa,WAAW;CAC9C,IAAI,WAAW,IAAI,UAAU,IAAI;CACjC,OAAO;AACT;;;;;;;;AASA,SAAgB,sBAAsB,KAAqB,SAAyB;CAClF,IAAI,IAAI,SAAS,QAAQ;EACvB,MAAM,UAAU,yBAAyB,OAAO;EAChD,IAAI,YAAY,MAAM;GACpB,IAAI,YAAY,IAAI,OAAO;GAC3B,OAAO;EACT;CACF;CACA,MAAM,WAAW,YAAY;CAC7B,MAAM,SAAS,IAAI,WAAW,IAAI,QAAQ;CAC1C,IAAI,QAAQ,OAAO;CACnB,MAAM,OAAO,SAAS,IAAI;CAC1B,IAAI,SAAS,KAAK,OAAO,KAAK,GAAG,aAAa,IAAI,QAAQ,EAAE,EAAE,EAAE;CAChE,IAAI,WAAW,IAAI,UAAU,IAAI;CACjC,OAAO;AACT;;;;;;;;;;;;AAaA,SAAgB,aAAa,KAAqB,QAAgB,aAA6B;CAC7F,IAAI,+BAAe,IAAI,IAAI;CAC3B,MAAM,SAAS,IAAI,WAAW,IAAI,WAAW;CAC7C,IAAI,WAAW,KAAA,GAAW,OAAO;CACjC,MAAM,OAAO,KAAK,OAAO,GAAG,IAAI;CAChC,IAAI,SAAS,KAAK,OAAO,KAAK,GAAG,YAAY,EAAE;CAC/C,IAAI,WAAW,IAAI,aAAa,IAAI;CACpC,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,mBACd,KACA,MACA,aACA,aACQ;CACR,MAAM,aAAa,IAAI,qBAAqB,IAAI,WAAW;CAC3D,IAAI,eAAe,KAAA,GAAW,OAAO;CACrC,MAAM,OAAO,aAAa,KAAK,aAAa,WAAW;CACvD,IAAI,aAAa;EAAE;EAAM;EAAM;CAAY,CAAC;CAC5C,OAAO;AACT;;AAGA,SAAgB,QAAQ,KAAqB,QAAgB,QAAoC;CAC/F,MAAM,cAAc,WAAW,KAAK,UAAU,CAAC,GAAG,MAAM,CAAC,EAAE;CAC3D,OAAO,mBAAmB,KAAK,OAAO,OAAO,UAAU,WAAW;AACpE;;;;;;;;;;;;;;;;;;;;AAqBA,MAAa,kCAAkC;;;;;;;;;;AAW/C,SAAgB,kBACd,KACA,MACA,QACQ;CACR,IAAI,KAAK,WAAW,GAAG,OAAO;CAC9B,IAAI,KAAK,UAAA,IACP,OAAO,KAAK,KAAK,MAAM,GAAG,OAAO,KAAK,aAAa,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI;CAEpE,OAAO,GAAG,QAAQ,KAAK,MAAM,IAAI,EAAE,OAAO,OAAO;AACnD;;;;;;;;AASA,MAAa,wBAAwB;AAErC,MAAM,iBAAyC;CAE7C,YAAY;CACZ,YAAY;CACZ,eAAe;CACf,UAAU;CACV,UAAU;CAEV,eAAe;CAEf,cAAc;CACd,WAAW;CACX,qBAAqB;CACrB,kBAAkB;CAClB,mBAAmB;CACnB,gBAAgB;CAEhB,aAAa;CACb,oBAAoB;CAEpB,aAAa;CACb,WAAW;CAEX,UAAU;CAEV,eAAe;AACjB;AAEA,SAAgB,aAAa,GAA4B;CACvD,OAAO,KAAK,UAAU,CAAC;AACzB;;;;;;;;;;;;;;;AAmBA,SAAgB,cAAc,GAAyC;CACrE,IAAI,MAAM,MAAM,OAAO;CACvB,MAAM,IAAI,OAAO;CACjB,OAAO,MAAM,YAAY,MAAM,YAAY,MAAM,aAAa,MAAM,YAAY,MAAM;AACxF;;;;;;;;;;AAWA,SAAgB,YAAY,GAA8B;CACxD,IAAI,OAAO,MAAM,UAAU,OAAO,GAAG,EAAE;CACvC,IAAI,MAAM,KAAA,GAAW,OAAO;CAK5B,IAAI,OAAO,MAAM,YAAY,CAAC,OAAO,SAAS,CAAC,GAAG,OAAO,OAAO,CAAC;CACjE,OAAO,KAAK,UAAU,CAAC;AACzB;;;;;;;;;;;;;;AAeA,MAAM,uCAA4C,IAAI,IAAI,CAAC,SAAS,CAAC;;;;;;AAOrE,SAAgB,kBAAkB,KAAqB,MAAc,MAAsB;CACzF,IAAI,IAAI,SAAS,QAAQ;EACvB,IAAI,YAAY,IAAI,IAAI;EACxB,IAAI,qBAAqB,IAAI,IAAI,GAAG,OAAO,aAAa,KAAK,MAAM,IAAI;CACzE,OAAO,IAAI,CAAC,IAAI,SAAS,SAAS,IAAI,GACpC,IAAI,SAAS,KAAK,IAAI;CAExB,OAAO;AACT;;;;;;;;;;;;AAaA,SAAgB,WAAW,YAAoB,SAAyB;CACtE,IAAI,eAAe,MAAM,OAAO,IAAI,QAAQ;CAC5C,IAAI,WAAW,WAAW,GAAG,KAAK,WAAW,SAAS,GAAG,GACvD,OAAO,GAAG,WAAW,MAAM,GAAG,EAAE,EAAE,GAAG,QAAQ;CAE/C,OAAO,GAAG,WAAW,UAAU,QAAQ;AACzC;;AAGA,SAAgB,iBAAiB,YAAoB,KAAqB;CACxE,OAAO,WAAW,YAAY,aAAa,GAAG,CAAC;AACjD;;AAGA,SAAgB,sBAAsB,YAAoB,OAAuB;CAC/E,OAAO,WAAW,YAAY,OAAO,KAAK,CAAC;AAC7C;;;;;;;;;AAUA,SAAS,eAAe,QAA0D;CAChF,OAAO,WAAW,KAAA,KAAa,OAAO,MAAM,MAAM,EAAE,SAAS,qBAAqB;AACpF;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,oBAAoB,IAA2C;CAC7E,OAAO,GAAG,MAAM,MAAM,MAAM,UAAU,QAAQ,GAAG,YAAY,CAAC,iBAAiB,IAAI,CAAC;AACtF;AAEA,SAAgB,YAAY,IAAuB;CACjD,QAAQ,GAAG,MAAX;EACE,KAAK,UAGH,OACE,GAAG,WAAW,QACd,eAAe,GAAG,MAAM,KACxB,GAAG,OAAO,MACP,MACC,EAAE,SAAS,sBAAuB,EAAE,SAAS,mBAAmB,EAAE,WAAW,KACjF;EAEJ,KAAK,UACH,OAAO,GAAG,WAAW,QAAQ,eAAe,GAAG,MAAM;EACvD,KAAK;EACL,KAAK;EACL,KAAK,QACH,OAAO,GAAG,WAAW;EACvB,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,cACH,OAAO;EACT,KAAK,UAMH,OACE,GAAG,qBAAqB,QACxB,eAAe,GAAG,MAAM,KACvB,GAAG,aAAa,KAAA,KAAa,YAAY,GAAG,QAAQ,KACrD,OAAO,OAAO,GAAG,UAAU,CAAC,CAAC,MAAM,MAAM,YAAY,CAAC,CAAC;EAE3D,KAAK,SACH,OAAO,eAAe,GAAG,MAAM,KAAK,YAAY,GAAG,OAAO;EAC5D,KAAK,SACH,OACE,GAAG,MAAM,KAAK,WAAW,KACxB,GAAG,SAAS,QAAQ,YAAY,GAAG,IAAI,KACxC,oBAAoB,EAAE;EAE1B,KAAK,UACH,OAAO,YAAY,GAAG,SAAS;EAGjC,KAAK,YACH,OAAO,GAAG,WAAW,QAAQ,YAAY,GAAG,KAAK;EACnD,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,eACH,OAAO,YAAY,GAAG,KAAK;EAC7B,KAAK;EACL,KAAK,sBACH,OAAO,GAAG,QAAQ,KAAK,WAAW;EACpC,KAAK,gBACH,OAAO,YAAY,GAAG,IAAI,KAAK,YAAY,GAAG,KAAK;EACrD,KAAK,QACH,OAAO,YAAY,GAAG,EAAE,KAAK,YAAY,GAAG,GAAG;EACjD,KAAK,OACH,OAAO,YAAY,GAAG,SAAS;EACjC,KAAK,OACH,OAAO,YAAY,GAAG,OAAO,KAAK,YAAY,GAAG,SAAS;EAC5D,KAAK,QACH,OAAO;EACT,SACE,OAAO;CACX;AACF;;;;;;;;;;;;;;AAeA,SAAgB,oBAAoB,IAAuB;CACzD,OAAO,GAAG,SAAS,YAAY,GAAG,kBAAkB,OAAO,iBAAiB,EAAE;AAChF;;;;;;;;;AAUA,SAAgB,iBAAiB,IAAuB;CACtD,QAAQ,GAAG,MAAX;EAGE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,QACH,OAAO,GAAG,WAAW;EACvB,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,cACH,OAAO;EACT,KAAK,WACH,OAAO,CAAC,GAAG,OAAO,SAAS,KAAA,CAAS;EACtC,KAAK,SACH,OAAO,GAAG,QAAQ,MAAM,gBAAgB;EAC1C,KAAK,gBACH,OAAO,iBAAiB,GAAG,IAAI,KAAK,iBAAiB,GAAG,KAAK;EAC/D,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,eACH,OAAO,iBAAiB,GAAG,KAAK;EAClC,SAIE,OAAO;CACX;AACF;;;;;AAMA,SAAgB,cACd,GACA,GACQ;CACR,QAAQ,eAAe,EAAE,SAAS,OAAO,eAAe,EAAE,SAAS;AACrE"}

package/dist/core/codegen/index.d.ts

@@ -1,6 +1,6 @@
 import { SchemaIR } from "../types.js";
 import { SharedSchemaPlan } from "./dedupe.js";
-import { CodeGenResult, CodegenMode, GeneratedSetConstant } from "./context.js";
+import { CodeGenResult, CodegenMode, GeneratedConstant } from "./context.js";
 //#region src/core/codegen/index.d.ts
 interface GenerateValidatorOptions {
   refCount?: number;
@@ -17,13 +17,13 @@ interface GenerateValidatorOptions {
    * path to the retained Zod schema (`__zcFinZ`). The fast (hot) path is
    * unchanged; only the bulky error-collecting walk — 64–77% of generated
    * bytes — is replaced by a few bytes of zod delegation. See
-   * {@link CodeGenResult.rootDelegateRefIndex}.
+   * {@link CodeGenResult.usesRetainedSchema}.
    */
   compact?: boolean | undefined;
-  /** Internal file-pipeline hook for sharing exact Set initializers across validators. */
-  onSetConstant?: ((constant: GeneratedSetConstant) => void) | undefined;
+  /** Internal file-pipeline hook for pooling exact constant initializers across validators. */
+  onConstant?: ((constant: GeneratedConstant) => void) | undefined;
   /** Internal exact-initializer plan used by the file pipeline's final generation pass. */
-  sharedSetNames?: ReadonlyMap<string, string> | undefined;
+  sharedConstantNames?: ReadonlyMap<string, string> | undefined;
 }
 /**
  * Generate optimized validation code from SchemaIR.

package/dist/core/codegen/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","names":[],"sources":["../../../src/core/codegen/index.ts"],"mappings":";;;;UAgBiB;EACf;;EAEA,OAAO;;;;;EAKP,gBAAgB;;;;;;;;;EAShB;;EAEA,kBAAkB,UAAU;;EAE5B,iBAAiB;;;;;;;;;;;iBAYH,kBACd,IAAI,UACJ,cACA,UAAU,2BACT"}
+{"version":3,"file":"index.d.ts","names":[],"sources":["../../../src/core/codegen/index.ts"],"mappings":";;;;UAsBiB;EACf;;EAEA,OAAO;;;;;EAKP,gBAAgB;;;;;;;;;EAShB;;EAEA,eAAe,UAAU;;EAEzB,sBAAsB;;;;;;;;;;;iBAYR,kBACd,IAAI,UACJ,cACA,UAAU,2BACT"}

package/dist/core/codegen/index.js

@@ -1,4 +1,4 @@
-import { declareFastTemps, emitRfDelegate, emitRfMethod, hasMutation } from "./context.js";
+import { RETAINED_SCHEMA_VAR, declareFastTemps, emitRetainedMethod, emitRfDelegate, hasMutation } from "./context.js";
 import { createSlowGen, generateSlow } from "./slow-path.js";
 import { createFastGen, generateFast } from "./fast-path.js";
 import { fastResultIsInput, generateBuild, rebuildsOutput } from "./build-path.js";
@@ -22,8 +22,8 @@ function generateValidator(ir, name, options) {
 		regexCache: /* @__PURE__ */ new Map(),
 		mode,
 		usedHelpers: /* @__PURE__ */ new Set(),
-		onSetConstant: options?.onSetConstant,
-		sharedSetNames: options?.sharedSetNames
+		onConstant: options?.onConstant,
+		sharedConstantNames: options?.sharedConstantNames
 	};
 	if (options?.sharedSchemas !== void 0) ctx.sharedSchemas = options.sharedSchemas;
 	if (ir.type === "fallback" && ir.refIndex !== void 0) {
@@ -102,25 +102,25 @@ function generateValidator(ir, name, options) {
 	const buildIsFnName = ctx.buildSubstitutesValue === true ? null : fastFnName;
 	const baseRefCount = options?.refCount ?? 0;
 	if (options?.compact === true && fastExpr !== null && fastExpr !== "true" && !hasMutation(ir) && !hasNonRootTargets) {
-		const delegate = emitRfMethod(ctx, baseRefCount);
+		const delegate = emitRetainedMethod(ctx);
 		ctx.usedHelpers.add("__zcFinZ");
 		return {
 			code: ["/* zod-compiler */", ...ctx.preamble].join("\n"),
 			functionDef: [
 				`function ${fnName}(input){`,
 				`if(${fastExpr}){return{success:true,data:input};}`,
-				`return __zcFinZ(${delegate},__rf[${baseRefCount}],input);`,
+				`return __zcFinZ(${delegate},${RETAINED_SCHEMA_VAR},input);`,
 				`}`
 			].join("\n"),
-			refCount: baseRefCount + 1,
+			refCount: baseRefCount,
 			usedHelpers: ctx.usedHelpers,
 			fastFnName,
 			fastTotal: true,
-			rootDelegateRefIndex: baseRefCount
+			usesRetainedSchema: true
 		};
 	}
 	if (options?.compact === true && buildFnName !== null && ctx.buildFailName !== void 0 && !hasNonRootTargets) {
-		const delegate = emitRfMethod(ctx, baseRefCount);
+		const delegate = emitRetainedMethod(ctx);
 		ctx.usedHelpers.add("__zcFinZ");
 		const built = `__bd_${ctx.counter++}`;
 		return {
@@ -129,15 +129,15 @@ function generateValidator(ir, name, options) {
 				`function ${fnName}(input){`,
 				`var ${built}=${buildFnName}(input);`,
 				`if(${built}!==${ctx.buildFailName}){return{success:true,data:${built}};}`,
-				`return __zcFinZ(${delegate},__rf[${baseRefCount}],input);`,
+				`return __zcFinZ(${delegate},${RETAINED_SCHEMA_VAR},input);`,
 				`}`
 			].join("\n"),
-			refCount: baseRefCount + 1,
+			refCount: baseRefCount,
 			usedHelpers: ctx.usedHelpers,
 			fastFnName: null,
 			fastTotal: false,
 			isFnName: buildIsFnName,
-			rootDelegateRefIndex: baseRefCount
+			usesRetainedSchema: true
 		};
 	}
 	if (hasNonRootTargets) for (const t of ctx.recTargets.values()) {