@reforma/components 0.1.6 → 0.2.1

package/dist/node_modules/zod/v4/core/json-schema-processors.js

@@ -0,0 +1,308 @@
+import { base64 as K, base64url as q, number as B, integer as L } from "./regexes.js";
+import { base64Charset as $, base64urlCharset as D } from "./schemas.js";
+import { handleUnrepresentable as O, process as l } from "./to-json-schema.js";
+import { assignProp as E, getEnumValues as G, BIGINT_FORMAT_RANGES as U, NUMBER_FORMAT_RANGES as Z } from "./util.js";
+const h = (t, e, o) => {
+  (t[e] === void 0 || o > t[e]) && (t[e] = o);
+}, b = (t, e, o) => {
+  (t[e] === void 0 || o < t[e]) && (t[e] = o);
+}, S = (t, e) => {
+  h(t, "minimum", e), b(t, "maximum", e);
+}, k = (t, e) => {
+  t.multipleOf ?? (t.multipleOf = []), t.multipleOf.includes(e) || t.multipleOf.push(e);
+}, A = (t, e) => {
+  t.patterns ?? (t.patterns = /* @__PURE__ */ new Set()), t.patterns.add(e);
+}, V = (t, e) => {
+  t.mime = t.mime ? t.mime.filter((o) => e.includes(o)) : [...e];
+}, F = (t, e) => {
+  t.format = e, e.includes("int") && (t.isInt = !0);
+}, x = (t, e) => h(t, "minimum", e.minimum), I = (t, e) => b(t, "maximum", e.maximum), w = (t) => (e, o) => {
+  F(e, o.format);
+  const [i, n] = t[o.format];
+  h(e, "minimum", i), b(e, "maximum", n);
+}, Y = {
+  greater_than: (t, e) => h(t, e.inclusive ? "minimum" : "exclusiveMinimum", e.value),
+  less_than: (t, e) => b(t, e.inclusive ? "maximum" : "exclusiveMaximum", e.value),
+  multiple_of: (t, e) => k(t, e.value),
+  number_format: w(Z),
+  bigint_format: w(U),
+  min_length: x,
+  max_length: I,
+  length_equals: (t, e) => S(t, e.length),
+  min_size: x,
+  max_size: I,
+  size_equals: (t, e) => S(t, e.size),
+  string_format: (t, e) => {
+    F(t, e.format), e.pattern && A(t, e.pattern), (e.format === "base64" || e.format === "base64url") && (t.contentEncoding = e.format), (e.local || e.precision === -1) && (t.laxFormat = !0);
+  },
+  mime_type: (t, e) => V(t, e.mime)
+};
+function z(t) {
+  const e = {}, o = t._zod.def, i = t._zod.traits.has("$ZodCheck") ? [t, ...o.checks ?? []] : o.checks ?? [];
+  for (const r of i)
+    Y[r._zod.def.check]?.(e, r._zod.def);
+  const n = t._zod.bag;
+  n.minimum !== void 0 && h(e, "minimum", n.minimum), n.exclusiveMinimum !== void 0 && h(e, "exclusiveMinimum", n.exclusiveMinimum), n.maximum !== void 0 && b(e, "maximum", n.maximum), n.exclusiveMaximum !== void 0 && b(e, "exclusiveMaximum", n.exclusiveMaximum), n.multipleOf !== void 0 && k(e, n.multipleOf), n.format !== void 0 && (e.format ?? (e.format = n.format), n.format.includes("int") && (e.isInt = !0)), n.mime && V(e, n.mime);
+  for (const r of n.patterns ?? [])
+    A(e, r);
+  return e;
+}
+const W = {
+  guid: "uuid",
+  url: "uri",
+  datetime: "date-time",
+  json_string: "json-string",
+  regex: ""
+  // do not set
+}, H = /* @__PURE__ */ new Map([
+  [$, K],
+  [D, q]
+]), C = (t) => H.get(t) ?? t, ne = (t, e, o, i) => {
+  const n = o;
+  n.type = "string";
+  const { minimum: r, maximum: s, format: f, patterns: a, contentEncoding: m, laxFormat: c } = z(t);
+  if (typeof r == "number" && (n.minLength = r), typeof s == "number" && (n.maxLength = s), f && (n.format = W[f] ?? f, n.format === "" && delete n.format, (f === "time" || c) && delete n.format), m && (n.contentEncoding = m), a && a.size > 0) {
+    const d = [...a].map(C);
+    d.length === 1 ? n.pattern = d[0].source : d.length > 1 && (n.allOf = [
+      ...d.map((P) => ({
+        ...e.target === "draft-07" || e.target === "draft-04" || e.target === "openapi-3.0" ? { type: "string" } : {},
+        pattern: P.source
+      }))
+    ]);
+  }
+}, ie = (t, e, o, i) => {
+  const n = o, { minimum: r, maximum: s, multipleOf: f, exclusiveMaximum: a, exclusiveMinimum: m, isInt: c } = z(t);
+  n.type = c ? "integer" : "number";
+  const d = typeof m == "number" && m >= (r ?? Number.NEGATIVE_INFINITY), P = typeof a == "number" && a <= (s ?? Number.POSITIVE_INFINITY), p = e.target === "draft-04" || e.target === "openapi-3.0";
+  if (d ? p ? (n.minimum = m, n.exclusiveMinimum = !0) : n.exclusiveMinimum = m : typeof r == "number" && (n.minimum = r), P ? p ? (n.maximum = a, n.exclusiveMaximum = !0) : n.exclusiveMaximum = a : typeof s == "number" && (n.maximum = s), f) {
+    const u = /* @__PURE__ */ new Set();
+    for (const y of f)
+      Number.isFinite(y) && y !== 0 ? u.add(Math.abs(y)) : O(t, e, n, i, `A multipleOf divisor of ${y} cannot be represented in JSON Schema`);
+    const [_, ...g] = u;
+    _ !== void 0 && (n.multipleOf = _), g.length && (n.allOf = [...n.allOf ?? [], ...g.map((y) => ({ multipleOf: y }))]);
+  }
+}, oe = (t, e, o, i) => {
+  o.type = "boolean";
+}, re = (t, e, o, i) => {
+  o.not = {};
+}, se = (t, e, o, i) => {
+}, fe = (t, e, o, i) => {
+}, ae = (t, e, o, i) => {
+  const n = t._zod.def, r = G(n.entries);
+  if (r.length === 0) {
+    o.not = {};
+    return;
+  }
+  r.every((s) => typeof s == "number") && (o.type = "number"), r.every((s) => typeof s == "string") && (o.type = "string"), o.enum = r;
+}, me = (t, e, o, i) => {
+  O(t, e, o, i, "Custom types cannot be represented in JSON Schema");
+}, ue = (t, e, o, i) => {
+  O(t, e, o, i, "Transforms cannot be represented in JSON Schema");
+}, ce = (t, e, o, i) => {
+  const n = o, r = t._zod.def, { minimum: s, maximum: f } = z(t);
+  typeof s == "number" && (n.minItems = s), typeof f == "number" && (n.maxItems = f), n.type = "array", n.items = l(r.element, e, {
+    ...i,
+    path: [...i.path, "items"]
+  });
+};
+function T(t) {
+  const e = t._zod.def;
+  return e.type === "pipe" && e.in._zod.traits.has("$ZodTransform") ? T(e.out) : e.type === "catch" ? T(e.innerType) : t._zod.optin;
+}
+const le = (t, e, o, i) => {
+  const n = o, r = t._zod.def, s = r.shape;
+  if (Object.getOwnPropertySymbols(s).length && O(t, e, n, i, "Symbol keys cannot be represented in JSON Schema"))
+    return;
+  n.type = "object", n.properties = {};
+  for (const m in s)
+    E(n.properties, m, l(s[m], e, {
+      ...i,
+      path: [...i.path, "properties", m]
+    }));
+  const a = [];
+  for (const m of Object.keys(s)) {
+    const c = r.shape[m];
+    (e.io === "input" ? T(c) === void 0 : c._zod.optout === void 0) && a.push(m);
+  }
+  a.length > 0 && (n.required = a), r.catchall?._zod.def.type === "never" ? n.additionalProperties = !1 : r.catchall ? r.catchall && (n.additionalProperties = l(r.catchall, e, {
+    ...i,
+    path: [...i.path, "additionalProperties"]
+  })) : e.io === "output" && (n.additionalProperties = !1);
+}, pe = (t, e, o, i) => {
+  const n = t._zod.def, r = n.inclusive === !1, s = n.options.map((f, a) => l(f, e, {
+    ...i,
+    path: [...i.path, r ? "oneOf" : "anyOf", a]
+  }));
+  r ? o.oneOf = s : o.anyOf = s;
+}, de = (t, e, o, i) => {
+  const n = t._zod.def, r = l(n.left, e, {
+    ...i,
+    path: [...i.path, "allOf", 0]
+  }), s = l(n.right, e, {
+    ...i,
+    path: [...i.path, "allOf", 1]
+  }), f = (m) => "allOf" in m && Object.keys(m).length === 1, a = [
+    ...f(r) ? r.allOf : [r],
+    ...f(s) ? s.allOf : [s]
+  ];
+  o.allOf = a, e.intersections.push(a);
+};
+function v(t, e, o) {
+  if (e.$ref) {
+    if (o.has(e))
+      return e;
+    o.add(e);
+    const u = t.get(e)?.def;
+    if (!u)
+      return e;
+    const _ = v(t, u, o);
+    return _ === u ? e : _;
+  }
+  for (const u of ["anyOf", "oneOf"]) {
+    const _ = e[u];
+    if (!Array.isArray(_))
+      continue;
+    const g = _.map((y) => v(t, y, o));
+    g.some((y, R) => y !== _[R]) && (e = { ...e, [u]: g });
+  }
+  const i = Array.isArray(e.type) ? e.type : [e.type], n = !i.includes("string") && i.some((u) => u === "number" || u === "integer"), r = e.enum ?? (e.const !== void 0 ? [e.const] : void 0);
+  if (!n && !r?.some((u) => typeof u == "number"))
+    return e;
+  const { minimum: s, maximum: f, exclusiveMinimum: a, exclusiveMaximum: m, multipleOf: c, format: d, id: P, ...p } = e;
+  return p.enum ? p.enum = p.enum.map((u) => typeof u == "number" ? String(u) : u) : typeof p.const == "number" && (p.const = String(p.const)), n && (p.type = "string", r || (p.pattern = (i.includes("number") ? B : L).source)), p;
+}
+const M = /* @__PURE__ */ new WeakMap();
+function Q(t) {
+  const e = /* @__PURE__ */ new Map();
+  for (const i of t.seen.values())
+    i.def && !e.has(i.schema) && e.set(i.schema, i);
+  const o = /* @__PURE__ */ new Map();
+  for (const i of M.get(t) ?? []) {
+    const n = t.seen.get(i), r = (n?.def ?? n?.schema)?.propertyNames;
+    if (!r || r === !0 || o.has(r))
+      continue;
+    const s = v(e, r, /* @__PURE__ */ new Set());
+    s !== r && o.set(r, s);
+  }
+  if (o.size)
+    for (const i of t.seen.values())
+      for (const n of [i.schema, i.def]) {
+        const r = n && o.get(n.propertyNames);
+        r && (n.propertyNames = r);
+      }
+}
+const ye = (t, e, o, i) => {
+  const n = o, r = t._zod.def;
+  n.type = "object";
+  const s = r.keyType, f = z(s).patterns;
+  if (r.mode === "loose" && f && f.size > 0) {
+    const c = l(r.valueType, e, {
+      ...i,
+      path: [...i.path, "patternProperties", "*"]
+    });
+    n.patternProperties = {};
+    for (const d of f)
+      E(n.patternProperties, C(d).source, c);
+  } else {
+    if (e.target === "draft-07" || e.target === "draft-2020-12") {
+      n.propertyNames = l(r.keyType, e, {
+        ...i,
+        path: [...i.path, "propertyNames"]
+      });
+      let c = M.get(e);
+      c || (c = [], M.set(e, c), e.deferred.push(() => Q(e))), c.push(t);
+    }
+    n.additionalProperties = l(r.valueType, e, {
+      ...i,
+      path: [...i.path, "additionalProperties"]
+    });
+  }
+  const a = s._zod.values, m = e.io === "input" && T(r.valueType) !== void 0;
+  if (a && !r.partial && !m) {
+    const c = [...a].filter((d) => typeof d == "string" || typeof d == "number");
+    c.length > 0 && (n.required = c.map(String));
+  }
+}, _e = (t, e, o, i) => {
+  const n = t._zod.def, r = l(n.innerType, e, i), s = e.seen.get(t);
+  e.target === "openapi-3.0" ? (s.ref = n.innerType, o.nullable = !0) : o.anyOf = [r, { type: "null" }];
+}, he = (t, e, o, i) => {
+  const n = t._zod.def;
+  l(n.innerType, e, i);
+  const r = e.seen.get(t);
+  r.ref = n.innerType;
+}, N = /* @__PURE__ */ Symbol();
+function J(t, e, o, i, n) {
+  let r = !1;
+  const s = JSON.stringify(t, (f, a) => typeof a != "bigint" ? a : (r = !0, null));
+  return r ? (O(e, o, i, n, "BigInt defaults cannot be represented in JSON Schema"), N) : JSON.parse(s);
+}
+const be = (t, e, o, i) => {
+  const n = t._zod.def;
+  l(n.innerType, e, i);
+  const r = e.seen.get(t);
+  r.ref = n.innerType;
+  const s = J(n.defaultValue, t, e, o, i);
+  s !== N && (o.default = s);
+}, Oe = (t, e, o, i) => {
+  const n = t._zod.def;
+  l(n.innerType, e, i);
+  const r = e.seen.get(t);
+  if (r.ref = n.innerType, e.io !== "input")
+    return;
+  const s = J(n.defaultValue, t, e, o, i);
+  s !== N && (o._prefault = s);
+}, ge = (t, e, o, i) => {
+  const n = t._zod.def;
+  l(n.innerType, e, i);
+  const r = e.seen.get(t);
+  r.ref = n.innerType;
+  let s;
+  try {
+    s = n.catchValue(void 0);
+  } catch {
+    O(t, e, o, i, "Dynamic catch values are not supported in JSON Schema");
+    return;
+  }
+  o.default = s;
+}, Pe = (t, e, o, i) => {
+  const n = t._zod.def, r = n.in._zod.traits.has("$ZodTransform"), s = e.io === "input" ? r ? n.out : n.in : n.out;
+  l(s, e, i);
+  const f = e.seen.get(t);
+  f.ref = s;
+}, Te = (t, e, o, i) => {
+  const n = t._zod.def;
+  l(n.innerType, e, i);
+  const r = e.seen.get(t);
+  r.ref = n.innerType, o.readOnly = !0;
+}, ze = (t, e, o, i) => {
+  const n = t._zod.def;
+  l(n.innerType, e, i);
+  const r = e.seen.get(t);
+  r.ref = n.innerType;
+};
+export {
+  z as aggregateChecks,
+  se as anyProcessor,
+  ce as arrayProcessor,
+  oe as booleanProcessor,
+  ge as catchProcessor,
+  me as customProcessor,
+  be as defaultProcessor,
+  ae as enumProcessor,
+  de as intersectionProcessor,
+  re as neverProcessor,
+  he as nonoptionalProcessor,
+  _e as nullableProcessor,
+  ie as numberProcessor,
+  le as objectProcessor,
+  ze as optionalProcessor,
+  Pe as pipeProcessor,
+  Oe as prefaultProcessor,
+  Te as readonlyProcessor,
+  ye as recordProcessor,
+  ne as stringProcessor,
+  ue as transformProcessor,
+  pe as unionProcessor,
+  fe as unknownProcessor
+};
+//# sourceMappingURL=json-schema-processors.js.map

