@vielzeug/spell 2.3.0 → 3.0.0

package/dist/schemas/array.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../src/schemas/array.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,SAAS,EACT,YAAY,EACZ,WAAW,EACX,eAAe,EAEf,gBAAgB,EAChB,SAAS,EACT,YAAY,EACZ,UAAU,EACV,gBAAgB,EAChB,UAAU,EACV,YAAY,EACZ,cAAc,EACf,MAAM,SAAS,CAAC;AAEjB,OAAO,EAA+D,MAAM,EAAwB,MAAM,SAAS,CAAC;AASpH,qBAAa,WAAW,CACtB,CAAC,SAAS,SAAS,EACnB,IAAI,SAAS,UAAU,GAAG,gBAAgB,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAC9D,SAAQ,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC;IAC/C,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC;IAEvB,cAAuB,KAAK,IAAI,MAAM,CAErC;IAEQ,UAAU,CACjB,IAAI,EAAE,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,EAC5B,EAAE,EAAE,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,YAAY,KAAK,OAAO,CAAC,cAAc,CAAC,GAC1E,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC;gBAId,UAAU,EAAE,CAAC;IAKzB,OAAO,CAAC,eAAe;cAkBJ,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,YAAY,GAAG,UAAU;IAUzD,UAAU,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;IAuCxF,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,OAAO,EAAE,CAAA;KAAE,CAAC,GAAG,IAAI;IAwBjF,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,OAAO,EAAE,CAAA;KAAE,CAAC,GAAG,IAAI;IAwBjF,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,OAAO,EAAE,CAAA;KAAE,CAAC,GAAG,IAAI;IAerF,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,OAAO,EAAE,CAAA;KAAE,CAAC,GAAG,IAAI;IAYtE;;;;;;;;;;;;;OAaG;IACH,MAAM,CACJ,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,GAAG,SAAS,CAAC;QAAE,KAAK,EAAE,OAAO,EAAE,CAAA;KAAE,CAAC,EACzG,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,KAAK,EAAE,OAAO,EAAE,CAAA;KAAE,CAAC,GACxC,IAAI;cA+BY,iBAAiB,IAAI,gBAAgB;cAYrC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;CAOhE"}
+{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../src/schemas/array.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,SAAS,EACT,YAAY,EACZ,UAAU,EACV,WAAW,EACX,eAAe,EAEf,gBAAgB,EAChB,SAAS,EACT,YAAY,EACZ,UAAU,EACV,gBAAgB,EAChB,UAAU,EACV,YAAY,EACZ,cAAc,EACf,MAAM,SAAS,CAAC;AAEjB,OAAO,EAA+D,MAAM,EAAwB,MAAM,SAAS,CAAC;AASpH,qBAAa,WAAW,CACtB,CAAC,SAAS,SAAS,EACnB,IAAI,SAAS,UAAU,GAAG,gBAAgB,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAC9D,SAAQ,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC;IACvD,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC;IAEvB,cAAuB,KAAK,IAAI,MAAM,CAErC;IAEQ,UAAU,CACjB,IAAI,EAAE,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,EAC5B,EAAE,EAAE,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,YAAY,KAAK,OAAO,CAAC,cAAc,CAAC,GAC1E,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC;gBAId,UAAU,EAAE,CAAC;IAKzB,OAAO,CAAC,eAAe;cAkBJ,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,YAAY,GAAG,UAAU;IAUzD,UAAU,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;IAuCxF,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,OAAO,EAAE,CAAA;KAAE,CAAC,GAAG,IAAI;IAwBjF,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,OAAO,EAAE,CAAA;KAAE,CAAC,GAAG,IAAI;IAwBjF,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,OAAO,EAAE,CAAA;KAAE,CAAC,GAAG,IAAI;IAerF,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,OAAO,EAAE,CAAA;KAAE,CAAC,GAAG,IAAI;IAYtE;;;;;;;;;;;;;OAaG;IACH,MAAM,CACJ,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,GAAG,SAAS,CAAC;QAAE,KAAK,EAAE,OAAO,EAAE,CAAA;KAAE,CAAC,EACzG,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,KAAK,EAAE,OAAO,EAAE,CAAA;KAAE,CAAC,GACxC,IAAI;cA+BY,iBAAiB,IAAI,gBAAgB;cAYrC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;CAOhE"}

package/dist/schemas/array.js

@@ -1,2 +1,2 @@
-import{ErrorCode as e}from"../types.js";import{SpellValidationError as t,fail as n,prependIssuePath as r,resolveMessage as i}from"../errors.js";import{Schema as a,_makeCtx as o}from"../core.js";var s=class extends a{itemSchema;get _kind(){return`array`}checkAsync(e){return this._addCheck(e,!0)}constructor(e){super(),this.itemSchema=e}_parseItemsSync(e,t){let n=[],i=[];for(let a=0;a<e.length;a++){let o=this.itemSchema._parseFullSync(e[a],t);o.issues.length===0?i.push(o.data):(n.push(...r(o.issues,a)),i.push(e[a]))}return{data:i,issues:n}}_parse(t,r){if(!Array.isArray(t))return{data:t,issues:n(e.invalid_type,r.messages.array.type()),typeOk:!1};let{data:i,issues:a}=this._parseItemsSync(t,r);return{data:i,issues:a,typeOk:!0}}async parseAsync(i,a){let s=a??o();return this._withCatchAsync(async()=>{let a=this._prepareInput(i);if(a.skip)return a.value;let o=a.value;if(!Array.isArray(o))throw new t(n(e.invalid_type,s.messages.array.type()));let c=await Promise.all(o.map(e=>this.itemSchema._parseFullAsync(e,s))),l=[],u=[];for(let e=0;e<c.length;e++){let t=c[e];t.issues.length===0?u.push(t.data):(l.push(...r(t.issues,e)),u.push(o[e]))}let d=await this._runValidatorsAsync(u,s),f=[...l,...d];if(f.length>0)throw new t(f);return this._runPostprocessors(u)})}min(t,r){return this._addConstraint((a,o)=>a.length>=t?null:n(e.too_small,i(r??o.messages.array.min,{min:t,value:a}),{min:t}),e=>{let n=e;return{...n,minItems:n.minItems===void 0?t:Math.max(n.minItems,t)}})}max(t,r){return this._addConstraint((a,o)=>a.length<=t?null:n(e.too_big,i(r??o.messages.array.max,{max:t,value:a}),{max:t}),e=>{let n=e;return{...n,maxItems:n.maxItems===void 0?t:Math.min(n.maxItems,t)}})}length(t,r){return this._addConstraint((a,o)=>a.length===t?null:n(e.invalid_length,i(r??o.messages.array.length,{exact:t,value:a}),{exact:t}),e=>({...e,maxItems:t,minItems:t}))}nonEmpty(t){return this._addConstraint((r,a)=>{let o=r;return o.length>0?null:n(e.too_small,i(t??a.messages.array.nonEmpty,{min:1,value:o}),{min:1})})}unique(t,r){let a=typeof t==`function`&&t.length===2,o=a?t:null,s=a?r:typeof t==`function`?t:void 0;return this._addConstraint((t,r)=>{let a=t,c;return c=o?a.every((e,t)=>a.slice(0,t).every(t=>!o(e,t))):new Set(a).size===a.length,c?null:n(e.invalid_unique,i(s??r.messages.array.unique,{value:a}),{unique:!0})})}_toDescriptorImpl(){let e=this._annotations;return{...this._describeBase(),...e.maxItems===void 0?{}:{maxItems:e.maxItems},...e.minItems===void 0?{}:{minItems:e.minItems},items:this.itemSchema.definition(),kind:`array`}}_walk(e){let t=this.itemSchema.walk(e);return e.array?e.array(this,t):super._walk(e)}};export{s as ArraySchema};
+import{SpellValidationError as e,fail as t,prependIssuePath as n,resolveMessage as r}from"../errors.js";import{ErrorCode as i}from"../types.js";import{Schema as a,_makeCtx as o}from"../core.js";var s=class extends a{itemSchema;get _kind(){return`array`}checkAsync(e){return this._addCheck(e,!0)}constructor(e){super(),this.itemSchema=e}_parseItemsSync(e,t){let r=[],i=[];for(let a=0;a<e.length;a++){let o=this.itemSchema._parseFullSync(e[a],t);o.issues.length===0?i.push(o.data):(r.push(...n(o.issues,a)),i.push(e[a]))}return{data:i,issues:r}}_parse(e,n){if(!Array.isArray(e))return{data:e,issues:t(i.invalid_type,n.messages.array.type()),typeOk:!1};let{data:r,issues:a}=this._parseItemsSync(e,n);return{data:r,issues:a,typeOk:!0}}async parseAsync(r,a){let s=a??o();return this._withCatchAsync(async()=>{let a=this._prepareInput(r);if(a.skip)return a.value;let o=a.value;if(!Array.isArray(o))throw new e(t(i.invalid_type,s.messages.array.type()));let c=await Promise.all(o.map(e=>this.itemSchema._parseFullAsync(e,s))),l=[],u=[];for(let e=0;e<c.length;e++){let t=c[e];t.issues.length===0?u.push(t.data):(l.push(...n(t.issues,e)),u.push(o[e]))}let d=await this._runValidatorsAsync(u,s),f=[...l,...d];if(f.length>0)throw new e(f);return this._runPostprocessors(u)})}min(e,n){return this._addConstraint((a,o)=>a.length>=e?null:t(i.too_small,r(n??o.messages.array.min,{min:e,value:a}),{min:e}),t=>{let n=t;return{...n,minItems:n.minItems===void 0?e:Math.max(n.minItems,e)}})}max(e,n){return this._addConstraint((a,o)=>a.length<=e?null:t(i.too_big,r(n??o.messages.array.max,{max:e,value:a}),{max:e}),t=>{let n=t;return{...n,maxItems:n.maxItems===void 0?e:Math.min(n.maxItems,e)}})}length(e,n){return this._addConstraint((a,o)=>a.length===e?null:t(i.invalid_length,r(n??o.messages.array.length,{exact:e,value:a}),{exact:e}),t=>({...t,maxItems:e,minItems:e}))}nonEmpty(e){return this._addConstraint((n,a)=>{let o=n;return o.length>0?null:t(i.too_small,r(e??a.messages.array.nonEmpty,{min:1,value:o}),{min:1})})}unique(e,n){let a=typeof e==`function`&&e.length===2,o=a?e:null,s=a?n:typeof e==`function`?e:void 0;return this._addConstraint((e,n)=>{let a=e,c;return c=o?a.every((e,t)=>a.slice(0,t).every(t=>!o(e,t))):new Set(a).size===a.length,c?null:t(i.invalid_unique,r(s??n.messages.array.unique,{value:a}),{unique:!0})})}_toDescriptorImpl(){let e=this._annotations;return{...this._describeBase(),...e.maxItems===void 0?{}:{maxItems:e.maxItems},...e.minItems===void 0?{}:{minItems:e.minItems},items:this.itemSchema.definition(),kind:`array`}}_walk(e){let t=this.itemSchema.walk(e);return e.array?e.array(this,t):super._walk(e)}};export{s as ArraySchema};
 //# sourceMappingURL=array.js.map

package/dist/schemas/array.js.map

@@ -1 +1 @@
-{"version":3,"file":"array.js","names":[],"sources":["../../src/schemas/array.ts"],"sourcesContent":["import type {\n  AnySchema,\n  CheckContext,\n  InferOutput,\n  InferSchemaMode,\n  Issue,\n  MergeSchemaModes,\n  MessageFn,\n  ParseContext,\n  ParseValue,\n  SchemaDescriptor,\n  SchemaMode,\n  SchemaWalker,\n  ValidateResult,\n} from '../core';\n\nimport { _makeCtx, ErrorCode, fail, prependIssuePath, resolveMessage, Schema, SpellValidationError } from '../core';\n\n/* -------------------- Typed annotations -------------------- */\n\ninterface ArrayAnnotations extends Record<string, unknown> {\n  maxItems?: number;\n  minItems?: number;\n}\n\nexport class ArraySchema<\n  T extends AnySchema,\n  Mode extends SchemaMode = MergeSchemaModes<InferSchemaMode<T>>,\n> extends Schema<InferOutput<T>[], unknown, Mode> {\n  readonly itemSchema: T;\n\n  protected override get _kind(): string {\n    return 'array';\n  }\n\n  override checkAsync(\n    this: ArraySchema<T, 'sync'>,\n    fn: (value: InferOutput<T>[], ctx: CheckContext) => Promise<ValidateResult>,\n  ): ArraySchema<T, 'async'> {\n    return this._addCheck(fn, true) as unknown as ArraySchema<T, 'async'>;\n  }\n\n  constructor(itemSchema: T) {\n    super();\n    this.itemSchema = itemSchema;\n  }\n\n  private _parseItemsSync(items: unknown[], ctx: ParseContext): { data: InferOutput<T>[]; issues: Issue[] } {\n    const issues: Issue[] = [];\n    const parsed: InferOutput<T>[] = [];\n\n    for (let i = 0; i < items.length; i++) {\n      const result = this.itemSchema._parseFullSync(items[i], ctx);\n\n      if (result.issues.length === 0) {\n        parsed.push(result.data as InferOutput<T>);\n      } else {\n        issues.push(...prependIssuePath(result.issues, i));\n        parsed.push(items[i] as InferOutput<T>);\n      }\n    }\n\n    return { data: parsed, issues };\n  }\n\n  protected override _parse(value: unknown, ctx: ParseContext): ParseValue {\n    if (!Array.isArray(value)) {\n      return { data: value, issues: fail(ErrorCode.invalid_type, ctx.messages.array.type()), typeOk: false };\n    }\n\n    const { data: items, issues } = this._parseItemsSync(value, ctx);\n\n    return { data: items, issues, typeOk: true };\n  }\n\n  override async parseAsync(value: unknown, ctx?: ParseContext): Promise<InferOutput<T>[]> {\n    const c = ctx ?? _makeCtx();\n\n    return this._withCatchAsync<InferOutput<T>[]>(async () => {\n      const prepared = this._prepareInput(value);\n\n      if (prepared.skip) return prepared.value as unknown as InferOutput<T>[];\n\n      const raw = prepared.value;\n\n      if (!Array.isArray(raw)) {\n        throw new SpellValidationError(fail(ErrorCode.invalid_type, c.messages.array.type()));\n      }\n\n      const settled = await Promise.all(raw.map((item) => this.itemSchema._parseFullAsync(item, c)));\n\n      const issues: Issue[] = [];\n      const parsed: InferOutput<T>[] = [];\n\n      for (let i = 0; i < settled.length; i++) {\n        const result = settled[i];\n\n        if (result.issues.length === 0) {\n          parsed.push(result.data as InferOutput<T>);\n        } else {\n          issues.push(...prependIssuePath(result.issues, i));\n          parsed.push(raw[i] as InferOutput<T>);\n        }\n      }\n\n      const validationIssues = await this._runValidatorsAsync(parsed, c);\n      const allIssues = [...issues, ...validationIssues];\n\n      if (allIssues.length > 0) throw new SpellValidationError(allIssues);\n\n      return this._runPostprocessors(parsed) as InferOutput<T>[];\n    });\n  }\n\n  min(length: number, message?: MessageFn<{ min: number; value: unknown[] }>): this {\n    return this._addConstraint(\n      (value, ctx) => {\n        if ((value as unknown[]).length >= length) return null;\n\n        return fail(\n          ErrorCode.too_small,\n          resolveMessage(message ?? ctx!.messages.array.min, { min: length, value: value as unknown[] }),\n          {\n            min: length,\n          },\n        );\n      },\n      (current) => {\n        const ann = current as ArrayAnnotations;\n\n        return {\n          ...ann,\n          minItems: ann.minItems === undefined ? length : Math.max(ann.minItems, length),\n        };\n      },\n    );\n  }\n\n  max(length: number, message?: MessageFn<{ max: number; value: unknown[] }>): this {\n    return this._addConstraint(\n      (value, ctx) => {\n        if ((value as unknown[]).length <= length) return null;\n\n        return fail(\n          ErrorCode.too_big,\n          resolveMessage(message ?? ctx!.messages.array.max, { max: length, value: value as unknown[] }),\n          {\n            max: length,\n          },\n        );\n      },\n      (current) => {\n        const ann = current as ArrayAnnotations;\n\n        return {\n          ...ann,\n          maxItems: ann.maxItems === undefined ? length : Math.min(ann.maxItems, length),\n        };\n      },\n    );\n  }\n\n  length(exact: number, message?: MessageFn<{ exact: number; value: unknown[] }>): this {\n    return this._addConstraint(\n      (value, ctx) => {\n        if ((value as unknown[]).length === exact) return null;\n\n        return fail(\n          ErrorCode.invalid_length,\n          resolveMessage(message ?? ctx!.messages.array.length, { exact, value: value as unknown[] }),\n          { exact },\n        );\n      },\n      (ann) => ({ ...ann, maxItems: exact, minItems: exact }),\n    );\n  }\n\n  nonEmpty(message?: MessageFn<{ min: number; value: unknown[] }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as unknown[];\n\n      return typed.length > 0\n        ? null\n        : fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.array.nonEmpty, { min: 1, value: typed }), {\n            min: 1,\n          });\n    });\n  }\n\n  /**\n   * Validates that all array elements are unique.\n   *\n   * **Default behaviour:** Uniqueness is checked using JavaScript `Set` semantics, which means\n   * **referential equality** for objects. Two structurally identical objects such as\n   * `{ id: 1 }` and `{ id: 1 }` are considered different values and will not be\n   * flagged as duplicates.\n   *\n   * **Custom equality:** Pass an `equalsFn` to use structural or domain-specific comparison\n   * logic (e.g. compare by a specific field, or use deep equality).\n   *\n   * @example\n   * s.array(s.object({ id: s.number() })).unique((a, b) => a.id === b.id)\n   */\n  unique(\n    equalsFnOrMessage?: ((a: InferOutput<T>, b: InferOutput<T>) => boolean) | MessageFn<{ value: unknown[] }>,\n    message?: MessageFn<{ value: unknown[] }>,\n  ): this {\n    const isCustomEqualsFn = typeof equalsFnOrMessage === 'function' && equalsFnOrMessage.length === 2;\n    const equalsFn = isCustomEqualsFn ? (equalsFnOrMessage as (a: InferOutput<T>, b: InferOutput<T>) => boolean) : null;\n    const resolvedMessage = isCustomEqualsFn\n      ? message\n      : typeof equalsFnOrMessage === 'function'\n        ? (equalsFnOrMessage as MessageFn<{ value: unknown[] }>)\n        : undefined;\n\n    return this._addConstraint((value, ctx) => {\n      const typed = value as InferOutput<T>[];\n      let isUnique: boolean;\n\n      if (equalsFn) {\n        isUnique = typed.every((a, i) => typed.slice(0, i).every((b) => !equalsFn(a, b)));\n      } else {\n        isUnique = new Set(typed).size === typed.length;\n      }\n\n      if (isUnique) return null;\n\n      return fail(\n        ErrorCode.invalid_unique,\n        resolveMessage(resolvedMessage ?? ctx!.messages.array.unique, { value: typed as unknown[] }),\n        {\n          unique: true,\n        },\n      );\n    });\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    const ann = this._annotations as ArrayAnnotations;\n\n    return {\n      ...this._describeBase(),\n      ...(ann.maxItems !== undefined ? { maxItems: ann.maxItems } : {}),\n      ...(ann.minItems !== undefined ? { minItems: ann.minItems } : {}),\n      items: this.itemSchema.definition(),\n      kind: 'array',\n    };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    const item = this.itemSchema.walk(visitor);\n\n    if (visitor.array) return visitor.array(this, item);\n\n    return super._walk(visitor);\n  }\n}\n"],"mappings":"kMAyBA,IAAa,EAAb,cAGU,CAAwC,CAChD,WAEA,IAAuB,OAAgB,CACrC,MAAO,OACT,CAEA,WAEE,EACyB,CACzB,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,YAAY,EAAe,CACzB,MAAM,EACN,KAAK,WAAa,CACpB,CAEA,gBAAwB,EAAkB,EAAgE,CACxG,IAAM,EAAkB,CAAC,EACnB,EAA2B,CAAC,EAElC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACrC,IAAM,EAAS,KAAK,WAAW,eAAe,EAAM,GAAI,CAAG,EAEvD,EAAO,OAAO,SAAW,EAC3B,EAAO,KAAK,EAAO,IAAsB,GAEzC,EAAO,KAAK,GAAG,EAAiB,EAAO,OAAQ,CAAC,CAAC,EACjD,EAAO,KAAK,EAAM,EAAoB,EAE1C,CAEA,MAAO,CAAE,KAAM,EAAQ,QAAO,CAChC,CAEA,OAA0B,EAAgB,EAA+B,CACvE,GAAI,CAAC,MAAM,QAAQ,CAAK,EACtB,MAAO,CAAE,KAAM,EAAO,OAAQ,EAAK,EAAU,aAAc,EAAI,SAAS,MAAM,KAAK,CAAC,EAAG,OAAQ,EAAM,EAGvG,GAAM,CAAE,KAAM,EAAO,UAAW,KAAK,gBAAgB,EAAO,CAAG,EAE/D,MAAO,CAAE,KAAM,EAAO,SAAQ,OAAQ,EAAK,CAC7C,CAEA,MAAe,WAAW,EAAgB,EAA+C,CACvF,IAAM,EAAI,GAAO,EAAS,EAE1B,OAAO,KAAK,gBAAkC,SAAY,CACxD,IAAM,EAAW,KAAK,cAAc,CAAK,EAEzC,GAAI,EAAS,KAAM,OAAO,EAAS,MAEnC,IAAM,EAAM,EAAS,MAErB,GAAI,CAAC,MAAM,QAAQ,CAAG,EACpB,MAAM,IAAI,EAAqB,EAAK,EAAU,aAAc,EAAE,SAAS,MAAM,KAAK,CAAC,CAAC,EAGtF,IAAM,EAAU,MAAM,QAAQ,IAAI,EAAI,IAAK,GAAS,KAAK,WAAW,gBAAgB,EAAM,CAAC,CAAC,CAAC,EAEvF,EAAkB,CAAC,EACnB,EAA2B,CAAC,EAElC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAAK,CACvC,IAAM,EAAS,EAAQ,GAEnB,EAAO,OAAO,SAAW,EAC3B,EAAO,KAAK,EAAO,IAAsB,GAEzC,EAAO,KAAK,GAAG,EAAiB,EAAO,OAAQ,CAAC,CAAC,EACjD,EAAO,KAAK,EAAI,EAAoB,EAExC,CAEA,IAAM,EAAmB,MAAM,KAAK,oBAAoB,EAAQ,CAAC,EAC3D,EAAY,CAAC,GAAG,EAAQ,GAAG,CAAgB,EAEjD,GAAI,EAAU,OAAS,EAAG,MAAM,IAAI,EAAqB,CAAS,EAElE,OAAO,KAAK,mBAAmB,CAAM,CACvC,CAAC,CACH,CAEA,IAAI,EAAgB,EAA8D,CAChF,OAAO,KAAK,gBACT,EAAO,IACD,EAAoB,QAAU,EAAe,KAE3C,EACL,EAAU,UACV,EAAe,GAAW,EAAK,SAAS,MAAM,IAAK,CAAE,IAAK,EAAe,OAAmB,CAAC,EAC7F,CACE,IAAK,CACP,CACF,EAED,GAAY,CACX,IAAM,EAAM,EAEZ,MAAO,CACL,GAAG,EACH,SAAU,EAAI,WAAa,IAAA,GAAY,EAAS,KAAK,IAAI,EAAI,SAAU,CAAM,CAC/E,CACF,CACF,CACF,CAEA,IAAI,EAAgB,EAA8D,CAChF,OAAO,KAAK,gBACT,EAAO,IACD,EAAoB,QAAU,EAAe,KAE3C,EACL,EAAU,QACV,EAAe,GAAW,EAAK,SAAS,MAAM,IAAK,CAAE,IAAK,EAAe,OAAmB,CAAC,EAC7F,CACE,IAAK,CACP,CACF,EAED,GAAY,CACX,IAAM,EAAM,EAEZ,MAAO,CACL,GAAG,EACH,SAAU,EAAI,WAAa,IAAA,GAAY,EAAS,KAAK,IAAI,EAAI,SAAU,CAAM,CAC/E,CACF,CACF,CACF,CAEA,OAAO,EAAe,EAAgE,CACpF,OAAO,KAAK,gBACT,EAAO,IACD,EAAoB,SAAW,EAAc,KAE3C,EACL,EAAU,eACV,EAAe,GAAW,EAAK,SAAS,MAAM,OAAQ,CAAE,QAAc,OAAmB,CAAC,EAC1F,CAAE,OAAM,CACV,EAED,IAAS,CAAE,GAAG,EAAK,SAAU,EAAO,SAAU,CAAM,EACvD,CACF,CAEA,SAAS,EAA8D,CACrE,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAEd,OAAO,EAAM,OAAS,EAClB,KACA,EAAK,EAAU,UAAW,EAAe,GAAW,EAAK,SAAS,MAAM,SAAU,CAAE,IAAK,EAAG,MAAO,CAAM,CAAC,EAAG,CAC3G,IAAK,CACP,CAAC,CACP,CAAC,CACH,CAgBA,OACE,EACA,EACM,CACN,IAAM,EAAmB,OAAO,GAAsB,YAAc,EAAkB,SAAW,EAC3F,EAAW,EAAoB,EAA0E,KACzG,EAAkB,EACpB,EACA,OAAO,GAAsB,WAC1B,EACD,IAAA,GAEN,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EACV,EAUJ,MARA,CAGE,EAHE,EACS,EAAM,OAAO,EAAG,IAAM,EAAM,MAAM,EAAG,CAAC,CAAC,CAAC,MAAO,GAAM,CAAC,EAAS,EAAG,CAAC,CAAC,CAAC,EAErE,IAAI,IAAI,CAAK,CAAC,CAAC,OAAS,EAAM,OAGvC,EAAiB,KAEd,EACL,EAAU,eACV,EAAe,GAAmB,EAAK,SAAS,MAAM,OAAQ,CAAE,MAAO,CAAmB,CAAC,EAC3F,CACE,OAAQ,EACV,CACF,CACF,CAAC,CACH,CAEA,mBAAyD,CACvD,IAAM,EAAM,KAAK,aAEjB,MAAO,CACL,GAAG,KAAK,cAAc,EACtB,GAAI,EAAI,WAAa,IAAA,GAAyC,CAAC,EAA9B,CAAE,SAAU,EAAI,QAAS,EAC1D,GAAI,EAAI,WAAa,IAAA,GAAyC,CAAC,EAA9B,CAAE,SAAU,EAAI,QAAS,EAC1D,MAAO,KAAK,WAAW,WAAW,EAClC,KAAM,OACR,CACF,CAEA,MAA4B,EAAoC,CAC9D,IAAM,EAAO,KAAK,WAAW,KAAK,CAAO,EAIzC,OAFI,EAAQ,MAAc,EAAQ,MAAM,KAAM,CAAI,EAE3C,MAAM,MAAM,CAAO,CAC5B,CACF"}
+{"version":3,"file":"array.js","names":[],"sources":["../../src/schemas/array.ts"],"sourcesContent":["import type {\n  AnySchema,\n  CheckContext,\n  InferInput,\n  InferOutput,\n  InferSchemaMode,\n  Issue,\n  MergeSchemaModes,\n  MessageFn,\n  ParseContext,\n  ParseValue,\n  SchemaDescriptor,\n  SchemaMode,\n  SchemaWalker,\n  ValidateResult,\n} from '../core';\n\nimport { _makeCtx, ErrorCode, fail, prependIssuePath, resolveMessage, Schema, SpellValidationError } from '../core';\n\n/* -------------------- Typed annotations -------------------- */\n\ninterface ArrayAnnotations extends Record<string, unknown> {\n  maxItems?: number;\n  minItems?: number;\n}\n\nexport class ArraySchema<\n  T extends AnySchema,\n  Mode extends SchemaMode = MergeSchemaModes<InferSchemaMode<T>>,\n> extends Schema<InferOutput<T>[], InferInput<T>[], Mode> {\n  readonly itemSchema: T;\n\n  protected override get _kind(): string {\n    return 'array';\n  }\n\n  override checkAsync(\n    this: ArraySchema<T, 'sync'>,\n    fn: (value: InferOutput<T>[], ctx: CheckContext) => Promise<ValidateResult>,\n  ): ArraySchema<T, 'async'> {\n    return this._addCheck(fn, true) as unknown as ArraySchema<T, 'async'>;\n  }\n\n  constructor(itemSchema: T) {\n    super();\n    this.itemSchema = itemSchema;\n  }\n\n  private _parseItemsSync(items: unknown[], ctx: ParseContext): { data: InferOutput<T>[]; issues: Issue[] } {\n    const issues: Issue[] = [];\n    const parsed: InferOutput<T>[] = [];\n\n    for (let i = 0; i < items.length; i++) {\n      const result = this.itemSchema._parseFullSync(items[i], ctx);\n\n      if (result.issues.length === 0) {\n        parsed.push(result.data as InferOutput<T>);\n      } else {\n        issues.push(...prependIssuePath(result.issues, i));\n        parsed.push(items[i] as InferOutput<T>);\n      }\n    }\n\n    return { data: parsed, issues };\n  }\n\n  protected override _parse(value: unknown, ctx: ParseContext): ParseValue {\n    if (!Array.isArray(value)) {\n      return { data: value, issues: fail(ErrorCode.invalid_type, ctx.messages.array.type()), typeOk: false };\n    }\n\n    const { data: items, issues } = this._parseItemsSync(value, ctx);\n\n    return { data: items, issues, typeOk: true };\n  }\n\n  override async parseAsync(value: unknown, ctx?: ParseContext): Promise<InferOutput<T>[]> {\n    const c = ctx ?? _makeCtx();\n\n    return this._withCatchAsync<InferOutput<T>[]>(async () => {\n      const prepared = this._prepareInput(value);\n\n      if (prepared.skip) return prepared.value as unknown as InferOutput<T>[];\n\n      const raw = prepared.value;\n\n      if (!Array.isArray(raw)) {\n        throw new SpellValidationError(fail(ErrorCode.invalid_type, c.messages.array.type()));\n      }\n\n      const settled = await Promise.all(raw.map((item) => this.itemSchema._parseFullAsync(item, c)));\n\n      const issues: Issue[] = [];\n      const parsed: InferOutput<T>[] = [];\n\n      for (let i = 0; i < settled.length; i++) {\n        const result = settled[i];\n\n        if (result.issues.length === 0) {\n          parsed.push(result.data as InferOutput<T>);\n        } else {\n          issues.push(...prependIssuePath(result.issues, i));\n          parsed.push(raw[i] as InferOutput<T>);\n        }\n      }\n\n      const validationIssues = await this._runValidatorsAsync(parsed, c);\n      const allIssues = [...issues, ...validationIssues];\n\n      if (allIssues.length > 0) throw new SpellValidationError(allIssues);\n\n      return this._runPostprocessors(parsed) as InferOutput<T>[];\n    });\n  }\n\n  min(length: number, message?: MessageFn<{ min: number; value: unknown[] }>): this {\n    return this._addConstraint(\n      (value, ctx) => {\n        if ((value as unknown[]).length >= length) return null;\n\n        return fail(\n          ErrorCode.too_small,\n          resolveMessage(message ?? ctx!.messages.array.min, { min: length, value: value as unknown[] }),\n          {\n            min: length,\n          },\n        );\n      },\n      (current) => {\n        const ann = current as ArrayAnnotations;\n\n        return {\n          ...ann,\n          minItems: ann.minItems === undefined ? length : Math.max(ann.minItems, length),\n        };\n      },\n    );\n  }\n\n  max(length: number, message?: MessageFn<{ max: number; value: unknown[] }>): this {\n    return this._addConstraint(\n      (value, ctx) => {\n        if ((value as unknown[]).length <= length) return null;\n\n        return fail(\n          ErrorCode.too_big,\n          resolveMessage(message ?? ctx!.messages.array.max, { max: length, value: value as unknown[] }),\n          {\n            max: length,\n          },\n        );\n      },\n      (current) => {\n        const ann = current as ArrayAnnotations;\n\n        return {\n          ...ann,\n          maxItems: ann.maxItems === undefined ? length : Math.min(ann.maxItems, length),\n        };\n      },\n    );\n  }\n\n  length(exact: number, message?: MessageFn<{ exact: number; value: unknown[] }>): this {\n    return this._addConstraint(\n      (value, ctx) => {\n        if ((value as unknown[]).length === exact) return null;\n\n        return fail(\n          ErrorCode.invalid_length,\n          resolveMessage(message ?? ctx!.messages.array.length, { exact, value: value as unknown[] }),\n          { exact },\n        );\n      },\n      (ann) => ({ ...ann, maxItems: exact, minItems: exact }),\n    );\n  }\n\n  nonEmpty(message?: MessageFn<{ min: number; value: unknown[] }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as unknown[];\n\n      return typed.length > 0\n        ? null\n        : fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.array.nonEmpty, { min: 1, value: typed }), {\n            min: 1,\n          });\n    });\n  }\n\n  /**\n   * Validates that all array elements are unique.\n   *\n   * **Default behaviour:** Uniqueness is checked using JavaScript `Set` semantics, which means\n   * **referential equality** for objects. Two structurally identical objects such as\n   * `{ id: 1 }` and `{ id: 1 }` are considered different values and will not be\n   * flagged as duplicates.\n   *\n   * **Custom equality:** Pass an `equalsFn` to use structural or domain-specific comparison\n   * logic (e.g. compare by a specific field, or use deep equality).\n   *\n   * @example\n   * s.array(s.object({ id: s.number() })).unique((a, b) => a.id === b.id)\n   */\n  unique(\n    equalsFnOrMessage?: ((a: InferOutput<T>, b: InferOutput<T>) => boolean) | MessageFn<{ value: unknown[] }>,\n    message?: MessageFn<{ value: unknown[] }>,\n  ): this {\n    const isCustomEqualsFn = typeof equalsFnOrMessage === 'function' && equalsFnOrMessage.length === 2;\n    const equalsFn = isCustomEqualsFn ? (equalsFnOrMessage as (a: InferOutput<T>, b: InferOutput<T>) => boolean) : null;\n    const resolvedMessage = isCustomEqualsFn\n      ? message\n      : typeof equalsFnOrMessage === 'function'\n        ? (equalsFnOrMessage as MessageFn<{ value: unknown[] }>)\n        : undefined;\n\n    return this._addConstraint((value, ctx) => {\n      const typed = value as InferOutput<T>[];\n      let isUnique: boolean;\n\n      if (equalsFn) {\n        isUnique = typed.every((a, i) => typed.slice(0, i).every((b) => !equalsFn(a, b)));\n      } else {\n        isUnique = new Set(typed).size === typed.length;\n      }\n\n      if (isUnique) return null;\n\n      return fail(\n        ErrorCode.invalid_unique,\n        resolveMessage(resolvedMessage ?? ctx!.messages.array.unique, { value: typed as unknown[] }),\n        {\n          unique: true,\n        },\n      );\n    });\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    const ann = this._annotations as ArrayAnnotations;\n\n    return {\n      ...this._describeBase(),\n      ...(ann.maxItems !== undefined ? { maxItems: ann.maxItems } : {}),\n      ...(ann.minItems !== undefined ? { minItems: ann.minItems } : {}),\n      items: this.itemSchema.definition(),\n      kind: 'array',\n    };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    const item = this.itemSchema.walk(visitor);\n\n    if (visitor.array) return visitor.array(this, item);\n\n    return super._walk(visitor);\n  }\n}\n"],"mappings":"kMA0BA,IAAa,EAAb,cAGU,CAAgD,CACxD,WAEA,IAAuB,OAAgB,CACrC,MAAO,OACT,CAEA,WAEE,EACyB,CACzB,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,YAAY,EAAe,CACzB,MAAM,EACN,KAAK,WAAa,CACpB,CAEA,gBAAwB,EAAkB,EAAgE,CACxG,IAAM,EAAkB,CAAC,EACnB,EAA2B,CAAC,EAElC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACrC,IAAM,EAAS,KAAK,WAAW,eAAe,EAAM,GAAI,CAAG,EAEvD,EAAO,OAAO,SAAW,EAC3B,EAAO,KAAK,EAAO,IAAsB,GAEzC,EAAO,KAAK,GAAG,EAAiB,EAAO,OAAQ,CAAC,CAAC,EACjD,EAAO,KAAK,EAAM,EAAoB,EAE1C,CAEA,MAAO,CAAE,KAAM,EAAQ,QAAO,CAChC,CAEA,OAA0B,EAAgB,EAA+B,CACvE,GAAI,CAAC,MAAM,QAAQ,CAAK,EACtB,MAAO,CAAE,KAAM,EAAO,OAAQ,EAAK,EAAU,aAAc,EAAI,SAAS,MAAM,KAAK,CAAC,EAAG,OAAQ,EAAM,EAGvG,GAAM,CAAE,KAAM,EAAO,UAAW,KAAK,gBAAgB,EAAO,CAAG,EAE/D,MAAO,CAAE,KAAM,EAAO,SAAQ,OAAQ,EAAK,CAC7C,CAEA,MAAe,WAAW,EAAgB,EAA+C,CACvF,IAAM,EAAI,GAAO,EAAS,EAE1B,OAAO,KAAK,gBAAkC,SAAY,CACxD,IAAM,EAAW,KAAK,cAAc,CAAK,EAEzC,GAAI,EAAS,KAAM,OAAO,EAAS,MAEnC,IAAM,EAAM,EAAS,MAErB,GAAI,CAAC,MAAM,QAAQ,CAAG,EACpB,MAAM,IAAI,EAAqB,EAAK,EAAU,aAAc,EAAE,SAAS,MAAM,KAAK,CAAC,CAAC,EAGtF,IAAM,EAAU,MAAM,QAAQ,IAAI,EAAI,IAAK,GAAS,KAAK,WAAW,gBAAgB,EAAM,CAAC,CAAC,CAAC,EAEvF,EAAkB,CAAC,EACnB,EAA2B,CAAC,EAElC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAAK,CACvC,IAAM,EAAS,EAAQ,GAEnB,EAAO,OAAO,SAAW,EAC3B,EAAO,KAAK,EAAO,IAAsB,GAEzC,EAAO,KAAK,GAAG,EAAiB,EAAO,OAAQ,CAAC,CAAC,EACjD,EAAO,KAAK,EAAI,EAAoB,EAExC,CAEA,IAAM,EAAmB,MAAM,KAAK,oBAAoB,EAAQ,CAAC,EAC3D,EAAY,CAAC,GAAG,EAAQ,GAAG,CAAgB,EAEjD,GAAI,EAAU,OAAS,EAAG,MAAM,IAAI,EAAqB,CAAS,EAElE,OAAO,KAAK,mBAAmB,CAAM,CACvC,CAAC,CACH,CAEA,IAAI,EAAgB,EAA8D,CAChF,OAAO,KAAK,gBACT,EAAO,IACD,EAAoB,QAAU,EAAe,KAE3C,EACL,EAAU,UACV,EAAe,GAAW,EAAK,SAAS,MAAM,IAAK,CAAE,IAAK,EAAe,OAAmB,CAAC,EAC7F,CACE,IAAK,CACP,CACF,EAED,GAAY,CACX,IAAM,EAAM,EAEZ,MAAO,CACL,GAAG,EACH,SAAU,EAAI,WAAa,IAAA,GAAY,EAAS,KAAK,IAAI,EAAI,SAAU,CAAM,CAC/E,CACF,CACF,CACF,CAEA,IAAI,EAAgB,EAA8D,CAChF,OAAO,KAAK,gBACT,EAAO,IACD,EAAoB,QAAU,EAAe,KAE3C,EACL,EAAU,QACV,EAAe,GAAW,EAAK,SAAS,MAAM,IAAK,CAAE,IAAK,EAAe,OAAmB,CAAC,EAC7F,CACE,IAAK,CACP,CACF,EAED,GAAY,CACX,IAAM,EAAM,EAEZ,MAAO,CACL,GAAG,EACH,SAAU,EAAI,WAAa,IAAA,GAAY,EAAS,KAAK,IAAI,EAAI,SAAU,CAAM,CAC/E,CACF,CACF,CACF,CAEA,OAAO,EAAe,EAAgE,CACpF,OAAO,KAAK,gBACT,EAAO,IACD,EAAoB,SAAW,EAAc,KAE3C,EACL,EAAU,eACV,EAAe,GAAW,EAAK,SAAS,MAAM,OAAQ,CAAE,QAAc,OAAmB,CAAC,EAC1F,CAAE,OAAM,CACV,EAED,IAAS,CAAE,GAAG,EAAK,SAAU,EAAO,SAAU,CAAM,EACvD,CACF,CAEA,SAAS,EAA8D,CACrE,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAEd,OAAO,EAAM,OAAS,EAClB,KACA,EAAK,EAAU,UAAW,EAAe,GAAW,EAAK,SAAS,MAAM,SAAU,CAAE,IAAK,EAAG,MAAO,CAAM,CAAC,EAAG,CAC3G,IAAK,CACP,CAAC,CACP,CAAC,CACH,CAgBA,OACE,EACA,EACM,CACN,IAAM,EAAmB,OAAO,GAAsB,YAAc,EAAkB,SAAW,EAC3F,EAAW,EAAoB,EAA0E,KACzG,EAAkB,EACpB,EACA,OAAO,GAAsB,WAC1B,EACD,IAAA,GAEN,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EACV,EAUJ,MARA,CAGE,EAHE,EACS,EAAM,OAAO,EAAG,IAAM,EAAM,MAAM,EAAG,CAAC,CAAC,CAAC,MAAO,GAAM,CAAC,EAAS,EAAG,CAAC,CAAC,CAAC,EAErE,IAAI,IAAI,CAAK,CAAC,CAAC,OAAS,EAAM,OAGvC,EAAiB,KAEd,EACL,EAAU,eACV,EAAe,GAAmB,EAAK,SAAS,MAAM,OAAQ,CAAE,MAAO,CAAmB,CAAC,EAC3F,CACE,OAAQ,EACV,CACF,CACF,CAAC,CACH,CAEA,mBAAyD,CACvD,IAAM,EAAM,KAAK,aAEjB,MAAO,CACL,GAAG,KAAK,cAAc,EACtB,GAAI,EAAI,WAAa,IAAA,GAAyC,CAAC,EAA9B,CAAE,SAAU,EAAI,QAAS,EAC1D,GAAI,EAAI,WAAa,IAAA,GAAyC,CAAC,EAA9B,CAAE,SAAU,EAAI,QAAS,EAC1D,MAAO,KAAK,WAAW,WAAW,EAClC,KAAM,OACR,CACF,CAEA,MAA4B,EAAoC,CAC9D,IAAM,EAAO,KAAK,WAAW,KAAK,CAAO,EAIzC,OAFI,EAAQ,MAAc,EAAQ,MAAM,KAAM,CAAI,EAE3C,MAAM,MAAM,CAAO,CAC5B,CACF"}

package/dist/schemas/bigint.cjs

@@ -1,2 +1,2 @@
-const e=require("../types.cjs"),t=require("../errors.cjs");require("../_dev.cjs");const n=require("../core.cjs");var r=class r extends n.Schema{get _kind(){return`bigint`}checkAsync(e){return this._addCheck(e,!0)}constructor(){super((n,r)=>typeof n==`bigint`?null:t.fail(e.ErrorCode.invalid_type,r.messages.bigint.type()))}min(n,r){return this._addConstraint((i,a)=>{let o=i;return o>=n?null:t.fail(e.ErrorCode.too_small,t.resolveMessage(r??a.messages.bigint.min,{min:n,value:o}),{min:n})})}max(n,r){return this._addConstraint((i,a)=>{let o=i;return o<=n?null:t.fail(e.ErrorCode.too_big,t.resolveMessage(r??a.messages.bigint.max,{max:n,value:o}),{max:n})})}positive(n){return this._addConstraint((r,i)=>{let a=r;return a>0n?null:t.fail(e.ErrorCode.too_small,t.resolveMessage(n??i.messages.bigint.positive,{value:a}),{exclusive:!0,min:0n})})}negative(n){return this._addConstraint((r,i)=>{let a=r;return a<0n?null:t.fail(e.ErrorCode.too_big,t.resolveMessage(n??i.messages.bigint.negative,{value:a}),{exclusive:!0,max:0n})})}nonNegative(n){return this._addConstraint((r,i)=>{let a=r;return a>=0n?null:t.fail(e.ErrorCode.too_small,t.resolveMessage(n??i.messages.bigint.nonNegative,{value:a}),{min:0n})})}nonPositive(n){return this._addConstraint((r,i)=>{let a=r;return a<=0n?null:t.fail(e.ErrorCode.too_big,t.resolveMessage(n??i.messages.bigint.nonPositive,{value:a}),{max:0n})})}multipleOf(n,r){return this._addConstraint((i,a)=>{let o=i;return o%n===0n?null:t.fail(e.ErrorCode.invalid_multiple_of,t.resolveMessage(r??a.messages.bigint.multipleOf,{step:n,value:o}),{step:n})})}_walk(e){return e.bigint?e.bigint(this):super._walk(e)}coerce(){return r.coerce()}_toDescriptorImpl(){return this.state.validators.length,{...this._describeBase(),kind:`bigint`}}static coerce(){return new r().preprocess(e=>{if(typeof e==`bigint`)return e;if(typeof e==`number`){if(!Number.isFinite(e)||!Number.isInteger(e))return e;try{return BigInt(e)}catch{return e}}if(typeof e==`string`){let t=e.trim();if(t.length===0||t.length>1e3)return e;try{return BigInt(t)}catch{return e}}return e})}};exports.BigIntSchema=r;
+const e=require("../errors.cjs");require("../_dev.cjs");const t=require("../types.cjs"),n=require("../core.cjs");var r=class r extends n.Schema{get _kind(){return`bigint`}checkAsync(e){return this._addCheck(e,!0)}constructor(){super((n,r)=>typeof n==`bigint`?null:e.fail(t.ErrorCode.invalid_type,r.messages.bigint.type()))}min(n,r){return this._addConstraint((i,a)=>{let o=i;return o>=n?null:e.fail(t.ErrorCode.too_small,e.resolveMessage(r??a.messages.bigint.min,{min:n,value:o}),{min:n})})}max(n,r){return this._addConstraint((i,a)=>{let o=i;return o<=n?null:e.fail(t.ErrorCode.too_big,e.resolveMessage(r??a.messages.bigint.max,{max:n,value:o}),{max:n})})}positive(n){return this._addConstraint((r,i)=>{let a=r;return a>0n?null:e.fail(t.ErrorCode.too_small,e.resolveMessage(n??i.messages.bigint.positive,{value:a}),{exclusive:!0,min:0n})})}negative(n){return this._addConstraint((r,i)=>{let a=r;return a<0n?null:e.fail(t.ErrorCode.too_big,e.resolveMessage(n??i.messages.bigint.negative,{value:a}),{exclusive:!0,max:0n})})}nonNegative(n){return this._addConstraint((r,i)=>{let a=r;return a>=0n?null:e.fail(t.ErrorCode.too_small,e.resolveMessage(n??i.messages.bigint.nonNegative,{value:a}),{min:0n})})}nonPositive(n){return this._addConstraint((r,i)=>{let a=r;return a<=0n?null:e.fail(t.ErrorCode.too_big,e.resolveMessage(n??i.messages.bigint.nonPositive,{value:a}),{max:0n})})}multipleOf(n,r){return this._addConstraint((i,a)=>{let o=i;return o%n===0n?null:e.fail(t.ErrorCode.invalid_multiple_of,e.resolveMessage(r??a.messages.bigint.multipleOf,{step:n,value:o}),{step:n})})}_walk(e){return e.bigint?e.bigint(this):super._walk(e)}_toDescriptorImpl(){return this.state.validators.length,{...this._describeBase(),kind:`bigint`}}static coerce(){return new r().preprocess(e=>{if(typeof e==`bigint`)return e;if(typeof e==`number`){if(!Number.isFinite(e)||!Number.isInteger(e))return e;try{return BigInt(e)}catch{return e}}if(typeof e==`string`){let t=e.trim();if(t.length===0||t.length>1e3)return e;try{return BigInt(t)}catch{return e}}return e})}};exports.BigIntSchema=r;
 //# sourceMappingURL=bigint.cjs.map

package/dist/schemas/bigint.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"bigint.cjs","names":[],"sources":["../../src/schemas/bigint.ts"],"sourcesContent":["import { warn } from '../_dev';\nimport type { CheckContext, MessageFn, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';\nimport { ErrorCode, fail, resolveMessage, Schema } from '../core';\n\nexport class BigIntSchema<Input = bigint, Mode extends SchemaMode = 'sync'> extends Schema<bigint, Input, Mode> {\n  protected override get _kind(): string {\n    return 'bigint';\n  }\n\n  override checkAsync(\n    this: BigIntSchema<Input, 'sync'>,\n    fn: (value: bigint, ctx: CheckContext) => Promise<ValidateResult>,\n  ): BigIntSchema<Input, 'async'> {\n    return this._addCheck(fn, true) as unknown as BigIntSchema<Input, 'async'>;\n  }\n\n  constructor() {\n    super((value, ctx) =>\n      typeof value === 'bigint' ? null : fail(ErrorCode.invalid_type, ctx!.messages.bigint.type()),\n    );\n  }\n\n  min(minimum: bigint, message?: MessageFn<{ min: bigint; value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed >= minimum) return null;\n\n      return fail(\n        ErrorCode.too_small,\n        resolveMessage(message ?? ctx!.messages.bigint.min, { min: minimum, value: typed }),\n        { min: minimum },\n      );\n    });\n  }\n\n  max(maximum: bigint, message?: MessageFn<{ max: bigint; value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed <= maximum) return null;\n\n      return fail(\n        ErrorCode.too_big,\n        resolveMessage(message ?? ctx!.messages.bigint.max, { max: maximum, value: typed }),\n        { max: maximum },\n      );\n    });\n  }\n\n  positive(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed > 0n) return null;\n\n      return fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.bigint.positive, { value: typed }), {\n        exclusive: true,\n        min: 0n,\n      });\n    });\n  }\n\n  negative(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed < 0n) return null;\n\n      return fail(ErrorCode.too_big, resolveMessage(message ?? ctx!.messages.bigint.negative, { value: typed }), {\n        exclusive: true,\n        max: 0n,\n      });\n    });\n  }\n\n  nonNegative(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed >= 0n) return null;\n\n      return fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.bigint.nonNegative, { value: typed }), {\n        min: 0n,\n      });\n    });\n  }\n\n  nonPositive(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed <= 0n) return null;\n\n      return fail(ErrorCode.too_big, resolveMessage(message ?? ctx!.messages.bigint.nonPositive, { value: typed }), {\n        max: 0n,\n      });\n    });\n  }\n\n  multipleOf(step: bigint, message?: MessageFn<{ step: bigint; value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed % step === 0n) return null;\n\n      return fail(\n        ErrorCode.invalid_multiple_of,\n        resolveMessage(message ?? ctx!.messages.bigint.multipleOf, { step, value: typed }),\n        { step },\n      );\n    });\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    if (visitor.bigint) return visitor.bigint(this);\n\n    return super._walk(visitor);\n  }\n\n  /**\n   * Returns a new schema that coerces the input to a bigint before validation.\n   * Handles number, string (up to 1000 digits), and bigint inputs.\n   *\n   * Equivalent to `s.coerce.bigint()`.\n   */\n  coerce(): BigIntSchema<unknown> {\n    return BigIntSchema.coerce();\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    if (this.state.validators.length > 0) {\n      warn(\n        'definition(): this bigint schema has constraints (e.g. min(), max(), positive()). ' +\n          'BigInt constraints are not serializable and will not appear in the definition.',\n      );\n    }\n\n    return { ...this._describeBase(), kind: 'bigint' };\n  }\n\n  static coerce(): BigIntSchema<unknown> {\n    return new BigIntSchema().preprocess((value: unknown) => {\n      if (typeof value === 'bigint') return value;\n\n      if (typeof value === 'number') {\n        if (!Number.isFinite(value) || !Number.isInteger(value)) return value;\n\n        try {\n          return BigInt(value);\n        } catch {\n          return value;\n        }\n      }\n\n      if (typeof value === 'string') {\n        const trimmed = value.trim();\n\n        // Guard against DoS: BigInt() conversion is O(n²) in digit count.\n        if (trimmed.length === 0 || trimmed.length > 1000) return value;\n\n        try {\n          return BigInt(trimmed);\n        } catch {\n          return value;\n        }\n      }\n\n      return value;\n    });\n  }\n}\n"],"mappings":"iHAIA,IAAa,EAAb,MAAa,UAAuE,EAAA,MAA4B,CAC9G,IAAuB,OAAgB,CACrC,MAAO,QACT,CAEA,WAEE,EAC8B,CAC9B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,aAAc,CACZ,OAAO,EAAO,IACZ,OAAO,GAAU,SAAW,KAAO,EAAA,KAAK,EAAA,UAAU,aAAc,EAAK,SAAS,OAAO,KAAK,CAAC,CAC7F,CACF,CAEA,IAAI,EAAiB,EAA2D,CAC9E,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,EAAgB,KAEtB,EAAA,KACL,EAAA,UAAU,UACV,EAAA,eAAe,GAAW,EAAK,SAAS,OAAO,IAAK,CAAE,IAAK,EAAS,MAAO,CAAM,CAAC,EAClF,CAAE,IAAK,CAAQ,CACjB,CACF,CAAC,CACH,CAEA,IAAI,EAAiB,EAA2D,CAC9E,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,EAAgB,KAEtB,EAAA,KACL,EAAA,UAAU,QACV,EAAA,eAAe,GAAW,EAAK,SAAS,OAAO,IAAK,CAAE,IAAK,EAAS,MAAO,CAAM,CAAC,EAClF,CAAE,IAAK,CAAQ,CACjB,CACF,CAAC,CACH,CAEA,SAAS,EAA8C,CACrD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAQ,GAAW,KAEhB,EAAA,KAAK,EAAA,UAAU,UAAW,EAAA,eAAe,GAAW,EAAK,SAAS,OAAO,SAAU,CAAE,MAAO,CAAM,CAAC,EAAG,CAC3G,UAAW,GACX,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,SAAS,EAA8C,CACrD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAQ,GAAW,KAEhB,EAAA,KAAK,EAAA,UAAU,QAAS,EAAA,eAAe,GAAW,EAAK,SAAS,OAAO,SAAU,CAAE,MAAO,CAAM,CAAC,EAAG,CACzG,UAAW,GACX,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,YAAY,EAA8C,CACxD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,GAAW,KAEjB,EAAA,KAAK,EAAA,UAAU,UAAW,EAAA,eAAe,GAAW,EAAK,SAAS,OAAO,YAAa,CAAE,MAAO,CAAM,CAAC,EAAG,CAC9G,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,YAAY,EAA8C,CACxD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,GAAW,KAEjB,EAAA,KAAK,EAAA,UAAU,QAAS,EAAA,eAAe,GAAW,EAAK,SAAS,OAAO,YAAa,CAAE,MAAO,CAAM,CAAC,EAAG,CAC5G,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,WAAW,EAAc,EAA4D,CACnF,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAQ,IAAS,GAAW,KAEzB,EAAA,KACL,EAAA,UAAU,oBACV,EAAA,eAAe,GAAW,EAAK,SAAS,OAAO,WAAY,CAAE,OAAM,MAAO,CAAM,CAAC,EACjF,CAAE,MAAK,CACT,CACF,CAAC,CACH,CAEA,MAA4B,EAAoC,CAG9D,OAFI,EAAQ,OAAe,EAAQ,OAAO,IAAI,EAEvC,MAAM,MAAM,CAAO,CAC5B,CAQA,QAAgC,CAC9B,OAAO,EAAa,OAAO,CAC7B,CAEA,mBAAyD,CAQvD,OAPI,KAAK,MAAM,WAAW,OAOnB,CAAE,GAAG,KAAK,cAAc,EAAG,KAAM,QAAS,CACnD,CAEA,OAAO,QAAgC,CACrC,OAAO,IAAI,EAAa,CAAC,CAAC,WAAY,GAAmB,CACvD,GAAI,OAAO,GAAU,SAAU,OAAO,EAEtC,GAAI,OAAO,GAAU,SAAU,CAC7B,GAAI,CAAC,OAAO,SAAS,CAAK,GAAK,CAAC,OAAO,UAAU,CAAK,EAAG,OAAO,EAEhE,GAAI,CACF,OAAO,OAAO,CAAK,CACrB,MAAQ,CACN,OAAO,CACT,CACF,CAEA,GAAI,OAAO,GAAU,SAAU,CAC7B,IAAM,EAAU,EAAM,KAAK,EAG3B,GAAI,EAAQ,SAAW,GAAK,EAAQ,OAAS,IAAM,OAAO,EAE1D,GAAI,CACF,OAAO,OAAO,CAAO,CACvB,MAAQ,CACN,OAAO,CACT,CACF,CAEA,OAAO,CACT,CAAC,CACH,CACF"}
+{"version":3,"file":"bigint.cjs","names":[],"sources":["../../src/schemas/bigint.ts"],"sourcesContent":["import { warn } from '../_dev';\nimport type { CheckContext, MessageFn, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';\nimport { ErrorCode, fail, resolveMessage, Schema } from '../core';\n\nexport class BigIntSchema<Input = bigint, Mode extends SchemaMode = 'sync'> extends Schema<bigint, Input, Mode> {\n  protected override get _kind(): string {\n    return 'bigint';\n  }\n\n  override checkAsync(\n    this: BigIntSchema<Input, 'sync'>,\n    fn: (value: bigint, ctx: CheckContext) => Promise<ValidateResult>,\n  ): BigIntSchema<Input, 'async'> {\n    return this._addCheck(fn, true) as unknown as BigIntSchema<Input, 'async'>;\n  }\n\n  constructor() {\n    super((value, ctx) =>\n      typeof value === 'bigint' ? null : fail(ErrorCode.invalid_type, ctx!.messages.bigint.type()),\n    );\n  }\n\n  min(minimum: bigint, message?: MessageFn<{ min: bigint; value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed >= minimum) return null;\n\n      return fail(\n        ErrorCode.too_small,\n        resolveMessage(message ?? ctx!.messages.bigint.min, { min: minimum, value: typed }),\n        { min: minimum },\n      );\n    });\n  }\n\n  max(maximum: bigint, message?: MessageFn<{ max: bigint; value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed <= maximum) return null;\n\n      return fail(\n        ErrorCode.too_big,\n        resolveMessage(message ?? ctx!.messages.bigint.max, { max: maximum, value: typed }),\n        { max: maximum },\n      );\n    });\n  }\n\n  positive(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed > 0n) return null;\n\n      return fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.bigint.positive, { value: typed }), {\n        exclusive: true,\n        min: 0n,\n      });\n    });\n  }\n\n  negative(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed < 0n) return null;\n\n      return fail(ErrorCode.too_big, resolveMessage(message ?? ctx!.messages.bigint.negative, { value: typed }), {\n        exclusive: true,\n        max: 0n,\n      });\n    });\n  }\n\n  nonNegative(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed >= 0n) return null;\n\n      return fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.bigint.nonNegative, { value: typed }), {\n        min: 0n,\n      });\n    });\n  }\n\n  nonPositive(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed <= 0n) return null;\n\n      return fail(ErrorCode.too_big, resolveMessage(message ?? ctx!.messages.bigint.nonPositive, { value: typed }), {\n        max: 0n,\n      });\n    });\n  }\n\n  multipleOf(step: bigint, message?: MessageFn<{ step: bigint; value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed % step === 0n) return null;\n\n      return fail(\n        ErrorCode.invalid_multiple_of,\n        resolveMessage(message ?? ctx!.messages.bigint.multipleOf, { step, value: typed }),\n        { step },\n      );\n    });\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    if (visitor.bigint) return visitor.bigint(this);\n\n    return super._walk(visitor);\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    if (this.state.validators.length > 0) {\n      warn(\n        'definition(): this bigint schema has constraints (e.g. min(), max(), positive()). ' +\n          'BigInt constraints are not serializable and will not appear in the definition.',\n      );\n    }\n\n    return { ...this._describeBase(), kind: 'bigint' };\n  }\n\n  static coerce(): BigIntSchema<unknown> {\n    return new BigIntSchema().preprocess((value: unknown) => {\n      if (typeof value === 'bigint') return value;\n\n      if (typeof value === 'number') {\n        if (!Number.isFinite(value) || !Number.isInteger(value)) return value;\n\n        try {\n          return BigInt(value);\n        } catch {\n          return value;\n        }\n      }\n\n      if (typeof value === 'string') {\n        const trimmed = value.trim();\n\n        // Guard against DoS: BigInt() conversion is O(n²) in digit count.\n        if (trimmed.length === 0 || trimmed.length > 1000) return value;\n\n        try {\n          return BigInt(trimmed);\n        } catch {\n          return value;\n        }\n      }\n\n      return value;\n    });\n  }\n}\n"],"mappings":"iHAIA,IAAa,EAAb,MAAa,UAAuE,EAAA,MAA4B,CAC9G,IAAuB,OAAgB,CACrC,MAAO,QACT,CAEA,WAEE,EAC8B,CAC9B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,aAAc,CACZ,OAAO,EAAO,IACZ,OAAO,GAAU,SAAW,KAAO,EAAA,KAAK,EAAA,UAAU,aAAc,EAAK,SAAS,OAAO,KAAK,CAAC,CAC7F,CACF,CAEA,IAAI,EAAiB,EAA2D,CAC9E,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,EAAgB,KAEtB,EAAA,KACL,EAAA,UAAU,UACV,EAAA,eAAe,GAAW,EAAK,SAAS,OAAO,IAAK,CAAE,IAAK,EAAS,MAAO,CAAM,CAAC,EAClF,CAAE,IAAK,CAAQ,CACjB,CACF,CAAC,CACH,CAEA,IAAI,EAAiB,EAA2D,CAC9E,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,EAAgB,KAEtB,EAAA,KACL,EAAA,UAAU,QACV,EAAA,eAAe,GAAW,EAAK,SAAS,OAAO,IAAK,CAAE,IAAK,EAAS,MAAO,CAAM,CAAC,EAClF,CAAE,IAAK,CAAQ,CACjB,CACF,CAAC,CACH,CAEA,SAAS,EAA8C,CACrD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAQ,GAAW,KAEhB,EAAA,KAAK,EAAA,UAAU,UAAW,EAAA,eAAe,GAAW,EAAK,SAAS,OAAO,SAAU,CAAE,MAAO,CAAM,CAAC,EAAG,CAC3G,UAAW,GACX,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,SAAS,EAA8C,CACrD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAQ,GAAW,KAEhB,EAAA,KAAK,EAAA,UAAU,QAAS,EAAA,eAAe,GAAW,EAAK,SAAS,OAAO,SAAU,CAAE,MAAO,CAAM,CAAC,EAAG,CACzG,UAAW,GACX,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,YAAY,EAA8C,CACxD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,GAAW,KAEjB,EAAA,KAAK,EAAA,UAAU,UAAW,EAAA,eAAe,GAAW,EAAK,SAAS,OAAO,YAAa,CAAE,MAAO,CAAM,CAAC,EAAG,CAC9G,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,YAAY,EAA8C,CACxD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,GAAW,KAEjB,EAAA,KAAK,EAAA,UAAU,QAAS,EAAA,eAAe,GAAW,EAAK,SAAS,OAAO,YAAa,CAAE,MAAO,CAAM,CAAC,EAAG,CAC5G,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,WAAW,EAAc,EAA4D,CACnF,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAQ,IAAS,GAAW,KAEzB,EAAA,KACL,EAAA,UAAU,oBACV,EAAA,eAAe,GAAW,EAAK,SAAS,OAAO,WAAY,CAAE,OAAM,MAAO,CAAM,CAAC,EACjF,CAAE,MAAK,CACT,CACF,CAAC,CACH,CAEA,MAA4B,EAAoC,CAG9D,OAFI,EAAQ,OAAe,EAAQ,OAAO,IAAI,EAEvC,MAAM,MAAM,CAAO,CAC5B,CAEA,mBAAyD,CAQvD,OAPI,KAAK,MAAM,WAAW,OAOnB,CAAE,GAAG,KAAK,cAAc,EAAG,KAAM,QAAS,CACnD,CAEA,OAAO,QAAgC,CACrC,OAAO,IAAI,EAAa,CAAC,CAAC,WAAY,GAAmB,CACvD,GAAI,OAAO,GAAU,SAAU,OAAO,EAEtC,GAAI,OAAO,GAAU,SAAU,CAC7B,GAAI,CAAC,OAAO,SAAS,CAAK,GAAK,CAAC,OAAO,UAAU,CAAK,EAAG,OAAO,EAEhE,GAAI,CACF,OAAO,OAAO,CAAK,CACrB,MAAQ,CACN,OAAO,CACT,CACF,CAEA,GAAI,OAAO,GAAU,SAAU,CAC7B,IAAM,EAAU,EAAM,KAAK,EAG3B,GAAI,EAAQ,SAAW,GAAK,EAAQ,OAAS,IAAM,OAAO,EAE1D,GAAI,CACF,OAAO,OAAO,CAAO,CACvB,MAAQ,CACN,OAAO,CACT,CACF,CAEA,OAAO,CACT,CAAC,CACH,CACF"}

