openapi-typesafe 1.0.0-rc.0 → 1.0.0-rc.2

package/dist/application/transform/footer/type-rules.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-rules.mjs","sources":["../../../../src/application/transform/footer/type-rules.ts"],"sourcesContent":["import { irObject, irProperty } from \"../../../domain/ir/constructors.js\";\nimport type {\n  IrMember,\n  IrObjectType,\n  IrPropertySignature,\n  IrType,\n} from \"../../../domain/ir/nodes.js\";\nimport { toPropertyName } from \"../../../domain/ir/property-name.js\";\nimport {\n  type Evaluated,\n  type Evaluation,\n  MISSING,\n  OPAQUE,\n  propertyKey,\n  unionType,\n} from \"./evaluation.js\";\n\n/**\n * Rules of TypeScript about intersections, `Omit` and `Extract` that the `--enum-values` check\n * needs (ADR-027). They read the types as written, before `FlattenedDeepRequired`.\n */\n\n/** The part of the evaluator these rules use. */\nexport interface TypeExpansion {\n  membersOf(value: Evaluated): readonly Evaluation[];\n}\n\n/** A unit value of a type: a literal, `null` or `undefined`. */\ntype Unit = string;\n\n/**\n * The parts an intersection is made of, nested intersections flattened: each object type, or\n * `null` for a part that is not one.\n */\nfunction objectParts(\n  types: TypeExpansion,\n  value: Evaluated,\n  parts: readonly IrType[],\n): (IrObjectType | null)[] {\n  return parts.flatMap((part) => {\n    const members = types.membersOf({ ...value, type: part });\n    const [only] = members;\n    if (members.length !== 1 || only?.kind !== \"type\") {\n      return [null];\n    }\n    if (only.type.kind === \"intersection\") {\n      return objectParts(types, only, only.type.types);\n    }\n    return [only.type.kind === \"object\" ? only.type : null];\n  });\n}\n\nfunction unitOf(type: IrType): Unit | null {\n  switch (type.kind) {\n    case \"stringLiteral\":\n      return `s:${type.value}`;\n    case \"numberLiteral\":\n      return `n:${type.value}`;\n    case \"booleanLiteral\":\n      return `b:${type.value}`;\n    case \"keyword\":\n      return type.keyword === \"null\" || type.keyword === \"undefined\" ? type.keyword : null;\n    default:\n      return null;\n  }\n}\n\n/** The unit values of a type made only of units, or `null` where it has other values. */\nfunction unitsOf(types: TypeExpansion, value: Evaluated, type: IrType): ReadonlySet<Unit> | null {\n  const units = types.membersOf({ ...value, type }).map((member) => {\n    return member.kind === \"type\" ? unitOf(member.type) : null;\n  });\n  return units.includes(null) ? null : new Set(units as Unit[]);\n}\n\nfunction propertiesNamed(objects: readonly IrObjectType[], key: string): IrPropertySignature[] {\n  return objects.flatMap((object) => {\n    const members: readonly IrMember[] = object.members;\n    return members.filter(\n      (member): member is IrPropertySignature =>\n        member.kind === \"property\" && propertyKey(member.name) === key,\n    );\n  });\n}\n\n/** Whether properties of the same name share no unit value, one of them required. */\nfunction isNeverProperty(\n  types: TypeExpansion,\n  value: Evaluated,\n  found: IrPropertySignature[],\n): boolean {\n  if (found.length < 2 || found.every((property) => property.isOptional)) {\n    return false;\n  }\n  const sets = found.map((property) => unitsOf(types, value, property.type));\n  if (sets.includes(null)) {\n    return false;\n  }\n  // At least two properties, so at least two sets.\n  const [first, ...rest] = sets as [ReadonlySet<Unit>, ...ReadonlySet<Unit>[]];\n  const shared = [...first].filter((unit) => rest.every((set) => set.has(unit)));\n  return shared.length === 0;\n}\n\n/** Whether an intersection has `null` or `undefined` next to an object: `null & { a: 1 }`. */\nfunction isNullishObject(types: TypeExpansion, value: Evaluated, parts: readonly IrType[]) {\n  const singles = parts.map((part) => {\n    const members = types.membersOf({ ...value, type: part });\n    const [only] = members;\n    return members.length === 1 && only?.kind === \"type\" ? only.type : null;\n  });\n  const isNullish = (type: IrType | null) =>\n    type?.kind === \"keyword\" && (type.keyword === \"null\" || type.keyword === \"undefined\");\n  return singles.some(isNullish) && singles.some((type) => type?.kind === \"object\");\n}\n\n/**\n * Whether TypeScript reduces an intersection to `never`: `null` or `undefined` meets an object,\n * or objects share a property with literal types that have no value in common, one of them\n * requiring it (`{ a: \"x\" } & { a: \"y\" }`). Other properties are left alone, so the answer is\n * sure where it is yes.\n */\nexport function isNeverIntersection(\n  types: TypeExpansion,\n  value: Evaluated,\n  parts: readonly IrType[],\n): boolean {\n  if (isNullishObject(types, value, parts)) {\n    return true;\n  }\n  const objects = objectParts(types, value, parts).filter((part) => part !== null);\n  if (objects.length < 2) {\n    return false;\n  }\n  const keys = new Set(\n    objects.flatMap((object) =>\n      object.members.flatMap((member) =>\n        member.kind === \"property\" ? [propertyKey(member.name)] : [],\n      ),\n    ),\n  );\n  const valueOfKeys = { ...value, deep: false };\n  return [...keys].some((key) =>\n    isNeverProperty(types, valueOfKeys, propertiesNamed(objects, key)),\n  );\n}\n\n/** Whether `key` reaches only an index signature of this object: it declares no such property. */\nfunction isSignatureOnly(types: TypeExpansion, value: Evaluated, key: string | null): boolean {\n  const members = types.membersOf(value);\n  const [only] = members;\n  if (\n    key === null ||\n    members.length !== 1 ||\n    only?.kind !== \"type\" ||\n    only.type.kind !== \"object\"\n  ) {\n    return false;\n  }\n  const { members: declared } = only.type;\n  const hasSignature = declared.some((member) => member.kind === \"indexSignature\");\n  return hasSignature && propertiesNamed([only.type], key).length === 0;\n}\n\n/**\n * The parts of an intersection indexed by `index`, as TypeScript reads them: where one part\n * declares the property, the index signatures of the others do not take part\n * (`{ a: X } & { [key: string]: Y }` gives `X` for `a`).\n */\nexport function declaredFirst(\n  types: TypeExpansion,\n  value: Evaluated,\n  key: string | null,\n  parts: readonly { readonly type: IrType; readonly found: Evaluation }[],\n): Evaluation[] {\n  const bySignature = parts.map(({ type }) => isSignatureOnly(types, { ...value, type }, key));\n  const isDeclared = parts.some(({ found }, at) => found.kind === \"type\" && !bySignature[at]);\n  return parts.filter((_, at) => !(isDeclared && bySignature[at])).map(({ found }) => found);\n}\n\n/**\n * Whether a member of `membersOf` has `key` as a property that `{ key: unknown }` accepts: written\n * and, outside `FlattenedDeepRequired`, required. An index signature does not count, as in\n * TypeScript. Such a member is expanded, parts included, so it is an object, an intersection of\n * members, or a primitive or array type, which has no such property; a type the evaluator cannot\n * read makes `membersOf` opaque instead.\n */\nfunction hasKey(value: Evaluated, key: string): boolean {\n  const { type } = value;\n  if (type.kind === \"intersection\") {\n    return type.types.some((part) => hasKey({ ...value, type: part }, key));\n  }\n  if (type.kind !== \"object\") {\n    return false;\n  }\n  return propertiesNamed([type], key).some((property) => value.deep || !property.isOptional);\n}\n\n/**\n * `Extract<T, { key: unknown }>`: the members of `T` that have `key`. When none has it the\n * result is `never`; it is `missing` here, as the location then types nothing.\n */\nexport function extracted(types: TypeExpansion, value: Evaluated, key: string): Evaluation {\n  const members = types.membersOf(value);\n  if (members.some((member) => member.kind !== \"type\")) {\n    return OPAQUE;\n  }\n  const kept = (members as Evaluated[]).filter((member) => hasKey(member, key));\n  if (kept.length === 0) {\n    return MISSING;\n  }\n  return { ...value, type: unionType(kept.map((member) => member.type)) };\n}\n\nfunction omittedKeys(types: TypeExpansion, value: Evaluated, keys: IrType): Set<string> | null {\n  const members = types.membersOf({ ...value, type: keys });\n  const names = members.map((member) =>\n    member.kind === \"type\" && member.type.kind === \"stringLiteral\" ? member.type.value : null,\n  );\n  return names.includes(null) ? null : new Set(names as string[]);\n}\n\n/** Whether two members name the same property: merging them would need their intersection. */\nfunction hasSharedProperty(members: readonly IrMember[]): boolean {\n  const names = members.flatMap((member) =>\n    member.kind === \"property\" ? [propertyKey(member.name)] : [],\n  );\n  return new Set(names).size !== names.length;\n}\n\n/**\n * `Omit<T, K>` for literal keys `K` over an object or an intersection of objects. A string index\n * signature makes `keyof T` all strings, so only the index signatures are left.\n */\nexport function omitted(types: TypeExpansion, value: Evaluated, keys: IrType): Evaluation {\n  const names = omittedKeys(types, value, keys);\n  const objects = objectParts(types, value, [value.type]);\n  if (names === null || objects.length === 0 || objects.includes(null)) {\n    return OPAQUE;\n  }\n  const members = (objects as IrObjectType[]).flatMap((object) => object.members);\n  if (hasSharedProperty(members)) {\n    return OPAQUE;\n  }\n  const signatures = members.filter((member) => member.kind === \"indexSignature\");\n  const kept =\n    signatures.length > 0\n      ? signatures\n      : members.filter(\n          (member) => member.kind !== \"property\" || !names.has(propertyKey(member.name)),\n        );\n  return { ...value, type: { kind: \"object\", members: kept } };\n}\n\n/** The `--read-write-markers` types and their one member (`READ_WRITE_MARKER_TYPES`). */\nconst READ_WRITE_MARKER_KEYS: ReadonlyMap<string, string> = new Map([\n  [\"$Read\", \"$read\"],\n  [\"$Write\", \"$write\"],\n]);\n\n/** `$Read<T>` is `{ readonly $read: T }`: an object, which holds no enum value. */\nexport function markerObject(name: string, argument: Evaluated): Evaluated | null {\n  const key = READ_WRITE_MARKER_KEYS.get(name);\n  if (key === undefined) {\n    return null;\n  }\n  const member = irProperty(toPropertyName(key), argument.type, { isReadonly: true });\n  return { ...argument, type: irObject([member]) };\n}\n"],"names":[],"mappings":";;;;AAkCA,SAAS,WAAA,CACP,KAAA,EACA,KAAA,EACA,KAAA,EACyB;AACzB,EAAA,OAAO,KAAA,CAAM,OAAA,CAAQ,CAAC,IAAA,KAAS;AAC7B,IAAA,MAAM,OAAA,GAAU,MAAM,SAAA,CAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,MAAM,CAAA;AACxD,IAAA,MAAM,CAAC,IAAI,CAAA,GAAI,OAAA;AACf,IAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,CAAA,IAAK,IAAA,EAAM,SAAS,MAAA,EAAQ;AACjD,MAAA,OAAO,CAAC,IAAI,CAAA;AAAA,IACd;AACA,IAAA,IAAI,IAAA,CAAK,IAAA,CAAK,IAAA,KAAS,cAAA,EAAgB;AACrC,MAAA,OAAO,WAAA,CAAY,KAAA,EAAO,IAAA,EAAM,IAAA,CAAK,KAAK,KAAK,CAAA;AAAA,IACjD;AACA,IAAA,OAAO,CAAC,IAAA,CAAK,IAAA,CAAK,SAAS,QAAA,GAAW,IAAA,CAAK,OAAO,IAAI,CAAA;AAAA,EACxD,CAAC,CAAA;AACH;AAEA,SAAS,OAAO,IAAA,EAA2B;AACzC,EAAA,QAAQ,KAAK,IAAA;AAAM,IACjB,KAAK,eAAA;AACH,MAAA,OAAO,CAAA,EAAA,EAAK,KAAK,KAAK,CAAA,CAAA;AAAA,IACxB,KAAK,eAAA;AACH,MAAA,OAAO,CAAA,EAAA,EAAK,KAAK,KAAK,CAAA,CAAA;AAAA,IACxB,KAAK,gBAAA;AACH,MAAA,OAAO,CAAA,EAAA,EAAK,KAAK,KAAK,CAAA,CAAA;AAAA,IACxB,KAAK,SAAA;AACH,MAAA,OAAO,KAAK,OAAA,KAAY,MAAA,IAAU,KAAK,OAAA,KAAY,WAAA,GAAc,KAAK,OAAA,GAAU,IAAA;AAAA,IAClF;AACE,MAAA,OAAO,IAAA;AAAA;AAEb;AAGA,SAAS,OAAA,CAAQ,KAAA,EAAsB,KAAA,EAAkB,IAAA,EAAwC;AAC/F,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,SAAA,CAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,CAAA,CAAE,GAAA,CAAI,CAAC,MAAA,KAAW;AAChE,IAAA,OAAO,OAAO,IAAA,KAAS,MAAA,GAAS,MAAA,CAAO,MAAA,CAAO,IAAI,CAAA,GAAI,IAAA;AAAA,EACxD,CAAC,CAAA;AACD,EAAA,OAAO,MAAM,QAAA,CAAS,IAAI,IAAI,IAAA,GAAO,IAAI,IAAI,KAAe,CAAA;AAC9D;AAEA,SAAS,eAAA,CAAgB,SAAkC,GAAA,EAAoC;AAC7F,EAAA,OAAO,OAAA,CAAQ,OAAA,CAAQ,CAAC,MAAA,KAAW;AACjC,IAAA,MAAM,UAA+B,MAAA,CAAO,OAAA;AAC5C,IAAA,OAAO,OAAA,CAAQ,MAAA;AAAA,MACb,CAAC,WACC,MAAA,CAAO,IAAA,KAAS,cAAc,WAAA,CAAY,MAAA,CAAO,IAAI,CAAA,KAAM;AAAA,KAC/D;AAAA,EACF,CAAC,CAAA;AACH;AAGA,SAAS,eAAA,CACP,KAAA,EACA,KAAA,EACA,KAAA,EACS;AACT,EAAA,IAAI,KAAA,CAAM,SAAS,CAAA,IAAK,KAAA,CAAM,MAAM,CAAC,QAAA,KAAa,QAAA,CAAS,UAAU,CAAA,EAAG;AACtE,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,GAAA,CAAI,CAAC,QAAA,KAAa,QAAQ,KAAA,EAAO,KAAA,EAAO,QAAA,CAAS,IAAI,CAAC,CAAA;AACzE,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,MAAM,CAAC,KAAA,EAAO,GAAG,IAAI,CAAA,GAAI,IAAA;AACzB,EAAA,MAAM,SAAS,CAAC,GAAG,KAAK,CAAA,CAAE,OAAO,CAAC,IAAA,KAAS,IAAA,CAAK,KAAA,CAAM,CAAC,GAAA,KAAQ,GAAA,CAAI,GAAA,CAAI,IAAI,CAAC,CAAC,CAAA;AAC7E,EAAA,OAAO,OAAO,MAAA,KAAW,CAAA;AAC3B;AAGA,SAAS,eAAA,CAAgB,KAAA,EAAsB,KAAA,EAAkB,KAAA,EAA0B;AACzF,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AAClC,IAAA,MAAM,OAAA,GAAU,MAAM,SAAA,CAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,MAAM,CAAA;AACxD,IAAA,MAAM,CAAC,IAAI,CAAA,GAAI,OAAA;AACf,IAAA,OAAO,QAAQ,MAAA,KAAW,CAAA,IAAK,MAAM,IAAA,KAAS,MAAA,GAAS,KAAK,IAAA,GAAO,IAAA;AAAA,EACrE,CAAC,CAAA;AACD,EAAA,MAAM,SAAA,GAAY,CAAC,IAAA,KACjB,IAAA,EAAM,IAAA,KAAS,cAAc,IAAA,CAAK,OAAA,KAAY,MAAA,IAAU,IAAA,CAAK,OAAA,KAAY,WAAA,CAAA;AAC3E,EAAA,OAAO,OAAA,CAAQ,IAAA,CAAK,SAAS,CAAA,IAAK,OAAA,CAAQ,KAAK,CAAC,IAAA,KAAS,IAAA,EAAM,IAAA,KAAS,QAAQ,CAAA;AAClF;AAQO,SAAS,mBAAA,CACd,KAAA,EACA,KAAA,EACA,KAAA,EACS;AACT,EAAA,IAAI,eAAA,CAAgB,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA,EAAG;AACxC,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAA,GAAU,WAAA,CAAY,KAAA,EAAO,KAAA,EAAO,KAAK,EAAE,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,KAAS,IAAI,CAAA;AAC/E,EAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAO,IAAI,GAAA;AAAA,IACf,OAAA,CAAQ,OAAA;AAAA,MAAQ,CAAC,MAAA,KACf,MAAA,CAAO,OAAA,CAAQ,OAAA;AAAA,QAAQ,CAAC,MAAA,KACtB,MAAA,CAAO,IAAA,KAAS,UAAA,GAAa,CAAC,WAAA,CAAY,MAAA,CAAO,IAAI,CAAC,CAAA,GAAI;AAAC;AAC7D;AACF,GACF;AACA,EAAA,MAAM,WAAA,GAAc,EAAE,GAAG,KAAA,EAAO,MAAM,KAAA,EAAM;AAC5C,EAAA,OAAO,CAAC,GAAG,IAAI,CAAA,CAAE,IAAA;AAAA,IAAK,CAAC,QACrB,eAAA,CAAgB,KAAA,EAAO,aAAa,eAAA,CAAgB,OAAA,EAAS,GAAG,CAAC;AAAA,GACnE;AACF;AAGA,SAAS,eAAA,CAAgB,KAAA,EAAsB,KAAA,EAAkB,GAAA,EAA6B;AAC5F,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,SAAA,CAAU,KAAK,CAAA;AACrC,EAAA,MAAM,CAAC,IAAI,CAAA,GAAI,OAAA;AACf,EAAA,IACE,GAAA,KAAQ,IAAA,IACR,OAAA,CAAQ,MAAA,KAAW,CAAA,IACnB,IAAA,EAAM,IAAA,KAAS,MAAA,IACf,IAAA,CAAK,IAAA,CAAK,IAAA,KAAS,QAAA,EACnB;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,EAAE,OAAA,EAAS,QAAA,EAAS,GAAI,IAAA,CAAK,IAAA;AACnC,EAAA,MAAM,eAAe,QAAA,CAAS,IAAA,CAAK,CAAC,MAAA,KAAW,MAAA,CAAO,SAAS,gBAAgB,CAAA;AAC/E,EAAA,OAAO,YAAA,IAAgB,gBAAgB,CAAC,IAAA,CAAK,IAAI,CAAA,EAAG,GAAG,EAAE,MAAA,KAAW,CAAA;AACtE;AAOO,SAAS,aAAA,CACd,KAAA,EACA,KAAA,EACA,GAAA,EACA,KAAA,EACc;AACd,EAAA,MAAM,WAAA,GAAc,KAAA,CAAM,GAAA,CAAI,CAAC,EAAE,IAAA,EAAK,KAAM,eAAA,CAAgB,KAAA,EAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAK,EAAG,GAAG,CAAC,CAAA;AAC3F,EAAA,MAAM,UAAA,GAAa,KAAA,CAAM,IAAA,CAAK,CAAC,EAAE,KAAA,EAAM,EAAG,EAAA,KAAO,KAAA,CAAM,IAAA,KAAS,MAAA,IAAU,CAAC,WAAA,CAAY,EAAE,CAAC,CAAA;AAC1F,EAAA,OAAO,MAAM,MAAA,CAAO,CAAC,CAAA,EAAG,EAAA,KAAO,EAAE,UAAA,IAAc,WAAA,CAAY,EAAE,CAAA,CAAE,EAAE,GAAA,CAAI,CAAC,EAAE,KAAA,OAAY,KAAK,CAAA;AAC3F;AASA,SAAS,MAAA,CAAO,OAAkB,GAAA,EAAsB;AACtD,EAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,EAAA,IAAI,IAAA,CAAK,SAAS,cAAA,EAAgB;AAChC,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,CAAC,IAAA,KAAS,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,IAAA,EAAK,EAAG,GAAG,CAAC,CAAA;AAAA,EACxE;AACA,EAAA,IAAI,IAAA,CAAK,SAAS,QAAA,EAAU;AAC1B,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,OAAO,eAAA,CAAgB,CAAC,IAAI,CAAA,EAAG,GAAG,CAAA,CAAE,IAAA,CAAK,CAAC,QAAA,KAAa,KAAA,CAAM,IAAA,IAAQ,CAAC,SAAS,UAAU,CAAA;AAC3F;AAMO,SAAS,SAAA,CAAU,KAAA,EAAsB,KAAA,EAAkB,GAAA,EAAyB;AACzF,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,SAAA,CAAU,KAAK,CAAA;AACrC,EAAA,IAAI,QAAQ,IAAA,CAAK,CAAC,WAAW,MAAA,CAAO,IAAA,KAAS,MAAM,CAAA,EAAG;AACpD,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,MAAM,IAAA,GAAQ,QAAwB,MAAA,CAAO,CAAC,WAAW,MAAA,CAAO,MAAA,EAAQ,GAAG,CAAC,CAAA;AAC5E,EAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACrB,IAAA,OAAO,OAAA;AAAA,EACT;AACA,EAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,SAAA,CAAU,IAAA,CAAK,GAAA,CAAI,CAAC,MAAA,KAAW,MAAA,CAAO,IAAI,CAAC,CAAA,EAAE;AACxE;AAEA,SAAS,WAAA,CAAY,KAAA,EAAsB,KAAA,EAAkB,IAAA,EAAkC;AAC7F,EAAA,MAAM,OAAA,GAAU,MAAM,SAAA,CAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,MAAM,CAAA;AACxD,EAAA,MAAM,QAAQ,OAAA,CAAQ,GAAA;AAAA,IAAI,CAAC,MAAA,KACzB,MAAA,CAAO,IAAA,KAAS,MAAA,IAAU,MAAA,CAAO,IAAA,CAAK,IAAA,KAAS,eAAA,GAAkB,MAAA,CAAO,IAAA,CAAK,KAAA,GAAQ;AAAA,GACvF;AACA,EAAA,OAAO,MAAM,QAAA,CAAS,IAAI,IAAI,IAAA,GAAO,IAAI,IAAI,KAAiB,CAAA;AAChE;AAGA,SAAS,kBAAkB,OAAA,EAAuC;AAChE,EAAA,MAAM,QAAQ,OAAA,CAAQ,OAAA;AAAA,IAAQ,CAAC,MAAA,KAC7B,MAAA,CAAO,IAAA,KAAS,UAAA,GAAa,CAAC,WAAA,CAAY,MAAA,CAAO,IAAI,CAAC,CAAA,GAAI;AAAC,GAC7D;AACA,EAAA,OAAO,IAAI,GAAA,CAAI,KAAK,CAAA,CAAE,SAAS,KAAA,CAAM,MAAA;AACvC;AAMO,SAAS,OAAA,CAAQ,KAAA,EAAsB,KAAA,EAAkB,IAAA,EAA0B;AACxF,EAAA,MAAM,KAAA,GAAQ,WAAA,CAAY,KAAA,EAAO,KAAA,EAAO,IAAI,CAAA;AAC5C,EAAA,MAAM,UAAU,WAAA,CAAY,KAAA,EAAO,OAAO,CAAC,KAAA,CAAM,IAAI,CAAC,CAAA;AACtD,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAA,CAAQ,MAAA,KAAW,KAAK,OAAA,CAAQ,QAAA,CAAS,IAAI,CAAA,EAAG;AACpE,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,MAAM,UAAW,OAAA,CAA2B,OAAA,CAAQ,CAAC,MAAA,KAAW,OAAO,OAAO,CAAA;AAC9E,EAAA,IAAI,iBAAA,CAAkB,OAAO,CAAA,EAAG;AAC9B,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,MAAM,aAAa,OAAA,CAAQ,MAAA,CAAO,CAAC,MAAA,KAAW,MAAA,CAAO,SAAS,gBAAgB,CAAA;AAC9E,EAAA,MAAM,IAAA,GACJ,UAAA,CAAW,MAAA,GAAS,CAAA,GAChB,aACA,OAAA,CAAQ,MAAA;AAAA,IACN,CAAC,MAAA,KAAW,MAAA,CAAO,IAAA,KAAS,UAAA,IAAc,CAAC,KAAA,CAAM,GAAA,CAAI,WAAA,CAAY,MAAA,CAAO,IAAI,CAAC;AAAA,GAC/E;AACN,EAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,IAAA,EAAK,EAAE;AAC7D;AAGA,MAAM,sBAAA,uBAA0D,GAAA,CAAI;AAAA,EAClE,CAAC,SAAS,OAAO,CAAA;AAAA,EACjB,CAAC,UAAU,QAAQ;AACrB,CAAC,CAAA;AAGM,SAAS,YAAA,CAAa,MAAc,QAAA,EAAuC;AAChF,EAAA,MAAM,GAAA,GAAM,sBAAA,CAAuB,GAAA,CAAI,IAAI,CAAA;AAC3C,EAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,MAAA,GAAS,UAAA,CAAW,cAAA,CAAe,GAAG,CAAA,EAAG,SAAS,IAAA,EAAM,EAAE,UAAA,EAAY,IAAA,EAAM,CAAA;AAClF,EAAA,OAAO,EAAE,GAAG,QAAA,EAAU,IAAA,EAAM,SAAS,CAAC,MAAM,CAAC,CAAA,EAAE;AACjD;;"}

