attaform 0.20.2 → 0.21.0

package/dist/chunks/fingerprint2.cjs

@@ -0,0 +1,162 @@
+'use strict';
+
+const canonicalStringify = require('../shared/attaform.CQN9R62B.cjs');
+const index = require('../shared/attaform.PnqML3xW.cjs');
+
+const cyclicSentinel = "<cyclic>";
+function fingerprintZodSchema(schema) {
+  const cache = /* @__PURE__ */ new WeakMap();
+  const inProgress = /* @__PURE__ */ new WeakSet();
+  return visit(schema, cache, inProgress);
+}
+function visit(schema, cache, inProgress) {
+  const cached = cache.get(schema);
+  if (cached !== void 0) return cached;
+  if (inProgress.has(schema)) return cyclicSentinel;
+  inProgress.add(schema);
+  try {
+    const computed = computeFingerprint(schema, cache, inProgress);
+    cache.set(schema, computed);
+    return computed;
+  } finally {
+    inProgress.delete(schema);
+  }
+}
+function computeFingerprint(schema, cache, inProgress) {
+  const kind = index.kindOf(schema);
+  const recurse = (child) => visit(child, cache, inProgress);
+  switch (kind) {
+    // Kind-only leaves: no further structure to descend into.
+    case "boolean":
+    case "null":
+    case "undefined":
+    case "any":
+    case "unknown":
+    case "nan":
+    case "void":
+    case "never":
+      return kind;
+    // Leaves with checks (min/max/email/regex/...). Checks are
+    // canonicalised and sorted so `.min(3).max(10)` and `.max(10).min(3)`
+    // produce identical fingerprints.
+    case "string":
+    case "number":
+    case "bigint":
+    case "date":
+      return `${kind}${formatChecks(schema)}`;
+    case "literal": {
+      const values = [...index.getLiteralValues(schema)].sort((a, b) => {
+        const as = canonicalStringify.canonicalStringify(a);
+        const bs = canonicalStringify.canonicalStringify(b);
+        return as < bs ? -1 : as > bs ? 1 : 0;
+      });
+      return `literal:${canonicalStringify.canonicalStringify(values)}`;
+    }
+    case "enum":
+      return `enum:${canonicalStringify.canonicalStringify([...index.getEnumValues(schema)].sort((a, b) => compare(a, b)))}`;
+    case "object": {
+      const shape = index.getObjectShape(schema);
+      const sortedEntries = Object.entries(shape).sort(([a], [b]) => a < b ? -1 : a > b ? 1 : 0).map(([k, v]) => `${JSON.stringify(k)}:${recurse(v)}`);
+      return `object{${sortedEntries.join(",")}}${formatChecks(schema)}`;
+    }
+    case "array":
+      return `array[${recurse(index.getArrayElement(schema))}]${formatChecks(schema)}`;
+    case "set":
+      return `set<${recurse(index.getSetValueType(schema))}>${formatChecks(schema)}`;
+    case "tuple":
+      return `tuple[${index.getTupleItems(schema).map(recurse).join(",")}]`;
+    case "record":
+      return `record<${recurse(index.getRecordKeyType(schema))},${recurse(index.getRecordValueType(schema))}>`;
+    case "union": {
+      const options = index.getUnionOptions(schema).map(recurse).sort();
+      return `union(${options.join("|")})`;
+    }
+    case "discriminated-union": {
+      const disc = index.getDiscriminator(schema) ?? "?";
+      const options = index.getDiscriminatedOptions(schema).map(recurse).sort();
+      return `dunion[${JSON.stringify(disc)}](${options.join("|")})`;
+    }
+    case "optional": {
+      const inner = index.unwrapInner(schema);
+      return inner === void 0 ? "optional(?)" : `optional(${recurse(inner)})`;
+    }
+    case "nullable": {
+      const inner = index.unwrapInner(schema);
+      return inner === void 0 ? "nullable(?)" : `nullable(${recurse(inner)})`;
+    }
+    case "default": {
+      const inner = index.unwrapInner(schema);
+      return `default[${stableValueRepr(index.getDefaultValue, schema)}](${inner === void 0 ? "?" : recurse(inner)})`;
+    }
+    case "readonly": {
+      const inner = index.unwrapInner(schema);
+      return inner === void 0 ? "readonly(?)" : `readonly(${recurse(inner)})`;
+    }
+    case "pipe": {
+      const inner = index.unwrapPipe(schema);
+      return inner === void 0 ? "pipe(?)" : `pipe(${recurse(inner)})`;
+    }
+    case "catch": {
+      const inner = index.unwrapInner(schema);
+      return `catch[${stableValueRepr(index.getCatchDefault, schema)}](${inner === void 0 ? "?" : recurse(inner)})`;
+    }
+    case "lazy": {
+      const inner = index.unwrapLazy(schema);
+      return inner === void 0 ? "lazy(?)" : `lazy(${recurse(inner)})`;
+    }
+    case "intersection": {
+      const left = index.getIntersectionLeft(schema);
+      const right = index.getIntersectionRight(schema);
+      const leftFp = left === void 0 ? "?" : recurse(left);
+      const rightFp = right === void 0 ? "?" : recurse(right);
+      const parts = [leftFp, rightFp].sort();
+      return `intersection(${parts.join("&")})`;
+    }
+    // Structural shape isn't observable for these. Bucket them into
+    // kind-only fingerprints — a schema-mismatch warning can't do
+    // better than "both are `custom`" here, but that still catches
+    // `object` vs `custom` mismatches. `map` / `symbol` / `function`
+    // are rejected at adapter construction; kept here for exhaustive
+    // switch safety when `fingerprintSchema` is called from tooling.
+    case "promise":
+    case "custom":
+    case "template-literal":
+    case "transform":
+    case "file":
+    case "map":
+    case "symbol":
+    case "function":
+      return `${kind}:*`;
+    default: {
+      const _ = kind;
+      return `unknown:${String(_)}`;
+    }
+  }
+}
+function stableValueRepr(get, schema) {
+  const first = get(schema);
+  const second = get(schema);
+  if (!Object.is(first, second) || typeof first === "function") return "fn:*";
+  return canonicalStringify.canonicalStringify(first);
+}
+function formatChecks(schema) {
+  const checks = index.getChecks(schema);
+  if (checks.length === 0) return "";
+  const parts = checks.map((c) => serializeCheck(c)).sort();
+  return `[${parts.join(";")}]`;
+}
+function serializeCheck(check) {
+  if (check !== null && typeof check === "object") {
+    const def = check._zod?.def;
+    if (def !== void 0) return canonicalStringify.canonicalStringify(def);
+  }
+  return canonicalStringify.canonicalStringify(check);
+}
+function compare(a, b) {
+  const as = String(a);
+  const bs = String(b);
+  return as < bs ? -1 : as > bs ? 1 : 0;
+}
+
+exports.fingerprintZodSchema = fingerprintZodSchema;
+//# sourceMappingURL=fingerprint2.cjs.map

