ata-validator 1.60.0 → 1.61.0

package/lib/bun-target.js

@@ -0,0 +1,612 @@
+'use strict'
+// `ata build --target bun`: the schema as a TypeScript type, written beside
+// the plain module for executables built with `bun build --compile --aot`.
+//
+// The type carries the shape of the schema (the JSON kind, properties and
+// which are required, items and fixed tuples, literals, local definitions as
+// named types) and nothing a TypeScript type cannot say. The module written
+// with it answers every check through the plain module, so the answers and
+// the errors are the module's; the type is for the program that imports it.
+// `parse(text)` declares the type where it parses (`const d: T =
+// JSON.parse(text)`), the form the compiler's documentation gives for a parse
+// that makes objects with the layout of `T`; measured on the pull request
+// build of 2026-10-25, that changed nothing on a ten-item order (parse 564 to
+// 574 ns against 570 to 578 for a plain parse and the module, reading the
+// object after it 593 to 595 against 587 to 591), so the file is a type for
+// the program and nothing faster.
+//
+// With `tags: true`, the type is written with Bun's `Schema` tags
+// (`Schema.Int`, `Schema.MinLength<n>`, `Schema.Strict`, ...) and the schema
+// is split exactly in two: the keywords the tagged type carries, and a
+// residual schema with every other keyword, kept inside the structure needed
+// to reach it, for a checker that reads the tags. Bun's `validate<T>` and
+// `JSON.parse<T>` did that in the compiler's pull request until 2026-10-25,
+// when they left it to return as a change of their own; nothing in ata
+// writes the tagged form until then. The split keeps the groups that see
+// each other whole in the residual: `if`/`then`/`else`; `unevaluatedProperties`
+// and `unevaluatedItems` with every sibling of theirs; `additionalProperties`
+// with `patternProperties`; the `contains` family; `anyOf` whenever one
+// branch has a residual, since a document may satisfy one branch's type and
+// another's residual and neither branch.
+//
+// A type is built as six sets, one per JSON kind, each a list of alternatives
+// of that kind. A union adds the lists; an intersection pairs them kind by
+// kind, so `{ foo: string } & unknown[]` is never written: an object rule and
+// an array rule meet in no value.
+
+// Annotations: no effect on a verdict, carried by nothing here.
+const IGNORED = new Set([
+  '$schema', '$id', '$comment', '$anchor', '$vocabulary', 'title', 'description',
+  'examples', 'default', 'deprecated', 'readOnly', 'writeOnly', '$defs', 'definitions',
+  'contentMediaType', 'contentEncoding', 'contentSchema'
+])
+const STRING_KEYS = ['minLength', 'maxLength', 'pattern']
+const NUMBER_KEYS = ['minimum', 'maximum', 'exclusiveMinimum', 'exclusiveMaximum', 'multipleOf']
+const OBJECT_KEYS = ['properties', 'required', 'additionalProperties']
+const ARRAY_KEYS = ['items', 'prefixItems', 'minItems', 'maxItems']
+const CONSTRAINT_KEYS = [...STRING_KEYS, ...NUMBER_KEYS, ...OBJECT_KEYS, ...ARRAY_KEYS]
+// Keywords the type reads. Everything else at a node goes to the residual.
+const TYPED = new Set(['type', 'enum', 'const', 'anyOf', 'allOf', '$ref', ...CONSTRAINT_KEYS])
+// Keywords that take the whole node with them.
+const WHOLE_NODE = new Set(['unevaluatedProperties', 'unevaluatedItems', '$dynamicRef', '$dynamicAnchor', '$recursiveRef', '$recursiveAnchor'])
+const KINDS = ['string', 'number', 'boolean', 'null', 'object', 'array']
+// Formats ata decides with one regular expression and nothing else: the type
+// carries them as that expression, so Bun's check and ata's are the same
+// test. The others (email, date-time, uri, hostname, ipv6, uuid, date, time)
+// are hand-written passes and stay in the residual.
+function formatPattern (name) {
+  const f = require('./formats')
+  if (name === 'ipv4') return f.IPV4.source
+  if (name === 'duration') return f.DURATION_RE ? f.DURATION_RE.source : null
+  return null
+}
+const UNIVERSAL = { string: 'string', number: 'number', boolean: 'boolean', null: 'null', object: 'Record<string, unknown>', array: 'unknown[]' }
+
+class Declined extends Error {
+  constructor (reason, pointer) {
+    super(`${reason} at ${pointer}`)
+    this.reason = reason
+    this.pointer = pointer
+  }
+}
+
+function fail (reason, ptr) { throw new Declined(reason, ptr) }
+
+// The six sets. `alias` is a named type standing for a whole definition; it
+// joins a union as a name and declines an intersection, whose members it
+// would have to be distributed over.
+function empty () { return { string: [], number: [], boolean: [], null: [], object: [], array: [], alias: [] } }
+function universal () { const t = empty(); for (const k of KINDS) t[k].push(UNIVERSAL[k]); return t }
+function single (kind, alt) { const t = empty(); t[kind].push(alt); return t }
+function union (a, b) { const t = empty(); for (const k of [...KINDS, 'alias']) t[k] = dedupe([...a[k], ...b[k]]); return t }
+function dedupe (xs) { return xs.filter((x, i) => xs.indexOf(x) === i) }
+function isUniversal (t) { return t.alias.length === 0 && KINDS.every((k) => t[k].length === 1 && t[k][0] === UNIVERSAL[k]) }
+
+// Intersection, or null where the two cannot be written as one type; the
+// caller then keeps one side in the residual.
+function intersect (a, b) {
+  if (a.alias.length || b.alias.length) return null
+  const t = empty()
+  for (const k of KINDS) {
+    for (const x of a[k]) {
+      for (const y of b[k]) {
+        const z = meet(k, x, y)
+        if (z === undefined) return null
+        if (z !== null) t[k].push(z)
+      }
+    }
+    t[k] = dedupe(t[k])
+  }
+  return t
+}
+
+// Two alternatives of one kind: the alternative for both, null when no value
+// satisfies both, undefined when the pair cannot be written.
+function meet (kind, x, y) {
+  if (x === UNIVERSAL[kind]) return y
+  if (y === UNIVERSAL[kind]) return x
+  if (x === y) return x
+  const xl = isLiteral(x), yl = isLiteral(y)
+  if (xl && yl) return null
+  if (xl || yl) return undefined
+  switch (kind) {
+    case 'string': return `${x} & ${y.replace(/^string & /, '')}`
+    case 'number': return `${x} & ${y.replace(/^number & /, '')}`
+    case 'object':
+      // Strict on one member of an intersection would have to see the
+      // others' properties; whether Bun does is not pinned down.
+      if (/Schema\.Strict\b/.test(x) || /Schema\.Strict\b/.test(y)) return undefined
+      return `${x} & ${y}`
+    default: return undefined
+  }
+}
+
+// Whether an element type needs parentheses before `[]`: a union, an
+// intersection or an `&` tag at its top level. An object literal, a tuple, a
+// name or a literal does not.
+function needsParens (t) {
+  let depth = 0
+  let q = null
+  for (let i = 0; i < t.length; i++) {
+    const c = t[i]
+    if (q) { if (c === '\\') i++; else if (c === q) q = null; continue }
+    if (c === '"' || c === "'") q = c
+    else if (c === '{' || c === '[' || c === '<' || c === '(') depth++
+    else if (c === '}' || c === ']' || c === '>' || c === ')') depth--
+    else if (depth === 0 && (c === '|' || c === '&')) return true
+  }
+  return false
+}
+
+function isLiteral (alt) { return /^(".*"|-?[0-9.eE+-]+|true|false|null)$/.test(alt) }
+
+function render (t) {
+  const alts = [...KINDS.flatMap((k) => t[k]), ...t.alias]
+  if (alts.length === 0) return 'never'
+  if (isUniversal(t)) return 'unknown'
+  if (alts.length === 1) return alts[0]
+  return alts.map((a) => /[&|]/.test(a) ? `(${a})` : a).join(' | ')
+}
+
+function literalOf (v) {
+  if (typeof v === 'string') return single('string', JSON.stringify(v))
+  if (typeof v === 'number' && Number.isFinite(v)) return single('number', String(v))
+  if (typeof v === 'boolean') return single('boolean', String(v))
+  if (v === null) return single('null', 'null')
+  return null
+}
+
+function finite (v) { return typeof v === 'number' && Number.isFinite(v) }
+
+// Bun's Pattern runs the expression without the unicode flag; JSON Schema's
+// patterns are read with it. The two agree on what they accept unless an atom
+// that can match half of a surrogate pair is counted: `^.{2}$` accepts one
+// astral character without the flag and refuses it with it. The expressions
+// carried are the ones where no such atom is counted: ASCII only, no escapes
+// whose meaning depends on the flag, and `.`, a negated class, `\W`, `\S`
+// and `\D` only under a greedy `+` or `*`. Returns null when the pattern is
+// carried, else what rules it out.
+function patternDiffers (p) {
+  if (!/^[\x20-\x7e]*$/.test(p)) return 'with a character outside ASCII'
+  for (let i = 0; i < p.length; i++) {
+    const c = p[i]
+    if (c === '\\') {
+      const n = p[i + 1]
+      if (n === undefined) return 'ending in a backslash'
+      if ('pPuxbBk'.includes(n)) return `with \\${n}`
+      if ('WSD'.includes(n) && !greedyUnbounded(p, i + 2)) return `with \\${n} outside a greedy + or *`
+      i++
+      continue
+    }
+    if (c === '.') { if (!greedyUnbounded(p, i + 1)) return 'with . outside a greedy + or *'; continue }
+    if (c === '[') {
+      const negated = p[i + 1] === '^'
+      let j = i + 1 + (negated ? 1 : 0)
+      if (p[j] === ']') j++
+      for (; j < p.length && p[j] !== ']'; j++) {
+        if (p[j] === '\\') {
+          const n = p[j + 1]
+          if ('pPuxWSDkbB'.includes(n || '')) return `with \\${n} in a class`
+          j++
+        }
+      }
+      if (j >= p.length) return 'with an unclosed class'
+      if (negated && !greedyUnbounded(p, j + 1)) return 'with a negated class outside a greedy + or *'
+      i = j
+    }
+  }
+  return null
+}
+function greedyUnbounded (p, i) { return (p[i] === '+' || p[i] === '*') && p[i + 1] !== '?' }
+
+// Names a definition must not take: they would shadow what the generated
+// file refers to.
+const RESERVED = new Set(['Schema', 'Record', 'Array', 'ReadonlyArray', 'Partial', 'Readonly', 'Pick', 'Omit', 'Required', 'Promise', 'Date', 'Object', 'String', 'Number', 'Boolean', 'Function', 'Symbol', 'JSON', 'Bun', 'ReturnType'])
+
+// `name` must be an identifier TypeScript accepts.
+function typeName (key, taken) {
+  let base = key.replace(/[^A-Za-z0-9_$]/g, '_').replace(/^([0-9])/, '_$1') || 'Def'
+  base = base.replace(/^([a-z])/, (m) => m.toUpperCase())
+  if (RESERVED.has(base)) base += '_'
+  let name = base
+  for (let i = 2; taken.has(name); i++) name = base + i
+  taken.add(name)
+  return name
+}
+
+function isSchema (s) { return s === true || s === false || (typeof s === 'object' && s !== null && !Array.isArray(s)) }
+
+// The type and the residual for `schema`. Returns { name, type, aliases,
+// residual, carried }: `type` the source of the root type, `aliases` the
+// [name, source] definitions it refers to, `residual` the schema of what the
+// type does not check (null when the type checks everything), `carried` the
+// keywords the type took, by pointer. `opts.aliasPrefix` goes in front of
+// every definition's name, for a file that holds several schemas. Throws
+// Declined for a schema the split cannot be made for.
+function schemaToBunType (root, opts = {}) {
+  const taken = new Set()
+  const name = typeName(opts.name || 'Data', taken)
+  // Whether formats are asserted, as a Validator does by default; a build
+  // that treats them as annotations (the official suite's reading) keeps
+  // every format out of the type.
+  const assertFormat = opts.assertFormat !== false
+  // Whether the type carries rules as Bun's `Schema` tags, with the residual
+  // split. Without them the type says the shape only and `residual` is null:
+  // the plain module checks everything.
+  const tags = opts.tags === true
+  function tag (t, s, ptr) { if (!tags) return t; carried.push(ptr); return `${t} & Schema.${s}` }
+  const aliases = []
+  const aliasByPointer = new Map()
+  const defResiduals = new Map() // pointer -> residual schema or null
+  const carried = []
+  let depth = 0
+  // Whether a definition still being built, or the root, has a residual is
+  // not known while a reference to it is met. The reference is first taken as
+  // having none; when the definition turns out to have one, it is built a
+  // second time with the reference kept, so that a cycle through a residual
+  // stays a cycle.
+  let rootHasResidual = false
+  let rootRefSeen = false
+  // In draft-07 and before, keywords beside $ref are ignored.
+  const refOverrides = typeof root.$schema === 'string' && /draft-0[467]\b/.test(root.$schema)
+  const restKey = (key) => `__rest__${key}`
+
+  function resolveRef (ref, ptr) {
+    if (ref === '#') return { pointer: '#', schema: root, key: 'Root' }
+    const m = /^#\/(\$defs|definitions)\/([^/]+)$/.exec(ref)
+    if (!m) return fail(`$ref ${JSON.stringify(ref)} is not a local definition`, ptr)
+    const key = decodeURIComponent(m[2].replace(/~1/g, '/').replace(/~0/g, '~'))
+    const defs = root[m[1]]
+    if (!defs || typeof defs !== 'object' || !Object.prototype.hasOwnProperty.call(defs, key)) return fail(`$ref ${JSON.stringify(ref)} does not resolve`, ptr)
+    return { pointer: `#/${m[1]}/${m[2]}`, schema: defs[key], key }
+  }
+
+  // The alias for a definition; its type and residual are built once.
+  function alias (target) {
+    if (aliasByPointer.has(target.pointer)) return aliasByPointer.get(target.pointer)
+    const n = target.pointer === '#' ? name : typeName((opts.aliasPrefix || '') + target.key, taken)
+    aliasByPointer.set(target.pointer, n)
+    if (target.pointer !== '#') {
+      defResiduals.set(target.pointer, null)
+      const r = conv(target.schema, target.pointer)
+      aliases.push([n, render(r.t)])
+      if (r.res !== null) {
+        defResiduals.set(target.pointer, r.res)
+        defResiduals.set(target.pointer, conv(target.schema, target.pointer).res)
+      }
+    }
+    return n
+  }
+
+  function stringAlt (s, ptr, res) {
+    let t = 'string'
+    if (tags && typeof s.format === 'string' && assertFormat) {
+      const src = formatPattern(s.format)
+      if (src !== null && patternDiffers(src) === null) { t = tag(t, `Pattern<${JSON.stringify(src)}>`, `${ptr}/format`); delete res.format }
+    }
+    if (s.minLength !== undefined && finite(s.minLength)) t = tag(t, `MinLength<${s.minLength}>`, `${ptr}/minLength`); else if (s.minLength !== undefined) res.minLength = s.minLength
+    if (s.maxLength !== undefined && finite(s.maxLength)) t = tag(t, `MaxLength<${s.maxLength}>`, `${ptr}/maxLength`); else if (s.maxLength !== undefined) res.maxLength = s.maxLength
+    if (s.pattern !== undefined) {
+      if (typeof s.pattern === 'string' && patternDiffers(s.pattern) === null) t = tag(t, `Pattern<${JSON.stringify(s.pattern)}>`, `${ptr}/pattern`); else res.pattern = s.pattern
+    }
+    return t
+  }
+
+  function numberAlt (s, ptr, res, integer) {
+    let t = integer ? tag('number', 'Int', `${ptr}/type`) : 'number'
+    if (s.minimum !== undefined && finite(s.minimum)) t = tag(t, `Min<${s.minimum}>`, `${ptr}/minimum`); else if (s.minimum !== undefined) res.minimum = s.minimum
+    if (s.maximum !== undefined && finite(s.maximum)) t = tag(t, `Max<${s.maximum}>`, `${ptr}/maximum`); else if (s.maximum !== undefined) res.maximum = s.maximum
+    // The draft-04 boolean forms, and anything else odd, stay in the residual.
+    if (s.exclusiveMinimum !== undefined && finite(s.exclusiveMinimum)) t = tag(t, `Above<${s.exclusiveMinimum}>`, `${ptr}/exclusiveMinimum`); else if (s.exclusiveMinimum !== undefined) res.exclusiveMinimum = s.exclusiveMinimum
+    if (s.exclusiveMaximum !== undefined && finite(s.exclusiveMaximum)) t = tag(t, `Below<${s.exclusiveMaximum}>`, `${ptr}/exclusiveMaximum`); else if (s.exclusiveMaximum !== undefined) res.exclusiveMaximum = s.exclusiveMaximum
+    // Floating-point multiples are decided differently by every engine.
+    if (s.multipleOf !== undefined && Number.isInteger(s.multipleOf) && s.multipleOf >= 1) t = tag(t, `MultipleOf<${s.multipleOf}>`, `${ptr}/multipleOf`); else if (s.multipleOf !== undefined) res.multipleOf = s.multipleOf
+    return t
+  }
+
+  // The object alternative. Property subschemas' residuals go under
+  // res.properties; when additionalProperties cannot be carried it goes to the
+  // residual with every declared property name, since it applies to the keys
+  // not among them.
+  function objectAlt (s, ptr, res, keys) {
+    const props = s.properties
+    const required = s.required
+    const propsOk = props === undefined || (typeof props === 'object' && props !== null && !Array.isArray(props))
+    const reqOk = required === undefined || (Array.isArray(required) && required.every((k) => typeof k === 'string'))
+    if (!propsOk || !reqOk) {
+      if (props !== undefined) res.properties = props
+      if (required !== undefined) res.required = required
+      if (s.additionalProperties !== undefined) res.additionalProperties = s.additionalProperties
+      return UNIVERSAL.object
+    }
+    const names = props ? Object.keys(props) : []
+    if (names.includes('__proto__')) return fail('a property named __proto__ is not carried', `${ptr}/properties`)
+    const req = new Set(required || [])
+    const members = []
+    const propRes = {}
+    for (const k of names) {
+      const r = conv(props[k], `${ptr}/properties/${k}`)
+      members.push(`${JSON.stringify(k)}${req.has(k) ? '' : '?'}: ${render(r.t)}`)
+      if (r.res !== null) propRes[k] = r.res
+    }
+    for (const k of req) if (!names.includes(k)) members.push(`${JSON.stringify(k)}: unknown`)
+    if (props !== undefined) carried.push(`${ptr}/properties`)
+    if (required !== undefined) carried.push(`${ptr}/required`)
+    const ap = s.additionalProperties
+    const apCarried = ap === undefined || ap === true || (ap === false && !keys.includes('patternProperties'))
+    let t = members.length ? `{ ${members.join('; ')} }` : UNIVERSAL.object
+    if (apCarried) {
+      if (ap === false && tags) t = tag(members.length ? t : '{}', 'Strict', `${ptr}/additionalProperties`)
+      if (Object.keys(propRes).length) res.properties = propRes
+    } else {
+      // The residual needs the declared names to know which keys are additional.
+      res.additionalProperties = ap
+      const all = {}
+      for (const k of names) all[k] = Object.prototype.hasOwnProperty.call(propRes, k) ? propRes[k] : true
+      if (names.length) res.properties = all
+    }
+    return t
+  }
+
+  function arrayAlt (s, ptr, res) {
+    let t
+    if (Array.isArray(s.items)) {
+      // The draft-07 tuple form; its keywords stay together in the residual.
+      for (const k of [...ARRAY_KEYS, 'additionalItems']) if (s[k] !== undefined) res[k] = s[k]
+      return UNIVERSAL.array
+    }
+    if (s.prefixItems !== undefined) {
+      // Bun checks a tuple of fixed length only; the schema allows a shorter
+      // array unless minItems says otherwise, and a longer one unless items is
+      // false. The tuple is carried when both agree with it; otherwise the
+      // array keywords stay together in the residual.
+      const fixed = Array.isArray(s.prefixItems) && s.items === false && s.minItems === s.prefixItems.length && (s.maxItems === undefined || s.maxItems >= s.prefixItems.length)
+      if (!fixed) {
+        for (const k of ARRAY_KEYS) if (s[k] !== undefined) res[k] = s[k]
+        return UNIVERSAL.array
+      }
+      const parts = []
+      const prefRes = []
+      let anyRes = false
+      s.prefixItems.forEach((p, i) => { const r = conv(p, `${ptr}/prefixItems/${i}`); parts.push(render(r.t)); prefRes.push(r.res === null ? true : r.res); if (r.res !== null) anyRes = true })
+      if (anyRes) res.prefixItems = prefRes
+      carried.push(`${ptr}/prefixItems`, `${ptr}/items`, `${ptr}/minItems`)
+      if (s.maxItems !== undefined) carried.push(`${ptr}/maxItems`)
+      return `[${parts.join(', ')}]`
+    }
+    if (s.items === undefined || s.items === true) t = UNIVERSAL.array
+    else if (s.items === false) { t = '[]'; carried.push(`${ptr}/items`) } else {
+      const r = conv(s.items, `${ptr}/items`)
+      const it = render(r.t)
+      t = needsParens(it) ? `(${it})[]` : `${it}[]`
+      if (r.res !== null) res.items = r.res
+      carried.push(`${ptr}/items`)
+    }
+    if (s.minItems !== undefined && finite(s.minItems)) t = tag(t, `MinItems<${s.minItems}>`, `${ptr}/minItems`); else if (s.minItems !== undefined) res.minItems = s.minItems
+    if (s.maxItems !== undefined && finite(s.maxItems)) t = tag(t, `MaxItems<${s.maxItems}>`, `${ptr}/maxItems`); else if (s.maxItems !== undefined) res.maxItems = s.maxItems
+    return t
+  }
+
+  function hasAny (s, keys) { return keys.some((k) => s[k] !== undefined) }
+  function keysOf (kind) { return kind === 'string' ? STRING_KEYS : kind === 'number' || kind === 'integer' ? NUMBER_KEYS : kind === 'object' ? OBJECT_KEYS : kind === 'array' ? ARRAY_KEYS : [] }
+
+  // The alternatives for one named kind, with the rules of that kind.
+  function kindAlt (kind, s, ptr, res, keys) {
+    switch (kind) {
+      case 'string': return single('string', stringAlt(s, ptr, res))
+      case 'number': return single('number', numberAlt(s, ptr, res, false))
+      case 'integer': return single('number', numberAlt(s, ptr, res, true))
+      case 'boolean': return single('boolean', 'boolean')
+      case 'null': return single('null', 'null')
+      case 'object': return single('object', objectAlt(s, ptr, res, keys))
+      case 'array': return single('array', arrayAlt(s, ptr, res))
+      default: return null
+    }
+  }
+
+  // Everything at this node into the residual, the type `unknown`.
+  function whole (s) { const res = {}; for (const k of Object.keys(s)) if (!IGNORED.has(k)) res[k] = s[k]; return { t: universal(), res: Object.keys(res).length ? res : null } }
+
+  function conv (s, ptr) {
+    if (s === true) return { t: universal(), res: null }
+    if (s === false) return { t: empty(), res: null }
+    if (!isSchema(s)) return fail('a schema must be an object or a boolean', ptr)
+    if (++depth > 200) return fail('the schema nests too deep', ptr)
+    try {
+      const keys = Object.keys(s).filter((k) => !IGNORED.has(k))
+      if (keys.length === 0) return { t: universal(), res: null }
+      for (const k of keys) if (WHOLE_NODE.has(k)) return k.startsWith('$') ? fail(`keyword ${JSON.stringify(k)} is not carried`, ptr) : whole(s)
+      const res = {}
+      for (const k of keys) if (!TYPED.has(k)) res[k] = s[k]
+      let t = universal()
+
+      if (s.$ref !== undefined) {
+        if (typeof s.$ref !== 'string') return fail('$ref must be a string', ptr)
+        const target = resolveRef(s.$ref, ptr)
+        const n = alias(target)
+        const aliasT = empty(); aliasT.alias.push(n)
+        carried.push(`${ptr}/$ref`)
+        if (target.pointer === '#') rootRefSeen = true
+        const defRes = target.pointer === '#' ? (rootHasResidual ? { $ref: '#' } : null) : defResiduals.get(target.pointer)
+        // The residual's reference goes to the definition's residual, kept
+        // under its own name beside the original definitions.
+        if (defRes !== null && defRes !== undefined) res.$ref = target.pointer === '#' ? '#' : `#/${target.pointer.split('/')[1]}/${restKey(target.key)}`
+        if (refOverrides) { for (const k of keys) if (k !== '$ref') delete res[k] }
+        if (keys.length === 1 || refOverrides) return { t: aliasT, res: Object.keys(res).length ? res : null }
+        // Siblings beside $ref are conjunctive. The alias cannot be
+        // intersected, so the siblings' rules stay in the residual and the
+        // type is the alias.
+        for (const k of keys) if (k !== '$ref' && TYPED.has(k)) res[k] = s[k]
+        return { t: aliasT, res }
+      }
+
+      if (s.const !== undefined || s.enum !== undefined) {
+        let lit = null
+        if (s.const !== undefined && s.enum === undefined) lit = literalOf(s.const)
+        else if (s.enum !== undefined && s.const === undefined && Array.isArray(s.enum) && s.enum.length > 0) {
+          lit = empty()
+          for (const v of s.enum) { const l = literalOf(v); if (l === null) { lit = null; break } lit = union(lit, l) }
+        }
+        if (lit === null) {
+          if (s.const !== undefined) res.const = s.const
+          if (s.enum !== undefined) res.enum = s.enum
+        } else {
+          t = lit
+          carried.push(s.const !== undefined ? `${ptr}/const` : `${ptr}/enum`)
+        }
+        // The literal says everything about the value; the other rules at this
+        // node would have to be checked against it, which the residual does.
+        for (const k of ['type', ...CONSTRAINT_KEYS]) if (s[k] !== undefined) res[k] = s[k]
+        return finish(t, res, s, ptr)
+      }
+
+      if (s.type !== undefined) {
+        const types = Array.isArray(s.type) ? s.type : [s.type]
+        const known = types.every((k) => KINDS.includes(k) || k === 'integer')
+        if (types.length === 0 || !known) {
+          for (const k of ['type', ...CONSTRAINT_KEYS]) if (s[k] !== undefined) res[k] = s[k]
+          return finish(universal(), res, s, ptr)
+        }
+        carried.push(`${ptr}/type`)
+        t = empty()
+        for (const k of types) t = union(t, kindAlt(k, s, ptr, res, keys))
+        // A rule for a kind the type does not name binds nothing; it is kept
+        // in the residual rather than dropped, so nothing is ever lost.
+        const allowed = new Set(types.flatMap(keysOf))
+        for (const k of CONSTRAINT_KEYS) if (s[k] !== undefined && !allowed.has(k)) res[k] = s[k]
+      } else if (hasAny(s, CONSTRAINT_KEYS) || (tags && typeof s.format === 'string' && assertFormat && formatPattern(s.format) !== null)) {
+        // A rule without a type binds only the values of its kind: {minLength:
+        // 1} accepts every number, object and array. The six kinds, each with
+        // the rules of its own kind, say exactly that.
+        t = empty()
+        for (const k of KINDS) t = union(t, hasAny(s, keysOf(k)) || (tags && k === 'string' && typeof s.format === 'string' && assertFormat && formatPattern(s.format) !== null) ? kindAlt(k, s, ptr, res, keys) : single(k, UNIVERSAL[k]))
+      }
+      return finish(t, res, s, ptr)
+    } finally {
+      depth--
+    }
+  }
+
+  // anyOf and allOf on top of the node's own type, then the residual.
+  function finish (t, res, s, ptr) {
+    if (s.allOf !== undefined) {
+      if (Array.isArray(s.allOf) && s.allOf.length > 0) {
+        const rest = []
+        s.allOf.forEach((b, i) => {
+          const r = conv(b, `${ptr}/allOf/${i}`)
+          const m = intersect(t, r.t)
+          if (m === null) { rest.push(b) } else { t = m; if (r.res !== null) rest.push(r.res) }
+        })
+        if (rest.length) res.allOf = rest
+        carried.push(`${ptr}/allOf`)
+      } else res.allOf = s.allOf
+    }
+    if (s.anyOf !== undefined) {
+      if (Array.isArray(s.anyOf) && s.anyOf.length > 0) {
+        let u = empty()
+        let clean = true
+        for (let i = 0; i < s.anyOf.length; i++) {
+          const r = conv(s.anyOf[i], `${ptr}/anyOf/${i}`)
+          // Without tags the type is a shape and the union of the branches'
+          // shapes is it; with them a branch's residual breaks the split.
+          if (tags && r.res !== null) { clean = false; break }
+          u = union(u, r.t)
+        }
+        const m = clean ? intersect(t, u) : null
+        if (m !== null) { t = m; carried.push(`${ptr}/anyOf`) } else res.anyOf = s.anyOf
+      } else res.anyOf = s.anyOf
+    }
+    return { t, res: Object.keys(res).length ? res : null }
+  }
+
+  aliasByPointer.set('#', name)
+  let r = conv(root, '#')
+  if (tags && r.res !== null && rootRefSeen) { rootHasResidual = true; r = conv(root, '#') }
+  let residual = tags ? r.res : null
+  if (residual !== null) {
+    // Subschemas the residual copies as they are may refer to any definition,
+    // so the definitions travel whole; the residuals of definitions the split
+    // refers to travel beside them under their own names.
+    const text = JSON.stringify(residual)
+    if (/"\$ref":"#"/.test(text) && !rootHasResidual) return fail('a rule the type cannot carry refers to the root', '#')
+    for (const bucket of ['$defs', 'definitions']) {
+      if (root[bucket] && typeof root[bucket] === 'object' && text.includes(`"#/${bucket}/`)) residual[bucket] = { ...root[bucket] }
+    }
+    for (const [pointer, v] of defResiduals.entries()) {
+      if (v === null) continue
+      const m = /^#\/(\$defs|definitions)\/(.+)$/.exec(pointer)
+      residual[m[1]] = residual[m[1]] || {}
+      residual[m[1]][restKey(decodeURIComponent(m[2].replace(/~1/g, '/').replace(/~0/g, '~')))] = v
+    }
+    if (typeof root.$schema === 'string') residual = { $schema: root.$schema, ...residual }
+  }
+  if (isUniversal(r.t)) return fail('the type carries nothing of the schema', '#')
+  return { name, type: render(r.t), aliases, residual, carried }
+}
+
+// The TypeScript module `ata build --target bun` writes beside the plain one:
+// the type, and the module's functions with the type on them. `parse`
+// declares the type where it parses, which is what the compiler reads to make
+// the objects with that layout; the module then checks the content.
+function toBunModule ({ schemaFile, moduleImport, typeName: tn, typeSource, aliases }) {
+  const lines = []
+  lines.push(`// Generated by ata build --target bun from ${schemaFile}. Do not edit.`)
+  lines.push('//')
+  lines.push('// For executables built with `bun build --compile --aot`: the schema as a type')
+  lines.push(`// for the program, with the plain module (${moduleImport}) answering every`)
+  lines.push('// check, so the answers and the errors are the module\'s. `parse(text)` declares')
+  lines.push('// the type where it parses and the module checks the content; it is not faster')
+  lines.push('// than a plain parse and the module. Everywhere else, including plain `bun run`,')
+  lines.push('// the plain module does the same without this file.')
+  lines.push(`import * as _m from ${JSON.stringify(moduleImport)}`)
+  lines.push('')
+  for (const [n, src] of aliases) lines.push(`type ${n} = ${src}`)
+  lines.push(`export type ${tn} = ${typeSource}`)
+  lines.push('')
+  lines.push(`export function isValid (d: unknown): d is ${tn} { return _m.isValid(d) }`)
+  lines.push('export function validate (d: unknown) { return _m.validate(d) }')
+  lines.push('// The parsed document when the text is JSON and the document is valid, else null.')
+  lines.push(`export function parse (text: string): ${tn} | null {`)
+  lines.push('  try {')
+  lines.push(`    const d: ${tn} = JSON.parse(text)`)
+  lines.push('    return _m.isValid(d) ? d : null')
+  lines.push('  } catch { return null }')
+  lines.push('}')
+  lines.push('')
+  return lines.join('\n')
+}
+
+// Writes the Bun target for one compiled module: the `.bun.ts` beside it.
+// Returns what was written; throws Declined when no type can be written (a
+// remote $ref, a dynamic reference, a schema the type says nothing about).
+function writeBunTarget ({ schema, input, output, typeName: tn }) {
+  const fs = require('fs')
+  const path = require('path')
+  const mapped = schemaToBunType(schema, { name: tn })
+  const ext = path.extname(output)
+  const bunPath = output.slice(0, output.length - ext.length) + '.bun.ts'
+  fs.writeFileSync(bunPath, toBunModule({
+    schemaFile: path.relative(process.cwd(), input) || input,
+    moduleImport: './' + path.basename(output),
+    typeName: mapped.name,
+    typeSource: mapped.type,
+    aliases: mapped.aliases,
+  }))
+  return { bunPath, definitions: mapped.aliases.length, carried: mapped.carried.length }
+}
+
+// The validation keywords in a residual of the tagged split, for a report.
+function countKeywords (s) {
+  if (typeof s !== 'object' || s === null) return 0
+  if (Array.isArray(s)) return s.reduce((n, x) => n + countKeywords(x), 0)
+  let n = 0
+  for (const k of Object.keys(s)) {
+    if (IGNORED.has(k) && k !== '$defs' && k !== 'definitions') continue
+    if (['properties', 'patternProperties', '$defs', 'definitions', 'dependentSchemas'].includes(k)) { for (const v of Object.values(s[k] || {})) n += countKeywords(v); continue }
+    if (['items', 'prefixItems', 'allOf', 'anyOf', 'oneOf', 'not', 'if', 'then', 'else', 'contains', 'additionalProperties', 'propertyNames', 'unevaluatedProperties', 'unevaluatedItems'].includes(k)) { n += (typeof s[k] === 'object' ? countKeywords(s[k]) : 0) + (['items', 'prefixItems', 'allOf', 'anyOf', 'properties'].includes(k) ? 0 : 1); continue }
+    n++
+  }
+  return n
+}
+
+module.exports = { schemaToBunType, toBunModule, writeBunTarget, countKeywords, Declined }