package/dist/application/transform/ref-pointer/generated-location.cjs

@@ -0,0 +1,138 @@
+'use strict';
+
+const jsonPointer = require('../../../domain/openapi/json-pointer.cjs');
+const generatedShape = require('./generated-shape.cjs');
+const pointerWalk = require('./pointer-walk.cjs');
+
+const PARENT_LOCATION_PAIRS = /* @__PURE__ */ new Set([
+  "allOf",
+  "prefixItems",
+  "patternProperties"
+]);
+const RECORD_VALUE_KEYWORDS = /* @__PURE__ */ new Set([
+  "additionalProperties",
+  "unevaluatedProperties"
+]);
+const KEPT_PAIRS = /* @__PURE__ */ new Set(["anyOf", "oneOf", "$defs"]);
+const PARENT_LOCATION_KEYWORDS = /* @__PURE__ */ new Set(["items", ...RECORD_VALUE_KEYWORDS]);
+const INDEX_RE = /^\d+$/;
+function childOf(node, segment) {
+  return (generatedShape.isJsonObject(node) || Array.isArray(node)) && segment !== void 0 ? node[segment] : void 0;
+}
+function pairStep(value, next, path) {
+  return { path, child: childOf(value, next), length: 2, isSchema: true };
+}
+function schemaStep(node, segment, next) {
+  const value = childOf(node, segment);
+  const named = next === void 0 ? [] : [next];
+  if (segment === "properties") {
+    return pairStep(value, next, named);
+  }
+  if (PARENT_LOCATION_PAIRS.has(segment) || segment === "items" && Array.isArray(value)) {
+    return pairStep(value, next, []);
+  }
+  if (KEPT_PAIRS.has(segment)) {
+    return pairStep(value, next, [segment, ...named]);
+  }
+  if (!PARENT_LOCATION_KEYWORDS.has(segment)) {
+    return null;
+  }
+  const isRecordValue = RECORD_VALUE_KEYWORDS.has(segment);
+  return {
+    path: [],
+    child: value,
+    length: 1,
+    isSchema: true,
+    isFromAdditionalProperties: isRecordValue
+  };
+}
+function isPathItem(path) {
+  const [root, section] = path;
+  return path.length === 2 && (root === "paths" || root === "webhooks") || path.length === 3 && root === "components" && section === "pathItems";
+}
+function parameterStep(walk, next) {
+  const entry = childOf(childOf(walk.node, "parameters"), next);
+  const where = generatedShape.isJsonObject(entry) ? [String(entry.in), String(entry.name)] : [];
+  const prefix = isPathItem(walk.path) ? ["parameters"] : [];
+  return { path: [...prefix, "parameters", ...where], child: entry, length: 2, isSchema: false };
+}
+function documentStep(walk, segments, index) {
+  const segment = segments[index];
+  const next = segments[index + 1];
+  const value = childOf(walk.node, segment);
+  if (segment === "schema") {
+    return { path: [], child: value, length: 1, isSchema: true };
+  }
+  if (segment === "parameters" && next !== void 0 && INDEX_RE.test(next)) {
+    return parameterStep(walk, next);
+  }
+  if (segment === "content" && segments[index - 2] === "headers") {
+    const path = next === void 0 ? [] : [next];
+    return { path, child: childOf(value, next), length: 2, isSchema: false };
+  }
+  return { path: [segment], child: value, length: 1, isSchema: false };
+}
+function stepAt(walk, pointer, index) {
+  const { segments } = pointer;
+  const segment = segments[index];
+  if (index < pointerWalk.leadingSegmentsOf(pointer)) {
+    const child = childOf(walk.node, segment);
+    return { path: [segment], child, length: 1, isSchema: pointerWalk.startsInSchema(pointer) };
+  }
+  return walk.isSchema ? schemaStep(walk.node, segment, segments[index + 1]) : documentStep(walk, segments, index);
+}
+function refOf(node) {
+  return generatedShape.isJsonObject(node) && typeof node.$ref === "string" ? node.$ref : null;
+}
+function crossed(walk, ref, refs, seen) {
+  if (seen.includes(ref)) {
+    return { ...walk, node: void 0 };
+  }
+  const target = walkTo(ref, refs, seen);
+  const inner = refOf(target?.node);
+  return target === null || inner === null ? target : crossed(target, inner, refs, [...seen, ref]);
+}
+function walkTo(ref, refs, seen) {
+  const pointer = pointerWalk.refPointerOf(ref);
+  if (pointer === null || seen.includes(ref)) {
+    return null;
+  }
+  const root = pointer.rootSegment;
+  let walk = {
+    path: [root],
+    node: refs.resolve(`#/${root}`),
+    isSchema: false,
+    isFromAdditionalProperties: false
+  };
+  for (let index = 0; index < pointer.segments.length; ) {
+    const step = stepAt(walk, pointer, index);
+    if (step === null) {
+      return null;
+    }
+    index += step.length;
+    walk = {
+      path: [...walk.path, ...step.path],
+      node: step.child,
+      isSchema: step.isSchema,
+      isFromAdditionalProperties: step.isFromAdditionalProperties === true
+    };
+    const inner = refOf(walk.node);
+    const target = inner !== null && index < pointer.segments.length;
+    const next = target ? crossed(walk, inner, refs, [...seen, ref]) : walk;
+    if (next === null) {
+      return null;
+    }
+    walk = next;
+  }
+  return walk;
+}
+function generatedLocationOf(ref, refs) {
+  const walk = walkTo(ref, refs, []);
+  return {
+    path: walk === null ? ref : jsonPointer.createRef(walk.path),
+    isFromAdditionalProperties: walk?.isFromAdditionalProperties ?? false
+  };
+}
+
+exports.generatedLocationOf = generatedLocationOf;
+//# sourceMappingURL=generated-location.cjs.map