package/dist/schemas/bigint.d.ts

@@ -29,13 +29,6 @@ export declare class BigIntSchema<Input = bigint, Mode extends SchemaMode = 'syn
         value: bigint;
     }>): this;
     protected _walk<R>(visitor: SchemaWalker<R>): R | null;
-    /**
-     * Returns a new schema that coerces the input to a bigint before validation.
-     * Handles number, string (up to 1000 digits), and bigint inputs.
-     *
-     * Equivalent to `s.coerce.bigint()`.
-     */
-    coerce(): BigIntSchema<unknown>;
     protected _toDescriptorImpl(): SchemaDescriptor;
     static coerce(): BigIntSchema<unknown>;
 }

package/dist/schemas/bigint.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bigint.d.ts","sourceRoot":"","sources":["../../src/schemas/bigint.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,gBAAgB,EAAE,UAAU,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AACnH,OAAO,EAAmC,MAAM,EAAE,MAAM,SAAS,CAAC;AAElE,qBAAa,YAAY,CAAC,KAAK,GAAG,MAAM,EAAE,IAAI,SAAS,UAAU,GAAG,MAAM,CAAE,SAAQ,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC;IAC7G,cAAuB,KAAK,IAAI,MAAM,CAErC;IAEQ,UAAU,CACjB,IAAI,EAAE,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,EACjC,EAAE,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,KAAK,OAAO,CAAC,cAAc,CAAC,GAChE,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC;;IAU/B,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;IAc/E,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;IAc/E,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;IAatD,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;IAatD,WAAW,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;IAYzD,WAAW,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;IAYzD,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;cAcjE,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;IAM/D;;;;;OAKG;IACH,MAAM,IAAI,YAAY,CAAC,OAAO,CAAC;cAIZ,iBAAiB,IAAI,gBAAgB;IAWxD,MAAM,CAAC,MAAM,IAAI,YAAY,CAAC,OAAO,CAAC;CA8BvC"}
+{"version":3,"file":"bigint.d.ts","sourceRoot":"","sources":["../../src/schemas/bigint.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,gBAAgB,EAAE,UAAU,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AACnH,OAAO,EAAmC,MAAM,EAAE,MAAM,SAAS,CAAC;AAElE,qBAAa,YAAY,CAAC,KAAK,GAAG,MAAM,EAAE,IAAI,SAAS,UAAU,GAAG,MAAM,CAAE,SAAQ,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC;IAC7G,cAAuB,KAAK,IAAI,MAAM,CAErC;IAEQ,UAAU,CACjB,IAAI,EAAE,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,EACjC,EAAE,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,KAAK,OAAO,CAAC,cAAc,CAAC,GAChE,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC;;IAU/B,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;IAc/E,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;IAc/E,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;IAatD,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;IAatD,WAAW,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;IAYzD,WAAW,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;IAYzD,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;cAcjE,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;cAM5C,iBAAiB,IAAI,gBAAgB;IAWxD,MAAM,CAAC,MAAM,IAAI,YAAY,CAAC,OAAO,CAAC;CA8BvC"}

package/dist/schemas/bigint.js

@@ -1,2 +1,2 @@
-import{ErrorCode as e}from"../types.js";import{fail as t,resolveMessage as n}from"../errors.js";import"../_dev.js";import{Schema as r}from"../core.js";var i=class i extends r{get _kind(){return`bigint`}checkAsync(e){return this._addCheck(e,!0)}constructor(){super((n,r)=>typeof n==`bigint`?null:t(e.invalid_type,r.messages.bigint.type()))}min(r,i){return this._addConstraint((a,o)=>{let s=a;return s>=r?null:t(e.too_small,n(i??o.messages.bigint.min,{min:r,value:s}),{min:r})})}max(r,i){return this._addConstraint((a,o)=>{let s=a;return s<=r?null:t(e.too_big,n(i??o.messages.bigint.max,{max:r,value:s}),{max:r})})}positive(r){return this._addConstraint((i,a)=>{let o=i;return o>0n?null:t(e.too_small,n(r??a.messages.bigint.positive,{value:o}),{exclusive:!0,min:0n})})}negative(r){return this._addConstraint((i,a)=>{let o=i;return o<0n?null:t(e.too_big,n(r??a.messages.bigint.negative,{value:o}),{exclusive:!0,max:0n})})}nonNegative(r){return this._addConstraint((i,a)=>{let o=i;return o>=0n?null:t(e.too_small,n(r??a.messages.bigint.nonNegative,{value:o}),{min:0n})})}nonPositive(r){return this._addConstraint((i,a)=>{let o=i;return o<=0n?null:t(e.too_big,n(r??a.messages.bigint.nonPositive,{value:o}),{max:0n})})}multipleOf(r,i){return this._addConstraint((a,o)=>{let s=a;return s%r===0n?null:t(e.invalid_multiple_of,n(i??o.messages.bigint.multipleOf,{step:r,value:s}),{step:r})})}_walk(e){return e.bigint?e.bigint(this):super._walk(e)}coerce(){return i.coerce()}_toDescriptorImpl(){return this.state.validators.length,{...this._describeBase(),kind:`bigint`}}static coerce(){return new i().preprocess(e=>{if(typeof e==`bigint`)return e;if(typeof e==`number`){if(!Number.isFinite(e)||!Number.isInteger(e))return e;try{return BigInt(e)}catch{return e}}if(typeof e==`string`){let t=e.trim();if(t.length===0||t.length>1e3)return e;try{return BigInt(t)}catch{return e}}return e})}};export{i as BigIntSchema};
+import{fail as e,resolveMessage as t}from"../errors.js";import"../_dev.js";import{ErrorCode as n}from"../types.js";import{Schema as r}from"../core.js";var i=class i extends r{get _kind(){return`bigint`}checkAsync(e){return this._addCheck(e,!0)}constructor(){super((t,r)=>typeof t==`bigint`?null:e(n.invalid_type,r.messages.bigint.type()))}min(r,i){return this._addConstraint((a,o)=>{let s=a;return s>=r?null:e(n.too_small,t(i??o.messages.bigint.min,{min:r,value:s}),{min:r})})}max(r,i){return this._addConstraint((a,o)=>{let s=a;return s<=r?null:e(n.too_big,t(i??o.messages.bigint.max,{max:r,value:s}),{max:r})})}positive(r){return this._addConstraint((i,a)=>{let o=i;return o>0n?null:e(n.too_small,t(r??a.messages.bigint.positive,{value:o}),{exclusive:!0,min:0n})})}negative(r){return this._addConstraint((i,a)=>{let o=i;return o<0n?null:e(n.too_big,t(r??a.messages.bigint.negative,{value:o}),{exclusive:!0,max:0n})})}nonNegative(r){return this._addConstraint((i,a)=>{let o=i;return o>=0n?null:e(n.too_small,t(r??a.messages.bigint.nonNegative,{value:o}),{min:0n})})}nonPositive(r){return this._addConstraint((i,a)=>{let o=i;return o<=0n?null:e(n.too_big,t(r??a.messages.bigint.nonPositive,{value:o}),{max:0n})})}multipleOf(r,i){return this._addConstraint((a,o)=>{let s=a;return s%r===0n?null:e(n.invalid_multiple_of,t(i??o.messages.bigint.multipleOf,{step:r,value:s}),{step:r})})}_walk(e){return e.bigint?e.bigint(this):super._walk(e)}_toDescriptorImpl(){return this.state.validators.length,{...this._describeBase(),kind:`bigint`}}static coerce(){return new i().preprocess(e=>{if(typeof e==`bigint`)return e;if(typeof e==`number`){if(!Number.isFinite(e)||!Number.isInteger(e))return e;try{return BigInt(e)}catch{return e}}if(typeof e==`string`){let t=e.trim();if(t.length===0||t.length>1e3)return e;try{return BigInt(t)}catch{return e}}return e})}};export{i as BigIntSchema};
 //# sourceMappingURL=bigint.js.map

package/dist/schemas/bigint.js.map

@@ -1 +1 @@
-{"version":3,"file":"bigint.js","names":[],"sources":["../../src/schemas/bigint.ts"],"sourcesContent":["import { warn } from '../_dev';\nimport type { CheckContext, MessageFn, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';\nimport { ErrorCode, fail, resolveMessage, Schema } from '../core';\n\nexport class BigIntSchema<Input = bigint, Mode extends SchemaMode = 'sync'> extends Schema<bigint, Input, Mode> {\n  protected override get _kind(): string {\n    return 'bigint';\n  }\n\n  override checkAsync(\n    this: BigIntSchema<Input, 'sync'>,\n    fn: (value: bigint, ctx: CheckContext) => Promise<ValidateResult>,\n  ): BigIntSchema<Input, 'async'> {\n    return this._addCheck(fn, true) as unknown as BigIntSchema<Input, 'async'>;\n  }\n\n  constructor() {\n    super((value, ctx) =>\n      typeof value === 'bigint' ? null : fail(ErrorCode.invalid_type, ctx!.messages.bigint.type()),\n    );\n  }\n\n  min(minimum: bigint, message?: MessageFn<{ min: bigint; value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed >= minimum) return null;\n\n      return fail(\n        ErrorCode.too_small,\n        resolveMessage(message ?? ctx!.messages.bigint.min, { min: minimum, value: typed }),\n        { min: minimum },\n      );\n    });\n  }\n\n  max(maximum: bigint, message?: MessageFn<{ max: bigint; value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed <= maximum) return null;\n\n      return fail(\n        ErrorCode.too_big,\n        resolveMessage(message ?? ctx!.messages.bigint.max, { max: maximum, value: typed }),\n        { max: maximum },\n      );\n    });\n  }\n\n  positive(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed > 0n) return null;\n\n      return fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.bigint.positive, { value: typed }), {\n        exclusive: true,\n        min: 0n,\n      });\n    });\n  }\n\n  negative(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed < 0n) return null;\n\n      return fail(ErrorCode.too_big, resolveMessage(message ?? ctx!.messages.bigint.negative, { value: typed }), {\n        exclusive: true,\n        max: 0n,\n      });\n    });\n  }\n\n  nonNegative(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed >= 0n) return null;\n\n      return fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.bigint.nonNegative, { value: typed }), {\n        min: 0n,\n      });\n    });\n  }\n\n  nonPositive(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed <= 0n) return null;\n\n      return fail(ErrorCode.too_big, resolveMessage(message ?? ctx!.messages.bigint.nonPositive, { value: typed }), {\n        max: 0n,\n      });\n    });\n  }\n\n  multipleOf(step: bigint, message?: MessageFn<{ step: bigint; value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed % step === 0n) return null;\n\n      return fail(\n        ErrorCode.invalid_multiple_of,\n        resolveMessage(message ?? ctx!.messages.bigint.multipleOf, { step, value: typed }),\n        { step },\n      );\n    });\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    if (visitor.bigint) return visitor.bigint(this);\n\n    return super._walk(visitor);\n  }\n\n  /**\n   * Returns a new schema that coerces the input to a bigint before validation.\n   * Handles number, string (up to 1000 digits), and bigint inputs.\n   *\n   * Equivalent to `s.coerce.bigint()`.\n   */\n  coerce(): BigIntSchema<unknown> {\n    return BigIntSchema.coerce();\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    if (this.state.validators.length > 0) {\n      warn(\n        'definition(): this bigint schema has constraints (e.g. min(), max(), positive()). ' +\n          'BigInt constraints are not serializable and will not appear in the definition.',\n      );\n    }\n\n    return { ...this._describeBase(), kind: 'bigint' };\n  }\n\n  static coerce(): BigIntSchema<unknown> {\n    return new BigIntSchema().preprocess((value: unknown) => {\n      if (typeof value === 'bigint') return value;\n\n      if (typeof value === 'number') {\n        if (!Number.isFinite(value) || !Number.isInteger(value)) return value;\n\n        try {\n          return BigInt(value);\n        } catch {\n          return value;\n        }\n      }\n\n      if (typeof value === 'string') {\n        const trimmed = value.trim();\n\n        // Guard against DoS: BigInt() conversion is O(n²) in digit count.\n        if (trimmed.length === 0 || trimmed.length > 1000) return value;\n\n        try {\n          return BigInt(trimmed);\n        } catch {\n          return value;\n        }\n      }\n\n      return value;\n    });\n  }\n}\n"],"mappings":"uJAIA,IAAa,EAAb,MAAa,UAAuE,CAA4B,CAC9G,IAAuB,OAAgB,CACrC,MAAO,QACT,CAEA,WAEE,EAC8B,CAC9B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,aAAc,CACZ,OAAO,EAAO,IACZ,OAAO,GAAU,SAAW,KAAO,EAAK,EAAU,aAAc,EAAK,SAAS,OAAO,KAAK,CAAC,CAC7F,CACF,CAEA,IAAI,EAAiB,EAA2D,CAC9E,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,EAAgB,KAEtB,EACL,EAAU,UACV,EAAe,GAAW,EAAK,SAAS,OAAO,IAAK,CAAE,IAAK,EAAS,MAAO,CAAM,CAAC,EAClF,CAAE,IAAK,CAAQ,CACjB,CACF,CAAC,CACH,CAEA,IAAI,EAAiB,EAA2D,CAC9E,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,EAAgB,KAEtB,EACL,EAAU,QACV,EAAe,GAAW,EAAK,SAAS,OAAO,IAAK,CAAE,IAAK,EAAS,MAAO,CAAM,CAAC,EAClF,CAAE,IAAK,CAAQ,CACjB,CACF,CAAC,CACH,CAEA,SAAS,EAA8C,CACrD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAQ,GAAW,KAEhB,EAAK,EAAU,UAAW,EAAe,GAAW,EAAK,SAAS,OAAO,SAAU,CAAE,MAAO,CAAM,CAAC,EAAG,CAC3G,UAAW,GACX,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,SAAS,EAA8C,CACrD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAQ,GAAW,KAEhB,EAAK,EAAU,QAAS,EAAe,GAAW,EAAK,SAAS,OAAO,SAAU,CAAE,MAAO,CAAM,CAAC,EAAG,CACzG,UAAW,GACX,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,YAAY,EAA8C,CACxD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,GAAW,KAEjB,EAAK,EAAU,UAAW,EAAe,GAAW,EAAK,SAAS,OAAO,YAAa,CAAE,MAAO,CAAM,CAAC,EAAG,CAC9G,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,YAAY,EAA8C,CACxD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,GAAW,KAEjB,EAAK,EAAU,QAAS,EAAe,GAAW,EAAK,SAAS,OAAO,YAAa,CAAE,MAAO,CAAM,CAAC,EAAG,CAC5G,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,WAAW,EAAc,EAA4D,CACnF,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAQ,IAAS,GAAW,KAEzB,EACL,EAAU,oBACV,EAAe,GAAW,EAAK,SAAS,OAAO,WAAY,CAAE,OAAM,MAAO,CAAM,CAAC,EACjF,CAAE,MAAK,CACT,CACF,CAAC,CACH,CAEA,MAA4B,EAAoC,CAG9D,OAFI,EAAQ,OAAe,EAAQ,OAAO,IAAI,EAEvC,MAAM,MAAM,CAAO,CAC5B,CAQA,QAAgC,CAC9B,OAAO,EAAa,OAAO,CAC7B,CAEA,mBAAyD,CAQvD,OAPI,KAAK,MAAM,WAAW,OAOnB,CAAE,GAAG,KAAK,cAAc,EAAG,KAAM,QAAS,CACnD,CAEA,OAAO,QAAgC,CACrC,OAAO,IAAI,EAAa,CAAC,CAAC,WAAY,GAAmB,CACvD,GAAI,OAAO,GAAU,SAAU,OAAO,EAEtC,GAAI,OAAO,GAAU,SAAU,CAC7B,GAAI,CAAC,OAAO,SAAS,CAAK,GAAK,CAAC,OAAO,UAAU,CAAK,EAAG,OAAO,EAEhE,GAAI,CACF,OAAO,OAAO,CAAK,CACrB,MAAQ,CACN,OAAO,CACT,CACF,CAEA,GAAI,OAAO,GAAU,SAAU,CAC7B,IAAM,EAAU,EAAM,KAAK,EAG3B,GAAI,EAAQ,SAAW,GAAK,EAAQ,OAAS,IAAM,OAAO,EAE1D,GAAI,CACF,OAAO,OAAO,CAAO,CACvB,MAAQ,CACN,OAAO,CACT,CACF,CAEA,OAAO,CACT,CAAC,CACH,CACF"}
+{"version":3,"file":"bigint.js","names":[],"sources":["../../src/schemas/bigint.ts"],"sourcesContent":["import { warn } from '../_dev';\nimport type { CheckContext, MessageFn, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';\nimport { ErrorCode, fail, resolveMessage, Schema } from '../core';\n\nexport class BigIntSchema<Input = bigint, Mode extends SchemaMode = 'sync'> extends Schema<bigint, Input, Mode> {\n  protected override get _kind(): string {\n    return 'bigint';\n  }\n\n  override checkAsync(\n    this: BigIntSchema<Input, 'sync'>,\n    fn: (value: bigint, ctx: CheckContext) => Promise<ValidateResult>,\n  ): BigIntSchema<Input, 'async'> {\n    return this._addCheck(fn, true) as unknown as BigIntSchema<Input, 'async'>;\n  }\n\n  constructor() {\n    super((value, ctx) =>\n      typeof value === 'bigint' ? null : fail(ErrorCode.invalid_type, ctx!.messages.bigint.type()),\n    );\n  }\n\n  min(minimum: bigint, message?: MessageFn<{ min: bigint; value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed >= minimum) return null;\n\n      return fail(\n        ErrorCode.too_small,\n        resolveMessage(message ?? ctx!.messages.bigint.min, { min: minimum, value: typed }),\n        { min: minimum },\n      );\n    });\n  }\n\n  max(maximum: bigint, message?: MessageFn<{ max: bigint; value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed <= maximum) return null;\n\n      return fail(\n        ErrorCode.too_big,\n        resolveMessage(message ?? ctx!.messages.bigint.max, { max: maximum, value: typed }),\n        { max: maximum },\n      );\n    });\n  }\n\n  positive(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed > 0n) return null;\n\n      return fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.bigint.positive, { value: typed }), {\n        exclusive: true,\n        min: 0n,\n      });\n    });\n  }\n\n  negative(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed < 0n) return null;\n\n      return fail(ErrorCode.too_big, resolveMessage(message ?? ctx!.messages.bigint.negative, { value: typed }), {\n        exclusive: true,\n        max: 0n,\n      });\n    });\n  }\n\n  nonNegative(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed >= 0n) return null;\n\n      return fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.bigint.nonNegative, { value: typed }), {\n        min: 0n,\n      });\n    });\n  }\n\n  nonPositive(message?: MessageFn<{ value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed <= 0n) return null;\n\n      return fail(ErrorCode.too_big, resolveMessage(message ?? ctx!.messages.bigint.nonPositive, { value: typed }), {\n        max: 0n,\n      });\n    });\n  }\n\n  multipleOf(step: bigint, message?: MessageFn<{ step: bigint; value: bigint }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as bigint;\n\n      if (typed % step === 0n) return null;\n\n      return fail(\n        ErrorCode.invalid_multiple_of,\n        resolveMessage(message ?? ctx!.messages.bigint.multipleOf, { step, value: typed }),\n        { step },\n      );\n    });\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    if (visitor.bigint) return visitor.bigint(this);\n\n    return super._walk(visitor);\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    if (this.state.validators.length > 0) {\n      warn(\n        'definition(): this bigint schema has constraints (e.g. min(), max(), positive()). ' +\n          'BigInt constraints are not serializable and will not appear in the definition.',\n      );\n    }\n\n    return { ...this._describeBase(), kind: 'bigint' };\n  }\n\n  static coerce(): BigIntSchema<unknown> {\n    return new BigIntSchema().preprocess((value: unknown) => {\n      if (typeof value === 'bigint') return value;\n\n      if (typeof value === 'number') {\n        if (!Number.isFinite(value) || !Number.isInteger(value)) return value;\n\n        try {\n          return BigInt(value);\n        } catch {\n          return value;\n        }\n      }\n\n      if (typeof value === 'string') {\n        const trimmed = value.trim();\n\n        // Guard against DoS: BigInt() conversion is O(n²) in digit count.\n        if (trimmed.length === 0 || trimmed.length > 1000) return value;\n\n        try {\n          return BigInt(trimmed);\n        } catch {\n          return value;\n        }\n      }\n\n      return value;\n    });\n  }\n}\n"],"mappings":"uJAIA,IAAa,EAAb,MAAa,UAAuE,CAA4B,CAC9G,IAAuB,OAAgB,CACrC,MAAO,QACT,CAEA,WAEE,EAC8B,CAC9B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,aAAc,CACZ,OAAO,EAAO,IACZ,OAAO,GAAU,SAAW,KAAO,EAAK,EAAU,aAAc,EAAK,SAAS,OAAO,KAAK,CAAC,CAC7F,CACF,CAEA,IAAI,EAAiB,EAA2D,CAC9E,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,EAAgB,KAEtB,EACL,EAAU,UACV,EAAe,GAAW,EAAK,SAAS,OAAO,IAAK,CAAE,IAAK,EAAS,MAAO,CAAM,CAAC,EAClF,CAAE,IAAK,CAAQ,CACjB,CACF,CAAC,CACH,CAEA,IAAI,EAAiB,EAA2D,CAC9E,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,EAAgB,KAEtB,EACL,EAAU,QACV,EAAe,GAAW,EAAK,SAAS,OAAO,IAAK,CAAE,IAAK,EAAS,MAAO,CAAM,CAAC,EAClF,CAAE,IAAK,CAAQ,CACjB,CACF,CAAC,CACH,CAEA,SAAS,EAA8C,CACrD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAQ,GAAW,KAEhB,EAAK,EAAU,UAAW,EAAe,GAAW,EAAK,SAAS,OAAO,SAAU,CAAE,MAAO,CAAM,CAAC,EAAG,CAC3G,UAAW,GACX,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,SAAS,EAA8C,CACrD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAQ,GAAW,KAEhB,EAAK,EAAU,QAAS,EAAe,GAAW,EAAK,SAAS,OAAO,SAAU,CAAE,MAAO,CAAM,CAAC,EAAG,CACzG,UAAW,GACX,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,YAAY,EAA8C,CACxD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,GAAW,KAEjB,EAAK,EAAU,UAAW,EAAe,GAAW,EAAK,SAAS,OAAO,YAAa,CAAE,MAAO,CAAM,CAAC,EAAG,CAC9G,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,YAAY,EAA8C,CACxD,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,GAAS,GAAW,KAEjB,EAAK,EAAU,QAAS,EAAe,GAAW,EAAK,SAAS,OAAO,YAAa,CAAE,MAAO,CAAM,CAAC,EAAG,CAC5G,IAAK,EACP,CAAC,CACH,CAAC,CACH,CAEA,WAAW,EAAc,EAA4D,CACnF,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAQ,IAAS,GAAW,KAEzB,EACL,EAAU,oBACV,EAAe,GAAW,EAAK,SAAS,OAAO,WAAY,CAAE,OAAM,MAAO,CAAM,CAAC,EACjF,CAAE,MAAK,CACT,CACF,CAAC,CACH,CAEA,MAA4B,EAAoC,CAG9D,OAFI,EAAQ,OAAe,EAAQ,OAAO,IAAI,EAEvC,MAAM,MAAM,CAAO,CAC5B,CAEA,mBAAyD,CAQvD,OAPI,KAAK,MAAM,WAAW,OAOnB,CAAE,GAAG,KAAK,cAAc,EAAG,KAAM,QAAS,CACnD,CAEA,OAAO,QAAgC,CACrC,OAAO,IAAI,EAAa,CAAC,CAAC,WAAY,GAAmB,CACvD,GAAI,OAAO,GAAU,SAAU,OAAO,EAEtC,GAAI,OAAO,GAAU,SAAU,CAC7B,GAAI,CAAC,OAAO,SAAS,CAAK,GAAK,CAAC,OAAO,UAAU,CAAK,EAAG,OAAO,EAEhE,GAAI,CACF,OAAO,OAAO,CAAK,CACrB,MAAQ,CACN,OAAO,CACT,CACF,CAEA,GAAI,OAAO,GAAU,SAAU,CAC7B,IAAM,EAAU,EAAM,KAAK,EAG3B,GAAI,EAAQ,SAAW,GAAK,EAAQ,OAAS,IAAM,OAAO,EAE1D,GAAI,CACF,OAAO,OAAO,CAAO,CACvB,MAAQ,CACN,OAAO,CACT,CACF,CAEA,OAAO,CACT,CAAC,CACH,CACF"}

package/dist/schemas/boolean.cjs

@@ -1,2 +1,2 @@
-const e=require("../types.cjs"),t=require("../core.cjs");var n=class n extends t.Schema{get _kind(){return`boolean`}checkAsync(e){return this._addCheck(e,!0)}constructor(){super((t,n)=>typeof t==`boolean`?null:[{code:e.ErrorCode.invalid_type,message:n.messages.boolean.type(),path:[]}])}coerce(){return n.coerce()}_toDescriptorImpl(){return{...this._describeBase(),kind:`boolean`}}_walk(e){return e.boolean?e.boolean(this):super._walk(e)}static coerce(){return new n().preprocess(e=>typeof e==`boolean`?e:e===`true`||e===`1`||e===1?!0:e===`false`||e===`0`||e===0?!1:e)}};exports.BooleanSchema=n;
+const e=require("../types.cjs"),t=require("../core.cjs");var n=class n extends t.Schema{get _kind(){return`boolean`}checkAsync(e){return this._addCheck(e,!0)}constructor(){super((t,n)=>typeof t==`boolean`?null:[{code:e.ErrorCode.invalid_type,message:n.messages.boolean.type(),path:[]}])}_toDescriptorImpl(){return{...this._describeBase(),kind:`boolean`}}_walk(e){return e.boolean?e.boolean(this):super._walk(e)}static coerce(){return new n().preprocess(e=>typeof e==`boolean`?e:e===`true`||e===`1`||e===1?!0:e===`false`||e===`0`||e===0?!1:e)}};exports.BooleanSchema=n;
 //# sourceMappingURL=boolean.cjs.map

package/dist/schemas/boolean.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"boolean.cjs","names":[],"sources":["../../src/schemas/boolean.ts"],"sourcesContent":["import type { CheckContext, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';\n\nimport { ErrorCode, Schema } from '../core';\n\nexport class BooleanSchema<Input = boolean, Mode extends SchemaMode = 'sync'> extends Schema<boolean, Input, Mode> {\n  protected override get _kind(): string {\n    return 'boolean';\n  }\n\n  override checkAsync(\n    this: BooleanSchema<Input, 'sync'>,\n    fn: (value: boolean, ctx: CheckContext) => Promise<ValidateResult>,\n  ): BooleanSchema<Input, 'async'> {\n    return this._addCheck(fn, true) as unknown as BooleanSchema<Input, 'async'>;\n  }\n\n  constructor() {\n    super((value, ctx) =>\n      typeof value === 'boolean'\n        ? null\n        : [{ code: ErrorCode.invalid_type, message: ctx!.messages.boolean.type(), path: [] }],\n    );\n  }\n\n  /**\n   * Returns a new schema that coerces the input to a boolean before validation.\n   * Accepts `'true'`, `'1'`, `1` as `true`; `'false'`, `'0'`, `0` as `false`.\n   *\n   * Equivalent to `s.coerce.boolean()`.\n   */\n  coerce(): BooleanSchema<unknown> {\n    return BooleanSchema.coerce();\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    return { ...this._describeBase(), kind: 'boolean' };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    if (visitor.boolean) return visitor.boolean(this);\n\n    return super._walk(visitor);\n  }\n\n  static coerce(): BooleanSchema<unknown> {\n    return new BooleanSchema().preprocess((v: unknown) => {\n      if (typeof v === 'boolean') return v;\n\n      if (v === 'true' || v === '1' || v === 1) return true;\n\n      if (v === 'false' || v === '0' || v === 0) return false;\n\n      return v;\n    });\n  }\n}\n"],"mappings":"yDAIA,IAAa,EAAb,MAAa,UAAyE,EAAA,MAA6B,CACjH,IAAuB,OAAgB,CACrC,MAAO,SACT,CAEA,WAEE,EAC+B,CAC/B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,aAAc,CACZ,OAAO,EAAO,IACZ,OAAO,GAAU,UACb,KACA,CAAC,CAAE,KAAM,EAAA,UAAU,aAAc,QAAS,EAAK,SAAS,QAAQ,KAAK,EAAG,KAAM,CAAC,CAAE,CAAC,CACxF,CACF,CAQA,QAAiC,CAC/B,OAAO,EAAc,OAAO,CAC9B,CAEA,mBAAyD,CACvD,MAAO,CAAE,GAAG,KAAK,cAAc,EAAG,KAAM,SAAU,CACpD,CAEA,MAA4B,EAAoC,CAG9D,OAFI,EAAQ,QAAgB,EAAQ,QAAQ,IAAI,EAEzC,MAAM,MAAM,CAAO,CAC5B,CAEA,OAAO,QAAiC,CACtC,OAAO,IAAI,EAAc,CAAC,CAAC,WAAY,GACjC,OAAO,GAAM,UAAkB,EAE/B,IAAM,QAAU,IAAM,KAAO,IAAM,EAAU,GAE7C,IAAM,SAAW,IAAM,KAAO,IAAM,EAAU,GAE3C,CACR,CACH,CACF"}
+{"version":3,"file":"boolean.cjs","names":[],"sources":["../../src/schemas/boolean.ts"],"sourcesContent":["import type { CheckContext, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';\n\nimport { ErrorCode, Schema } from '../core';\n\nexport class BooleanSchema<Input = boolean, Mode extends SchemaMode = 'sync'> extends Schema<boolean, Input, Mode> {\n  protected override get _kind(): string {\n    return 'boolean';\n  }\n\n  override checkAsync(\n    this: BooleanSchema<Input, 'sync'>,\n    fn: (value: boolean, ctx: CheckContext) => Promise<ValidateResult>,\n  ): BooleanSchema<Input, 'async'> {\n    return this._addCheck(fn, true) as unknown as BooleanSchema<Input, 'async'>;\n  }\n\n  constructor() {\n    super((value, ctx) =>\n      typeof value === 'boolean'\n        ? null\n        : [{ code: ErrorCode.invalid_type, message: ctx!.messages.boolean.type(), path: [] }],\n    );\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    return { ...this._describeBase(), kind: 'boolean' };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    if (visitor.boolean) return visitor.boolean(this);\n\n    return super._walk(visitor);\n  }\n\n  static coerce(): BooleanSchema<unknown> {\n    return new BooleanSchema().preprocess((v: unknown) => {\n      if (typeof v === 'boolean') return v;\n\n      if (v === 'true' || v === '1' || v === 1) return true;\n\n      if (v === 'false' || v === '0' || v === 0) return false;\n\n      return v;\n    });\n  }\n}\n"],"mappings":"yDAIA,IAAa,EAAb,MAAa,UAAyE,EAAA,MAA6B,CACjH,IAAuB,OAAgB,CACrC,MAAO,SACT,CAEA,WAEE,EAC+B,CAC/B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,aAAc,CACZ,OAAO,EAAO,IACZ,OAAO,GAAU,UACb,KACA,CAAC,CAAE,KAAM,EAAA,UAAU,aAAc,QAAS,EAAK,SAAS,QAAQ,KAAK,EAAG,KAAM,CAAC,CAAE,CAAC,CACxF,CACF,CAEA,mBAAyD,CACvD,MAAO,CAAE,GAAG,KAAK,cAAc,EAAG,KAAM,SAAU,CACpD,CAEA,MAA4B,EAAoC,CAG9D,OAFI,EAAQ,QAAgB,EAAQ,QAAQ,IAAI,EAEzC,MAAM,MAAM,CAAO,CAC5B,CAEA,OAAO,QAAiC,CACtC,OAAO,IAAI,EAAc,CAAC,CAAC,WAAY,GACjC,OAAO,GAAM,UAAkB,EAE/B,IAAM,QAAU,IAAM,KAAO,IAAM,EAAU,GAE7C,IAAM,SAAW,IAAM,KAAO,IAAM,EAAU,GAE3C,CACR,CACH,CACF"}