package/dist/chunks/fingerprint2.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"fingerprint2.cjs","sources":["../../src/runtime/adapters/zod-v4/fingerprint.ts"],"sourcesContent":["import type { z } from 'zod'\nimport { canonicalStringify } from '../../core/canonical-stringify'\nimport {\n  getArrayElement,\n  getCatchDefault,\n  getChecks,\n  getDefaultValue,\n  getDiscriminatedOptions,\n  getDiscriminator,\n  getEnumValues,\n  getIntersectionLeft,\n  getIntersectionRight,\n  getLiteralValues,\n  getObjectShape,\n  getRecordKeyType,\n  getRecordValueType,\n  getSetValueType,\n  getTupleItems,\n  getUnionOptions,\n  kindOf,\n  unwrapInner,\n  unwrapLazy,\n  unwrapPipe,\n} from './introspect'\n\n/**\n * Compute a structural fingerprint for a Zod v4 schema.\n *\n * The returned string is:\n * - **Deterministic** for any pair of schemas with the same shape,\n *   regardless of whether they were constructed by the same\n *   `z.object({...})` call or two identical ones in different files.\n * - **Key-order-insensitive** for `z.object` — shape entries are\n *   sorted before serialisation, so `{a, b}` and `{b, a}` produce\n *   the same fingerprint.\n * - **Order-insensitive for `z.union`** — option fingerprints are\n *   sorted before they're folded in, because union membership has\n *   no semantic order.\n * - **Idempotent** — two fingerprint calls on the same schema\n *   reference return identical strings, even when the schema\n *   contains non-deterministic metadata (e.g. `.default(() => new\n *   Date())`). Factories of any kind collapse to an opaque\n *   `fn:*` sentinel for this reason (see `defaultValueRepr`).\n *\n * **Known false negatives** — situations where two semantically\n * different schemas hash the same:\n * - `.refine(fn1)` and `.refine(fn2)`: function bodies aren't\n *   hashable in a way that survives minification / different closure\n *   captures, so every refinement collapses via the generic `fn:*`\n *   sentinel. The warning this powers is a best-effort footgun\n *   catcher, not a soundness guarantee — two forms whose only\n *   difference is refinement logic will look identical here.\n * - `.transform(fn)`: same reason.\n * - `.default(() => x)` where the factory is non-deterministic:\n *   collapses to `fn:*` (idempotence requirement — we can't hash a\n *   fresh Date on every call).\n * - `z.custom()` — no structural information to introspect; renders\n *   as `custom:*`.\n *\n * **Caching is per-call, not module-global.** A WeakMap cache\n * scoped to the starting schema would break correctness under\n * cycles: the `<cyclic>` sentinel's meaning is relative to the\n * call's starting node, so a cached mid-traversal result from one\n * call is wrong for a different call. Cheapest correct design is\n * \"fresh cache per top-level call.\" A 50-field nested schema\n * fingerprints in microseconds, and the library calls `fingerprint`\n * at most twice per shared-key collision (existing + incoming) —\n * not a hot path.\n */\n\nconst cyclicSentinel = '<cyclic>'\n\nexport function fingerprintZodSchema(schema: z.ZodType): string {\n  const cache = new WeakMap<z.ZodType, string>()\n  const inProgress = new WeakSet<z.ZodType>()\n  return visit(schema, cache, inProgress)\n}\n\nfunction visit(\n  schema: z.ZodType,\n  cache: WeakMap<z.ZodType, string>,\n  inProgress: WeakSet<z.ZodType>\n): string {\n  const cached = cache.get(schema)\n  if (cached !== undefined) return cached\n  if (inProgress.has(schema)) return cyclicSentinel\n  inProgress.add(schema)\n  try {\n    const computed = computeFingerprint(schema, cache, inProgress)\n    cache.set(schema, computed)\n    return computed\n  } finally {\n    inProgress.delete(schema)\n  }\n}\n\nfunction computeFingerprint(\n  schema: z.ZodType,\n  cache: WeakMap<z.ZodType, string>,\n  inProgress: WeakSet<z.ZodType>\n): string {\n  const kind = kindOf(schema)\n  const recurse = (child: z.ZodType): string => visit(child, cache, inProgress)\n  switch (kind) {\n    // Kind-only leaves: no further structure to descend into.\n    case 'boolean':\n    case 'null':\n    case 'undefined':\n    case 'any':\n    case 'unknown':\n    case 'nan':\n    case 'void':\n    case 'never':\n      return kind\n\n    // Leaves with checks (min/max/email/regex/...). Checks are\n    // canonicalised and sorted so `.min(3).max(10)` and `.max(10).min(3)`\n    // produce identical fingerprints.\n    case 'string':\n    case 'number':\n    case 'bigint':\n    case 'date':\n      return `${kind}${formatChecks(schema)}`\n\n    case 'literal': {\n      // `z.literal(['a', 'b'])` accepts either — the value set has\n      // no semantic order, so canonical-sort before hashing so\n      // `['a','b']` and `['b','a']` match. `z.literal` accepts\n      // string / number / boolean / null / undefined / bigint /\n      // symbol — sort by canonicalised string form to get a total\n      // order across those types.\n      const values = [...getLiteralValues(schema)].sort((a, b) => {\n        const as = canonicalStringify(a)\n        const bs = canonicalStringify(b)\n        return as < bs ? -1 : as > bs ? 1 : 0\n      })\n      return `literal:${canonicalStringify(values)}`\n    }\n\n    case 'enum':\n      // Enum values have no semantic order — sort before folding.\n      return `enum:${canonicalStringify([...getEnumValues(schema)].sort((a, b) => compare(a, b)))}`\n\n    case 'object': {\n      const shape = getObjectShape(schema as z.ZodObject)\n      const sortedEntries = Object.entries(shape)\n        .sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0))\n        .map(([k, v]) => `${JSON.stringify(k)}:${recurse(v)}`)\n      return `object{${sortedEntries.join(',')}}${formatChecks(schema)}`\n    }\n\n    case 'array':\n      return `array[${recurse(getArrayElement(schema as z.ZodArray))}]${formatChecks(schema)}`\n\n    case 'set':\n      return `set<${recurse(getSetValueType(schema))}>${formatChecks(schema)}`\n\n    case 'tuple':\n      return `tuple[${getTupleItems(schema).map(recurse).join(',')}]`\n\n    case 'record':\n      return `record<${recurse(getRecordKeyType(schema))},${recurse(getRecordValueType(schema))}>`\n\n    case 'union': {\n      // Union membership has no order; sort option fingerprints.\n      const options = getUnionOptions(schema).map(recurse).sort()\n      return `union(${options.join('|')})`\n    }\n\n    case 'discriminated-union': {\n      const disc = getDiscriminator(schema) ?? '?'\n      const options = getDiscriminatedOptions(schema).map(recurse).sort()\n      return `dunion[${JSON.stringify(disc)}](${options.join('|')})`\n    }\n\n    case 'optional': {\n      const inner = unwrapInner(schema)\n      return inner === undefined ? 'optional(?)' : `optional(${recurse(inner)})`\n    }\n\n    case 'nullable': {\n      const inner = unwrapInner(schema)\n      return inner === undefined ? 'nullable(?)' : `nullable(${recurse(inner)})`\n    }\n\n    case 'default': {\n      const inner = unwrapInner(schema)\n      return `default[${stableValueRepr(getDefaultValue, schema)}](${inner === undefined ? '?' : recurse(inner)})`\n    }\n\n    case 'readonly': {\n      const inner = unwrapInner(schema)\n      return inner === undefined ? 'readonly(?)' : `readonly(${recurse(inner)})`\n    }\n\n    case 'pipe': {\n      const inner = unwrapPipe(schema)\n      return inner === undefined ? 'pipe(?)' : `pipe(${recurse(inner)})`\n    }\n\n    case 'catch': {\n      const inner = unwrapInner(schema)\n      return `catch[${stableValueRepr(getCatchDefault, schema)}](${inner === undefined ? '?' : recurse(inner)})`\n    }\n\n    case 'lazy': {\n      // `z.lazy(() => other)` — fingerprint the dereferenced inner.\n      // The `inProgress` WeakSet catches real cycles (a schema that\n      // references itself through lazy) and returns `cyclicSentinel`\n      // for any recursive encounter.\n      const inner = unwrapLazy(schema)\n      return inner === undefined ? 'lazy(?)' : `lazy(${recurse(inner)})`\n    }\n\n    case 'intersection': {\n      const left = getIntersectionLeft(schema)\n      const right = getIntersectionRight(schema)\n      const leftFp = left === undefined ? '?' : recurse(left as z.ZodType)\n      const rightFp = right === undefined ? '?' : recurse(right as z.ZodType)\n      // Intersection members have no semantic order; sort both legs.\n      const parts = [leftFp, rightFp].sort()\n      return `intersection(${parts.join('&')})`\n    }\n\n    // Structural shape isn't observable for these. Bucket them into\n    // kind-only fingerprints — a schema-mismatch warning can't do\n    // better than \"both are `custom`\" here, but that still catches\n    // `object` vs `custom` mismatches. `map` / `symbol` / `function`\n    // are rejected at adapter construction; kept here for exhaustive\n    // switch safety when `fingerprintSchema` is called from tooling.\n    case 'promise':\n    case 'custom':\n    case 'template-literal':\n    case 'transform':\n    case 'file':\n    case 'map':\n    case 'symbol':\n    case 'function':\n      return `${kind}:*`\n\n    default: {\n      // Exhaustiveness guard — if ZodKind grows a new variant we'll\n      // fall through here and get a typecheck-visible warning via\n      // the unreachable assignment.\n      const _: never = kind\n      return `unknown:${String(_)}`\n    }\n  }\n}\n\n/**\n * Render a default/catch value for the fingerprint. Detects\n * non-deterministic factories (`.default(() => new Date())`) by\n * reading the value twice and comparing — zod v4's getter invokes\n * the factory fresh on each access, so two consecutive reads of a\n * factory-backed default produce distinct objects for any\n * heap-allocated return type. Object.is matches for primitive\n * returns (even from factories) and for literal defaults; in both\n * cases we emit the canonical representation. Without this the\n * fingerprint is non-idempotent for schemas like\n * `.default(() => new Date())`.\n */\nfunction stableValueRepr(get: (s: z.ZodType) => unknown, schema: z.ZodType): string {\n  const first = get(schema)\n  const second = get(schema)\n  if (!Object.is(first, second) || typeof first === 'function') return 'fn:*'\n  return canonicalStringify(first)\n}\n\n/**\n * Serialise a check array to a stable string. Checks are sorted by\n * their canonical form so order-of-chain doesn't matter — the zod\n * runtime already collapses `.min(3).max(10)` and `.max(10).min(3)`\n * to the same behaviour, and the fingerprint should match.\n */\nfunction formatChecks(schema: z.ZodType): string {\n  const checks = getChecks(schema)\n  if (checks.length === 0) return ''\n  const parts = checks.map((c) => serializeCheck(c)).sort()\n  return `[${parts.join(';')}]`\n}\n\n/**\n * Zod v4 checks are instances of `$ZodCheck` — their state lives on\n * `_zod.def` (kind discriminator + kind-specific args), not on the\n * object's own enumerable properties. A plain `Object.entries`\n * serialise would see an empty object and collapse every check to\n * the same fingerprint — `.min(3)` and `.min(8)` would look\n * identical. Reach into `_zod.def` when it's present; fall back to\n * generic canonicalisation for anything that isn't shaped like a\n * v4 check (custom adapters may pass their own shapes here).\n */\nfunction serializeCheck(check: unknown): string {\n  if (check !== null && typeof check === 'object') {\n    const def = (check as { _zod?: { def?: unknown } })._zod?.def\n    if (def !== undefined) return canonicalStringify(def)\n  }\n  return canonicalStringify(check)\n}\n\n/** Strict-mode sort comparator that handles mixed string/number enums. */\nfunction compare(a: string | number, b: string | number): number {\n  const as = String(a)\n  const bs = String(b)\n  return as < bs ? -1 : as > bs ? 1 : 0\n}\n"],"names":["kindOf","getLiteralValues","canonicalStringify","getEnumValues","getObjectShape","getArrayElement","getSetValueType","getTupleItems","getRecordKeyType","getRecordValueType","getUnionOptions","getDiscriminator","getDiscriminatedOptions","unwrapInner","getDefaultValue","unwrapPipe","getCatchDefault","unwrapLazy","getIntersectionLeft","getIntersectionRight","getChecks"],"mappings":";;;;;AAsEA,MAAM,cAAA,GAAiB,UAAA;AAEhB,SAAS,qBAAqB,MAAA,EAA2B;AAC9D,EAAA,MAAM,KAAA,uBAAY,OAAA,EAA2B;AAC7C,EAAA,MAAM,UAAA,uBAAiB,OAAA,EAAmB;AAC1C,EAAA,OAAO,KAAA,CAAM,MAAA,EAAQ,KAAA,EAAO,UAAU,CAAA;AACxC;AAEA,SAAS,KAAA,CACP,MAAA,EACA,KAAA,EACA,UAAA,EACQ;AACR,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AAC/B,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AACjC,EAAA,IAAI,UAAA,CAAW,GAAA,CAAI,MAAM,CAAA,EAAG,OAAO,cAAA;AACnC,EAAA,UAAA,CAAW,IAAI,MAAM,CAAA;AACrB,EAAA,IAAI;AACF,IAAA,MAAM,QAAA,GAAW,kBAAA,CAAmB,MAAA,EAAQ,KAAA,EAAO,UAAU,CAAA;AAC7D,IAAA,KAAA,CAAM,GAAA,CAAI,QAAQ,QAAQ,CAAA;AAC1B,IAAA,OAAO,QAAA;AAAA,EACT,CAAA,SAAE;AACA,IAAA,UAAA,CAAW,OAAO,MAAM,CAAA;AAAA,EAC1B;AACF;AAEA,SAAS,kBAAA,CACP,MAAA,EACA,KAAA,EACA,UAAA,EACQ;AACR,EAAA,MAAM,IAAA,GAAOA,aAAO,MAAM,CAAA;AAC1B,EAAA,MAAM,UAAU,CAAC,KAAA,KAA6B,KAAA,CAAM,KAAA,EAAO,OAAO,UAAU,CAAA;AAC5E,EAAA,QAAQ,IAAA;AAAM;AAAA,IAEZ,KAAK,SAAA;AAAA,IACL,KAAK,MAAA;AAAA,IACL,KAAK,WAAA;AAAA,IACL,KAAK,KAAA;AAAA,IACL,KAAK,SAAA;AAAA,IACL,KAAK,KAAA;AAAA,IACL,KAAK,MAAA;AAAA,IACL,KAAK,OAAA;AACH,MAAA,OAAO,IAAA;AAAA;AAAA;AAAA;AAAA,IAKT,KAAK,QAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,MAAA;AACH,MAAA,OAAO,CAAA,EAAG,IAAI,CAAA,EAAG,YAAA,CAAa,MAAM,CAAC,CAAA,CAAA;AAAA,IAEvC,KAAK,SAAA,EAAW;AAOd,MAAA,MAAM,MAAA,GAAS,CAAC,GAAGC,sBAAA,CAAiB,MAAM,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM;AAC1D,QAAA,MAAM,EAAA,GAAKC,sCAAmB,CAAC,CAAA;AAC/B,QAAA,MAAM,EAAA,GAAKA,sCAAmB,CAAC,CAAA;AAC/B,QAAA,OAAO,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,KAAK,CAAA,GAAI,CAAA;AAAA,MACtC,CAAC,CAAA;AACD,MAAA,OAAO,CAAA,QAAA,EAAWA,qCAAA,CAAmB,MAAM,CAAC,CAAA,CAAA;AAAA,IAC9C;AAAA,IAEA,KAAK,MAAA;AAEH,MAAA,OAAO,QAAQA,qCAAA,CAAmB,CAAC,GAAGC,mBAAA,CAAc,MAAM,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,GAAG,CAAA,KAAM,OAAA,CAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA,CAAA;AAAA,IAE7F,KAAK,QAAA,EAAU;AACb,MAAA,MAAM,KAAA,GAAQC,qBAAe,MAAqB,CAAA;AAClD,MAAA,MAAM,gBAAgB,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,CACvC,KAAK,CAAC,CAAC,CAAC,CAAA,EAAG,CAAC,CAAC,CAAA,KAAO,CAAA,GAAI,CAAA,GAAI,KAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAE,EAC/C,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,CAAA,KAAM,CAAA,EAAG,IAAA,CAAK,SAAA,CAAU,CAAC,CAAC,CAAA,CAAA,EAAI,OAAA,CAAQ,CAAC,CAAC,CAAA,CAAE,CAAA;AACvD,MAAA,OAAO,CAAA,OAAA,EAAU,cAAc,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,EAAI,YAAA,CAAa,MAAM,CAAC,CAAA,CAAA;AAAA,IAClE;AAAA,IAEA,KAAK,OAAA;AACH,MAAA,OAAO,CAAA,MAAA,EAAS,QAAQC,qBAAA,CAAgB,MAAoB,CAAC,CAAC,CAAA,CAAA,EAAI,YAAA,CAAa,MAAM,CAAC,CAAA,CAAA;AAAA,IAExF,KAAK,KAAA;AACH,MAAA,OAAO,CAAA,IAAA,EAAO,QAAQC,qBAAA,CAAgB,MAAM,CAAC,CAAC,CAAA,CAAA,EAAI,YAAA,CAAa,MAAM,CAAC,CAAA,CAAA;AAAA,IAExE,KAAK,OAAA;AACH,MAAA,OAAO,CAAA,MAAA,EAASC,oBAAc,MAAM,CAAA,CAAE,IAAI,OAAO,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,IAE9D,KAAK,QAAA;AACH,MAAA,OAAO,CAAA,OAAA,EAAU,OAAA,CAAQC,sBAAA,CAAiB,MAAM,CAAC,CAAC,CAAA,CAAA,EAAI,OAAA,CAAQC,wBAAA,CAAmB,MAAM,CAAC,CAAC,CAAA,CAAA,CAAA;AAAA,IAE3F,KAAK,OAAA,EAAS;AAEZ,MAAA,MAAM,UAAUC,qBAAA,CAAgB,MAAM,EAAE,GAAA,CAAI,OAAO,EAAE,IAAA,EAAK;AAC1D,MAAA,OAAO,CAAA,MAAA,EAAS,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,IACnC;AAAA,IAEA,KAAK,qBAAA,EAAuB;AAC1B,MAAA,MAAM,IAAA,GAAOC,sBAAA,CAAiB,MAAM,CAAA,IAAK,GAAA;AACzC,MAAA,MAAM,UAAUC,6BAAA,CAAwB,MAAM,EAAE,GAAA,CAAI,OAAO,EAAE,IAAA,EAAK;AAClE,MAAA,OAAO,CAAA,OAAA,EAAU,KAAK,SAAA,CAAU,IAAI,CAAC,CAAA,EAAA,EAAK,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,IAC7D;AAAA,IAEA,KAAK,UAAA,EAAY;AACf,MAAA,MAAM,KAAA,GAAQC,kBAAY,MAAM,CAAA;AAChC,MAAA,OAAO,UAAU,MAAA,GAAY,aAAA,GAAgB,CAAA,SAAA,EAAY,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACzE;AAAA,IAEA,KAAK,UAAA,EAAY;AACf,MAAA,MAAM,KAAA,GAAQA,kBAAY,MAAM,CAAA;AAChC,MAAA,OAAO,UAAU,MAAA,GAAY,aAAA,GAAgB,CAAA,SAAA,EAAY,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACzE;AAAA,IAEA,KAAK,SAAA,EAAW;AACd,MAAA,MAAM,KAAA,GAAQA,kBAAY,MAAM,CAAA;AAChC,MAAA,OAAO,CAAA,QAAA,EAAW,eAAA,CAAgBC,qBAAA,EAAiB,MAAM,CAAC,CAAA,EAAA,EAAK,KAAA,KAAU,MAAA,GAAY,GAAA,GAAM,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IAC3G;AAAA,IAEA,KAAK,UAAA,EAAY;AACf,MAAA,MAAM,KAAA,GAAQD,kBAAY,MAAM,CAAA;AAChC,MAAA,OAAO,UAAU,MAAA,GAAY,aAAA,GAAgB,CAAA,SAAA,EAAY,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACzE;AAAA,IAEA,KAAK,MAAA,EAAQ;AACX,MAAA,MAAM,KAAA,GAAQE,iBAAW,MAAM,CAAA;AAC/B,MAAA,OAAO,UAAU,MAAA,GAAY,SAAA,GAAY,CAAA,KAAA,EAAQ,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACjE;AAAA,IAEA,KAAK,OAAA,EAAS;AACZ,MAAA,MAAM,KAAA,GAAQF,kBAAY,MAAM,CAAA;AAChC,MAAA,OAAO,CAAA,MAAA,EAAS,eAAA,CAAgBG,qBAAA,EAAiB,MAAM,CAAC,CAAA,EAAA,EAAK,KAAA,KAAU,MAAA,GAAY,GAAA,GAAM,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACzG;AAAA,IAEA,KAAK,MAAA,EAAQ;AAKX,MAAA,MAAM,KAAA,GAAQC,iBAAW,MAAM,CAAA;AAC/B,MAAA,OAAO,UAAU,MAAA,GAAY,SAAA,GAAY,CAAA,KAAA,EAAQ,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACjE;AAAA,IAEA,KAAK,cAAA,EAAgB;AACnB,MAAA,MAAM,IAAA,GAAOC,0BAAoB,MAAM,CAAA;AACvC,MAAA,MAAM,KAAA,GAAQC,2BAAqB,MAAM,CAAA;AACzC,MAAA,MAAM,MAAA,GAAS,IAAA,KAAS,MAAA,GAAY,GAAA,GAAM,QAAQ,IAAiB,CAAA;AACnE,MAAA,MAAM,OAAA,GAAU,KAAA,KAAU,MAAA,GAAY,GAAA,GAAM,QAAQ,KAAkB,CAAA;AAEtE,MAAA,MAAM,KAAA,GAAQ,CAAC,MAAA,EAAQ,OAAO,EAAE,IAAA,EAAK;AACrC,MAAA,OAAO,CAAA,aAAA,EAAgB,KAAA,CAAM,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,IACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,KAAK,SAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,kBAAA;AAAA,IACL,KAAK,WAAA;AAAA,IACL,KAAK,MAAA;AAAA,IACL,KAAK,KAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,UAAA;AACH,MAAA,OAAO,GAAG,IAAI,CAAA,EAAA,CAAA;AAAA,IAEhB,SAAS;AAIP,MAAA,MAAM,CAAA,GAAW,IAAA;AACjB,MAAA,OAAO,CAAA,QAAA,EAAW,MAAA,CAAO,CAAC,CAAC,CAAA,CAAA;AAAA,IAC7B;AAAA;AAEJ;AAcA,SAAS,eAAA,CAAgB,KAAgC,MAAA,EAA2B;AAClF,EAAA,MAAM,KAAA,GAAQ,IAAI,MAAM,CAAA;AACxB,EAAA,MAAM,MAAA,GAAS,IAAI,MAAM,CAAA;AACzB,EAAA,IAAI,CAAC,OAAO,EAAA,CAAG,KAAA,EAAO,MAAM,CAAA,IAAK,OAAO,KAAA,KAAU,UAAA,EAAY,OAAO,MAAA;AACrE,EAAA,OAAOjB,sCAAmB,KAAK,CAAA;AACjC;AAQA,SAAS,aAAa,MAAA,EAA2B;AAC/C,EAAA,MAAM,MAAA,GAASkB,gBAAU,MAAM,CAAA;AAC/B,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,EAAA;AAChC,EAAA,MAAM,KAAA,GAAQ,OAAO,GAAA,CAAI,CAAC,MAAM,cAAA,CAAe,CAAC,CAAC,CAAA,CAAE,IAAA,EAAK;AACxD,EAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAC5B;AAYA,SAAS,eAAe,KAAA,EAAwB;AAC9C,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,EAAU;AAC/C,IAAA,MAAM,GAAA,GAAO,MAAuC,IAAA,EAAM,GAAA;AAC1D,IAAA,IAAI,GAAA,KAAQ,MAAA,EAAW,OAAOlB,qCAAA,CAAmB,GAAG,CAAA;AAAA,EACtD;AACA,EAAA,OAAOA,sCAAmB,KAAK,CAAA;AACjC;AAGA,SAAS,OAAA,CAAQ,GAAoB,CAAA,EAA4B;AAC/D,EAAA,MAAM,EAAA,GAAK,OAAO,CAAC,CAAA;AACnB,EAAA,MAAM,EAAA,GAAK,OAAO,CAAC,CAAA;AACnB,EAAA,OAAO,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,KAAK,CAAA,GAAI,CAAA;AACtC;;;;"}