package/dist/application/transform/ref-pointer/generated-location.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"generated-location.cjs","sources":["../../../../src/application/transform/ref-pointer/generated-location.ts"],"sourcesContent":["import { createRef } from \"../../../domain/openapi/json-pointer.js\";\nimport type { RefResolver } from \"../schema/schema-context.js\";\nimport { isJsonObject } from \"./generated-shape.js\";\nimport {\n  leadingSegmentsOf,\n  type RefPointer,\n  refPointerOf,\n  startsInSchema,\n} from \"./pointer-walk.js\";\n\n/**\n * Where the generator types the node a `$ref` points at: the location path it passes down, which\n * also names the node's `--enum` declaration and `--enum-values` array. A target written inline\n * (ADR-026) is typed there, so it shares the generator's enum instead of declaring a second one\n * named after the pointer: two TypeScript enums with the same members are not assignable.\n *\n * The path follows the generator: `properties` is skipped; `allOf/N`, `items`, `prefixItems/N`,\n * `patternProperties/P` and `additionalProperties` type their schema at the parent's location;\n * the `schema` of a parameter, header or media type is typed at the container's; a positional\n * parameter is named by `in` and `name`. A `$ref` crossed on the way continues at its target's\n * location. A node under a schema keyword the generator does not type (`definitions/A`, `not`) is\n * typed nowhere else, so it keeps its pointer as its location.\n */\n\nexport interface GeneratedLocation {\n  readonly path: string;\n  /** The node is an `additionalProperties` value, as `transformNested` is told. */\n  readonly isFromAdditionalProperties: boolean;\n}\n\ninterface LocationWalk {\n  readonly path: readonly string[];\n  readonly node: unknown;\n  readonly isSchema: boolean;\n  readonly isFromAdditionalProperties: boolean;\n}\n\n/** One step: the segments it adds to the path, the node it moves to, the segments it reads. */\ninterface Step {\n  readonly path: readonly string[];\n  readonly child: unknown;\n  readonly length: 1 | 2;\n  readonly isSchema: boolean;\n  readonly isFromAdditionalProperties?: boolean;\n}\n\n/** Keywords followed by a name or position whose schema is typed at the parent's location. */\nconst PARENT_LOCATION_PAIRS: ReadonlySet<string> = new Set([\n  \"allOf\",\n  \"prefixItems\",\n  \"patternProperties\",\n]);\n/** Keywords whose schema is typed at the parent's location as a record value. */\nconst RECORD_VALUE_KEYWORDS: ReadonlySet<string> = new Set([\n  \"additionalProperties\",\n  \"unevaluatedProperties\",\n]);\n/** Keywords followed by a name or position that both stay in the location. */\nconst KEPT_PAIRS: ReadonlySet<string> = new Set([\"anyOf\", \"oneOf\", \"$defs\"]);\n/** The other schema keywords the generator types: at the parent's location. */\nconst PARENT_LOCATION_KEYWORDS: ReadonlySet<string> = new Set([\"items\", ...RECORD_VALUE_KEYWORDS]);\nconst INDEX_RE = /^\\d+$/;\n\nfunction childOf(node: unknown, segment: string | undefined): unknown {\n  return (isJsonObject(node) || Array.isArray(node)) && segment !== undefined\n    ? (node as Readonly<Record<string, unknown>>)[segment]\n    : undefined;\n}\n\nfunction pairStep(value: unknown, next: string | undefined, path: readonly string[]): Step {\n  return { path, child: childOf(value, next), length: 2, isSchema: true };\n}\n\n/** The step through a schema keyword; null for a keyword the generator does not type. */\nfunction schemaStep(node: unknown, segment: string, next: string | undefined): Step | null {\n  const value = childOf(node, segment);\n  const named = next === undefined ? [] : [next];\n  if (segment === \"properties\") {\n    return pairStep(value, next, named);\n  }\n  if (PARENT_LOCATION_PAIRS.has(segment) || (segment === \"items\" && Array.isArray(value))) {\n    return pairStep(value, next, []);\n  }\n  if (KEPT_PAIRS.has(segment)) {\n    return pairStep(value, next, [segment, ...named]);\n  }\n  if (!PARENT_LOCATION_KEYWORDS.has(segment)) {\n    return null;\n  }\n  const isRecordValue = RECORD_VALUE_KEYWORDS.has(segment);\n  return {\n    path: [],\n    child: value,\n    length: 1,\n    isSchema: true,\n    isFromAdditionalProperties: isRecordValue,\n  };\n}\n\n/** A path item's own parameters sit under one more `parameters` segment (`pathItemType`). */\nfunction isPathItem(path: readonly string[]): boolean {\n  const [root, section] = path;\n  return (\n    (path.length === 2 && (root === \"paths\" || root === \"webhooks\")) ||\n    (path.length === 3 && root === \"components\" && section === \"pathItems\")\n  );\n}\n\n/** `parameters/N`: the parameter is named by `in` and `name` (a `$ref` one is crossed later). */\nfunction parameterStep(walk: LocationWalk, next: string): Step {\n  const entry = childOf(childOf(walk.node, \"parameters\"), next);\n  const where = isJsonObject(entry) ? [String(entry.in), String(entry.name)] : [];\n  const prefix = isPathItem(walk.path) ? [\"parameters\"] : [];\n  return { path: [...prefix, \"parameters\", ...where], child: entry, length: 2, isSchema: false };\n}\n\nfunction documentStep(walk: LocationWalk, segments: readonly string[], index: number): Step {\n  const segment = segments[index] as string;\n  const next = segments[index + 1];\n  const value = childOf(walk.node, segment);\n  if (segment === \"schema\") {\n    return { path: [], child: value, length: 1, isSchema: true };\n  }\n  if (segment === \"parameters\" && next !== undefined && INDEX_RE.test(next)) {\n    return parameterStep(walk, next);\n  }\n  // A header's `content` entries are typed at `headers/<name>/<media type>` (`headerType`).\n  if (segment === \"content\" && segments[index - 2] === \"headers\") {\n    const path = next === undefined ? [] : [next];\n    return { path, child: childOf(value, next), length: 2, isSchema: false };\n  }\n  return { path: [segment], child: value, length: 1, isSchema: false };\n}\n\nfunction stepAt(walk: LocationWalk, pointer: RefPointer, index: number): Step | null {\n  const { segments } = pointer;\n  const segment = segments[index] as string;\n  if (index < leadingSegmentsOf(pointer)) {\n    const child = childOf(walk.node, segment);\n    return { path: [segment], child, length: 1, isSchema: startsInSchema(pointer) };\n  }\n  return walk.isSchema\n    ? schemaStep(walk.node, segment, segments[index + 1])\n    : documentStep(walk, segments, index);\n}\n\nfunction refOf(node: unknown): string | null {\n  return isJsonObject(node) && typeof node.$ref === \"string\" ? node.$ref : null;\n}\n\n/**\n * The walk at a crossed `$ref`'s target, through `$ref`s to `$ref`s; null where the target has\n * no generated location. A cycle of `$ref`s has no node.\n */\nfunction crossed(\n  walk: LocationWalk,\n  ref: string,\n  refs: RefResolver,\n  seen: readonly string[],\n): LocationWalk | null {\n  if (seen.includes(ref)) {\n    return { ...walk, node: undefined };\n  }\n  const target = walkTo(ref, refs, seen);\n  const inner = refOf(target?.node);\n  return target === null || inner === null ? target : crossed(target, inner, refs, [...seen, ref]);\n}\n\nfunction walkTo(ref: string, refs: RefResolver, seen: readonly string[]): LocationWalk | null {\n  const pointer = refPointerOf(ref);\n  if (pointer === null || seen.includes(ref)) {\n    return null;\n  }\n  const root = pointer.rootSegment;\n  let walk: LocationWalk = {\n    path: [root],\n    node: refs.resolve(`#/${root}`),\n    isSchema: false,\n    isFromAdditionalProperties: false,\n  };\n  for (let index = 0; index < pointer.segments.length; ) {\n    const step = stepAt(walk, pointer, index);\n    if (step === null) {\n      return null;\n    }\n    index += step.length;\n    walk = {\n      path: [...walk.path, ...step.path],\n      node: step.child,\n      isSchema: step.isSchema,\n      isFromAdditionalProperties: step.isFromAdditionalProperties === true,\n    };\n    const inner = refOf(walk.node);\n    const target = inner !== null && index < pointer.segments.length;\n    const next = target ? crossed(walk, inner, refs, [...seen, ref]) : walk;\n    if (next === null) {\n      return null;\n    }\n    walk = next;\n  }\n  return walk;\n}\n\n/** The location the generator types the node at `ref` with; see the module comment. */\nexport function generatedLocationOf(ref: string, refs: RefResolver): GeneratedLocation {\n  const walk = walkTo(ref, refs, []);\n  return {\n    path: walk === null ? ref : createRef(walk.path),\n    isFromAdditionalProperties: walk?.isFromAdditionalProperties ?? false,\n  };\n}\n"],"names":["isJsonObject","leadingSegmentsOf","startsInSchema","refPointerOf","createRef"],"mappings":";;;;;;AA+CA,MAAM,qBAAA,uBAAiD,GAAA,CAAI;AAAA,EACzD,OAAA;AAAA,EACA,aAAA;AAAA,EACA;AACF,CAAC,CAAA;AAED,MAAM,qBAAA,uBAAiD,GAAA,CAAI;AAAA,EACzD,sBAAA;AAAA,EACA;AACF,CAAC,CAAA;AAED,MAAM,6BAAkC,IAAI,GAAA,CAAI,CAAC,OAAA,EAAS,OAAA,EAAS,OAAO,CAAC,CAAA;AAE3E,MAAM,2CAAgD,IAAI,GAAA,CAAI,CAAC,OAAA,EAAS,GAAG,qBAAqB,CAAC,CAAA;AACjG,MAAM,QAAA,GAAW,OAAA;AAEjB,SAAS,OAAA,CAAQ,MAAe,OAAA,EAAsC;AACpE,EAAA,OAAA,CAAQA,2BAAA,CAAa,IAAI,CAAA,IAAK,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,KAAM,OAAA,KAAY,MAAA,GAC7D,IAAA,CAA2C,OAAO,CAAA,GACnD,MAAA;AACN;AAEA,SAAS,QAAA,CAAS,KAAA,EAAgB,IAAA,EAA0B,IAAA,EAA+B;AACzF,EAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,OAAA,CAAQ,KAAA,EAAO,IAAI,CAAA,EAAG,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,IAAA,EAAK;AACxE;AAGA,SAAS,UAAA,CAAW,IAAA,EAAe,OAAA,EAAiB,IAAA,EAAuC;AACzF,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,IAAA,EAAM,OAAO,CAAA;AACnC,EAAA,MAAM,QAAQ,IAAA,KAAS,MAAA,GAAY,EAAC,GAAI,CAAC,IAAI,CAAA;AAC7C,EAAA,IAAI,YAAY,YAAA,EAAc;AAC5B,IAAA,OAAO,QAAA,CAAS,KAAA,EAAO,IAAA,EAAM,KAAK,CAAA;AAAA,EACpC;AACA,EAAA,IAAI,qBAAA,CAAsB,IAAI,OAAO,CAAA,IAAM,YAAY,OAAA,IAAW,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAI;AACvF,IAAA,OAAO,QAAA,CAAS,KAAA,EAAO,IAAA,EAAM,EAAE,CAAA;AAAA,EACjC;AACA,EAAA,IAAI,UAAA,CAAW,GAAA,CAAI,OAAO,CAAA,EAAG;AAC3B,IAAA,OAAO,SAAS,KAAA,EAAO,IAAA,EAAM,CAAC,OAAA,EAAS,GAAG,KAAK,CAAC,CAAA;AAAA,EAClD;AACA,EAAA,IAAI,CAAC,wBAAA,CAAyB,GAAA,CAAI,OAAO,CAAA,EAAG;AAC1C,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,aAAA,GAAgB,qBAAA,CAAsB,GAAA,CAAI,OAAO,CAAA;AACvD,EAAA,OAAO;AAAA,IACL,MAAM,EAAC;AAAA,IACP,KAAA,EAAO,KAAA;AAAA,IACP,MAAA,EAAQ,CAAA;AAAA,IACR,QAAA,EAAU,IAAA;AAAA,IACV,0BAAA,EAA4B;AAAA,GAC9B;AACF;AAGA,SAAS,WAAW,IAAA,EAAkC;AACpD,EAAA,MAAM,CAAC,IAAA,EAAM,OAAO,CAAA,GAAI,IAAA;AACxB,EAAA,OACG,IAAA,CAAK,MAAA,KAAW,CAAA,KAAM,IAAA,KAAS,OAAA,IAAW,IAAA,KAAS,UAAA,CAAA,IACnD,IAAA,CAAK,MAAA,KAAW,CAAA,IAAK,IAAA,KAAS,YAAA,IAAgB,OAAA,KAAY,WAAA;AAE/D;AAGA,SAAS,aAAA,CAAc,MAAoB,IAAA,EAAoB;AAC7D,EAAA,MAAM,QAAQ,OAAA,CAAQ,OAAA,CAAQ,KAAK,IAAA,EAAM,YAAY,GAAG,IAAI,CAAA;AAC5D,EAAA,MAAM,KAAA,GAAQA,2BAAA,CAAa,KAAK,CAAA,GAAI,CAAC,MAAA,CAAO,KAAA,CAAM,EAAE,CAAA,EAAG,MAAA,CAAO,KAAA,CAAM,IAAI,CAAC,IAAI,EAAC;AAC9E,EAAA,MAAM,MAAA,GAAS,WAAW,IAAA,CAAK,IAAI,IAAI,CAAC,YAAY,IAAI,EAAC;AACzD,EAAA,OAAO,EAAE,IAAA,EAAM,CAAC,GAAG,QAAQ,YAAA,EAAc,GAAG,KAAK,CAAA,EAAG,KAAA,EAAO,KAAA,EAAO,MAAA,EAAQ,CAAA,EAAG,UAAU,KAAA,EAAM;AAC/F;AAEA,SAAS,YAAA,CAAa,IAAA,EAAoB,QAAA,EAA6B,KAAA,EAAqB;AAC1F,EAAA,MAAM,OAAA,GAAU,SAAS,KAAK,CAAA;AAC9B,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,KAAA,GAAQ,CAAC,CAAA;AAC/B,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,IAAA,CAAK,IAAA,EAAM,OAAO,CAAA;AACxC,EAAA,IAAI,YAAY,QAAA,EAAU;AACxB,IAAA,OAAO,EAAE,MAAM,EAAC,EAAG,OAAO,KAAA,EAAO,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,IAAA,EAAK;AAAA,EAC7D;AACA,EAAA,IAAI,YAAY,YAAA,IAAgB,IAAA,KAAS,UAAa,QAAA,CAAS,IAAA,CAAK,IAAI,CAAA,EAAG;AACzE,IAAA,OAAO,aAAA,CAAc,MAAM,IAAI,CAAA;AAAA,EACjC;AAEA,EAAA,IAAI,YAAY,SAAA,IAAa,QAAA,CAAS,KAAA,GAAQ,CAAC,MAAM,SAAA,EAAW;AAC9D,IAAA,MAAM,OAAO,IAAA,KAAS,MAAA,GAAY,EAAC,GAAI,CAAC,IAAI,CAAA;AAC5C,IAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,OAAA,CAAQ,KAAA,EAAO,IAAI,CAAA,EAAG,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,KAAA,EAAM;AAAA,EACzE;AACA,EAAA,OAAO,EAAE,IAAA,EAAM,CAAC,OAAO,CAAA,EAAG,OAAO,KAAA,EAAO,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,KAAA,EAAM;AACrE;AAEA,SAAS,MAAA,CAAO,IAAA,EAAoB,OAAA,EAAqB,KAAA,EAA4B;AACnF,EAAA,MAAM,EAAE,UAAS,GAAI,OAAA;AACrB,EAAA,MAAM,OAAA,GAAU,SAAS,KAAK,CAAA;AAC9B,EAAA,IAAI,KAAA,GAAQC,6BAAA,CAAkB,OAAO,CAAA,EAAG;AACtC,IAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,IAAA,CAAK,IAAA,EAAM,OAAO,CAAA;AACxC,IAAA,OAAO,EAAE,IAAA,EAAM,CAAC,OAAO,CAAA,EAAG,KAAA,EAAO,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAUC,0BAAA,CAAe,OAAO,CAAA,EAAE;AAAA,EAChF;AACA,EAAA,OAAO,IAAA,CAAK,QAAA,GACR,UAAA,CAAW,IAAA,CAAK,MAAM,OAAA,EAAS,QAAA,CAAS,KAAA,GAAQ,CAAC,CAAC,CAAA,GAClD,YAAA,CAAa,IAAA,EAAM,UAAU,KAAK,CAAA;AACxC;AAEA,SAAS,MAAM,IAAA,EAA8B;AAC3C,EAAA,OAAOF,2BAAA,CAAa,IAAI,CAAA,IAAK,OAAO,KAAK,IAAA,KAAS,QAAA,GAAW,KAAK,IAAA,GAAO,IAAA;AAC3E;AAMA,SAAS,OAAA,CACP,IAAA,EACA,GAAA,EACA,IAAA,EACA,IAAA,EACqB;AACrB,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,GAAG,CAAA,EAAG;AACtB,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,IAAA,EAAM,MAAA,EAAU;AAAA,EACpC;AACA,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,GAAA,EAAK,IAAA,EAAM,IAAI,CAAA;AACrC,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,MAAA,EAAQ,IAAI,CAAA;AAChC,EAAA,OAAO,MAAA,KAAW,IAAA,IAAQ,KAAA,KAAU,IAAA,GAAO,MAAA,GAAS,OAAA,CAAQ,MAAA,EAAQ,KAAA,EAAO,IAAA,EAAM,CAAC,GAAG,IAAA,EAAM,GAAG,CAAC,CAAA;AACjG;AAEA,SAAS,MAAA,CAAO,GAAA,EAAa,IAAA,EAAmB,IAAA,EAA8C;AAC5F,EAAA,MAAM,OAAA,GAAUG,yBAAa,GAAG,CAAA;AAChC,EAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,IAAA,CAAK,QAAA,CAAS,GAAG,CAAA,EAAG;AAC1C,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAO,OAAA,CAAQ,WAAA;AACrB,EAAA,IAAI,IAAA,GAAqB;AAAA,IACvB,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,IAAA,EAAM,IAAA,CAAK,OAAA,CAAQ,CAAA,EAAA,EAAK,IAAI,CAAA,CAAE,CAAA;AAAA,IAC9B,QAAA,EAAU,KAAA;AAAA,IACV,0BAAA,EAA4B;AAAA,GAC9B;AACA,EAAA,KAAA,IAAS,KAAA,GAAQ,CAAA,EAAG,KAAA,GAAQ,OAAA,CAAQ,SAAS,MAAA,IAAU;AACrD,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,IAAA,EAAM,OAAA,EAAS,KAAK,CAAA;AACxC,IAAA,IAAI,SAAS,IAAA,EAAM;AACjB,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,KAAA,IAAS,IAAA,CAAK,MAAA;AACd,IAAA,IAAA,GAAO;AAAA,MACL,MAAM,CAAC,GAAG,KAAK,IAAA,EAAM,GAAG,KAAK,IAAI,CAAA;AAAA,MACjC,MAAM,IAAA,CAAK,KAAA;AAAA,MACX,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,0BAAA,EAA4B,KAAK,0BAAA,KAA+B;AAAA,KAClE;AACA,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AAC7B,IAAA,MAAM,MAAA,GAAS,KAAA,KAAU,IAAA,IAAQ,KAAA,GAAQ,QAAQ,QAAA,CAAS,MAAA;AAC1D,IAAA,MAAM,IAAA,GAAO,MAAA,GAAS,OAAA,CAAQ,IAAA,EAAM,KAAA,EAAO,IAAA,EAAM,CAAC,GAAG,IAAA,EAAM,GAAG,CAAC,CAAA,GAAI,IAAA;AACnE,IAAA,IAAI,SAAS,IAAA,EAAM;AACjB,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAA,GAAO,IAAA;AAAA,EACT;AACA,EAAA,OAAO,IAAA;AACT;AAGO,SAAS,mBAAA,CAAoB,KAAa,IAAA,EAAsC;AACrF,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,EAAK,IAAA,EAAM,EAAE,CAAA;AACjC,EAAA,OAAO;AAAA,IACL,MAAM,IAAA,KAAS,IAAA,GAAO,GAAA,GAAMC,qBAAA,CAAU,KAAK,IAAI,CAAA;AAAA,IAC/C,0BAAA,EAA4B,MAAM,0BAAA,IAA8B;AAAA,GAClE;AACF;;"}

