@vielzeug/spell 3.1.2 → 26.10.0

package/dist/errors.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"errors.cjs","names":[],"sources":["../src/errors.ts"],"sourcesContent":["import type { ErrorCode, Issue, IssuePath, MessageFn } from './types';\n\n/* -------------------- Helpers -------------------- */\n\ntype IssueParams<C extends string> = Extract<Issue, { code: C }> extends { params: infer P } ? P : undefined;\n\n/**\n * Creates a single-error failure array. Use in validator functions instead of building the array manually.\n * Typed overloads ensure params match the given error code.\n */\nexport function fail<C extends ErrorCode>(code: C, message: string, params: IssueParams<C>): Issue[];\nexport function fail(code: string, message: string, params?: Record<string, unknown>): Issue[];\nexport function fail(code: string, message: string, params?: Record<string, unknown>): Issue[] {\n  return [{ code, message, params, path: [] } as Issue];\n}\n\n/** Resolve a message value or factory against a context. Re-exported by `core` for schema modules. */\nexport function resolveMessage<Ctx extends Record<string, unknown>>(msg: MessageFn<Ctx>, ctx: Ctx): string {\n  return typeof msg === 'function' ? msg(ctx) : msg;\n}\n\nexport function prependIssuePath(issues: Issue[], prefix: string | number): Issue[] {\n  return issues.map((issue) => ({ ...issue, path: [prefix, ...issue.path] }));\n}\n\n/**\n * Flattens an issue path into a UI key such as `'permissions.0.slug'`. Handles spell-native\n * `(string | number)[]` paths and Standard Schema paths with `{ key }` segments; empty or\n * undefined paths join to `''`.\n */\nexport function joinIssuePath(path: IssuePath | undefined, separator = '.'): string {\n  if (!path || path.length === 0) return '';\n\n  return path\n    .map((segment) => {\n      if (typeof segment === 'object' && segment !== null && 'key' in segment) return String(segment.key);\n      return String(segment);\n    })\n    .join(separator);\n}\n\n/* -------------------- SpellError -------------------- */\n\n/** Base class for all spell errors. Use `instanceof SpellError` to catch any spell-originated error. */\nexport class SpellError extends Error {\n  constructor(message: string, opts?: ErrorOptions) {\n    super(message, opts);\n    this.name = new.target.name;\n    Object.setPrototypeOf(this, new.target.prototype);\n  }\n}\n\n/* -------------------- SpellValidationError -------------------- */\n\nfunction formatIssues(issues: Issue[]): string {\n  return issues\n    .map(({ code, message, path }) => {\n      const pathStr = path.length ? path.join('.') : 'value';\n\n      return `${pathStr}: ${message} [${code}]`;\n    })\n    .join('\\n');\n}\n\nfunction pathsEqual(left: readonly (string | number)[], right: readonly (string | number)[]): boolean {\n  return left.length === right.length && left.every((segment, index) => segment === right[index]);\n}\n\nexport type FlatError = { messages: string[]; path: (string | number)[] };\nexport type FlatErrorFirst = { message: string; path: (string | number)[] };\n\nexport class SpellDefinitionError extends SpellError {}\n\nexport class SpellValidationError extends SpellError {\n  readonly issues: Issue[];\n\n  constructor(issues: Issue[], cause?: unknown) {\n    super(formatIssues(issues), { cause });\n    this.issues = issues;\n  }\n\n  flatten(): { fieldErrors: FlatError[]; formErrors: string[] } {\n    const fieldErrors: FlatError[] = [];\n    const formErrors: string[] = [];\n    const pathMap = new Map<string, number>();\n\n    for (const issue of this.issues) {\n      if (issue.path.length === 0) {\n        formErrors.push(issue.message);\n      } else {\n        const key = JSON.stringify(issue.path);\n        const existing = pathMap.get(key);\n\n        if (existing !== undefined) {\n          fieldErrors[existing]?.messages.push(issue.message);\n        } else {\n          pathMap.set(key, fieldErrors.length);\n          fieldErrors.push({ messages: [issue.message], path: [...issue.path] });\n        }\n      }\n    }\n\n    return { fieldErrors, formErrors };\n  }\n\n  flattenFirst(): { fieldErrors: FlatErrorFirst[]; formErrors: string[] } {\n    const { fieldErrors, formErrors } = this.flatten();\n\n    return {\n      fieldErrors: fieldErrors.map((fe) => ({ message: fe.messages[0]!, path: fe.path })),\n      formErrors,\n    };\n  }\n\n  /** Returns every message attached to exactly `path`, in issue order. */\n  messagesAt(...path: (string | number)[]): string[] {\n    return this.issues.filter((issue) => pathsEqual(issue.path, path)).map((issue) => issue.message);\n  }\n}\n"],"mappings":"AAYA,SAAgB,EAAK,EAAc,EAAiB,EAA2C,CAC7F,MAAO,CAAC,CAAE,OAAM,UAAS,SAAQ,KAAM,CAAC,CAAE,CAAU,CACtD,CAGA,SAAgB,EAAoD,EAAqB,EAAkB,CACzG,OAAO,OAAO,GAAQ,WAAa,EAAI,CAAG,EAAI,CAChD,CAEA,SAAgB,EAAiB,EAAiB,EAAkC,CAClF,OAAO,EAAO,IAAK,IAAW,CAAE,GAAG,EAAO,KAAM,CAAC,EAAQ,GAAG,EAAM,IAAI,CAAE,EAAE,CAC5E,CAOA,SAAgB,EAAc,EAA6B,EAAY,IAAa,CAGlF,MAFI,CAAC,GAAQ,EAAK,SAAW,EAAU,GAEhC,EACJ,IAAK,GACA,OAAO,GAAY,UAAY,GAAoB,QAAS,EAAgB,OAAO,EAAQ,GAAG,EAC3F,OAAO,CAAO,CACtB,CAAC,CACD,KAAK,CAAS,CACnB,CAKA,IAAa,EAAb,cAAgC,KAAM,CACpC,YAAY,EAAiB,EAAqB,CAChD,MAAM,EAAS,CAAI,EACnB,KAAK,KAAO,WAAW,KACvB,OAAO,eAAe,KAAM,WAAW,SAAS,CAClD,CACF,EAIA,SAAS,EAAa,EAAyB,CAC7C,OAAO,EACJ,KAAK,CAAE,OAAM,UAAS,UAGd,GAFS,EAAK,OAAS,EAAK,KAAK,GAAG,EAAI,QAE7B,IAAI,EAAQ,IAAI,EAAK,EACxC,CAAC,CACD,KAAK;CAAI,CACd,CAEA,SAAS,EAAW,EAAoC,EAA8C,CACpG,OAAO,EAAK,SAAW,EAAM,QAAU,EAAK,OAAO,EAAS,IAAU,IAAY,EAAM,EAAM,CAChG,CAKA,IAAa,EAAb,cAA0C,CAAW,CAAC,EAEzC,EAAb,cAA0C,CAAW,CACnD,OAEA,YAAY,EAAiB,EAAiB,CAC5C,MAAM,EAAa,CAAM,EAAG,CAAE,OAAM,CAAC,EACrC,KAAK,OAAS,CAChB,CAEA,SAA8D,CAC5D,IAAM,EAA2B,CAAC,EAC5B,EAAuB,CAAC,EACxB,EAAU,IAAI,IAEpB,IAAK,IAAM,KAAS,KAAK,OACvB,GAAI,EAAM,KAAK,SAAW,EACxB,EAAW,KAAK,EAAM,OAAO,MACxB,CACL,IAAM,EAAM,KAAK,UAAU,EAAM,IAAI,EAC/B,EAAW,EAAQ,IAAI,CAAG,EAE5B,IAAa,IAAA,IAGf,EAAQ,IAAI,EAAK,EAAY,MAAM,EACnC,EAAY,KAAK,CAAE,SAAU,CAAC,EAAM,OAAO,EAAG,KAAM,CAAC,GAAG,EAAM,IAAI,CAAE,CAAC,GAHrE,EAAY,EAAS,EAAE,SAAS,KAAK,EAAM,OAAO,CAKtD,CAGF,MAAO,CAAE,cAAa,YAAW,CACnC,CAEA,cAAwE,CACtE,GAAM,CAAE,cAAa,cAAe,KAAK,QAAQ,EAEjD,MAAO,CACL,YAAa,EAAY,IAAK,IAAQ,CAAE,QAAS,EAAG,SAAS,GAAK,KAAM,EAAG,IAAK,EAAE,EAClF,YACF,CACF,CAGA,WAAW,GAAG,EAAqC,CACjD,OAAO,KAAK,OAAO,OAAQ,GAAU,EAAW,EAAM,KAAM,CAAI,CAAC,CAAC,CAAC,IAAK,GAAU,EAAM,OAAO,CACjG,CACF"}
+{"version":3,"file":"errors.cjs","names":[],"sources":["../src/errors.ts"],"sourcesContent":["import type { ErrorCode, Issue, IssuePath, MessageFn } from './types';\n\n/* -------------------- Helpers -------------------- */\n\ntype IssueParams<C extends string> = Extract<Issue, { code: C }> extends { params: infer P } ? P : undefined;\n\n/**\n * Creates a single-error failure array. Use in validator functions instead of building the array manually.\n * Typed overloads ensure params match the given error code.\n */\nexport function fail<C extends ErrorCode>(code: C, message: string, params: IssueParams<C>): Issue[];\nexport function fail(code: string, message: string, params?: Record<string, unknown>): Issue[];\nexport function fail(code: string, message: string, params?: Record<string, unknown>): Issue[] {\n  return [{ code, message, params, path: [] } as Issue];\n}\n\n/** Resolve a message value or factory against a context. Re-exported by `core` for schema modules. */\nexport function resolveMessage<Ctx extends Record<string, unknown>>(msg: MessageFn<Ctx>, ctx: Ctx): string {\n  return typeof msg === 'function' ? msg(ctx) : msg;\n}\n\nexport function prependIssuePath(issues: Issue[], prefix: string | number): Issue[] {\n  return issues.map((issue) => ({ ...issue, path: [prefix, ...issue.path] }));\n}\n\n/**\n * Flattens an issue path into a UI key such as `'permissions.0.slug'`. Handles spell-native\n * `(string | number)[]` paths and Standard Schema paths with `{ key }` segments; empty or\n * undefined paths join to `''`.\n */\nexport function joinIssuePath(path: IssuePath | undefined, separator = '.'): string {\n  if (!path || path.length === 0) return '';\n\n  return path\n    .map((segment) => {\n      if (typeof segment === 'object' && segment !== null && 'key' in segment) return String(segment.key);\n      return String(segment);\n    })\n    .join(separator);\n}\n\n/* -------------------- SpellError -------------------- */\n\n/** Base class for all spell errors. Use `instanceof SpellError` to catch any spell-originated error. */\nexport class SpellError extends Error {\n  constructor(message: string, opts?: ErrorOptions) {\n    super(message, opts);\n    this.name = new.target.name;\n    Object.setPrototypeOf(this, new.target.prototype);\n  }\n}\n\n/* -------------------- SpellValidationError -------------------- */\n\nfunction formatIssues(issues: Issue[]): string {\n  return issues\n    .map(({ code, message, path }) => {\n      const pathStr = path.length ? path.join('.') : 'value';\n\n      return `${pathStr}: ${message} [${code}]`;\n    })\n    .join('\\n');\n}\n\nfunction pathsEqual(left: readonly (string | number)[], right: readonly (string | number)[]): boolean {\n  return left.length === right.length && left.every((segment, index) => segment === right[index]);\n}\n\nexport type FlatError = { messages: string[]; path: (string | number)[] };\nexport type FlatErrorFirst = { message: string; path: (string | number)[] };\n\nexport class SpellDefinitionError extends SpellError {}\n\nexport class SpellValidationError extends SpellError {\n  readonly issues: Issue[];\n\n  constructor(issues: Issue[], cause?: unknown) {\n    super(formatIssues(issues), { cause });\n    this.issues = Object.freeze([...issues]) as Issue[];\n  }\n\n  flatten(): { fieldErrors: FlatError[]; formErrors: string[] } {\n    const fieldErrors: FlatError[] = [];\n    const formErrors: string[] = [];\n    const pathMap = new Map<string, number>();\n\n    for (const issue of this.issues) {\n      if (issue.path.length === 0) {\n        formErrors.push(issue.message);\n      } else {\n        const key = JSON.stringify(issue.path);\n        const existing = pathMap.get(key);\n\n        if (existing !== undefined) {\n          fieldErrors[existing]?.messages.push(issue.message);\n        } else {\n          pathMap.set(key, fieldErrors.length);\n          fieldErrors.push({ messages: [issue.message], path: [...issue.path] });\n        }\n      }\n    }\n\n    return { fieldErrors, formErrors };\n  }\n\n  flattenFirst(): { fieldErrors: FlatErrorFirst[]; formErrors: string[] } {\n    const { fieldErrors, formErrors } = this.flatten();\n\n    return {\n      fieldErrors: fieldErrors.map((fe) => ({ message: fe.messages[0]!, path: fe.path })),\n      formErrors,\n    };\n  }\n\n  /** Returns every message attached to exactly `path`, in issue order. */\n  messagesAt(...path: (string | number)[]): string[] {\n    return this.issues.filter((issue) => pathsEqual(issue.path, path)).map((issue) => issue.message);\n  }\n}\n"],"mappings":"AAYA,SAAgB,EAAK,EAAc,EAAiB,EAA2C,CAC7F,MAAO,CAAC,CAAE,OAAM,UAAS,SAAQ,KAAM,CAAC,CAAE,CAAU,CACtD,CAGA,SAAgB,EAAoD,EAAqB,EAAkB,CACzG,OAAO,OAAO,GAAQ,WAAa,EAAI,CAAG,EAAI,CAChD,CAEA,SAAgB,EAAiB,EAAiB,EAAkC,CAClF,OAAO,EAAO,IAAK,IAAW,CAAE,GAAG,EAAO,KAAM,CAAC,EAAQ,GAAG,EAAM,IAAI,CAAE,EAAE,CAC5E,CAOA,SAAgB,EAAc,EAA6B,EAAY,IAAa,CAGlF,MAFI,CAAC,GAAQ,EAAK,SAAW,EAAU,GAEhC,EACJ,IAAK,GACA,OAAO,GAAY,UAAY,GAAoB,QAAS,EAAgB,OAAO,EAAQ,GAAG,EAC3F,OAAO,CAAO,CACtB,CAAC,CACD,KAAK,CAAS,CACnB,CAKA,IAAa,EAAb,cAAgC,KAAM,CACpC,YAAY,EAAiB,EAAqB,CAChD,MAAM,EAAS,CAAI,EACnB,KAAK,KAAO,WAAW,KACvB,OAAO,eAAe,KAAM,WAAW,SAAS,CAClD,CACF,EAIA,SAAS,EAAa,EAAyB,CAC7C,OAAO,EACJ,KAAK,CAAE,OAAM,UAAS,UAGd,GAFS,EAAK,OAAS,EAAK,KAAK,GAAG,EAAI,QAE7B,IAAI,EAAQ,IAAI,EAAK,EACxC,CAAC,CACD,KAAK;CAAI,CACd,CAEA,SAAS,EAAW,EAAoC,EAA8C,CACpG,OAAO,EAAK,SAAW,EAAM,QAAU,EAAK,OAAO,EAAS,IAAU,IAAY,EAAM,EAAM,CAChG,CAKA,IAAa,EAAb,cAA0C,CAAW,CAAC,EAEzC,EAAb,cAA0C,CAAW,CACnD,OAEA,YAAY,EAAiB,EAAiB,CAC5C,MAAM,EAAa,CAAM,EAAG,CAAE,OAAM,CAAC,EACrC,KAAK,OAAS,OAAO,OAAO,CAAC,GAAG,CAAM,CAAC,CACzC,CAEA,SAA8D,CAC5D,IAAM,EAA2B,CAAC,EAC5B,EAAuB,CAAC,EACxB,EAAU,IAAI,IAEpB,IAAK,IAAM,KAAS,KAAK,OACvB,GAAI,EAAM,KAAK,SAAW,EACxB,EAAW,KAAK,EAAM,OAAO,MACxB,CACL,IAAM,EAAM,KAAK,UAAU,EAAM,IAAI,EAC/B,EAAW,EAAQ,IAAI,CAAG,EAE5B,IAAa,IAAA,IAGf,EAAQ,IAAI,EAAK,EAAY,MAAM,EACnC,EAAY,KAAK,CAAE,SAAU,CAAC,EAAM,OAAO,EAAG,KAAM,CAAC,GAAG,EAAM,IAAI,CAAE,CAAC,GAHrE,EAAY,EAAS,EAAE,SAAS,KAAK,EAAM,OAAO,CAKtD,CAGF,MAAO,CAAE,cAAa,YAAW,CACnC,CAEA,cAAwE,CACtE,GAAM,CAAE,cAAa,cAAe,KAAK,QAAQ,EAEjD,MAAO,CACL,YAAa,EAAY,IAAK,IAAQ,CAAE,QAAS,EAAG,SAAS,GAAK,KAAM,EAAG,IAAK,EAAE,EAClF,YACF,CACF,CAGA,WAAW,GAAG,EAAqC,CACjD,OAAO,KAAK,OAAO,OAAQ,GAAU,EAAW,EAAM,KAAM,CAAI,CAAC,CAAC,CAAC,IAAK,GAAU,EAAM,OAAO,CACjG,CACF"}