package/dist/node_modules/zod/v4/core/json-schema-processors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"json-schema-processors.js","sources":["../../../../../../../node_modules/zod/v4/core/json-schema-processors.js"],"sourcesContent":["import * as regexes from \"./regexes.js\";\nimport { base64Charset, base64urlCharset } from \"./schemas.js\";\nimport { extractDefs, finalize, handleUnrepresentable, initializeContext, processSchema, } from \"./to-json-schema.js\";\nimport { BIGINT_FORMAT_RANGES, NUMBER_FORMAT_RANGES, assignProp, getEnumValues } from \"./util.js\";\nconst narrowMin = (agg, key, value) => {\n    if (agg[key] === undefined || value > agg[key])\n        agg[key] = value;\n};\nconst narrowMax = (agg, key, value) => {\n    if (agg[key] === undefined || value < agg[key])\n        agg[key] = value;\n};\nconst narrowBoth = (agg, value) => {\n    narrowMin(agg, \"minimum\", value);\n    narrowMax(agg, \"maximum\", value);\n};\nconst addDivisor = (agg, value) => {\n    agg.multipleOf ?? (agg.multipleOf = []);\n    if (!agg.multipleOf.includes(value))\n        agg.multipleOf.push(value);\n};\nconst addPattern = (agg, pattern) => {\n    agg.patterns ?? (agg.patterns = new Set());\n    agg.patterns.add(pattern);\n};\nconst intersectMime = (agg, mime) => {\n    agg.mime = agg.mime ? agg.mime.filter((m) => mime.includes(m)) : [...mime];\n};\n// last-wins, matching the bag's historical write order; the flag keeps an integer format from being lost to a later float one\nconst setFormat = (agg, format) => {\n    agg.format = format;\n    if (format.includes(\"int\"))\n        agg.isInt = true;\n};\nconst minContributor = (agg, def) => narrowMin(agg, \"minimum\", def.minimum);\nconst maxContributor = (agg, def) => narrowMax(agg, \"maximum\", def.maximum);\nconst formatContributor = (ranges) => (agg, def) => {\n    setFormat(agg, def.format);\n    const [minimum, maximum] = ranges[def.format];\n    narrowMin(agg, \"minimum\", minimum);\n    narrowMax(agg, \"maximum\", maximum);\n};\nconst contributors = {\n    greater_than: (agg, def) => narrowMin(agg, def.inclusive ? \"minimum\" : \"exclusiveMinimum\", def.value),\n    less_than: (agg, def) => narrowMax(agg, def.inclusive ? \"maximum\" : \"exclusiveMaximum\", def.value),\n    multiple_of: (agg, def) => addDivisor(agg, def.value),\n    number_format: formatContributor(NUMBER_FORMAT_RANGES),\n    bigint_format: formatContributor(BIGINT_FORMAT_RANGES),\n    min_length: minContributor,\n    max_length: maxContributor,\n    length_equals: (agg, def) => narrowBoth(agg, def.length),\n    min_size: minContributor,\n    max_size: maxContributor,\n    size_equals: (agg, def) => narrowBoth(agg, def.size),\n    string_format: (agg, def) => {\n        setFormat(agg, def.format);\n        if (def.pattern)\n            addPattern(agg, def.pattern);\n        if (def.format === \"base64\" || def.format === \"base64url\")\n            agg.contentEncoding = def.format;\n        if (def.local || def.precision === -1)\n            agg.laxFormat = true;\n    },\n    mime_type: (agg, def) => intersectMime(agg, def.mime),\n};\nexport function aggregateChecks(schema) {\n    const agg = {};\n    const def = schema._zod.def;\n    // a format schema is its own first check, same rule as $ZodType init\n    const list = schema._zod.traits.has(\"$ZodCheck\")\n        ? [schema, ...(def.checks ?? [])]\n        : (def.checks ?? []);\n    for (const ch of list)\n        contributors[ch._zod.def.check]?.(agg, ch._zod.def);\n    // reconcile with the bag so third-party onattach contributions still land; first-party residue is never tighter than the fold, so merging it back is idempotent for one and additive for the other\n    const bag = schema._zod.bag;\n    if (bag.minimum !== undefined)\n        narrowMin(agg, \"minimum\", bag.minimum);\n    if (bag.exclusiveMinimum !== undefined)\n        narrowMin(agg, \"exclusiveMinimum\", bag.exclusiveMinimum);\n    if (bag.maximum !== undefined)\n        narrowMax(agg, \"maximum\", bag.maximum);\n    if (bag.exclusiveMaximum !== undefined)\n        narrowMax(agg, \"exclusiveMaximum\", bag.exclusiveMaximum);\n    if (bag.multipleOf !== undefined)\n        addDivisor(agg, bag.multipleOf);\n    if (bag.format !== undefined) {\n        agg.format ?? (agg.format = bag.format);\n        if (bag.format.includes(\"int\"))\n            agg.isInt = true;\n    }\n    if (bag.mime)\n        intersectMime(agg, bag.mime);\n    for (const pattern of bag.patterns ?? [])\n        addPattern(agg, pattern);\n    return agg;\n}\nconst formatMap = {\n    guid: \"uuid\",\n    url: \"uri\",\n    datetime: \"date-time\",\n    json_string: \"json-string\",\n    regex: \"\", // do not set\n};\n// ==================== SIMPLE TYPE PROCESSORS ====================\n// the runtime patterns are lax so parse paths never overflow the regex stack; the emitted schema swaps in the exact block forms, which zod itself never executes\nconst exactPatterns = new Map([\n    [base64Charset, regexes.base64],\n    [base64urlCharset, regexes.base64url],\n]);\nconst exactPattern = (p) => exactPatterns.get(p) ?? p;\nexport const stringProcessor = (schema, ctx, _json, _params) => {\n    const json = _json;\n    json.type = \"string\";\n    const { minimum, maximum, format, patterns, contentEncoding, laxFormat } = aggregateChecks(schema);\n    if (typeof minimum === \"number\")\n        json.minLength = minimum;\n    if (typeof maximum === \"number\")\n        json.maxLength = maximum;\n    // custom pattern overrides format\n    if (format) {\n        json.format = formatMap[format] ?? format;\n        if (json.format === \"\")\n            delete json.format; // empty format is not valid\n        // `z.iso.time()` is never full-time, and `laxFormat` carries the datetime shapes that also accept what their keyword forbids\n        if (format === \"time\" || laxFormat) {\n            delete json.format;\n        }\n    }\n    if (contentEncoding)\n        json.contentEncoding = contentEncoding;\n    if (patterns && patterns.size > 0) {\n        const patternList = [...patterns].map(exactPattern);\n        if (patternList.length === 1)\n            json.pattern = patternList[0].source;\n        else if (patternList.length > 1) {\n            json.allOf = [\n                ...patternList.map((regex) => ({\n                    ...(ctx.target === \"draft-07\" || ctx.target === \"draft-04\" || ctx.target === \"openapi-3.0\"\n                        ? { type: \"string\" }\n                        : {}),\n                    pattern: regex.source,\n                })),\n            ];\n        }\n    }\n};\nexport const numberProcessor = (schema, ctx, _json, params) => {\n    const json = _json;\n    const { minimum, maximum, multipleOf, exclusiveMaximum, exclusiveMinimum, isInt } = aggregateChecks(schema);\n    json.type = isInt ? \"integer\" : \"number\";\n    // when both minimum and exclusiveMinimum exist, pick the more restrictive one\n    const exMin = typeof exclusiveMinimum === \"number\" && exclusiveMinimum >= (minimum ?? Number.NEGATIVE_INFINITY);\n    const exMax = typeof exclusiveMaximum === \"number\" && exclusiveMaximum <= (maximum ?? Number.POSITIVE_INFINITY);\n    const legacy = ctx.target === \"draft-04\" || ctx.target === \"openapi-3.0\";\n    if (exMin) {\n        if (legacy) {\n            json.minimum = exclusiveMinimum;\n            json.exclusiveMinimum = true;\n        }\n        else {\n            json.exclusiveMinimum = exclusiveMinimum;\n        }\n    }\n    else if (typeof minimum === \"number\") {\n        json.minimum = minimum;\n    }\n    if (exMax) {\n        if (legacy) {\n            json.maximum = exclusiveMaximum;\n            json.exclusiveMaximum = true;\n        }\n        else {\n            json.exclusiveMaximum = exclusiveMaximum;\n        }\n    }\n    else if (typeof maximum === \"number\") {\n        json.maximum = maximum;\n    }\n    if (multipleOf) {\n        // JSON Schema requires a divisor strictly greater than zero, and a non-finite one does not survive JSON at all. A negative divisor accepts exactly what its absolute value accepts, so it still maps; zero, NaN and Infinity have no keyword form.\n        const divisors = new Set();\n        for (const divisor of multipleOf) {\n            if (Number.isFinite(divisor) && divisor !== 0)\n                divisors.add(Math.abs(divisor));\n            else\n                handleUnrepresentable(schema, ctx, json, params, `A multipleOf divisor of ${divisor} cannot be represented in JSON Schema`);\n        }\n        // chained divisors are a conjunction the keyword cannot carry alone, so extras ride an allOf, same as stacked patterns\n        const [first, ...rest] = divisors;\n        if (first !== undefined)\n            json.multipleOf = first;\n        if (rest.length)\n            json.allOf = [...(json.allOf ?? []), ...rest.map((m) => ({ multipleOf: m }))];\n    }\n};\nexport const booleanProcessor = (_schema, _ctx, json, _params) => {\n    json.type = \"boolean\";\n};\nexport const bigintProcessor = (schema, ctx, json, params) => {\n    handleUnrepresentable(schema, ctx, json, params, \"BigInt cannot be represented in JSON Schema\");\n};\nexport const symbolProcessor = (schema, ctx, json, params) => {\n    handleUnrepresentable(schema, ctx, json, params, \"Symbols cannot be represented in JSON Schema\");\n};\nexport const nullProcessor = (_schema, ctx, json, _params) => {\n    if (ctx.target === \"openapi-3.0\") {\n        json.type = \"string\";\n        json.nullable = true;\n        json.enum = [null];\n    }\n    else {\n        json.type = \"null\";\n    }\n};\nexport const undefinedProcessor = (schema, ctx, json, params) => {\n    handleUnrepresentable(schema, ctx, json, params, \"Undefined cannot be represented in JSON Schema\");\n};\nexport const voidProcessor = (schema, ctx, json, params) => {\n    handleUnrepresentable(schema, ctx, json, params, \"Void cannot be represented in JSON Schema\");\n};\nexport const neverProcessor = (_schema, _ctx, json, _params) => {\n    json.not = {};\n};\nexport const anyProcessor = (_schema, _ctx, _json, _params) => {\n    // empty schema accepts anything\n};\nexport const unknownProcessor = (_schema, _ctx, _json, _params) => {\n    // empty schema accepts anything\n};\nexport const dateProcessor = (schema, ctx, json, params) => {\n    handleUnrepresentable(schema, ctx, json, params, \"Date cannot be represented in JSON Schema\");\n};\nexport const enumProcessor = (schema, _ctx, json, _params) => {\n    const def = schema._zod.def;\n    const values = getEnumValues(def.entries);\n    // an empty enum accepts nothing, same as z.never()\n    if (values.length === 0) {\n        json.not = {};\n        return;\n    }\n    // Number enums can have both string and number values\n    if (values.every((v) => typeof v === \"number\"))\n        json.type = \"number\";\n    if (values.every((v) => typeof v === \"string\"))\n        json.type = \"string\";\n    json.enum = values;\n};\nexport const literalProcessor = (schema, ctx, json, params) => {\n    const def = schema._zod.def;\n    // a literal with no values accepts nothing, same as z.never()\n    if (def.values.length === 0) {\n        json.not = {};\n        return;\n    }\n    const vals = [];\n    for (const val of def.values) {\n        if (val === undefined) {\n            // a custom schema replaces the whole literal, so there is nothing left to accumulate\n            if (handleUnrepresentable(schema, ctx, json, params, \"Literal `undefined` cannot be represented in JSON Schema\"))\n                return;\n            // otherwise do not add to vals\n        }\n        else if (typeof val === \"bigint\") {\n            if (handleUnrepresentable(schema, ctx, json, params, \"BigInt literals cannot be represented in JSON Schema\"))\n                return;\n            vals.push(Number(val));\n        }\n        else {\n            vals.push(val);\n        }\n    }\n    if (vals.length === 0) {\n        // do nothing (an undefined literal was stripped)\n    }\n    else if (vals.length === 1) {\n        const val = vals[0];\n        json.type = val === null ? \"null\" : typeof val;\n        if (ctx.target === \"draft-04\" || ctx.target === \"openapi-3.0\") {\n            json.enum = [val];\n        }\n        else {\n            json.const = val;\n        }\n    }\n    else {\n        if (vals.every((v) => typeof v === \"number\"))\n            json.type = \"number\";\n        if (vals.every((v) => typeof v === \"string\"))\n            json.type = \"string\";\n        if (vals.every((v) => typeof v === \"boolean\"))\n            json.type = \"boolean\";\n        if (vals.every((v) => v === null))\n            json.type = \"null\";\n        json.enum = vals;\n    }\n};\nexport const nanProcessor = (schema, ctx, json, params) => {\n    handleUnrepresentable(schema, ctx, json, params, \"NaN cannot be represented in JSON Schema\");\n};\nexport const templateLiteralProcessor = (schema, _ctx, json, _params) => {\n    const _json = json;\n    const pattern = schema._zod.pattern;\n    if (!pattern)\n        throw new Error(\"Pattern not found in template literal\");\n    _json.type = \"string\";\n    _json.pattern = pattern.source;\n};\nexport const fileProcessor = (schema, _ctx, json, _params) => {\n    const _json = json;\n    _json.type = \"string\";\n    _json.format = \"binary\";\n    _json.contentEncoding = \"binary\";\n    const { minimum, maximum, mime } = aggregateChecks(schema);\n    if (minimum !== undefined)\n        _json.minLength = minimum;\n    if (maximum !== undefined)\n        _json.maxLength = maximum;\n    if (!mime)\n        return;\n    // an empty intersection means the mime checks share no value, so nothing passes at runtime; `anyOf` must be non-empty, so the false schema is `not: {}`\n    if (mime.length === 0)\n        _json.not = {};\n    else if (mime.length === 1)\n        _json.contentMediaType = mime[0];\n    // only contentMediaType differs, so the shared props stay at the root\n    else\n        _json.anyOf = mime.map((m) => ({ contentMediaType: m }));\n};\nexport const successProcessor = (_schema, _ctx, json, _params) => {\n    json.type = \"boolean\";\n};\nexport const customProcessor = (schema, ctx, json, params) => {\n    handleUnrepresentable(schema, ctx, json, params, \"Custom types cannot be represented in JSON Schema\");\n};\nexport const functionProcessor = (schema, ctx, json, params) => {\n    handleUnrepresentable(schema, ctx, json, params, \"Function types cannot be represented in JSON Schema\");\n};\nexport const transformProcessor = (schema, ctx, json, params) => {\n    handleUnrepresentable(schema, ctx, json, params, \"Transforms cannot be represented in JSON Schema\");\n};\nexport const mapProcessor = (schema, ctx, json, params) => {\n    handleUnrepresentable(schema, ctx, json, params, \"Map cannot be represented in JSON Schema\");\n};\nexport const setProcessor = (schema, ctx, json, params) => {\n    handleUnrepresentable(schema, ctx, json, params, \"Set cannot be represented in JSON Schema\");\n};\n// ==================== COMPOSITE TYPE PROCESSORS ====================\nexport const arrayProcessor = (schema, ctx, _json, params) => {\n    const json = _json;\n    const def = schema._zod.def;\n    const { minimum, maximum } = aggregateChecks(schema);\n    if (typeof minimum === \"number\")\n        json.minItems = minimum;\n    if (typeof maximum === \"number\")\n        json.maxItems = maximum;\n    json.type = \"array\";\n    json.items = processSchema(def.element, ctx, {\n        ...params,\n        path: [...params.path, \"items\"],\n    });\n};\n// Transform and catch set `optin = \"optional\"` at runtime so the parser lets them observe an\n// absent key, but their declared input type stays required. An input JSON Schema describes the\n// declared type, so resolve past them to the schema that actually carries the optionality.\n// Used by both `objectProcessor` (for `required`) and `tupleProcessor` (for `minItems`); see\n// wiki/optionality.md, \"The JSON Schema emitter reads the *static* value\".\nfunction inputOptin(schema) {\n    const def = schema._zod.def;\n    if (def.type === \"pipe\" && def.in._zod.traits.has(\"$ZodTransform\")) {\n        return inputOptin(def.out);\n    }\n    if (def.type === \"catch\") {\n        return inputOptin(def.innerType);\n    }\n    return schema._zod.optin;\n}\nexport const objectProcessor = (schema, ctx, _json, params) => {\n    const json = _json;\n    const def = schema._zod.def;\n    const shape = def.shape;\n    // dropping it while still emitting `additionalProperties: false` would emit a schema that rejects data this one requires\n    const symbolKeys = Object.getOwnPropertySymbols(shape);\n    if (symbolKeys.length &&\n        handleUnrepresentable(schema, ctx, json, params, \"Symbol keys cannot be represented in JSON Schema\")) {\n        return;\n    }\n    json.type = \"object\";\n    json.properties = {};\n    for (const key in shape) {\n        // assignProp so a __proto__ key becomes an own property instead of hitting the inherited setter on the plain {} we build into\n        assignProp(json.properties, key, processSchema(shape[key], ctx, {\n            ...params,\n            path: [...params.path, \"properties\", key],\n        }));\n    }\n    // required keys\n    const requiredKeys = [];\n    for (const key of Object.keys(shape)) {\n        const field = def.shape[key];\n        if (ctx.io === \"input\" ? inputOptin(field) === undefined : field._zod.optout === undefined) {\n            requiredKeys.push(key);\n        }\n    }\n    if (requiredKeys.length > 0) {\n        json.required = requiredKeys;\n    }\n    // catchall\n    if (def.catchall?._zod.def.type === \"never\") {\n        // strict\n        json.additionalProperties = false;\n    }\n    else if (!def.catchall) {\n        // regular\n        if (ctx.io === \"output\")\n            json.additionalProperties = false;\n    }\n    else if (def.catchall) {\n        json.additionalProperties = processSchema(def.catchall, ctx, {\n            ...params,\n            path: [...params.path, \"additionalProperties\"],\n        });\n    }\n};\nexport const unionProcessor = (schema, ctx, json, params) => {\n    const def = schema._zod.def;\n    // Exclusive unions (inclusive === false) use oneOf (exactly one match) instead of anyOf (one or more matches). This includes both z.xor() and discriminated unions\n    const isExclusive = def.inclusive === false;\n    const options = def.options.map((x, i) => processSchema(x, ctx, {\n        ...params,\n        path: [...params.path, isExclusive ? \"oneOf\" : \"anyOf\", i],\n    }));\n    if (isExclusive) {\n        json.oneOf = options;\n    }\n    else {\n        json.anyOf = options;\n    }\n};\nexport const intersectionProcessor = (schema, ctx, json, params) => {\n    const def = schema._zod.def;\n    const a = processSchema(def.left, ctx, {\n        ...params,\n        path: [...params.path, \"allOf\", 0],\n    });\n    const b = processSchema(def.right, ctx, {\n        ...params,\n        path: [...params.path, \"allOf\", 1],\n    });\n    const isSimpleIntersection = (val) => \"allOf\" in val && Object.keys(val).length === 1;\n    const allOf = [\n        ...(isSimpleIntersection(a) ? a.allOf : [a]),\n        ...(isSimpleIntersection(b) ? b.allOf : [b]),\n    ];\n    json.allOf = allOf;\n    // Recorded innermost first, so a nested intersection has already folded by the time this one is considered. The array is the handle rather than the schema, because a wrapper that inherits this schema shares the same array; `finalize` folds every object holding it. See `foldIntersection`.\n    ctx.intersections.push(allOf);\n};\nexport const tupleProcessor = (schema, ctx, _json, params) => {\n    const json = _json;\n    const def = schema._zod.def;\n    json.type = \"array\";\n    const prefixPath = ctx.target === \"draft-2020-12\" ? \"prefixItems\" : \"items\";\n    const restPath = ctx.target === \"draft-2020-12\" ? \"items\" : ctx.target === \"openapi-3.0\" ? \"items\" : \"additionalItems\";\n    const prefixItems = def.items.map((x, i) => processSchema(x, ctx, {\n        ...params,\n        path: [...params.path, prefixPath, i],\n    }));\n    const rest = def.rest\n        ? processSchema(def.rest, ctx, {\n            ...params,\n            path: [...params.path, restPath, ...(ctx.target === \"openapi-3.0\" ? [def.items.length] : [])],\n        })\n        : null;\n    let minItems = def.items.length;\n    while (minItems > 0) {\n        const item = def.items[minItems - 1];\n        const optional = ctx.io === \"input\" ? inputOptin(item) !== undefined : item._zod.optout === \"optional\";\n        if (!optional)\n            break;\n        minItems--;\n    }\n    const maxItems = def.items.length;\n    const isClosed = !def.rest;\n    if (ctx.target === \"draft-2020-12\") {\n        json.prefixItems = prefixItems;\n        if (isClosed) {\n            json.items = false;\n        }\n        else if (rest) {\n            json.items = rest;\n        }\n        if (minItems > 0)\n            json.minItems = minItems;\n        if (isClosed)\n            json.maxItems = maxItems;\n    }\n    else if (ctx.target === \"openapi-3.0\") {\n        json.items = {\n            anyOf: prefixItems,\n        };\n        if (rest) {\n            json.items.anyOf.push(rest);\n        }\n        if (minItems > 0)\n            json.minItems = minItems;\n        if (isClosed)\n            json.maxItems = maxItems;\n    }\n    else {\n        json.items = prefixItems;\n        if (isClosed) {\n            json.additionalItems = false;\n        }\n        else if (rest) {\n            json.additionalItems = rest;\n        }\n        if (minItems > 0)\n            json.minItems = minItems;\n        if (isClosed)\n            json.maxItems = maxItems;\n    }\n    // explicit user-defined length checks take precedence\n    const { minimum, maximum } = aggregateChecks(schema);\n    if (typeof minimum === \"number\")\n        json.minItems = minimum;\n    if (typeof maximum === \"number\")\n        json.maxItems = maximum;\n};\n/** JSON object keys are always strings, so a numeric record key schema is re-expressed over the\n * numeric-string form the record parser matches. Deferred to `finalize`, after the flatten: a key\n * behind a wrapper only carries its own `type` before then, and a union key only has its branches.\n *\n * A numeric bound cannot apply to a property name, so `minimum` and its siblings are dropped rather\n * than carried over: keeping them beside `type: \"string\"` reproduces the match-nothing schema this\n * exists to fix. A key that carries one therefore emits wider than the record parses — `z.record(z.number().min(5), V)`\n * accepts `\"3\"` — which is the deliberate trade, since throwing on it would reject an ordinary schema\n * outright. */\nfunction stringifyKeyNames(bySchema, json, visited) {\n    // an extracted key that rewrites cannot go on sharing its definition — the string form a key position needs is not the number form every other reference wants — so it inlines. One that does not rewrite keeps the `$ref`.\n    if (json.$ref) {\n        // a recursive key holds its own reference inside its definition, so a node already on the path is left alone rather than resolved again\n        if (visited.has(json))\n            return json;\n        visited.add(json);\n        const def = bySchema.get(json)?.def;\n        if (!def)\n            return json;\n        const inlined = stringifyKeyNames(bySchema, def, visited);\n        return inlined === def ? json : inlined;\n    }\n    for (const keyword of [\"anyOf\", \"oneOf\"]) {\n        const branches = json[keyword];\n        if (!Array.isArray(branches))\n            continue;\n        const mapped = branches.map((branch) => stringifyKeyNames(bySchema, branch, visited));\n        // rebuilding regardless would detach a key that had nothing to re-express, dropping its `$ref` and leaking the internal `id`\n        if (mapped.some((branch, i) => branch !== branches[i]))\n            json = { ...json, [keyword]: mapped };\n    }\n    // a member that already admits a string leaves the key unconstrained, so the node's own type re-expresses only when every member is numeric\n    const types = Array.isArray(json.type) ? json.type : [json.type];\n    const numericType = !types.includes(\"string\") && types.some((t) => t === \"number\" || t === \"integer\");\n    // a heterogeneous key carries no type at all, so its numeric members are caught here instead\n    const values = json.enum ?? (json.const !== undefined ? [json.const] : undefined);\n    if (!numericType && !values?.some((v) => typeof v === \"number\"))\n        return json;\n    const { minimum, maximum, exclusiveMinimum, exclusiveMaximum, multipleOf, format, id, ...rest } = json;\n    if (rest.enum)\n        rest.enum = rest.enum.map((v) => (typeof v === \"number\" ? String(v) : v));\n    else if (typeof rest.const === \"number\")\n        rest.const = String(rest.const);\n    // a heterogeneous key keeps its absent type: the stringified members already say what a key may be\n    if (!numericType)\n        return rest;\n    rest.type = \"string\";\n    if (!values)\n        rest.pattern = (types.includes(\"number\") ? regexes.number : regexes.integer).source;\n    return rest;\n}\n/** Every record of one conversion, so the carriers are found in a single pass rather than once per record. */\nconst pendingRecords = new WeakMap();\nfunction rewriteKeyNames(ctx) {\n    // an extracted key is resolved by the object `extractToDef` left in its place, so the map is built once rather than searched per reference. `_zod.toJSONSchema` can hand the same object to two schemas, so the first entry carrying a body wins, as a search would have found it.\n    const bySchema = new Map();\n    for (const entry of ctx.seen.values()) {\n        if (entry.def && !bySchema.has(entry.schema))\n            bySchema.set(entry.schema, entry);\n    }\n    const rewrites = new Map();\n    for (const record of pendingRecords.get(ctx) ?? []) {\n        const seen = ctx.seen.get(record);\n        const names = (seen?.def ?? seen?.schema)?.propertyNames;\n        if (!names || names === true || rewrites.has(names))\n            continue;\n        const rewritten = stringifyKeyNames(bySchema, names, new Set());\n        if (rewritten !== names)\n            rewrites.set(names, rewritten);\n    }\n    if (!rewrites.size)\n        return;\n    // the flatten has already copied each record's own properties onto every wrapper by reference, and an extracted body is another such copy, so every carrier holding a rewritten key is updated together\n    for (const entry of ctx.seen.values()) {\n        for (const carrier of [entry.schema, entry.def]) {\n            const rewritten = carrier && rewrites.get(carrier.propertyNames);\n            if (rewritten)\n                carrier.propertyNames = rewritten;\n        }\n    }\n}\nexport const recordProcessor = (schema, ctx, _json, params) => {\n    const json = _json;\n    const def = schema._zod.def;\n    json.type = \"object\";\n    // For looseRecord with regex patterns, use patternProperties. This correctly represents \"only validate keys matching the pattern\" semantics and composes well with allOf (intersections)\n    const keyType = def.keyType;\n    const patterns = aggregateChecks(keyType).patterns;\n    if (def.mode === \"loose\" && patterns && patterns.size > 0) {\n        // Use patternProperties for looseRecord with regex patterns\n        const valueSchema = processSchema(def.valueType, ctx, {\n            ...params,\n            path: [...params.path, \"patternProperties\", \"*\"],\n        });\n        json.patternProperties = {};\n        for (const pattern of patterns) {\n            assignProp(json.patternProperties, exactPattern(pattern).source, valueSchema);\n        }\n    }\n    else {\n        // Default behavior: use propertyNames + additionalProperties\n        if (ctx.target === \"draft-07\" || ctx.target === \"draft-2020-12\") {\n            json.propertyNames = processSchema(def.keyType, ctx, {\n                ...params,\n                path: [...params.path, \"propertyNames\"],\n            });\n            let pending = pendingRecords.get(ctx);\n            if (!pending) {\n                pending = [];\n                pendingRecords.set(ctx, pending);\n                ctx.deferred.push(() => rewriteKeyNames(ctx));\n            }\n            pending.push(schema);\n        }\n        json.additionalProperties = processSchema(def.valueType, ctx, {\n            ...params,\n            path: [...params.path, \"additionalProperties\"],\n        });\n    }\n    // Add required for keys with discrete values (enum, literal, etc.)\n    const keyValues = keyType._zod.values;\n    // Every key shares one value schema, so an optional-in value makes the whole key set omittable on input. Output keeps them: the exhaustive branch assigns every key, even one whose value came back undefined.\n    const omittableOnInput = ctx.io === \"input\" && inputOptin(def.valueType) !== undefined;\n    if (keyValues && !def.partial && !omittableOnInput) {\n        const validKeyValues = [...keyValues].filter((v) => typeof v === \"string\" || typeof v === \"number\");\n        if (validKeyValues.length > 0) {\n            json.required = validKeyValues.map(String);\n        }\n    }\n};\nexport const nullableProcessor = (schema, ctx, json, params) => {\n    const def = schema._zod.def;\n    const inner = processSchema(def.innerType, ctx, params);\n    const seen = ctx.seen.get(schema);\n    if (ctx.target === \"openapi-3.0\") {\n        seen.ref = def.innerType;\n        json.nullable = true;\n    }\n    else {\n        json.anyOf = [inner, { type: \"null\" }];\n    }\n};\nexport const nonoptionalProcessor = (schema, ctx, _json, params) => {\n    const def = schema._zod.def;\n    processSchema(def.innerType, ctx, params);\n    const seen = ctx.seen.get(schema);\n    seen.ref = def.innerType;\n};\n/** Round-trips a default value through JSON so the emitted schema is guaranteed to be valid JSON.\n * A BigInt has no reliable encoding, so it goes through `unrepresentable` like any other\n * unrepresentable value. Returns a sentinel when the caller must not write a default of its own. */\nconst UNREPRESENTABLE_DEFAULT = Symbol();\nfunction serializeDefaultValue(value, schema, ctx, json, params) {\n    let unrepresentable = false;\n    const serialized = JSON.stringify(value, (_, val) => {\n        if (typeof val !== \"bigint\")\n            return val;\n        unrepresentable = true;\n        return null;\n    });\n    if (!unrepresentable)\n        return JSON.parse(serialized);\n    handleUnrepresentable(schema, ctx, json, params, \"BigInt defaults cannot be represented in JSON Schema\");\n    return UNREPRESENTABLE_DEFAULT;\n}\nexport const defaultProcessor = (schema, ctx, json, params) => {\n    const def = schema._zod.def;\n    processSchema(def.innerType, ctx, params);\n    const seen = ctx.seen.get(schema);\n    seen.ref = def.innerType;\n    const value = serializeDefaultValue(def.defaultValue, schema, ctx, json, params);\n    if (value !== UNREPRESENTABLE_DEFAULT)\n        json.default = value;\n};\nexport const prefaultProcessor = (schema, ctx, json, params) => {\n    const def = schema._zod.def;\n    processSchema(def.innerType, ctx, params);\n    const seen = ctx.seen.get(schema);\n    seen.ref = def.innerType;\n    if (ctx.io !== \"input\")\n        return;\n    const value = serializeDefaultValue(def.defaultValue, schema, ctx, json, params);\n    if (value !== UNREPRESENTABLE_DEFAULT)\n        json._prefault = value;\n};\nexport const catchProcessor = (schema, ctx, json, params) => {\n    const def = schema._zod.def;\n    processSchema(def.innerType, ctx, params);\n    const seen = ctx.seen.get(schema);\n    seen.ref = def.innerType;\n    let catchValue;\n    try {\n        catchValue = def.catchValue(undefined);\n    }\n    catch {\n        handleUnrepresentable(schema, ctx, json, params, \"Dynamic catch values are not supported in JSON Schema\");\n        return;\n    }\n    json.default = catchValue;\n};\nexport const pipeProcessor = (schema, ctx, _json, params) => {\n    const def = schema._zod.def;\n    const inIsTransform = def.in._zod.traits.has(\"$ZodTransform\");\n    const innerType = ctx.io === \"input\" ? (inIsTransform ? def.out : def.in) : def.out;\n    processSchema(innerType, ctx, params);\n    const seen = ctx.seen.get(schema);\n    seen.ref = innerType;\n};\nexport const readonlyProcessor = (schema, ctx, json, params) => {\n    const def = schema._zod.def;\n    processSchema(def.innerType, ctx, params);\n    const seen = ctx.seen.get(schema);\n    seen.ref = def.innerType;\n    json.readOnly = true;\n};\nexport const promiseProcessor = (schema, ctx, _json, params) => {\n    const def = schema._zod.def;\n    processSchema(def.innerType, ctx, params);\n    const seen = ctx.seen.get(schema);\n    seen.ref = def.innerType;\n};\nexport const optionalProcessor = (schema, ctx, _json, params) => {\n    const def = schema._zod.def;\n    processSchema(def.innerType, ctx, params);\n    const seen = ctx.seen.get(schema);\n    seen.ref = def.innerType;\n};\nexport const lazyProcessor = (schema, ctx, _json, params) => {\n    const innerType = schema._zod.innerType;\n    processSchema(innerType, ctx, params);\n    const seen = ctx.seen.get(schema);\n    seen.ref = innerType;\n};\n// ==================== ALL PROCESSORS ====================\nexport const allProcessors = {\n    string: stringProcessor,\n    number: numberProcessor,\n    boolean: booleanProcessor,\n    bigint: bigintProcessor,\n    symbol: symbolProcessor,\n    null: nullProcessor,\n    undefined: undefinedProcessor,\n    void: voidProcessor,\n    never: neverProcessor,\n    any: anyProcessor,\n    unknown: unknownProcessor,\n    date: dateProcessor,\n    enum: enumProcessor,\n    literal: literalProcessor,\n    nan: nanProcessor,\n    template_literal: templateLiteralProcessor,\n    file: fileProcessor,\n    success: successProcessor,\n    custom: customProcessor,\n    function: functionProcessor,\n    transform: transformProcessor,\n    map: mapProcessor,\n    set: setProcessor,\n    array: arrayProcessor,\n    object: objectProcessor,\n    union: unionProcessor,\n    intersection: intersectionProcessor,\n    tuple: tupleProcessor,\n    record: recordProcessor,\n    nullable: nullableProcessor,\n    nonoptional: nonoptionalProcessor,\n    default: defaultProcessor,\n    prefault: prefaultProcessor,\n    catch: catchProcessor,\n    pipe: pipeProcessor,\n    readonly: readonlyProcessor,\n    promise: promiseProcessor,\n    optional: optionalProcessor,\n    lazy: lazyProcessor,\n};\nexport function toJSONSchema(input, params) {\n    if (\"_idmap\" in input) {\n        // Registry case\n        const registry = input;\n        const ctx = initializeContext({ ...params, processors: allProcessors });\n        const defs = {};\n        // First pass: process all schemas to build the seen map\n        for (const entry of registry._idmap.entries()) {\n            const [_, schema] = entry;\n            processSchema(schema, ctx);\n        }\n        const schemas = {};\n        const external = {\n            registry,\n            uri: params?.uri,\n            defs,\n        };\n        // Update the context with external configuration\n        ctx.external = external;\n        // Second pass: emit each schema\n        for (const entry of registry._idmap.entries()) {\n            const [key, schema] = entry;\n            extractDefs(ctx, schema);\n            assignProp(schemas, key, finalize(ctx, schema));\n        }\n        if (Object.keys(defs).length > 0) {\n            const defsSegment = ctx.target === \"draft-2020-12\" ? \"$defs\" : \"definitions\";\n            schemas.__shared = {\n                [defsSegment]: defs,\n            };\n        }\n        return { schemas };\n    }\n    // Single schema case\n    const ctx = initializeContext({ ...params, processors: allProcessors });\n    processSchema(input, ctx);\n    extractDefs(ctx, input);\n    return finalize(ctx, input);\n}\n"],"names":["narrowMin","agg","key","value","narrowMax","narrowBoth","addDivisor","addPattern","pattern","intersectMime","mime","m","setFormat","format","minContributor","def","maxContributor","formatContributor","ranges","minimum","maximum","contributors","NUMBER_FORMAT_RANGES","BIGINT_FORMAT_RANGES","aggregateChecks","schema","list","ch","bag","formatMap","exactPatterns","base64Charset","regexes.base64","base64urlCharset","regexes.base64url","exactPattern","p","stringProcessor","ctx","_json","_params","json","patterns","contentEncoding","laxFormat","patternList","regex","numberProcessor","params","multipleOf","exclusiveMaximum","exclusiveMinimum","isInt","exMin","exMax","legacy","divisors","divisor","handleUnrepresentable","first","rest","booleanProcessor","_schema","_ctx","neverProcessor","anyProcessor","unknownProcessor","enumProcessor","values","getEnumValues","v","customProcessor","transformProcessor","arrayProcessor","processSchema","inputOptin","objectProcessor","shape","assignProp","requiredKeys","field","unionProcessor","isExclusive","options","x","i","intersectionProcessor","a","b","isSimpleIntersection","val","allOf","stringifyKeyNames","bySchema","visited","inlined","keyword","branches","mapped","branch","types","numericType","t","id","regexes.number","regexes.integer","pendingRecords","rewriteKeyNames","entry","rewrites","record","seen","names","rewritten","carrier","recordProcessor","keyType","valueSchema","pending","keyValues","omittableOnInput","validKeyValues","nullableProcessor","inner","nonoptionalProcessor","UNREPRESENTABLE_DEFAULT","serializeDefaultValue","unrepresentable","serialized","_","defaultProcessor","prefaultProcessor","catchProcessor","catchValue","pipeProcessor","inIsTransform","innerType","readonlyProcessor","optionalProcessor"],"mappings":";;;;AAIA,MAAMA,IAAY,CAACC,GAAKC,GAAKC,MAAU;AACnC,GAAIF,EAAIC,CAAG,MAAM,UAAaC,IAAQF,EAAIC,CAAG,OACzCD,EAAIC,CAAG,IAAIC;AACnB,GACMC,IAAY,CAACH,GAAKC,GAAKC,MAAU;AACnC,GAAIF,EAAIC,CAAG,MAAM,UAAaC,IAAQF,EAAIC,CAAG,OACzCD,EAAIC,CAAG,IAAIC;AACnB,GACME,IAAa,CAACJ,GAAKE,MAAU;AAC/B,EAAAH,EAAUC,GAAK,WAAWE,CAAK,GAC/BC,EAAUH,GAAK,WAAWE,CAAK;AACnC,GACMG,IAAa,CAACL,GAAKE,MAAU;AAC/B,EAAAF,EAAI,eAAeA,EAAI,aAAa,CAAA,IAC/BA,EAAI,WAAW,SAASE,CAAK,KAC9BF,EAAI,WAAW,KAAKE,CAAK;AACjC,GACMI,IAAa,CAACN,GAAKO,MAAY;AACjC,EAAAP,EAAI,aAAaA,EAAI,WAAW,oBAAI,IAAG,IACvCA,EAAI,SAAS,IAAIO,CAAO;AAC5B,GACMC,IAAgB,CAACR,GAAKS,MAAS;AACjC,EAAAT,EAAI,OAAOA,EAAI,OAAOA,EAAI,KAAK,OAAO,CAACU,MAAMD,EAAK,SAASC,CAAC,CAAC,IAAI,CAAC,GAAGD,CAAI;AAC7E,GAEME,IAAY,CAACX,GAAKY,MAAW;AAC/B,EAAAZ,EAAI,SAASY,GACTA,EAAO,SAAS,KAAK,MACrBZ,EAAI,QAAQ;AACpB,GACMa,IAAiB,CAACb,GAAKc,MAAQf,EAAUC,GAAK,WAAWc,EAAI,OAAO,GACpEC,IAAiB,CAACf,GAAKc,MAAQX,EAAUH,GAAK,WAAWc,EAAI,OAAO,GACpEE,IAAoB,CAACC,MAAW,CAACjB,GAAKc,MAAQ;AAChD,EAAAH,EAAUX,GAAKc,EAAI,MAAM;AACzB,QAAM,CAACI,GAASC,CAAO,IAAIF,EAAOH,EAAI,MAAM;AAC5C,EAAAf,EAAUC,GAAK,WAAWkB,CAAO,GACjCf,EAAUH,GAAK,WAAWmB,CAAO;AACrC,GACMC,IAAe;AAAA,EACjB,cAAc,CAACpB,GAAKc,MAAQf,EAAUC,GAAKc,EAAI,YAAY,YAAY,oBAAoBA,EAAI,KAAK;AAAA,EACpG,WAAW,CAACd,GAAKc,MAAQX,EAAUH,GAAKc,EAAI,YAAY,YAAY,oBAAoBA,EAAI,KAAK;AAAA,EACjG,aAAa,CAACd,GAAKc,MAAQT,EAAWL,GAAKc,EAAI,KAAK;AAAA,EACpD,eAAeE,EAAkBK,CAAoB;AAAA,EACrD,eAAeL,EAAkBM,CAAoB;AAAA,EACrD,YAAYT;AAAA,EACZ,YAAYE;AAAA,EACZ,eAAe,CAACf,GAAKc,MAAQV,EAAWJ,GAAKc,EAAI,MAAM;AAAA,EACvD,UAAUD;AAAA,EACV,UAAUE;AAAA,EACV,aAAa,CAACf,GAAKc,MAAQV,EAAWJ,GAAKc,EAAI,IAAI;AAAA,EACnD,eAAe,CAACd,GAAKc,MAAQ;AACzB,IAAAH,EAAUX,GAAKc,EAAI,MAAM,GACrBA,EAAI,WACJR,EAAWN,GAAKc,EAAI,OAAO,IAC3BA,EAAI,WAAW,YAAYA,EAAI,WAAW,iBAC1Cd,EAAI,kBAAkBc,EAAI,UAC1BA,EAAI,SAASA,EAAI,cAAc,QAC/Bd,EAAI,YAAY;AAAA,EACxB;AAAA,EACA,WAAW,CAACA,GAAKc,MAAQN,EAAcR,GAAKc,EAAI,IAAI;AACxD;AACO,SAASS,EAAgBC,GAAQ;AACpC,QAAMxB,IAAM,CAAA,GACNc,IAAMU,EAAO,KAAK,KAElBC,IAAOD,EAAO,KAAK,OAAO,IAAI,WAAW,IACzC,CAACA,GAAQ,GAAIV,EAAI,UAAU,CAAA,CAAG,IAC7BA,EAAI,UAAU;AACrB,aAAWY,KAAMD;AACb,IAAAL,EAAaM,EAAG,KAAK,IAAI,KAAK,IAAI1B,GAAK0B,EAAG,KAAK,GAAG;AAEtD,QAAMC,IAAMH,EAAO,KAAK;AACxB,EAAIG,EAAI,YAAY,UAChB5B,EAAUC,GAAK,WAAW2B,EAAI,OAAO,GACrCA,EAAI,qBAAqB,UACzB5B,EAAUC,GAAK,oBAAoB2B,EAAI,gBAAgB,GACvDA,EAAI,YAAY,UAChBxB,EAAUH,GAAK,WAAW2B,EAAI,OAAO,GACrCA,EAAI,qBAAqB,UACzBxB,EAAUH,GAAK,oBAAoB2B,EAAI,gBAAgB,GACvDA,EAAI,eAAe,UACnBtB,EAAWL,GAAK2B,EAAI,UAAU,GAC9BA,EAAI,WAAW,WACf3B,EAAI,WAAWA,EAAI,SAAS2B,EAAI,SAC5BA,EAAI,OAAO,SAAS,KAAK,MACzB3B,EAAI,QAAQ,MAEhB2B,EAAI,QACJnB,EAAcR,GAAK2B,EAAI,IAAI;AAC/B,aAAWpB,KAAWoB,EAAI,YAAY,CAAA;AAClC,IAAArB,EAAWN,GAAKO,CAAO;AAC3B,SAAOP;AACX;AACA,MAAM4B,IAAY;AAAA,EACd,MAAM;AAAA,EACN,KAAK;AAAA,EACL,UAAU;AAAA,EACV,aAAa;AAAA,EACb,OAAO;AAAA;AACX,GAGMC,IAAgB,oBAAI,IAAI;AAAA,EAC1B,CAACC,GAAeC,CAAc;AAAA,EAC9B,CAACC,GAAkBC,CAAiB;AACxC,CAAC,GACKC,IAAe,CAACC,MAAMN,EAAc,IAAIM,CAAC,KAAKA,GACvCC,KAAkB,CAACZ,GAAQa,GAAKC,GAAOC,MAAY;AAC5D,QAAMC,IAAOF;AACb,EAAAE,EAAK,OAAO;AACZ,QAAM,EAAE,SAAAtB,GAAS,SAAAC,GAAS,QAAAP,GAAQ,UAAA6B,GAAU,iBAAAC,GAAiB,WAAAC,EAAS,IAAKpB,EAAgBC,CAAM;AAiBjG,MAhBI,OAAON,KAAY,aACnBsB,EAAK,YAAYtB,IACjB,OAAOC,KAAY,aACnBqB,EAAK,YAAYrB,IAEjBP,MACA4B,EAAK,SAASZ,EAAUhB,CAAM,KAAKA,GAC/B4B,EAAK,WAAW,MAChB,OAAOA,EAAK,SAEZ5B,MAAW,UAAU+B,MACrB,OAAOH,EAAK,SAGhBE,MACAF,EAAK,kBAAkBE,IACvBD,KAAYA,EAAS,OAAO,GAAG;AAC/B,UAAMG,IAAc,CAAC,GAAGH,CAAQ,EAAE,IAAIP,CAAY;AAClD,IAAIU,EAAY,WAAW,IACvBJ,EAAK,UAAUI,EAAY,CAAC,EAAE,SACzBA,EAAY,SAAS,MAC1BJ,EAAK,QAAQ;AAAA,MACT,GAAGI,EAAY,IAAI,CAACC,OAAW;AAAA,QAC3B,GAAIR,EAAI,WAAW,cAAcA,EAAI,WAAW,cAAcA,EAAI,WAAW,gBACvE,EAAE,MAAM,SAAQ,IAChB;QACN,SAASQ,EAAM;AAAA,MACnC,EAAkB;AAAA,IAClB;AAAA,EAEI;AACJ,GACaC,KAAkB,CAACtB,GAAQa,GAAKC,GAAOS,MAAW;AAC3D,QAAMP,IAAOF,GACP,EAAE,SAAApB,GAAS,SAAAC,GAAS,YAAA6B,GAAY,kBAAAC,GAAkB,kBAAAC,GAAkB,OAAAC,EAAK,IAAK5B,EAAgBC,CAAM;AAC1G,EAAAgB,EAAK,OAAOW,IAAQ,YAAY;AAEhC,QAAMC,IAAQ,OAAOF,KAAqB,YAAYA,MAAqBhC,KAAW,OAAO,oBACvFmC,IAAQ,OAAOJ,KAAqB,YAAYA,MAAqB9B,KAAW,OAAO,oBACvFmC,IAASjB,EAAI,WAAW,cAAcA,EAAI,WAAW;AAyB3D,MAxBIe,IACIE,KACAd,EAAK,UAAUU,GACfV,EAAK,mBAAmB,MAGxBA,EAAK,mBAAmBU,IAGvB,OAAOhC,KAAY,aACxBsB,EAAK,UAAUtB,IAEfmC,IACIC,KACAd,EAAK,UAAUS,GACfT,EAAK,mBAAmB,MAGxBA,EAAK,mBAAmBS,IAGvB,OAAO9B,KAAY,aACxBqB,EAAK,UAAUrB,IAEf6B,GAAY;AAEZ,UAAMO,IAAW,oBAAI,IAAG;AACxB,eAAWC,KAAWR;AAClB,MAAI,OAAO,SAASQ,CAAO,KAAKA,MAAY,IACxCD,EAAS,IAAI,KAAK,IAAIC,CAAO,CAAC,IAE9BC,EAAsBjC,GAAQa,GAAKG,GAAMO,GAAQ,2BAA2BS,CAAO,uCAAuC;AAGlI,UAAM,CAACE,GAAO,GAAGC,CAAI,IAAIJ;AACzB,IAAIG,MAAU,WACVlB,EAAK,aAAakB,IAClBC,EAAK,WACLnB,EAAK,QAAQ,CAAC,GAAIA,EAAK,SAAS,CAAA,GAAK,GAAGmB,EAAK,IAAI,CAACjD,OAAO,EAAE,YAAYA,EAAC,EAAG,CAAC;AAAA,EACpF;AACJ,GACakD,KAAmB,CAACC,GAASC,GAAMtB,GAAMD,MAAY;AAC9D,EAAAC,EAAK,OAAO;AAChB,GAuBauB,KAAiB,CAACF,GAASC,GAAMtB,GAAMD,MAAY;AAC5D,EAAAC,EAAK,MAAM,CAAA;AACf,GACawB,KAAe,CAACH,GAASC,GAAMxB,GAAOC,MAAY;AAE/D,GACa0B,KAAmB,CAACJ,GAASC,GAAMxB,GAAOC,MAAY;AAEnE,GAIa2B,KAAgB,CAAC1C,GAAQsC,GAAMtB,GAAMD,MAAY;AAC1D,QAAMzB,IAAMU,EAAO,KAAK,KAClB2C,IAASC,EAActD,EAAI,OAAO;AAExC,MAAIqD,EAAO,WAAW,GAAG;AACrB,IAAA3B,EAAK,MAAM,CAAA;AACX;AAAA,EACJ;AAEA,EAAI2B,EAAO,MAAM,CAACE,MAAM,OAAOA,KAAM,QAAQ,MACzC7B,EAAK,OAAO,WACZ2B,EAAO,MAAM,CAACE,MAAM,OAAOA,KAAM,QAAQ,MACzC7B,EAAK,OAAO,WAChBA,EAAK,OAAO2B;AAChB,GAqFaG,KAAkB,CAAC9C,GAAQa,GAAKG,GAAMO,MAAW;AAC1D,EAAAU,EAAsBjC,GAAQa,GAAKG,GAAMO,GAAQ,mDAAmD;AACxG,GAIawB,KAAqB,CAAC/C,GAAQa,GAAKG,GAAMO,MAAW;AAC7D,EAAAU,EAAsBjC,GAAQa,GAAKG,GAAMO,GAAQ,iDAAiD;AACtG,GAQayB,KAAiB,CAAChD,GAAQa,GAAKC,GAAOS,MAAW;AAC1D,QAAMP,IAAOF,GACPxB,IAAMU,EAAO,KAAK,KAClB,EAAE,SAAAN,GAAS,SAAAC,MAAYI,EAAgBC,CAAM;AACnD,EAAI,OAAON,KAAY,aACnBsB,EAAK,WAAWtB,IAChB,OAAOC,KAAY,aACnBqB,EAAK,WAAWrB,IACpBqB,EAAK,OAAO,SACZA,EAAK,QAAQiC,EAAc3D,EAAI,SAASuB,GAAK;AAAA,IACzC,GAAGU;AAAA,IACH,MAAM,CAAC,GAAGA,EAAO,MAAM,OAAO;AAAA,EACtC,CAAK;AACL;AAMA,SAAS2B,EAAWlD,GAAQ;AACxB,QAAMV,IAAMU,EAAO,KAAK;AACxB,SAAIV,EAAI,SAAS,UAAUA,EAAI,GAAG,KAAK,OAAO,IAAI,eAAe,IACtD4D,EAAW5D,EAAI,GAAG,IAEzBA,EAAI,SAAS,UACN4D,EAAW5D,EAAI,SAAS,IAE5BU,EAAO,KAAK;AACvB;AACY,MAACmD,KAAkB,CAACnD,GAAQa,GAAKC,GAAOS,MAAW;AAC3D,QAAMP,IAAOF,GACPxB,IAAMU,EAAO,KAAK,KAClBoD,IAAQ9D,EAAI;AAGlB,MADmB,OAAO,sBAAsB8D,CAAK,EACtC,UACXnB,EAAsBjC,GAAQa,GAAKG,GAAMO,GAAQ,kDAAkD;AACnG;AAEJ,EAAAP,EAAK,OAAO,UACZA,EAAK,aAAa,CAAA;AAClB,aAAWvC,KAAO2E;AAEd,IAAAC,EAAWrC,EAAK,YAAYvC,GAAKwE,EAAcG,EAAM3E,CAAG,GAAGoC,GAAK;AAAA,MAC5D,GAAGU;AAAA,MACH,MAAM,CAAC,GAAGA,EAAO,MAAM,cAAc9C,CAAG;AAAA,IACpD,CAAS,CAAC;AAGN,QAAM6E,IAAe,CAAA;AACrB,aAAW7E,KAAO,OAAO,KAAK2E,CAAK,GAAG;AAClC,UAAMG,IAAQjE,EAAI,MAAMb,CAAG;AAC3B,KAAIoC,EAAI,OAAO,UAAUqC,EAAWK,CAAK,MAAM,SAAYA,EAAM,KAAK,WAAW,WAC7ED,EAAa,KAAK7E,CAAG;AAAA,EAE7B;AACA,EAAI6E,EAAa,SAAS,MACtBtC,EAAK,WAAWsC,IAGhBhE,EAAI,UAAU,KAAK,IAAI,SAAS,UAEhC0B,EAAK,uBAAuB,KAEtB1B,EAAI,WAKLA,EAAI,aACT0B,EAAK,uBAAuBiC,EAAc3D,EAAI,UAAUuB,GAAK;AAAA,IACzD,GAAGU;AAAA,IACH,MAAM,CAAC,GAAGA,EAAO,MAAM,sBAAsB;AAAA,EACzD,CAAS,KAPGV,EAAI,OAAO,aACXG,EAAK,uBAAuB;AAQxC,GACawC,KAAiB,CAACxD,GAAQa,GAAKG,GAAMO,MAAW;AACzD,QAAMjC,IAAMU,EAAO,KAAK,KAElByD,IAAcnE,EAAI,cAAc,IAChCoE,IAAUpE,EAAI,QAAQ,IAAI,CAACqE,GAAGC,MAAMX,EAAcU,GAAG9C,GAAK;AAAA,IAC5D,GAAGU;AAAA,IACH,MAAM,CAAC,GAAGA,EAAO,MAAMkC,IAAc,UAAU,SAASG,CAAC;AAAA,EACjE,CAAK,CAAC;AACF,EAAIH,IACAzC,EAAK,QAAQ0C,IAGb1C,EAAK,QAAQ0C;AAErB,GACaG,KAAwB,CAAC7D,GAAQa,GAAKG,GAAMO,MAAW;AAChE,QAAMjC,IAAMU,EAAO,KAAK,KAClB8D,IAAIb,EAAc3D,EAAI,MAAMuB,GAAK;AAAA,IACnC,GAAGU;AAAA,IACH,MAAM,CAAC,GAAGA,EAAO,MAAM,SAAS,CAAC;AAAA,EACzC,CAAK,GACKwC,IAAId,EAAc3D,EAAI,OAAOuB,GAAK;AAAA,IACpC,GAAGU;AAAA,IACH,MAAM,CAAC,GAAGA,EAAO,MAAM,SAAS,CAAC;AAAA,EACzC,CAAK,GACKyC,IAAuB,CAACC,MAAQ,WAAWA,KAAO,OAAO,KAAKA,CAAG,EAAE,WAAW,GAC9EC,IAAQ;AAAA,IACV,GAAIF,EAAqBF,CAAC,IAAIA,EAAE,QAAQ,CAACA,CAAC;AAAA,IAC1C,GAAIE,EAAqBD,CAAC,IAAIA,EAAE,QAAQ,CAACA,CAAC;AAAA,EAClD;AACI,EAAA/C,EAAK,QAAQkD,GAEbrD,EAAI,cAAc,KAAKqD,CAAK;AAChC;AAiFA,SAASC,EAAkBC,GAAUpD,GAAMqD,GAAS;AAEhD,MAAIrD,EAAK,MAAM;AAEX,QAAIqD,EAAQ,IAAIrD,CAAI;AAChB,aAAOA;AACX,IAAAqD,EAAQ,IAAIrD,CAAI;AAChB,UAAM1B,IAAM8E,EAAS,IAAIpD,CAAI,GAAG;AAChC,QAAI,CAAC1B;AACD,aAAO0B;AACX,UAAMsD,IAAUH,EAAkBC,GAAU9E,GAAK+E,CAAO;AACxD,WAAOC,MAAYhF,IAAM0B,IAAOsD;AAAA,EACpC;AACA,aAAWC,KAAW,CAAC,SAAS,OAAO,GAAG;AACtC,UAAMC,IAAWxD,EAAKuD,CAAO;AAC7B,QAAI,CAAC,MAAM,QAAQC,CAAQ;AACvB;AACJ,UAAMC,IAASD,EAAS,IAAI,CAACE,MAAWP,EAAkBC,GAAUM,GAAQL,CAAO,CAAC;AAEpF,IAAII,EAAO,KAAK,CAACC,GAAQd,MAAMc,MAAWF,EAASZ,CAAC,CAAC,MACjD5C,IAAO,EAAE,GAAGA,GAAM,CAACuD,CAAO,GAAGE,EAAM;AAAA,EAC3C;AAEA,QAAME,IAAQ,MAAM,QAAQ3D,EAAK,IAAI,IAAIA,EAAK,OAAO,CAACA,EAAK,IAAI,GACzD4D,IAAc,CAACD,EAAM,SAAS,QAAQ,KAAKA,EAAM,KAAK,CAACE,MAAMA,MAAM,YAAYA,MAAM,SAAS,GAE9FlC,IAAS3B,EAAK,SAASA,EAAK,UAAU,SAAY,CAACA,EAAK,KAAK,IAAI;AACvE,MAAI,CAAC4D,KAAe,CAACjC,GAAQ,KAAK,CAACE,MAAM,OAAOA,KAAM,QAAQ;AAC1D,WAAO7B;AACX,QAAM,EAAE,SAAAtB,GAAS,SAAAC,GAAS,kBAAA+B,GAAkB,kBAAAD,GAAkB,YAAAD,GAAY,QAAApC,GAAQ,IAAA0F,GAAI,GAAG3C,EAAI,IAAKnB;AAMlG,SALImB,EAAK,OACLA,EAAK,OAAOA,EAAK,KAAK,IAAI,CAACU,MAAO,OAAOA,KAAM,WAAW,OAAOA,CAAC,IAAIA,CAAE,IACnE,OAAOV,EAAK,SAAU,aAC3BA,EAAK,QAAQ,OAAOA,EAAK,KAAK,IAE7ByC,MAELzC,EAAK,OAAO,UACPQ,MACDR,EAAK,WAAWwC,EAAM,SAAS,QAAQ,IAAII,IAAiBC,GAAiB,UAC1E7C;AACX;AAEA,MAAM8C,IAAiB,oBAAI,QAAO;AAClC,SAASC,EAAgBrE,GAAK;AAE1B,QAAMuD,IAAW,oBAAI,IAAG;AACxB,aAAWe,KAAStE,EAAI,KAAK,OAAM;AAC/B,IAAIsE,EAAM,OAAO,CAACf,EAAS,IAAIe,EAAM,MAAM,KACvCf,EAAS,IAAIe,EAAM,QAAQA,CAAK;AAExC,QAAMC,IAAW,oBAAI,IAAG;AACxB,aAAWC,KAAUJ,EAAe,IAAIpE,CAAG,KAAK,CAAA,GAAI;AAChD,UAAMyE,IAAOzE,EAAI,KAAK,IAAIwE,CAAM,GAC1BE,KAASD,GAAM,OAAOA,GAAM,SAAS;AAC3C,QAAI,CAACC,KAASA,MAAU,MAAQH,EAAS,IAAIG,CAAK;AAC9C;AACJ,UAAMC,IAAYrB,EAAkBC,GAAUmB,GAAO,oBAAI,IAAG,CAAE;AAC9D,IAAIC,MAAcD,KACdH,EAAS,IAAIG,GAAOC,CAAS;AAAA,EACrC;AACA,MAAKJ,EAAS;AAGd,eAAWD,KAAStE,EAAI,KAAK,OAAM;AAC/B,iBAAW4E,KAAW,CAACN,EAAM,QAAQA,EAAM,GAAG,GAAG;AAC7C,cAAMK,IAAYC,KAAWL,EAAS,IAAIK,EAAQ,aAAa;AAC/D,QAAID,MACAC,EAAQ,gBAAgBD;AAAA,MAChC;AAER;AACY,MAACE,KAAkB,CAAC1F,GAAQa,GAAKC,GAAOS,MAAW;AAC3D,QAAMP,IAAOF,GACPxB,IAAMU,EAAO,KAAK;AACxB,EAAAgB,EAAK,OAAO;AAEZ,QAAM2E,IAAUrG,EAAI,SACd2B,IAAWlB,EAAgB4F,CAAO,EAAE;AAC1C,MAAIrG,EAAI,SAAS,WAAW2B,KAAYA,EAAS,OAAO,GAAG;AAEvD,UAAM2E,IAAc3C,EAAc3D,EAAI,WAAWuB,GAAK;AAAA,MAClD,GAAGU;AAAA,MACH,MAAM,CAAC,GAAGA,EAAO,MAAM,qBAAqB,GAAG;AAAA,IAC3D,CAAS;AACD,IAAAP,EAAK,oBAAoB,CAAA;AACzB,eAAWjC,KAAWkC;AAClB,MAAAoC,EAAWrC,EAAK,mBAAmBN,EAAa3B,CAAO,EAAE,QAAQ6G,CAAW;AAAA,EAEpF,OACK;AAED,QAAI/E,EAAI,WAAW,cAAcA,EAAI,WAAW,iBAAiB;AAC7D,MAAAG,EAAK,gBAAgBiC,EAAc3D,EAAI,SAASuB,GAAK;AAAA,QACjD,GAAGU;AAAA,QACH,MAAM,CAAC,GAAGA,EAAO,MAAM,eAAe;AAAA,MACtD,CAAa;AACD,UAAIsE,IAAUZ,EAAe,IAAIpE,CAAG;AACpC,MAAKgF,MACDA,IAAU,CAAA,GACVZ,EAAe,IAAIpE,GAAKgF,CAAO,GAC/BhF,EAAI,SAAS,KAAK,MAAMqE,EAAgBrE,CAAG,CAAC,IAEhDgF,EAAQ,KAAK7F,CAAM;AAAA,IACvB;AACA,IAAAgB,EAAK,uBAAuBiC,EAAc3D,EAAI,WAAWuB,GAAK;AAAA,MAC1D,GAAGU;AAAA,MACH,MAAM,CAAC,GAAGA,EAAO,MAAM,sBAAsB;AAAA,IACzD,CAAS;AAAA,EACL;AAEA,QAAMuE,IAAYH,EAAQ,KAAK,QAEzBI,IAAmBlF,EAAI,OAAO,WAAWqC,EAAW5D,EAAI,SAAS,MAAM;AAC7E,MAAIwG,KAAa,CAACxG,EAAI,WAAW,CAACyG,GAAkB;AAChD,UAAMC,IAAiB,CAAC,GAAGF,CAAS,EAAE,OAAO,CAACjD,MAAM,OAAOA,KAAM,YAAY,OAAOA,KAAM,QAAQ;AAClG,IAAImD,EAAe,SAAS,MACxBhF,EAAK,WAAWgF,EAAe,IAAI,MAAM;AAAA,EAEjD;AACJ,GACaC,KAAoB,CAACjG,GAAQa,GAAKG,GAAMO,MAAW;AAC5D,QAAMjC,IAAMU,EAAO,KAAK,KAClBkG,IAAQjD,EAAc3D,EAAI,WAAWuB,GAAKU,CAAM,GAChD+D,IAAOzE,EAAI,KAAK,IAAIb,CAAM;AAChC,EAAIa,EAAI,WAAW,iBACfyE,EAAK,MAAMhG,EAAI,WACf0B,EAAK,WAAW,MAGhBA,EAAK,QAAQ,CAACkF,GAAO,EAAE,MAAM,OAAM,CAAE;AAE7C,GACaC,KAAuB,CAACnG,GAAQa,GAAKC,GAAOS,MAAW;AAChE,QAAMjC,IAAMU,EAAO,KAAK;AACxB,EAAAiD,EAAc3D,EAAI,WAAWuB,GAAKU,CAAM;AACxC,QAAM+D,IAAOzE,EAAI,KAAK,IAAIb,CAAM;AAChC,EAAAsF,EAAK,MAAMhG,EAAI;AACnB,GAIM8G,IAA0B,uBAAM;AACtC,SAASC,EAAsB3H,GAAOsB,GAAQa,GAAKG,GAAMO,GAAQ;AAC7D,MAAI+E,IAAkB;AACtB,QAAMC,IAAa,KAAK,UAAU7H,GAAO,CAAC8H,GAAGvC,MACrC,OAAOA,KAAQ,WACRA,KACXqC,IAAkB,IACX,KACV;AACD,SAAKA,KAELrE,EAAsBjC,GAAQa,GAAKG,GAAMO,GAAQ,sDAAsD,GAChG6E,KAFI,KAAK,MAAMG,CAAU;AAGpC;AACY,MAACE,KAAmB,CAACzG,GAAQa,GAAKG,GAAMO,MAAW;AAC3D,QAAMjC,IAAMU,EAAO,KAAK;AACxB,EAAAiD,EAAc3D,EAAI,WAAWuB,GAAKU,CAAM;AACxC,QAAM+D,IAAOzE,EAAI,KAAK,IAAIb,CAAM;AAChC,EAAAsF,EAAK,MAAMhG,EAAI;AACf,QAAMZ,IAAQ2H,EAAsB/G,EAAI,cAAcU,GAAQa,GAAKG,GAAMO,CAAM;AAC/E,EAAI7C,MAAU0H,MACVpF,EAAK,UAAUtC;AACvB,GACagI,KAAoB,CAAC1G,GAAQa,GAAKG,GAAMO,MAAW;AAC5D,QAAMjC,IAAMU,EAAO,KAAK;AACxB,EAAAiD,EAAc3D,EAAI,WAAWuB,GAAKU,CAAM;AACxC,QAAM+D,IAAOzE,EAAI,KAAK,IAAIb,CAAM;AAEhC,MADAsF,EAAK,MAAMhG,EAAI,WACXuB,EAAI,OAAO;AACX;AACJ,QAAMnC,IAAQ2H,EAAsB/G,EAAI,cAAcU,GAAQa,GAAKG,GAAMO,CAAM;AAC/E,EAAI7C,MAAU0H,MACVpF,EAAK,YAAYtC;AACzB,GACaiI,KAAiB,CAAC3G,GAAQa,GAAKG,GAAMO,MAAW;AACzD,QAAMjC,IAAMU,EAAO,KAAK;AACxB,EAAAiD,EAAc3D,EAAI,WAAWuB,GAAKU,CAAM;AACxC,QAAM+D,IAAOzE,EAAI,KAAK,IAAIb,CAAM;AAChC,EAAAsF,EAAK,MAAMhG,EAAI;AACf,MAAIsH;AACJ,MAAI;AACA,IAAAA,IAAatH,EAAI,WAAW,MAAS;AAAA,EACzC,QACM;AACF,IAAA2C,EAAsBjC,GAAQa,GAAKG,GAAMO,GAAQ,uDAAuD;AACxG;AAAA,EACJ;AACA,EAAAP,EAAK,UAAU4F;AACnB,GACaC,KAAgB,CAAC7G,GAAQa,GAAKC,GAAOS,MAAW;AACzD,QAAMjC,IAAMU,EAAO,KAAK,KAClB8G,IAAgBxH,EAAI,GAAG,KAAK,OAAO,IAAI,eAAe,GACtDyH,IAAYlG,EAAI,OAAO,UAAWiG,IAAgBxH,EAAI,MAAMA,EAAI,KAAMA,EAAI;AAChF,EAAA2D,EAAc8D,GAAWlG,GAAKU,CAAM;AACpC,QAAM+D,IAAOzE,EAAI,KAAK,IAAIb,CAAM;AAChC,EAAAsF,EAAK,MAAMyB;AACf,GACaC,KAAoB,CAAChH,GAAQa,GAAKG,GAAMO,MAAW;AAC5D,QAAMjC,IAAMU,EAAO,KAAK;AACxB,EAAAiD,EAAc3D,EAAI,WAAWuB,GAAKU,CAAM;AACxC,QAAM+D,IAAOzE,EAAI,KAAK,IAAIb,CAAM;AAChC,EAAAsF,EAAK,MAAMhG,EAAI,WACf0B,EAAK,WAAW;AACpB,GAOaiG,KAAoB,CAACjH,GAAQa,GAAKC,GAAOS,MAAW;AAC7D,QAAMjC,IAAMU,EAAO,KAAK;AACxB,EAAAiD,EAAc3D,EAAI,WAAWuB,GAAKU,CAAM;AACxC,QAAM+D,IAAOzE,EAAI,KAAK,IAAIb,CAAM;AAChC,EAAAsF,EAAK,MAAMhG,EAAI;AACnB;","x_google_ignoreList":[0]}