package/dist/application/transform/ref-pointer/generated-location.mjs

@@ -0,0 +1,136 @@
+import { createRef } from '../../../domain/openapi/json-pointer.mjs';
+import { isJsonObject } from './generated-shape.mjs';
+import { refPointerOf, leadingSegmentsOf, startsInSchema } from './pointer-walk.mjs';
+
+const PARENT_LOCATION_PAIRS = /* @__PURE__ */ new Set([
+  "allOf",
+  "prefixItems",
+  "patternProperties"
+]);
+const RECORD_VALUE_KEYWORDS = /* @__PURE__ */ new Set([
+  "additionalProperties",
+  "unevaluatedProperties"
+]);
+const KEPT_PAIRS = /* @__PURE__ */ new Set(["anyOf", "oneOf", "$defs"]);
+const PARENT_LOCATION_KEYWORDS = /* @__PURE__ */ new Set(["items", ...RECORD_VALUE_KEYWORDS]);
+const INDEX_RE = /^\d+$/;
+function childOf(node, segment) {
+  return (isJsonObject(node) || Array.isArray(node)) && segment !== void 0 ? node[segment] : void 0;
+}
+function pairStep(value, next, path) {
+  return { path, child: childOf(value, next), length: 2, isSchema: true };
+}
+function schemaStep(node, segment, next) {
+  const value = childOf(node, segment);
+  const named = next === void 0 ? [] : [next];
+  if (segment === "properties") {
+    return pairStep(value, next, named);
+  }
+  if (PARENT_LOCATION_PAIRS.has(segment) || segment === "items" && Array.isArray(value)) {
+    return pairStep(value, next, []);
+  }
+  if (KEPT_PAIRS.has(segment)) {
+    return pairStep(value, next, [segment, ...named]);
+  }
+  if (!PARENT_LOCATION_KEYWORDS.has(segment)) {
+    return null;
+  }
+  const isRecordValue = RECORD_VALUE_KEYWORDS.has(segment);
+  return {
+    path: [],
+    child: value,
+    length: 1,
+    isSchema: true,
+    isFromAdditionalProperties: isRecordValue
+  };
+}
+function isPathItem(path) {
+  const [root, section] = path;
+  return path.length === 2 && (root === "paths" || root === "webhooks") || path.length === 3 && root === "components" && section === "pathItems";
+}
+function parameterStep(walk, next) {
+  const entry = childOf(childOf(walk.node, "parameters"), next);
+  const where = isJsonObject(entry) ? [String(entry.in), String(entry.name)] : [];
+  const prefix = isPathItem(walk.path) ? ["parameters"] : [];
+  return { path: [...prefix, "parameters", ...where], child: entry, length: 2, isSchema: false };
+}
+function documentStep(walk, segments, index) {
+  const segment = segments[index];
+  const next = segments[index + 1];
+  const value = childOf(walk.node, segment);
+  if (segment === "schema") {
+    return { path: [], child: value, length: 1, isSchema: true };
+  }
+  if (segment === "parameters" && next !== void 0 && INDEX_RE.test(next)) {
+    return parameterStep(walk, next);
+  }
+  if (segment === "content" && segments[index - 2] === "headers") {
+    const path = next === void 0 ? [] : [next];
+    return { path, child: childOf(value, next), length: 2, isSchema: false };
+  }
+  return { path: [segment], child: value, length: 1, isSchema: false };
+}
+function stepAt(walk, pointer, index) {
+  const { segments } = pointer;
+  const segment = segments[index];
+  if (index < leadingSegmentsOf(pointer)) {
+    const child = childOf(walk.node, segment);
+    return { path: [segment], child, length: 1, isSchema: startsInSchema(pointer) };
+  }
+  return walk.isSchema ? schemaStep(walk.node, segment, segments[index + 1]) : documentStep(walk, segments, index);
+}
+function refOf(node) {
+  return isJsonObject(node) && typeof node.$ref === "string" ? node.$ref : null;
+}
+function crossed(walk, ref, refs, seen) {
+  if (seen.includes(ref)) {
+    return { ...walk, node: void 0 };
+  }
+  const target = walkTo(ref, refs, seen);
+  const inner = refOf(target?.node);
+  return target === null || inner === null ? target : crossed(target, inner, refs, [...seen, ref]);
+}
+function walkTo(ref, refs, seen) {
+  const pointer = refPointerOf(ref);
+  if (pointer === null || seen.includes(ref)) {
+    return null;
+  }
+  const root = pointer.rootSegment;
+  let walk = {
+    path: [root],
+    node: refs.resolve(`#/${root}`),
+    isSchema: false,
+    isFromAdditionalProperties: false
+  };
+  for (let index = 0; index < pointer.segments.length; ) {
+    const step = stepAt(walk, pointer, index);
+    if (step === null) {
+      return null;
+    }
+    index += step.length;
+    walk = {
+      path: [...walk.path, ...step.path],
+      node: step.child,
+      isSchema: step.isSchema,
+      isFromAdditionalProperties: step.isFromAdditionalProperties === true
+    };
+    const inner = refOf(walk.node);
+    const target = inner !== null && index < pointer.segments.length;
+    const next = target ? crossed(walk, inner, refs, [...seen, ref]) : walk;
+    if (next === null) {
+      return null;
+    }
+    walk = next;
+  }
+  return walk;
+}
+function generatedLocationOf(ref, refs) {
+  const walk = walkTo(ref, refs, []);
+  return {
+    path: walk === null ? ref : createRef(walk.path),
+    isFromAdditionalProperties: walk?.isFromAdditionalProperties ?? false
+  };
+}
+
+export { generatedLocationOf };
+//# sourceMappingURL=generated-location.mjs.map