package/dist/errors.js

@@ -1,3 +1,3 @@
 function e(e,t,n){return[{code:e,message:t,params:n,path:[]}]}function t(e,t){return typeof e==`function`?e(t):e}function n(e,t){return e.map(e=>({...e,path:[t,...e.path]}))}function r(e,t=`.`){return!e||e.length===0?``:e.map(e=>typeof e==`object`&&e&&`key`in e?String(e.key):String(e)).join(t)}var i=class extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}};function a(e){return e.map(({code:e,message:t,path:n})=>`${n.length?n.join(`.`):`value`}: ${t} [${e}]`).join(`
-`)}function o(e,t){return e.length===t.length&&e.every((e,n)=>e===t[n])}var s=class extends i{},c=class extends i{issues;constructor(e,t){super(a(e),{cause:t}),this.issues=e}flatten(){let e=[],t=[],n=new Map;for(let r of this.issues)if(r.path.length===0)t.push(r.message);else{let t=JSON.stringify(r.path),i=n.get(t);i===void 0?(n.set(t,e.length),e.push({messages:[r.message],path:[...r.path]})):e[i]?.messages.push(r.message)}return{fieldErrors:e,formErrors:t}}flattenFirst(){let{fieldErrors:e,formErrors:t}=this.flatten();return{fieldErrors:e.map(e=>({message:e.messages[0],path:e.path})),formErrors:t}}messagesAt(...e){return this.issues.filter(t=>o(t.path,e)).map(e=>e.message)}};export{s as SpellDefinitionError,i as SpellError,c as SpellValidationError,e as fail,r as joinIssuePath,n as prependIssuePath,t as resolveMessage};
+`)}function o(e,t){return e.length===t.length&&e.every((e,n)=>e===t[n])}var s=class extends i{},c=class extends i{issues;constructor(e,t){super(a(e),{cause:t}),this.issues=Object.freeze([...e])}flatten(){let e=[],t=[],n=new Map;for(let r of this.issues)if(r.path.length===0)t.push(r.message);else{let t=JSON.stringify(r.path),i=n.get(t);i===void 0?(n.set(t,e.length),e.push({messages:[r.message],path:[...r.path]})):e[i]?.messages.push(r.message)}return{fieldErrors:e,formErrors:t}}flattenFirst(){let{fieldErrors:e,formErrors:t}=this.flatten();return{fieldErrors:e.map(e=>({message:e.messages[0],path:e.path})),formErrors:t}}messagesAt(...e){return this.issues.filter(t=>o(t.path,e)).map(e=>e.message)}};export{s as SpellDefinitionError,i as SpellError,c as SpellValidationError,e as fail,r as joinIssuePath,n as prependIssuePath,t as resolveMessage};
 //# sourceMappingURL=errors.js.map

package/dist/errors.js.map

@@ -1 +1 @@
-{"version":3,"file":"errors.js","names":[],"sources":["../src/errors.ts"],"sourcesContent":["import type { ErrorCode, Issue, IssuePath, MessageFn } from './types';\n\n/* -------------------- Helpers -------------------- */\n\ntype IssueParams<C extends string> = Extract<Issue, { code: C }> extends { params: infer P } ? P : undefined;\n\n/**\n * Creates a single-error failure array. Use in validator functions instead of building the array manually.\n * Typed overloads ensure params match the given error code.\n */\nexport function fail<C extends ErrorCode>(code: C, message: string, params: IssueParams<C>): Issue[];\nexport function fail(code: string, message: string, params?: Record<string, unknown>): Issue[];\nexport function fail(code: string, message: string, params?: Record<string, unknown>): Issue[] {\n  return [{ code, message, params, path: [] } as Issue];\n}\n\n/** Resolve a message value or factory against a context. Re-exported by `core` for schema modules. */\nexport function resolveMessage<Ctx extends Record<string, unknown>>(msg: MessageFn<Ctx>, ctx: Ctx): string {\n  return typeof msg === 'function' ? msg(ctx) : msg;\n}\n\nexport function prependIssuePath(issues: Issue[], prefix: string | number): Issue[] {\n  return issues.map((issue) => ({ ...issue, path: [prefix, ...issue.path] }));\n}\n\n/**\n * Flattens an issue path into a UI key such as `'permissions.0.slug'`. Handles spell-native\n * `(string | number)[]` paths and Standard Schema paths with `{ key }` segments; empty or\n * undefined paths join to `''`.\n */\nexport function joinIssuePath(path: IssuePath | undefined, separator = '.'): string {\n  if (!path || path.length === 0) return '';\n\n  return path\n    .map((segment) => {\n      if (typeof segment === 'object' && segment !== null && 'key' in segment) return String(segment.key);\n      return String(segment);\n    })\n    .join(separator);\n}\n\n/* -------------------- SpellError -------------------- */\n\n/** Base class for all spell errors. Use `instanceof SpellError` to catch any spell-originated error. */\nexport class SpellError extends Error {\n  constructor(message: string, opts?: ErrorOptions) {\n    super(message, opts);\n    this.name = new.target.name;\n    Object.setPrototypeOf(this, new.target.prototype);\n  }\n}\n\n/* -------------------- SpellValidationError -------------------- */\n\nfunction formatIssues(issues: Issue[]): string {\n  return issues\n    .map(({ code, message, path }) => {\n      const pathStr = path.length ? path.join('.') : 'value';\n\n      return `${pathStr}: ${message} [${code}]`;\n    })\n    .join('\\n');\n}\n\nfunction pathsEqual(left: readonly (string | number)[], right: readonly (string | number)[]): boolean {\n  return left.length === right.length && left.every((segment, index) => segment === right[index]);\n}\n\nexport type FlatError = { messages: string[]; path: (string | number)[] };\nexport type FlatErrorFirst = { message: string; path: (string | number)[] };\n\nexport class SpellDefinitionError extends SpellError {}\n\nexport class SpellValidationError extends SpellError {\n  readonly issues: Issue[];\n\n  constructor(issues: Issue[], cause?: unknown) {\n    super(formatIssues(issues), { cause });\n    this.issues = issues;\n  }\n\n  flatten(): { fieldErrors: FlatError[]; formErrors: string[] } {\n    const fieldErrors: FlatError[] = [];\n    const formErrors: string[] = [];\n    const pathMap = new Map<string, number>();\n\n    for (const issue of this.issues) {\n      if (issue.path.length === 0) {\n        formErrors.push(issue.message);\n      } else {\n        const key = JSON.stringify(issue.path);\n        const existing = pathMap.get(key);\n\n        if (existing !== undefined) {\n          fieldErrors[existing]?.messages.push(issue.message);\n        } else {\n          pathMap.set(key, fieldErrors.length);\n          fieldErrors.push({ messages: [issue.message], path: [...issue.path] });\n        }\n      }\n    }\n\n    return { fieldErrors, formErrors };\n  }\n\n  flattenFirst(): { fieldErrors: FlatErrorFirst[]; formErrors: string[] } {\n    const { fieldErrors, formErrors } = this.flatten();\n\n    return {\n      fieldErrors: fieldErrors.map((fe) => ({ message: fe.messages[0]!, path: fe.path })),\n      formErrors,\n    };\n  }\n\n  /** Returns every message attached to exactly `path`, in issue order. */\n  messagesAt(...path: (string | number)[]): string[] {\n    return this.issues.filter((issue) => pathsEqual(issue.path, path)).map((issue) => issue.message);\n  }\n}\n"],"mappings":"AAYA,SAAgB,EAAK,EAAc,EAAiB,EAA2C,CAC7F,MAAO,CAAC,CAAE,OAAM,UAAS,SAAQ,KAAM,CAAC,CAAE,CAAU,CACtD,CAGA,SAAgB,EAAoD,EAAqB,EAAkB,CACzG,OAAO,OAAO,GAAQ,WAAa,EAAI,CAAG,EAAI,CAChD,CAEA,SAAgB,EAAiB,EAAiB,EAAkC,CAClF,OAAO,EAAO,IAAK,IAAW,CAAE,GAAG,EAAO,KAAM,CAAC,EAAQ,GAAG,EAAM,IAAI,CAAE,EAAE,CAC5E,CAOA,SAAgB,EAAc,EAA6B,EAAY,IAAa,CAGlF,MAFI,CAAC,GAAQ,EAAK,SAAW,EAAU,GAEhC,EACJ,IAAK,GACA,OAAO,GAAY,UAAY,GAAoB,QAAS,EAAgB,OAAO,EAAQ,GAAG,EAC3F,OAAO,CAAO,CACtB,CAAC,CACD,KAAK,CAAS,CACnB,CAKA,IAAa,EAAb,cAAgC,KAAM,CACpC,YAAY,EAAiB,EAAqB,CAChD,MAAM,EAAS,CAAI,EACnB,KAAK,KAAO,WAAW,KACvB,OAAO,eAAe,KAAM,WAAW,SAAS,CAClD,CACF,EAIA,SAAS,EAAa,EAAyB,CAC7C,OAAO,EACJ,KAAK,CAAE,OAAM,UAAS,UAGd,GAFS,EAAK,OAAS,EAAK,KAAK,GAAG,EAAI,QAE7B,IAAI,EAAQ,IAAI,EAAK,EACxC,CAAC,CACD,KAAK;CAAI,CACd,CAEA,SAAS,EAAW,EAAoC,EAA8C,CACpG,OAAO,EAAK,SAAW,EAAM,QAAU,EAAK,OAAO,EAAS,IAAU,IAAY,EAAM,EAAM,CAChG,CAKA,IAAa,EAAb,cAA0C,CAAW,CAAC,EAEzC,EAAb,cAA0C,CAAW,CACnD,OAEA,YAAY,EAAiB,EAAiB,CAC5C,MAAM,EAAa,CAAM,EAAG,CAAE,OAAM,CAAC,EACrC,KAAK,OAAS,CAChB,CAEA,SAA8D,CAC5D,IAAM,EAA2B,CAAC,EAC5B,EAAuB,CAAC,EACxB,EAAU,IAAI,IAEpB,IAAK,IAAM,KAAS,KAAK,OACvB,GAAI,EAAM,KAAK,SAAW,EACxB,EAAW,KAAK,EAAM,OAAO,MACxB,CACL,IAAM,EAAM,KAAK,UAAU,EAAM,IAAI,EAC/B,EAAW,EAAQ,IAAI,CAAG,EAE5B,IAAa,IAAA,IAGf,EAAQ,IAAI,EAAK,EAAY,MAAM,EACnC,EAAY,KAAK,CAAE,SAAU,CAAC,EAAM,OAAO,EAAG,KAAM,CAAC,GAAG,EAAM,IAAI,CAAE,CAAC,GAHrE,EAAY,EAAS,EAAE,SAAS,KAAK,EAAM,OAAO,CAKtD,CAGF,MAAO,CAAE,cAAa,YAAW,CACnC,CAEA,cAAwE,CACtE,GAAM,CAAE,cAAa,cAAe,KAAK,QAAQ,EAEjD,MAAO,CACL,YAAa,EAAY,IAAK,IAAQ,CAAE,QAAS,EAAG,SAAS,GAAK,KAAM,EAAG,IAAK,EAAE,EAClF,YACF,CACF,CAGA,WAAW,GAAG,EAAqC,CACjD,OAAO,KAAK,OAAO,OAAQ,GAAU,EAAW,EAAM,KAAM,CAAI,CAAC,CAAC,CAAC,IAAK,GAAU,EAAM,OAAO,CACjG,CACF"}
+{"version":3,"file":"errors.js","names":[],"sources":["../src/errors.ts"],"sourcesContent":["import type { ErrorCode, Issue, IssuePath, MessageFn } from './types';\n\n/* -------------------- Helpers -------------------- */\n\ntype IssueParams<C extends string> = Extract<Issue, { code: C }> extends { params: infer P } ? P : undefined;\n\n/**\n * Creates a single-error failure array. Use in validator functions instead of building the array manually.\n * Typed overloads ensure params match the given error code.\n */\nexport function fail<C extends ErrorCode>(code: C, message: string, params: IssueParams<C>): Issue[];\nexport function fail(code: string, message: string, params?: Record<string, unknown>): Issue[];\nexport function fail(code: string, message: string, params?: Record<string, unknown>): Issue[] {\n  return [{ code, message, params, path: [] } as Issue];\n}\n\n/** Resolve a message value or factory against a context. Re-exported by `core` for schema modules. */\nexport function resolveMessage<Ctx extends Record<string, unknown>>(msg: MessageFn<Ctx>, ctx: Ctx): string {\n  return typeof msg === 'function' ? msg(ctx) : msg;\n}\n\nexport function prependIssuePath(issues: Issue[], prefix: string | number): Issue[] {\n  return issues.map((issue) => ({ ...issue, path: [prefix, ...issue.path] }));\n}\n\n/**\n * Flattens an issue path into a UI key such as `'permissions.0.slug'`. Handles spell-native\n * `(string | number)[]` paths and Standard Schema paths with `{ key }` segments; empty or\n * undefined paths join to `''`.\n */\nexport function joinIssuePath(path: IssuePath | undefined, separator = '.'): string {\n  if (!path || path.length === 0) return '';\n\n  return path\n    .map((segment) => {\n      if (typeof segment === 'object' && segment !== null && 'key' in segment) return String(segment.key);\n      return String(segment);\n    })\n    .join(separator);\n}\n\n/* -------------------- SpellError -------------------- */\n\n/** Base class for all spell errors. Use `instanceof SpellError` to catch any spell-originated error. */\nexport class SpellError extends Error {\n  constructor(message: string, opts?: ErrorOptions) {\n    super(message, opts);\n    this.name = new.target.name;\n    Object.setPrototypeOf(this, new.target.prototype);\n  }\n}\n\n/* -------------------- SpellValidationError -------------------- */\n\nfunction formatIssues(issues: Issue[]): string {\n  return issues\n    .map(({ code, message, path }) => {\n      const pathStr = path.length ? path.join('.') : 'value';\n\n      return `${pathStr}: ${message} [${code}]`;\n    })\n    .join('\\n');\n}\n\nfunction pathsEqual(left: readonly (string | number)[], right: readonly (string | number)[]): boolean {\n  return left.length === right.length && left.every((segment, index) => segment === right[index]);\n}\n\nexport type FlatError = { messages: string[]; path: (string | number)[] };\nexport type FlatErrorFirst = { message: string; path: (string | number)[] };\n\nexport class SpellDefinitionError extends SpellError {}\n\nexport class SpellValidationError extends SpellError {\n  readonly issues: Issue[];\n\n  constructor(issues: Issue[], cause?: unknown) {\n    super(formatIssues(issues), { cause });\n    this.issues = Object.freeze([...issues]) as Issue[];\n  }\n\n  flatten(): { fieldErrors: FlatError[]; formErrors: string[] } {\n    const fieldErrors: FlatError[] = [];\n    const formErrors: string[] = [];\n    const pathMap = new Map<string, number>();\n\n    for (const issue of this.issues) {\n      if (issue.path.length === 0) {\n        formErrors.push(issue.message);\n      } else {\n        const key = JSON.stringify(issue.path);\n        const existing = pathMap.get(key);\n\n        if (existing !== undefined) {\n          fieldErrors[existing]?.messages.push(issue.message);\n        } else {\n          pathMap.set(key, fieldErrors.length);\n          fieldErrors.push({ messages: [issue.message], path: [...issue.path] });\n        }\n      }\n    }\n\n    return { fieldErrors, formErrors };\n  }\n\n  flattenFirst(): { fieldErrors: FlatErrorFirst[]; formErrors: string[] } {\n    const { fieldErrors, formErrors } = this.flatten();\n\n    return {\n      fieldErrors: fieldErrors.map((fe) => ({ message: fe.messages[0]!, path: fe.path })),\n      formErrors,\n    };\n  }\n\n  /** Returns every message attached to exactly `path`, in issue order. */\n  messagesAt(...path: (string | number)[]): string[] {\n    return this.issues.filter((issue) => pathsEqual(issue.path, path)).map((issue) => issue.message);\n  }\n}\n"],"mappings":"AAYA,SAAgB,EAAK,EAAc,EAAiB,EAA2C,CAC7F,MAAO,CAAC,CAAE,OAAM,UAAS,SAAQ,KAAM,CAAC,CAAE,CAAU,CACtD,CAGA,SAAgB,EAAoD,EAAqB,EAAkB,CACzG,OAAO,OAAO,GAAQ,WAAa,EAAI,CAAG,EAAI,CAChD,CAEA,SAAgB,EAAiB,EAAiB,EAAkC,CAClF,OAAO,EAAO,IAAK,IAAW,CAAE,GAAG,EAAO,KAAM,CAAC,EAAQ,GAAG,EAAM,IAAI,CAAE,EAAE,CAC5E,CAOA,SAAgB,EAAc,EAA6B,EAAY,IAAa,CAGlF,MAFI,CAAC,GAAQ,EAAK,SAAW,EAAU,GAEhC,EACJ,IAAK,GACA,OAAO,GAAY,UAAY,GAAoB,QAAS,EAAgB,OAAO,EAAQ,GAAG,EAC3F,OAAO,CAAO,CACtB,CAAC,CACD,KAAK,CAAS,CACnB,CAKA,IAAa,EAAb,cAAgC,KAAM,CACpC,YAAY,EAAiB,EAAqB,CAChD,MAAM,EAAS,CAAI,EACnB,KAAK,KAAO,WAAW,KACvB,OAAO,eAAe,KAAM,WAAW,SAAS,CAClD,CACF,EAIA,SAAS,EAAa,EAAyB,CAC7C,OAAO,EACJ,KAAK,CAAE,OAAM,UAAS,UAGd,GAFS,EAAK,OAAS,EAAK,KAAK,GAAG,EAAI,QAE7B,IAAI,EAAQ,IAAI,EAAK,EACxC,CAAC,CACD,KAAK;CAAI,CACd,CAEA,SAAS,EAAW,EAAoC,EAA8C,CACpG,OAAO,EAAK,SAAW,EAAM,QAAU,EAAK,OAAO,EAAS,IAAU,IAAY,EAAM,EAAM,CAChG,CAKA,IAAa,EAAb,cAA0C,CAAW,CAAC,EAEzC,EAAb,cAA0C,CAAW,CACnD,OAEA,YAAY,EAAiB,EAAiB,CAC5C,MAAM,EAAa,CAAM,EAAG,CAAE,OAAM,CAAC,EACrC,KAAK,OAAS,OAAO,OAAO,CAAC,GAAG,CAAM,CAAC,CACzC,CAEA,SAA8D,CAC5D,IAAM,EAA2B,CAAC,EAC5B,EAAuB,CAAC,EACxB,EAAU,IAAI,IAEpB,IAAK,IAAM,KAAS,KAAK,OACvB,GAAI,EAAM,KAAK,SAAW,EACxB,EAAW,KAAK,EAAM,OAAO,MACxB,CACL,IAAM,EAAM,KAAK,UAAU,EAAM,IAAI,EAC/B,EAAW,EAAQ,IAAI,CAAG,EAE5B,IAAa,IAAA,IAGf,EAAQ,IAAI,EAAK,EAAY,MAAM,EACnC,EAAY,KAAK,CAAE,SAAU,CAAC,EAAM,OAAO,EAAG,KAAM,CAAC,GAAG,EAAM,IAAI,CAAE,CAAC,GAHrE,EAAY,EAAS,EAAE,SAAS,KAAK,EAAM,OAAO,CAKtD,CAGF,MAAO,CAAE,cAAa,YAAW,CACnC,CAEA,cAAwE,CACtE,GAAM,CAAE,cAAa,cAAe,KAAK,QAAQ,EAEjD,MAAO,CACL,YAAa,EAAY,IAAK,IAAQ,CAAE,QAAS,EAAG,SAAS,GAAK,KAAM,EAAG,IAAK,EAAE,EAClF,YACF,CACF,CAGA,WAAW,GAAG,EAAqC,CACjD,OAAO,KAAK,OAAO,OAAQ,GAAU,EAAW,EAAM,KAAM,CAAI,CAAC,CAAC,CAAC,IAAK,GAAU,EAAM,OAAO,CACjG,CACF"}

package/dist/index.cjs

@@ -1 +1 @@
-Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./errors.cjs"),t=require("./messages.cjs"),n=require("./types.cjs"),r=require("./core.cjs"),i=require("./s.cjs");exports.ErrorCode=n.ErrorCode,exports.Schema=r.Schema,exports.SpellDefinitionError=e.SpellDefinitionError,exports.SpellError=e.SpellError,exports.SpellValidationError=e.SpellValidationError,exports.createParseContext=t.createParseContext,exports.joinIssuePath=e.joinIssuePath,exports.s=i.s;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./errors.cjs"),t=require("./messages.cjs"),n=require("./types.cjs"),r=require("./core.cjs"),i=require("./s.cjs"),a=require("./tolerate.cjs");exports.ErrorCode=n.ErrorCode,exports.Schema=r.Schema,exports.SpellDefinitionError=e.SpellDefinitionError,exports.SpellError=e.SpellError,exports.SpellValidationError=e.SpellValidationError,exports.createParseContext=t.createParseContext,exports.joinIssuePath=e.joinIssuePath,exports.s=i.s,exports.tolerate=a.tolerate;

package/dist/index.d.ts

@@ -1,5 +1,6 @@
-export type { AnySchema, CheckContext, FlatError, FlatErrorFirst, Infer, InferInput, InferOutput, Issue, IssuePath, IssuePathSegment, JsonSchema, MessageFn, Messages, ParseContext, ParseResult, SchemaDescriptor, SchemaWalker, StandardSchemaV1, SyncParsable, ValidateResult, } from './core';
+export type { AnySchema, CheckContext, FlatError, FlatErrorFirst, Infer, InferInput, InferOutput, Issue, IssuePath, IssuePathSegment, JsonSchema, MessageFn, Messages, ParseContext, ParseResult, SchemaDescriptor, StandardSchemaV1, SyncParsable, ValidateResult, } from './core';
 export { ErrorCode, joinIssuePath, Schema, SpellDefinitionError, SpellError, SpellValidationError } from './core';
 export { createParseContext, type DeepPartial } from './messages';
 export { s } from './s';
+export { tolerate } from './tolerate';
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,YAAY,EACV,SAAS,EACT,YAAY,EACZ,SAAS,EACT,cAAc,EACd,KAAK,EACL,UAAU,EACV,WAAW,EACX,KAAK,EACL,SAAS,EACT,gBAAgB,EAChB,UAAU,EACV,SAAS,EACT,QAAQ,EACR,YAAY,EACZ,WAAW,EACX,gBAAgB,EAChB,YAAY,EACZ,gBAAgB,EAChB,YAAY,EACZ,cAAc,GACf,MAAM,QAAQ,CAAC;AAChB,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,EAAE,oBAAoB,EAAE,UAAU,EAAE,oBAAoB,EAAE,MAAM,QAAQ,CAAC;AAClH,OAAO,EAAE,kBAAkB,EAAE,KAAK,WAAW,EAAE,MAAM,YAAY,CAAC;AAClE,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,YAAY,EACV,SAAS,EACT,YAAY,EACZ,SAAS,EACT,cAAc,EACd,KAAK,EACL,UAAU,EACV,WAAW,EACX,KAAK,EACL,SAAS,EACT,gBAAgB,EAChB,UAAU,EACV,SAAS,EACT,QAAQ,EACR,YAAY,EACZ,WAAW,EACX,gBAAgB,EAChB,gBAAgB,EAChB,YAAY,EACZ,cAAc,GACf,MAAM,QAAQ,CAAC;AAChB,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,EAAE,oBAAoB,EAAE,UAAU,EAAE,oBAAoB,EAAE,MAAM,QAAQ,CAAC;AAClH,OAAO,EAAE,kBAAkB,EAAE,KAAK,WAAW,EAAE,MAAM,YAAY,CAAC;AAClE,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC"}

package/dist/index.js

@@ -1 +1 @@
-import{SpellDefinitionError as e,SpellError as t,SpellValidationError as n,joinIssuePath as r}from"./errors.js";import{createParseContext as i}from"./messages.js";import{ErrorCode as a}from"./types.js";import{Schema as o}from"./core.js";import{s}from"./s.js";export{a as ErrorCode,o as Schema,e as SpellDefinitionError,t as SpellError,n as SpellValidationError,i as createParseContext,r as joinIssuePath,s};
+import{SpellDefinitionError as e,SpellError as t,SpellValidationError as n,joinIssuePath as r}from"./errors.js";import{createParseContext as i}from"./messages.js";import{ErrorCode as a}from"./types.js";import{Schema as o}from"./core.js";import{s}from"./s.js";import{tolerate as c}from"./tolerate.js";export{a as ErrorCode,o as Schema,e as SpellDefinitionError,t as SpellError,n as SpellValidationError,i as createParseContext,r as joinIssuePath,s,c as tolerate};

package/dist/s.cjs

@@ -1,2 +1,2 @@
-const e=require("./core.cjs"),t=require("./schemas/array.cjs"),n=require("./schemas/bigint.cjs"),r=require("./schemas/boolean.cjs"),i=require("./schemas/date.cjs"),a=require("./schemas/enum.cjs"),o=require("./schemas/instanceof.cjs"),s=require("./schemas/intersect.cjs"),c=require("./schemas/lazy.cjs"),l=require("./schemas/literal.cjs"),u=require("./schemas/map.cjs"),d=require("./schemas/never.cjs"),f=require("./schemas/number.cjs"),p=require("./schemas/union.cjs"),m=require("./schemas/object.cjs"),h=require("./schemas/raw-or.cjs"),g=require("./schemas/record.cjs"),_=require("./schemas/set.cjs"),v=require("./schemas/string.cjs"),y=require("./schemas/tuple.cjs"),b=require("./schemas/variant.cjs");var x={array:e=>new t.ArraySchema(e),bigint:()=>new n.BigIntSchema,boolean:()=>new r.BooleanSchema,coerce:{bigint:()=>n.BigIntSchema.coerce(),boolean:()=>r.BooleanSchema.coerce(),date:()=>i.DateSchema.coerce(),number:()=>f.NumberSchema.coerce(),string:()=>v.StringSchema.coerce()},date:()=>new i.DateSchema,discriminatedUnion:(e,t)=>new b.VariantSchema(e,t),enum:e=>new a.EnumSchema(e),instanceof:e=>new o.InstanceOfSchema(e),intersect:(...e)=>new s.IntersectSchema(h.normalizeToSchemas(e)),lazy:e=>new c.LazySchema(e),literal:e=>new l.LiteralSchema(e),map:(e,t)=>new u.MapSchema(e,t),never:()=>new d.NeverSchema,null:()=>new l.LiteralSchema(null),number:()=>new f.NumberSchema,object:e=>new m.ObjectSchema(e),record:(e,t)=>new g.RecordSchema(e,t),set:e=>new _.SetSchema(e),string:()=>new v.StringSchema,tuple:e=>new y.TupleSchema(e),undefined:()=>new l.LiteralSchema(void 0),union:(...e)=>new p.UnionSchema(h.normalizeToSchemas(e)),unknown:()=>new e.Schema};exports.s=x;
+const e=require("./core.cjs"),t=require("./schemas/array.cjs"),n=require("./schemas/bigint.cjs"),r=require("./schemas/boolean.cjs"),i=require("./schemas/date.cjs"),a=require("./schemas/enum.cjs"),o=require("./schemas/instanceof.cjs"),s=require("./schemas/intersect.cjs"),c=require("./schemas/lazy.cjs"),l=require("./schemas/literal.cjs"),u=require("./schemas/map.cjs"),d=require("./schemas/never.cjs"),f=require("./schemas/number.cjs"),p=require("./schemas/union.cjs"),m=require("./schemas/object.cjs"),h=require("./schemas/raw-or.cjs"),g=require("./schemas/record.cjs"),_=require("./schemas/set.cjs"),v=require("./schemas/string.cjs"),y=require("./schemas/tuple.cjs"),b=require("./schemas/variant.cjs");var x=e=>new t.ArraySchema(e),S=()=>new n.BigIntSchema,C=()=>new r.BooleanSchema,w=()=>new i.DateSchema,T=e=>new a.EnumSchema(e),E=e=>new o.InstanceOfSchema(e),D=(...e)=>new s.IntersectSchema(h.normalizeToSchemas(e)),O=e=>new c.LazySchema(e),k=e=>new l.LiteralSchema(e),A=(e,t)=>new u.MapSchema(e,t),j=()=>new d.NeverSchema,M=()=>new l.LiteralSchema(null),N=()=>new f.NumberSchema,P=e=>new m.ObjectSchema(e),F=(e,t)=>new g.RecordSchema(e,t),I=e=>new _.SetSchema(e),L=()=>new v.StringSchema,R=e=>new y.TupleSchema(e),z=()=>new l.LiteralSchema(void 0);function B(...e){return new p.UnionSchema(h.normalizeToSchemas(e))}var V={array:x,bigint:S,boolean:C,coerce:{bigint:()=>n.BigIntSchema.coerce(),boolean:()=>r.BooleanSchema.coerce(),date:()=>i.DateSchema.coerce(),number:()=>f.NumberSchema.coerce(),string:()=>v.StringSchema.coerce()},date:w,discriminatedUnion:(e,t)=>new b.VariantSchema(e,t),enum:T,instanceof:E,intersect:D,lazy:O,literal:k,map:A,never:j,null:M,number:N,object:P,record:F,set:I,string:L,tuple:R,undefined:z,union:B,unknown:()=>new e.Schema};exports.s=V;
 //# sourceMappingURL=s.cjs.map

package/dist/s.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"s.cjs","names":[],"sources":["../src/s.ts"],"sourcesContent":["import { type AnySchema, type InferInput, type InferOutput, type InferSchemaMode, Schema } from './core';\nimport { ArraySchema } from './schemas/array';\nimport { BigIntSchema } from './schemas/bigint';\nimport { BooleanSchema } from './schemas/boolean';\nimport { DateSchema } from './schemas/date';\nimport { EnumSchema, type EnumValues } from './schemas/enum';\nimport { InstanceOfSchema } from './schemas/instanceof';\nimport { IntersectSchema } from './schemas/intersect';\nimport { LazySchema } from './schemas/lazy';\nimport { LiteralSchema } from './schemas/literal';\nimport { MapSchema } from './schemas/map';\nimport { NeverSchema } from './schemas/never';\nimport { NumberSchema } from './schemas/number';\nimport { ObjectSchema, type ObjectShape } from './schemas/object';\nimport { type NormalizeItems, normalizeToSchemas, type RawOrSchema } from './schemas/raw-or';\nimport { RecordSchema } from './schemas/record';\nimport { SetSchema } from './schemas/set';\nimport { StringSchema } from './schemas/string';\nimport { TupleSchema, type TupleSchemas } from './schemas/tuple';\nimport { UnionSchema } from './schemas/union';\nimport { VariantSchema } from './schemas/variant';\n\n/* -------------------- Internal factory functions -------------------- */\n\nconst sArray = <T extends AnySchema>(schema: T): ArraySchema<T> => new ArraySchema(schema);\nconst sBigint = (): BigIntSchema => new BigIntSchema();\nconst sBoolean = (): BooleanSchema => new BooleanSchema();\nconst sDate = (): DateSchema => new DateSchema();\nconst sEnum = <const T extends EnumValues>(values: T): EnumSchema<T> => new EnumSchema(values);\nconst sInstanceof = <T>(cls: new (...args: never[]) => T): InstanceOfSchema<T> => new InstanceOfSchema(cls);\nconst sIntersect = <T extends readonly [RawOrSchema, RawOrSchema, ...RawOrSchema[]]>(\n  ...items: T\n): IntersectSchema<NormalizeItems<T> & readonly AnySchema[]> =>\n  new IntersectSchema(normalizeToSchemas(items) as NormalizeItems<T> & readonly AnySchema[]);\nconst sLazy = <T extends AnySchema>(getter: () => T): LazySchema<InferOutput<T>, InferInput<T>, InferSchemaMode<T>> =>\n  new LazySchema(getter as unknown as () => Schema<InferOutput<T>, InferInput<T>, InferSchemaMode<T>>);\nconst sLiteral = <T extends string | number | boolean | null | undefined>(value: T): LiteralSchema<T> =>\n  new LiteralSchema(value);\nconst sMap = <K extends AnySchema, V extends AnySchema>(keySchema: K, valueSchema: V): MapSchema<K, V> =>\n  new MapSchema(keySchema, valueSchema);\nconst sNever = (): NeverSchema => new NeverSchema();\nconst sNull = (): LiteralSchema<null> => new LiteralSchema(null);\nconst sNumber = (): NumberSchema => new NumberSchema();\nconst sObject = <T extends ObjectShape>(shape: T): ObjectSchema<T> => new ObjectSchema(shape);\nconst sRecord = <K extends AnySchema, V extends AnySchema>(keySchema: K, valueSchema: V): RecordSchema<K, V> =>\n  new RecordSchema(keySchema, valueSchema);\nconst sSet = <T extends AnySchema>(schema: T): SetSchema<T> => new SetSchema(schema);\nconst sString = (): StringSchema => new StringSchema();\nconst sTuple = <const T extends TupleSchemas>(items: T): TupleSchema<T> => new TupleSchema(items);\nconst sUndefined = (): LiteralSchema<undefined> => new LiteralSchema(undefined);\nconst sUnion = <T extends readonly [RawOrSchema, RawOrSchema, ...RawOrSchema[]]>(\n  ...items: T\n): UnionSchema<NormalizeItems<T> & readonly AnySchema[]> =>\n  new UnionSchema(normalizeToSchemas(items) as NormalizeItems<T> & readonly AnySchema[]);\nconst sUnknown = (): Schema<unknown> => new Schema();\nconst sVariant = <K extends string, M extends Record<string, ObjectSchema<any, any>>>(\n  discriminator: K,\n  map: M,\n): VariantSchema<K, M> => new VariantSchema(discriminator, map);\nconst sCoerce = {\n  bigint: (): BigIntSchema<unknown> => BigIntSchema.coerce(),\n  boolean: (): BooleanSchema<unknown> => BooleanSchema.coerce(),\n  date: (): DateSchema<unknown> => DateSchema.coerce(),\n  number: (): NumberSchema<unknown> => NumberSchema.coerce(),\n  string: (): StringSchema<unknown> => StringSchema.coerce(),\n};\n\n/* -------------------- `s` namespace — the public API -------------------- */\n\n/**\n * Namespace of all schema factories. Use `s.string()`, `s.object()`, etc.\n *\n * @example\n * import { s, type Infer } from '@vielzeug/spell';\n *\n * const User = s.object({ name: s.string(), age: s.number().int().positive() });\n * type User = Infer<typeof User>;\n */\nexport const s = {\n  array: sArray,\n  bigint: sBigint,\n  boolean: sBoolean,\n  coerce: sCoerce,\n  date: sDate,\n  discriminatedUnion: sVariant,\n  enum: sEnum,\n  instanceof: sInstanceof,\n  intersect: sIntersect,\n  lazy: sLazy,\n  literal: sLiteral,\n  map: sMap,\n  never: sNever,\n  null: sNull,\n  number: sNumber,\n  object: sObject,\n  record: sRecord,\n  set: sSet,\n  string: sString,\n  tuple: sTuple,\n  undefined: sUndefined,\n  union: sUnion,\n  unknown: sUnknown,\n};\n"],"mappings":"gsBA8EA,IAAa,EAAI,CACf,MAvDmC,GAA8B,IAAI,EAAA,YAAY,CAAM,EAwDvF,WAvDkC,IAAI,EAAA,aAwDtC,YAvDoC,IAAI,EAAA,cAwDxC,OAAQ,CAtBR,WAAqC,EAAA,aAAa,OAAO,EACzD,YAAuC,EAAA,cAAc,OAAO,EAC5D,SAAiC,EAAA,WAAW,OAAO,EACnD,WAAqC,EAAA,aAAa,OAAO,EACzD,WAAqC,EAAA,aAAa,OAAO,CAkBjD,EACR,SAxD8B,IAAI,EAAA,WAyDlC,oBA5BA,EACA,IACwB,IAAI,EAAA,cAAc,EAAe,CAAG,EA2B5D,KAzDyC,GAA6B,IAAI,EAAA,WAAW,CAAM,EA0D3F,WAzDsB,GAA0D,IAAI,EAAA,iBAAiB,CAAG,EA0DxG,WAxDA,GAAG,IAEH,IAAI,EAAA,gBAAgB,EAAA,mBAAmB,CAAK,CAA6C,EAuDzF,KAtDkC,GAClC,IAAI,EAAA,WAAW,CAAoF,EAsDnG,QArDwE,GACxE,IAAI,EAAA,cAAc,CAAK,EAqDvB,KApDsD,EAAc,IACpE,IAAI,EAAA,UAAU,EAAW,CAAW,EAoDpC,UAnDgC,IAAI,EAAA,YAoDpC,SAnDuC,IAAI,EAAA,cAAc,IAAI,EAoD7D,WAnDkC,IAAI,EAAA,aAoDtC,OAnDsC,GAA8B,IAAI,EAAA,aAAa,CAAK,EAoD1F,QAnDyD,EAAc,IACvE,IAAI,EAAA,aAAa,EAAW,CAAW,EAmDvC,IAlDiC,GAA4B,IAAI,EAAA,UAAU,CAAM,EAmDjF,WAlDkC,IAAI,EAAA,aAmDtC,MAlD4C,GAA6B,IAAI,EAAA,YAAY,CAAK,EAmD9F,cAlDiD,IAAI,EAAA,cAAc,IAAA,EAAS,EAmD5E,OAjDA,GAAG,IAEH,IAAI,EAAA,YAAY,EAAA,mBAAmB,CAAK,CAA6C,EAgDrF,YA/CsC,IAAI,EAAA,MAgD5C"}
+{"version":3,"file":"s.cjs","names":[],"sources":["../src/s.ts"],"sourcesContent":["import { type AnySchema, type InferInput, type InferOutput, Schema } from './core';\nimport { ArraySchema } from './schemas/array';\nimport { BigIntSchema } from './schemas/bigint';\nimport { BooleanSchema } from './schemas/boolean';\nimport { DateSchema } from './schemas/date';\nimport { EnumSchema, type EnumValues } from './schemas/enum';\nimport { InstanceOfSchema } from './schemas/instanceof';\nimport { IntersectSchema } from './schemas/intersect';\nimport { LazySchema } from './schemas/lazy';\nimport { LiteralSchema } from './schemas/literal';\nimport { MapSchema } from './schemas/map';\nimport { NeverSchema } from './schemas/never';\nimport { NumberSchema } from './schemas/number';\nimport { ObjectSchema, type ObjectShape } from './schemas/object';\nimport { type NormalizeItems, normalizeToSchemas, type RawOrSchema } from './schemas/raw-or';\nimport { RecordSchema } from './schemas/record';\nimport { SetSchema } from './schemas/set';\nimport { StringSchema } from './schemas/string';\nimport { TupleSchema, type TupleSchemas } from './schemas/tuple';\nimport { UnionSchema } from './schemas/union';\nimport { VariantSchema } from './schemas/variant';\n\n/* -------------------- Internal factory functions -------------------- */\n\nconst sArray = <T extends AnySchema>(schema: T): ArraySchema<T> => new ArraySchema(schema);\nconst sBigint = (): BigIntSchema => new BigIntSchema();\nconst sBoolean = (): BooleanSchema => new BooleanSchema();\nconst sDate = (): DateSchema => new DateSchema();\nconst sEnum = <const T extends EnumValues>(values: T): EnumSchema<T> => new EnumSchema(values);\nconst sInstanceof = <T>(cls: new (...args: never[]) => T): InstanceOfSchema<T> => new InstanceOfSchema(cls);\nconst sIntersect = <T extends readonly [RawOrSchema, RawOrSchema, ...RawOrSchema[]]>(\n  ...items: T\n): IntersectSchema<NormalizeItems<T> & readonly AnySchema[]> =>\n  new IntersectSchema(normalizeToSchemas(items) as NormalizeItems<T> & readonly AnySchema[]);\nconst sLazy = <T extends AnySchema>(getter: () => T): LazySchema<InferOutput<T>, InferInput<T>> =>\n  new LazySchema(getter as unknown as () => Schema<InferOutput<T>, InferInput<T>>);\nconst sLiteral = <T extends string | number | boolean | null | undefined>(value: T): LiteralSchema<T> =>\n  new LiteralSchema(value);\nconst sMap = <K extends AnySchema, V extends AnySchema>(keySchema: K, valueSchema: V): MapSchema<K, V> =>\n  new MapSchema(keySchema, valueSchema);\nconst sNever = (): NeverSchema => new NeverSchema();\nconst sNull = (): LiteralSchema<null> => new LiteralSchema(null);\nconst sNumber = (): NumberSchema => new NumberSchema();\nconst sObject = <T extends ObjectShape>(shape: T): ObjectSchema<T> => new ObjectSchema(shape);\nconst sRecord = <K extends AnySchema, V extends AnySchema>(keySchema: K, valueSchema: V): RecordSchema<K, V> =>\n  new RecordSchema(keySchema, valueSchema);\nconst sSet = <T extends AnySchema>(schema: T): SetSchema<T> => new SetSchema(schema);\nconst sString = (): StringSchema => new StringSchema();\nconst sTuple = <const T extends TupleSchemas>(items: T): TupleSchema<T> => new TupleSchema(items);\nconst sUndefined = (): LiteralSchema<undefined> => new LiteralSchema(undefined);\n// Schema-only tuples keep their concrete branch types; the second overload normalizes raw\n// literals, where intersecting with AnySchema[] costs nothing.\nfunction sUnion<T extends readonly [AnySchema, AnySchema, ...AnySchema[]]>(...items: T): UnionSchema<T>;\nfunction sUnion<T extends readonly [RawOrSchema, RawOrSchema, ...RawOrSchema[]]>(\n  ...items: T\n): UnionSchema<NormalizeItems<T> & readonly AnySchema[]>;\nfunction sUnion(this: unknown, ...items: readonly RawOrSchema[]): UnionSchema<readonly AnySchema[]> {\n  return new UnionSchema(normalizeToSchemas(items) as AnySchema[]);\n}\nconst sUnknown = (): Schema<unknown> => new Schema();\nconst sVariant = <K extends string, M extends Record<string, ObjectSchema<any>>>(\n  discriminator: K,\n  map: M,\n): VariantSchema<K, M> => new VariantSchema(discriminator, map);\nconst sCoerce = {\n  bigint: (): BigIntSchema<unknown> => BigIntSchema.coerce(),\n  boolean: (): BooleanSchema<unknown> => BooleanSchema.coerce(),\n  date: (): DateSchema<unknown> => DateSchema.coerce(),\n  number: (): NumberSchema<unknown> => NumberSchema.coerce(),\n  string: (): StringSchema<unknown> => StringSchema.coerce(),\n};\n\n/* -------------------- `s` namespace — the public API -------------------- */\n\n/**\n * Namespace of all schema factories. Use `s.string()`, `s.object()`, etc.\n *\n * @example\n * import { s, type Infer } from '@vielzeug/spell';\n *\n * const User = s.object({ name: s.string(), age: s.number().int().positive() });\n * type User = Infer<typeof User>;\n */\nexport const s = {\n  array: sArray,\n  bigint: sBigint,\n  boolean: sBoolean,\n  coerce: sCoerce,\n  date: sDate,\n  discriminatedUnion: sVariant,\n  enum: sEnum,\n  instanceof: sInstanceof,\n  intersect: sIntersect,\n  lazy: sLazy,\n  literal: sLiteral,\n  map: sMap,\n  never: sNever,\n  null: sNull,\n  number: sNumber,\n  object: sObject,\n  record: sRecord,\n  set: sSet,\n  string: sString,\n  tuple: sTuple,\n  undefined: sUndefined,\n  union: sUnion,\n  unknown: sUnknown,\n};\n"],"mappings":"gsBAwBA,IAAM,EAA+B,GAA8B,IAAI,EAAA,YAAY,CAAM,EACnF,MAA8B,IAAI,EAAA,aAClC,MAAgC,IAAI,EAAA,cACpC,MAA0B,IAAI,EAAA,WAC9B,EAAqC,GAA6B,IAAI,EAAA,WAAW,CAAM,EACvF,EAAkB,GAA0D,IAAI,EAAA,iBAAiB,CAAG,EACpG,GACJ,GAAG,IAEH,IAAI,EAAA,gBAAgB,EAAA,mBAAmB,CAAK,CAA6C,EACrF,EAA8B,GAClC,IAAI,EAAA,WAAW,CAAgE,EAC3E,EAAoE,GACxE,IAAI,EAAA,cAAc,CAAK,EACnB,GAAkD,EAAc,IACpE,IAAI,EAAA,UAAU,EAAW,CAAW,EAChC,MAA4B,IAAI,EAAA,YAChC,MAAmC,IAAI,EAAA,cAAc,IAAI,EACzD,MAA8B,IAAI,EAAA,aAClC,EAAkC,GAA8B,IAAI,EAAA,aAAa,CAAK,EACtF,GAAqD,EAAc,IACvE,IAAI,EAAA,aAAa,EAAW,CAAW,EACnC,EAA6B,GAA4B,IAAI,EAAA,UAAU,CAAM,EAC7E,MAA8B,IAAI,EAAA,aAClC,EAAwC,GAA6B,IAAI,EAAA,YAAY,CAAK,EAC1F,MAA6C,IAAI,EAAA,cAAc,IAAA,EAAS,EAO9E,SAAS,EAAsB,GAAG,EAAkE,CAClG,OAAO,IAAI,EAAA,YAAY,EAAA,mBAAmB,CAAK,CAAgB,CACjE,CAyBA,IAAa,EAAI,CACf,MAAO,EACP,OAAQ,EACR,QAAS,EACT,OAAQ,CAtBR,WAAqC,EAAA,aAAa,OAAO,EACzD,YAAuC,EAAA,cAAc,OAAO,EAC5D,SAAiC,EAAA,WAAW,OAAO,EACnD,WAAqC,EAAA,aAAa,OAAO,EACzD,WAAqC,EAAA,aAAa,OAAO,CAkBjD,EACR,KAAM,EACN,oBA5BA,EACA,IACwB,IAAI,EAAA,cAAc,EAAe,CAAG,EA2B5D,KAAM,EACN,WAAY,EACZ,UAAW,EACX,KAAM,EACN,QAAS,EACT,IAAK,EACL,MAAO,EACP,KAAM,EACN,OAAQ,EACR,OAAQ,EACR,OAAQ,EACR,IAAK,EACL,OAAQ,EACR,MAAO,EACP,UAAW,EACX,MAAO,EACP,YA/CsC,IAAI,EAAA,MAgD5C"}

package/dist/s.d.ts

@@ -1,4 +1,4 @@
-import { type AnySchema, type InferInput, type InferOutput, type InferSchemaMode, Schema } from './core';
+import { type AnySchema, type InferInput, type InferOutput, Schema } from './core';
 import { ArraySchema } from './schemas/array';
 import { BigIntSchema } from './schemas/bigint';
 import { BooleanSchema } from './schemas/boolean';
@@ -19,6 +19,8 @@ import { StringSchema } from './schemas/string';
 import { TupleSchema, type TupleSchemas } from './schemas/tuple';
 import { UnionSchema } from './schemas/union';
 import { VariantSchema } from './schemas/variant';
+declare function sUnion<T extends readonly [AnySchema, AnySchema, ...AnySchema[]]>(...items: T): UnionSchema<T>;
+declare function sUnion<T extends readonly [RawOrSchema, RawOrSchema, ...RawOrSchema[]]>(...items: T): UnionSchema<NormalizeItems<T> & readonly AnySchema[]>;
 /**
  * Namespace of all schema factories. Use `s.string()`, `s.object()`, etc.
  *
@@ -40,11 +42,11 @@ export declare const s: {
         string: () => StringSchema<unknown>;
     };
     date: () => DateSchema;
-    discriminatedUnion: <K extends string, M extends Record<string, ObjectSchema<any, any>>>(discriminator: K, map: M) => VariantSchema<K, M>;
+    discriminatedUnion: <K extends string, M extends Record<string, ObjectSchema<any>>>(discriminator: K, map: M) => VariantSchema<K, M>;
     enum: <const T extends EnumValues>(values: T) => EnumSchema<T>;
     instanceof: <T>(cls: new (...args: never[]) => T) => InstanceOfSchema<T>;
     intersect: <T extends readonly [RawOrSchema, RawOrSchema, ...RawOrSchema[]]>(...items: T) => IntersectSchema<NormalizeItems<T> & readonly AnySchema[]>;
-    lazy: <T extends AnySchema>(getter: () => T) => LazySchema<InferOutput<T>, InferInput<T>, InferSchemaMode<T>>;
+    lazy: <T extends AnySchema>(getter: () => T) => LazySchema<InferOutput<T>, InferInput<T>>;
     literal: <T extends string | number | boolean | null | undefined>(value: T) => LiteralSchema<T>;
     map: <K extends AnySchema, V extends AnySchema>(keySchema: K, valueSchema: V) => MapSchema<K, V>;
     never: () => NeverSchema;
@@ -56,7 +58,8 @@ export declare const s: {
     string: () => StringSchema;
     tuple: <const T extends TupleSchemas>(items: T) => TupleSchema<T>;
     undefined: () => LiteralSchema<undefined>;
-    union: <T extends readonly [RawOrSchema, RawOrSchema, ...RawOrSchema[]]>(...items: T) => UnionSchema<NormalizeItems<T> & readonly AnySchema[]>;
+    union: typeof sUnion;
     unknown: () => Schema<unknown>;
 };
+export {};
 //# sourceMappingURL=s.d.ts.map

package/dist/s.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"s.d.ts","sourceRoot":"","sources":["../src/s.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,SAAS,EAAE,KAAK,UAAU,EAAE,KAAK,WAAW,EAAE,KAAK,eAAe,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AACzG,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,KAAK,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AACxD,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC1C,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,KAAK,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAClE,OAAO,EAAE,KAAK,cAAc,EAAsB,KAAK,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAC7F,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,KAAK,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACjE,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAiDlD;;;;;;;;GAQG;AACH,eAAO,MAAM,CAAC;YAtDE,CAAC,SAAS,SAAS,UAAU,CAAC,KAAG,WAAW,CAAC,CAAC,CAAC;kBAC3C,YAAY;mBACX,aAAa;;sBAkCpB,YAAY,CAAC,OAAO,CAAC;uBACpB,aAAa,CAAC,OAAO,CAAC;oBACzB,UAAU,CAAC,OAAO,CAAC;sBACjB,YAAY,CAAC,OAAO,CAAC;sBACrB,YAAY,CAAC,OAAO,CAAC;;gBArCjB,UAAU;yBA4BV,CAAC,SAAS,MAAM,EAAE,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,iBACnE,CAAC,OACX,CAAC,KACL,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;iBA9BD,CAAC,SAAS,UAAU,UAAU,CAAC,KAAG,UAAU,CAAC,CAAC,CAAC;iBAC/C,CAAC,OAAO,KAAK,GAAG,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAG,gBAAgB,CAAC,CAAC,CAAC;gBAC1D,CAAC,SAAS,SAAS,CAAC,WAAW,EAAE,WAAW,EAAE,GAAG,WAAW,EAAE,CAAC,YACvE,CAAC,KACV,eAAe,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,SAAS,SAAS,EAAE,CAAC;WAE7C,CAAC,SAAS,SAAS,UAAU,MAAM,CAAC,KAAG,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;cAEjG,CAAC,SAAS,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,GAAG,SAAS,SAAS,CAAC,KAAG,aAAa,CAAC,CAAC,CAAC;UAEvF,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,SAAS,aAAa,CAAC,eAAe,CAAC,KAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;iBAEnF,WAAW;gBACZ,aAAa,CAAC,IAAI,CAAC;kBACjB,YAAY;aACf,CAAC,SAAS,WAAW,SAAS,CAAC,KAAG,YAAY,CAAC,CAAC,CAAC;aACjD,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,SAAS,aAAa,CAAC,eAAe,CAAC,KAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC;UAE9F,CAAC,SAAS,SAAS,UAAU,CAAC,KAAG,SAAS,CAAC,CAAC,CAAC;kBACvC,YAAY;kBACV,CAAC,SAAS,YAAY,SAAS,CAAC,KAAG,WAAW,CAAC,CAAC,CAAC;qBAChD,aAAa,CAAC,SAAS,CAAC;YAC/B,CAAC,SAAS,SAAS,CAAC,WAAW,EAAE,WAAW,EAAE,GAAG,WAAW,EAAE,CAAC,YACnE,CAAC,KACV,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,SAAS,SAAS,EAAE,CAAC;mBAEnC,MAAM,CAAC,OAAO,CAAC;CAgDnC,CAAC"}
+{"version":3,"file":"s.d.ts","sourceRoot":"","sources":["../src/s.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,SAAS,EAAE,KAAK,UAAU,EAAE,KAAK,WAAW,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AACnF,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,KAAK,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AACxD,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC1C,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,KAAK,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAClE,OAAO,EAAE,KAAK,cAAc,EAAsB,KAAK,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAC7F,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,KAAK,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACjE,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAgClD,iBAAS,MAAM,CAAC,CAAC,SAAS,SAAS,CAAC,SAAS,EAAE,SAAS,EAAE,GAAG,SAAS,EAAE,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;AACxG,iBAAS,MAAM,CAAC,CAAC,SAAS,SAAS,CAAC,WAAW,EAAE,WAAW,EAAE,GAAG,WAAW,EAAE,CAAC,EAC7E,GAAG,KAAK,EAAE,CAAC,GACV,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,SAAS,SAAS,EAAE,CAAC,CAAC;AAmBzD;;;;;;;;GAQG;AACH,eAAO,MAAM,CAAC;YA3DE,CAAC,SAAS,SAAS,UAAU,CAAC,KAAG,WAAW,CAAC,CAAC,CAAC;kBAC3C,YAAY;mBACX,aAAa;;sBAuCpB,YAAY,CAAC,OAAO,CAAC;uBACpB,aAAa,CAAC,OAAO,CAAC;oBACzB,UAAU,CAAC,OAAO,CAAC;sBACjB,YAAY,CAAC,OAAO,CAAC;sBACrB,YAAY,CAAC,OAAO,CAAC;;gBA1CjB,UAAU;yBAiCV,CAAC,SAAS,MAAM,EAAE,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,iBAC9D,CAAC,OACX,CAAC,KACL,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;iBAnCD,CAAC,SAAS,UAAU,UAAU,CAAC,KAAG,UAAU,CAAC,CAAC,CAAC;iBAC/C,CAAC,OAAO,KAAK,GAAG,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAG,gBAAgB,CAAC,CAAC,CAAC;gBAC1D,CAAC,SAAS,SAAS,CAAC,WAAW,EAAE,WAAW,EAAE,GAAG,WAAW,EAAE,CAAC,YACvE,CAAC,KACV,eAAe,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,SAAS,SAAS,EAAE,CAAC;WAE7C,CAAC,SAAS,SAAS,UAAU,MAAM,CAAC,KAAG,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;cAE7E,CAAC,SAAS,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,GAAG,SAAS,SAAS,CAAC,KAAG,aAAa,CAAC,CAAC,CAAC;UAEvF,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,SAAS,aAAa,CAAC,eAAe,CAAC,KAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;iBAEnF,WAAW;gBACZ,aAAa,CAAC,IAAI,CAAC;kBACjB,YAAY;aACf,CAAC,SAAS,WAAW,SAAS,CAAC,KAAG,YAAY,CAAC,CAAC,CAAC;aACjD,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,SAAS,aAAa,CAAC,eAAe,CAAC,KAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC;UAE9F,CAAC,SAAS,SAAS,UAAU,CAAC,KAAG,SAAS,CAAC,CAAC,CAAC;kBACvC,YAAY;kBACV,CAAC,SAAS,YAAY,SAAS,CAAC,KAAG,WAAW,CAAC,CAAC,CAAC;qBAChD,aAAa,CAAC,SAAS,CAAC;;mBAU1B,MAAM,CAAC,OAAO,CAAC;CAgDnC,CAAC"}

package/dist/s.js

@@ -1,2 +1,2 @@
-import{Schema as e}from"./core.js";import{ArraySchema as t}from"./schemas/array.js";import{BigIntSchema as n}from"./schemas/bigint.js";import{BooleanSchema as r}from"./schemas/boolean.js";import{DateSchema as i}from"./schemas/date.js";import{EnumSchema as a}from"./schemas/enum.js";import{InstanceOfSchema as o}from"./schemas/instanceof.js";import{IntersectSchema as s}from"./schemas/intersect.js";import{LazySchema as c}from"./schemas/lazy.js";import{LiteralSchema as l}from"./schemas/literal.js";import{MapSchema as u}from"./schemas/map.js";import{NeverSchema as d}from"./schemas/never.js";import{NumberSchema as f}from"./schemas/number.js";import{UnionSchema as p}from"./schemas/union.js";import{ObjectSchema as m}from"./schemas/object.js";import{normalizeToSchemas as h}from"./schemas/raw-or.js";import{RecordSchema as g}from"./schemas/record.js";import{SetSchema as _}from"./schemas/set.js";import{StringSchema as v}from"./schemas/string.js";import{TupleSchema as y}from"./schemas/tuple.js";import{VariantSchema as b}from"./schemas/variant.js";var x={array:e=>new t(e),bigint:()=>new n,boolean:()=>new r,coerce:{bigint:()=>n.coerce(),boolean:()=>r.coerce(),date:()=>i.coerce(),number:()=>f.coerce(),string:()=>v.coerce()},date:()=>new i,discriminatedUnion:(e,t)=>new b(e,t),enum:e=>new a(e),instanceof:e=>new o(e),intersect:(...e)=>new s(h(e)),lazy:e=>new c(e),literal:e=>new l(e),map:(e,t)=>new u(e,t),never:()=>new d,null:()=>new l(null),number:()=>new f,object:e=>new m(e),record:(e,t)=>new g(e,t),set:e=>new _(e),string:()=>new v,tuple:e=>new y(e),undefined:()=>new l(void 0),union:(...e)=>new p(h(e)),unknown:()=>new e};export{x as s};
+import{Schema as e}from"./core.js";import{ArraySchema as t}from"./schemas/array.js";import{BigIntSchema as n}from"./schemas/bigint.js";import{BooleanSchema as r}from"./schemas/boolean.js";import{DateSchema as i}from"./schemas/date.js";import{EnumSchema as a}from"./schemas/enum.js";import{InstanceOfSchema as o}from"./schemas/instanceof.js";import{IntersectSchema as s}from"./schemas/intersect.js";import{LazySchema as c}from"./schemas/lazy.js";import{LiteralSchema as l}from"./schemas/literal.js";import{MapSchema as u}from"./schemas/map.js";import{NeverSchema as d}from"./schemas/never.js";import{NumberSchema as f}from"./schemas/number.js";import{UnionSchema as p}from"./schemas/union.js";import{ObjectSchema as m}from"./schemas/object.js";import{normalizeToSchemas as h}from"./schemas/raw-or.js";import{RecordSchema as g}from"./schemas/record.js";import{SetSchema as _}from"./schemas/set.js";import{StringSchema as v}from"./schemas/string.js";import{TupleSchema as y}from"./schemas/tuple.js";import{VariantSchema as b}from"./schemas/variant.js";var x=e=>new t(e),S=()=>new n,C=()=>new r,w=()=>new i,T=e=>new a(e),E=e=>new o(e),D=(...e)=>new s(h(e)),O=e=>new c(e),k=e=>new l(e),A=(e,t)=>new u(e,t),j=()=>new d,M=()=>new l(null),N=()=>new f,P=e=>new m(e),F=(e,t)=>new g(e,t),I=e=>new _(e),L=()=>new v,R=e=>new y(e),z=()=>new l(void 0);function B(...e){return new p(h(e))}var V={array:x,bigint:S,boolean:C,coerce:{bigint:()=>n.coerce(),boolean:()=>r.coerce(),date:()=>i.coerce(),number:()=>f.coerce(),string:()=>v.coerce()},date:w,discriminatedUnion:(e,t)=>new b(e,t),enum:T,instanceof:E,intersect:D,lazy:O,literal:k,map:A,never:j,null:M,number:N,object:P,record:F,set:I,string:L,tuple:R,undefined:z,union:B,unknown:()=>new e};export{V as s};
 //# sourceMappingURL=s.js.map

package/dist/s.js.map

@@ -1 +1 @@
-{"version":3,"file":"s.js","names":[],"sources":["../src/s.ts"],"sourcesContent":["import { type AnySchema, type InferInput, type InferOutput, type InferSchemaMode, Schema } from './core';\nimport { ArraySchema } from './schemas/array';\nimport { BigIntSchema } from './schemas/bigint';\nimport { BooleanSchema } from './schemas/boolean';\nimport { DateSchema } from './schemas/date';\nimport { EnumSchema, type EnumValues } from './schemas/enum';\nimport { InstanceOfSchema } from './schemas/instanceof';\nimport { IntersectSchema } from './schemas/intersect';\nimport { LazySchema } from './schemas/lazy';\nimport { LiteralSchema } from './schemas/literal';\nimport { MapSchema } from './schemas/map';\nimport { NeverSchema } from './schemas/never';\nimport { NumberSchema } from './schemas/number';\nimport { ObjectSchema, type ObjectShape } from './schemas/object';\nimport { type NormalizeItems, normalizeToSchemas, type RawOrSchema } from './schemas/raw-or';\nimport { RecordSchema } from './schemas/record';\nimport { SetSchema } from './schemas/set';\nimport { StringSchema } from './schemas/string';\nimport { TupleSchema, type TupleSchemas } from './schemas/tuple';\nimport { UnionSchema } from './schemas/union';\nimport { VariantSchema } from './schemas/variant';\n\n/* -------------------- Internal factory functions -------------------- */\n\nconst sArray = <T extends AnySchema>(schema: T): ArraySchema<T> => new ArraySchema(schema);\nconst sBigint = (): BigIntSchema => new BigIntSchema();\nconst sBoolean = (): BooleanSchema => new BooleanSchema();\nconst sDate = (): DateSchema => new DateSchema();\nconst sEnum = <const T extends EnumValues>(values: T): EnumSchema<T> => new EnumSchema(values);\nconst sInstanceof = <T>(cls: new (...args: never[]) => T): InstanceOfSchema<T> => new InstanceOfSchema(cls);\nconst sIntersect = <T extends readonly [RawOrSchema, RawOrSchema, ...RawOrSchema[]]>(\n  ...items: T\n): IntersectSchema<NormalizeItems<T> & readonly AnySchema[]> =>\n  new IntersectSchema(normalizeToSchemas(items) as NormalizeItems<T> & readonly AnySchema[]);\nconst sLazy = <T extends AnySchema>(getter: () => T): LazySchema<InferOutput<T>, InferInput<T>, InferSchemaMode<T>> =>\n  new LazySchema(getter as unknown as () => Schema<InferOutput<T>, InferInput<T>, InferSchemaMode<T>>);\nconst sLiteral = <T extends string | number | boolean | null | undefined>(value: T): LiteralSchema<T> =>\n  new LiteralSchema(value);\nconst sMap = <K extends AnySchema, V extends AnySchema>(keySchema: K, valueSchema: V): MapSchema<K, V> =>\n  new MapSchema(keySchema, valueSchema);\nconst sNever = (): NeverSchema => new NeverSchema();\nconst sNull = (): LiteralSchema<null> => new LiteralSchema(null);\nconst sNumber = (): NumberSchema => new NumberSchema();\nconst sObject = <T extends ObjectShape>(shape: T): ObjectSchema<T> => new ObjectSchema(shape);\nconst sRecord = <K extends AnySchema, V extends AnySchema>(keySchema: K, valueSchema: V): RecordSchema<K, V> =>\n  new RecordSchema(keySchema, valueSchema);\nconst sSet = <T extends AnySchema>(schema: T): SetSchema<T> => new SetSchema(schema);\nconst sString = (): StringSchema => new StringSchema();\nconst sTuple = <const T extends TupleSchemas>(items: T): TupleSchema<T> => new TupleSchema(items);\nconst sUndefined = (): LiteralSchema<undefined> => new LiteralSchema(undefined);\nconst sUnion = <T extends readonly [RawOrSchema, RawOrSchema, ...RawOrSchema[]]>(\n  ...items: T\n): UnionSchema<NormalizeItems<T> & readonly AnySchema[]> =>\n  new UnionSchema(normalizeToSchemas(items) as NormalizeItems<T> & readonly AnySchema[]);\nconst sUnknown = (): Schema<unknown> => new Schema();\nconst sVariant = <K extends string, M extends Record<string, ObjectSchema<any, any>>>(\n  discriminator: K,\n  map: M,\n): VariantSchema<K, M> => new VariantSchema(discriminator, map);\nconst sCoerce = {\n  bigint: (): BigIntSchema<unknown> => BigIntSchema.coerce(),\n  boolean: (): BooleanSchema<unknown> => BooleanSchema.coerce(),\n  date: (): DateSchema<unknown> => DateSchema.coerce(),\n  number: (): NumberSchema<unknown> => NumberSchema.coerce(),\n  string: (): StringSchema<unknown> => StringSchema.coerce(),\n};\n\n/* -------------------- `s` namespace — the public API -------------------- */\n\n/**\n * Namespace of all schema factories. Use `s.string()`, `s.object()`, etc.\n *\n * @example\n * import { s, type Infer } from '@vielzeug/spell';\n *\n * const User = s.object({ name: s.string(), age: s.number().int().positive() });\n * type User = Infer<typeof User>;\n */\nexport const s = {\n  array: sArray,\n  bigint: sBigint,\n  boolean: sBoolean,\n  coerce: sCoerce,\n  date: sDate,\n  discriminatedUnion: sVariant,\n  enum: sEnum,\n  instanceof: sInstanceof,\n  intersect: sIntersect,\n  lazy: sLazy,\n  literal: sLiteral,\n  map: sMap,\n  never: sNever,\n  null: sNull,\n  number: sNumber,\n  object: sObject,\n  record: sRecord,\n  set: sSet,\n  string: sString,\n  tuple: sTuple,\n  undefined: sUndefined,\n  union: sUnion,\n  unknown: sUnknown,\n};\n"],"mappings":"yhCA8EA,IAAa,EAAI,CACf,MAvDmC,GAA8B,IAAI,EAAY,CAAM,EAwDvF,WAvDkC,IAAI,EAwDtC,YAvDoC,IAAI,EAwDxC,OAAQ,CAtBR,WAAqC,EAAa,OAAO,EACzD,YAAuC,EAAc,OAAO,EAC5D,SAAiC,EAAW,OAAO,EACnD,WAAqC,EAAa,OAAO,EACzD,WAAqC,EAAa,OAAO,CAkBjD,EACR,SAxD8B,IAAI,EAyDlC,oBA5BA,EACA,IACwB,IAAI,EAAc,EAAe,CAAG,EA2B5D,KAzDyC,GAA6B,IAAI,EAAW,CAAM,EA0D3F,WAzDsB,GAA0D,IAAI,EAAiB,CAAG,EA0DxG,WAxDA,GAAG,IAEH,IAAI,EAAgB,EAAmB,CAAK,CAA6C,EAuDzF,KAtDkC,GAClC,IAAI,EAAW,CAAoF,EAsDnG,QArDwE,GACxE,IAAI,EAAc,CAAK,EAqDvB,KApDsD,EAAc,IACpE,IAAI,EAAU,EAAW,CAAW,EAoDpC,UAnDgC,IAAI,EAoDpC,SAnDuC,IAAI,EAAc,IAAI,EAoD7D,WAnDkC,IAAI,EAoDtC,OAnDsC,GAA8B,IAAI,EAAa,CAAK,EAoD1F,QAnDyD,EAAc,IACvE,IAAI,EAAa,EAAW,CAAW,EAmDvC,IAlDiC,GAA4B,IAAI,EAAU,CAAM,EAmDjF,WAlDkC,IAAI,EAmDtC,MAlD4C,GAA6B,IAAI,EAAY,CAAK,EAmD9F,cAlDiD,IAAI,EAAc,IAAA,EAAS,EAmD5E,OAjDA,GAAG,IAEH,IAAI,EAAY,EAAmB,CAAK,CAA6C,EAgDrF,YA/CsC,IAAI,CAgD5C"}
+{"version":3,"file":"s.js","names":[],"sources":["../src/s.ts"],"sourcesContent":["import { type AnySchema, type InferInput, type InferOutput, Schema } from './core';\nimport { ArraySchema } from './schemas/array';\nimport { BigIntSchema } from './schemas/bigint';\nimport { BooleanSchema } from './schemas/boolean';\nimport { DateSchema } from './schemas/date';\nimport { EnumSchema, type EnumValues } from './schemas/enum';\nimport { InstanceOfSchema } from './schemas/instanceof';\nimport { IntersectSchema } from './schemas/intersect';\nimport { LazySchema } from './schemas/lazy';\nimport { LiteralSchema } from './schemas/literal';\nimport { MapSchema } from './schemas/map';\nimport { NeverSchema } from './schemas/never';\nimport { NumberSchema } from './schemas/number';\nimport { ObjectSchema, type ObjectShape } from './schemas/object';\nimport { type NormalizeItems, normalizeToSchemas, type RawOrSchema } from './schemas/raw-or';\nimport { RecordSchema } from './schemas/record';\nimport { SetSchema } from './schemas/set';\nimport { StringSchema } from './schemas/string';\nimport { TupleSchema, type TupleSchemas } from './schemas/tuple';\nimport { UnionSchema } from './schemas/union';\nimport { VariantSchema } from './schemas/variant';\n\n/* -------------------- Internal factory functions -------------------- */\n\nconst sArray = <T extends AnySchema>(schema: T): ArraySchema<T> => new ArraySchema(schema);\nconst sBigint = (): BigIntSchema => new BigIntSchema();\nconst sBoolean = (): BooleanSchema => new BooleanSchema();\nconst sDate = (): DateSchema => new DateSchema();\nconst sEnum = <const T extends EnumValues>(values: T): EnumSchema<T> => new EnumSchema(values);\nconst sInstanceof = <T>(cls: new (...args: never[]) => T): InstanceOfSchema<T> => new InstanceOfSchema(cls);\nconst sIntersect = <T extends readonly [RawOrSchema, RawOrSchema, ...RawOrSchema[]]>(\n  ...items: T\n): IntersectSchema<NormalizeItems<T> & readonly AnySchema[]> =>\n  new IntersectSchema(normalizeToSchemas(items) as NormalizeItems<T> & readonly AnySchema[]);\nconst sLazy = <T extends AnySchema>(getter: () => T): LazySchema<InferOutput<T>, InferInput<T>> =>\n  new LazySchema(getter as unknown as () => Schema<InferOutput<T>, InferInput<T>>);\nconst sLiteral = <T extends string | number | boolean | null | undefined>(value: T): LiteralSchema<T> =>\n  new LiteralSchema(value);\nconst sMap = <K extends AnySchema, V extends AnySchema>(keySchema: K, valueSchema: V): MapSchema<K, V> =>\n  new MapSchema(keySchema, valueSchema);\nconst sNever = (): NeverSchema => new NeverSchema();\nconst sNull = (): LiteralSchema<null> => new LiteralSchema(null);\nconst sNumber = (): NumberSchema => new NumberSchema();\nconst sObject = <T extends ObjectShape>(shape: T): ObjectSchema<T> => new ObjectSchema(shape);\nconst sRecord = <K extends AnySchema, V extends AnySchema>(keySchema: K, valueSchema: V): RecordSchema<K, V> =>\n  new RecordSchema(keySchema, valueSchema);\nconst sSet = <T extends AnySchema>(schema: T): SetSchema<T> => new SetSchema(schema);\nconst sString = (): StringSchema => new StringSchema();\nconst sTuple = <const T extends TupleSchemas>(items: T): TupleSchema<T> => new TupleSchema(items);\nconst sUndefined = (): LiteralSchema<undefined> => new LiteralSchema(undefined);\n// Schema-only tuples keep their concrete branch types; the second overload normalizes raw\n// literals, where intersecting with AnySchema[] costs nothing.\nfunction sUnion<T extends readonly [AnySchema, AnySchema, ...AnySchema[]]>(...items: T): UnionSchema<T>;\nfunction sUnion<T extends readonly [RawOrSchema, RawOrSchema, ...RawOrSchema[]]>(\n  ...items: T\n): UnionSchema<NormalizeItems<T> & readonly AnySchema[]>;\nfunction sUnion(this: unknown, ...items: readonly RawOrSchema[]): UnionSchema<readonly AnySchema[]> {\n  return new UnionSchema(normalizeToSchemas(items) as AnySchema[]);\n}\nconst sUnknown = (): Schema<unknown> => new Schema();\nconst sVariant = <K extends string, M extends Record<string, ObjectSchema<any>>>(\n  discriminator: K,\n  map: M,\n): VariantSchema<K, M> => new VariantSchema(discriminator, map);\nconst sCoerce = {\n  bigint: (): BigIntSchema<unknown> => BigIntSchema.coerce(),\n  boolean: (): BooleanSchema<unknown> => BooleanSchema.coerce(),\n  date: (): DateSchema<unknown> => DateSchema.coerce(),\n  number: (): NumberSchema<unknown> => NumberSchema.coerce(),\n  string: (): StringSchema<unknown> => StringSchema.coerce(),\n};\n\n/* -------------------- `s` namespace — the public API -------------------- */\n\n/**\n * Namespace of all schema factories. Use `s.string()`, `s.object()`, etc.\n *\n * @example\n * import { s, type Infer } from '@vielzeug/spell';\n *\n * const User = s.object({ name: s.string(), age: s.number().int().positive() });\n * type User = Infer<typeof User>;\n */\nexport const s = {\n  array: sArray,\n  bigint: sBigint,\n  boolean: sBoolean,\n  coerce: sCoerce,\n  date: sDate,\n  discriminatedUnion: sVariant,\n  enum: sEnum,\n  instanceof: sInstanceof,\n  intersect: sIntersect,\n  lazy: sLazy,\n  literal: sLiteral,\n  map: sMap,\n  never: sNever,\n  null: sNull,\n  number: sNumber,\n  object: sObject,\n  record: sRecord,\n  set: sSet,\n  string: sString,\n  tuple: sTuple,\n  undefined: sUndefined,\n  union: sUnion,\n  unknown: sUnknown,\n};\n"],"mappings":"yhCAwBA,IAAM,EAA+B,GAA8B,IAAI,EAAY,CAAM,EACnF,MAA8B,IAAI,EAClC,MAAgC,IAAI,EACpC,MAA0B,IAAI,EAC9B,EAAqC,GAA6B,IAAI,EAAW,CAAM,EACvF,EAAkB,GAA0D,IAAI,EAAiB,CAAG,EACpG,GACJ,GAAG,IAEH,IAAI,EAAgB,EAAmB,CAAK,CAA6C,EACrF,EAA8B,GAClC,IAAI,EAAW,CAAgE,EAC3E,EAAoE,GACxE,IAAI,EAAc,CAAK,EACnB,GAAkD,EAAc,IACpE,IAAI,EAAU,EAAW,CAAW,EAChC,MAA4B,IAAI,EAChC,MAAmC,IAAI,EAAc,IAAI,EACzD,MAA8B,IAAI,EAClC,EAAkC,GAA8B,IAAI,EAAa,CAAK,EACtF,GAAqD,EAAc,IACvE,IAAI,EAAa,EAAW,CAAW,EACnC,EAA6B,GAA4B,IAAI,EAAU,CAAM,EAC7E,MAA8B,IAAI,EAClC,EAAwC,GAA6B,IAAI,EAAY,CAAK,EAC1F,MAA6C,IAAI,EAAc,IAAA,EAAS,EAO9E,SAAS,EAAsB,GAAG,EAAkE,CAClG,OAAO,IAAI,EAAY,EAAmB,CAAK,CAAgB,CACjE,CAyBA,IAAa,EAAI,CACf,MAAO,EACP,OAAQ,EACR,QAAS,EACT,OAAQ,CAtBR,WAAqC,EAAa,OAAO,EACzD,YAAuC,EAAc,OAAO,EAC5D,SAAiC,EAAW,OAAO,EACnD,WAAqC,EAAa,OAAO,EACzD,WAAqC,EAAa,OAAO,CAkBjD,EACR,KAAM,EACN,oBA5BA,EACA,IACwB,IAAI,EAAc,EAAe,CAAG,EA2B5D,KAAM,EACN,WAAY,EACZ,UAAW,EACX,KAAM,EACN,QAAS,EACT,IAAK,EACL,MAAO,EACP,KAAM,EACN,OAAQ,EACR,OAAQ,EACR,OAAQ,EACR,IAAK,EACL,OAAQ,EACR,MAAO,EACP,UAAW,EACX,MAAO,EACP,YA/CsC,IAAI,CAgD5C"}

package/dist/schemas/array.cjs

@@ -1,2 +1,2 @@
-const e=require("../errors.cjs"),t=require("../types.cjs"),n=require("../core.cjs");var r=class extends n.Schema{itemSchema;get _kind(){return`array`}checkAsync(e){return this._addCheck(e,!0)}constructor(e){super(),this.itemSchema=e}_parseItemsSync(t,n){let r=[],i=[];for(let a=0;a<t.length;a++){let o=this.itemSchema._parseFullSync(t[a],n);o.issues.length===0?i.push(o.data):(r.push(...e.prependIssuePath(o.issues,a)),i.push(t[a]))}return{data:i,issues:r}}_parse(n,r){if(!Array.isArray(n))return{data:n,issues:e.fail(t.ErrorCode.invalid_type,r.messages.array.type()),typeOk:!1};let{data:i,issues:a}=this._parseItemsSync(n,r);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(!Array.isArray(i))throw new e.SpellValidationError(e.fail(t.ErrorCode.invalid_type,a.messages.array.type()));let o=await Promise.all(i.map(e=>this.itemSchema._parseFullAsync(e,a))),s=[],c=[];for(let t=0;t<o.length;t++){let n=o[t];n.issues.length===0?c.push(n.data):(s.push(...e.prependIssuePath(n.issues,t)),c.push(i[t]))}let l=await this._runValidatorsAsync(c,a),u=[...s,...l];if(u.length>0)throw new e.SpellValidationError(u);return this._runPostprocessors(c)})}min(n,r){return this._addConstraint((i,a)=>i.length>=n?null:e.fail(t.ErrorCode.too_small,e.resolveMessage(r??a.messages.array.min,{min:n,value:i}),{min:n}),e=>{let t=e;return{...t,minItems:t.minItems===void 0?n:Math.max(t.minItems,n)}})}max(n,r){return this._addConstraint((i,a)=>i.length<=n?null:e.fail(t.ErrorCode.too_big,e.resolveMessage(r??a.messages.array.max,{max:n,value:i}),{max:n}),e=>{let t=e;return{...t,maxItems:t.maxItems===void 0?n:Math.min(t.maxItems,n)}})}length(n,r){return this._addConstraint((i,a)=>i.length===n?null:e.fail(t.ErrorCode.invalid_length,e.resolveMessage(r??a.messages.array.length,{exact:n,value:i}),{exact:n}),e=>({...e,maxItems:n,minItems:n}))}nonEmpty(n){return this._addConstraint((r,i)=>{let a=r;return a.length>0?null:e.fail(t.ErrorCode.too_small,e.resolveMessage(n??i.messages.array.nonEmpty,{min:1,value:a}),{min:1})})}unique(n,r){let i=typeof n==`function`&&n.length===2,a=i?n:null,o=i?r:typeof n==`function`?n:void 0;return this._addConstraint((n,r)=>{let i=n,s;return s=a?i.every((e,t)=>i.slice(0,t).every(t=>!a(e,t))):new Set(i).size===i.length,s?null:e.fail(t.ErrorCode.invalid_unique,e.resolveMessage(o??r.messages.array.unique,{value:i}),{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)}};exports.ArraySchema=r;
+const e=require("../errors.cjs"),t=require("../types.cjs"),n=require("../core.cjs");var r=class extends n.Schema{itemSchema;get _kind(){return`array`}constructor(e){super(),this.itemSchema=e}_parseItemsSync(t,n){let r=[],i=[];for(let a=0;a<t.length;a++){let o=this.itemSchema._parseFullSync(t[a],n);o.issues.length===0?i.push(o.data):(r.push(...e.prependIssuePath(o.issues,a)),i.push(t[a]))}return{data:i,issues:r}}_parse(n,r){if(!Array.isArray(n))return{data:n,issues:e.fail(t.ErrorCode.invalid_type,r.messages.array.type()),typeOk:!1};let{data:i,issues:a}=this._parseItemsSync(n,r);return{data:i,issues:a,typeOk:!0}}async _parseAsync(n,r){if(!Array.isArray(n))return{data:n,issues:e.fail(t.ErrorCode.invalid_type,r.messages.array.type()),typeOk:!1};let i=await Promise.all(n.map(e=>this.itemSchema._parseFullAsync(e,r))),a=[],o=[];for(let t=0;t<i.length;t++){let r=i[t];r.issues.length===0?o.push(r.data):(a.push(...e.prependIssuePath(r.issues,t)),o.push(n[t]))}return{data:o,issues:a,typeOk:!0}}min(n,r){return this._addConstraint((i,a)=>i.length>=n?null:e.fail(t.ErrorCode.too_small,e.resolveMessage(r??a.messages.array.min,{min:n,value:i}),{min:n}),e=>{let t=e;return{...t,minItems:t.minItems===void 0?n:Math.max(t.minItems,n)}})}max(n,r){return this._addConstraint((i,a)=>i.length<=n?null:e.fail(t.ErrorCode.too_big,e.resolveMessage(r??a.messages.array.max,{max:n,value:i}),{max:n}),e=>{let t=e;return{...t,maxItems:t.maxItems===void 0?n:Math.min(t.maxItems,n)}})}length(n,r){return this._addConstraint((i,a)=>i.length===n?null:e.fail(t.ErrorCode.invalid_length,e.resolveMessage(r??a.messages.array.length,{exact:n,value:i}),{exact:n}),e=>({...e,maxItems:n,minItems:n}))}nonEmpty(n){return this._addConstraint((r,i)=>{let a=r;return a.length>0?null:e.fail(t.ErrorCode.too_small,e.resolveMessage(n??i.messages.array.nonEmpty,{min:1,value:a}),{min:1})})}unique(n,r){let i=typeof n==`function`&&n.length===2,a=i?n:null,o=i?r:typeof n==`function`?n:void 0;return this._addConstraint((n,r)=>{let i=n,s;return s=a?i.every((e,t)=>i.slice(0,t).every(t=>!a(e,t))):new Set(i).size===i.length,s?null:e.fail(t.ErrorCode.invalid_unique,e.resolveMessage(o??r.messages.array.unique,{value:i}),{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`}}};exports.ArraySchema=r;
 //# sourceMappingURL=array.cjs.map