package/dist/chunks/fingerprint2.mjs

@@ -0,0 +1,160 @@
+import { c as canonicalStringify } from '../shared/attaform.BJGA_UOS.mjs';
+import { s as kindOf, j as getIntersectionLeft, k as getIntersectionRight, t as unwrapLazy, u as unwrapInner, v as unwrapPipe, h as getDiscriminator, e as getDiscriminatedOptions, r as getUnionOptions, n as getRecordKeyType, o as getRecordValueType, q as getTupleItems, p as getSetValueType, g as getArrayElement, m as getObjectShape, i as getEnumValues, l as getLiteralValues, c as getChecks, b as getCatchDefault, d as getDefaultValue } from '../shared/attaform.BnK_bfcb.mjs';
+
+const cyclicSentinel = "<cyclic>";
+function fingerprintZodSchema(schema) {
+  const cache = /* @__PURE__ */ new WeakMap();
+  const inProgress = /* @__PURE__ */ new WeakSet();
+  return visit(schema, cache, inProgress);
+}
+function visit(schema, cache, inProgress) {
+  const cached = cache.get(schema);
+  if (cached !== void 0) return cached;
+  if (inProgress.has(schema)) return cyclicSentinel;
+  inProgress.add(schema);
+  try {
+    const computed = computeFingerprint(schema, cache, inProgress);
+    cache.set(schema, computed);
+    return computed;
+  } finally {
+    inProgress.delete(schema);
+  }
+}
+function computeFingerprint(schema, cache, inProgress) {
+  const kind = kindOf(schema);
+  const recurse = (child) => visit(child, cache, inProgress);
+  switch (kind) {
+    // Kind-only leaves: no further structure to descend into.
+    case "boolean":
+    case "null":
+    case "undefined":
+    case "any":
+    case "unknown":
+    case "nan":
+    case "void":
+    case "never":
+      return kind;
+    // Leaves with checks (min/max/email/regex/...). Checks are
+    // canonicalised and sorted so `.min(3).max(10)` and `.max(10).min(3)`
+    // produce identical fingerprints.
+    case "string":
+    case "number":
+    case "bigint":
+    case "date":
+      return `${kind}${formatChecks(schema)}`;
+    case "literal": {
+      const values = [...getLiteralValues(schema)].sort((a, b) => {
+        const as = canonicalStringify(a);
+        const bs = canonicalStringify(b);
+        return as < bs ? -1 : as > bs ? 1 : 0;
+      });
+      return `literal:${canonicalStringify(values)}`;
+    }
+    case "enum":
+      return `enum:${canonicalStringify([...getEnumValues(schema)].sort((a, b) => compare(a, b)))}`;
+    case "object": {
+      const shape = getObjectShape(schema);
+      const sortedEntries = Object.entries(shape).sort(([a], [b]) => a < b ? -1 : a > b ? 1 : 0).map(([k, v]) => `${JSON.stringify(k)}:${recurse(v)}`);
+      return `object{${sortedEntries.join(",")}}${formatChecks(schema)}`;
+    }
+    case "array":
+      return `array[${recurse(getArrayElement(schema))}]${formatChecks(schema)}`;
+    case "set":
+      return `set<${recurse(getSetValueType(schema))}>${formatChecks(schema)}`;
+    case "tuple":
+      return `tuple[${getTupleItems(schema).map(recurse).join(",")}]`;
+    case "record":
+      return `record<${recurse(getRecordKeyType(schema))},${recurse(getRecordValueType(schema))}>`;
+    case "union": {
+      const options = getUnionOptions(schema).map(recurse).sort();
+      return `union(${options.join("|")})`;
+    }
+    case "discriminated-union": {
+      const disc = getDiscriminator(schema) ?? "?";
+      const options = getDiscriminatedOptions(schema).map(recurse).sort();
+      return `dunion[${JSON.stringify(disc)}](${options.join("|")})`;
+    }
+    case "optional": {
+      const inner = unwrapInner(schema);
+      return inner === void 0 ? "optional(?)" : `optional(${recurse(inner)})`;
+    }
+    case "nullable": {
+      const inner = unwrapInner(schema);
+      return inner === void 0 ? "nullable(?)" : `nullable(${recurse(inner)})`;
+    }
+    case "default": {
+      const inner = unwrapInner(schema);
+      return `default[${stableValueRepr(getDefaultValue, schema)}](${inner === void 0 ? "?" : recurse(inner)})`;
+    }
+    case "readonly": {
+      const inner = unwrapInner(schema);
+      return inner === void 0 ? "readonly(?)" : `readonly(${recurse(inner)})`;
+    }
+    case "pipe": {
+      const inner = unwrapPipe(schema);
+      return inner === void 0 ? "pipe(?)" : `pipe(${recurse(inner)})`;
+    }
+    case "catch": {
+      const inner = unwrapInner(schema);
+      return `catch[${stableValueRepr(getCatchDefault, schema)}](${inner === void 0 ? "?" : recurse(inner)})`;
+    }
+    case "lazy": {
+      const inner = unwrapLazy(schema);
+      return inner === void 0 ? "lazy(?)" : `lazy(${recurse(inner)})`;
+    }
+    case "intersection": {
+      const left = getIntersectionLeft(schema);
+      const right = getIntersectionRight(schema);
+      const leftFp = left === void 0 ? "?" : recurse(left);
+      const rightFp = right === void 0 ? "?" : recurse(right);
+      const parts = [leftFp, rightFp].sort();
+      return `intersection(${parts.join("&")})`;
+    }
+    // Structural shape isn't observable for these. Bucket them into
+    // kind-only fingerprints — a schema-mismatch warning can't do
+    // better than "both are `custom`" here, but that still catches
+    // `object` vs `custom` mismatches. `map` / `symbol` / `function`
+    // are rejected at adapter construction; kept here for exhaustive
+    // switch safety when `fingerprintSchema` is called from tooling.
+    case "promise":
+    case "custom":
+    case "template-literal":
+    case "transform":
+    case "file":
+    case "map":
+    case "symbol":
+    case "function":
+      return `${kind}:*`;
+    default: {
+      const _ = kind;
+      return `unknown:${String(_)}`;
+    }
+  }
+}
+function stableValueRepr(get, schema) {
+  const first = get(schema);
+  const second = get(schema);
+  if (!Object.is(first, second) || typeof first === "function") return "fn:*";
+  return canonicalStringify(first);
+}
+function formatChecks(schema) {
+  const checks = getChecks(schema);
+  if (checks.length === 0) return "";
+  const parts = checks.map((c) => serializeCheck(c)).sort();
+  return `[${parts.join(";")}]`;
+}
+function serializeCheck(check) {
+  if (check !== null && typeof check === "object") {
+    const def = check._zod?.def;
+    if (def !== void 0) return canonicalStringify(def);
+  }
+  return canonicalStringify(check);
+}
+function compare(a, b) {
+  const as = String(a);
+  const bs = String(b);
+  return as < bs ? -1 : as > bs ? 1 : 0;
+}
+
+export { fingerprintZodSchema };
+//# sourceMappingURL=fingerprint2.mjs.map