package/dist/application/transform/ref-pointer/generated-location.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"generated-location.mjs","sources":["../../../../src/application/transform/ref-pointer/generated-location.ts"],"sourcesContent":["import { createRef } from \"../../../domain/openapi/json-pointer.js\";\nimport type { RefResolver } from \"../schema/schema-context.js\";\nimport { isJsonObject } from \"./generated-shape.js\";\nimport {\n  leadingSegmentsOf,\n  type RefPointer,\n  refPointerOf,\n  startsInSchema,\n} from \"./pointer-walk.js\";\n\n/**\n * Where the generator types the node a `$ref` points at: the location path it passes down, which\n * also names the node's `--enum` declaration and `--enum-values` array. A target written inline\n * (ADR-026) is typed there, so it shares the generator's enum instead of declaring a second one\n * named after the pointer: two TypeScript enums with the same members are not assignable.\n *\n * The path follows the generator: `properties` is skipped; `allOf/N`, `items`, `prefixItems/N`,\n * `patternProperties/P` and `additionalProperties` type their schema at the parent's location;\n * the `schema` of a parameter, header or media type is typed at the container's; a positional\n * parameter is named by `in` and `name`. A `$ref` crossed on the way continues at its target's\n * location. A node under a schema keyword the generator does not type (`definitions/A`, `not`) is\n * typed nowhere else, so it keeps its pointer as its location.\n */\n\nexport interface GeneratedLocation {\n  readonly path: string;\n  /** The node is an `additionalProperties` value, as `transformNested` is told. */\n  readonly isFromAdditionalProperties: boolean;\n}\n\ninterface LocationWalk {\n  readonly path: readonly string[];\n  readonly node: unknown;\n  readonly isSchema: boolean;\n  readonly isFromAdditionalProperties: boolean;\n}\n\n/** One step: the segments it adds to the path, the node it moves to, the segments it reads. */\ninterface Step {\n  readonly path: readonly string[];\n  readonly child: unknown;\n  readonly length: 1 | 2;\n  readonly isSchema: boolean;\n  readonly isFromAdditionalProperties?: boolean;\n}\n\n/** Keywords followed by a name or position whose schema is typed at the parent's location. */\nconst PARENT_LOCATION_PAIRS: ReadonlySet<string> = new Set([\n  \"allOf\",\n  \"prefixItems\",\n  \"patternProperties\",\n]);\n/** Keywords whose schema is typed at the parent's location as a record value. */\nconst RECORD_VALUE_KEYWORDS: ReadonlySet<string> = new Set([\n  \"additionalProperties\",\n  \"unevaluatedProperties\",\n]);\n/** Keywords followed by a name or position that both stay in the location. */\nconst KEPT_PAIRS: ReadonlySet<string> = new Set([\"anyOf\", \"oneOf\", \"$defs\"]);\n/** The other schema keywords the generator types: at the parent's location. */\nconst PARENT_LOCATION_KEYWORDS: ReadonlySet<string> = new Set([\"items\", ...RECORD_VALUE_KEYWORDS]);\nconst INDEX_RE = /^\\d+$/;\n\nfunction childOf(node: unknown, segment: string | undefined): unknown {\n  return (isJsonObject(node) || Array.isArray(node)) && segment !== undefined\n    ? (node as Readonly<Record<string, unknown>>)[segment]\n    : undefined;\n}\n\nfunction pairStep(value: unknown, next: string | undefined, path: readonly string[]): Step {\n  return { path, child: childOf(value, next), length: 2, isSchema: true };\n}\n\n/** The step through a schema keyword; null for a keyword the generator does not type. */\nfunction schemaStep(node: unknown, segment: string, next: string | undefined): Step | null {\n  const value = childOf(node, segment);\n  const named = next === undefined ? [] : [next];\n  if (segment === \"properties\") {\n    return pairStep(value, next, named);\n  }\n  if (PARENT_LOCATION_PAIRS.has(segment) || (segment === \"items\" && Array.isArray(value))) {\n    return pairStep(value, next, []);\n  }\n  if (KEPT_PAIRS.has(segment)) {\n    return pairStep(value, next, [segment, ...named]);\n  }\n  if (!PARENT_LOCATION_KEYWORDS.has(segment)) {\n    return null;\n  }\n  const isRecordValue = RECORD_VALUE_KEYWORDS.has(segment);\n  return {\n    path: [],\n    child: value,\n    length: 1,\n    isSchema: true,\n    isFromAdditionalProperties: isRecordValue,\n  };\n}\n\n/** A path item's own parameters sit under one more `parameters` segment (`pathItemType`). */\nfunction isPathItem(path: readonly string[]): boolean {\n  const [root, section] = path;\n  return (\n    (path.length === 2 && (root === \"paths\" || root === \"webhooks\")) ||\n    (path.length === 3 && root === \"components\" && section === \"pathItems\")\n  );\n}\n\n/** `parameters/N`: the parameter is named by `in` and `name` (a `$ref` one is crossed later). */\nfunction parameterStep(walk: LocationWalk, next: string): Step {\n  const entry = childOf(childOf(walk.node, \"parameters\"), next);\n  const where = isJsonObject(entry) ? [String(entry.in), String(entry.name)] : [];\n  const prefix = isPathItem(walk.path) ? [\"parameters\"] : [];\n  return { path: [...prefix, \"parameters\", ...where], child: entry, length: 2, isSchema: false };\n}\n\nfunction documentStep(walk: LocationWalk, segments: readonly string[], index: number): Step {\n  const segment = segments[index] as string;\n  const next = segments[index + 1];\n  const value = childOf(walk.node, segment);\n  if (segment === \"schema\") {\n    return { path: [], child: value, length: 1, isSchema: true };\n  }\n  if (segment === \"parameters\" && next !== undefined && INDEX_RE.test(next)) {\n    return parameterStep(walk, next);\n  }\n  // A header's `content` entries are typed at `headers/<name>/<media type>` (`headerType`).\n  if (segment === \"content\" && segments[index - 2] === \"headers\") {\n    const path = next === undefined ? [] : [next];\n    return { path, child: childOf(value, next), length: 2, isSchema: false };\n  }\n  return { path: [segment], child: value, length: 1, isSchema: false };\n}\n\nfunction stepAt(walk: LocationWalk, pointer: RefPointer, index: number): Step | null {\n  const { segments } = pointer;\n  const segment = segments[index] as string;\n  if (index < leadingSegmentsOf(pointer)) {\n    const child = childOf(walk.node, segment);\n    return { path: [segment], child, length: 1, isSchema: startsInSchema(pointer) };\n  }\n  return walk.isSchema\n    ? schemaStep(walk.node, segment, segments[index + 1])\n    : documentStep(walk, segments, index);\n}\n\nfunction refOf(node: unknown): string | null {\n  return isJsonObject(node) && typeof node.$ref === \"string\" ? node.$ref : null;\n}\n\n/**\n * The walk at a crossed `$ref`'s target, through `$ref`s to `$ref`s; null where the target has\n * no generated location. A cycle of `$ref`s has no node.\n */\nfunction crossed(\n  walk: LocationWalk,\n  ref: string,\n  refs: RefResolver,\n  seen: readonly string[],\n): LocationWalk | null {\n  if (seen.includes(ref)) {\n    return { ...walk, node: undefined };\n  }\n  const target = walkTo(ref, refs, seen);\n  const inner = refOf(target?.node);\n  return target === null || inner === null ? target : crossed(target, inner, refs, [...seen, ref]);\n}\n\nfunction walkTo(ref: string, refs: RefResolver, seen: readonly string[]): LocationWalk | null {\n  const pointer = refPointerOf(ref);\n  if (pointer === null || seen.includes(ref)) {\n    return null;\n  }\n  const root = pointer.rootSegment;\n  let walk: LocationWalk = {\n    path: [root],\n    node: refs.resolve(`#/${root}`),\n    isSchema: false,\n    isFromAdditionalProperties: false,\n  };\n  for (let index = 0; index < pointer.segments.length; ) {\n    const step = stepAt(walk, pointer, index);\n    if (step === null) {\n      return null;\n    }\n    index += step.length;\n    walk = {\n      path: [...walk.path, ...step.path],\n      node: step.child,\n      isSchema: step.isSchema,\n      isFromAdditionalProperties: step.isFromAdditionalProperties === true,\n    };\n    const inner = refOf(walk.node);\n    const target = inner !== null && index < pointer.segments.length;\n    const next = target ? crossed(walk, inner, refs, [...seen, ref]) : walk;\n    if (next === null) {\n      return null;\n    }\n    walk = next;\n  }\n  return walk;\n}\n\n/** The location the generator types the node at `ref` with; see the module comment. */\nexport function generatedLocationOf(ref: string, refs: RefResolver): GeneratedLocation {\n  const walk = walkTo(ref, refs, []);\n  return {\n    path: walk === null ? ref : createRef(walk.path),\n    isFromAdditionalProperties: walk?.isFromAdditionalProperties ?? false,\n  };\n}\n"],"names":[],"mappings":";;;;AA+CA,MAAM,qBAAA,uBAAiD,GAAA,CAAI;AAAA,EACzD,OAAA;AAAA,EACA,aAAA;AAAA,EACA;AACF,CAAC,CAAA;AAED,MAAM,qBAAA,uBAAiD,GAAA,CAAI;AAAA,EACzD,sBAAA;AAAA,EACA;AACF,CAAC,CAAA;AAED,MAAM,6BAAkC,IAAI,GAAA,CAAI,CAAC,OAAA,EAAS,OAAA,EAAS,OAAO,CAAC,CAAA;AAE3E,MAAM,2CAAgD,IAAI,GAAA,CAAI,CAAC,OAAA,EAAS,GAAG,qBAAqB,CAAC,CAAA;AACjG,MAAM,QAAA,GAAW,OAAA;AAEjB,SAAS,OAAA,CAAQ,MAAe,OAAA,EAAsC;AACpE,EAAA,OAAA,CAAQ,YAAA,CAAa,IAAI,CAAA,IAAK,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,KAAM,OAAA,KAAY,MAAA,GAC7D,IAAA,CAA2C,OAAO,CAAA,GACnD,MAAA;AACN;AAEA,SAAS,QAAA,CAAS,KAAA,EAAgB,IAAA,EAA0B,IAAA,EAA+B;AACzF,EAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,OAAA,CAAQ,KAAA,EAAO,IAAI,CAAA,EAAG,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,IAAA,EAAK;AACxE;AAGA,SAAS,UAAA,CAAW,IAAA,EAAe,OAAA,EAAiB,IAAA,EAAuC;AACzF,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,IAAA,EAAM,OAAO,CAAA;AACnC,EAAA,MAAM,QAAQ,IAAA,KAAS,MAAA,GAAY,EAAC,GAAI,CAAC,IAAI,CAAA;AAC7C,EAAA,IAAI,YAAY,YAAA,EAAc;AAC5B,IAAA,OAAO,QAAA,CAAS,KAAA,EAAO,IAAA,EAAM,KAAK,CAAA;AAAA,EACpC;AACA,EAAA,IAAI,qBAAA,CAAsB,IAAI,OAAO,CAAA,IAAM,YAAY,OAAA,IAAW,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAI;AACvF,IAAA,OAAO,QAAA,CAAS,KAAA,EAAO,IAAA,EAAM,EAAE,CAAA;AAAA,EACjC;AACA,EAAA,IAAI,UAAA,CAAW,GAAA,CAAI,OAAO,CAAA,EAAG;AAC3B,IAAA,OAAO,SAAS,KAAA,EAAO,IAAA,EAAM,CAAC,OAAA,EAAS,GAAG,KAAK,CAAC,CAAA;AAAA,EAClD;AACA,EAAA,IAAI,CAAC,wBAAA,CAAyB,GAAA,CAAI,OAAO,CAAA,EAAG;AAC1C,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,aAAA,GAAgB,qBAAA,CAAsB,GAAA,CAAI,OAAO,CAAA;AACvD,EAAA,OAAO;AAAA,IACL,MAAM,EAAC;AAAA,IACP,KAAA,EAAO,KAAA;AAAA,IACP,MAAA,EAAQ,CAAA;AAAA,IACR,QAAA,EAAU,IAAA;AAAA,IACV,0BAAA,EAA4B;AAAA,GAC9B;AACF;AAGA,SAAS,WAAW,IAAA,EAAkC;AACpD,EAAA,MAAM,CAAC,IAAA,EAAM,OAAO,CAAA,GAAI,IAAA;AACxB,EAAA,OACG,IAAA,CAAK,MAAA,KAAW,CAAA,KAAM,IAAA,KAAS,OAAA,IAAW,IAAA,KAAS,UAAA,CAAA,IACnD,IAAA,CAAK,MAAA,KAAW,CAAA,IAAK,IAAA,KAAS,YAAA,IAAgB,OAAA,KAAY,WAAA;AAE/D;AAGA,SAAS,aAAA,CAAc,MAAoB,IAAA,EAAoB;AAC7D,EAAA,MAAM,QAAQ,OAAA,CAAQ,OAAA,CAAQ,KAAK,IAAA,EAAM,YAAY,GAAG,IAAI,CAAA;AAC5D,EAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,KAAK,CAAA,GAAI,CAAC,MAAA,CAAO,KAAA,CAAM,EAAE,CAAA,EAAG,MAAA,CAAO,KAAA,CAAM,IAAI,CAAC,IAAI,EAAC;AAC9E,EAAA,MAAM,MAAA,GAAS,WAAW,IAAA,CAAK,IAAI,IAAI,CAAC,YAAY,IAAI,EAAC;AACzD,EAAA,OAAO,EAAE,IAAA,EAAM,CAAC,GAAG,QAAQ,YAAA,EAAc,GAAG,KAAK,CAAA,EAAG,KAAA,EAAO,KAAA,EAAO,MAAA,EAAQ,CAAA,EAAG,UAAU,KAAA,EAAM;AAC/F;AAEA,SAAS,YAAA,CAAa,IAAA,EAAoB,QAAA,EAA6B,KAAA,EAAqB;AAC1F,EAAA,MAAM,OAAA,GAAU,SAAS,KAAK,CAAA;AAC9B,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,KAAA,GAAQ,CAAC,CAAA;AAC/B,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,IAAA,CAAK,IAAA,EAAM,OAAO,CAAA;AACxC,EAAA,IAAI,YAAY,QAAA,EAAU;AACxB,IAAA,OAAO,EAAE,MAAM,EAAC,EAAG,OAAO,KAAA,EAAO,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,IAAA,EAAK;AAAA,EAC7D;AACA,EAAA,IAAI,YAAY,YAAA,IAAgB,IAAA,KAAS,UAAa,QAAA,CAAS,IAAA,CAAK,IAAI,CAAA,EAAG;AACzE,IAAA,OAAO,aAAA,CAAc,MAAM,IAAI,CAAA;AAAA,EACjC;AAEA,EAAA,IAAI,YAAY,SAAA,IAAa,QAAA,CAAS,KAAA,GAAQ,CAAC,MAAM,SAAA,EAAW;AAC9D,IAAA,MAAM,OAAO,IAAA,KAAS,MAAA,GAAY,EAAC,GAAI,CAAC,IAAI,CAAA;AAC5C,IAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,OAAA,CAAQ,KAAA,EAAO,IAAI,CAAA,EAAG,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,KAAA,EAAM;AAAA,EACzE;AACA,EAAA,OAAO,EAAE,IAAA,EAAM,CAAC,OAAO,CAAA,EAAG,OAAO,KAAA,EAAO,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,KAAA,EAAM;AACrE;AAEA,SAAS,MAAA,CAAO,IAAA,EAAoB,OAAA,EAAqB,KAAA,EAA4B;AACnF,EAAA,MAAM,EAAE,UAAS,GAAI,OAAA;AACrB,EAAA,MAAM,OAAA,GAAU,SAAS,KAAK,CAAA;AAC9B,EAAA,IAAI,KAAA,GAAQ,iBAAA,CAAkB,OAAO,CAAA,EAAG;AACtC,IAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,IAAA,CAAK,IAAA,EAAM,OAAO,CAAA;AACxC,IAAA,OAAO,EAAE,IAAA,EAAM,CAAC,OAAO,CAAA,EAAG,KAAA,EAAO,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,cAAA,CAAe,OAAO,CAAA,EAAE;AAAA,EAChF;AACA,EAAA,OAAO,IAAA,CAAK,QAAA,GACR,UAAA,CAAW,IAAA,CAAK,MAAM,OAAA,EAAS,QAAA,CAAS,KAAA,GAAQ,CAAC,CAAC,CAAA,GAClD,YAAA,CAAa,IAAA,EAAM,UAAU,KAAK,CAAA;AACxC;AAEA,SAAS,MAAM,IAAA,EAA8B;AAC3C,EAAA,OAAO,YAAA,CAAa,IAAI,CAAA,IAAK,OAAO,KAAK,IAAA,KAAS,QAAA,GAAW,KAAK,IAAA,GAAO,IAAA;AAC3E;AAMA,SAAS,OAAA,CACP,IAAA,EACA,GAAA,EACA,IAAA,EACA,IAAA,EACqB;AACrB,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,GAAG,CAAA,EAAG;AACtB,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,IAAA,EAAM,MAAA,EAAU;AAAA,EACpC;AACA,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,GAAA,EAAK,IAAA,EAAM,IAAI,CAAA;AACrC,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,MAAA,EAAQ,IAAI,CAAA;AAChC,EAAA,OAAO,MAAA,KAAW,IAAA,IAAQ,KAAA,KAAU,IAAA,GAAO,MAAA,GAAS,OAAA,CAAQ,MAAA,EAAQ,KAAA,EAAO,IAAA,EAAM,CAAC,GAAG,IAAA,EAAM,GAAG,CAAC,CAAA;AACjG;AAEA,SAAS,MAAA,CAAO,GAAA,EAAa,IAAA,EAAmB,IAAA,EAA8C;AAC5F,EAAA,MAAM,OAAA,GAAU,aAAa,GAAG,CAAA;AAChC,EAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,IAAA,CAAK,QAAA,CAAS,GAAG,CAAA,EAAG;AAC1C,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAO,OAAA,CAAQ,WAAA;AACrB,EAAA,IAAI,IAAA,GAAqB;AAAA,IACvB,IAAA,EAAM,CAAC,IAAI,CAAA;AAAA,IACX,IAAA,EAAM,IAAA,CAAK,OAAA,CAAQ,CAAA,EAAA,EAAK,IAAI,CAAA,CAAE,CAAA;AAAA,IAC9B,QAAA,EAAU,KAAA;AAAA,IACV,0BAAA,EAA4B;AAAA,GAC9B;AACA,EAAA,KAAA,IAAS,KAAA,GAAQ,CAAA,EAAG,KAAA,GAAQ,OAAA,CAAQ,SAAS,MAAA,IAAU;AACrD,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,IAAA,EAAM,OAAA,EAAS,KAAK,CAAA;AACxC,IAAA,IAAI,SAAS,IAAA,EAAM;AACjB,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,KAAA,IAAS,IAAA,CAAK,MAAA;AACd,IAAA,IAAA,GAAO;AAAA,MACL,MAAM,CAAC,GAAG,KAAK,IAAA,EAAM,GAAG,KAAK,IAAI,CAAA;AAAA,MACjC,MAAM,IAAA,CAAK,KAAA;AAAA,MACX,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,0BAAA,EAA4B,KAAK,0BAAA,KAA+B;AAAA,KAClE;AACA,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AAC7B,IAAA,MAAM,MAAA,GAAS,KAAA,KAAU,IAAA,IAAQ,KAAA,GAAQ,QAAQ,QAAA,CAAS,MAAA;AAC1D,IAAA,MAAM,IAAA,GAAO,MAAA,GAAS,OAAA,CAAQ,IAAA,EAAM,KAAA,EAAO,IAAA,EAAM,CAAC,GAAG,IAAA,EAAM,GAAG,CAAC,CAAA,GAAI,IAAA;AACnE,IAAA,IAAI,SAAS,IAAA,EAAM;AACjB,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAA,GAAO,IAAA;AAAA,EACT;AACA,EAAA,OAAO,IAAA;AACT;AAGO,SAAS,mBAAA,CAAoB,KAAa,IAAA,EAAsC;AACrF,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,EAAK,IAAA,EAAM,EAAE,CAAA;AACjC,EAAA,OAAO;AAAA,IACL,MAAM,IAAA,KAAS,IAAA,GAAO,GAAA,GAAM,SAAA,CAAU,KAAK,IAAI,CAAA;AAAA,IAC/C,0BAAA,EAA4B,MAAM,0BAAA,IAA8B;AAAA,GAClE;AACF;;"}