package/dist/node_modules/zod/v4/core/memoizer.js

@@ -0,0 +1,203 @@
+import { rawShape as R } from "./util.js";
+class A extends Error {
+  constructor() {
+    super("Cannot parse a reference cycle that closes through a transform"), this.name = "ZodCyclicError";
+  }
+}
+const S = "~memo", O = [];
+function T(e) {
+  return e !== null && typeof e == "object";
+}
+function E(e) {
+  return e.map((s) => s.path ? { ...s, path: s.path.slice() } : { ...s });
+}
+const j = /* @__PURE__ */ new WeakMap(), g = 0, w = 1, _ = 2;
+function y(e, s, c) {
+  const i = j.get(e);
+  if (i !== void 0)
+    return i ? _ : g;
+  if (s.has(e))
+    return _;
+  s.add(e);
+  let a = g;
+  const n = (t) => {
+    if (a !== _ && t?._zod) {
+      const u = y(t, s);
+      u > a && (a = u);
+    }
+  }, d = (t, u) => {
+    let o = g;
+    for (const f of Reflect.ownKeys(t)) {
+      const k = Object.getOwnPropertyDescriptor(t, f);
+      if (!k.enumerable)
+        continue;
+      const p = k.get ? w : k.value?._zod ? y(k.value, s) : g;
+      p > o && (o = p);
+    }
+    return o;
+  }, b = (t) => {
+    t > a && (a = t);
+  }, r = e._zod.def;
+  switch (r.type) {
+    case "object": {
+      const t = R(r);
+      b(t ? d(t) : w), n(r.catchall);
+      break;
+    }
+    case "array":
+      n(r.element);
+      break;
+    case "tuple":
+      for (const t of r.items)
+        n(t);
+      n(r.rest);
+      break;
+    case "record":
+    case "map":
+      n(r.keyType), n(r.valueType);
+      break;
+    case "set":
+      n(r.valueType);
+      break;
+    case "union":
+      for (const t of r.options)
+        n(t);
+      break;
+    case "intersection":
+      n(r.left), n(r.right);
+      break;
+    case "optional":
+    case "nullable":
+    case "default":
+    case "prefault":
+    case "catch":
+    case "readonly":
+    case "nonoptional":
+    case "promise":
+    case "success":
+      n(r.innerType);
+      break;
+    case "pipe":
+      n(r.in), n(r.out);
+      break;
+    case "function":
+      n(r.input), n(r.output);
+      break;
+    // `$ZodLazy` caches its inner on the def, so a resolved edge is followed exactly
+    case "lazy": {
+      const t = r._cachedInner ?? void 0;
+      b(t ? y(t, s) : w);
+      break;
+    }
+    // a leaf by choice: `parts` are regex fragments, not data positions
+    case "template_literal":
+    // leaves
+    case "string":
+    case "number":
+    case "int":
+    case "boolean":
+    case "bigint":
+    case "symbol":
+    case "undefined":
+    case "null":
+    case "void":
+    case "never":
+    case "any":
+    case "unknown":
+    case "date":
+    case "nan":
+    case "enum":
+    case "literal":
+    case "file":
+    case "transform":
+    case "custom":
+      break;
+    default:
+      for (const t in r) {
+        const u = Object.getOwnPropertyDescriptor(r, t);
+        if (!u || u.get)
+          continue;
+        const o = u.value;
+        if (!(!o || typeof o != "object")) {
+          if (o._zod)
+            n(o);
+          else if (Array.isArray(o))
+            for (const f of o)
+              n(f);
+        }
+      }
+  }
+  return s.delete(e), C(e, a);
+}
+function C(e, s) {
+  return s !== w && j.set(e, s === _), s;
+}
+function I(e, s) {
+  let c = e.buckets.get(s);
+  return c || (c = /* @__PURE__ */ new WeakMap(), e.buckets.set(s, c)), c;
+}
+let z;
+const v = [], M = {
+  alloc(e, s, c) {
+    const i = z;
+    if (!i)
+      return c;
+    z = void 0;
+    const a = { value: c, issues: null };
+    return i.set(s.value, a), v.push(a), c;
+  },
+  guard(e) {
+    var s;
+    (s = e._zod).deferred ?? (s.deferred = []), e._zod.deferred.push(() => {
+      const c = e._zod.parse, i = (a, n) => {
+        if (n.direction !== "backward" && N(n, a.value))
+          throw new A();
+        return c(a, n);
+      };
+      e._zod.parse = i, e._zod.run === c && (e._zod.run = i);
+    });
+  },
+  attach(e) {
+    var s;
+    let c, i = !1, a, n;
+    (s = e._zod).deferred ?? (s.deferred = []), e._zod.deferred.push(() => {
+      const d = e._zod.parse, b = (r, l) => {
+        if (c === void 0) {
+          const h = y(e, /* @__PURE__ */ new Set());
+          if (h === g)
+            return e._zod.parse = d, e._zod.run === b && (e._zod.run = d), d(r, l);
+          h === _ || i ? c = !0 : i = !0;
+        }
+        const t = r.value;
+        if (!T(t))
+          return d(r, l);
+        let u = l[S];
+        u || (u = { buckets: /* @__PURE__ */ new WeakMap(), backEdges: void 0 }, l[S] = u);
+        let o;
+        a === l ? o = n : (o = I(u, e), a = l, n = o);
+        const f = o.get(t);
+        if (f)
+          return r.value = f.value, f.issues ? f.issues.length && r.issues.push(...E(f.issues)) : (r.memo = !0, u.backEdges ?? (u.backEdges = /* @__PURE__ */ new WeakSet()), u.backEdges.add(f.value)), r;
+        z = o;
+        const k = v.length, p = d(r, l);
+        z = void 0;
+        const m = v.length > k ? v.pop() : void 0;
+        return p instanceof Promise ? p.then((h) => (m && (m.issues = h.issues.length ? E(h.issues) : O), h)) : (m && (m.issues = p.issues.length ? E(p.issues) : O), p);
+      };
+      e._zod.parse = b, e._zod.run === d && (e._zod.run = b);
+    });
+  }
+};
+function W() {
+  return M;
+}
+function N(e, s) {
+  const c = e[S]?.backEdges;
+  return c !== void 0 && T(s) && c.has(s);
+}
+export {
+  A as $ZodCyclicError,
+  N as isBackEdge,
+  W as memoizer
+};
+//# sourceMappingURL=memoizer.js.map