package/dist/chunks/fingerprint2.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"fingerprint2.mjs","sources":["../../src/runtime/adapters/zod-v4/fingerprint.ts"],"sourcesContent":["import type { z } from 'zod'\nimport { canonicalStringify } from '../../core/canonical-stringify'\nimport {\n  getArrayElement,\n  getCatchDefault,\n  getChecks,\n  getDefaultValue,\n  getDiscriminatedOptions,\n  getDiscriminator,\n  getEnumValues,\n  getIntersectionLeft,\n  getIntersectionRight,\n  getLiteralValues,\n  getObjectShape,\n  getRecordKeyType,\n  getRecordValueType,\n  getSetValueType,\n  getTupleItems,\n  getUnionOptions,\n  kindOf,\n  unwrapInner,\n  unwrapLazy,\n  unwrapPipe,\n} from './introspect'\n\n/**\n * Compute a structural fingerprint for a Zod v4 schema.\n *\n * The returned string is:\n * - **Deterministic** for any pair of schemas with the same shape,\n *   regardless of whether they were constructed by the same\n *   `z.object({...})` call or two identical ones in different files.\n * - **Key-order-insensitive** for `z.object` — shape entries are\n *   sorted before serialisation, so `{a, b}` and `{b, a}` produce\n *   the same fingerprint.\n * - **Order-insensitive for `z.union`** — option fingerprints are\n *   sorted before they're folded in, because union membership has\n *   no semantic order.\n * - **Idempotent** — two fingerprint calls on the same schema\n *   reference return identical strings, even when the schema\n *   contains non-deterministic metadata (e.g. `.default(() => new\n *   Date())`). Factories of any kind collapse to an opaque\n *   `fn:*` sentinel for this reason (see `defaultValueRepr`).\n *\n * **Known false negatives** — situations where two semantically\n * different schemas hash the same:\n * - `.refine(fn1)` and `.refine(fn2)`: function bodies aren't\n *   hashable in a way that survives minification / different closure\n *   captures, so every refinement collapses via the generic `fn:*`\n *   sentinel. The warning this powers is a best-effort footgun\n *   catcher, not a soundness guarantee — two forms whose only\n *   difference is refinement logic will look identical here.\n * - `.transform(fn)`: same reason.\n * - `.default(() => x)` where the factory is non-deterministic:\n *   collapses to `fn:*` (idempotence requirement — we can't hash a\n *   fresh Date on every call).\n * - `z.custom()` — no structural information to introspect; renders\n *   as `custom:*`.\n *\n * **Caching is per-call, not module-global.** A WeakMap cache\n * scoped to the starting schema would break correctness under\n * cycles: the `<cyclic>` sentinel's meaning is relative to the\n * call's starting node, so a cached mid-traversal result from one\n * call is wrong for a different call. Cheapest correct design is\n * \"fresh cache per top-level call.\" A 50-field nested schema\n * fingerprints in microseconds, and the library calls `fingerprint`\n * at most twice per shared-key collision (existing + incoming) —\n * not a hot path.\n */\n\nconst cyclicSentinel = '<cyclic>'\n\nexport function fingerprintZodSchema(schema: z.ZodType): string {\n  const cache = new WeakMap<z.ZodType, string>()\n  const inProgress = new WeakSet<z.ZodType>()\n  return visit(schema, cache, inProgress)\n}\n\nfunction visit(\n  schema: z.ZodType,\n  cache: WeakMap<z.ZodType, string>,\n  inProgress: WeakSet<z.ZodType>\n): string {\n  const cached = cache.get(schema)\n  if (cached !== undefined) return cached\n  if (inProgress.has(schema)) return cyclicSentinel\n  inProgress.add(schema)\n  try {\n    const computed = computeFingerprint(schema, cache, inProgress)\n    cache.set(schema, computed)\n    return computed\n  } finally {\n    inProgress.delete(schema)\n  }\n}\n\nfunction computeFingerprint(\n  schema: z.ZodType,\n  cache: WeakMap<z.ZodType, string>,\n  inProgress: WeakSet<z.ZodType>\n): string {\n  const kind = kindOf(schema)\n  const recurse = (child: z.ZodType): string => visit(child, cache, inProgress)\n  switch (kind) {\n    // Kind-only leaves: no further structure to descend into.\n    case 'boolean':\n    case 'null':\n    case 'undefined':\n    case 'any':\n    case 'unknown':\n    case 'nan':\n    case 'void':\n    case 'never':\n      return kind\n\n    // Leaves with checks (min/max/email/regex/...). Checks are\n    // canonicalised and sorted so `.min(3).max(10)` and `.max(10).min(3)`\n    // produce identical fingerprints.\n    case 'string':\n    case 'number':\n    case 'bigint':\n    case 'date':\n      return `${kind}${formatChecks(schema)}`\n\n    case 'literal': {\n      // `z.literal(['a', 'b'])` accepts either — the value set has\n      // no semantic order, so canonical-sort before hashing so\n      // `['a','b']` and `['b','a']` match. `z.literal` accepts\n      // string / number / boolean / null / undefined / bigint /\n      // symbol — sort by canonicalised string form to get a total\n      // order across those types.\n      const values = [...getLiteralValues(schema)].sort((a, b) => {\n        const as = canonicalStringify(a)\n        const bs = canonicalStringify(b)\n        return as < bs ? -1 : as > bs ? 1 : 0\n      })\n      return `literal:${canonicalStringify(values)}`\n    }\n\n    case 'enum':\n      // Enum values have no semantic order — sort before folding.\n      return `enum:${canonicalStringify([...getEnumValues(schema)].sort((a, b) => compare(a, b)))}`\n\n    case 'object': {\n      const shape = getObjectShape(schema as z.ZodObject)\n      const sortedEntries = Object.entries(shape)\n        .sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0))\n        .map(([k, v]) => `${JSON.stringify(k)}:${recurse(v)}`)\n      return `object{${sortedEntries.join(',')}}${formatChecks(schema)}`\n    }\n\n    case 'array':\n      return `array[${recurse(getArrayElement(schema as z.ZodArray))}]${formatChecks(schema)}`\n\n    case 'set':\n      return `set<${recurse(getSetValueType(schema))}>${formatChecks(schema)}`\n\n    case 'tuple':\n      return `tuple[${getTupleItems(schema).map(recurse).join(',')}]`\n\n    case 'record':\n      return `record<${recurse(getRecordKeyType(schema))},${recurse(getRecordValueType(schema))}>`\n\n    case 'union': {\n      // Union membership has no order; sort option fingerprints.\n      const options = getUnionOptions(schema).map(recurse).sort()\n      return `union(${options.join('|')})`\n    }\n\n    case 'discriminated-union': {\n      const disc = getDiscriminator(schema) ?? '?'\n      const options = getDiscriminatedOptions(schema).map(recurse).sort()\n      return `dunion[${JSON.stringify(disc)}](${options.join('|')})`\n    }\n\n    case 'optional': {\n      const inner = unwrapInner(schema)\n      return inner === undefined ? 'optional(?)' : `optional(${recurse(inner)})`\n    }\n\n    case 'nullable': {\n      const inner = unwrapInner(schema)\n      return inner === undefined ? 'nullable(?)' : `nullable(${recurse(inner)})`\n    }\n\n    case 'default': {\n      const inner = unwrapInner(schema)\n      return `default[${stableValueRepr(getDefaultValue, schema)}](${inner === undefined ? '?' : recurse(inner)})`\n    }\n\n    case 'readonly': {\n      const inner = unwrapInner(schema)\n      return inner === undefined ? 'readonly(?)' : `readonly(${recurse(inner)})`\n    }\n\n    case 'pipe': {\n      const inner = unwrapPipe(schema)\n      return inner === undefined ? 'pipe(?)' : `pipe(${recurse(inner)})`\n    }\n\n    case 'catch': {\n      const inner = unwrapInner(schema)\n      return `catch[${stableValueRepr(getCatchDefault, schema)}](${inner === undefined ? '?' : recurse(inner)})`\n    }\n\n    case 'lazy': {\n      // `z.lazy(() => other)` — fingerprint the dereferenced inner.\n      // The `inProgress` WeakSet catches real cycles (a schema that\n      // references itself through lazy) and returns `cyclicSentinel`\n      // for any recursive encounter.\n      const inner = unwrapLazy(schema)\n      return inner === undefined ? 'lazy(?)' : `lazy(${recurse(inner)})`\n    }\n\n    case 'intersection': {\n      const left = getIntersectionLeft(schema)\n      const right = getIntersectionRight(schema)\n      const leftFp = left === undefined ? '?' : recurse(left as z.ZodType)\n      const rightFp = right === undefined ? '?' : recurse(right as z.ZodType)\n      // Intersection members have no semantic order; sort both legs.\n      const parts = [leftFp, rightFp].sort()\n      return `intersection(${parts.join('&')})`\n    }\n\n    // Structural shape isn't observable for these. Bucket them into\n    // kind-only fingerprints — a schema-mismatch warning can't do\n    // better than \"both are `custom`\" here, but that still catches\n    // `object` vs `custom` mismatches. `map` / `symbol` / `function`\n    // are rejected at adapter construction; kept here for exhaustive\n    // switch safety when `fingerprintSchema` is called from tooling.\n    case 'promise':\n    case 'custom':\n    case 'template-literal':\n    case 'transform':\n    case 'file':\n    case 'map':\n    case 'symbol':\n    case 'function':\n      return `${kind}:*`\n\n    default: {\n      // Exhaustiveness guard — if ZodKind grows a new variant we'll\n      // fall through here and get a typecheck-visible warning via\n      // the unreachable assignment.\n      const _: never = kind\n      return `unknown:${String(_)}`\n    }\n  }\n}\n\n/**\n * Render a default/catch value for the fingerprint. Detects\n * non-deterministic factories (`.default(() => new Date())`) by\n * reading the value twice and comparing — zod v4's getter invokes\n * the factory fresh on each access, so two consecutive reads of a\n * factory-backed default produce distinct objects for any\n * heap-allocated return type. Object.is matches for primitive\n * returns (even from factories) and for literal defaults; in both\n * cases we emit the canonical representation. Without this the\n * fingerprint is non-idempotent for schemas like\n * `.default(() => new Date())`.\n */\nfunction stableValueRepr(get: (s: z.ZodType) => unknown, schema: z.ZodType): string {\n  const first = get(schema)\n  const second = get(schema)\n  if (!Object.is(first, second) || typeof first === 'function') return 'fn:*'\n  return canonicalStringify(first)\n}\n\n/**\n * Serialise a check array to a stable string. Checks are sorted by\n * their canonical form so order-of-chain doesn't matter — the zod\n * runtime already collapses `.min(3).max(10)` and `.max(10).min(3)`\n * to the same behaviour, and the fingerprint should match.\n */\nfunction formatChecks(schema: z.ZodType): string {\n  const checks = getChecks(schema)\n  if (checks.length === 0) return ''\n  const parts = checks.map((c) => serializeCheck(c)).sort()\n  return `[${parts.join(';')}]`\n}\n\n/**\n * Zod v4 checks are instances of `$ZodCheck` — their state lives on\n * `_zod.def` (kind discriminator + kind-specific args), not on the\n * object's own enumerable properties. A plain `Object.entries`\n * serialise would see an empty object and collapse every check to\n * the same fingerprint — `.min(3)` and `.min(8)` would look\n * identical. Reach into `_zod.def` when it's present; fall back to\n * generic canonicalisation for anything that isn't shaped like a\n * v4 check (custom adapters may pass their own shapes here).\n */\nfunction serializeCheck(check: unknown): string {\n  if (check !== null && typeof check === 'object') {\n    const def = (check as { _zod?: { def?: unknown } })._zod?.def\n    if (def !== undefined) return canonicalStringify(def)\n  }\n  return canonicalStringify(check)\n}\n\n/** Strict-mode sort comparator that handles mixed string/number enums. */\nfunction compare(a: string | number, b: string | number): number {\n  const as = String(a)\n  const bs = String(b)\n  return as < bs ? -1 : as > bs ? 1 : 0\n}\n"],"names":[],"mappings":";;;AAsEA,MAAM,cAAA,GAAiB,UAAA;AAEhB,SAAS,qBAAqB,MAAA,EAA2B;AAC9D,EAAA,MAAM,KAAA,uBAAY,OAAA,EAA2B;AAC7C,EAAA,MAAM,UAAA,uBAAiB,OAAA,EAAmB;AAC1C,EAAA,OAAO,KAAA,CAAM,MAAA,EAAQ,KAAA,EAAO,UAAU,CAAA;AACxC;AAEA,SAAS,KAAA,CACP,MAAA,EACA,KAAA,EACA,UAAA,EACQ;AACR,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AAC/B,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AACjC,EAAA,IAAI,UAAA,CAAW,GAAA,CAAI,MAAM,CAAA,EAAG,OAAO,cAAA;AACnC,EAAA,UAAA,CAAW,IAAI,MAAM,CAAA;AACrB,EAAA,IAAI;AACF,IAAA,MAAM,QAAA,GAAW,kBAAA,CAAmB,MAAA,EAAQ,KAAA,EAAO,UAAU,CAAA;AAC7D,IAAA,KAAA,CAAM,GAAA,CAAI,QAAQ,QAAQ,CAAA;AAC1B,IAAA,OAAO,QAAA;AAAA,EACT,CAAA,SAAE;AACA,IAAA,UAAA,CAAW,OAAO,MAAM,CAAA;AAAA,EAC1B;AACF;AAEA,SAAS,kBAAA,CACP,MAAA,EACA,KAAA,EACA,UAAA,EACQ;AACR,EAAA,MAAM,IAAA,GAAO,OAAO,MAAM,CAAA;AAC1B,EAAA,MAAM,UAAU,CAAC,KAAA,KAA6B,KAAA,CAAM,KAAA,EAAO,OAAO,UAAU,CAAA;AAC5E,EAAA,QAAQ,IAAA;AAAM;AAAA,IAEZ,KAAK,SAAA;AAAA,IACL,KAAK,MAAA;AAAA,IACL,KAAK,WAAA;AAAA,IACL,KAAK,KAAA;AAAA,IACL,KAAK,SAAA;AAAA,IACL,KAAK,KAAA;AAAA,IACL,KAAK,MAAA;AAAA,IACL,KAAK,OAAA;AACH,MAAA,OAAO,IAAA;AAAA;AAAA;AAAA;AAAA,IAKT,KAAK,QAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,MAAA;AACH,MAAA,OAAO,CAAA,EAAG,IAAI,CAAA,EAAG,YAAA,CAAa,MAAM,CAAC,CAAA,CAAA;AAAA,IAEvC,KAAK,SAAA,EAAW;AAOd,MAAA,MAAM,MAAA,GAAS,CAAC,GAAG,gBAAA,CAAiB,MAAM,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM;AAC1D,QAAA,MAAM,EAAA,GAAK,mBAAmB,CAAC,CAAA;AAC/B,QAAA,MAAM,EAAA,GAAK,mBAAmB,CAAC,CAAA;AAC/B,QAAA,OAAO,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,KAAK,CAAA,GAAI,CAAA;AAAA,MACtC,CAAC,CAAA;AACD,MAAA,OAAO,CAAA,QAAA,EAAW,kBAAA,CAAmB,MAAM,CAAC,CAAA,CAAA;AAAA,IAC9C;AAAA,IAEA,KAAK,MAAA;AAEH,MAAA,OAAO,QAAQ,kBAAA,CAAmB,CAAC,GAAG,aAAA,CAAc,MAAM,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,GAAG,CAAA,KAAM,OAAA,CAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA,CAAA;AAAA,IAE7F,KAAK,QAAA,EAAU;AACb,MAAA,MAAM,KAAA,GAAQ,eAAe,MAAqB,CAAA;AAClD,MAAA,MAAM,gBAAgB,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,CACvC,KAAK,CAAC,CAAC,CAAC,CAAA,EAAG,CAAC,CAAC,CAAA,KAAO,CAAA,GAAI,CAAA,GAAI,KAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAE,EAC/C,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,CAAA,KAAM,CAAA,EAAG,IAAA,CAAK,SAAA,CAAU,CAAC,CAAC,CAAA,CAAA,EAAI,OAAA,CAAQ,CAAC,CAAC,CAAA,CAAE,CAAA;AACvD,MAAA,OAAO,CAAA,OAAA,EAAU,cAAc,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,EAAI,YAAA,CAAa,MAAM,CAAC,CAAA,CAAA;AAAA,IAClE;AAAA,IAEA,KAAK,OAAA;AACH,MAAA,OAAO,CAAA,MAAA,EAAS,QAAQ,eAAA,CAAgB,MAAoB,CAAC,CAAC,CAAA,CAAA,EAAI,YAAA,CAAa,MAAM,CAAC,CAAA,CAAA;AAAA,IAExF,KAAK,KAAA;AACH,MAAA,OAAO,CAAA,IAAA,EAAO,QAAQ,eAAA,CAAgB,MAAM,CAAC,CAAC,CAAA,CAAA,EAAI,YAAA,CAAa,MAAM,CAAC,CAAA,CAAA;AAAA,IAExE,KAAK,OAAA;AACH,MAAA,OAAO,CAAA,MAAA,EAAS,cAAc,MAAM,CAAA,CAAE,IAAI,OAAO,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,IAE9D,KAAK,QAAA;AACH,MAAA,OAAO,CAAA,OAAA,EAAU,OAAA,CAAQ,gBAAA,CAAiB,MAAM,CAAC,CAAC,CAAA,CAAA,EAAI,OAAA,CAAQ,kBAAA,CAAmB,MAAM,CAAC,CAAC,CAAA,CAAA,CAAA;AAAA,IAE3F,KAAK,OAAA,EAAS;AAEZ,MAAA,MAAM,UAAU,eAAA,CAAgB,MAAM,EAAE,GAAA,CAAI,OAAO,EAAE,IAAA,EAAK;AAC1D,MAAA,OAAO,CAAA,MAAA,EAAS,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,IACnC;AAAA,IAEA,KAAK,qBAAA,EAAuB;AAC1B,MAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,MAAM,CAAA,IAAK,GAAA;AACzC,MAAA,MAAM,UAAU,uBAAA,CAAwB,MAAM,EAAE,GAAA,CAAI,OAAO,EAAE,IAAA,EAAK;AAClE,MAAA,OAAO,CAAA,OAAA,EAAU,KAAK,SAAA,CAAU,IAAI,CAAC,CAAA,EAAA,EAAK,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,IAC7D;AAAA,IAEA,KAAK,UAAA,EAAY;AACf,MAAA,MAAM,KAAA,GAAQ,YAAY,MAAM,CAAA;AAChC,MAAA,OAAO,UAAU,MAAA,GAAY,aAAA,GAAgB,CAAA,SAAA,EAAY,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACzE;AAAA,IAEA,KAAK,UAAA,EAAY;AACf,MAAA,MAAM,KAAA,GAAQ,YAAY,MAAM,CAAA;AAChC,MAAA,OAAO,UAAU,MAAA,GAAY,aAAA,GAAgB,CAAA,SAAA,EAAY,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACzE;AAAA,IAEA,KAAK,SAAA,EAAW;AACd,MAAA,MAAM,KAAA,GAAQ,YAAY,MAAM,CAAA;AAChC,MAAA,OAAO,CAAA,QAAA,EAAW,eAAA,CAAgB,eAAA,EAAiB,MAAM,CAAC,CAAA,EAAA,EAAK,KAAA,KAAU,MAAA,GAAY,GAAA,GAAM,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IAC3G;AAAA,IAEA,KAAK,UAAA,EAAY;AACf,MAAA,MAAM,KAAA,GAAQ,YAAY,MAAM,CAAA;AAChC,MAAA,OAAO,UAAU,MAAA,GAAY,aAAA,GAAgB,CAAA,SAAA,EAAY,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACzE;AAAA,IAEA,KAAK,MAAA,EAAQ;AACX,MAAA,MAAM,KAAA,GAAQ,WAAW,MAAM,CAAA;AAC/B,MAAA,OAAO,UAAU,MAAA,GAAY,SAAA,GAAY,CAAA,KAAA,EAAQ,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACjE;AAAA,IAEA,KAAK,OAAA,EAAS;AACZ,MAAA,MAAM,KAAA,GAAQ,YAAY,MAAM,CAAA;AAChC,MAAA,OAAO,CAAA,MAAA,EAAS,eAAA,CAAgB,eAAA,EAAiB,MAAM,CAAC,CAAA,EAAA,EAAK,KAAA,KAAU,MAAA,GAAY,GAAA,GAAM,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACzG;AAAA,IAEA,KAAK,MAAA,EAAQ;AAKX,MAAA,MAAM,KAAA,GAAQ,WAAW,MAAM,CAAA;AAC/B,MAAA,OAAO,UAAU,MAAA,GAAY,SAAA,GAAY,CAAA,KAAA,EAAQ,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACjE;AAAA,IAEA,KAAK,cAAA,EAAgB;AACnB,MAAA,MAAM,IAAA,GAAO,oBAAoB,MAAM,CAAA;AACvC,MAAA,MAAM,KAAA,GAAQ,qBAAqB,MAAM,CAAA;AACzC,MAAA,MAAM,MAAA,GAAS,IAAA,KAAS,MAAA,GAAY,GAAA,GAAM,QAAQ,IAAiB,CAAA;AACnE,MAAA,MAAM,OAAA,GAAU,KAAA,KAAU,MAAA,GAAY,GAAA,GAAM,QAAQ,KAAkB,CAAA;AAEtE,MAAA,MAAM,KAAA,GAAQ,CAAC,MAAA,EAAQ,OAAO,EAAE,IAAA,EAAK;AACrC,MAAA,OAAO,CAAA,aAAA,EAAgB,KAAA,CAAM,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,IACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,KAAK,SAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,kBAAA;AAAA,IACL,KAAK,WAAA;AAAA,IACL,KAAK,MAAA;AAAA,IACL,KAAK,KAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,UAAA;AACH,MAAA,OAAO,GAAG,IAAI,CAAA,EAAA,CAAA;AAAA,IAEhB,SAAS;AAIP,MAAA,MAAM,CAAA,GAAW,IAAA;AACjB,MAAA,OAAO,CAAA,QAAA,EAAW,MAAA,CAAO,CAAC,CAAC,CAAA,CAAA;AAAA,IAC7B;AAAA;AAEJ;AAcA,SAAS,eAAA,CAAgB,KAAgC,MAAA,EAA2B;AAClF,EAAA,MAAM,KAAA,GAAQ,IAAI,MAAM,CAAA;AACxB,EAAA,MAAM,MAAA,GAAS,IAAI,MAAM,CAAA;AACzB,EAAA,IAAI,CAAC,OAAO,EAAA,CAAG,KAAA,EAAO,MAAM,CAAA,IAAK,OAAO,KAAA,KAAU,UAAA,EAAY,OAAO,MAAA;AACrE,EAAA,OAAO,mBAAmB,KAAK,CAAA;AACjC;AAQA,SAAS,aAAa,MAAA,EAA2B;AAC/C,EAAA,MAAM,MAAA,GAAS,UAAU,MAAM,CAAA;AAC/B,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,EAAA;AAChC,EAAA,MAAM,KAAA,GAAQ,OAAO,GAAA,CAAI,CAAC,MAAM,cAAA,CAAe,CAAC,CAAC,CAAA,CAAE,IAAA,EAAK;AACxD,EAAA,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAC5B;AAYA,SAAS,eAAe,KAAA,EAAwB;AAC9C,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,EAAU;AAC/C,IAAA,MAAM,GAAA,GAAO,MAAuC,IAAA,EAAM,GAAA;AAC1D,IAAA,IAAI,GAAA,KAAQ,MAAA,EAAW,OAAO,kBAAA,CAAmB,GAAG,CAAA;AAAA,EACtD;AACA,EAAA,OAAO,mBAAmB,KAAK,CAAA;AACjC;AAGA,SAAS,OAAA,CAAQ,GAAoB,CAAA,EAA4B;AAC/D,EAAA,MAAM,EAAA,GAAK,OAAO,CAAC,CAAA;AACnB,EAAA,MAAM,EAAA,GAAK,OAAO,CAAC,CAAA;AACnB,EAAA,OAAO,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,KAAK,CAAA,GAAI,CAAA;AACtC;;;;"}