package/dist/application/transform/ref-pointer/generated-shape.cjs

@@ -0,0 +1,171 @@
+'use strict';
+
+const binaryContent = require('../../../domain/openapi/binary-content.cjs');
+
+const OPAQUE_KEYS = ["not", "enum", "const", "$ref"];
+const MAX_DEPTH = 8;
+const INDEX_RE = /^\d+$/;
+const MISSING = { kind: "missing" };
+const OPAQUE = { kind: "opaque" };
+function isJsonObject(value) {
+  return typeof value === "object" && value !== null && !Array.isArray(value);
+}
+function followRefs(node, refs) {
+  return isJsonObject(node) && typeof node.$ref === "string" ? refs.resolve(node.$ref) : node;
+}
+function isNullableSchema(node) {
+  if (!isJsonObject(node)) {
+    return false;
+  }
+  return node.nullable === true || Array.isArray(node.type) && node.type.includes("null");
+}
+function typeNames(node) {
+  return Array.isArray(node.type) ? node.type : [node.type];
+}
+function isObjectShape(node) {
+  if (typeof node.type === "string") {
+    return node.type === "object";
+  }
+  return typeNames(node).includes("object") || "properties" in node || "additionalProperties" in node || "patternProperties" in node;
+}
+function isArrayShape(node) {
+  if (typeof node.type === "string") {
+    return node.type === "array";
+  }
+  return typeNames(node).includes("array") || "items" in node;
+}
+function hasObjectKeywords(node) {
+  const hasProperties = isJsonObject(node.properties) && Object.keys(node.properties).length > 0;
+  return hasProperties || Boolean(node.additionalProperties || node.patternProperties || node.$defs);
+}
+function emptyObjectMember(node, options) {
+  return node.type !== void 0 && !options.emptyObjectsUnknown ? OPAQUE : MISSING;
+}
+function isBuiltInMember(key, prototype) {
+  return key in prototype;
+}
+function indexMember(node, options) {
+  const { additionalProperties: values, patternProperties: patterns } = node;
+  if (isJsonObject(patterns) && Object.keys(patterns).length > 0) {
+    return OPAQUE;
+  }
+  if (isJsonObject(values) && Object.keys(values).length > 0) {
+    return { kind: "index", node: values };
+  }
+  const isImplicit = values === true || isJsonObject(values) && Object.keys(values).length === 0;
+  return isImplicit || !values && options.additionalProperties ? { kind: "index", node: void 0 } : null;
+}
+function isOptionalProperty(node, key, options) {
+  const required = Array.isArray(node.required) ? node.required : void 0;
+  const property = node.properties[key];
+  const hasDefault = isJsonObject(property) && property.default !== void 0;
+  const isRequired = required?.includes(key) === true || required === void 0 && options.propertiesRequiredByDefault || hasDefault && options.defaultNonNullable;
+  return !isRequired;
+}
+function objectMember(node, key, options) {
+  const properties = isJsonObject(node.properties) ? node.properties : {};
+  if (Object.hasOwn(properties, key)) {
+    const property = properties[key];
+    const isExcluded = options.excludeDeprecated && isJsonObject(property) && property.deprecated;
+    return isExcluded || isJsonObject(node.discriminator) ? OPAQUE : { kind: "property", node: property, isOptional: isOptionalProperty(node, key, options) };
+  }
+  const isUnknownShape = isJsonObject(node.discriminator) || node.unevaluatedProperties !== void 0;
+  if (isBuiltInMember(key, {}) || key === "$defs" || isUnknownShape) {
+    return OPAQUE;
+  }
+  return hasObjectKeywords(node) ? indexMember(node, options) ?? MISSING : emptyObjectMember(node, options);
+}
+function schemaPresence(schema, refs) {
+  return isNullableSchema(followRefs(schema, refs)) ? "absent" : "present";
+}
+function propertyPresence(schema, key, options, refs) {
+  const node = followRefs(schema, refs);
+  const properties = isJsonObject(node) && isJsonObject(node.properties) ? node.properties : {};
+  if (!isJsonObject(node) || !Object.hasOwn(properties, key)) {
+    return "unknown";
+  }
+  return isOptionalProperty(node, key, options) ? "absent" : schemaPresence(properties[key], refs);
+}
+function membersOf(node, keyword) {
+  const members = node[keyword];
+  return Array.isArray(members) ? members : [];
+}
+function withoutComposition(node) {
+  const { allOf: _allOf, anyOf: _anyOf, oneOf: _oneOf, ...own } = node;
+  return own;
+}
+function hasOwnObjectType(own) {
+  return isObjectShape(own) && (hasObjectKeywords(own) || isJsonObject(own.discriminator));
+}
+function composedMember(node, key, input) {
+  const variants = [...membersOf(node, "anyOf"), ...membersOf(node, "oneOf")];
+  const own = withoutComposition(node);
+  const hasOwn = hasOwnObjectType(own);
+  if (variants.length > 0) {
+    const isAlone = membersOf(node, "allOf").length === 0 && !hasOwn;
+    const members = variants.map((variant) => memberAt(variant, key, input));
+    return isAlone && members.some((member) => member.kind === "missing") ? MISSING : OPAQUE;
+  }
+  const parts = [...membersOf(node, "allOf"), ...hasOwn ? [own] : []];
+  return intersectionMember(parts.map((part) => memberAt(part, key, input)));
+}
+function isUnknownIndex(member) {
+  return member.kind === "index" && member.node === void 0;
+}
+function intersectionMember(members) {
+  const found = members.filter((member) => member.kind !== "missing");
+  const typed = found.filter((member) => !isUnknownIndex(member));
+  const [only] = typed;
+  if (only === void 0) {
+    return found[0] ?? MISSING;
+  }
+  return typed.length === 1 && only.kind !== "opaque" ? only : OPAQUE;
+}
+function memberAt(schema, key, input) {
+  const node = followRefs(schema, input.refs);
+  if (!isJsonObject(node) || OPAQUE_KEYS.some((name) => name in node) || input.depth > MAX_DEPTH) {
+    return OPAQUE;
+  }
+  if (isNullableSchema(node)) {
+    return isObjectShape(node) || isArrayShape(node) ? MISSING : OPAQUE;
+  }
+  if (input.options.readWriteMarkers) {
+    return OPAQUE;
+  }
+  if ("allOf" in node || "anyOf" in node || "oneOf" in node) {
+    return composedMember(node, key, { ...input, depth: input.depth + 1 });
+  }
+  if (isObjectShape(node)) {
+    return objectMember(node, key, input.options);
+  }
+  if (isArrayShape(node)) {
+    return INDEX_RE.test(key) || isBuiltInMember(key, []) ? OPAQUE : MISSING;
+  }
+  return input.options.binaryAsBlob && binaryContent.isRawBinarySchema(node) ? OPAQUE : primitiveMember(node, key);
+}
+const PRIMITIVE_PROTOTYPES = {
+  string: String.prototype,
+  number: Number.prototype,
+  integer: Number.prototype,
+  boolean: Boolean.prototype
+};
+function primitiveMember(node, key) {
+  if (node.type === void 0) {
+    return hasObjectKeywords(node) ? OPAQUE : MISSING;
+  }
+  const prototype = typeof node.type === "string" ? PRIMITIVE_PROTOTYPES[node.type] : void 0;
+  return prototype !== void 0 && !isBuiltInMember(key, prototype) ? MISSING : OPAQUE;
+}
+function generatedMember(schema, key, options, refs) {
+  return memberAt(schema, key, { options, refs, depth: 0 });
+}
+
+exports.followRefs = followRefs;
+exports.generatedMember = generatedMember;
+exports.isArrayShape = isArrayShape;
+exports.isJsonObject = isJsonObject;
+exports.isNullableSchema = isNullableSchema;
+exports.isObjectShape = isObjectShape;
+exports.propertyPresence = propertyPresence;
+exports.schemaPresence = schemaPresence;
+//# sourceMappingURL=generated-shape.cjs.map