package/dist/schemas/array.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"array.cjs","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":"oFA0BA,IAAa,EAAb,cAGU,EAAA,MAAgD,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,EAAA,iBAAiB,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,EAAA,KAAK,EAAA,UAAU,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,EAAA,SAAS,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,EAAA,qBAAqB,EAAA,KAAK,EAAA,UAAU,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,EAAA,iBAAiB,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,EAAA,qBAAqB,CAAS,EAElE,OAAO,KAAK,mBAAmB,CAAM,CACvC,CAAC,CACH,CAEA,IAAI,EAAgB,EAA8D,CAChF,OAAO,KAAK,gBACT,EAAO,IACD,EAAoB,QAAU,EAAe,KAE3C,EAAA,KACL,EAAA,UAAU,UACV,EAAA,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,EAAA,KACL,EAAA,UAAU,QACV,EAAA,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,EAAA,KACL,EAAA,UAAU,eACV,EAAA,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,EAAA,KAAK,EAAA,UAAU,UAAW,EAAA,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,EAAA,KACL,EAAA,UAAU,eACV,EAAA,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.cjs","names":[],"sources":["../../src/schemas/array.ts"],"sourcesContent":["import type {\n  AnySchema,\n  InferInput,\n  InferOutput,\n  Issue,\n  MessageFn,\n  ParseContext,\n  ParseValue,\n  SchemaDescriptor,\n} from '../core';\n\nimport { ErrorCode, fail, prependIssuePath, resolveMessage, Schema } from '../core';\n\n/* -------------------- Typed annotations -------------------- */\n\ninterface ArrayAnnotations extends Record<string, unknown> {\n  maxItems?: number;\n  minItems?: number;\n}\n\nexport class ArraySchema<T extends AnySchema> extends Schema<InferOutput<T>[], InferInput<T>[]> {\n  readonly itemSchema: T;\n\n  protected override get _kind(): string {\n    return 'array';\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  protected override async _parseAsync(value: unknown, ctx: ParseContext): Promise<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 settled = await Promise.all(value.map((item) => this.itemSchema._parseFullAsync(item, ctx)));\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(value[i] as InferOutput<T>);\n      }\n    }\n\n    return { data: parsed, issues, typeOk: true };\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"],"mappings":"oFAoBA,IAAa,EAAb,cAAsD,EAAA,MAA0C,CAC9F,WAEA,IAAuB,OAAgB,CACrC,MAAO,OACT,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,EAAA,iBAAiB,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,EAAA,KAAK,EAAA,UAAU,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,MAAyB,YAAY,EAAgB,EAAwC,CAC3F,GAAI,CAAC,MAAM,QAAQ,CAAK,EACtB,MAAO,CAAE,KAAM,EAAO,OAAQ,EAAA,KAAK,EAAA,UAAU,aAAc,EAAI,SAAS,MAAM,KAAK,CAAC,EAAG,OAAQ,EAAM,EAGvG,IAAM,EAAU,MAAM,QAAQ,IAAI,EAAM,IAAK,GAAS,KAAK,WAAW,gBAAgB,EAAM,CAAG,CAAC,CAAC,EAE3F,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,EAAA,iBAAiB,EAAO,OAAQ,CAAC,CAAC,EACjD,EAAO,KAAK,EAAM,EAAoB,EAE1C,CAEA,MAAO,CAAE,KAAM,EAAQ,SAAQ,OAAQ,EAAK,CAC9C,CAEA,IAAI,EAAgB,EAA8D,CAChF,OAAO,KAAK,gBACT,EAAO,IACD,EAAoB,QAAU,EAAe,KAE3C,EAAA,KACL,EAAA,UAAU,UACV,EAAA,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,EAAA,KACL,EAAA,UAAU,QACV,EAAA,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,EAAA,KACL,EAAA,UAAU,eACV,EAAA,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,EAAA,KAAK,EAAA,UAAU,UAAW,EAAA,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,EAAA,KACL,EAAA,UAAU,eACV,EAAA,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,CACF"}