package/dist/chunks/indexeddb.cjs

@@ -1,6 +1,6 @@
 'use strict';
 
-const paths = require('../shared/attaform.z5j3LwJz.cjs');
+const paths = require('../shared/attaform.BA3vRDos.cjs');
 
 const DB_NAME = "attaform";
 const STORE_NAME = "kv";

package/dist/chunks/indexeddb.mjs

@@ -1,4 +1,4 @@
-import { _ as __DEV__ } from '../shared/attaform.QG5TG8lB.mjs';
+import { _ as __DEV__ } from '../shared/attaform.Y_Mgg0Yp.mjs';
 
 const DB_NAME = "attaform";
 const STORE_NAME = "kv";

package/dist/chunks/local-storage.cjs

@@ -1,6 +1,6 @@
 'use strict';
 
-const paths = require('../shared/attaform.z5j3LwJz.cjs');
+const paths = require('../shared/attaform.BA3vRDos.cjs');
 
 function createLocalStorageAdapter() {
   const available = typeof localStorage !== "undefined";

package/dist/chunks/local-storage.mjs

@@ -1,4 +1,4 @@
-import { _ as __DEV__ } from '../shared/attaform.QG5TG8lB.mjs';
+import { _ as __DEV__ } from '../shared/attaform.Y_Mgg0Yp.mjs';
 
 function createLocalStorageAdapter() {
   const available = typeof localStorage !== "undefined";