package/dist/application/transform/ref-pointer/generated-shape.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"generated-shape.cjs","sources":["../../../../src/application/transform/ref-pointer/generated-shape.ts"],"sourcesContent":["import { isRawBinarySchema } from \"../../../domain/openapi/binary-content.js\";\nimport type { RefResolver, SchemaOptions } from \"../schema/schema-context.js\";\n\n/**\n * What the generated type of a schema has under a key, read from the schema itself. It answers the\n * question TypeScript answers when it checks `T[\"key\"]`, for the schema shapes where the answer is\n * sure; for every other shape it says `opaque`, so a caller never assumes an error that is not.\n */\n\nexport type GeneratedMember =\n  | { readonly kind: \"property\"; readonly node: unknown; readonly isOptional: boolean }\n  /** An index signature; `node` is undefined when its value type is `unknown`. */\n  | { readonly kind: \"index\"; readonly node: unknown }\n  | { readonly kind: \"missing\" }\n  | { readonly kind: \"opaque\" };\n\ntype JsonObject = Readonly<Record<string, unknown>>;\n\nconst OPAQUE_KEYS = [\"not\", \"enum\", \"const\", \"$ref\"] as const;\n/** How deep `allOf`/`anyOf`/`oneOf` members are read; deeper shapes count as opaque. */\nconst MAX_DEPTH = 8;\nconst INDEX_RE = /^\\d+$/;\nconst MISSING: GeneratedMember = { kind: \"missing\" };\nconst OPAQUE: GeneratedMember = { kind: \"opaque\" };\n\nexport function isJsonObject(value: unknown): value is JsonObject {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\n/** The schema a node stands for: a `$ref` is followed to its target. */\nexport function followRefs(node: unknown, refs: RefResolver): unknown {\n  return isJsonObject(node) && typeof node.$ref === \"string\" ? refs.resolve(node.$ref) : node;\n}\n\n/** `nullable: true` or a `type` list with `null`: the generated type includes `null`. */\nexport function isNullableSchema(node: unknown): boolean {\n  if (!isJsonObject(node)) {\n    return false;\n  }\n  return node.nullable === true || (Array.isArray(node.type) && node.type.includes(\"null\"));\n}\n\nfunction typeNames(node: JsonObject): readonly unknown[] {\n  return Array.isArray(node.type) ? node.type : [node.type];\n}\n\n/**\n * Whether the generated type is an object. One `type` name decides alone: `type: string` with\n * `properties` or `items` is `string`, as `coreType` matches the `type` before the keywords.\n */\nexport function isObjectShape(node: JsonObject): boolean {\n  if (typeof node.type === \"string\") {\n    return node.type === \"object\";\n  }\n  return (\n    typeNames(node).includes(\"object\") ||\n    \"properties\" in node ||\n    \"additionalProperties\" in node ||\n    \"patternProperties\" in node\n  );\n}\n\n/** Whether the generated type is an array; one `type` name decides alone (`isObjectShape`). */\nexport function isArrayShape(node: JsonObject): boolean {\n  if (typeof node.type === \"string\") {\n    return node.type === \"array\";\n  }\n  return typeNames(node).includes(\"array\") || \"items\" in node;\n}\n\n/** Whether `objectType` writes a type for the schema; the same test as there. */\nfunction hasObjectKeywords(node: JsonObject): boolean {\n  const hasProperties = isJsonObject(node.properties) && Object.keys(node.properties).length > 0;\n  return (\n    hasProperties || Boolean(node.additionalProperties || node.patternProperties || node.$defs)\n  );\n}\n\n/**\n * A key of an object schema without object keywords. With a `type` it is `Record<string, never>`:\n * every key is `never`, and so is every key after it (or `unknown` with `--empty-objects-unknown`,\n * which has no key). Without a `type` it is `unknown`.\n */\nfunction emptyObjectMember(node: JsonObject, options: SchemaOptions): GeneratedMember {\n  return node.type !== undefined && !options.emptyObjectsUnknown ? OPAQUE : MISSING;\n}\n\n/** Whether a key the object has no property for is still a member: `toString`, `length`, `0`. */\nfunction isBuiltInMember(key: string, prototype: object): boolean {\n  return key in prototype;\n}\n\nfunction indexMember(node: JsonObject, options: SchemaOptions): GeneratedMember | null {\n  const { additionalProperties: values, patternProperties: patterns } = node;\n  if (isJsonObject(patterns) && Object.keys(patterns).length > 0) {\n    return OPAQUE;\n  }\n  if (isJsonObject(values) && Object.keys(values).length > 0) {\n    return { kind: \"index\", node: values };\n  }\n  const isImplicit = values === true || (isJsonObject(values) && Object.keys(values).length === 0);\n  return isImplicit || (!values && options.additionalProperties)\n    ? { kind: \"index\", node: undefined }\n    : null;\n}\n\nfunction isOptionalProperty(node: JsonObject, key: string, options: SchemaOptions): boolean {\n  const required = Array.isArray(node.required) ? node.required : undefined;\n  const property = (node.properties as JsonObject)[key];\n  const hasDefault = isJsonObject(property) && property.default !== undefined;\n  const isRequired =\n    required?.includes(key) === true ||\n    (required === undefined && options.propertiesRequiredByDefault) ||\n    (hasDefault && options.defaultNonNullable);\n  return !isRequired;\n}\n\nfunction objectMember(node: JsonObject, key: string, options: SchemaOptions): GeneratedMember {\n  const properties = isJsonObject(node.properties) ? node.properties : {};\n  if (Object.hasOwn(properties, key)) {\n    const property = properties[key];\n    const isExcluded = options.excludeDeprecated && isJsonObject(property) && property.deprecated;\n    return isExcluded || isJsonObject(node.discriminator)\n      ? OPAQUE\n      : { kind: \"property\", node: property, isOptional: isOptionalProperty(node, key, options) };\n  }\n  // `unevaluatedProperties` adds an index signature with its fix, so it counts as opaque too.\n  const isUnknownShape =\n    isJsonObject(node.discriminator) || node.unevaluatedProperties !== undefined;\n  if (isBuiltInMember(key, {}) || key === \"$defs\" || isUnknownShape) {\n    return OPAQUE;\n  }\n  return hasObjectKeywords(node)\n    ? (indexMember(node, options) ?? MISSING)\n    : emptyObjectMember(node, options);\n}\n\n/** Whether a value is there: `present`, `absent` (may be `undefined` or `null`) or `unknown`. */\nexport type Presence = \"present\" | \"absent\" | \"unknown\";\n\n/** The presence of a value of `schema` itself: `absent` when its type includes `null`. */\nexport function schemaPresence(schema: unknown, refs: RefResolver): Presence {\n  return isNullableSchema(followRefs(schema, refs)) ? \"absent\" : \"present\";\n}\n\n/** The presence of property `key` of `schema`: optional or nullable is `absent`. */\nexport function propertyPresence(\n  schema: unknown,\n  key: string,\n  options: SchemaOptions,\n  refs: RefResolver,\n): Presence {\n  const node = followRefs(schema, refs);\n  const properties = isJsonObject(node) && isJsonObject(node.properties) ? node.properties : {};\n  if (!isJsonObject(node) || !Object.hasOwn(properties, key)) {\n    return \"unknown\";\n  }\n  return isOptionalProperty(node, key, options) ? \"absent\" : schemaPresence(properties[key], refs);\n}\n\nfunction membersOf(node: JsonObject, keyword: string): readonly unknown[] {\n  const members = node[keyword];\n  return Array.isArray(members) ? members : [];\n}\n\nfunction withoutComposition(node: JsonObject): JsonObject {\n  const { allOf: _allOf, anyOf: _anyOf, oneOf: _oneOf, ...own } = node;\n  return own;\n}\n\n/** Own keywords without an object type of their own (`properties: {}`) add no part. */\nfunction hasOwnObjectType(own: JsonObject): boolean {\n  return isObjectShape(own) && (hasObjectKeywords(own) || isJsonObject(own.discriminator));\n}\n\n/**\n * `allOf` with own keywords is an intersection (`intersectionMember`).\n * `anyOf` or `oneOf` alone is a union: a key is missing if one member misses it. A mix of both\n * is written in more than one way (`anyof-properties`), so it counts as opaque.\n */\nfunction composedMember(node: JsonObject, key: string, input: MemberInput): GeneratedMember {\n  const variants = [...membersOf(node, \"anyOf\"), ...membersOf(node, \"oneOf\")];\n  const own = withoutComposition(node);\n  const hasOwn = hasOwnObjectType(own);\n  if (variants.length > 0) {\n    const isAlone = membersOf(node, \"allOf\").length === 0 && !hasOwn;\n    const members = variants.map((variant) => memberAt(variant, key, input));\n    return isAlone && members.some((member) => member.kind === \"missing\") ? MISSING : OPAQUE;\n  }\n  const parts = [...membersOf(node, \"allOf\"), ...(hasOwn ? [own] : [])];\n  return intersectionMember(parts.map((part) => memberAt(part, key, input)));\n}\n\nfunction isUnknownIndex(member: GeneratedMember): boolean {\n  return member.kind === \"index\" && member.node === undefined;\n}\n\n/**\n * A key of an intersection: missing if every part misses it; the part's member if only one part\n * has it (`A & B` where `B` has no such key and no index signature); else opaque. A part's\n * `[key: string]: unknown` adds nothing (`unknown & T` is `T`), and only such parts give `unknown`.\n */\nfunction intersectionMember(members: readonly GeneratedMember[]): GeneratedMember {\n  const found = members.filter((member) => member.kind !== \"missing\");\n  const typed = found.filter((member) => !isUnknownIndex(member));\n  const [only] = typed;\n  if (only === undefined) {\n    return found[0] ?? MISSING;\n  }\n  return typed.length === 1 && only.kind !== \"opaque\" ? only : OPAQUE;\n}\n\ninterface MemberInput {\n  readonly options: SchemaOptions;\n  readonly refs: RefResolver;\n  readonly depth: number;\n}\n\nfunction memberAt(schema: unknown, key: string, input: MemberInput): GeneratedMember {\n  const node = followRefs(schema, input.refs);\n  if (!isJsonObject(node) || OPAQUE_KEYS.some((name) => name in node) || input.depth > MAX_DEPTH) {\n    return OPAQUE;\n  }\n  if (isNullableSchema(node)) {\n    // Every key of `T | null` is an error, unless `T` is unknown (then the type is `unknown`).\n    return isObjectShape(node) || isArrayShape(node) ? MISSING : OPAQUE;\n  }\n  if (input.options.readWriteMarkers) {\n    return OPAQUE;\n  }\n  if (\"allOf\" in node || \"anyOf\" in node || \"oneOf\" in node) {\n    return composedMember(node, key, { ...input, depth: input.depth + 1 });\n  }\n  if (isObjectShape(node)) {\n    return objectMember(node, key, input.options);\n  }\n  if (isArrayShape(node)) {\n    return INDEX_RE.test(key) || isBuiltInMember(key, []) ? OPAQUE : MISSING;\n  }\n  // `--binary-as-blob` types raw binary strings as `Blob`, which has members of its own.\n  return input.options.binaryAsBlob && isRawBinarySchema(node as never)\n    ? OPAQUE\n    : primitiveMember(node, key);\n}\n\n/** The JavaScript value whose members a primitive `type` has: `\"\".length`, `(0).toFixed`. */\nconst PRIMITIVE_PROTOTYPES: Readonly<Record<string, object>> = {\n  string: String.prototype,\n  number: Number.prototype,\n  integer: Number.prototype,\n  boolean: Boolean.prototype,\n};\n\n/**\n * A key of a schema with one primitive `type`: missing unless the primitive has it. Object and\n * array keywords next to that `type` do not change the type (`isObjectShape`). Without a `type`\n * and object keywords the schema is `unknown` (`objectType` writes nothing), which has no keys.\n */\nfunction primitiveMember(node: JsonObject, key: string): GeneratedMember {\n  if (node.type === undefined) {\n    return hasObjectKeywords(node) ? OPAQUE : MISSING;\n  }\n  const prototype = typeof node.type === \"string\" ? PRIMITIVE_PROTOTYPES[node.type] : undefined;\n  return prototype !== undefined && !isBuiltInMember(key, prototype) ? MISSING : OPAQUE;\n}\n\n/** The member `key` of the type generated for `schema` (a `$ref` is followed first). */\nexport function generatedMember(\n  schema: unknown,\n  key: string,\n  options: SchemaOptions,\n  refs: RefResolver,\n): GeneratedMember {\n  return memberAt(schema, key, { options, refs, depth: 0 });\n}\n"],"names":["isRawBinarySchema"],"mappings":";;;;AAkBA,MAAM,WAAA,GAAc,CAAC,KAAA,EAAO,MAAA,EAAQ,SAAS,MAAM,CAAA;AAEnD,MAAM,SAAA,GAAY,CAAA;AAClB,MAAM,QAAA,GAAW,OAAA;AACjB,MAAM,OAAA,GAA2B,EAAE,IAAA,EAAM,SAAA,EAAU;AACnD,MAAM,MAAA,GAA0B,EAAE,IAAA,EAAM,QAAA,EAAS;AAE1C,SAAS,aAAa,KAAA,EAAqC;AAChE,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,KAAU,QAAQ,CAAC,KAAA,CAAM,QAAQ,KAAK,CAAA;AAC5E;AAGO,SAAS,UAAA,CAAW,MAAe,IAAA,EAA4B;AACpE,EAAA,OAAO,YAAA,CAAa,IAAI,CAAA,IAAK,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,GAAW,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA;AACzF;AAGO,SAAS,iBAAiB,IAAA,EAAwB;AACvD,EAAA,IAAI,CAAC,YAAA,CAAa,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,OAAO,IAAA,CAAK,QAAA,KAAa,IAAA,IAAS,KAAA,CAAM,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,IAAK,IAAA,CAAK,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA;AACzF;AAEA,SAAS,UAAU,IAAA,EAAsC;AACvD,EAAA,OAAO,KAAA,CAAM,QAAQ,IAAA,CAAK,IAAI,IAAI,IAAA,CAAK,IAAA,GAAO,CAAC,IAAA,CAAK,IAAI,CAAA;AAC1D;AAMO,SAAS,cAAc,IAAA,EAA2B;AACvD,EAAA,IAAI,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,EAAU;AACjC,IAAA,OAAO,KAAK,IAAA,KAAS,QAAA;AAAA,EACvB;AACA,EAAA,OACE,SAAA,CAAU,IAAI,CAAA,CAAE,QAAA,CAAS,QAAQ,KACjC,YAAA,IAAgB,IAAA,IAChB,sBAAA,IAA0B,IAAA,IAC1B,mBAAA,IAAuB,IAAA;AAE3B;AAGO,SAAS,aAAa,IAAA,EAA2B;AACtD,EAAA,IAAI,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,EAAU;AACjC,IAAA,OAAO,KAAK,IAAA,KAAS,OAAA;AAAA,EACvB;AACA,EAAA,OAAO,UAAU,IAAI,CAAA,CAAE,QAAA,CAAS,OAAO,KAAK,OAAA,IAAW,IAAA;AACzD;AAGA,SAAS,kBAAkB,IAAA,EAA2B;AACpD,EAAA,MAAM,aAAA,GAAgB,YAAA,CAAa,IAAA,CAAK,UAAU,CAAA,IAAK,OAAO,IAAA,CAAK,IAAA,CAAK,UAAU,CAAA,CAAE,MAAA,GAAS,CAAA;AAC7F,EAAA,OACE,iBAAiB,OAAA,CAAQ,IAAA,CAAK,wBAAwB,IAAA,CAAK,iBAAA,IAAqB,KAAK,KAAK,CAAA;AAE9F;AAOA,SAAS,iBAAA,CAAkB,MAAkB,OAAA,EAAyC;AACpF,EAAA,OAAO,KAAK,IAAA,KAAS,MAAA,IAAa,CAAC,OAAA,CAAQ,sBAAsB,MAAA,GAAS,OAAA;AAC5E;AAGA,SAAS,eAAA,CAAgB,KAAa,SAAA,EAA4B;AAChE,EAAA,OAAO,GAAA,IAAO,SAAA;AAChB;AAEA,SAAS,WAAA,CAAY,MAAkB,OAAA,EAAgD;AACrF,EAAA,MAAM,EAAE,oBAAA,EAAsB,MAAA,EAAQ,iBAAA,EAAmB,UAAS,GAAI,IAAA;AACtE,EAAA,IAAI,YAAA,CAAa,QAAQ,CAAA,IAAK,MAAA,CAAO,KAAK,QAAQ,CAAA,CAAE,SAAS,CAAA,EAAG;AAC9D,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,IAAI,YAAA,CAAa,MAAM,CAAA,IAAK,MAAA,CAAO,KAAK,MAAM,CAAA,CAAE,SAAS,CAAA,EAAG;AAC1D,IAAA,OAAO,EAAE,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,MAAA,EAAO;AAAA,EACvC;AACA,EAAA,MAAM,UAAA,GAAa,MAAA,KAAW,IAAA,IAAS,YAAA,CAAa,MAAM,KAAK,MAAA,CAAO,IAAA,CAAK,MAAM,CAAA,CAAE,MAAA,KAAW,CAAA;AAC9F,EAAA,OAAO,UAAA,IAAe,CAAC,MAAA,IAAU,OAAA,CAAQ,oBAAA,GACrC,EAAE,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,MAAA,EAAU,GACjC,IAAA;AACN;AAEA,SAAS,kBAAA,CAAmB,IAAA,EAAkB,GAAA,EAAa,OAAA,EAAiC;AAC1F,EAAA,MAAM,WAAW,KAAA,CAAM,OAAA,CAAQ,KAAK,QAAQ,CAAA,GAAI,KAAK,QAAA,GAAW,MAAA;AAChE,EAAA,MAAM,QAAA,GAAY,IAAA,CAAK,UAAA,CAA0B,GAAG,CAAA;AACpD,EAAA,MAAM,UAAA,GAAa,YAAA,CAAa,QAAQ,CAAA,IAAK,SAAS,OAAA,KAAY,MAAA;AAClE,EAAA,MAAM,UAAA,GACJ,QAAA,EAAU,QAAA,CAAS,GAAG,CAAA,KAAM,IAAA,IAC3B,QAAA,KAAa,MAAA,IAAa,OAAA,CAAQ,2BAAA,IAClC,UAAA,IAAc,OAAA,CAAQ,kBAAA;AACzB,EAAA,OAAO,CAAC,UAAA;AACV;AAEA,SAAS,YAAA,CAAa,IAAA,EAAkB,GAAA,EAAa,OAAA,EAAyC;AAC5F,EAAA,MAAM,aAAa,YAAA,CAAa,IAAA,CAAK,UAAU,CAAA,GAAI,IAAA,CAAK,aAAa,EAAC;AACtE,EAAA,IAAI,MAAA,CAAO,MAAA,CAAO,UAAA,EAAY,GAAG,CAAA,EAAG;AAClC,IAAA,MAAM,QAAA,GAAW,WAAW,GAAG,CAAA;AAC/B,IAAA,MAAM,aAAa,OAAA,CAAQ,iBAAA,IAAqB,YAAA,CAAa,QAAQ,KAAK,QAAA,CAAS,UAAA;AACnF,IAAA,OAAO,cAAc,YAAA,CAAa,IAAA,CAAK,aAAa,CAAA,GAChD,SACA,EAAE,IAAA,EAAM,UAAA,EAAY,IAAA,EAAM,UAAU,UAAA,EAAY,kBAAA,CAAmB,IAAA,EAAM,GAAA,EAAK,OAAO,CAAA,EAAE;AAAA,EAC7F;AAEA,EAAA,MAAM,iBACJ,YAAA,CAAa,IAAA,CAAK,aAAa,CAAA,IAAK,KAAK,qBAAA,KAA0B,MAAA;AACrE,EAAA,IAAI,gBAAgB,GAAA,EAAK,EAAE,CAAA,IAAK,GAAA,KAAQ,WAAW,cAAA,EAAgB;AACjE,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,iBAAA,CAAkB,IAAI,CAAA,GACxB,WAAA,CAAY,IAAA,EAAM,OAAO,CAAA,IAAK,OAAA,GAC/B,iBAAA,CAAkB,IAAA,EAAM,OAAO,CAAA;AACrC;AAMO,SAAS,cAAA,CAAe,QAAiB,IAAA,EAA6B;AAC3E,EAAA,OAAO,iBAAiB,UAAA,CAAW,MAAA,EAAQ,IAAI,CAAC,IAAI,QAAA,GAAW,SAAA;AACjE;AAGO,SAAS,gBAAA,CACd,MAAA,EACA,GAAA,EACA,OAAA,EACA,IAAA,EACU;AACV,EAAA,MAAM,IAAA,GAAO,UAAA,CAAW,MAAA,EAAQ,IAAI,CAAA;AACpC,EAAA,MAAM,UAAA,GAAa,YAAA,CAAa,IAAI,CAAA,IAAK,YAAA,CAAa,KAAK,UAAU,CAAA,GAAI,IAAA,CAAK,UAAA,GAAa,EAAC;AAC5F,EAAA,IAAI,CAAC,aAAa,IAAI,CAAA,IAAK,CAAC,MAAA,CAAO,MAAA,CAAO,UAAA,EAAY,GAAG,CAAA,EAAG;AAC1D,IAAA,OAAO,SAAA;AAAA,EACT;AACA,EAAA,OAAO,kBAAA,CAAmB,IAAA,EAAM,GAAA,EAAK,OAAO,CAAA,GAAI,WAAW,cAAA,CAAe,UAAA,CAAW,GAAG,CAAA,EAAG,IAAI,CAAA;AACjG;AAEA,SAAS,SAAA,CAAU,MAAkB,OAAA,EAAqC;AACxE,EAAA,MAAM,OAAA,GAAU,KAAK,OAAO,CAAA;AAC5B,EAAA,OAAO,KAAA,CAAM,OAAA,CAAQ,OAAO,CAAA,GAAI,UAAU,EAAC;AAC7C;AAEA,SAAS,mBAAmB,IAAA,EAA8B;AACxD,EAAA,MAAM,EAAE,OAAO,MAAA,EAAQ,KAAA,EAAO,QAAQ,KAAA,EAAO,MAAA,EAAQ,GAAG,GAAA,EAAI,GAAI,IAAA;AAChE,EAAA,OAAO,GAAA;AACT;AAGA,SAAS,iBAAiB,GAAA,EAA0B;AAClD,EAAA,OAAO,aAAA,CAAc,GAAG,CAAA,KAAM,iBAAA,CAAkB,GAAG,CAAA,IAAK,YAAA,CAAa,IAAI,aAAa,CAAA,CAAA;AACxF;AAOA,SAAS,cAAA,CAAe,IAAA,EAAkB,GAAA,EAAa,KAAA,EAAqC;AAC1F,EAAA,MAAM,QAAA,GAAW,CAAC,GAAG,SAAA,CAAU,IAAA,EAAM,OAAO,CAAA,EAAG,GAAG,SAAA,CAAU,IAAA,EAAM,OAAO,CAAC,CAAA;AAC1E,EAAA,MAAM,GAAA,GAAM,mBAAmB,IAAI,CAAA;AACnC,EAAA,MAAM,MAAA,GAAS,iBAAiB,GAAG,CAAA;AACnC,EAAA,IAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,UAAU,SAAA,CAAU,IAAA,EAAM,OAAO,CAAA,CAAE,MAAA,KAAW,KAAK,CAAC,MAAA;AAC1D,IAAA,MAAM,OAAA,GAAU,SAAS,GAAA,CAAI,CAAC,YAAY,QAAA,CAAS,OAAA,EAAS,GAAA,EAAK,KAAK,CAAC,CAAA;AACvE,IAAA,OAAO,OAAA,IAAW,QAAQ,IAAA,CAAK,CAAC,WAAW,MAAA,CAAO,IAAA,KAAS,SAAS,CAAA,GAAI,OAAA,GAAU,MAAA;AAAA,EACpF;AACA,EAAA,MAAM,KAAA,GAAQ,CAAC,GAAG,SAAA,CAAU,IAAA,EAAM,OAAO,CAAA,EAAG,GAAI,MAAA,GAAS,CAAC,GAAG,CAAA,GAAI,EAAG,CAAA;AACpE,EAAA,OAAO,kBAAA,CAAmB,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,SAAS,IAAA,EAAM,GAAA,EAAK,KAAK,CAAC,CAAC,CAAA;AAC3E;AAEA,SAAS,eAAe,MAAA,EAAkC;AACxD,EAAA,OAAO,MAAA,CAAO,IAAA,KAAS,OAAA,IAAW,MAAA,CAAO,IAAA,KAAS,MAAA;AACpD;AAOA,SAAS,mBAAmB,OAAA,EAAsD;AAChF,EAAA,MAAM,QAAQ,OAAA,CAAQ,MAAA,CAAO,CAAC,MAAA,KAAW,MAAA,CAAO,SAAS,SAAS,CAAA;AAClE,EAAA,MAAM,KAAA,GAAQ,MAAM,MAAA,CAAO,CAAC,WAAW,CAAC,cAAA,CAAe,MAAM,CAAC,CAAA;AAC9D,EAAA,MAAM,CAAC,IAAI,CAAA,GAAI,KAAA;AACf,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,OAAO,KAAA,CAAM,CAAC,CAAA,IAAK,OAAA;AAAA,EACrB;AACA,EAAA,OAAO,MAAM,MAAA,KAAW,CAAA,IAAK,IAAA,CAAK,IAAA,KAAS,WAAW,IAAA,GAAO,MAAA;AAC/D;AAQA,SAAS,QAAA,CAAS,MAAA,EAAiB,GAAA,EAAa,KAAA,EAAqC;AACnF,EAAA,MAAM,IAAA,GAAO,UAAA,CAAW,MAAA,EAAQ,KAAA,CAAM,IAAI,CAAA;AAC1C,EAAA,IAAI,CAAC,YAAA,CAAa,IAAI,CAAA,IAAK,WAAA,CAAY,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,IAAQ,IAAI,CAAA,IAAK,KAAA,CAAM,QAAQ,SAAA,EAAW;AAC9F,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,IAAI,gBAAA,CAAiB,IAAI,CAAA,EAAG;AAE1B,IAAA,OAAO,cAAc,IAAI,CAAA,IAAK,YAAA,CAAa,IAAI,IAAI,OAAA,GAAU,MAAA;AAAA,EAC/D;AACA,EAAA,IAAI,KAAA,CAAM,QAAQ,gBAAA,EAAkB;AAClC,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,IAAI,OAAA,IAAW,IAAA,IAAQ,OAAA,IAAW,IAAA,IAAQ,WAAW,IAAA,EAAM;AACzD,IAAA,OAAO,cAAA,CAAe,IAAA,EAAM,GAAA,EAAK,EAAE,GAAG,OAAO,KAAA,EAAO,KAAA,CAAM,KAAA,GAAQ,CAAA,EAAG,CAAA;AAAA,EACvE;AACA,EAAA,IAAI,aAAA,CAAc,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,YAAA,CAAa,IAAA,EAAM,GAAA,EAAK,KAAA,CAAM,OAAO,CAAA;AAAA,EAC9C;AACA,EAAA,IAAI,YAAA,CAAa,IAAI,CAAA,EAAG;AACtB,IAAA,OAAO,QAAA,CAAS,KAAK,GAAG,CAAA,IAAK,gBAAgB,GAAA,EAAK,EAAE,CAAA,GAAI,MAAA,GAAS,OAAA;AAAA,EACnE;AAEA,EAAA,OAAO,KAAA,CAAM,QAAQ,YAAA,IAAgBA,+BAAA,CAAkB,IAAa,CAAA,GAChE,MAAA,GACA,eAAA,CAAgB,IAAA,EAAM,GAAG,CAAA;AAC/B;AAGA,MAAM,oBAAA,GAAyD;AAAA,EAC7D,QAAQ,MAAA,CAAO,SAAA;AAAA,EACf,QAAQ,MAAA,CAAO,SAAA;AAAA,EACf,SAAS,MAAA,CAAO,SAAA;AAAA,EAChB,SAAS,OAAA,CAAQ;AACnB,CAAA;AAOA,SAAS,eAAA,CAAgB,MAAkB,GAAA,EAA8B;AACvE,EAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAW;AAC3B,IAAA,OAAO,iBAAA,CAAkB,IAAI,CAAA,GAAI,MAAA,GAAS,OAAA;AAAA,EAC5C;AACA,EAAA,MAAM,SAAA,GAAY,OAAO,IAAA,CAAK,IAAA,KAAS,WAAW,oBAAA,CAAqB,IAAA,CAAK,IAAI,CAAA,GAAI,MAAA;AACpF,EAAA,OAAO,cAAc,MAAA,IAAa,CAAC,gBAAgB,GAAA,EAAK,SAAS,IAAI,OAAA,GAAU,MAAA;AACjF;AAGO,SAAS,eAAA,CACd,MAAA,EACA,GAAA,EACA,OAAA,EACA,IAAA,EACiB;AACjB,EAAA,OAAO,QAAA,CAAS,QAAQ,GAAA,EAAK,EAAE,SAAS,IAAA,EAAM,KAAA,EAAO,GAAG,CAAA;AAC1D;;;;;;;;;"}