package/dist/schemas/array.d.ts

@@ -1,13 +1,12 @@
-import type { AnySchema, CheckContext, InferInput, InferOutput, InferSchemaMode, MergeSchemaModes, MessageFn, ParseContext, ParseValue, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';
+import type { AnySchema, InferInput, InferOutput, MessageFn, ParseContext, ParseValue, SchemaDescriptor } from '../core';
 import { Schema } from '../core';
-export declare class ArraySchema<T extends AnySchema, Mode extends SchemaMode = MergeSchemaModes<InferSchemaMode<T>>> extends Schema<InferOutput<T>[], InferInput<T>[], Mode> {
+export declare class ArraySchema<T extends AnySchema> extends Schema<InferOutput<T>[], InferInput<T>[]> {
     readonly itemSchema: T;
     protected get _kind(): string;
-    checkAsync(this: ArraySchema<T, 'sync'>, fn: (value: InferOutput<T>[], ctx: CheckContext) => Promise<ValidateResult>): ArraySchema<T, 'async'>;
     constructor(itemSchema: T);
     private _parseItemsSync;
     protected _parse(value: unknown, ctx: ParseContext): ParseValue;
-    parseAsync(value: unknown, ctx?: ParseContext): Promise<InferOutput<T>[]>;
+    protected _parseAsync(value: unknown, ctx: ParseContext): Promise<ParseValue>;
     min(length: number, message?: MessageFn<{
         min: number;
         value: unknown[];
@@ -44,6 +43,5 @@ export declare class ArraySchema<T extends AnySchema, Mode extends SchemaMode =
         value: unknown[];
     }>): this;
     protected _toDescriptorImpl(): SchemaDescriptor;
-    protected _walk<R>(visitor: SchemaWalker<R>): R | null;
 }
 //# sourceMappingURL=array.d.ts.map

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,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"}
+{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../src/schemas/array.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,SAAS,EACT,UAAU,EACV,WAAW,EAEX,SAAS,EACT,YAAY,EACZ,UAAU,EACV,gBAAgB,EACjB,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAqD,MAAM,EAAE,MAAM,SAAS,CAAC;AASpF,qBAAa,WAAW,CAAC,CAAC,SAAS,SAAS,CAAE,SAAQ,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;IAC7F,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC;IAEvB,cAAuB,KAAK,IAAI,MAAM,CAErC;gBAEW,UAAU,EAAE,CAAC;IAKzB,OAAO,CAAC,eAAe;cAkBJ,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,YAAY,GAAG,UAAU;cAU/C,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,YAAY,GAAG,OAAO,CAAC,UAAU,CAAC;IAwB5F,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;CAWzD"}

package/dist/schemas/array.js

@@ -1,2 +1,2 @@
-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};
+import{fail as e,prependIssuePath as t,resolveMessage as n}from"../errors.js";import{ErrorCode as r}from"../types.js";import{Schema as i}from"../core.js";var a=class extends i{itemSchema;get _kind(){return`array`}constructor(e){super(),this.itemSchema=e}_parseItemsSync(e,n){let r=[],i=[];for(let a=0;a<e.length;a++){let o=this.itemSchema._parseFullSync(e[a],n);o.issues.length===0?i.push(o.data):(r.push(...t(o.issues,a)),i.push(e[a]))}return{data:i,issues:r}}_parse(t,n){if(!Array.isArray(t))return{data:t,issues:e(r.invalid_type,n.messages.array.type()),typeOk:!1};let{data:i,issues:a}=this._parseItemsSync(t,n);return{data:i,issues:a,typeOk:!0}}async _parseAsync(n,i){if(!Array.isArray(n))return{data:n,issues:e(r.invalid_type,i.messages.array.type()),typeOk:!1};let a=await Promise.all(n.map(e=>this.itemSchema._parseFullAsync(e,i))),o=[],s=[];for(let e=0;e<a.length;e++){let r=a[e];r.issues.length===0?s.push(r.data):(o.push(...t(r.issues,e)),s.push(n[e]))}return{data:s,issues:o,typeOk:!0}}min(t,i){return this._addConstraint((a,o)=>a.length>=t?null:e(r.too_small,n(i??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,i){return this._addConstraint((a,o)=>a.length<=t?null:e(r.too_big,n(i??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,i){return this._addConstraint((a,o)=>a.length===t?null:e(r.invalid_length,n(i??o.messages.array.length,{exact:t,value:a}),{exact:t}),e=>({...e,maxItems:t,minItems:t}))}nonEmpty(t){return this._addConstraint((i,a)=>{let o=i;return o.length>0?null:e(r.too_small,n(t??a.messages.array.nonEmpty,{min:1,value:o}),{min:1})})}unique(t,i){let a=typeof t==`function`&&t.length===2,o=a?t:null,s=a?i:typeof t==`function`?t:void 0;return this._addConstraint((t,i)=>{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:e(r.invalid_unique,n(s??i.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`}}};export{a 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  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"}
+{"version":3,"file":"array.js","names":[],"sources":["../../src/schemas/array.ts"],"sourcesContent":["import type {\n  AnySchema,\n  InferInput,\n  InferOutput,\n  Issue,\n  MessageFn,\n  ParseContext,\n  ParseValue,\n  SchemaDescriptor,\n} from '../core';\n\nimport { ErrorCode, fail, prependIssuePath, resolveMessage, Schema } from '../core';\n\n/* -------------------- Typed annotations -------------------- */\n\ninterface ArrayAnnotations extends Record<string, unknown> {\n  maxItems?: number;\n  minItems?: number;\n}\n\nexport class ArraySchema<T extends AnySchema> extends Schema<InferOutput<T>[], InferInput<T>[]> {\n  readonly itemSchema: T;\n\n  protected override get _kind(): string {\n    return 'array';\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  protected override async _parseAsync(value: unknown, ctx: ParseContext): Promise<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 settled = await Promise.all(value.map((item) => this.itemSchema._parseFullAsync(item, ctx)));\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(value[i] as InferOutput<T>);\n      }\n    }\n\n    return { data: parsed, issues, typeOk: true };\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"],"mappings":"0JAoBA,IAAa,EAAb,cAAsD,CAA0C,CAC9F,WAEA,IAAuB,OAAgB,CACrC,MAAO,OACT,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,MAAyB,YAAY,EAAgB,EAAwC,CAC3F,GAAI,CAAC,MAAM,QAAQ,CAAK,EACtB,MAAO,CAAE,KAAM,EAAO,OAAQ,EAAK,EAAU,aAAc,EAAI,SAAS,MAAM,KAAK,CAAC,EAAG,OAAQ,EAAM,EAGvG,IAAM,EAAU,MAAM,QAAQ,IAAI,EAAM,IAAK,GAAS,KAAK,WAAW,gBAAgB,EAAM,CAAG,CAAC,CAAC,EAE3F,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,EAAM,EAAoB,EAE1C,CAEA,MAAO,CAAE,KAAM,EAAQ,SAAQ,OAAQ,EAAK,CAC9C,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,CACF"}

package/dist/schemas/bigint.cjs

@@ -1,2 +1,2 @@
-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;
+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`}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})})}_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  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"}
+{"version":3,"file":"bigint.cjs","names":[],"sources":["../../src/schemas/bigint.ts"],"sourcesContent":["import { warn } from '../_dev';\nimport type { MessageFn, SchemaDescriptor } from '../core';\nimport { ErrorCode, fail, resolveMessage, Schema } from '../core';\n\nexport class BigIntSchema<Input = bigint> extends Schema<bigint, Input> {\n  protected override get _kind(): string {\n    return 'bigint';\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 _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,UAAqC,EAAA,MAAsB,CACtE,IAAuB,OAAgB,CACrC,MAAO,QACT,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,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

@@ -1,8 +1,7 @@
-import type { CheckContext, MessageFn, SchemaDescriptor, SchemaMode, SchemaWalker, ValidateResult } from '../core';
+import type { MessageFn, SchemaDescriptor } from '../core';
 import { Schema } from '../core';
-export declare class BigIntSchema<Input = bigint, Mode extends SchemaMode = 'sync'> extends Schema<bigint, Input, Mode> {
+export declare class BigIntSchema<Input = bigint> extends Schema<bigint, Input> {
     protected get _kind(): string;
-    checkAsync(this: BigIntSchema<Input, 'sync'>, fn: (value: bigint, ctx: CheckContext) => Promise<ValidateResult>): BigIntSchema<Input, 'async'>;
     constructor();
     min(minimum: bigint, message?: MessageFn<{
         min: bigint;
@@ -28,7 +27,6 @@ export declare class BigIntSchema<Input = bigint, Mode extends SchemaMode = 'syn
         step: bigint;
         value: bigint;
     }>): this;
-    protected _walk<R>(visitor: SchemaWalker<R>): R | null;
     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;cAM5C,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,SAAS,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC3D,OAAO,EAAmC,MAAM,EAAE,MAAM,SAAS,CAAC;AAElE,qBAAa,YAAY,CAAC,KAAK,GAAG,MAAM,CAAE,SAAQ,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC;IACrE,cAAuB,KAAK,IAAI,MAAM,CAErC;;IAQD,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,iBAAiB,IAAI,gBAAgB;IAWxD,MAAM,CAAC,MAAM,IAAI,YAAY,CAAC,OAAO,CAAC;CA8BvC"}

package/dist/schemas/bigint.js

@@ -1,2 +1,2 @@
-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};
+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`}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})})}_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