package/dist/schemas/boolean.d.ts

@@ -4,13 +4,6 @@ export declare class BooleanSchema<Input = boolean, Mode extends SchemaMode = 's
     protected get _kind(): string;
     checkAsync(this: BooleanSchema<Input, 'sync'>, fn: (value: boolean, ctx: CheckContext) => Promise<ValidateResult>): BooleanSchema<Input, 'async'>;
     constructor();
-    /**
-     * Returns a new schema that coerces the input to a boolean before validation.
-     * Accepts `'true'`, `'1'`, `1` as `true`; `'false'`, `'0'`, `0` as `false`.
-     *
-     * Equivalent to `s.coerce.boolean()`.
-     */
-    coerce(): BooleanSchema<unknown>;
     protected _toDescriptorImpl(): SchemaDescriptor;
     protected _walk<R>(visitor: SchemaWalker<R>): R | null;
     static coerce(): BooleanSchema<unknown>;

package/dist/schemas/boolean.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"boolean.d.ts","sourceRoot":"","sources":["../../src/schemas/boolean.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,gBAAgB,EAAE,UAAU,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAExG,OAAO,EAAa,MAAM,EAAE,MAAM,SAAS,CAAC;AAE5C,qBAAa,aAAa,CAAC,KAAK,GAAG,OAAO,EAAE,IAAI,SAAS,UAAU,GAAG,MAAM,CAAE,SAAQ,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC;IAChH,cAAuB,KAAK,IAAI,MAAM,CAErC;IAEQ,UAAU,CACjB,IAAI,EAAE,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,EAClC,EAAE,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,YAAY,KAAK,OAAO,CAAC,cAAc,CAAC,GACjE,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC;;IAYhC;;;;;OAKG;IACH,MAAM,IAAI,aAAa,CAAC,OAAO,CAAC;cAIb,iBAAiB,IAAI,gBAAgB;cAIrC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;IAM/D,MAAM,CAAC,MAAM,IAAI,aAAa,CAAC,OAAO,CAAC;CAWxC"}
+{"version":3,"file":"boolean.d.ts","sourceRoot":"","sources":["../../src/schemas/boolean.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,gBAAgB,EAAE,UAAU,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAExG,OAAO,EAAa,MAAM,EAAE,MAAM,SAAS,CAAC;AAE5C,qBAAa,aAAa,CAAC,KAAK,GAAG,OAAO,EAAE,IAAI,SAAS,UAAU,GAAG,MAAM,CAAE,SAAQ,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC;IAChH,cAAuB,KAAK,IAAI,MAAM,CAErC;IAEQ,UAAU,CACjB,IAAI,EAAE,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,EAClC,EAAE,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,YAAY,KAAK,OAAO,CAAC,cAAc,CAAC,GACjE,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC;;cAYb,iBAAiB,IAAI,gBAAgB;cAIrC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;IAM/D,MAAM,CAAC,MAAM,IAAI,aAAa,CAAC,OAAO,CAAC;CAWxC"}

package/dist/schemas/boolean.js

@@ -1,2 +1,2 @@
-import{ErrorCode as e}from"../types.js";import{Schema as t}from"../core.js";var n=class n extends t{get _kind(){return`boolean`}checkAsync(e){return this._addCheck(e,!0)}constructor(){super((t,n)=>typeof t==`boolean`?null:[{code:e.invalid_type,message:n.messages.boolean.type(),path:[]}])}coerce(){return n.coerce()}_toDescriptorImpl(){return{...this._describeBase(),kind:`boolean`}}_walk(e){return e.boolean?e.boolean(this):super._walk(e)}static coerce(){return new n().preprocess(e=>typeof e==`boolean`?e:e===`true`||e===`1`||e===1?!0:e===`false`||e===`0`||e===0?!1:e)}};export{n as BooleanSchema};
+import{ErrorCode as e}from"../types.js";import{Schema as t}from"../core.js";var n=class n extends t{get _kind(){return`boolean`}checkAsync(e){return this._addCheck(e,!0)}constructor(){super((t,n)=>typeof t==`boolean`?null:[{code:e.invalid_type,message:n.messages.boolean.type(),path:[]}])}_toDescriptorImpl(){return{...this._describeBase(),kind:`boolean`}}_walk(e){return e.boolean?e.boolean(this):super._walk(e)}static coerce(){return new n().preprocess(e=>typeof e==`boolean`?e:e===`true`||e===`1`||e===1?!0:e===`false`||e===`0`||e===0?!1:e)}};export{n as BooleanSchema};
 //# sourceMappingURL=boolean.js.map

package/dist/schemas/boolean.js.map

@@ -1 +1 @@
-{"version":3,"file":"boolean.js","names":[],"sources":["../../src/schemas/boolean.ts"],"sourcesContent":["import type { CheckContext, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';\n\nimport { ErrorCode, Schema } from '../core';\n\nexport class BooleanSchema<Input = boolean, Mode extends SchemaMode = 'sync'> extends Schema<boolean, Input, Mode> {\n  protected override get _kind(): string {\n    return 'boolean';\n  }\n\n  override checkAsync(\n    this: BooleanSchema<Input, 'sync'>,\n    fn: (value: boolean, ctx: CheckContext) => Promise<ValidateResult>,\n  ): BooleanSchema<Input, 'async'> {\n    return this._addCheck(fn, true) as unknown as BooleanSchema<Input, 'async'>;\n  }\n\n  constructor() {\n    super((value, ctx) =>\n      typeof value === 'boolean'\n        ? null\n        : [{ code: ErrorCode.invalid_type, message: ctx!.messages.boolean.type(), path: [] }],\n    );\n  }\n\n  /**\n   * Returns a new schema that coerces the input to a boolean before validation.\n   * Accepts `'true'`, `'1'`, `1` as `true`; `'false'`, `'0'`, `0` as `false`.\n   *\n   * Equivalent to `s.coerce.boolean()`.\n   */\n  coerce(): BooleanSchema<unknown> {\n    return BooleanSchema.coerce();\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    return { ...this._describeBase(), kind: 'boolean' };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    if (visitor.boolean) return visitor.boolean(this);\n\n    return super._walk(visitor);\n  }\n\n  static coerce(): BooleanSchema<unknown> {\n    return new BooleanSchema().preprocess((v: unknown) => {\n      if (typeof v === 'boolean') return v;\n\n      if (v === 'true' || v === '1' || v === 1) return true;\n\n      if (v === 'false' || v === '0' || v === 0) return false;\n\n      return v;\n    });\n  }\n}\n"],"mappings":"4EAIA,IAAa,EAAb,MAAa,UAAyE,CAA6B,CACjH,IAAuB,OAAgB,CACrC,MAAO,SACT,CAEA,WAEE,EAC+B,CAC/B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,aAAc,CACZ,OAAO,EAAO,IACZ,OAAO,GAAU,UACb,KACA,CAAC,CAAE,KAAM,EAAU,aAAc,QAAS,EAAK,SAAS,QAAQ,KAAK,EAAG,KAAM,CAAC,CAAE,CAAC,CACxF,CACF,CAQA,QAAiC,CAC/B,OAAO,EAAc,OAAO,CAC9B,CAEA,mBAAyD,CACvD,MAAO,CAAE,GAAG,KAAK,cAAc,EAAG,KAAM,SAAU,CACpD,CAEA,MAA4B,EAAoC,CAG9D,OAFI,EAAQ,QAAgB,EAAQ,QAAQ,IAAI,EAEzC,MAAM,MAAM,CAAO,CAC5B,CAEA,OAAO,QAAiC,CACtC,OAAO,IAAI,EAAc,CAAC,CAAC,WAAY,GACjC,OAAO,GAAM,UAAkB,EAE/B,IAAM,QAAU,IAAM,KAAO,IAAM,EAAU,GAE7C,IAAM,SAAW,IAAM,KAAO,IAAM,EAAU,GAE3C,CACR,CACH,CACF"}
+{"version":3,"file":"boolean.js","names":[],"sources":["../../src/schemas/boolean.ts"],"sourcesContent":["import type { CheckContext, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';\n\nimport { ErrorCode, Schema } from '../core';\n\nexport class BooleanSchema<Input = boolean, Mode extends SchemaMode = 'sync'> extends Schema<boolean, Input, Mode> {\n  protected override get _kind(): string {\n    return 'boolean';\n  }\n\n  override checkAsync(\n    this: BooleanSchema<Input, 'sync'>,\n    fn: (value: boolean, ctx: CheckContext) => Promise<ValidateResult>,\n  ): BooleanSchema<Input, 'async'> {\n    return this._addCheck(fn, true) as unknown as BooleanSchema<Input, 'async'>;\n  }\n\n  constructor() {\n    super((value, ctx) =>\n      typeof value === 'boolean'\n        ? null\n        : [{ code: ErrorCode.invalid_type, message: ctx!.messages.boolean.type(), path: [] }],\n    );\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    return { ...this._describeBase(), kind: 'boolean' };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    if (visitor.boolean) return visitor.boolean(this);\n\n    return super._walk(visitor);\n  }\n\n  static coerce(): BooleanSchema<unknown> {\n    return new BooleanSchema().preprocess((v: unknown) => {\n      if (typeof v === 'boolean') return v;\n\n      if (v === 'true' || v === '1' || v === 1) return true;\n\n      if (v === 'false' || v === '0' || v === 0) return false;\n\n      return v;\n    });\n  }\n}\n"],"mappings":"4EAIA,IAAa,EAAb,MAAa,UAAyE,CAA6B,CACjH,IAAuB,OAAgB,CACrC,MAAO,SACT,CAEA,WAEE,EAC+B,CAC/B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,aAAc,CACZ,OAAO,EAAO,IACZ,OAAO,GAAU,UACb,KACA,CAAC,CAAE,KAAM,EAAU,aAAc,QAAS,EAAK,SAAS,QAAQ,KAAK,EAAG,KAAM,CAAC,CAAE,CAAC,CACxF,CACF,CAEA,mBAAyD,CACvD,MAAO,CAAE,GAAG,KAAK,cAAc,EAAG,KAAM,SAAU,CACpD,CAEA,MAA4B,EAAoC,CAG9D,OAFI,EAAQ,QAAgB,EAAQ,QAAQ,IAAI,EAEzC,MAAM,MAAM,CAAO,CAC5B,CAEA,OAAO,QAAiC,CACtC,OAAO,IAAI,EAAc,CAAC,CAAC,WAAY,GACjC,OAAO,GAAM,UAAkB,EAE/B,IAAM,QAAU,IAAM,KAAO,IAAM,EAAU,GAE7C,IAAM,SAAW,IAAM,KAAO,IAAM,EAAU,GAE3C,CACR,CACH,CACF"}

package/dist/schemas/date.cjs

@@ -1,2 +1,2 @@
-const e=require("../types.cjs"),t=require("../errors.cjs"),n=require("../core.cjs");var r=class r extends n.Schema{get _kind(){return`date`}checkAsync(e){return this._addCheck(e,!0)}constructor(){super((n,r)=>n instanceof Date&&!Number.isNaN(n.getTime())?null:t.fail(e.ErrorCode.invalid_date,r.messages.date.type()))}min(n,r){return this._addConstraint((i,a)=>{let o=i;return o>=n?null:t.fail(e.ErrorCode.too_small,t.resolveMessage(r??a.messages.date.min,{min:n,value:o}),{min:n})})}max(n,r){return this._addConstraint((i,a)=>{let o=i;return o<=n?null:t.fail(e.ErrorCode.too_big,t.resolveMessage(r??a.messages.date.max,{max:n,value:o}),{max:n})})}coerce(){return r.coerce()}_toDescriptorImpl(){return{...this._describeBase(),kind:`date`}}_walk(e){return e.date?e.date(this):super._walk(e)}static coerce(){return new r().preprocess(e=>e instanceof Date?e:typeof e==`string`||typeof e==`number`?new Date(e):e)}};exports.DateSchema=r;
+const e=require("../errors.cjs"),t=require("../types.cjs"),n=require("../core.cjs");var r=class r extends n.Schema{get _kind(){return`date`}checkAsync(e){return this._addCheck(e,!0)}constructor(){super((n,r)=>n instanceof Date&&!Number.isNaN(n.getTime())?null:e.fail(t.ErrorCode.invalid_date,r.messages.date.type()))}min(n,r){return this._addConstraint((i,a)=>{let o=i;return o>=n?null:e.fail(t.ErrorCode.too_small,e.resolveMessage(r??a.messages.date.min,{min:n,value:o}),{min:n})})}max(n,r){return this._addConstraint((i,a)=>{let o=i;return o<=n?null:e.fail(t.ErrorCode.too_big,e.resolveMessage(r??a.messages.date.max,{max:n,value:o}),{max:n})})}_toDescriptorImpl(){return{...this._describeBase(),kind:`date`}}_walk(e){return e.date?e.date(this):super._walk(e)}static coerce(){return new r().preprocess(e=>e instanceof Date?e:typeof e==`string`||typeof e==`number`?new Date(e):e)}};exports.DateSchema=r;
 //# sourceMappingURL=date.cjs.map

package/dist/schemas/date.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"date.cjs","names":[],"sources":["../../src/schemas/date.ts"],"sourcesContent":["import type { CheckContext, MessageFn, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';\n\nimport { ErrorCode, fail, resolveMessage, Schema } from '../core';\n\nexport class DateSchema<Input = Date, Mode extends SchemaMode = 'sync'> extends Schema<Date, Input, Mode> {\n  protected override get _kind(): string {\n    return 'date';\n  }\n\n  override checkAsync(\n    this: DateSchema<Input, 'sync'>,\n    fn: (value: Date, ctx: CheckContext) => Promise<ValidateResult>,\n  ): DateSchema<Input, 'async'> {\n    return this._addCheck(fn, true) as unknown as DateSchema<Input, 'async'>;\n  }\n\n  constructor() {\n    super((value, ctx) =>\n      value instanceof Date && !Number.isNaN(value.getTime())\n        ? null\n        : fail(ErrorCode.invalid_date, ctx!.messages.date.type()),\n    );\n  }\n\n  min(date: Date, message?: MessageFn<{ min: Date; value: Date }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Date;\n\n      return typed >= date\n        ? null\n        : fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.date.min, { min: date, value: typed }), {\n            min: date,\n          });\n    });\n  }\n\n  max(date: Date, message?: MessageFn<{ max: Date; value: Date }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Date;\n\n      return typed <= date\n        ? null\n        : fail(ErrorCode.too_big, resolveMessage(message ?? ctx!.messages.date.max, { max: date, value: typed }), {\n            max: date,\n          });\n    });\n  }\n\n  /**\n   * Returns a new schema that coerces string or number input to a `Date` before validation.\n   *\n   * Equivalent to `s.coerce.date()`.\n   */\n  coerce(): DateSchema<unknown> {\n    return DateSchema.coerce();\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    return { ...this._describeBase(), kind: 'date' };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    if (visitor.date) return visitor.date(this);\n\n    return super._walk(visitor);\n  }\n\n  static coerce(): DateSchema<unknown> {\n    return new DateSchema().preprocess((v: unknown) => {\n      if (v instanceof Date) return v;\n\n      if (typeof v === 'string' || typeof v === 'number') return new Date(v);\n\n      return v;\n    });\n  }\n}\n"],"mappings":"oFAIA,IAAa,EAAb,MAAa,UAAmE,EAAA,MAA0B,CACxG,IAAuB,OAAgB,CACrC,MAAO,MACT,CAEA,WAEE,EAC4B,CAC5B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,aAAc,CACZ,OAAO,EAAO,IACZ,aAAiB,MAAQ,CAAC,OAAO,MAAM,EAAM,QAAQ,CAAC,EAClD,KACA,EAAA,KAAK,EAAA,UAAU,aAAc,EAAK,SAAS,KAAK,KAAK,CAAC,CAC5D,CACF,CAEA,IAAI,EAAY,EAAuD,CACrE,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAEd,OAAO,GAAS,EACZ,KACA,EAAA,KAAK,EAAA,UAAU,UAAW,EAAA,eAAe,GAAW,EAAK,SAAS,KAAK,IAAK,CAAE,IAAK,EAAM,MAAO,CAAM,CAAC,EAAG,CACxG,IAAK,CACP,CAAC,CACP,CAAC,CACH,CAEA,IAAI,EAAY,EAAuD,CACrE,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAEd,OAAO,GAAS,EACZ,KACA,EAAA,KAAK,EAAA,UAAU,QAAS,EAAA,eAAe,GAAW,EAAK,SAAS,KAAK,IAAK,CAAE,IAAK,EAAM,MAAO,CAAM,CAAC,EAAG,CACtG,IAAK,CACP,CAAC,CACP,CAAC,CACH,CAOA,QAA8B,CAC5B,OAAO,EAAW,OAAO,CAC3B,CAEA,mBAAyD,CACvD,MAAO,CAAE,GAAG,KAAK,cAAc,EAAG,KAAM,MAAO,CACjD,CAEA,MAA4B,EAAoC,CAG9D,OAFI,EAAQ,KAAa,EAAQ,KAAK,IAAI,EAEnC,MAAM,MAAM,CAAO,CAC5B,CAEA,OAAO,QAA8B,CACnC,OAAO,IAAI,EAAW,CAAC,CAAC,WAAY,GAC9B,aAAa,KAAa,EAE1B,OAAO,GAAM,UAAY,OAAO,GAAM,SAAiB,IAAI,KAAK,CAAC,EAE9D,CACR,CACH,CACF"}
+{"version":3,"file":"date.cjs","names":[],"sources":["../../src/schemas/date.ts"],"sourcesContent":["import type { CheckContext, MessageFn, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';\n\nimport { ErrorCode, fail, resolveMessage, Schema } from '../core';\n\nexport class DateSchema<Input = Date, Mode extends SchemaMode = 'sync'> extends Schema<Date, Input, Mode> {\n  protected override get _kind(): string {\n    return 'date';\n  }\n\n  override checkAsync(\n    this: DateSchema<Input, 'sync'>,\n    fn: (value: Date, ctx: CheckContext) => Promise<ValidateResult>,\n  ): DateSchema<Input, 'async'> {\n    return this._addCheck(fn, true) as unknown as DateSchema<Input, 'async'>;\n  }\n\n  constructor() {\n    super((value, ctx) =>\n      value instanceof Date && !Number.isNaN(value.getTime())\n        ? null\n        : fail(ErrorCode.invalid_date, ctx!.messages.date.type()),\n    );\n  }\n\n  min(date: Date, message?: MessageFn<{ min: Date; value: Date }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Date;\n\n      return typed >= date\n        ? null\n        : fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.date.min, { min: date, value: typed }), {\n            min: date,\n          });\n    });\n  }\n\n  max(date: Date, message?: MessageFn<{ max: Date; value: Date }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Date;\n\n      return typed <= date\n        ? null\n        : fail(ErrorCode.too_big, resolveMessage(message ?? ctx!.messages.date.max, { max: date, value: typed }), {\n            max: date,\n          });\n    });\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    return { ...this._describeBase(), kind: 'date' };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    if (visitor.date) return visitor.date(this);\n\n    return super._walk(visitor);\n  }\n\n  static coerce(): DateSchema<unknown> {\n    return new DateSchema().preprocess((v: unknown) => {\n      if (v instanceof Date) return v;\n\n      if (typeof v === 'string' || typeof v === 'number') return new Date(v);\n\n      return v;\n    });\n  }\n}\n"],"mappings":"oFAIA,IAAa,EAAb,MAAa,UAAmE,EAAA,MAA0B,CACxG,IAAuB,OAAgB,CACrC,MAAO,MACT,CAEA,WAEE,EAC4B,CAC5B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,aAAc,CACZ,OAAO,EAAO,IACZ,aAAiB,MAAQ,CAAC,OAAO,MAAM,EAAM,QAAQ,CAAC,EAClD,KACA,EAAA,KAAK,EAAA,UAAU,aAAc,EAAK,SAAS,KAAK,KAAK,CAAC,CAC5D,CACF,CAEA,IAAI,EAAY,EAAuD,CACrE,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAEd,OAAO,GAAS,EACZ,KACA,EAAA,KAAK,EAAA,UAAU,UAAW,EAAA,eAAe,GAAW,EAAK,SAAS,KAAK,IAAK,CAAE,IAAK,EAAM,MAAO,CAAM,CAAC,EAAG,CACxG,IAAK,CACP,CAAC,CACP,CAAC,CACH,CAEA,IAAI,EAAY,EAAuD,CACrE,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAEd,OAAO,GAAS,EACZ,KACA,EAAA,KAAK,EAAA,UAAU,QAAS,EAAA,eAAe,GAAW,EAAK,SAAS,KAAK,IAAK,CAAE,IAAK,EAAM,MAAO,CAAM,CAAC,EAAG,CACtG,IAAK,CACP,CAAC,CACP,CAAC,CACH,CAEA,mBAAyD,CACvD,MAAO,CAAE,GAAG,KAAK,cAAc,EAAG,KAAM,MAAO,CACjD,CAEA,MAA4B,EAAoC,CAG9D,OAFI,EAAQ,KAAa,EAAQ,KAAK,IAAI,EAEnC,MAAM,MAAM,CAAO,CAC5B,CAEA,OAAO,QAA8B,CACnC,OAAO,IAAI,EAAW,CAAC,CAAC,WAAY,GAC9B,aAAa,KAAa,EAE1B,OAAO,GAAM,UAAY,OAAO,GAAM,SAAiB,IAAI,KAAK,CAAC,EAE9D,CACR,CACH,CACF"}