package/lib/codegen-engine.js

@@ -325,8 +325,14 @@ function installCodegenPaths (ctx) {
     // second time and built a second rejection around it.
     ctx.rejectBase = onReject;
     // The rich combined function, for a validator whose errors are being read
-    // with richErrors on. See _ensureCompiled.
-    if (!preprocess) {
+    // with richErrors on. See _ensureCompiled. The builders read the document
+    // validate() has already passed through the preprocess pass (defaults,
+    // coercion, removal edit it in place), so they hold with one too: a schema
+    // with a single `default`, which ata fills without being asked, used to
+    // keep its errors on the enrich-afterwards path, 666 against 313 ns for
+    // one `required` error on a four-field user. Only the one-pass swap below,
+    // which replaces validate() itself, needs the document unprocessed.
+    {
       ctx.richBuilder = richBuilder;
       // The plain combined function stands in where no rich one is built
       // (richErrors off, or a schema source to frame errors from): its errors
@@ -343,7 +349,7 @@ function installCodegenPaths (ctx) {
       ctx.isCombined = (fn) => fn !== null && fn === _safeCombined;
       // validate() as the combined function in its result shape: built and
       // probed here, null when it declines or throws on the probe.
-      ctx.onePassOf = (empty, fallback) => {
+      ctx.onePassOf = preprocess ? null : (empty, fallback) => {
         // A collapsed branch error is built in its final plain shape here
         // (no ordering key in the runtime shape); its branch errors are put
         // in order with the rest.

package/lib/combined-runtime.js

@@ -114,7 +114,7 @@ function srX (S, e, srt) {
 // the standalone modules carry). The prototype test itself stays inline in
 // the generated code, read once per object: a shared helper reading the
 // prototype of every object it was asked about was megamorphic.
-const _PN = ({}).__proto__ === Object.prototype // eslint-disable-line no-proto
+const _PN = typeof Bun === 'undefined' && ({}).__proto__ === Object.prototype // eslint-disable-line no-proto -- JavaScriptCore goes through Object.getPrototypeOf
 const _OP = Object.prototype
 const _gp = Object.getPrototypeOf
 const _hop = Object.prototype.hasOwnProperty

package/lib/formats.js

@@ -538,4 +538,4 @@ function email(s) {
 const DURATION_RE = /^P(?:\d+W|(?:\d+Y(?:\d+M(?:\d+D)?)?|\d+M(?:\d+D)?|\d+D)(?:T(?:\d+H(?:\d+M(?:\d+S)?)?|\d+M(?:\d+S)?|\d+S))?|T(?:\d+H(?:\d+M(?:\d+S)?)?|\d+M(?:\d+S)?|\d+S))$/;
 function duration (s) { return DURATION_RE.test(s); }
 
-module.exports = { IPV4, IPV6_FULL, ipv4Range, URI_FAST, date, ipv4, dateTime, ipv6, hostname, uri, uriReference, uriWalk: _uriWalk, uuid, time, noReserved, jsonPointer, relativeJsonPointer, uriTemplate, email, duration, iri, iriReference, idnEmail, DURATION_RE, URI_TEMPLATE_EXPR };
+module.exports = { IPV4, DURATION_RE, IPV6_FULL, ipv4Range, URI_FAST, date, ipv4, dateTime, ipv6, hostname, uri, uriReference, uriWalk: _uriWalk, uuid, time, noReserved, jsonPointer, relativeJsonPointer, uriTemplate, email, duration, iri, iriReference, idnEmail, DURATION_RE, URI_TEMPLATE_EXPR };