package/dist/schemas/date.d.ts

@@ -12,12 +12,6 @@ export declare class DateSchema<Input = Date, Mode extends SchemaMode = 'sync'>
         max: Date;
         value: Date;
     }>): this;
-    /**
-     * Returns a new schema that coerces string or number input to a `Date` before validation.
-     *
-     * Equivalent to `s.coerce.date()`.
-     */
-    coerce(): DateSchema<unknown>;
     protected _toDescriptorImpl(): SchemaDescriptor;
     protected _walk<R>(visitor: SchemaWalker<R>): R | null;
     static coerce(): DateSchema<unknown>;

package/dist/schemas/date.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"date.d.ts","sourceRoot":"","sources":["../../src/schemas/date.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,gBAAgB,EAAE,UAAU,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAEnH,OAAO,EAAmC,MAAM,EAAE,MAAM,SAAS,CAAC;AAElE,qBAAa,UAAU,CAAC,KAAK,GAAG,IAAI,EAAE,IAAI,SAAS,UAAU,GAAG,MAAM,CAAE,SAAQ,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC;IACvG,cAAuB,KAAK,IAAI,MAAM,CAErC;IAEQ,UAAU,CACjB,IAAI,EAAE,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,EAC/B,EAAE,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,YAAY,KAAK,OAAO,CAAC,cAAc,CAAC,GAC9D,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC;;IAY7B,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,GAAG,EAAE,IAAI,CAAC;QAAC,KAAK,EAAE,IAAI,CAAA;KAAE,CAAC,GAAG,IAAI;IAYtE,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,GAAG,EAAE,IAAI,CAAC;QAAC,KAAK,EAAE,IAAI,CAAA;KAAE,CAAC,GAAG,IAAI;IAYtE;;;;OAIG;IACH,MAAM,IAAI,UAAU,CAAC,OAAO,CAAC;cAIV,iBAAiB,IAAI,gBAAgB;cAIrC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;IAM/D,MAAM,CAAC,MAAM,IAAI,UAAU,CAAC,OAAO,CAAC;CASrC"}
+{"version":3,"file":"date.d.ts","sourceRoot":"","sources":["../../src/schemas/date.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,gBAAgB,EAAE,UAAU,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAEnH,OAAO,EAAmC,MAAM,EAAE,MAAM,SAAS,CAAC;AAElE,qBAAa,UAAU,CAAC,KAAK,GAAG,IAAI,EAAE,IAAI,SAAS,UAAU,GAAG,MAAM,CAAE,SAAQ,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC;IACvG,cAAuB,KAAK,IAAI,MAAM,CAErC;IAEQ,UAAU,CACjB,IAAI,EAAE,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,EAC/B,EAAE,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,YAAY,KAAK,OAAO,CAAC,cAAc,CAAC,GAC9D,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC;;IAY7B,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,GAAG,EAAE,IAAI,CAAC;QAAC,KAAK,EAAE,IAAI,CAAA;KAAE,CAAC,GAAG,IAAI;IAYtE,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAE,GAAG,EAAE,IAAI,CAAC;QAAC,KAAK,EAAE,IAAI,CAAA;KAAE,CAAC,GAAG,IAAI;cAYnD,iBAAiB,IAAI,gBAAgB;cAIrC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;IAM/D,MAAM,CAAC,MAAM,IAAI,UAAU,CAAC,OAAO,CAAC;CASrC"}

package/dist/schemas/date.js

@@ -1,2 +1,2 @@
-import{ErrorCode as e}from"../types.js";import{fail as t,resolveMessage as n}from"../errors.js";import{Schema as r}from"../core.js";var i=class i extends r{get _kind(){return`date`}checkAsync(e){return this._addCheck(e,!0)}constructor(){super((n,r)=>n instanceof Date&&!Number.isNaN(n.getTime())?null:t(e.invalid_date,r.messages.date.type()))}min(r,i){return this._addConstraint((a,o)=>{let s=a;return s>=r?null:t(e.too_small,n(i??o.messages.date.min,{min:r,value:s}),{min:r})})}max(r,i){return this._addConstraint((a,o)=>{let s=a;return s<=r?null:t(e.too_big,n(i??o.messages.date.max,{max:r,value:s}),{max:r})})}coerce(){return i.coerce()}_toDescriptorImpl(){return{...this._describeBase(),kind:`date`}}_walk(e){return e.date?e.date(this):super._walk(e)}static coerce(){return new i().preprocess(e=>e instanceof Date?e:typeof e==`string`||typeof e==`number`?new Date(e):e)}};export{i as DateSchema};
+import{fail as e,resolveMessage as t}from"../errors.js";import{ErrorCode as n}from"../types.js";import{Schema as r}from"../core.js";var i=class i extends r{get _kind(){return`date`}checkAsync(e){return this._addCheck(e,!0)}constructor(){super((t,r)=>t instanceof Date&&!Number.isNaN(t.getTime())?null:e(n.invalid_date,r.messages.date.type()))}min(r,i){return this._addConstraint((a,o)=>{let s=a;return s>=r?null:e(n.too_small,t(i??o.messages.date.min,{min:r,value:s}),{min:r})})}max(r,i){return this._addConstraint((a,o)=>{let s=a;return s<=r?null:e(n.too_big,t(i??o.messages.date.max,{max:r,value:s}),{max:r})})}_toDescriptorImpl(){return{...this._describeBase(),kind:`date`}}_walk(e){return e.date?e.date(this):super._walk(e)}static coerce(){return new i().preprocess(e=>e instanceof Date?e:typeof e==`string`||typeof e==`number`?new Date(e):e)}};export{i as DateSchema};
 //# sourceMappingURL=date.js.map

package/dist/schemas/date.js.map

@@ -1 +1 @@
-{"version":3,"file":"date.js","names":[],"sources":["../../src/schemas/date.ts"],"sourcesContent":["import type { CheckContext, MessageFn, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';\n\nimport { ErrorCode, fail, resolveMessage, Schema } from '../core';\n\nexport class DateSchema<Input = Date, Mode extends SchemaMode = 'sync'> extends Schema<Date, Input, Mode> {\n  protected override get _kind(): string {\n    return 'date';\n  }\n\n  override checkAsync(\n    this: DateSchema<Input, 'sync'>,\n    fn: (value: Date, ctx: CheckContext) => Promise<ValidateResult>,\n  ): DateSchema<Input, 'async'> {\n    return this._addCheck(fn, true) as unknown as DateSchema<Input, 'async'>;\n  }\n\n  constructor() {\n    super((value, ctx) =>\n      value instanceof Date && !Number.isNaN(value.getTime())\n        ? null\n        : fail(ErrorCode.invalid_date, ctx!.messages.date.type()),\n    );\n  }\n\n  min(date: Date, message?: MessageFn<{ min: Date; value: Date }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Date;\n\n      return typed >= date\n        ? null\n        : fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.date.min, { min: date, value: typed }), {\n            min: date,\n          });\n    });\n  }\n\n  max(date: Date, message?: MessageFn<{ max: Date; value: Date }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Date;\n\n      return typed <= date\n        ? null\n        : fail(ErrorCode.too_big, resolveMessage(message ?? ctx!.messages.date.max, { max: date, value: typed }), {\n            max: date,\n          });\n    });\n  }\n\n  /**\n   * Returns a new schema that coerces string or number input to a `Date` before validation.\n   *\n   * Equivalent to `s.coerce.date()`.\n   */\n  coerce(): DateSchema<unknown> {\n    return DateSchema.coerce();\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    return { ...this._describeBase(), kind: 'date' };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    if (visitor.date) return visitor.date(this);\n\n    return super._walk(visitor);\n  }\n\n  static coerce(): DateSchema<unknown> {\n    return new DateSchema().preprocess((v: unknown) => {\n      if (v instanceof Date) return v;\n\n      if (typeof v === 'string' || typeof v === 'number') return new Date(v);\n\n      return v;\n    });\n  }\n}\n"],"mappings":"oIAIA,IAAa,EAAb,MAAa,UAAmE,CAA0B,CACxG,IAAuB,OAAgB,CACrC,MAAO,MACT,CAEA,WAEE,EAC4B,CAC5B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,aAAc,CACZ,OAAO,EAAO,IACZ,aAAiB,MAAQ,CAAC,OAAO,MAAM,EAAM,QAAQ,CAAC,EAClD,KACA,EAAK,EAAU,aAAc,EAAK,SAAS,KAAK,KAAK,CAAC,CAC5D,CACF,CAEA,IAAI,EAAY,EAAuD,CACrE,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAEd,OAAO,GAAS,EACZ,KACA,EAAK,EAAU,UAAW,EAAe,GAAW,EAAK,SAAS,KAAK,IAAK,CAAE,IAAK,EAAM,MAAO,CAAM,CAAC,EAAG,CACxG,IAAK,CACP,CAAC,CACP,CAAC,CACH,CAEA,IAAI,EAAY,EAAuD,CACrE,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAEd,OAAO,GAAS,EACZ,KACA,EAAK,EAAU,QAAS,EAAe,GAAW,EAAK,SAAS,KAAK,IAAK,CAAE,IAAK,EAAM,MAAO,CAAM,CAAC,EAAG,CACtG,IAAK,CACP,CAAC,CACP,CAAC,CACH,CAOA,QAA8B,CAC5B,OAAO,EAAW,OAAO,CAC3B,CAEA,mBAAyD,CACvD,MAAO,CAAE,GAAG,KAAK,cAAc,EAAG,KAAM,MAAO,CACjD,CAEA,MAA4B,EAAoC,CAG9D,OAFI,EAAQ,KAAa,EAAQ,KAAK,IAAI,EAEnC,MAAM,MAAM,CAAO,CAC5B,CAEA,OAAO,QAA8B,CACnC,OAAO,IAAI,EAAW,CAAC,CAAC,WAAY,GAC9B,aAAa,KAAa,EAE1B,OAAO,GAAM,UAAY,OAAO,GAAM,SAAiB,IAAI,KAAK,CAAC,EAE9D,CACR,CACH,CACF"}
+{"version":3,"file":"date.js","names":[],"sources":["../../src/schemas/date.ts"],"sourcesContent":["import type { CheckContext, MessageFn, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';\n\nimport { ErrorCode, fail, resolveMessage, Schema } from '../core';\n\nexport class DateSchema<Input = Date, Mode extends SchemaMode = 'sync'> extends Schema<Date, Input, Mode> {\n  protected override get _kind(): string {\n    return 'date';\n  }\n\n  override checkAsync(\n    this: DateSchema<Input, 'sync'>,\n    fn: (value: Date, ctx: CheckContext) => Promise<ValidateResult>,\n  ): DateSchema<Input, 'async'> {\n    return this._addCheck(fn, true) as unknown as DateSchema<Input, 'async'>;\n  }\n\n  constructor() {\n    super((value, ctx) =>\n      value instanceof Date && !Number.isNaN(value.getTime())\n        ? null\n        : fail(ErrorCode.invalid_date, ctx!.messages.date.type()),\n    );\n  }\n\n  min(date: Date, message?: MessageFn<{ min: Date; value: Date }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Date;\n\n      return typed >= date\n        ? null\n        : fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.date.min, { min: date, value: typed }), {\n            min: date,\n          });\n    });\n  }\n\n  max(date: Date, message?: MessageFn<{ max: Date; value: Date }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Date;\n\n      return typed <= date\n        ? null\n        : fail(ErrorCode.too_big, resolveMessage(message ?? ctx!.messages.date.max, { max: date, value: typed }), {\n            max: date,\n          });\n    });\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    return { ...this._describeBase(), kind: 'date' };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    if (visitor.date) return visitor.date(this);\n\n    return super._walk(visitor);\n  }\n\n  static coerce(): DateSchema<unknown> {\n    return new DateSchema().preprocess((v: unknown) => {\n      if (v instanceof Date) return v;\n\n      if (typeof v === 'string' || typeof v === 'number') return new Date(v);\n\n      return v;\n    });\n  }\n}\n"],"mappings":"oIAIA,IAAa,EAAb,MAAa,UAAmE,CAA0B,CACxG,IAAuB,OAAgB,CACrC,MAAO,MACT,CAEA,WAEE,EAC4B,CAC5B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,aAAc,CACZ,OAAO,EAAO,IACZ,aAAiB,MAAQ,CAAC,OAAO,MAAM,EAAM,QAAQ,CAAC,EAClD,KACA,EAAK,EAAU,aAAc,EAAK,SAAS,KAAK,KAAK,CAAC,CAC5D,CACF,CAEA,IAAI,EAAY,EAAuD,CACrE,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAEd,OAAO,GAAS,EACZ,KACA,EAAK,EAAU,UAAW,EAAe,GAAW,EAAK,SAAS,KAAK,IAAK,CAAE,IAAK,EAAM,MAAO,CAAM,CAAC,EAAG,CACxG,IAAK,CACP,CAAC,CACP,CAAC,CACH,CAEA,IAAI,EAAY,EAAuD,CACrE,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAEd,OAAO,GAAS,EACZ,KACA,EAAK,EAAU,QAAS,EAAe,GAAW,EAAK,SAAS,KAAK,IAAK,CAAE,IAAK,EAAM,MAAO,CAAM,CAAC,EAAG,CACtG,IAAK,CACP,CAAC,CACP,CAAC,CACH,CAEA,mBAAyD,CACvD,MAAO,CAAE,GAAG,KAAK,cAAc,EAAG,KAAM,MAAO,CACjD,CAEA,MAA4B,EAAoC,CAG9D,OAFI,EAAQ,KAAa,EAAQ,KAAK,IAAI,EAEnC,MAAM,MAAM,CAAO,CAC5B,CAEA,OAAO,QAA8B,CACnC,OAAO,IAAI,EAAW,CAAC,CAAC,WAAY,GAC9B,aAAa,KAAa,EAE1B,OAAO,GAAM,UAAY,OAAO,GAAM,SAAiB,IAAI,KAAK,CAAC,EAE9D,CACR,CACH,CACF"}

package/dist/schemas/intersect.cjs

@@ -1,2 +1,2 @@
-const e=require("../errors.cjs"),t=require("../safe-object.cjs"),n=require("../core.cjs");let r=require("@vielzeug/arsenal/guards");function i(e,n){if((0,r.isPlainObject)(e)&&(0,r.isPlainObject)(n)){let r=t.cloneRecord(e);for(let[a,o]of Object.entries(n))t.defineOwnProperty(r,a,i(e[a],o));return r}return n}var a=class extends n.Schema{schemas;get _kind(){return`intersect`}checkAsync(e){return this._addCheck(e,!0)}constructor(e){super(),this.schemas=Object.freeze([...e])}_parse(e,t){let n={hasOutput:!1,issues:[],output:e};for(let r=0;r<this.schemas.length;r++){let a=this.schemas[r]._parseFullSync(e,t);a.issues.length>0?n.issues.push(...a.issues):n.hasOutput?n.output=i(n.output,a.data):(n.hasOutput=!0,n.output=a.data)}return{data:n.output,issues:n.issues,typeOk:n.issues.length===0}}async parseAsync(t,r){let a=r??n._makeCtx();return this._withCatchAsync(async()=>{let n=this._prepareInput(t);if(n.skip)return n.value;let r={hasOutput:!1,issues:[],output:n.value};for(let e=0;e<this.schemas.length;e++){let t=await this.schemas[e]._parseFullAsync(n.value,a);t.issues.length>0?r.issues.push(...t.issues):r.hasOutput?r.output=i(r.output,t.data):(r.hasOutput=!0,r.output=t.data)}if(r.issues.length>0)throw new e.SpellValidationError(r.issues);let o=await this._runValidatorsAsync(r.output,a);if(o.length)throw new e.SpellValidationError(o);return this._runPostprocessors(r.output)})}_toDescriptorImpl(){return{...this._describeBase(),branches:this.schemas.map(e=>e.definition()),kind:`intersect`}}_walk(e){let t=this.schemas.map(t=>t.walk(e));return e.intersect?e.intersect(this,t):super._walk(e)}};exports.IntersectSchema=a;
+const e=require("../errors.cjs"),t=require("../safe-object.cjs"),n=require("../core.cjs");let r=require("@vielzeug/arsenal");function i(e,n){if((0,r.isPlainObject)(e)&&(0,r.isPlainObject)(n)){let r=t.cloneRecord(e);for(let[a,o]of Object.entries(n))t.defineOwnProperty(r,a,i(e[a],o));return r}return n}var a=class extends n.Schema{schemas;get _kind(){return`intersect`}checkAsync(e){return this._addCheck(e,!0)}constructor(e){super(),this.schemas=Object.freeze([...e])}_parse(e,t){let n={hasOutput:!1,issues:[],output:e};for(let r=0;r<this.schemas.length;r++){let a=this.schemas[r]._parseFullSync(e,t);a.issues.length>0?n.issues.push(...a.issues):n.hasOutput?n.output=i(n.output,a.data):(n.hasOutput=!0,n.output=a.data)}return{data:n.output,issues:n.issues,typeOk:n.issues.length===0}}async parseAsync(t,r){let a=r??n._makeCtx();return this._withCatchAsync(async()=>{let n=this._prepareInput(t);if(n.skip)return n.value;let r={hasOutput:!1,issues:[],output:n.value};for(let e=0;e<this.schemas.length;e++){let t=await this.schemas[e]._parseFullAsync(n.value,a);t.issues.length>0?r.issues.push(...t.issues):r.hasOutput?r.output=i(r.output,t.data):(r.hasOutput=!0,r.output=t.data)}if(r.issues.length>0)throw new e.SpellValidationError(r.issues);let o=await this._runValidatorsAsync(r.output,a);if(o.length)throw new e.SpellValidationError(o);return this._runPostprocessors(r.output)})}_toDescriptorImpl(){return{...this._describeBase(),branches:this.schemas.map(e=>e.definition()),kind:`intersect`}}_walk(e){let t=this.schemas.map(t=>t.walk(e));return e.intersect?e.intersect(this,t):super._walk(e)}};exports.IntersectSchema=a;
 //# sourceMappingURL=intersect.cjs.map

package/dist/schemas/intersect.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"intersect.cjs","names":[],"sources":["../../src/schemas/intersect.ts"],"sourcesContent":["import { isPlainObject } from '@vielzeug/arsenal/guards';\n\nimport type {\n  AnySchema,\n  CheckContext,\n  InferOutput,\n  InferSchemaMode,\n  Issue,\n  MergeSchemaModes,\n  ParseContext,\n  ParseValue,\n  SchemaDescriptor,\n  SchemaMode,\n  SchemaWalker,\n  ValidateResult,\n} from '../core';\n\nimport { _makeCtx, Schema, SpellValidationError } from '../core';\nimport { cloneRecord, defineOwnProperty } from '../safe-object';\n\ntype UnionToIntersection<U> = (U extends any ? (k: U) => void : never) extends (k: infer I) => void ? I : never;\n\n/**\n * Recursively merges `source` into `target`.\n * Plain objects are merged key-by-key; all other values take the `source` value.\n */\nfunction deepMerge(target: unknown, source: unknown): unknown {\n  if (isPlainObject(target) && isPlainObject(source)) {\n    const result = cloneRecord(target);\n\n    for (const [key, val] of Object.entries(source)) {\n      defineOwnProperty(result, key, deepMerge(target[key], val));\n    }\n\n    return result;\n  }\n\n  return source;\n}\n\n/** All schemas must pass — intersection semantics. */\nexport class IntersectSchema<\n  T extends readonly AnySchema[],\n  Mode extends SchemaMode = MergeSchemaModes<InferSchemaMode<T[number]>>,\n> extends Schema<UnionToIntersection<InferOutput<T[number]>>, unknown, Mode> {\n  readonly schemas: T;\n\n  protected override get _kind(): string {\n    return 'intersect';\n  }\n\n  override checkAsync(\n    this: IntersectSchema<T, 'sync'>,\n    fn: (value: UnionToIntersection<InferOutput<T[number]>>, ctx: CheckContext) => Promise<ValidateResult>,\n  ): IntersectSchema<T, 'async'> {\n    return this._addCheck(fn, true) as unknown as IntersectSchema<T, 'async'>;\n  }\n\n  constructor(schemas: T) {\n    super();\n    this.schemas = Object.freeze([...schemas]) as T;\n  }\n\n  protected override _parse(value: unknown, ctx: ParseContext): ParseValue {\n    const state: { hasOutput: boolean; issues: Issue[]; output: unknown } = {\n      hasOutput: false,\n      issues: [],\n      output: value,\n    };\n\n    for (let i = 0; i < this.schemas.length; i++) {\n      const result = this.schemas[i]._parseFullSync(value, ctx);\n\n      if (result.issues.length > 0) {\n        state.issues.push(...result.issues);\n      } else if (!state.hasOutput) {\n        state.hasOutput = true;\n        state.output = result.data;\n      } else {\n        state.output = deepMerge(state.output, result.data);\n      }\n    }\n\n    return { data: state.output, issues: state.issues, typeOk: state.issues.length === 0 };\n  }\n\n  override async parseAsync(value: unknown, ctx?: ParseContext): Promise<UnionToIntersection<InferOutput<T[number]>>> {\n    const c = ctx ?? _makeCtx();\n\n    return this._withCatchAsync(async () => {\n      const prepared = this._prepareInput(value);\n\n      if (prepared.skip) return prepared.value as UnionToIntersection<InferOutput<T[number]>>;\n\n      const state: { hasOutput: boolean; issues: Issue[]; output: unknown } = {\n        hasOutput: false,\n        issues: [],\n        output: prepared.value,\n      };\n\n      for (let i = 0; i < this.schemas.length; i++) {\n        const result = await this.schemas[i]._parseFullAsync(prepared.value, c);\n\n        if (result.issues.length > 0) {\n          state.issues.push(...result.issues);\n        } else if (!state.hasOutput) {\n          state.hasOutput = true;\n          state.output = result.data;\n        } else {\n          state.output = deepMerge(state.output, result.data);\n        }\n      }\n\n      if (state.issues.length > 0) throw new SpellValidationError(state.issues);\n\n      const validationIssues = await this._runValidatorsAsync(state.output, c);\n\n      if (validationIssues.length) throw new SpellValidationError(validationIssues);\n\n      return this._runPostprocessors(state.output) as UnionToIntersection<InferOutput<T[number]>>;\n    });\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    return { ...this._describeBase(), branches: this.schemas.map((s) => s.definition()), kind: 'intersect' };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    const branches = this.schemas.map((s) => s.walk(visitor));\n\n    if (visitor.intersect) return visitor.intersect(this, branches);\n\n    return super._walk(visitor);\n  }\n}\n"],"mappings":"oIA0BA,SAAS,EAAU,EAAiB,EAA0B,CAC5D,IAAA,EAAI,EAAA,cAAA,CAAc,CAAM,IAAA,EAAK,EAAA,cAAA,CAAc,CAAM,EAAG,CAClD,IAAM,EAAS,EAAA,YAAY,CAAM,EAEjC,IAAK,GAAM,CAAC,EAAK,KAAQ,OAAO,QAAQ,CAAM,EAC5C,EAAA,kBAAkB,EAAQ,EAAK,EAAU,EAAO,GAAM,CAAG,CAAC,EAG5D,OAAO,CACT,CAEA,OAAO,CACT,CAGA,IAAa,EAAb,cAGU,EAAA,MAAmE,CAC3E,QAEA,IAAuB,OAAgB,CACrC,MAAO,WACT,CAEA,WAEE,EAC6B,CAC7B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,YAAY,EAAY,CACtB,MAAM,EACN,KAAK,QAAU,OAAO,OAAO,CAAC,GAAG,CAAO,CAAC,CAC3C,CAEA,OAA0B,EAAgB,EAA+B,CACvE,IAAM,EAAkE,CACtE,UAAW,GACX,OAAQ,CAAC,EACT,OAAQ,CACV,EAEA,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,QAAQ,OAAQ,IAAK,CAC5C,IAAM,EAAS,KAAK,QAAQ,EAAE,CAAC,eAAe,EAAO,CAAG,EAEpD,EAAO,OAAO,OAAS,EACzB,EAAM,OAAO,KAAK,GAAG,EAAO,MAAM,EACxB,EAAM,UAIhB,EAAM,OAAS,EAAU,EAAM,OAAQ,EAAO,IAAI,GAHlD,EAAM,UAAY,GAClB,EAAM,OAAS,EAAO,KAI1B,CAEA,MAAO,CAAE,KAAM,EAAM,OAAQ,OAAQ,EAAM,OAAQ,OAAQ,EAAM,OAAO,SAAW,CAAE,CACvF,CAEA,MAAe,WAAW,EAAgB,EAA0E,CAClH,IAAM,EAAI,GAAO,EAAA,SAAS,EAE1B,OAAO,KAAK,gBAAgB,SAAY,CACtC,IAAM,EAAW,KAAK,cAAc,CAAK,EAEzC,GAAI,EAAS,KAAM,OAAO,EAAS,MAEnC,IAAM,EAAkE,CACtE,UAAW,GACX,OAAQ,CAAC,EACT,OAAQ,EAAS,KACnB,EAEA,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,QAAQ,OAAQ,IAAK,CAC5C,IAAM,EAAS,MAAM,KAAK,QAAQ,EAAE,CAAC,gBAAgB,EAAS,MAAO,CAAC,EAElE,EAAO,OAAO,OAAS,EACzB,EAAM,OAAO,KAAK,GAAG,EAAO,MAAM,EACxB,EAAM,UAIhB,EAAM,OAAS,EAAU,EAAM,OAAQ,EAAO,IAAI,GAHlD,EAAM,UAAY,GAClB,EAAM,OAAS,EAAO,KAI1B,CAEA,GAAI,EAAM,OAAO,OAAS,EAAG,MAAM,IAAI,EAAA,qBAAqB,EAAM,MAAM,EAExE,IAAM,EAAmB,MAAM,KAAK,oBAAoB,EAAM,OAAQ,CAAC,EAEvE,GAAI,EAAiB,OAAQ,MAAM,IAAI,EAAA,qBAAqB,CAAgB,EAE5E,OAAO,KAAK,mBAAmB,EAAM,MAAM,CAC7C,CAAC,CACH,CAEA,mBAAyD,CACvD,MAAO,CAAE,GAAG,KAAK,cAAc,EAAG,SAAU,KAAK,QAAQ,IAAK,GAAM,EAAE,WAAW,CAAC,EAAG,KAAM,WAAY,CACzG,CAEA,MAA4B,EAAoC,CAC9D,IAAM,EAAW,KAAK,QAAQ,IAAK,GAAM,EAAE,KAAK,CAAO,CAAC,EAIxD,OAFI,EAAQ,UAAkB,EAAQ,UAAU,KAAM,CAAQ,EAEvD,MAAM,MAAM,CAAO,CAC5B,CACF"}
+{"version":3,"file":"intersect.cjs","names":[],"sources":["../../src/schemas/intersect.ts"],"sourcesContent":["import { isPlainObject } from '@vielzeug/arsenal';\n\nimport type {\n  AnySchema,\n  CheckContext,\n  InferInput,\n  InferOutput,\n  InferSchemaMode,\n  Issue,\n  MergeSchemaModes,\n  ParseContext,\n  ParseValue,\n  SchemaDescriptor,\n  SchemaMode,\n  SchemaWalker,\n  ValidateResult,\n} from '../core';\n\nimport { _makeCtx, Schema, SpellValidationError } from '../core';\nimport { cloneRecord, defineOwnProperty } from '../safe-object';\n\ntype UnionToIntersection<U> = (U extends any ? (k: U) => void : never) extends (k: infer I) => void ? I : never;\n\n/**\n * Recursively merges `source` into `target`.\n * Plain objects are merged key-by-key; all other values take the `source` value.\n */\nfunction deepMerge(target: unknown, source: unknown): unknown {\n  if (isPlainObject(target) && isPlainObject(source)) {\n    const result = cloneRecord(target);\n\n    for (const [key, val] of Object.entries(source)) {\n      defineOwnProperty(result, key, deepMerge(target[key], val));\n    }\n\n    return result;\n  }\n\n  return source;\n}\n\n/** All schemas must pass — intersection semantics. */\nexport class IntersectSchema<\n  T extends readonly AnySchema[],\n  Mode extends SchemaMode = MergeSchemaModes<InferSchemaMode<T[number]>>,\n> extends Schema<UnionToIntersection<InferOutput<T[number]>>, UnionToIntersection<InferInput<T[number]>>, Mode> {\n  readonly schemas: T;\n\n  protected override get _kind(): string {\n    return 'intersect';\n  }\n\n  override checkAsync(\n    this: IntersectSchema<T, 'sync'>,\n    fn: (value: UnionToIntersection<InferOutput<T[number]>>, ctx: CheckContext) => Promise<ValidateResult>,\n  ): IntersectSchema<T, 'async'> {\n    return this._addCheck(fn, true) as unknown as IntersectSchema<T, 'async'>;\n  }\n\n  constructor(schemas: T) {\n    super();\n    this.schemas = Object.freeze([...schemas]) as T;\n  }\n\n  protected override _parse(value: unknown, ctx: ParseContext): ParseValue {\n    const state: { hasOutput: boolean; issues: Issue[]; output: unknown } = {\n      hasOutput: false,\n      issues: [],\n      output: value,\n    };\n\n    for (let i = 0; i < this.schemas.length; i++) {\n      const result = this.schemas[i]._parseFullSync(value, ctx);\n\n      if (result.issues.length > 0) {\n        state.issues.push(...result.issues);\n      } else if (!state.hasOutput) {\n        state.hasOutput = true;\n        state.output = result.data;\n      } else {\n        state.output = deepMerge(state.output, result.data);\n      }\n    }\n\n    return { data: state.output, issues: state.issues, typeOk: state.issues.length === 0 };\n  }\n\n  override async parseAsync(value: unknown, ctx?: ParseContext): Promise<UnionToIntersection<InferOutput<T[number]>>> {\n    const c = ctx ?? _makeCtx();\n\n    return this._withCatchAsync(async () => {\n      const prepared = this._prepareInput(value);\n\n      if (prepared.skip) return prepared.value as UnionToIntersection<InferOutput<T[number]>>;\n\n      const state: { hasOutput: boolean; issues: Issue[]; output: unknown } = {\n        hasOutput: false,\n        issues: [],\n        output: prepared.value,\n      };\n\n      for (let i = 0; i < this.schemas.length; i++) {\n        const result = await this.schemas[i]._parseFullAsync(prepared.value, c);\n\n        if (result.issues.length > 0) {\n          state.issues.push(...result.issues);\n        } else if (!state.hasOutput) {\n          state.hasOutput = true;\n          state.output = result.data;\n        } else {\n          state.output = deepMerge(state.output, result.data);\n        }\n      }\n\n      if (state.issues.length > 0) throw new SpellValidationError(state.issues);\n\n      const validationIssues = await this._runValidatorsAsync(state.output, c);\n\n      if (validationIssues.length) throw new SpellValidationError(validationIssues);\n\n      return this._runPostprocessors(state.output) as UnionToIntersection<InferOutput<T[number]>>;\n    });\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    return { ...this._describeBase(), branches: this.schemas.map((s) => s.definition()), kind: 'intersect' };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    const branches = this.schemas.map((s) => s.walk(visitor));\n\n    if (visitor.intersect) return visitor.intersect(this, branches);\n\n    return super._walk(visitor);\n  }\n}\n"],"mappings":"6HA2BA,SAAS,EAAU,EAAiB,EAA0B,CAC5D,IAAA,EAAI,EAAA,cAAA,CAAc,CAAM,IAAA,EAAK,EAAA,cAAA,CAAc,CAAM,EAAG,CAClD,IAAM,EAAS,EAAA,YAAY,CAAM,EAEjC,IAAK,GAAM,CAAC,EAAK,KAAQ,OAAO,QAAQ,CAAM,EAC5C,EAAA,kBAAkB,EAAQ,EAAK,EAAU,EAAO,GAAM,CAAG,CAAC,EAG5D,OAAO,CACT,CAEA,OAAO,CACT,CAGA,IAAa,EAAb,cAGU,EAAA,MAAsG,CAC9G,QAEA,IAAuB,OAAgB,CACrC,MAAO,WACT,CAEA,WAEE,EAC6B,CAC7B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,YAAY,EAAY,CACtB,MAAM,EACN,KAAK,QAAU,OAAO,OAAO,CAAC,GAAG,CAAO,CAAC,CAC3C,CAEA,OAA0B,EAAgB,EAA+B,CACvE,IAAM,EAAkE,CACtE,UAAW,GACX,OAAQ,CAAC,EACT,OAAQ,CACV,EAEA,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,QAAQ,OAAQ,IAAK,CAC5C,IAAM,EAAS,KAAK,QAAQ,EAAE,CAAC,eAAe,EAAO,CAAG,EAEpD,EAAO,OAAO,OAAS,EACzB,EAAM,OAAO,KAAK,GAAG,EAAO,MAAM,EACxB,EAAM,UAIhB,EAAM,OAAS,EAAU,EAAM,OAAQ,EAAO,IAAI,GAHlD,EAAM,UAAY,GAClB,EAAM,OAAS,EAAO,KAI1B,CAEA,MAAO,CAAE,KAAM,EAAM,OAAQ,OAAQ,EAAM,OAAQ,OAAQ,EAAM,OAAO,SAAW,CAAE,CACvF,CAEA,MAAe,WAAW,EAAgB,EAA0E,CAClH,IAAM,EAAI,GAAO,EAAA,SAAS,EAE1B,OAAO,KAAK,gBAAgB,SAAY,CACtC,IAAM,EAAW,KAAK,cAAc,CAAK,EAEzC,GAAI,EAAS,KAAM,OAAO,EAAS,MAEnC,IAAM,EAAkE,CACtE,UAAW,GACX,OAAQ,CAAC,EACT,OAAQ,EAAS,KACnB,EAEA,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,QAAQ,OAAQ,IAAK,CAC5C,IAAM,EAAS,MAAM,KAAK,QAAQ,EAAE,CAAC,gBAAgB,EAAS,MAAO,CAAC,EAElE,EAAO,OAAO,OAAS,EACzB,EAAM,OAAO,KAAK,GAAG,EAAO,MAAM,EACxB,EAAM,UAIhB,EAAM,OAAS,EAAU,EAAM,OAAQ,EAAO,IAAI,GAHlD,EAAM,UAAY,GAClB,EAAM,OAAS,EAAO,KAI1B,CAEA,GAAI,EAAM,OAAO,OAAS,EAAG,MAAM,IAAI,EAAA,qBAAqB,EAAM,MAAM,EAExE,IAAM,EAAmB,MAAM,KAAK,oBAAoB,EAAM,OAAQ,CAAC,EAEvE,GAAI,EAAiB,OAAQ,MAAM,IAAI,EAAA,qBAAqB,CAAgB,EAE5E,OAAO,KAAK,mBAAmB,EAAM,MAAM,CAC7C,CAAC,CACH,CAEA,mBAAyD,CACvD,MAAO,CAAE,GAAG,KAAK,cAAc,EAAG,SAAU,KAAK,QAAQ,IAAK,GAAM,EAAE,WAAW,CAAC,EAAG,KAAM,WAAY,CACzG,CAEA,MAA4B,EAAoC,CAC9D,IAAM,EAAW,KAAK,QAAQ,IAAK,GAAM,EAAE,KAAK,CAAO,CAAC,EAIxD,OAFI,EAAQ,UAAkB,EAAQ,UAAU,KAAM,CAAQ,EAEvD,MAAM,MAAM,CAAO,CAC5B,CACF"}

package/dist/schemas/intersect.d.ts

@@ -1,8 +1,8 @@
-import type { AnySchema, CheckContext, InferOutput, InferSchemaMode, MergeSchemaModes, ParseContext, ParseValue, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';
+import type { AnySchema, CheckContext, InferInput, InferOutput, InferSchemaMode, MergeSchemaModes, ParseContext, ParseValue, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';
 import { Schema } from '../core';
 type UnionToIntersection<U> = (U extends any ? (k: U) => void : never) extends (k: infer I) => void ? I : never;
 /** All schemas must pass — intersection semantics. */
-export declare class IntersectSchema<T extends readonly AnySchema[], Mode extends SchemaMode = MergeSchemaModes<InferSchemaMode<T[number]>>> extends Schema<UnionToIntersection<InferOutput<T[number]>>, unknown, Mode> {
+export declare class IntersectSchema<T extends readonly AnySchema[], Mode extends SchemaMode = MergeSchemaModes<InferSchemaMode<T[number]>>> extends Schema<UnionToIntersection<InferOutput<T[number]>>, UnionToIntersection<InferInput<T[number]>>, Mode> {
     readonly schemas: T;
     protected get _kind(): string;
     checkAsync(this: IntersectSchema<T, 'sync'>, fn: (value: UnionToIntersection<InferOutput<T[number]>>, ctx: CheckContext) => Promise<ValidateResult>): IntersectSchema<T, 'async'>;

package/dist/schemas/intersect.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"intersect.d.ts","sourceRoot":"","sources":["../../src/schemas/intersect.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EACV,SAAS,EACT,YAAY,EACZ,WAAW,EACX,eAAe,EAEf,gBAAgB,EAChB,YAAY,EACZ,UAAU,EACV,gBAAgB,EAChB,UAAU,EACV,YAAY,EACZ,cAAc,EACf,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAY,MAAM,EAAwB,MAAM,SAAS,CAAC;AAGjE,KAAK,mBAAmB,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC;AAoBhH,sDAAsD;AACtD,qBAAa,eAAe,CAC1B,CAAC,SAAS,SAAS,SAAS,EAAE,EAC9B,IAAI,SAAS,UAAU,GAAG,gBAAgB,CAAC,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CACtE,SAAQ,MAAM,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC;IAC1E,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;IAEpB,cAAuB,KAAK,IAAI,MAAM,CAErC;IAEQ,UAAU,CACjB,IAAI,EAAE,eAAe,CAAC,CAAC,EAAE,MAAM,CAAC,EAChC,EAAE,EAAE,CAAC,KAAK,EAAE,mBAAmB,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,YAAY,KAAK,OAAO,CAAC,cAAc,CAAC,GACrG,eAAe,CAAC,CAAC,EAAE,OAAO,CAAC;gBAIlB,OAAO,EAAE,CAAC;cAKH,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,YAAY,GAAG,UAAU;IAuBzD,UAAU,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;cAqChG,iBAAiB,IAAI,gBAAgB;cAIrC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;CAOhE"}
+{"version":3,"file":"intersect.d.ts","sourceRoot":"","sources":["../../src/schemas/intersect.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EACV,SAAS,EACT,YAAY,EACZ,UAAU,EACV,WAAW,EACX,eAAe,EAEf,gBAAgB,EAChB,YAAY,EACZ,UAAU,EACV,gBAAgB,EAChB,UAAU,EACV,YAAY,EACZ,cAAc,EACf,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAY,MAAM,EAAwB,MAAM,SAAS,CAAC;AAGjE,KAAK,mBAAmB,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC;AAoBhH,sDAAsD;AACtD,qBAAa,eAAe,CAC1B,CAAC,SAAS,SAAS,SAAS,EAAE,EAC9B,IAAI,SAAS,UAAU,GAAG,gBAAgB,CAAC,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CACtE,SAAQ,MAAM,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;IAC7G,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;IAEpB,cAAuB,KAAK,IAAI,MAAM,CAErC;IAEQ,UAAU,CACjB,IAAI,EAAE,eAAe,CAAC,CAAC,EAAE,MAAM,CAAC,EAChC,EAAE,EAAE,CAAC,KAAK,EAAE,mBAAmB,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,YAAY,KAAK,OAAO,CAAC,cAAc,CAAC,GACrG,eAAe,CAAC,CAAC,EAAE,OAAO,CAAC;gBAIlB,OAAO,EAAE,CAAC;cAKH,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,YAAY,GAAG,UAAU;IAuBzD,UAAU,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;cAqChG,iBAAiB,IAAI,gBAAgB;cAIrC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;CAOhE"}

package/dist/schemas/intersect.js

@@ -1,2 +1,2 @@
-import{SpellValidationError as e}from"../errors.js";import{cloneRecord as t,defineOwnProperty as n}from"../safe-object.js";import{Schema as r,_makeCtx as i}from"../core.js";import{isPlainObject as a}from"@vielzeug/arsenal/guards";function o(e,r){if(a(e)&&a(r)){let i=t(e);for(let[t,a]of Object.entries(r))n(i,t,o(e[t],a));return i}return r}var s=class extends r{schemas;get _kind(){return`intersect`}checkAsync(e){return this._addCheck(e,!0)}constructor(e){super(),this.schemas=Object.freeze([...e])}_parse(e,t){let n={hasOutput:!1,issues:[],output:e};for(let r=0;r<this.schemas.length;r++){let i=this.schemas[r]._parseFullSync(e,t);i.issues.length>0?n.issues.push(...i.issues):n.hasOutput?n.output=o(n.output,i.data):(n.hasOutput=!0,n.output=i.data)}return{data:n.output,issues:n.issues,typeOk:n.issues.length===0}}async parseAsync(t,n){let r=n??i();return this._withCatchAsync(async()=>{let n=this._prepareInput(t);if(n.skip)return n.value;let i={hasOutput:!1,issues:[],output:n.value};for(let e=0;e<this.schemas.length;e++){let t=await this.schemas[e]._parseFullAsync(n.value,r);t.issues.length>0?i.issues.push(...t.issues):i.hasOutput?i.output=o(i.output,t.data):(i.hasOutput=!0,i.output=t.data)}if(i.issues.length>0)throw new e(i.issues);let a=await this._runValidatorsAsync(i.output,r);if(a.length)throw new e(a);return this._runPostprocessors(i.output)})}_toDescriptorImpl(){return{...this._describeBase(),branches:this.schemas.map(e=>e.definition()),kind:`intersect`}}_walk(e){let t=this.schemas.map(t=>t.walk(e));return e.intersect?e.intersect(this,t):super._walk(e)}};export{s as IntersectSchema};
+import{SpellValidationError as e}from"../errors.js";import{cloneRecord as t,defineOwnProperty as n}from"../safe-object.js";import{Schema as r,_makeCtx as i}from"../core.js";import{isPlainObject as a}from"@vielzeug/arsenal";function o(e,r){if(a(e)&&a(r)){let i=t(e);for(let[t,a]of Object.entries(r))n(i,t,o(e[t],a));return i}return r}var s=class extends r{schemas;get _kind(){return`intersect`}checkAsync(e){return this._addCheck(e,!0)}constructor(e){super(),this.schemas=Object.freeze([...e])}_parse(e,t){let n={hasOutput:!1,issues:[],output:e};for(let r=0;r<this.schemas.length;r++){let i=this.schemas[r]._parseFullSync(e,t);i.issues.length>0?n.issues.push(...i.issues):n.hasOutput?n.output=o(n.output,i.data):(n.hasOutput=!0,n.output=i.data)}return{data:n.output,issues:n.issues,typeOk:n.issues.length===0}}async parseAsync(t,n){let r=n??i();return this._withCatchAsync(async()=>{let n=this._prepareInput(t);if(n.skip)return n.value;let i={hasOutput:!1,issues:[],output:n.value};for(let e=0;e<this.schemas.length;e++){let t=await this.schemas[e]._parseFullAsync(n.value,r);t.issues.length>0?i.issues.push(...t.issues):i.hasOutput?i.output=o(i.output,t.data):(i.hasOutput=!0,i.output=t.data)}if(i.issues.length>0)throw new e(i.issues);let a=await this._runValidatorsAsync(i.output,r);if(a.length)throw new e(a);return this._runPostprocessors(i.output)})}_toDescriptorImpl(){return{...this._describeBase(),branches:this.schemas.map(e=>e.definition()),kind:`intersect`}}_walk(e){let t=this.schemas.map(t=>t.walk(e));return e.intersect?e.intersect(this,t):super._walk(e)}};export{s as IntersectSchema};
 //# sourceMappingURL=intersect.js.map

package/dist/schemas/intersect.js.map

@@ -1 +1 @@
-{"version":3,"file":"intersect.js","names":[],"sources":["../../src/schemas/intersect.ts"],"sourcesContent":["import { isPlainObject } from '@vielzeug/arsenal/guards';\n\nimport type {\n  AnySchema,\n  CheckContext,\n  InferOutput,\n  InferSchemaMode,\n  Issue,\n  MergeSchemaModes,\n  ParseContext,\n  ParseValue,\n  SchemaDescriptor,\n  SchemaMode,\n  SchemaWalker,\n  ValidateResult,\n} from '../core';\n\nimport { _makeCtx, Schema, SpellValidationError } from '../core';\nimport { cloneRecord, defineOwnProperty } from '../safe-object';\n\ntype UnionToIntersection<U> = (U extends any ? (k: U) => void : never) extends (k: infer I) => void ? I : never;\n\n/**\n * Recursively merges `source` into `target`.\n * Plain objects are merged key-by-key; all other values take the `source` value.\n */\nfunction deepMerge(target: unknown, source: unknown): unknown {\n  if (isPlainObject(target) && isPlainObject(source)) {\n    const result = cloneRecord(target);\n\n    for (const [key, val] of Object.entries(source)) {\n      defineOwnProperty(result, key, deepMerge(target[key], val));\n    }\n\n    return result;\n  }\n\n  return source;\n}\n\n/** All schemas must pass — intersection semantics. */\nexport class IntersectSchema<\n  T extends readonly AnySchema[],\n  Mode extends SchemaMode = MergeSchemaModes<InferSchemaMode<T[number]>>,\n> extends Schema<UnionToIntersection<InferOutput<T[number]>>, unknown, Mode> {\n  readonly schemas: T;\n\n  protected override get _kind(): string {\n    return 'intersect';\n  }\n\n  override checkAsync(\n    this: IntersectSchema<T, 'sync'>,\n    fn: (value: UnionToIntersection<InferOutput<T[number]>>, ctx: CheckContext) => Promise<ValidateResult>,\n  ): IntersectSchema<T, 'async'> {\n    return this._addCheck(fn, true) as unknown as IntersectSchema<T, 'async'>;\n  }\n\n  constructor(schemas: T) {\n    super();\n    this.schemas = Object.freeze([...schemas]) as T;\n  }\n\n  protected override _parse(value: unknown, ctx: ParseContext): ParseValue {\n    const state: { hasOutput: boolean; issues: Issue[]; output: unknown } = {\n      hasOutput: false,\n      issues: [],\n      output: value,\n    };\n\n    for (let i = 0; i < this.schemas.length; i++) {\n      const result = this.schemas[i]._parseFullSync(value, ctx);\n\n      if (result.issues.length > 0) {\n        state.issues.push(...result.issues);\n      } else if (!state.hasOutput) {\n        state.hasOutput = true;\n        state.output = result.data;\n      } else {\n        state.output = deepMerge(state.output, result.data);\n      }\n    }\n\n    return { data: state.output, issues: state.issues, typeOk: state.issues.length === 0 };\n  }\n\n  override async parseAsync(value: unknown, ctx?: ParseContext): Promise<UnionToIntersection<InferOutput<T[number]>>> {\n    const c = ctx ?? _makeCtx();\n\n    return this._withCatchAsync(async () => {\n      const prepared = this._prepareInput(value);\n\n      if (prepared.skip) return prepared.value as UnionToIntersection<InferOutput<T[number]>>;\n\n      const state: { hasOutput: boolean; issues: Issue[]; output: unknown } = {\n        hasOutput: false,\n        issues: [],\n        output: prepared.value,\n      };\n\n      for (let i = 0; i < this.schemas.length; i++) {\n        const result = await this.schemas[i]._parseFullAsync(prepared.value, c);\n\n        if (result.issues.length > 0) {\n          state.issues.push(...result.issues);\n        } else if (!state.hasOutput) {\n          state.hasOutput = true;\n          state.output = result.data;\n        } else {\n          state.output = deepMerge(state.output, result.data);\n        }\n      }\n\n      if (state.issues.length > 0) throw new SpellValidationError(state.issues);\n\n      const validationIssues = await this._runValidatorsAsync(state.output, c);\n\n      if (validationIssues.length) throw new SpellValidationError(validationIssues);\n\n      return this._runPostprocessors(state.output) as UnionToIntersection<InferOutput<T[number]>>;\n    });\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    return { ...this._describeBase(), branches: this.schemas.map((s) => s.definition()), kind: 'intersect' };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    const branches = this.schemas.map((s) => s.walk(visitor));\n\n    if (visitor.intersect) return visitor.intersect(this, branches);\n\n    return super._walk(visitor);\n  }\n}\n"],"mappings":"sOA0BA,SAAS,EAAU,EAAiB,EAA0B,CAC5D,GAAI,EAAc,CAAM,GAAK,EAAc,CAAM,EAAG,CAClD,IAAM,EAAS,EAAY,CAAM,EAEjC,IAAK,GAAM,CAAC,EAAK,KAAQ,OAAO,QAAQ,CAAM,EAC5C,EAAkB,EAAQ,EAAK,EAAU,EAAO,GAAM,CAAG,CAAC,EAG5D,OAAO,CACT,CAEA,OAAO,CACT,CAGA,IAAa,EAAb,cAGU,CAAmE,CAC3E,QAEA,IAAuB,OAAgB,CACrC,MAAO,WACT,CAEA,WAEE,EAC6B,CAC7B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,YAAY,EAAY,CACtB,MAAM,EACN,KAAK,QAAU,OAAO,OAAO,CAAC,GAAG,CAAO,CAAC,CAC3C,CAEA,OAA0B,EAAgB,EAA+B,CACvE,IAAM,EAAkE,CACtE,UAAW,GACX,OAAQ,CAAC,EACT,OAAQ,CACV,EAEA,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,QAAQ,OAAQ,IAAK,CAC5C,IAAM,EAAS,KAAK,QAAQ,EAAE,CAAC,eAAe,EAAO,CAAG,EAEpD,EAAO,OAAO,OAAS,EACzB,EAAM,OAAO,KAAK,GAAG,EAAO,MAAM,EACxB,EAAM,UAIhB,EAAM,OAAS,EAAU,EAAM,OAAQ,EAAO,IAAI,GAHlD,EAAM,UAAY,GAClB,EAAM,OAAS,EAAO,KAI1B,CAEA,MAAO,CAAE,KAAM,EAAM,OAAQ,OAAQ,EAAM,OAAQ,OAAQ,EAAM,OAAO,SAAW,CAAE,CACvF,CAEA,MAAe,WAAW,EAAgB,EAA0E,CAClH,IAAM,EAAI,GAAO,EAAS,EAE1B,OAAO,KAAK,gBAAgB,SAAY,CACtC,IAAM,EAAW,KAAK,cAAc,CAAK,EAEzC,GAAI,EAAS,KAAM,OAAO,EAAS,MAEnC,IAAM,EAAkE,CACtE,UAAW,GACX,OAAQ,CAAC,EACT,OAAQ,EAAS,KACnB,EAEA,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,QAAQ,OAAQ,IAAK,CAC5C,IAAM,EAAS,MAAM,KAAK,QAAQ,EAAE,CAAC,gBAAgB,EAAS,MAAO,CAAC,EAElE,EAAO,OAAO,OAAS,EACzB,EAAM,OAAO,KAAK,GAAG,EAAO,MAAM,EACxB,EAAM,UAIhB,EAAM,OAAS,EAAU,EAAM,OAAQ,EAAO,IAAI,GAHlD,EAAM,UAAY,GAClB,EAAM,OAAS,EAAO,KAI1B,CAEA,GAAI,EAAM,OAAO,OAAS,EAAG,MAAM,IAAI,EAAqB,EAAM,MAAM,EAExE,IAAM,EAAmB,MAAM,KAAK,oBAAoB,EAAM,OAAQ,CAAC,EAEvE,GAAI,EAAiB,OAAQ,MAAM,IAAI,EAAqB,CAAgB,EAE5E,OAAO,KAAK,mBAAmB,EAAM,MAAM,CAC7C,CAAC,CACH,CAEA,mBAAyD,CACvD,MAAO,CAAE,GAAG,KAAK,cAAc,EAAG,SAAU,KAAK,QAAQ,IAAK,GAAM,EAAE,WAAW,CAAC,EAAG,KAAM,WAAY,CACzG,CAEA,MAA4B,EAAoC,CAC9D,IAAM,EAAW,KAAK,QAAQ,IAAK,GAAM,EAAE,KAAK,CAAO,CAAC,EAIxD,OAFI,EAAQ,UAAkB,EAAQ,UAAU,KAAM,CAAQ,EAEvD,MAAM,MAAM,CAAO,CAC5B,CACF"}
+{"version":3,"file":"intersect.js","names":[],"sources":["../../src/schemas/intersect.ts"],"sourcesContent":["import { isPlainObject } from '@vielzeug/arsenal';\n\nimport type {\n  AnySchema,\n  CheckContext,\n  InferInput,\n  InferOutput,\n  InferSchemaMode,\n  Issue,\n  MergeSchemaModes,\n  ParseContext,\n  ParseValue,\n  SchemaDescriptor,\n  SchemaMode,\n  SchemaWalker,\n  ValidateResult,\n} from '../core';\n\nimport { _makeCtx, Schema, SpellValidationError } from '../core';\nimport { cloneRecord, defineOwnProperty } from '../safe-object';\n\ntype UnionToIntersection<U> = (U extends any ? (k: U) => void : never) extends (k: infer I) => void ? I : never;\n\n/**\n * Recursively merges `source` into `target`.\n * Plain objects are merged key-by-key; all other values take the `source` value.\n */\nfunction deepMerge(target: unknown, source: unknown): unknown {\n  if (isPlainObject(target) && isPlainObject(source)) {\n    const result = cloneRecord(target);\n\n    for (const [key, val] of Object.entries(source)) {\n      defineOwnProperty(result, key, deepMerge(target[key], val));\n    }\n\n    return result;\n  }\n\n  return source;\n}\n\n/** All schemas must pass — intersection semantics. */\nexport class IntersectSchema<\n  T extends readonly AnySchema[],\n  Mode extends SchemaMode = MergeSchemaModes<InferSchemaMode<T[number]>>,\n> extends Schema<UnionToIntersection<InferOutput<T[number]>>, UnionToIntersection<InferInput<T[number]>>, Mode> {\n  readonly schemas: T;\n\n  protected override get _kind(): string {\n    return 'intersect';\n  }\n\n  override checkAsync(\n    this: IntersectSchema<T, 'sync'>,\n    fn: (value: UnionToIntersection<InferOutput<T[number]>>, ctx: CheckContext) => Promise<ValidateResult>,\n  ): IntersectSchema<T, 'async'> {\n    return this._addCheck(fn, true) as unknown as IntersectSchema<T, 'async'>;\n  }\n\n  constructor(schemas: T) {\n    super();\n    this.schemas = Object.freeze([...schemas]) as T;\n  }\n\n  protected override _parse(value: unknown, ctx: ParseContext): ParseValue {\n    const state: { hasOutput: boolean; issues: Issue[]; output: unknown } = {\n      hasOutput: false,\n      issues: [],\n      output: value,\n    };\n\n    for (let i = 0; i < this.schemas.length; i++) {\n      const result = this.schemas[i]._parseFullSync(value, ctx);\n\n      if (result.issues.length > 0) {\n        state.issues.push(...result.issues);\n      } else if (!state.hasOutput) {\n        state.hasOutput = true;\n        state.output = result.data;\n      } else {\n        state.output = deepMerge(state.output, result.data);\n      }\n    }\n\n    return { data: state.output, issues: state.issues, typeOk: state.issues.length === 0 };\n  }\n\n  override async parseAsync(value: unknown, ctx?: ParseContext): Promise<UnionToIntersection<InferOutput<T[number]>>> {\n    const c = ctx ?? _makeCtx();\n\n    return this._withCatchAsync(async () => {\n      const prepared = this._prepareInput(value);\n\n      if (prepared.skip) return prepared.value as UnionToIntersection<InferOutput<T[number]>>;\n\n      const state: { hasOutput: boolean; issues: Issue[]; output: unknown } = {\n        hasOutput: false,\n        issues: [],\n        output: prepared.value,\n      };\n\n      for (let i = 0; i < this.schemas.length; i++) {\n        const result = await this.schemas[i]._parseFullAsync(prepared.value, c);\n\n        if (result.issues.length > 0) {\n          state.issues.push(...result.issues);\n        } else if (!state.hasOutput) {\n          state.hasOutput = true;\n          state.output = result.data;\n        } else {\n          state.output = deepMerge(state.output, result.data);\n        }\n      }\n\n      if (state.issues.length > 0) throw new SpellValidationError(state.issues);\n\n      const validationIssues = await this._runValidatorsAsync(state.output, c);\n\n      if (validationIssues.length) throw new SpellValidationError(validationIssues);\n\n      return this._runPostprocessors(state.output) as UnionToIntersection<InferOutput<T[number]>>;\n    });\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    return { ...this._describeBase(), branches: this.schemas.map((s) => s.definition()), kind: 'intersect' };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    const branches = this.schemas.map((s) => s.walk(visitor));\n\n    if (visitor.intersect) return visitor.intersect(this, branches);\n\n    return super._walk(visitor);\n  }\n}\n"],"mappings":"+NA2BA,SAAS,EAAU,EAAiB,EAA0B,CAC5D,GAAI,EAAc,CAAM,GAAK,EAAc,CAAM,EAAG,CAClD,IAAM,EAAS,EAAY,CAAM,EAEjC,IAAK,GAAM,CAAC,EAAK,KAAQ,OAAO,QAAQ,CAAM,EAC5C,EAAkB,EAAQ,EAAK,EAAU,EAAO,GAAM,CAAG,CAAC,EAG5D,OAAO,CACT,CAEA,OAAO,CACT,CAGA,IAAa,EAAb,cAGU,CAAsG,CAC9G,QAEA,IAAuB,OAAgB,CACrC,MAAO,WACT,CAEA,WAEE,EAC6B,CAC7B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,YAAY,EAAY,CACtB,MAAM,EACN,KAAK,QAAU,OAAO,OAAO,CAAC,GAAG,CAAO,CAAC,CAC3C,CAEA,OAA0B,EAAgB,EAA+B,CACvE,IAAM,EAAkE,CACtE,UAAW,GACX,OAAQ,CAAC,EACT,OAAQ,CACV,EAEA,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,QAAQ,OAAQ,IAAK,CAC5C,IAAM,EAAS,KAAK,QAAQ,EAAE,CAAC,eAAe,EAAO,CAAG,EAEpD,EAAO,OAAO,OAAS,EACzB,EAAM,OAAO,KAAK,GAAG,EAAO,MAAM,EACxB,EAAM,UAIhB,EAAM,OAAS,EAAU,EAAM,OAAQ,EAAO,IAAI,GAHlD,EAAM,UAAY,GAClB,EAAM,OAAS,EAAO,KAI1B,CAEA,MAAO,CAAE,KAAM,EAAM,OAAQ,OAAQ,EAAM,OAAQ,OAAQ,EAAM,OAAO,SAAW,CAAE,CACvF,CAEA,MAAe,WAAW,EAAgB,EAA0E,CAClH,IAAM,EAAI,GAAO,EAAS,EAE1B,OAAO,KAAK,gBAAgB,SAAY,CACtC,IAAM,EAAW,KAAK,cAAc,CAAK,EAEzC,GAAI,EAAS,KAAM,OAAO,EAAS,MAEnC,IAAM,EAAkE,CACtE,UAAW,GACX,OAAQ,CAAC,EACT,OAAQ,EAAS,KACnB,EAEA,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,QAAQ,OAAQ,IAAK,CAC5C,IAAM,EAAS,MAAM,KAAK,QAAQ,EAAE,CAAC,gBAAgB,EAAS,MAAO,CAAC,EAElE,EAAO,OAAO,OAAS,EACzB,EAAM,OAAO,KAAK,GAAG,EAAO,MAAM,EACxB,EAAM,UAIhB,EAAM,OAAS,EAAU,EAAM,OAAQ,EAAO,IAAI,GAHlD,EAAM,UAAY,GAClB,EAAM,OAAS,EAAO,KAI1B,CAEA,GAAI,EAAM,OAAO,OAAS,EAAG,MAAM,IAAI,EAAqB,EAAM,MAAM,EAExE,IAAM,EAAmB,MAAM,KAAK,oBAAoB,EAAM,OAAQ,CAAC,EAEvE,GAAI,EAAiB,OAAQ,MAAM,IAAI,EAAqB,CAAgB,EAE5E,OAAO,KAAK,mBAAmB,EAAM,MAAM,CAC7C,CAAC,CACH,CAEA,mBAAyD,CACvD,MAAO,CAAE,GAAG,KAAK,cAAc,EAAG,SAAU,KAAK,QAAQ,IAAK,GAAM,EAAE,WAAW,CAAC,EAAG,KAAM,WAAY,CACzG,CAEA,MAA4B,EAAoC,CAC9D,IAAM,EAAW,KAAK,QAAQ,IAAK,GAAM,EAAE,KAAK,CAAO,CAAC,EAIxD,OAFI,EAAQ,UAAkB,EAAQ,UAAU,KAAM,CAAQ,EAEvD,MAAM,MAAM,CAAO,CAC5B,CACF"}

package/dist/schemas/map.cjs

@@ -1,2 +1,2 @@
-const e=require("../types.cjs"),t=require("../errors.cjs"),n=require("../core.cjs");var r=class extends n.Schema{keySchema;valueSchema;get _kind(){return`map`}checkAsync(e){return this._addCheck(e,!0)}constructor(e,t){super(),this.keySchema=e,this.valueSchema=t}_parse(n,r){if(!(n instanceof Map))return{data:n,issues:[{code:e.ErrorCode.invalid_type,message:r.messages.map.type(),path:[]}],typeOk:!1};let i=new Map,a=[],o=0;for(let[e,s]of n){let n=this.keySchema._parseFullSync(e,r),c=this.valueSchema._parseFullSync(s,r);n.issues.length>0&&a.push(...t.prependIssuePath(n.issues,o)),c.issues.length>0&&a.push(...t.prependIssuePath(c.issues,o)),n.issues.length===0&&c.issues.length===0&&i.set(n.data,c.data),o+=1}return{data:i,issues:a,typeOk:!0}}async parseAsync(r,i){let a=i??n._makeCtx();return this._withCatchAsync(async()=>{let n=this._prepareInput(r);if(n.skip)return n.value;let i=n.value;if(!(i instanceof Map))throw new t.SpellValidationError([{code:e.ErrorCode.invalid_type,message:a.messages.map.type(),path:[]}]);let o=[...i],s=await Promise.all(o.map(([e,t])=>Promise.all([this.keySchema._parseFullAsync(e,a),this.valueSchema._parseFullAsync(t,a)]))),c=[],l=new Map;for(let e=0;e<s.length;e++){let[n,r]=s[e];n.issues.length>0&&c.push(...t.prependIssuePath(n.issues,e)),r.issues.length>0&&c.push(...t.prependIssuePath(r.issues,e)),n.issues.length===0&&r.issues.length===0&&l.set(n.data,r.data)}let u=await this._runValidatorsAsync(l,a),d=[...c,...u];if(d.length>0)throw new t.SpellValidationError(d);return this._runPostprocessors(l)})}min(n,r){return this._addConstraint((i,a)=>{let o=i;return o.size>=n?null:t.fail(e.ErrorCode.too_small,t.resolveMessage(r??a.messages.map.min,{min:n,value:o}),{min:n})})}max(n,r){return this._addConstraint((i,a)=>{let o=i;return o.size<=n?null:t.fail(e.ErrorCode.too_big,t.resolveMessage(r??a.messages.map.max,{max:n,value:o}),{max:n})})}size(n,r){return this._addConstraint((i,a)=>{let o=i;return o.size===n?null:t.fail(e.ErrorCode.invalid_length,t.resolveMessage(r??a.messages.map.size,{exact:n,value:o}),{exact:n})})}nonEmpty(n){return this._addConstraint((r,i)=>r.size>0?null:t.fail(e.ErrorCode.too_small,t.resolveMessage(n??i.messages.map.nonEmpty,{min:1}),{min:1}))}_toDescriptorImpl(){return{...this._describeBase(),key:this.keySchema.definition(),kind:`map`,value:this.valueSchema.definition()}}_walk(e){let t=this.keySchema.walk(e),n=this.valueSchema.walk(e);return e.map?e.map(this,t,n):super._walk(e)}};exports.MapSchema=r;
+const e=require("../errors.cjs"),t=require("../types.cjs"),n=require("../core.cjs");var r=class extends n.Schema{keySchema;valueSchema;get _kind(){return`map`}checkAsync(e){return this._addCheck(e,!0)}constructor(e,t){super(),this.keySchema=e,this.valueSchema=t}_parse(n,r){if(!(n instanceof Map))return{data:n,issues:[{code:t.ErrorCode.invalid_type,message:r.messages.map.type(),path:[]}],typeOk:!1};let i=new Map,a=[],o=0;for(let[t,s]of n){let n=this.keySchema._parseFullSync(t,r),c=this.valueSchema._parseFullSync(s,r);n.issues.length>0&&a.push(...e.prependIssuePath(n.issues,o)),c.issues.length>0&&a.push(...e.prependIssuePath(c.issues,o)),n.issues.length===0&&c.issues.length===0&&i.set(n.data,c.data),o+=1}return{data:i,issues:a,typeOk:!0}}async parseAsync(r,i){let a=i??n._makeCtx();return this._withCatchAsync(async()=>{let n=this._prepareInput(r);if(n.skip)return n.value;let i=n.value;if(!(i instanceof Map))throw new e.SpellValidationError([{code:t.ErrorCode.invalid_type,message:a.messages.map.type(),path:[]}]);let o=[...i],s=await Promise.all(o.map(([e,t])=>Promise.all([this.keySchema._parseFullAsync(e,a),this.valueSchema._parseFullAsync(t,a)]))),c=[],l=new Map;for(let t=0;t<s.length;t++){let[n,r]=s[t];n.issues.length>0&&c.push(...e.prependIssuePath(n.issues,t)),r.issues.length>0&&c.push(...e.prependIssuePath(r.issues,t)),n.issues.length===0&&r.issues.length===0&&l.set(n.data,r.data)}let u=await this._runValidatorsAsync(l,a),d=[...c,...u];if(d.length>0)throw new e.SpellValidationError(d);return this._runPostprocessors(l)})}min(n,r){return this._addConstraint((i,a)=>{let o=i;return o.size>=n?null:e.fail(t.ErrorCode.too_small,e.resolveMessage(r??a.messages.map.min,{min:n,value:o}),{min:n})})}max(n,r){return this._addConstraint((i,a)=>{let o=i;return o.size<=n?null:e.fail(t.ErrorCode.too_big,e.resolveMessage(r??a.messages.map.max,{max:n,value:o}),{max:n})})}size(n,r){return this._addConstraint((i,a)=>{let o=i;return o.size===n?null:e.fail(t.ErrorCode.invalid_length,e.resolveMessage(r??a.messages.map.size,{exact:n,value:o}),{exact:n})})}nonEmpty(n){return this._addConstraint((r,i)=>r.size>0?null:e.fail(t.ErrorCode.too_small,e.resolveMessage(n??i.messages.map.nonEmpty,{min:1}),{min:1}))}_toDescriptorImpl(){return{...this._describeBase(),key:this.keySchema.definition(),kind:`map`,value:this.valueSchema.definition()}}_walk(e){let t=this.keySchema.walk(e),n=this.valueSchema.walk(e);return e.map?e.map(this,t,n):super._walk(e)}};exports.MapSchema=r;
 //# sourceMappingURL=map.cjs.map

package/dist/schemas/map.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"map.cjs","names":[],"sources":["../../src/schemas/map.ts"],"sourcesContent":["import type {\n  AnySchema,\n  CheckContext,\n  InferOutput,\n  InferSchemaMode,\n  Issue,\n  MergeSchemaModes,\n  MessageFn,\n  ParseContext,\n  ParseValue,\n  SchemaDescriptor,\n  SchemaMode,\n  SchemaWalker,\n  ValidateResult,\n} from '../core';\n\nimport { _makeCtx, ErrorCode, fail, prependIssuePath, resolveMessage, Schema, SpellValidationError } from '../core';\n\nexport class MapSchema<\n  K extends AnySchema,\n  V extends AnySchema,\n  Mode extends SchemaMode = MergeSchemaModes<InferSchemaMode<K | V>>,\n> extends Schema<Map<InferOutput<K>, InferOutput<V>>, unknown, Mode> {\n  readonly keySchema: K;\n  readonly valueSchema: V;\n\n  protected override get _kind(): string {\n    return 'map';\n  }\n\n  override checkAsync(\n    this: MapSchema<K, V, 'sync'>,\n    fn: (value: Map<InferOutput<K>, InferOutput<V>>, ctx: CheckContext) => Promise<ValidateResult>,\n  ): MapSchema<K, V, 'async'> {\n    return this._addCheck(fn, true) as unknown as MapSchema<K, V, 'async'>;\n  }\n\n  constructor(keySchema: K, valueSchema: V) {\n    super();\n    this.keySchema = keySchema;\n    this.valueSchema = valueSchema;\n  }\n\n  protected override _parse(value: unknown, ctx: ParseContext): ParseValue {\n    if (!(value instanceof Map)) {\n      return {\n        data: value,\n        issues: [{ code: ErrorCode.invalid_type, message: ctx.messages.map.type(), path: [] }],\n        typeOk: false,\n      };\n    }\n\n    const out = new Map<InferOutput<K>, InferOutput<V>>();\n    const issues: Issue[] = [];\n    let i = 0;\n\n    for (const [key, val] of value) {\n      const keyResult = this.keySchema._parseFullSync(key, ctx);\n      const valResult = this.valueSchema._parseFullSync(val, ctx);\n\n      if (keyResult.issues.length > 0) issues.push(...prependIssuePath(keyResult.issues, i));\n\n      if (valResult.issues.length > 0) issues.push(...prependIssuePath(valResult.issues, i));\n\n      if (keyResult.issues.length === 0 && valResult.issues.length === 0)\n        out.set(keyResult.data as InferOutput<K>, valResult.data as InferOutput<V>);\n\n      i += 1;\n    }\n\n    return { data: out, issues, typeOk: true };\n  }\n\n  override async parseAsync(value: unknown, ctx?: ParseContext): Promise<Map<InferOutput<K>, InferOutput<V>>> {\n    const c = ctx ?? _makeCtx();\n\n    return this._withCatchAsync(async () => {\n      const prepared = this._prepareInput(value);\n\n      if (prepared.skip) return prepared.value as unknown as Map<InferOutput<K>, InferOutput<V>>;\n\n      const raw = prepared.value;\n\n      if (!(raw instanceof Map)) {\n        throw new SpellValidationError([{ code: ErrorCode.invalid_type, message: c.messages.map.type(), path: [] }]);\n      }\n\n      const entries = [...raw];\n      const settled = await Promise.all(\n        entries.map(([key, val]) =>\n          Promise.all([this.keySchema._parseFullAsync(key, c), this.valueSchema._parseFullAsync(val, c)]),\n        ),\n      );\n\n      const issues: Issue[] = [];\n      const out = new Map<InferOutput<K>, InferOutput<V>>();\n\n      for (let i = 0; i < settled.length; i++) {\n        const [keyResult, valResult] = settled[i];\n\n        if (keyResult.issues.length > 0) issues.push(...prependIssuePath(keyResult.issues, i));\n\n        if (valResult.issues.length > 0) issues.push(...prependIssuePath(valResult.issues, i));\n\n        if (keyResult.issues.length === 0 && valResult.issues.length === 0)\n          out.set(keyResult.data as InferOutput<K>, valResult.data as InferOutput<V>);\n      }\n\n      const validationIssues = await this._runValidatorsAsync(out, c);\n      const allIssues = [...issues, ...validationIssues];\n\n      if (allIssues.length > 0) throw new SpellValidationError(allIssues);\n\n      return this._runPostprocessors(out) as Map<InferOutput<K>, InferOutput<V>>;\n    });\n  }\n\n  min(size: number, message?: MessageFn<{ min: number; value: Map<unknown, unknown> }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Map<unknown, unknown>;\n\n      if (typed.size >= size) return null;\n\n      return fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.map.min, { min: size, value: typed }), {\n        min: size,\n      });\n    });\n  }\n\n  max(size: number, message?: MessageFn<{ max: number; value: Map<unknown, unknown> }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Map<unknown, unknown>;\n\n      if (typed.size <= size) return null;\n\n      return fail(ErrorCode.too_big, resolveMessage(message ?? ctx!.messages.map.max, { max: size, value: typed }), {\n        max: size,\n      });\n    });\n  }\n\n  size(exact: number, message?: MessageFn<{ exact: number; value: Map<unknown, unknown> }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Map<unknown, unknown>;\n\n      if (typed.size === exact) return null;\n\n      return fail(\n        ErrorCode.invalid_length,\n        resolveMessage(message ?? ctx!.messages.map.size, { exact, value: typed }),\n        { exact },\n      );\n    });\n  }\n\n  nonEmpty(message?: MessageFn<{ min: number }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Map<unknown, unknown>;\n\n      if (typed.size > 0) return null;\n\n      return fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.map.nonEmpty, { min: 1 }), { min: 1 });\n    });\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    return {\n      ...this._describeBase(),\n      key: this.keySchema.definition(),\n      kind: 'map',\n      value: this.valueSchema.definition(),\n    };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    const key = this.keySchema.walk(visitor);\n    const value = this.valueSchema.walk(visitor);\n\n    if (visitor.map) return visitor.map(this, key, value);\n\n    return super._walk(visitor);\n  }\n}\n"],"mappings":"oFAkBA,IAAa,EAAb,cAIU,EAAA,MAA2D,CACnE,UACA,YAEA,IAAuB,OAAgB,CACrC,MAAO,KACT,CAEA,WAEE,EAC0B,CAC1B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,YAAY,EAAc,EAAgB,CACxC,MAAM,EACN,KAAK,UAAY,EACjB,KAAK,YAAc,CACrB,CAEA,OAA0B,EAAgB,EAA+B,CACvE,GAAI,EAAE,aAAiB,KACrB,MAAO,CACL,KAAM,EACN,OAAQ,CAAC,CAAE,KAAM,EAAA,UAAU,aAAc,QAAS,EAAI,SAAS,IAAI,KAAK,EAAG,KAAM,CAAC,CAAE,CAAC,EACrF,OAAQ,EACV,EAGF,IAAM,EAAM,IAAI,IACV,EAAkB,CAAC,EACrB,EAAI,EAER,IAAK,GAAM,CAAC,EAAK,KAAQ,EAAO,CAC9B,IAAM,EAAY,KAAK,UAAU,eAAe,EAAK,CAAG,EAClD,EAAY,KAAK,YAAY,eAAe,EAAK,CAAG,EAEtD,EAAU,OAAO,OAAS,GAAG,EAAO,KAAK,GAAG,EAAA,iBAAiB,EAAU,OAAQ,CAAC,CAAC,EAEjF,EAAU,OAAO,OAAS,GAAG,EAAO,KAAK,GAAG,EAAA,iBAAiB,EAAU,OAAQ,CAAC,CAAC,EAEjF,EAAU,OAAO,SAAW,GAAK,EAAU,OAAO,SAAW,GAC/D,EAAI,IAAI,EAAU,KAAwB,EAAU,IAAsB,EAE5E,GAAK,CACP,CAEA,MAAO,CAAE,KAAM,EAAK,SAAQ,OAAQ,EAAK,CAC3C,CAEA,MAAe,WAAW,EAAgB,EAAkE,CAC1G,IAAM,EAAI,GAAO,EAAA,SAAS,EAE1B,OAAO,KAAK,gBAAgB,SAAY,CACtC,IAAM,EAAW,KAAK,cAAc,CAAK,EAEzC,GAAI,EAAS,KAAM,OAAO,EAAS,MAEnC,IAAM,EAAM,EAAS,MAErB,GAAI,EAAE,aAAe,KACnB,MAAM,IAAI,EAAA,qBAAqB,CAAC,CAAE,KAAM,EAAA,UAAU,aAAc,QAAS,EAAE,SAAS,IAAI,KAAK,EAAG,KAAM,CAAC,CAAE,CAAC,CAAC,EAG7G,IAAM,EAAU,CAAC,GAAG,CAAG,EACjB,EAAU,MAAM,QAAQ,IAC5B,EAAQ,KAAK,CAAC,EAAK,KACjB,QAAQ,IAAI,CAAC,KAAK,UAAU,gBAAgB,EAAK,CAAC,EAAG,KAAK,YAAY,gBAAgB,EAAK,CAAC,CAAC,CAAC,CAChG,CACF,EAEM,EAAkB,CAAC,EACnB,EAAM,IAAI,IAEhB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAAK,CACvC,GAAM,CAAC,EAAW,GAAa,EAAQ,GAEnC,EAAU,OAAO,OAAS,GAAG,EAAO,KAAK,GAAG,EAAA,iBAAiB,EAAU,OAAQ,CAAC,CAAC,EAEjF,EAAU,OAAO,OAAS,GAAG,EAAO,KAAK,GAAG,EAAA,iBAAiB,EAAU,OAAQ,CAAC,CAAC,EAEjF,EAAU,OAAO,SAAW,GAAK,EAAU,OAAO,SAAW,GAC/D,EAAI,IAAI,EAAU,KAAwB,EAAU,IAAsB,CAC9E,CAEA,IAAM,EAAmB,MAAM,KAAK,oBAAoB,EAAK,CAAC,EACxD,EAAY,CAAC,GAAG,EAAQ,GAAG,CAAgB,EAEjD,GAAI,EAAU,OAAS,EAAG,MAAM,IAAI,EAAA,qBAAqB,CAAS,EAElE,OAAO,KAAK,mBAAmB,CAAG,CACpC,CAAC,CACH,CAEA,IAAI,EAAc,EAA0E,CAC1F,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAM,MAAQ,EAAa,KAExB,EAAA,KAAK,EAAA,UAAU,UAAW,EAAA,eAAe,GAAW,EAAK,SAAS,IAAI,IAAK,CAAE,IAAK,EAAM,MAAO,CAAM,CAAC,EAAG,CAC9G,IAAK,CACP,CAAC,CACH,CAAC,CACH,CAEA,IAAI,EAAc,EAA0E,CAC1F,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAM,MAAQ,EAAa,KAExB,EAAA,KAAK,EAAA,UAAU,QAAS,EAAA,eAAe,GAAW,EAAK,SAAS,IAAI,IAAK,CAAE,IAAK,EAAM,MAAO,CAAM,CAAC,EAAG,CAC5G,IAAK,CACP,CAAC,CACH,CAAC,CACH,CAEA,KAAK,EAAe,EAA4E,CAC9F,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAM,OAAS,EAAc,KAE1B,EAAA,KACL,EAAA,UAAU,eACV,EAAA,eAAe,GAAW,EAAK,SAAS,IAAI,KAAM,CAAE,QAAO,MAAO,CAAM,CAAC,EACzE,CAAE,OAAM,CACV,CACF,CAAC,CACH,CAEA,SAAS,EAA4C,CACnD,OAAO,KAAK,gBAAgB,EAAO,IAG7B,EAAM,KAAO,EAAU,KAEpB,EAAA,KAAK,EAAA,UAAU,UAAW,EAAA,eAAe,GAAW,EAAK,SAAS,IAAI,SAAU,CAAE,IAAK,CAAE,CAAC,EAAG,CAAE,IAAK,CAAE,CAAC,CAC/G,CACH,CAEA,mBAAyD,CACvD,MAAO,CACL,GAAG,KAAK,cAAc,EACtB,IAAK,KAAK,UAAU,WAAW,EAC/B,KAAM,MACN,MAAO,KAAK,YAAY,WAAW,CACrC,CACF,CAEA,MAA4B,EAAoC,CAC9D,IAAM,EAAM,KAAK,UAAU,KAAK,CAAO,EACjC,EAAQ,KAAK,YAAY,KAAK,CAAO,EAI3C,OAFI,EAAQ,IAAY,EAAQ,IAAI,KAAM,EAAK,CAAK,EAE7C,MAAM,MAAM,CAAO,CAC5B,CACF"}
+{"version":3,"file":"map.cjs","names":[],"sources":["../../src/schemas/map.ts"],"sourcesContent":["import type {\n  AnySchema,\n  CheckContext,\n  InferInput,\n  InferOutput,\n  InferSchemaMode,\n  Issue,\n  MergeSchemaModes,\n  MessageFn,\n  ParseContext,\n  ParseValue,\n  SchemaDescriptor,\n  SchemaMode,\n  SchemaWalker,\n  ValidateResult,\n} from '../core';\n\nimport { _makeCtx, ErrorCode, fail, prependIssuePath, resolveMessage, Schema, SpellValidationError } from '../core';\n\nexport class MapSchema<\n  K extends AnySchema,\n  V extends AnySchema,\n  Mode extends SchemaMode = MergeSchemaModes<InferSchemaMode<K | V>>,\n> extends Schema<Map<InferOutput<K>, InferOutput<V>>, Map<InferInput<K>, InferInput<V>>, Mode> {\n  readonly keySchema: K;\n  readonly valueSchema: V;\n\n  protected override get _kind(): string {\n    return 'map';\n  }\n\n  override checkAsync(\n    this: MapSchema<K, V, 'sync'>,\n    fn: (value: Map<InferOutput<K>, InferOutput<V>>, ctx: CheckContext) => Promise<ValidateResult>,\n  ): MapSchema<K, V, 'async'> {\n    return this._addCheck(fn, true) as unknown as MapSchema<K, V, 'async'>;\n  }\n\n  constructor(keySchema: K, valueSchema: V) {\n    super();\n    this.keySchema = keySchema;\n    this.valueSchema = valueSchema;\n  }\n\n  protected override _parse(value: unknown, ctx: ParseContext): ParseValue {\n    if (!(value instanceof Map)) {\n      return {\n        data: value,\n        issues: [{ code: ErrorCode.invalid_type, message: ctx.messages.map.type(), path: [] }],\n        typeOk: false,\n      };\n    }\n\n    const out = new Map<InferOutput<K>, InferOutput<V>>();\n    const issues: Issue[] = [];\n    let i = 0;\n\n    for (const [key, val] of value) {\n      const keyResult = this.keySchema._parseFullSync(key, ctx);\n      const valResult = this.valueSchema._parseFullSync(val, ctx);\n\n      if (keyResult.issues.length > 0) issues.push(...prependIssuePath(keyResult.issues, i));\n\n      if (valResult.issues.length > 0) issues.push(...prependIssuePath(valResult.issues, i));\n\n      if (keyResult.issues.length === 0 && valResult.issues.length === 0)\n        out.set(keyResult.data as InferOutput<K>, valResult.data as InferOutput<V>);\n\n      i += 1;\n    }\n\n    return { data: out, issues, typeOk: true };\n  }\n\n  override async parseAsync(value: unknown, ctx?: ParseContext): Promise<Map<InferOutput<K>, InferOutput<V>>> {\n    const c = ctx ?? _makeCtx();\n\n    return this._withCatchAsync(async () => {\n      const prepared = this._prepareInput(value);\n\n      if (prepared.skip) return prepared.value as unknown as Map<InferOutput<K>, InferOutput<V>>;\n\n      const raw = prepared.value;\n\n      if (!(raw instanceof Map)) {\n        throw new SpellValidationError([{ code: ErrorCode.invalid_type, message: c.messages.map.type(), path: [] }]);\n      }\n\n      const entries = [...raw];\n      const settled = await Promise.all(\n        entries.map(([key, val]) =>\n          Promise.all([this.keySchema._parseFullAsync(key, c), this.valueSchema._parseFullAsync(val, c)]),\n        ),\n      );\n\n      const issues: Issue[] = [];\n      const out = new Map<InferOutput<K>, InferOutput<V>>();\n\n      for (let i = 0; i < settled.length; i++) {\n        const [keyResult, valResult] = settled[i];\n\n        if (keyResult.issues.length > 0) issues.push(...prependIssuePath(keyResult.issues, i));\n\n        if (valResult.issues.length > 0) issues.push(...prependIssuePath(valResult.issues, i));\n\n        if (keyResult.issues.length === 0 && valResult.issues.length === 0)\n          out.set(keyResult.data as InferOutput<K>, valResult.data as InferOutput<V>);\n      }\n\n      const validationIssues = await this._runValidatorsAsync(out, c);\n      const allIssues = [...issues, ...validationIssues];\n\n      if (allIssues.length > 0) throw new SpellValidationError(allIssues);\n\n      return this._runPostprocessors(out) as Map<InferOutput<K>, InferOutput<V>>;\n    });\n  }\n\n  min(size: number, message?: MessageFn<{ min: number; value: Map<unknown, unknown> }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Map<unknown, unknown>;\n\n      if (typed.size >= size) return null;\n\n      return fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.map.min, { min: size, value: typed }), {\n        min: size,\n      });\n    });\n  }\n\n  max(size: number, message?: MessageFn<{ max: number; value: Map<unknown, unknown> }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Map<unknown, unknown>;\n\n      if (typed.size <= size) return null;\n\n      return fail(ErrorCode.too_big, resolveMessage(message ?? ctx!.messages.map.max, { max: size, value: typed }), {\n        max: size,\n      });\n    });\n  }\n\n  size(exact: number, message?: MessageFn<{ exact: number; value: Map<unknown, unknown> }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Map<unknown, unknown>;\n\n      if (typed.size === exact) return null;\n\n      return fail(\n        ErrorCode.invalid_length,\n        resolveMessage(message ?? ctx!.messages.map.size, { exact, value: typed }),\n        { exact },\n      );\n    });\n  }\n\n  nonEmpty(message?: MessageFn<{ min: number }>): this {\n    return this._addConstraint((value, ctx) => {\n      const typed = value as Map<unknown, unknown>;\n\n      if (typed.size > 0) return null;\n\n      return fail(ErrorCode.too_small, resolveMessage(message ?? ctx!.messages.map.nonEmpty, { min: 1 }), { min: 1 });\n    });\n  }\n\n  protected override _toDescriptorImpl(): SchemaDescriptor {\n    return {\n      ...this._describeBase(),\n      key: this.keySchema.definition(),\n      kind: 'map',\n      value: this.valueSchema.definition(),\n    };\n  }\n\n  protected override _walk<R>(visitor: SchemaWalker<R>): R | null {\n    const key = this.keySchema.walk(visitor);\n    const value = this.valueSchema.walk(visitor);\n\n    if (visitor.map) return visitor.map(this, key, value);\n\n    return super._walk(visitor);\n  }\n}\n"],"mappings":"oFAmBA,IAAa,EAAb,cAIU,EAAA,MAAqF,CAC7F,UACA,YAEA,IAAuB,OAAgB,CACrC,MAAO,KACT,CAEA,WAEE,EAC0B,CAC1B,OAAO,KAAK,UAAU,EAAI,EAAI,CAChC,CAEA,YAAY,EAAc,EAAgB,CACxC,MAAM,EACN,KAAK,UAAY,EACjB,KAAK,YAAc,CACrB,CAEA,OAA0B,EAAgB,EAA+B,CACvE,GAAI,EAAE,aAAiB,KACrB,MAAO,CACL,KAAM,EACN,OAAQ,CAAC,CAAE,KAAM,EAAA,UAAU,aAAc,QAAS,EAAI,SAAS,IAAI,KAAK,EAAG,KAAM,CAAC,CAAE,CAAC,EACrF,OAAQ,EACV,EAGF,IAAM,EAAM,IAAI,IACV,EAAkB,CAAC,EACrB,EAAI,EAER,IAAK,GAAM,CAAC,EAAK,KAAQ,EAAO,CAC9B,IAAM,EAAY,KAAK,UAAU,eAAe,EAAK,CAAG,EAClD,EAAY,KAAK,YAAY,eAAe,EAAK,CAAG,EAEtD,EAAU,OAAO,OAAS,GAAG,EAAO,KAAK,GAAG,EAAA,iBAAiB,EAAU,OAAQ,CAAC,CAAC,EAEjF,EAAU,OAAO,OAAS,GAAG,EAAO,KAAK,GAAG,EAAA,iBAAiB,EAAU,OAAQ,CAAC,CAAC,EAEjF,EAAU,OAAO,SAAW,GAAK,EAAU,OAAO,SAAW,GAC/D,EAAI,IAAI,EAAU,KAAwB,EAAU,IAAsB,EAE5E,GAAK,CACP,CAEA,MAAO,CAAE,KAAM,EAAK,SAAQ,OAAQ,EAAK,CAC3C,CAEA,MAAe,WAAW,EAAgB,EAAkE,CAC1G,IAAM,EAAI,GAAO,EAAA,SAAS,EAE1B,OAAO,KAAK,gBAAgB,SAAY,CACtC,IAAM,EAAW,KAAK,cAAc,CAAK,EAEzC,GAAI,EAAS,KAAM,OAAO,EAAS,MAEnC,IAAM,EAAM,EAAS,MAErB,GAAI,EAAE,aAAe,KACnB,MAAM,IAAI,EAAA,qBAAqB,CAAC,CAAE,KAAM,EAAA,UAAU,aAAc,QAAS,EAAE,SAAS,IAAI,KAAK,EAAG,KAAM,CAAC,CAAE,CAAC,CAAC,EAG7G,IAAM,EAAU,CAAC,GAAG,CAAG,EACjB,EAAU,MAAM,QAAQ,IAC5B,EAAQ,KAAK,CAAC,EAAK,KACjB,QAAQ,IAAI,CAAC,KAAK,UAAU,gBAAgB,EAAK,CAAC,EAAG,KAAK,YAAY,gBAAgB,EAAK,CAAC,CAAC,CAAC,CAChG,CACF,EAEM,EAAkB,CAAC,EACnB,EAAM,IAAI,IAEhB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAAK,CACvC,GAAM,CAAC,EAAW,GAAa,EAAQ,GAEnC,EAAU,OAAO,OAAS,GAAG,EAAO,KAAK,GAAG,EAAA,iBAAiB,EAAU,OAAQ,CAAC,CAAC,EAEjF,EAAU,OAAO,OAAS,GAAG,EAAO,KAAK,GAAG,EAAA,iBAAiB,EAAU,OAAQ,CAAC,CAAC,EAEjF,EAAU,OAAO,SAAW,GAAK,EAAU,OAAO,SAAW,GAC/D,EAAI,IAAI,EAAU,KAAwB,EAAU,IAAsB,CAC9E,CAEA,IAAM,EAAmB,MAAM,KAAK,oBAAoB,EAAK,CAAC,EACxD,EAAY,CAAC,GAAG,EAAQ,GAAG,CAAgB,EAEjD,GAAI,EAAU,OAAS,EAAG,MAAM,IAAI,EAAA,qBAAqB,CAAS,EAElE,OAAO,KAAK,mBAAmB,CAAG,CACpC,CAAC,CACH,CAEA,IAAI,EAAc,EAA0E,CAC1F,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAM,MAAQ,EAAa,KAExB,EAAA,KAAK,EAAA,UAAU,UAAW,EAAA,eAAe,GAAW,EAAK,SAAS,IAAI,IAAK,CAAE,IAAK,EAAM,MAAO,CAAM,CAAC,EAAG,CAC9G,IAAK,CACP,CAAC,CACH,CAAC,CACH,CAEA,IAAI,EAAc,EAA0E,CAC1F,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAM,MAAQ,EAAa,KAExB,EAAA,KAAK,EAAA,UAAU,QAAS,EAAA,eAAe,GAAW,EAAK,SAAS,IAAI,IAAK,CAAE,IAAK,EAAM,MAAO,CAAM,CAAC,EAAG,CAC5G,IAAK,CACP,CAAC,CACH,CAAC,CACH,CAEA,KAAK,EAAe,EAA4E,CAC9F,OAAO,KAAK,gBAAgB,EAAO,IAAQ,CACzC,IAAM,EAAQ,EAId,OAFI,EAAM,OAAS,EAAc,KAE1B,EAAA,KACL,EAAA,UAAU,eACV,EAAA,eAAe,GAAW,EAAK,SAAS,IAAI,KAAM,CAAE,QAAO,MAAO,CAAM,CAAC,EACzE,CAAE,OAAM,CACV,CACF,CAAC,CACH,CAEA,SAAS,EAA4C,CACnD,OAAO,KAAK,gBAAgB,EAAO,IAG7B,EAAM,KAAO,EAAU,KAEpB,EAAA,KAAK,EAAA,UAAU,UAAW,EAAA,eAAe,GAAW,EAAK,SAAS,IAAI,SAAU,CAAE,IAAK,CAAE,CAAC,EAAG,CAAE,IAAK,CAAE,CAAC,CAC/G,CACH,CAEA,mBAAyD,CACvD,MAAO,CACL,GAAG,KAAK,cAAc,EACtB,IAAK,KAAK,UAAU,WAAW,EAC/B,KAAM,MACN,MAAO,KAAK,YAAY,WAAW,CACrC,CACF,CAEA,MAA4B,EAAoC,CAC9D,IAAM,EAAM,KAAK,UAAU,KAAK,CAAO,EACjC,EAAQ,KAAK,YAAY,KAAK,CAAO,EAI3C,OAFI,EAAQ,IAAY,EAAQ,IAAI,KAAM,EAAK,CAAK,EAE7C,MAAM,MAAM,CAAO,CAC5B,CACF"}

package/dist/schemas/map.d.ts

@@ -1,6 +1,6 @@
-import type { AnySchema, CheckContext, InferOutput, InferSchemaMode, MergeSchemaModes, MessageFn, ParseContext, ParseValue, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';
+import type { AnySchema, CheckContext, InferInput, InferOutput, InferSchemaMode, MergeSchemaModes, MessageFn, ParseContext, ParseValue, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';
 import { Schema } from '../core';
-export declare class MapSchema<K extends AnySchema, V extends AnySchema, Mode extends SchemaMode = MergeSchemaModes<InferSchemaMode<K | V>>> extends Schema<Map<InferOutput<K>, InferOutput<V>>, unknown, Mode> {
+export declare class MapSchema<K extends AnySchema, V extends AnySchema, Mode extends SchemaMode = MergeSchemaModes<InferSchemaMode<K | V>>> extends Schema<Map<InferOutput<K>, InferOutput<V>>, Map<InferInput<K>, InferInput<V>>, Mode> {
     readonly keySchema: K;
     readonly valueSchema: V;
     protected get _kind(): string;