openapi-typesafe 1.0.0-rc.3 → 1.0.0-rc.5

package/dist/domain/openapi/discriminator-conflicts.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"discriminator-conflicts.cjs","sources":["../../../src/domain/openapi/discriminator-conflicts.ts"],"sourcesContent":["import { admittedPropertyValues, resolveLocalRef } from \"./admitted-values.js\";\nimport { isUnionMember, unionAt } from \"./discriminated-union.js\";\nimport { createRef, escapePointerSegment, parseRefPointer } from \"./json-pointer.js\";\n\n/**\n * Discriminator members whose discriminator value their own property does not allow. By the\n * Discriminator Object rule, a member that no `mapping` entry names has its schema name as the\n * value, so with a property `enum` (or `const`) that does not list it no value of the member\n * matches, and where the generator adds the value to the member the property type is `never`.\n * Each one gets a warning (CODING_PRINCIPLES §8.7).\n */\n\nexport interface DiscriminatorValueConflict {\n  /** The member schema, such as `#/components/schemas/EpisodeObject`. */\n  readonly member: string;\n  /** The schema that has the Discriminator Object. */\n  readonly owner: string;\n  readonly propertyName: string;\n  /** The values the discriminator gives the member: its mapping keys, or its name. */\n  readonly values: readonly string[];\n  /** The values the member's property allows. */\n  readonly allowed: readonly (string | number | boolean | null)[];\n  /** Whether no mapping entry names the member, so its value is its schema name. */\n  readonly isImplicit: boolean;\n}\n\ntype JsonObject = Readonly<Record<string, unknown>>;\n\nconst COMPONENT_SCHEMAS = \"#/components/schemas/\";\n\nfunction isObject(value: unknown): value is JsonObject {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\ninterface Owner {\n  readonly pointer: string;\n  readonly propertyName: string;\n  readonly mapping: Readonly<Record<string, string>>;\n  readonly memberRefs: readonly string[];\n}\n\nfunction refsOf(list: unknown): string[] {\n  return (Array.isArray(list) ? list : []).flatMap((item) =>\n    isObject(item) && typeof item.$ref === \"string\" ? [item.$ref] : [],\n  );\n}\n\nfunction mappingTarget(target: string): string {\n  return target.startsWith(\"#\") ? target : `${COMPONENT_SCHEMAS}${escapePointerSegment(target)}`;\n}\n\nfunction ownerAt(node: JsonObject, pointer: () => string): Owner | null {\n  const discriminator = node.discriminator;\n  if (!isObject(discriminator) || typeof discriminator.propertyName !== \"string\") {\n    return null;\n  }\n  const mapping = isObject(discriminator.mapping)\n    ? (discriminator.mapping as Readonly<Record<string, string>>)\n    : {};\n  const mapped = Object.values(mapping)\n    .filter((t) => typeof t === \"string\")\n    .map(mappingTarget);\n  const memberRefs = [...refsOf(node.oneOf), ...refsOf(node.anyOf), ...mapped];\n  return { pointer: pointer(), propertyName: discriminator.propertyName, mapping, memberRefs };\n}\n\n/** A node of the document walk; the pointer is built only for the nodes that need it. */\ninterface Visit {\n  readonly node: unknown;\n  readonly key: string | null;\n  readonly parent: Visit | null;\n}\n\nfunction pointerOf(visit: Visit): string {\n  const segments: string[] = [];\n  for (let current: Visit | null = visit; current?.key != null; current = current.parent) {\n    segments.unshift(current.key);\n  }\n  return createRef(segments);\n}\n\nfunction childrenOf(visit: Visit): Visit[] {\n  const { node } = visit;\n  const entries: [string, unknown][] = Array.isArray(node)\n    ? node.map((item, index) => [String(index), item])\n    : isObject(node)\n      ? Object.entries(node)\n      : [];\n  return entries.map(([key, child]) => ({ node: child, key, parent: visit }));\n}\n\n/**\n * Every Discriminator Object of the document, depth first, with its pointer. The walk keeps its\n * own stack, so a document nested past the call stack fails in the transform, as it did before.\n */\nfunction ownersIn(document: unknown): Owner[] {\n  const found: Owner[] = [];\n  const stack: Visit[] = [{ node: document, key: null, parent: null }];\n  for (let visit = stack.pop(); visit !== undefined; visit = stack.pop()) {\n    const owner = isObject(visit.node) ? ownerAt(visit.node, () => pointerOf(visit)) : null;\n    if (owner !== null) {\n      found.push(owner);\n    }\n    stack.push(...childrenOf(visit).reverse());\n  }\n  return found;\n}\n\n/** A member and the `$ref`s whose properties its type leaves out (`Omit` of its parents). */\ninterface Member {\n  readonly ref: string;\n  readonly skipped: ReadonlySet<string>;\n}\n\ninterface Child {\n  readonly ref: string;\n  readonly schema: JsonObject;\n}\n\n/** How the run types an `allOf` of a discriminated union. */\nexport interface ConflictOptions {\n  /**\n   * `allof-discriminated-union`: a schema that `allOf`s a union which does not contain it reuses\n   * the union and gets no value, so neither it nor the schemas below it are members.\n   */\n  readonly isUnionReused: boolean;\n}\n\n/** What the search for conflicts reads: the document and its `allOf` children by parent. */\ninterface ConflictSearch extends ConflictOptions {\n  readonly document: unknown;\n  readonly children: ReadonlyMap<string, readonly Child[]>;\n}\n\n/** The `allOf` children of the owner that inherit its discriminator. */\nfunction inheritingChildren(owner: Owner, search: ConflictSearch): readonly Child[] {\n  const children = search.children.get(owner.pointer) ?? [];\n  const resolve = (ref: string) => resolveLocalRef(search.document, ref);\n  const union = search.isUnionReused ? unionAt(owner.pointer, resolve) : undefined;\n  return union === undefined\n    ? children\n    : children.filter((child) => isUnionMember(union, child.ref, resolve));\n}\n\n/** The component schemas whose `allOf` holds a `$ref`, by that `$ref`, in document order. */\nfunction allOfChildren(document: unknown): Map<string, Child[]> {\n  const schemas = resolveLocalRef(document, \"#/components/schemas\");\n  const children = new Map<string, Child[]>();\n  for (const [name, schema] of Object.entries(isObject(schemas) ? schemas : {})) {\n    if (!isObject(schema)) {\n      continue;\n    }\n    const child = { ref: `${COMPONENT_SCHEMAS}${escapePointerSegment(name)}`, schema };\n    for (const parent of new Set(refsOf(schema.allOf))) {\n      const siblings = children.get(parent) ?? [];\n      siblings.push(child);\n      children.set(parent, siblings);\n    }\n  }\n  return children;\n}\n\n/** Whether a schema defines a discriminator of the property itself: it is the owner below. */\nfunction ownsProperty(schema: JsonObject, propertyName: string): boolean {\n  const discriminator = schema.discriminator;\n  return isObject(discriminator) && discriminator.propertyName === propertyName;\n}\n\n/**\n * Component schemas that inherit the owner through `allOf`, also through a chain\n * (`Lion: { allOf: [Cat] }`, `Cat: { allOf: [Pet] }`). Each parent on the way is left out of the\n * member's values, as its type omits the property. A schema with its own discriminator of the\n * property is a member, but the schemas below it are its own members.\n */\nfunction inheritingMembers(owner: Owner, search: ConflictSearch): Member[] {\n  const found: Member[] = [];\n  const visited = new Set([owner.pointer]);\n  const parents: Member[] = [{ ref: owner.pointer, skipped: new Set([owner.pointer]) }];\n  for (let parent = parents.shift(); parent !== undefined; parent = parents.shift()) {\n    const children =\n      parent.ref === owner.pointer\n        ? inheritingChildren(owner, search)\n        : (search.children.get(parent.ref) ?? []);\n    for (const child of children) {\n      if (visited.has(child.ref)) {\n        continue;\n      }\n      visited.add(child.ref);\n      found.push({ ref: child.ref, skipped: parent.skipped });\n      if (!ownsProperty(child.schema, owner.propertyName)) {\n        parents.push({ ref: child.ref, skipped: new Set([...parent.skipped, child.ref]) });\n      }\n    }\n  }\n  return found;\n}\n\n/** The members of an owner, each once: the listed and mapped ones, then the inheriting ones. */\nfunction membersOf(owner: Owner, search: ConflictSearch): Member[] {\n  const listed = owner.memberRefs.map((ref) => ({ ref, skipped: new Set([owner.pointer]) }));\n  const members = new Map<string, Member>();\n  for (const member of [...listed, ...inheritingMembers(owner, search)]) {\n    if (!members.has(member.ref)) {\n      members.set(member.ref, member);\n    }\n  }\n  return [...members.values()];\n}\n\nfunction memberValues(owner: Owner, member: string): { values: string[]; isImplicit: boolean } {\n  const values = Object.entries(owner.mapping)\n    .filter(([, target]) => typeof target === \"string\" && mappingTarget(target) === member)\n    .map(([key]) => key);\n  const name = parseRefPointer(member).pop() ?? \"\";\n  return values.length > 0 ? { values, isImplicit: false } : { values: [name], isImplicit: true };\n}\n\nfunction conflictOf(owner: Owner, { ref: member, skipped }: Member, document: unknown) {\n  // The owner's own property is left out of an inheriting member's type (`Omit`).\n  const allowed = admittedPropertyValues(\n    resolveLocalRef(document, member),\n    owner.propertyName,\n    document,\n    skipped,\n  );\n  const { values, isImplicit } = memberValues(owner, member);\n  if (allowed === null || values.some((value) => allowed.has(value))) {\n    return null;\n  }\n  const { pointer, propertyName } = owner;\n  return { member, owner: pointer, propertyName, values, allowed: [...allowed], isImplicit };\n}\n\n/** The conflicts of the document, one per member and value list, in document order. */\nexport function findDiscriminatorValueConflicts(\n  document: unknown,\n  options: ConflictOptions = { isUnionReused: false },\n): readonly DiscriminatorValueConflict[] {\n  const conflicts = new Map<string, DiscriminatorValueConflict>();\n  const search = { ...options, document, children: allOfChildren(document) };\n  for (const owner of ownersIn(document)) {\n    for (const member of membersOf(owner, search)) {\n      const conflict = conflictOf(owner, member, document);\n      const key = JSON.stringify([member.ref, conflict?.propertyName, conflict?.values]);\n      if (conflict !== null && !conflicts.has(key)) {\n        conflicts.set(key, conflict);\n      }\n    }\n  }\n  return [...conflicts.values()];\n}\n"],"names":["escapePointerSegment","createRef","resolveLocalRef","unionAt","isUnionMember","parseRefPointer","admittedPropertyValues"],"mappings":";;;;;;AA4BA,MAAM,iBAAA,GAAoB,uBAAA;AAE1B,SAAS,SAAS,KAAA,EAAqC;AACrD,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,KAAU,QAAQ,CAAC,KAAA,CAAM,QAAQ,KAAK,CAAA;AAC5E;AASA,SAAS,OAAO,IAAA,EAAyB;AACvC,EAAA,OAAA,CAAQ,MAAM,OAAA,CAAQ,IAAI,CAAA,GAAI,IAAA,GAAO,EAAC,EAAG,OAAA;AAAA,IAAQ,CAAC,IAAA,KAChD,QAAA,CAAS,IAAI,CAAA,IAAK,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,GAAW,CAAC,IAAA,CAAK,IAAI,IAAI;AAAC,GACnE;AACF;AAEA,SAAS,cAAc,MAAA,EAAwB;AAC7C,EAAA,OAAO,MAAA,CAAO,UAAA,CAAW,GAAG,CAAA,GAAI,MAAA,GAAS,GAAG,iBAAiB,CAAA,EAAGA,gCAAA,CAAqB,MAAM,CAAC,CAAA,CAAA;AAC9F;AAEA,SAAS,OAAA,CAAQ,MAAkB,OAAA,EAAqC;AACtE,EAAA,MAAM,gBAAgB,IAAA,CAAK,aAAA;AAC3B,EAAA,IAAI,CAAC,QAAA,CAAS,aAAa,KAAK,OAAO,aAAA,CAAc,iBAAiB,QAAA,EAAU;AAC9E,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,UAAU,QAAA,CAAS,aAAA,CAAc,OAAO,CAAA,GACzC,aAAA,CAAc,UACf,EAAC;AACL,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,MAAA,CAAO,OAAO,CAAA,CACjC,MAAA,CAAO,CAAC,CAAA,KAAM,OAAO,CAAA,KAAM,QAAQ,CAAA,CACnC,IAAI,aAAa,CAAA;AACpB,EAAA,MAAM,UAAA,GAAa,CAAC,GAAG,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,EAAG,GAAG,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,EAAG,GAAG,MAAM,CAAA;AAC3E,EAAA,OAAO,EAAE,SAAS,OAAA,EAAQ,EAAG,cAAc,aAAA,CAAc,YAAA,EAAc,SAAS,UAAA,EAAW;AAC7F;AASA,SAAS,UAAU,KAAA,EAAsB;AACvC,EAAA,MAAM,WAAqB,EAAC;AAC5B,EAAA,KAAA,IAAS,UAAwB,KAAA,EAAO,OAAA,EAAS,OAAO,IAAA,EAAM,OAAA,GAAU,QAAQ,MAAA,EAAQ;AACtF,IAAA,QAAA,CAAS,OAAA,CAAQ,QAAQ,GAAG,CAAA;AAAA,EAC9B;AACA,EAAA,OAAOC,sBAAU,QAAQ,CAAA;AAC3B;AAEA,SAAS,WAAW,KAAA,EAAuB;AACzC,EAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,EAAA,MAAM,OAAA,GAA+B,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,GACnD,KAAK,GAAA,CAAI,CAAC,IAAA,EAAM,KAAA,KAAU,CAAC,MAAA,CAAO,KAAK,CAAA,EAAG,IAAI,CAAC,CAAA,GAC/C,QAAA,CAAS,IAAI,IACX,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,GACnB,EAAC;AACP,EAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,GAAA,EAAK,KAAK,CAAA,MAAO,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,MAAA,EAAQ,OAAM,CAAE,CAAA;AAC5E;AAMA,SAAS,SAAS,QAAA,EAA4B;AAC5C,EAAA,MAAM,QAAiB,EAAC;AACxB,EAAA,MAAM,KAAA,GAAiB,CAAC,EAAE,IAAA,EAAM,UAAU,GAAA,EAAK,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,CAAA;AACnE,EAAA,KAAA,IAAS,KAAA,GAAQ,MAAM,GAAA,EAAI,EAAG,UAAU,MAAA,EAAW,KAAA,GAAQ,KAAA,CAAM,GAAA,EAAI,EAAG;AACtE,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,CAAM,IAAI,CAAA,GAAI,OAAA,CAAQ,KAAA,CAAM,IAAA,EAAM,MAAM,SAAA,CAAU,KAAK,CAAC,CAAA,GAAI,IAAA;AACnF,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAAA,IAClB;AACA,IAAA,KAAA,CAAM,KAAK,GAAG,UAAA,CAAW,KAAK,CAAA,CAAE,SAAS,CAAA;AAAA,EAC3C;AACA,EAAA,OAAO,KAAA;AACT;AA6BA,SAAS,kBAAA,CAAmB,OAAc,MAAA,EAA0C;AAClF,EAAA,MAAM,WAAW,MAAA,CAAO,QAAA,CAAS,IAAI,KAAA,CAAM,OAAO,KAAK,EAAC;AACxD,EAAA,MAAM,UAAU,CAAC,GAAA,KAAgBC,8BAAA,CAAgB,MAAA,CAAO,UAAU,GAAG,CAAA;AACrE,EAAA,MAAM,QAAQ,MAAA,CAAO,aAAA,GAAgBC,2BAAQ,KAAA,CAAM,OAAA,EAAS,OAAO,CAAA,GAAI,MAAA;AACvE,EAAA,OAAO,KAAA,KAAU,MAAA,GACb,QAAA,GACA,QAAA,CAAS,MAAA,CAAO,CAAC,KAAA,KAAUC,gCAAA,CAAc,KAAA,EAAO,KAAA,CAAM,GAAA,EAAK,OAAO,CAAC,CAAA;AACzE;AAGA,SAAS,cAAc,QAAA,EAAyC;AAC9D,EAAA,MAAM,OAAA,GAAUF,8BAAA,CAAgB,QAAA,EAAU,sBAAsB,CAAA;AAChE,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAqB;AAC1C,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,MAAM,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,QAAA,CAAS,OAAO,CAAA,GAAI,OAAA,GAAU,EAAE,CAAA,EAAG;AAC7E,IAAA,IAAI,CAAC,QAAA,CAAS,MAAM,CAAA,EAAG;AACrB,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAA,GAAQ,EAAE,GAAA,EAAK,CAAA,EAAG,iBAAiB,GAAGF,gCAAA,CAAqB,IAAI,CAAC,CAAA,CAAA,EAAI,MAAA,EAAO;AACjF,IAAA,KAAA,MAAW,UAAU,IAAI,GAAA,CAAI,OAAO,MAAA,CAAO,KAAK,CAAC,CAAA,EAAG;AAClD,MAAA,MAAM,QAAA,GAAW,QAAA,CAAS,GAAA,CAAI,MAAM,KAAK,EAAC;AAC1C,MAAA,QAAA,CAAS,KAAK,KAAK,CAAA;AACnB,MAAA,QAAA,CAAS,GAAA,CAAI,QAAQ,QAAQ,CAAA;AAAA,IAC/B;AAAA,EACF;AACA,EAAA,OAAO,QAAA;AACT;AAGA,SAAS,YAAA,CAAa,QAAoB,YAAA,EAA+B;AACvE,EAAA,MAAM,gBAAgB,MAAA,CAAO,aAAA;AAC7B,EAAA,OAAO,QAAA,CAAS,aAAa,CAAA,IAAK,aAAA,CAAc,YAAA,KAAiB,YAAA;AACnE;AAQA,SAAS,iBAAA,CAAkB,OAAc,MAAA,EAAkC;AACzE,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,MAAM,0BAAU,IAAI,GAAA,CAAI,CAAC,KAAA,CAAM,OAAO,CAAC,CAAA;AACvC,EAAA,MAAM,OAAA,GAAoB,CAAC,EAAE,GAAA,EAAK,MAAM,OAAA,EAAS,OAAA,kBAAS,IAAI,GAAA,CAAI,CAAC,KAAA,CAAM,OAAO,CAAC,GAAG,CAAA;AACpF,EAAA,KAAA,IAAS,MAAA,GAAS,QAAQ,KAAA,EAAM,EAAG,WAAW,MAAA,EAAW,MAAA,GAAS,OAAA,CAAQ,KAAA,EAAM,EAAG;AACjF,IAAA,MAAM,QAAA,GACJ,MAAA,CAAO,GAAA,KAAQ,KAAA,CAAM,UACjB,kBAAA,CAAmB,KAAA,EAAO,MAAM,CAAA,GAC/B,OAAO,QAAA,CAAS,GAAA,CAAI,MAAA,CAAO,GAAG,KAAK,EAAC;AAC3C,IAAA,KAAA,MAAW,SAAS,QAAA,EAAU;AAC5B,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,KAAA,CAAM,GAAG,CAAA,EAAG;AAC1B,QAAA;AAAA,MACF;AACA,MAAA,OAAA,CAAQ,GAAA,CAAI,MAAM,GAAG,CAAA;AACrB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,GAAA,EAAK,KAAA,CAAM,KAAK,OAAA,EAAS,MAAA,CAAO,SAAS,CAAA;AACtD,MAAA,IAAI,CAAC,YAAA,CAAa,KAAA,CAAM,MAAA,EAAQ,KAAA,CAAM,YAAY,CAAA,EAAG;AACnD,QAAA,OAAA,CAAQ,KAAK,EAAE,GAAA,EAAK,KAAA,CAAM,GAAA,EAAK,yBAAS,IAAI,GAAA,CAAI,CAAC,GAAG,OAAO,OAAA,EAAS,KAAA,CAAM,GAAG,CAAC,GAAG,CAAA;AAAA,MACnF;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,SAAA,CAAU,OAAc,MAAA,EAAkC;AACjE,EAAA,MAAM,SAAS,KAAA,CAAM,UAAA,CAAW,GAAA,CAAI,CAAC,SAAS,EAAE,GAAA,EAAK,OAAA,kBAAS,IAAI,IAAI,CAAC,KAAA,CAAM,OAAO,CAAC,GAAE,CAAE,CAAA;AACzF,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAoB;AACxC,EAAA,KAAA,MAAW,MAAA,IAAU,CAAC,GAAG,MAAA,EAAQ,GAAG,iBAAA,CAAkB,KAAA,EAAO,MAAM,CAAC,CAAA,EAAG;AACrE,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,GAAG,CAAA,EAAG;AAC5B,MAAA,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,GAAA,EAAK,MAAM,CAAA;AAAA,IAChC;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,OAAA,CAAQ,MAAA,EAAQ,CAAA;AAC7B;AAEA,SAAS,YAAA,CAAa,OAAc,MAAA,EAA2D;AAC7F,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,OAAA,CAAQ,KAAA,CAAM,OAAO,EACxC,MAAA,CAAO,CAAC,GAAG,MAAM,CAAA,KAAM,OAAO,MAAA,KAAW,QAAA,IAAY,aAAA,CAAc,MAAM,CAAA,KAAM,MAAM,CAAA,CACrF,GAAA,CAAI,CAAC,CAAC,GAAG,CAAA,KAAM,GAAG,CAAA;AACrB,EAAA,MAAM,IAAA,GAAOK,2BAAA,CAAgB,MAAM,CAAA,CAAE,KAAI,IAAK,EAAA;AAC9C,EAAA,OAAO,MAAA,CAAO,MAAA,GAAS,CAAA,GAAI,EAAE,QAAQ,UAAA,EAAY,KAAA,EAAM,GAAI,EAAE,MAAA,EAAQ,CAAC,IAAI,CAAA,EAAG,YAAY,IAAA,EAAK;AAChG;AAEA,SAAS,WAAW,KAAA,EAAc,EAAE,KAAK,MAAA,EAAQ,OAAA,IAAmB,QAAA,EAAmB;AAErF,EAAA,MAAM,OAAA,GAAUC,qCAAA;AAAA,IACdJ,8BAAA,CAAgB,UAAU,MAAM,CAAA;AAAA,IAChC,KAAA,CAAM,YAAA;AAAA,IACN,QAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,EAAE,MAAA,EAAQ,UAAA,EAAW,GAAI,YAAA,CAAa,OAAO,MAAM,CAAA;AACzD,EAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,MAAA,CAAO,IAAA,CAAK,CAAC,UAAU,OAAA,CAAQ,GAAA,CAAI,KAAK,CAAC,CAAA,EAAG;AAClE,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,EAAE,OAAA,EAAS,YAAA,EAAa,GAAI,KAAA;AAClC,EAAA,OAAO,EAAE,MAAA,EAAQ,KAAA,EAAO,OAAA,EAAS,YAAA,EAAc,MAAA,EAAQ,OAAA,EAAS,CAAC,GAAG,OAAO,CAAA,EAAG,UAAA,EAAW;AAC3F;AAGO,SAAS,gCACd,QAAA,EACA,OAAA,GAA2B,EAAE,aAAA,EAAe,OAAM,EACX;AACvC,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAwC;AAC9D,EAAA,MAAM,MAAA,GAAS,EAAE,GAAG,OAAA,EAAS,UAAU,QAAA,EAAU,aAAA,CAAc,QAAQ,CAAA,EAAE;AACzE,EAAA,KAAA,MAAW,KAAA,IAAS,QAAA,CAAS,QAAQ,CAAA,EAAG;AACtC,IAAA,KAAA,MAAW,MAAA,IAAU,SAAA,CAAU,KAAA,EAAO,MAAM,CAAA,EAAG;AAC7C,MAAA,MAAM,QAAA,GAAW,UAAA,CAAW,KAAA,EAAO,MAAA,EAAQ,QAAQ,CAAA;AACnD,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,SAAA,CAAU,CAAC,MAAA,CAAO,KAAK,QAAA,EAAU,YAAA,EAAc,QAAA,EAAU,MAAM,CAAC,CAAA;AACjF,MAAA,IAAI,aAAa,IAAA,IAAQ,CAAC,SAAA,CAAU,GAAA,CAAI,GAAG,CAAA,EAAG;AAC5C,QAAA,SAAA,CAAU,GAAA,CAAI,KAAK,QAAQ,CAAA;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,SAAA,CAAU,MAAA,EAAQ,CAAA;AAC/B;;"}
+{"version":3,"file":"discriminator-conflicts.cjs","sources":["../../../src/domain/openapi/discriminator-conflicts.ts"],"sourcesContent":["import { appendAll } from \"../append-all.js\";\nimport { admittedPropertyValues, resolveLocalRef } from \"./admitted-values.js\";\nimport { isUnionMember, unionAt } from \"./discriminated-union.js\";\nimport {\n  appendPointer,\n  canonicalRef,\n  escapePointerSegment,\n  parseRefPointer,\n  ROOT_POINTER,\n} from \"./json-pointer.js\";\n\n/**\n * Discriminator members whose discriminator value their own property does not allow. By the\n * Discriminator Object rule, a member that no `mapping` entry names has its schema name as the\n * value, so with a property `enum` (or `const`) that does not list it no value of the member\n * matches, and where the generator adds the value to the member the property type is `never`.\n * Each one gets a warning (CODING_PRINCIPLES §8.7).\n */\n\nexport interface DiscriminatorValueConflict {\n  /** The member schema, such as `#/components/schemas/EpisodeObject`. */\n  readonly member: string;\n  /** The schema that has the Discriminator Object. */\n  readonly owner: string;\n  readonly propertyName: string;\n  /** The values the discriminator gives the member: its mapping keys, or its name. */\n  readonly values: readonly string[];\n  /** The values the member's property allows. */\n  readonly allowed: readonly (string | number | boolean | null)[];\n  /** Whether no mapping entry names the member, so its value is its schema name. */\n  readonly isImplicit: boolean;\n}\n\ntype JsonObject = Readonly<Record<string, unknown>>;\n\nconst COMPONENT_SCHEMAS = \"#/components/schemas/\";\n\nfunction isObject(value: unknown): value is JsonObject {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\ninterface Owner {\n  readonly pointer: string;\n  readonly propertyName: string;\n  readonly mapping: Readonly<Record<string, string>>;\n  readonly memberRefs: readonly string[];\n}\n\nfunction refsOf(list: unknown): string[] {\n  return (Array.isArray(list) ? list : []).flatMap((item) =>\n    isObject(item) && typeof item.$ref === \"string\" ? [item.$ref] : [],\n  );\n}\n\n/** A mapping value as a canonical `$ref`: Redocly writes it percent-decoded (`canonicalRef`). */\nfunction mappingTarget(target: string): string {\n  return target.startsWith(\"#\")\n    ? canonicalRef(target)\n    : `${COMPONENT_SCHEMAS}${escapePointerSegment(target)}`;\n}\n\nfunction ownerAt(node: JsonObject, pointer: () => string): Owner | null {\n  const discriminator = node.discriminator;\n  if (!isObject(discriminator) || typeof discriminator.propertyName !== \"string\") {\n    return null;\n  }\n  const mapping = isObject(discriminator.mapping)\n    ? (discriminator.mapping as Readonly<Record<string, string>>)\n    : {};\n  const mapped = Object.values(mapping)\n    .filter((t) => typeof t === \"string\")\n    .map(mappingTarget);\n  const memberRefs = [...refsOf(node.oneOf), ...refsOf(node.anyOf), ...mapped];\n  return { pointer: pointer(), propertyName: discriminator.propertyName, mapping, memberRefs };\n}\n\n/** A node of the document walk; the pointer is built only for the nodes that need it. */\ninterface Visit {\n  readonly node: unknown;\n  readonly key: string | null;\n  readonly parent: Visit | null;\n}\n\nfunction pointerOf(visit: Visit): string {\n  const segments: string[] = [];\n  for (let current: Visit | null = visit; current?.key != null; current = current.parent) {\n    segments.unshift(current.key);\n  }\n  return appendPointer(ROOT_POINTER, segments);\n}\n\nfunction childrenOf(visit: Visit): Visit[] {\n  const { node } = visit;\n  const entries: [string, unknown][] = Array.isArray(node)\n    ? node.map((item, index) => [String(index), item])\n    : isObject(node)\n      ? Object.entries(node)\n      : [];\n  return entries.map(([key, child]) => ({ node: child, key, parent: visit }));\n}\n\n/**\n * Every Discriminator Object of the document, depth first, with its pointer. The walk keeps its\n * own stack, so a document nested past the call stack fails in the transform, as it did before.\n */\nfunction ownersIn(document: unknown): Owner[] {\n  const found: Owner[] = [];\n  const stack: Visit[] = [{ node: document, key: null, parent: null }];\n  for (let visit = stack.pop(); visit !== undefined; visit = stack.pop()) {\n    const owner = isObject(visit.node) ? ownerAt(visit.node, () => pointerOf(visit)) : null;\n    if (owner !== null) {\n      found.push(owner);\n    }\n    appendAll(stack, childrenOf(visit).reverse());\n  }\n  return found;\n}\n\n/** A member and the `$ref`s whose properties its type leaves out (`Omit` of its parents). */\ninterface Member {\n  readonly ref: string;\n  readonly skipped: ReadonlySet<string>;\n}\n\ninterface Child {\n  readonly ref: string;\n  readonly schema: JsonObject;\n}\n\n/** How the run types an `allOf` of a discriminated union. */\nexport interface ConflictOptions {\n  /**\n   * `allof-discriminated-union`: a schema that `allOf`s a union which does not contain it reuses\n   * the union and gets no value, so neither it nor the schemas below it are members.\n   */\n  readonly isUnionReused: boolean;\n}\n\n/** What the search for conflicts reads: the document and its `allOf` children by parent. */\ninterface ConflictSearch extends ConflictOptions {\n  readonly document: unknown;\n  readonly children: ReadonlyMap<string, readonly Child[]>;\n}\n\n/** The `allOf` children of the owner that inherit its discriminator. */\nfunction inheritingChildren(owner: Owner, search: ConflictSearch): readonly Child[] {\n  const children = search.children.get(owner.pointer) ?? [];\n  const resolve = (ref: string) => resolveLocalRef(search.document, ref);\n  const union = search.isUnionReused ? unionAt(owner.pointer, resolve) : undefined;\n  return union === undefined\n    ? children\n    : children.filter((child) => isUnionMember(union, child.ref, resolve));\n}\n\n/** The component schemas whose `allOf` holds a `$ref`, by that `$ref`, in document order. */\nfunction allOfChildren(document: unknown): Map<string, Child[]> {\n  const schemas = resolveLocalRef(document, \"#/components/schemas\");\n  const children = new Map<string, Child[]>();\n  for (const [name, schema] of Object.entries(isObject(schemas) ? schemas : {})) {\n    if (!isObject(schema)) {\n      continue;\n    }\n    const child = { ref: `${COMPONENT_SCHEMAS}${escapePointerSegment(name)}`, schema };\n    for (const parent of new Set(refsOf(schema.allOf))) {\n      const siblings = children.get(parent) ?? [];\n      siblings.push(child);\n      children.set(parent, siblings);\n    }\n  }\n  return children;\n}\n\n/** Whether a schema defines a discriminator of the property itself: it is the owner below. */\nfunction ownsProperty(schema: JsonObject, propertyName: string): boolean {\n  const discriminator = schema.discriminator;\n  return isObject(discriminator) && discriminator.propertyName === propertyName;\n}\n\n/**\n * Component schemas that inherit the owner through `allOf`, also through a chain\n * (`Lion: { allOf: [Cat] }`, `Cat: { allOf: [Pet] }`). Each parent on the way is left out of the\n * member's values, as its type omits the property. A schema with its own discriminator of the\n * property is a member, but the schemas below it are its own members.\n */\nfunction inheritingMembers(owner: Owner, search: ConflictSearch): Member[] {\n  const found: Member[] = [];\n  const visited = new Set([owner.pointer]);\n  const parents: Member[] = [{ ref: owner.pointer, skipped: new Set([owner.pointer]) }];\n  for (let parent = parents.shift(); parent !== undefined; parent = parents.shift()) {\n    const children =\n      parent.ref === owner.pointer\n        ? inheritingChildren(owner, search)\n        : (search.children.get(parent.ref) ?? []);\n    for (const child of children) {\n      if (visited.has(child.ref)) {\n        continue;\n      }\n      visited.add(child.ref);\n      found.push({ ref: child.ref, skipped: parent.skipped });\n      if (!ownsProperty(child.schema, owner.propertyName)) {\n        parents.push({ ref: child.ref, skipped: new Set([...parent.skipped, child.ref]) });\n      }\n    }\n  }\n  return found;\n}\n\n/** The members of an owner, each once: the listed and mapped ones, then the inheriting ones. */\nfunction membersOf(owner: Owner, search: ConflictSearch): Member[] {\n  const listed = owner.memberRefs.map((ref) => ({ ref, skipped: new Set([owner.pointer]) }));\n  const members = new Map<string, Member>();\n  for (const member of [...listed, ...inheritingMembers(owner, search)]) {\n    // A member may be listed by a `$ref` and found by its pointer: both name it canonically.\n    const key = canonicalRef(member.ref);\n    if (!members.has(key)) {\n      members.set(key, member);\n    }\n  }\n  return [...members.values()];\n}\n\nfunction memberValues(owner: Owner, member: string): { values: string[]; isImplicit: boolean } {\n  const values = Object.entries(owner.mapping)\n    .filter(\n      ([, target]) => typeof target === \"string\" && mappingTarget(target) === canonicalRef(member),\n    )\n    .map(([key]) => key);\n  const name = parseRefPointer(member).pop() ?? \"\";\n  return values.length > 0 ? { values, isImplicit: false } : { values: [name], isImplicit: true };\n}\n\nfunction conflictOf(owner: Owner, { ref: member, skipped }: Member, document: unknown) {\n  // The owner's own property is left out of an inheriting member's type (`Omit`).\n  const allowed = admittedPropertyValues(\n    resolveLocalRef(document, member),\n    owner.propertyName,\n    document,\n    skipped,\n  );\n  const { values, isImplicit } = memberValues(owner, member);\n  if (allowed === null || values.some((value) => allowed.has(value))) {\n    return null;\n  }\n  const { pointer, propertyName } = owner;\n  return { member, owner: pointer, propertyName, values, allowed: [...allowed], isImplicit };\n}\n\n/** The conflicts of the document, one per member and value list, in document order. */\nexport function findDiscriminatorValueConflicts(\n  document: unknown,\n  options: ConflictOptions = { isUnionReused: false },\n): readonly DiscriminatorValueConflict[] {\n  const conflicts = new Map<string, DiscriminatorValueConflict>();\n  const search = { ...options, document, children: allOfChildren(document) };\n  for (const owner of ownersIn(document)) {\n    for (const member of membersOf(owner, search)) {\n      const conflict = conflictOf(owner, member, document);\n      const key = JSON.stringify([member.ref, conflict?.propertyName, conflict?.values]);\n      if (conflict !== null && !conflicts.has(key)) {\n        conflicts.set(key, conflict);\n      }\n    }\n  }\n  return [...conflicts.values()];\n}\n"],"names":["canonicalRef","escapePointerSegment","appendPointer","ROOT_POINTER","appendAll","resolveLocalRef","unionAt","isUnionMember","parseRefPointer","admittedPropertyValues"],"mappings":";;;;;;;AAmCA,MAAM,iBAAA,GAAoB,uBAAA;AAE1B,SAAS,SAAS,KAAA,EAAqC;AACrD,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,KAAU,QAAQ,CAAC,KAAA,CAAM,QAAQ,KAAK,CAAA;AAC5E;AASA,SAAS,OAAO,IAAA,EAAyB;AACvC,EAAA,OAAA,CAAQ,MAAM,OAAA,CAAQ,IAAI,CAAA,GAAI,IAAA,GAAO,EAAC,EAAG,OAAA;AAAA,IAAQ,CAAC,IAAA,KAChD,QAAA,CAAS,IAAI,CAAA,IAAK,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,GAAW,CAAC,IAAA,CAAK,IAAI,IAAI;AAAC,GACnE;AACF;AAGA,SAAS,cAAc,MAAA,EAAwB;AAC7C,EAAA,OAAO,MAAA,CAAO,UAAA,CAAW,GAAG,CAAA,GACxBA,wBAAA,CAAa,MAAM,CAAA,GACnB,CAAA,EAAG,iBAAiB,CAAA,EAAGC,gCAAA,CAAqB,MAAM,CAAC,CAAA,CAAA;AACzD;AAEA,SAAS,OAAA,CAAQ,MAAkB,OAAA,EAAqC;AACtE,EAAA,MAAM,gBAAgB,IAAA,CAAK,aAAA;AAC3B,EAAA,IAAI,CAAC,QAAA,CAAS,aAAa,KAAK,OAAO,aAAA,CAAc,iBAAiB,QAAA,EAAU;AAC9E,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,UAAU,QAAA,CAAS,aAAA,CAAc,OAAO,CAAA,GACzC,aAAA,CAAc,UACf,EAAC;AACL,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,MAAA,CAAO,OAAO,CAAA,CACjC,MAAA,CAAO,CAAC,CAAA,KAAM,OAAO,CAAA,KAAM,QAAQ,CAAA,CACnC,IAAI,aAAa,CAAA;AACpB,EAAA,MAAM,UAAA,GAAa,CAAC,GAAG,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,EAAG,GAAG,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,EAAG,GAAG,MAAM,CAAA;AAC3E,EAAA,OAAO,EAAE,SAAS,OAAA,EAAQ,EAAG,cAAc,aAAA,CAAc,YAAA,EAAc,SAAS,UAAA,EAAW;AAC7F;AASA,SAAS,UAAU,KAAA,EAAsB;AACvC,EAAA,MAAM,WAAqB,EAAC;AAC5B,EAAA,KAAA,IAAS,UAAwB,KAAA,EAAO,OAAA,EAAS,OAAO,IAAA,EAAM,OAAA,GAAU,QAAQ,MAAA,EAAQ;AACtF,IAAA,QAAA,CAAS,OAAA,CAAQ,QAAQ,GAAG,CAAA;AAAA,EAC9B;AACA,EAAA,OAAOC,yBAAA,CAAcC,0BAAc,QAAQ,CAAA;AAC7C;AAEA,SAAS,WAAW,KAAA,EAAuB;AACzC,EAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,EAAA,MAAM,OAAA,GAA+B,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,GACnD,KAAK,GAAA,CAAI,CAAC,IAAA,EAAM,KAAA,KAAU,CAAC,MAAA,CAAO,KAAK,CAAA,EAAG,IAAI,CAAC,CAAA,GAC/C,QAAA,CAAS,IAAI,IACX,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,GACnB,EAAC;AACP,EAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,GAAA,EAAK,KAAK,CAAA,MAAO,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,MAAA,EAAQ,OAAM,CAAE,CAAA;AAC5E;AAMA,SAAS,SAAS,QAAA,EAA4B;AAC5C,EAAA,MAAM,QAAiB,EAAC;AACxB,EAAA,MAAM,KAAA,GAAiB,CAAC,EAAE,IAAA,EAAM,UAAU,GAAA,EAAK,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,CAAA;AACnE,EAAA,KAAA,IAAS,KAAA,GAAQ,MAAM,GAAA,EAAI,EAAG,UAAU,MAAA,EAAW,KAAA,GAAQ,KAAA,CAAM,GAAA,EAAI,EAAG;AACtE,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,CAAM,IAAI,CAAA,GAAI,OAAA,CAAQ,KAAA,CAAM,IAAA,EAAM,MAAM,SAAA,CAAU,KAAK,CAAC,CAAA,GAAI,IAAA;AACnF,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAAA,IAClB;AACA,IAAAC,mBAAA,CAAU,KAAA,EAAO,UAAA,CAAW,KAAK,CAAA,CAAE,SAAS,CAAA;AAAA,EAC9C;AACA,EAAA,OAAO,KAAA;AACT;AA6BA,SAAS,kBAAA,CAAmB,OAAc,MAAA,EAA0C;AAClF,EAAA,MAAM,WAAW,MAAA,CAAO,QAAA,CAAS,IAAI,KAAA,CAAM,OAAO,KAAK,EAAC;AACxD,EAAA,MAAM,UAAU,CAAC,GAAA,KAAgBC,8BAAA,CAAgB,MAAA,CAAO,UAAU,GAAG,CAAA;AACrE,EAAA,MAAM,QAAQ,MAAA,CAAO,aAAA,GAAgBC,2BAAQ,KAAA,CAAM,OAAA,EAAS,OAAO,CAAA,GAAI,MAAA;AACvE,EAAA,OAAO,KAAA,KAAU,MAAA,GACb,QAAA,GACA,QAAA,CAAS,MAAA,CAAO,CAAC,KAAA,KAAUC,gCAAA,CAAc,KAAA,EAAO,KAAA,CAAM,GAAA,EAAK,OAAO,CAAC,CAAA;AACzE;AAGA,SAAS,cAAc,QAAA,EAAyC;AAC9D,EAAA,MAAM,OAAA,GAAUF,8BAAA,CAAgB,QAAA,EAAU,sBAAsB,CAAA;AAChE,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAqB;AAC1C,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,MAAM,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,QAAA,CAAS,OAAO,CAAA,GAAI,OAAA,GAAU,EAAE,CAAA,EAAG;AAC7E,IAAA,IAAI,CAAC,QAAA,CAAS,MAAM,CAAA,EAAG;AACrB,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAA,GAAQ,EAAE,GAAA,EAAK,CAAA,EAAG,iBAAiB,GAAGJ,gCAAA,CAAqB,IAAI,CAAC,CAAA,CAAA,EAAI,MAAA,EAAO;AACjF,IAAA,KAAA,MAAW,UAAU,IAAI,GAAA,CAAI,OAAO,MAAA,CAAO,KAAK,CAAC,CAAA,EAAG;AAClD,MAAA,MAAM,QAAA,GAAW,QAAA,CAAS,GAAA,CAAI,MAAM,KAAK,EAAC;AAC1C,MAAA,QAAA,CAAS,KAAK,KAAK,CAAA;AACnB,MAAA,QAAA,CAAS,GAAA,CAAI,QAAQ,QAAQ,CAAA;AAAA,IAC/B;AAAA,EACF;AACA,EAAA,OAAO,QAAA;AACT;AAGA,SAAS,YAAA,CAAa,QAAoB,YAAA,EAA+B;AACvE,EAAA,MAAM,gBAAgB,MAAA,CAAO,aAAA;AAC7B,EAAA,OAAO,QAAA,CAAS,aAAa,CAAA,IAAK,aAAA,CAAc,YAAA,KAAiB,YAAA;AACnE;AAQA,SAAS,iBAAA,CAAkB,OAAc,MAAA,EAAkC;AACzE,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,MAAM,0BAAU,IAAI,GAAA,CAAI,CAAC,KAAA,CAAM,OAAO,CAAC,CAAA;AACvC,EAAA,MAAM,OAAA,GAAoB,CAAC,EAAE,GAAA,EAAK,MAAM,OAAA,EAAS,OAAA,kBAAS,IAAI,GAAA,CAAI,CAAC,KAAA,CAAM,OAAO,CAAC,GAAG,CAAA;AACpF,EAAA,KAAA,IAAS,MAAA,GAAS,QAAQ,KAAA,EAAM,EAAG,WAAW,MAAA,EAAW,MAAA,GAAS,OAAA,CAAQ,KAAA,EAAM,EAAG;AACjF,IAAA,MAAM,QAAA,GACJ,MAAA,CAAO,GAAA,KAAQ,KAAA,CAAM,UACjB,kBAAA,CAAmB,KAAA,EAAO,MAAM,CAAA,GAC/B,OAAO,QAAA,CAAS,GAAA,CAAI,MAAA,CAAO,GAAG,KAAK,EAAC;AAC3C,IAAA,KAAA,MAAW,SAAS,QAAA,EAAU;AAC5B,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,KAAA,CAAM,GAAG,CAAA,EAAG;AAC1B,QAAA;AAAA,MACF;AACA,MAAA,OAAA,CAAQ,GAAA,CAAI,MAAM,GAAG,CAAA;AACrB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,GAAA,EAAK,KAAA,CAAM,KAAK,OAAA,EAAS,MAAA,CAAO,SAAS,CAAA;AACtD,MAAA,IAAI,CAAC,YAAA,CAAa,KAAA,CAAM,MAAA,EAAQ,KAAA,CAAM,YAAY,CAAA,EAAG;AACnD,QAAA,OAAA,CAAQ,KAAK,EAAE,GAAA,EAAK,KAAA,CAAM,GAAA,EAAK,yBAAS,IAAI,GAAA,CAAI,CAAC,GAAG,OAAO,OAAA,EAAS,KAAA,CAAM,GAAG,CAAC,GAAG,CAAA;AAAA,MACnF;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,SAAA,CAAU,OAAc,MAAA,EAAkC;AACjE,EAAA,MAAM,SAAS,KAAA,CAAM,UAAA,CAAW,GAAA,CAAI,CAAC,SAAS,EAAE,GAAA,EAAK,OAAA,kBAAS,IAAI,IAAI,CAAC,KAAA,CAAM,OAAO,CAAC,GAAE,CAAE,CAAA;AACzF,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAoB;AACxC,EAAA,KAAA,MAAW,MAAA,IAAU,CAAC,GAAG,MAAA,EAAQ,GAAG,iBAAA,CAAkB,KAAA,EAAO,MAAM,CAAC,CAAA,EAAG;AAErE,IAAA,MAAM,GAAA,GAAMD,wBAAA,CAAa,MAAA,CAAO,GAAG,CAAA;AACnC,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA,EAAG;AACrB,MAAA,OAAA,CAAQ,GAAA,CAAI,KAAK,MAAM,CAAA;AAAA,IACzB;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,OAAA,CAAQ,MAAA,EAAQ,CAAA;AAC7B;AAEA,SAAS,YAAA,CAAa,OAAc,MAAA,EAA2D;AAC7F,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,OAAA,CAAQ,KAAA,CAAM,OAAO,CAAA,CACxC,MAAA;AAAA,IACC,CAAC,GAAG,MAAM,CAAA,KAAM,OAAO,MAAA,KAAW,QAAA,IAAY,aAAA,CAAc,MAAM,CAAA,KAAMA,wBAAA,CAAa,MAAM;AAAA,IAE5F,GAAA,CAAI,CAAC,CAAC,GAAG,MAAM,GAAG,CAAA;AACrB,EAAA,MAAM,IAAA,GAAOQ,2BAAA,CAAgB,MAAM,CAAA,CAAE,KAAI,IAAK,EAAA;AAC9C,EAAA,OAAO,MAAA,CAAO,MAAA,GAAS,CAAA,GAAI,EAAE,QAAQ,UAAA,EAAY,KAAA,EAAM,GAAI,EAAE,MAAA,EAAQ,CAAC,IAAI,CAAA,EAAG,YAAY,IAAA,EAAK;AAChG;AAEA,SAAS,WAAW,KAAA,EAAc,EAAE,KAAK,MAAA,EAAQ,OAAA,IAAmB,QAAA,EAAmB;AAErF,EAAA,MAAM,OAAA,GAAUC,qCAAA;AAAA,IACdJ,8BAAA,CAAgB,UAAU,MAAM,CAAA;AAAA,IAChC,KAAA,CAAM,YAAA;AAAA,IACN,QAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,EAAE,MAAA,EAAQ,UAAA,EAAW,GAAI,YAAA,CAAa,OAAO,MAAM,CAAA;AACzD,EAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,MAAA,CAAO,IAAA,CAAK,CAAC,UAAU,OAAA,CAAQ,GAAA,CAAI,KAAK,CAAC,CAAA,EAAG;AAClE,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,EAAE,OAAA,EAAS,YAAA,EAAa,GAAI,KAAA;AAClC,EAAA,OAAO,EAAE,MAAA,EAAQ,KAAA,EAAO,OAAA,EAAS,YAAA,EAAc,MAAA,EAAQ,OAAA,EAAS,CAAC,GAAG,OAAO,CAAA,EAAG,UAAA,EAAW;AAC3F;AAGO,SAAS,gCACd,QAAA,EACA,OAAA,GAA2B,EAAE,aAAA,EAAe,OAAM,EACX;AACvC,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAwC;AAC9D,EAAA,MAAM,MAAA,GAAS,EAAE,GAAG,OAAA,EAAS,UAAU,QAAA,EAAU,aAAA,CAAc,QAAQ,CAAA,EAAE;AACzE,EAAA,KAAA,MAAW,KAAA,IAAS,QAAA,CAAS,QAAQ,CAAA,EAAG;AACtC,IAAA,KAAA,MAAW,MAAA,IAAU,SAAA,CAAU,KAAA,EAAO,MAAM,CAAA,EAAG;AAC7C,MAAA,MAAM,QAAA,GAAW,UAAA,CAAW,KAAA,EAAO,MAAA,EAAQ,QAAQ,CAAA;AACnD,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,SAAA,CAAU,CAAC,MAAA,CAAO,KAAK,QAAA,EAAU,YAAA,EAAc,QAAA,EAAU,MAAM,CAAC,CAAA;AACjF,MAAA,IAAI,aAAa,IAAA,IAAQ,CAAC,SAAA,CAAU,GAAA,CAAI,GAAG,CAAA,EAAG;AAC5C,QAAA,SAAA,CAAU,GAAA,CAAI,KAAK,QAAQ,CAAA;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,SAAA,CAAU,MAAA,EAAQ,CAAA;AAC/B;;"}

package/dist/domain/openapi/discriminator-conflicts.mjs

@@ -1,6 +1,7 @@
+import { appendAll } from '../append-all.mjs';
 import { resolveLocalRef, admittedPropertyValues } from './admitted-values.mjs';
 import { unionAt, isUnionMember } from './discriminated-union.mjs';
-import { escapePointerSegment, parseRefPointer, createRef } from './json-pointer.mjs';
+import { escapePointerSegment, canonicalRef, parseRefPointer, appendPointer, ROOT_POINTER } from './json-pointer.mjs';
 
 const COMPONENT_SCHEMAS = "#/components/schemas/";
 function isObject(value) {
@@ -12,7 +13,7 @@ function refsOf(list) {
   );
 }
 function mappingTarget(target) {
-  return target.startsWith("#") ? target : `${COMPONENT_SCHEMAS}${escapePointerSegment(target)}`;
+  return target.startsWith("#") ? canonicalRef(target) : `${COMPONENT_SCHEMAS}${escapePointerSegment(target)}`;
 }
 function ownerAt(node, pointer) {
   const discriminator = node.discriminator;
@@ -29,7 +30,7 @@ function pointerOf(visit) {
   for (let current = visit; current?.key != null; current = current.parent) {
     segments.unshift(current.key);
   }
-  return createRef(segments);
+  return appendPointer(ROOT_POINTER, segments);
 }
 function childrenOf(visit) {
   const { node } = visit;
@@ -44,7 +45,7 @@ function ownersIn(document) {
     if (owner !== null) {
       found.push(owner);
     }
-    stack.push(...childrenOf(visit).reverse());
+    appendAll(stack, childrenOf(visit).reverse());
   }
   return found;
 }
@@ -97,14 +98,17 @@ function membersOf(owner, search) {
   const listed = owner.memberRefs.map((ref) => ({ ref, skipped: /* @__PURE__ */ new Set([owner.pointer]) }));
   const members = /* @__PURE__ */ new Map();
   for (const member of [...listed, ...inheritingMembers(owner, search)]) {
-    if (!members.has(member.ref)) {
-      members.set(member.ref, member);
+    const key = canonicalRef(member.ref);
+    if (!members.has(key)) {
+      members.set(key, member);
     }
   }
   return [...members.values()];
 }
 function memberValues(owner, member) {
-  const values = Object.entries(owner.mapping).filter(([, target]) => typeof target === "string" && mappingTarget(target) === member).map(([key]) => key);
+  const values = Object.entries(owner.mapping).filter(
+    ([, target]) => typeof target === "string" && mappingTarget(target) === canonicalRef(member)
+  ).map(([key]) => key);
   const name = parseRefPointer(member).pop() ?? "";
   return values.length > 0 ? { values, isImplicit: false } : { values: [name], isImplicit: true };
 }

package/dist/domain/openapi/discriminator-conflicts.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"discriminator-conflicts.mjs","sources":["../../../src/domain/openapi/discriminator-conflicts.ts"],"sourcesContent":["import { admittedPropertyValues, resolveLocalRef } from \"./admitted-values.js\";\nimport { isUnionMember, unionAt } from \"./discriminated-union.js\";\nimport { createRef, escapePointerSegment, parseRefPointer } from \"./json-pointer.js\";\n\n/**\n * Discriminator members whose discriminator value their own property does not allow. By the\n * Discriminator Object rule, a member that no `mapping` entry names has its schema name as the\n * value, so with a property `enum` (or `const`) that does not list it no value of the member\n * matches, and where the generator adds the value to the member the property type is `never`.\n * Each one gets a warning (CODING_PRINCIPLES §8.7).\n */\n\nexport interface DiscriminatorValueConflict {\n  /** The member schema, such as `#/components/schemas/EpisodeObject`. */\n  readonly member: string;\n  /** The schema that has the Discriminator Object. */\n  readonly owner: string;\n  readonly propertyName: string;\n  /** The values the discriminator gives the member: its mapping keys, or its name. */\n  readonly values: readonly string[];\n  /** The values the member's property allows. */\n  readonly allowed: readonly (string | number | boolean | null)[];\n  /** Whether no mapping entry names the member, so its value is its schema name. */\n  readonly isImplicit: boolean;\n}\n\ntype JsonObject = Readonly<Record<string, unknown>>;\n\nconst COMPONENT_SCHEMAS = \"#/components/schemas/\";\n\nfunction isObject(value: unknown): value is JsonObject {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\ninterface Owner {\n  readonly pointer: string;\n  readonly propertyName: string;\n  readonly mapping: Readonly<Record<string, string>>;\n  readonly memberRefs: readonly string[];\n}\n\nfunction refsOf(list: unknown): string[] {\n  return (Array.isArray(list) ? list : []).flatMap((item) =>\n    isObject(item) && typeof item.$ref === \"string\" ? [item.$ref] : [],\n  );\n}\n\nfunction mappingTarget(target: string): string {\n  return target.startsWith(\"#\") ? target : `${COMPONENT_SCHEMAS}${escapePointerSegment(target)}`;\n}\n\nfunction ownerAt(node: JsonObject, pointer: () => string): Owner | null {\n  const discriminator = node.discriminator;\n  if (!isObject(discriminator) || typeof discriminator.propertyName !== \"string\") {\n    return null;\n  }\n  const mapping = isObject(discriminator.mapping)\n    ? (discriminator.mapping as Readonly<Record<string, string>>)\n    : {};\n  const mapped = Object.values(mapping)\n    .filter((t) => typeof t === \"string\")\n    .map(mappingTarget);\n  const memberRefs = [...refsOf(node.oneOf), ...refsOf(node.anyOf), ...mapped];\n  return { pointer: pointer(), propertyName: discriminator.propertyName, mapping, memberRefs };\n}\n\n/** A node of the document walk; the pointer is built only for the nodes that need it. */\ninterface Visit {\n  readonly node: unknown;\n  readonly key: string | null;\n  readonly parent: Visit | null;\n}\n\nfunction pointerOf(visit: Visit): string {\n  const segments: string[] = [];\n  for (let current: Visit | null = visit; current?.key != null; current = current.parent) {\n    segments.unshift(current.key);\n  }\n  return createRef(segments);\n}\n\nfunction childrenOf(visit: Visit): Visit[] {\n  const { node } = visit;\n  const entries: [string, unknown][] = Array.isArray(node)\n    ? node.map((item, index) => [String(index), item])\n    : isObject(node)\n      ? Object.entries(node)\n      : [];\n  return entries.map(([key, child]) => ({ node: child, key, parent: visit }));\n}\n\n/**\n * Every Discriminator Object of the document, depth first, with its pointer. The walk keeps its\n * own stack, so a document nested past the call stack fails in the transform, as it did before.\n */\nfunction ownersIn(document: unknown): Owner[] {\n  const found: Owner[] = [];\n  const stack: Visit[] = [{ node: document, key: null, parent: null }];\n  for (let visit = stack.pop(); visit !== undefined; visit = stack.pop()) {\n    const owner = isObject(visit.node) ? ownerAt(visit.node, () => pointerOf(visit)) : null;\n    if (owner !== null) {\n      found.push(owner);\n    }\n    stack.push(...childrenOf(visit).reverse());\n  }\n  return found;\n}\n\n/** A member and the `$ref`s whose properties its type leaves out (`Omit` of its parents). */\ninterface Member {\n  readonly ref: string;\n  readonly skipped: ReadonlySet<string>;\n}\n\ninterface Child {\n  readonly ref: string;\n  readonly schema: JsonObject;\n}\n\n/** How the run types an `allOf` of a discriminated union. */\nexport interface ConflictOptions {\n  /**\n   * `allof-discriminated-union`: a schema that `allOf`s a union which does not contain it reuses\n   * the union and gets no value, so neither it nor the schemas below it are members.\n   */\n  readonly isUnionReused: boolean;\n}\n\n/** What the search for conflicts reads: the document and its `allOf` children by parent. */\ninterface ConflictSearch extends ConflictOptions {\n  readonly document: unknown;\n  readonly children: ReadonlyMap<string, readonly Child[]>;\n}\n\n/** The `allOf` children of the owner that inherit its discriminator. */\nfunction inheritingChildren(owner: Owner, search: ConflictSearch): readonly Child[] {\n  const children = search.children.get(owner.pointer) ?? [];\n  const resolve = (ref: string) => resolveLocalRef(search.document, ref);\n  const union = search.isUnionReused ? unionAt(owner.pointer, resolve) : undefined;\n  return union === undefined\n    ? children\n    : children.filter((child) => isUnionMember(union, child.ref, resolve));\n}\n\n/** The component schemas whose `allOf` holds a `$ref`, by that `$ref`, in document order. */\nfunction allOfChildren(document: unknown): Map<string, Child[]> {\n  const schemas = resolveLocalRef(document, \"#/components/schemas\");\n  const children = new Map<string, Child[]>();\n  for (const [name, schema] of Object.entries(isObject(schemas) ? schemas : {})) {\n    if (!isObject(schema)) {\n      continue;\n    }\n    const child = { ref: `${COMPONENT_SCHEMAS}${escapePointerSegment(name)}`, schema };\n    for (const parent of new Set(refsOf(schema.allOf))) {\n      const siblings = children.get(parent) ?? [];\n      siblings.push(child);\n      children.set(parent, siblings);\n    }\n  }\n  return children;\n}\n\n/** Whether a schema defines a discriminator of the property itself: it is the owner below. */\nfunction ownsProperty(schema: JsonObject, propertyName: string): boolean {\n  const discriminator = schema.discriminator;\n  return isObject(discriminator) && discriminator.propertyName === propertyName;\n}\n\n/**\n * Component schemas that inherit the owner through `allOf`, also through a chain\n * (`Lion: { allOf: [Cat] }`, `Cat: { allOf: [Pet] }`). Each parent on the way is left out of the\n * member's values, as its type omits the property. A schema with its own discriminator of the\n * property is a member, but the schemas below it are its own members.\n */\nfunction inheritingMembers(owner: Owner, search: ConflictSearch): Member[] {\n  const found: Member[] = [];\n  const visited = new Set([owner.pointer]);\n  const parents: Member[] = [{ ref: owner.pointer, skipped: new Set([owner.pointer]) }];\n  for (let parent = parents.shift(); parent !== undefined; parent = parents.shift()) {\n    const children =\n      parent.ref === owner.pointer\n        ? inheritingChildren(owner, search)\n        : (search.children.get(parent.ref) ?? []);\n    for (const child of children) {\n      if (visited.has(child.ref)) {\n        continue;\n      }\n      visited.add(child.ref);\n      found.push({ ref: child.ref, skipped: parent.skipped });\n      if (!ownsProperty(child.schema, owner.propertyName)) {\n        parents.push({ ref: child.ref, skipped: new Set([...parent.skipped, child.ref]) });\n      }\n    }\n  }\n  return found;\n}\n\n/** The members of an owner, each once: the listed and mapped ones, then the inheriting ones. */\nfunction membersOf(owner: Owner, search: ConflictSearch): Member[] {\n  const listed = owner.memberRefs.map((ref) => ({ ref, skipped: new Set([owner.pointer]) }));\n  const members = new Map<string, Member>();\n  for (const member of [...listed, ...inheritingMembers(owner, search)]) {\n    if (!members.has(member.ref)) {\n      members.set(member.ref, member);\n    }\n  }\n  return [...members.values()];\n}\n\nfunction memberValues(owner: Owner, member: string): { values: string[]; isImplicit: boolean } {\n  const values = Object.entries(owner.mapping)\n    .filter(([, target]) => typeof target === \"string\" && mappingTarget(target) === member)\n    .map(([key]) => key);\n  const name = parseRefPointer(member).pop() ?? \"\";\n  return values.length > 0 ? { values, isImplicit: false } : { values: [name], isImplicit: true };\n}\n\nfunction conflictOf(owner: Owner, { ref: member, skipped }: Member, document: unknown) {\n  // The owner's own property is left out of an inheriting member's type (`Omit`).\n  const allowed = admittedPropertyValues(\n    resolveLocalRef(document, member),\n    owner.propertyName,\n    document,\n    skipped,\n  );\n  const { values, isImplicit } = memberValues(owner, member);\n  if (allowed === null || values.some((value) => allowed.has(value))) {\n    return null;\n  }\n  const { pointer, propertyName } = owner;\n  return { member, owner: pointer, propertyName, values, allowed: [...allowed], isImplicit };\n}\n\n/** The conflicts of the document, one per member and value list, in document order. */\nexport function findDiscriminatorValueConflicts(\n  document: unknown,\n  options: ConflictOptions = { isUnionReused: false },\n): readonly DiscriminatorValueConflict[] {\n  const conflicts = new Map<string, DiscriminatorValueConflict>();\n  const search = { ...options, document, children: allOfChildren(document) };\n  for (const owner of ownersIn(document)) {\n    for (const member of membersOf(owner, search)) {\n      const conflict = conflictOf(owner, member, document);\n      const key = JSON.stringify([member.ref, conflict?.propertyName, conflict?.values]);\n      if (conflict !== null && !conflicts.has(key)) {\n        conflicts.set(key, conflict);\n      }\n    }\n  }\n  return [...conflicts.values()];\n}\n"],"names":[],"mappings":";;;;AA4BA,MAAM,iBAAA,GAAoB,uBAAA;AAE1B,SAAS,SAAS,KAAA,EAAqC;AACrD,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,KAAU,QAAQ,CAAC,KAAA,CAAM,QAAQ,KAAK,CAAA;AAC5E;AASA,SAAS,OAAO,IAAA,EAAyB;AACvC,EAAA,OAAA,CAAQ,MAAM,OAAA,CAAQ,IAAI,CAAA,GAAI,IAAA,GAAO,EAAC,EAAG,OAAA;AAAA,IAAQ,CAAC,IAAA,KAChD,QAAA,CAAS,IAAI,CAAA,IAAK,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,GAAW,CAAC,IAAA,CAAK,IAAI,IAAI;AAAC,GACnE;AACF;AAEA,SAAS,cAAc,MAAA,EAAwB;AAC7C,EAAA,OAAO,MAAA,CAAO,UAAA,CAAW,GAAG,CAAA,GAAI,MAAA,GAAS,GAAG,iBAAiB,CAAA,EAAG,oBAAA,CAAqB,MAAM,CAAC,CAAA,CAAA;AAC9F;AAEA,SAAS,OAAA,CAAQ,MAAkB,OAAA,EAAqC;AACtE,EAAA,MAAM,gBAAgB,IAAA,CAAK,aAAA;AAC3B,EAAA,IAAI,CAAC,QAAA,CAAS,aAAa,KAAK,OAAO,aAAA,CAAc,iBAAiB,QAAA,EAAU;AAC9E,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,UAAU,QAAA,CAAS,aAAA,CAAc,OAAO,CAAA,GACzC,aAAA,CAAc,UACf,EAAC;AACL,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,MAAA,CAAO,OAAO,CAAA,CACjC,MAAA,CAAO,CAAC,CAAA,KAAM,OAAO,CAAA,KAAM,QAAQ,CAAA,CACnC,IAAI,aAAa,CAAA;AACpB,EAAA,MAAM,UAAA,GAAa,CAAC,GAAG,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,EAAG,GAAG,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,EAAG,GAAG,MAAM,CAAA;AAC3E,EAAA,OAAO,EAAE,SAAS,OAAA,EAAQ,EAAG,cAAc,aAAA,CAAc,YAAA,EAAc,SAAS,UAAA,EAAW;AAC7F;AASA,SAAS,UAAU,KAAA,EAAsB;AACvC,EAAA,MAAM,WAAqB,EAAC;AAC5B,EAAA,KAAA,IAAS,UAAwB,KAAA,EAAO,OAAA,EAAS,OAAO,IAAA,EAAM,OAAA,GAAU,QAAQ,MAAA,EAAQ;AACtF,IAAA,QAAA,CAAS,OAAA,CAAQ,QAAQ,GAAG,CAAA;AAAA,EAC9B;AACA,EAAA,OAAO,UAAU,QAAQ,CAAA;AAC3B;AAEA,SAAS,WAAW,KAAA,EAAuB;AACzC,EAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,EAAA,MAAM,OAAA,GAA+B,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,GACnD,KAAK,GAAA,CAAI,CAAC,IAAA,EAAM,KAAA,KAAU,CAAC,MAAA,CAAO,KAAK,CAAA,EAAG,IAAI,CAAC,CAAA,GAC/C,QAAA,CAAS,IAAI,IACX,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,GACnB,EAAC;AACP,EAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,GAAA,EAAK,KAAK,CAAA,MAAO,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,MAAA,EAAQ,OAAM,CAAE,CAAA;AAC5E;AAMA,SAAS,SAAS,QAAA,EAA4B;AAC5C,EAAA,MAAM,QAAiB,EAAC;AACxB,EAAA,MAAM,KAAA,GAAiB,CAAC,EAAE,IAAA,EAAM,UAAU,GAAA,EAAK,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,CAAA;AACnE,EAAA,KAAA,IAAS,KAAA,GAAQ,MAAM,GAAA,EAAI,EAAG,UAAU,MAAA,EAAW,KAAA,GAAQ,KAAA,CAAM,GAAA,EAAI,EAAG;AACtE,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,CAAM,IAAI,CAAA,GAAI,OAAA,CAAQ,KAAA,CAAM,IAAA,EAAM,MAAM,SAAA,CAAU,KAAK,CAAC,CAAA,GAAI,IAAA;AACnF,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAAA,IAClB;AACA,IAAA,KAAA,CAAM,KAAK,GAAG,UAAA,CAAW,KAAK,CAAA,CAAE,SAAS,CAAA;AAAA,EAC3C;AACA,EAAA,OAAO,KAAA;AACT;AA6BA,SAAS,kBAAA,CAAmB,OAAc,MAAA,EAA0C;AAClF,EAAA,MAAM,WAAW,MAAA,CAAO,QAAA,CAAS,IAAI,KAAA,CAAM,OAAO,KAAK,EAAC;AACxD,EAAA,MAAM,UAAU,CAAC,GAAA,KAAgB,eAAA,CAAgB,MAAA,CAAO,UAAU,GAAG,CAAA;AACrE,EAAA,MAAM,QAAQ,MAAA,CAAO,aAAA,GAAgB,QAAQ,KAAA,CAAM,OAAA,EAAS,OAAO,CAAA,GAAI,MAAA;AACvE,EAAA,OAAO,KAAA,KAAU,MAAA,GACb,QAAA,GACA,QAAA,CAAS,MAAA,CAAO,CAAC,KAAA,KAAU,aAAA,CAAc,KAAA,EAAO,KAAA,CAAM,GAAA,EAAK,OAAO,CAAC,CAAA;AACzE;AAGA,SAAS,cAAc,QAAA,EAAyC;AAC9D,EAAA,MAAM,OAAA,GAAU,eAAA,CAAgB,QAAA,EAAU,sBAAsB,CAAA;AAChE,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAqB;AAC1C,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,MAAM,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,QAAA,CAAS,OAAO,CAAA,GAAI,OAAA,GAAU,EAAE,CAAA,EAAG;AAC7E,IAAA,IAAI,CAAC,QAAA,CAAS,MAAM,CAAA,EAAG;AACrB,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAA,GAAQ,EAAE,GAAA,EAAK,CAAA,EAAG,iBAAiB,GAAG,oBAAA,CAAqB,IAAI,CAAC,CAAA,CAAA,EAAI,MAAA,EAAO;AACjF,IAAA,KAAA,MAAW,UAAU,IAAI,GAAA,CAAI,OAAO,MAAA,CAAO,KAAK,CAAC,CAAA,EAAG;AAClD,MAAA,MAAM,QAAA,GAAW,QAAA,CAAS,GAAA,CAAI,MAAM,KAAK,EAAC;AAC1C,MAAA,QAAA,CAAS,KAAK,KAAK,CAAA;AACnB,MAAA,QAAA,CAAS,GAAA,CAAI,QAAQ,QAAQ,CAAA;AAAA,IAC/B;AAAA,EACF;AACA,EAAA,OAAO,QAAA;AACT;AAGA,SAAS,YAAA,CAAa,QAAoB,YAAA,EAA+B;AACvE,EAAA,MAAM,gBAAgB,MAAA,CAAO,aAAA;AAC7B,EAAA,OAAO,QAAA,CAAS,aAAa,CAAA,IAAK,aAAA,CAAc,YAAA,KAAiB,YAAA;AACnE;AAQA,SAAS,iBAAA,CAAkB,OAAc,MAAA,EAAkC;AACzE,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,MAAM,0BAAU,IAAI,GAAA,CAAI,CAAC,KAAA,CAAM,OAAO,CAAC,CAAA;AACvC,EAAA,MAAM,OAAA,GAAoB,CAAC,EAAE,GAAA,EAAK,MAAM,OAAA,EAAS,OAAA,kBAAS,IAAI,GAAA,CAAI,CAAC,KAAA,CAAM,OAAO,CAAC,GAAG,CAAA;AACpF,EAAA,KAAA,IAAS,MAAA,GAAS,QAAQ,KAAA,EAAM,EAAG,WAAW,MAAA,EAAW,MAAA,GAAS,OAAA,CAAQ,KAAA,EAAM,EAAG;AACjF,IAAA,MAAM,QAAA,GACJ,MAAA,CAAO,GAAA,KAAQ,KAAA,CAAM,UACjB,kBAAA,CAAmB,KAAA,EAAO,MAAM,CAAA,GAC/B,OAAO,QAAA,CAAS,GAAA,CAAI,MAAA,CAAO,GAAG,KAAK,EAAC;AAC3C,IAAA,KAAA,MAAW,SAAS,QAAA,EAAU;AAC5B,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,KAAA,CAAM,GAAG,CAAA,EAAG;AAC1B,QAAA;AAAA,MACF;AACA,MAAA,OAAA,CAAQ,GAAA,CAAI,MAAM,GAAG,CAAA;AACrB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,GAAA,EAAK,KAAA,CAAM,KAAK,OAAA,EAAS,MAAA,CAAO,SAAS,CAAA;AACtD,MAAA,IAAI,CAAC,YAAA,CAAa,KAAA,CAAM,MAAA,EAAQ,KAAA,CAAM,YAAY,CAAA,EAAG;AACnD,QAAA,OAAA,CAAQ,KAAK,EAAE,GAAA,EAAK,KAAA,CAAM,GAAA,EAAK,yBAAS,IAAI,GAAA,CAAI,CAAC,GAAG,OAAO,OAAA,EAAS,KAAA,CAAM,GAAG,CAAC,GAAG,CAAA;AAAA,MACnF;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,SAAA,CAAU,OAAc,MAAA,EAAkC;AACjE,EAAA,MAAM,SAAS,KAAA,CAAM,UAAA,CAAW,GAAA,CAAI,CAAC,SAAS,EAAE,GAAA,EAAK,OAAA,kBAAS,IAAI,IAAI,CAAC,KAAA,CAAM,OAAO,CAAC,GAAE,CAAE,CAAA;AACzF,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAoB;AACxC,EAAA,KAAA,MAAW,MAAA,IAAU,CAAC,GAAG,MAAA,EAAQ,GAAG,iBAAA,CAAkB,KAAA,EAAO,MAAM,CAAC,CAAA,EAAG;AACrE,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,GAAG,CAAA,EAAG;AAC5B,MAAA,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,GAAA,EAAK,MAAM,CAAA;AAAA,IAChC;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,OAAA,CAAQ,MAAA,EAAQ,CAAA;AAC7B;AAEA,SAAS,YAAA,CAAa,OAAc,MAAA,EAA2D;AAC7F,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,OAAA,CAAQ,KAAA,CAAM,OAAO,EACxC,MAAA,CAAO,CAAC,GAAG,MAAM,CAAA,KAAM,OAAO,MAAA,KAAW,QAAA,IAAY,aAAA,CAAc,MAAM,CAAA,KAAM,MAAM,CAAA,CACrF,GAAA,CAAI,CAAC,CAAC,GAAG,CAAA,KAAM,GAAG,CAAA;AACrB,EAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,MAAM,CAAA,CAAE,KAAI,IAAK,EAAA;AAC9C,EAAA,OAAO,MAAA,CAAO,MAAA,GAAS,CAAA,GAAI,EAAE,QAAQ,UAAA,EAAY,KAAA,EAAM,GAAI,EAAE,MAAA,EAAQ,CAAC,IAAI,CAAA,EAAG,YAAY,IAAA,EAAK;AAChG;AAEA,SAAS,WAAW,KAAA,EAAc,EAAE,KAAK,MAAA,EAAQ,OAAA,IAAmB,QAAA,EAAmB;AAErF,EAAA,MAAM,OAAA,GAAU,sBAAA;AAAA,IACd,eAAA,CAAgB,UAAU,MAAM,CAAA;AAAA,IAChC,KAAA,CAAM,YAAA;AAAA,IACN,QAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,EAAE,MAAA,EAAQ,UAAA,EAAW,GAAI,YAAA,CAAa,OAAO,MAAM,CAAA;AACzD,EAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,MAAA,CAAO,IAAA,CAAK,CAAC,UAAU,OAAA,CAAQ,GAAA,CAAI,KAAK,CAAC,CAAA,EAAG;AAClE,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,EAAE,OAAA,EAAS,YAAA,EAAa,GAAI,KAAA;AAClC,EAAA,OAAO,EAAE,MAAA,EAAQ,KAAA,EAAO,OAAA,EAAS,YAAA,EAAc,MAAA,EAAQ,OAAA,EAAS,CAAC,GAAG,OAAO,CAAA,EAAG,UAAA,EAAW;AAC3F;AAGO,SAAS,gCACd,QAAA,EACA,OAAA,GAA2B,EAAE,aAAA,EAAe,OAAM,EACX;AACvC,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAwC;AAC9D,EAAA,MAAM,MAAA,GAAS,EAAE,GAAG,OAAA,EAAS,UAAU,QAAA,EAAU,aAAA,CAAc,QAAQ,CAAA,EAAE;AACzE,EAAA,KAAA,MAAW,KAAA,IAAS,QAAA,CAAS,QAAQ,CAAA,EAAG;AACtC,IAAA,KAAA,MAAW,MAAA,IAAU,SAAA,CAAU,KAAA,EAAO,MAAM,CAAA,EAAG;AAC7C,MAAA,MAAM,QAAA,GAAW,UAAA,CAAW,KAAA,EAAO,MAAA,EAAQ,QAAQ,CAAA;AACnD,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,SAAA,CAAU,CAAC,MAAA,CAAO,KAAK,QAAA,EAAU,YAAA,EAAc,QAAA,EAAU,MAAM,CAAC,CAAA;AACjF,MAAA,IAAI,aAAa,IAAA,IAAQ,CAAC,SAAA,CAAU,GAAA,CAAI,GAAG,CAAA,EAAG;AAC5C,QAAA,SAAA,CAAU,GAAA,CAAI,KAAK,QAAQ,CAAA;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,SAAA,CAAU,MAAA,EAAQ,CAAA;AAC/B;;"}
+{"version":3,"file":"discriminator-conflicts.mjs","sources":["../../../src/domain/openapi/discriminator-conflicts.ts"],"sourcesContent":["import { appendAll } from \"../append-all.js\";\nimport { admittedPropertyValues, resolveLocalRef } from \"./admitted-values.js\";\nimport { isUnionMember, unionAt } from \"./discriminated-union.js\";\nimport {\n  appendPointer,\n  canonicalRef,\n  escapePointerSegment,\n  parseRefPointer,\n  ROOT_POINTER,\n} from \"./json-pointer.js\";\n\n/**\n * Discriminator members whose discriminator value their own property does not allow. By the\n * Discriminator Object rule, a member that no `mapping` entry names has its schema name as the\n * value, so with a property `enum` (or `const`) that does not list it no value of the member\n * matches, and where the generator adds the value to the member the property type is `never`.\n * Each one gets a warning (CODING_PRINCIPLES §8.7).\n */\n\nexport interface DiscriminatorValueConflict {\n  /** The member schema, such as `#/components/schemas/EpisodeObject`. */\n  readonly member: string;\n  /** The schema that has the Discriminator Object. */\n  readonly owner: string;\n  readonly propertyName: string;\n  /** The values the discriminator gives the member: its mapping keys, or its name. */\n  readonly values: readonly string[];\n  /** The values the member's property allows. */\n  readonly allowed: readonly (string | number | boolean | null)[];\n  /** Whether no mapping entry names the member, so its value is its schema name. */\n  readonly isImplicit: boolean;\n}\n\ntype JsonObject = Readonly<Record<string, unknown>>;\n\nconst COMPONENT_SCHEMAS = \"#/components/schemas/\";\n\nfunction isObject(value: unknown): value is JsonObject {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\ninterface Owner {\n  readonly pointer: string;\n  readonly propertyName: string;\n  readonly mapping: Readonly<Record<string, string>>;\n  readonly memberRefs: readonly string[];\n}\n\nfunction refsOf(list: unknown): string[] {\n  return (Array.isArray(list) ? list : []).flatMap((item) =>\n    isObject(item) && typeof item.$ref === \"string\" ? [item.$ref] : [],\n  );\n}\n\n/** A mapping value as a canonical `$ref`: Redocly writes it percent-decoded (`canonicalRef`). */\nfunction mappingTarget(target: string): string {\n  return target.startsWith(\"#\")\n    ? canonicalRef(target)\n    : `${COMPONENT_SCHEMAS}${escapePointerSegment(target)}`;\n}\n\nfunction ownerAt(node: JsonObject, pointer: () => string): Owner | null {\n  const discriminator = node.discriminator;\n  if (!isObject(discriminator) || typeof discriminator.propertyName !== \"string\") {\n    return null;\n  }\n  const mapping = isObject(discriminator.mapping)\n    ? (discriminator.mapping as Readonly<Record<string, string>>)\n    : {};\n  const mapped = Object.values(mapping)\n    .filter((t) => typeof t === \"string\")\n    .map(mappingTarget);\n  const memberRefs = [...refsOf(node.oneOf), ...refsOf(node.anyOf), ...mapped];\n  return { pointer: pointer(), propertyName: discriminator.propertyName, mapping, memberRefs };\n}\n\n/** A node of the document walk; the pointer is built only for the nodes that need it. */\ninterface Visit {\n  readonly node: unknown;\n  readonly key: string | null;\n  readonly parent: Visit | null;\n}\n\nfunction pointerOf(visit: Visit): string {\n  const segments: string[] = [];\n  for (let current: Visit | null = visit; current?.key != null; current = current.parent) {\n    segments.unshift(current.key);\n  }\n  return appendPointer(ROOT_POINTER, segments);\n}\n\nfunction childrenOf(visit: Visit): Visit[] {\n  const { node } = visit;\n  const entries: [string, unknown][] = Array.isArray(node)\n    ? node.map((item, index) => [String(index), item])\n    : isObject(node)\n      ? Object.entries(node)\n      : [];\n  return entries.map(([key, child]) => ({ node: child, key, parent: visit }));\n}\n\n/**\n * Every Discriminator Object of the document, depth first, with its pointer. The walk keeps its\n * own stack, so a document nested past the call stack fails in the transform, as it did before.\n */\nfunction ownersIn(document: unknown): Owner[] {\n  const found: Owner[] = [];\n  const stack: Visit[] = [{ node: document, key: null, parent: null }];\n  for (let visit = stack.pop(); visit !== undefined; visit = stack.pop()) {\n    const owner = isObject(visit.node) ? ownerAt(visit.node, () => pointerOf(visit)) : null;\n    if (owner !== null) {\n      found.push(owner);\n    }\n    appendAll(stack, childrenOf(visit).reverse());\n  }\n  return found;\n}\n\n/** A member and the `$ref`s whose properties its type leaves out (`Omit` of its parents). */\ninterface Member {\n  readonly ref: string;\n  readonly skipped: ReadonlySet<string>;\n}\n\ninterface Child {\n  readonly ref: string;\n  readonly schema: JsonObject;\n}\n\n/** How the run types an `allOf` of a discriminated union. */\nexport interface ConflictOptions {\n  /**\n   * `allof-discriminated-union`: a schema that `allOf`s a union which does not contain it reuses\n   * the union and gets no value, so neither it nor the schemas below it are members.\n   */\n  readonly isUnionReused: boolean;\n}\n\n/** What the search for conflicts reads: the document and its `allOf` children by parent. */\ninterface ConflictSearch extends ConflictOptions {\n  readonly document: unknown;\n  readonly children: ReadonlyMap<string, readonly Child[]>;\n}\n\n/** The `allOf` children of the owner that inherit its discriminator. */\nfunction inheritingChildren(owner: Owner, search: ConflictSearch): readonly Child[] {\n  const children = search.children.get(owner.pointer) ?? [];\n  const resolve = (ref: string) => resolveLocalRef(search.document, ref);\n  const union = search.isUnionReused ? unionAt(owner.pointer, resolve) : undefined;\n  return union === undefined\n    ? children\n    : children.filter((child) => isUnionMember(union, child.ref, resolve));\n}\n\n/** The component schemas whose `allOf` holds a `$ref`, by that `$ref`, in document order. */\nfunction allOfChildren(document: unknown): Map<string, Child[]> {\n  const schemas = resolveLocalRef(document, \"#/components/schemas\");\n  const children = new Map<string, Child[]>();\n  for (const [name, schema] of Object.entries(isObject(schemas) ? schemas : {})) {\n    if (!isObject(schema)) {\n      continue;\n    }\n    const child = { ref: `${COMPONENT_SCHEMAS}${escapePointerSegment(name)}`, schema };\n    for (const parent of new Set(refsOf(schema.allOf))) {\n      const siblings = children.get(parent) ?? [];\n      siblings.push(child);\n      children.set(parent, siblings);\n    }\n  }\n  return children;\n}\n\n/** Whether a schema defines a discriminator of the property itself: it is the owner below. */\nfunction ownsProperty(schema: JsonObject, propertyName: string): boolean {\n  const discriminator = schema.discriminator;\n  return isObject(discriminator) && discriminator.propertyName === propertyName;\n}\n\n/**\n * Component schemas that inherit the owner through `allOf`, also through a chain\n * (`Lion: { allOf: [Cat] }`, `Cat: { allOf: [Pet] }`). Each parent on the way is left out of the\n * member's values, as its type omits the property. A schema with its own discriminator of the\n * property is a member, but the schemas below it are its own members.\n */\nfunction inheritingMembers(owner: Owner, search: ConflictSearch): Member[] {\n  const found: Member[] = [];\n  const visited = new Set([owner.pointer]);\n  const parents: Member[] = [{ ref: owner.pointer, skipped: new Set([owner.pointer]) }];\n  for (let parent = parents.shift(); parent !== undefined; parent = parents.shift()) {\n    const children =\n      parent.ref === owner.pointer\n        ? inheritingChildren(owner, search)\n        : (search.children.get(parent.ref) ?? []);\n    for (const child of children) {\n      if (visited.has(child.ref)) {\n        continue;\n      }\n      visited.add(child.ref);\n      found.push({ ref: child.ref, skipped: parent.skipped });\n      if (!ownsProperty(child.schema, owner.propertyName)) {\n        parents.push({ ref: child.ref, skipped: new Set([...parent.skipped, child.ref]) });\n      }\n    }\n  }\n  return found;\n}\n\n/** The members of an owner, each once: the listed and mapped ones, then the inheriting ones. */\nfunction membersOf(owner: Owner, search: ConflictSearch): Member[] {\n  const listed = owner.memberRefs.map((ref) => ({ ref, skipped: new Set([owner.pointer]) }));\n  const members = new Map<string, Member>();\n  for (const member of [...listed, ...inheritingMembers(owner, search)]) {\n    // A member may be listed by a `$ref` and found by its pointer: both name it canonically.\n    const key = canonicalRef(member.ref);\n    if (!members.has(key)) {\n      members.set(key, member);\n    }\n  }\n  return [...members.values()];\n}\n\nfunction memberValues(owner: Owner, member: string): { values: string[]; isImplicit: boolean } {\n  const values = Object.entries(owner.mapping)\n    .filter(\n      ([, target]) => typeof target === \"string\" && mappingTarget(target) === canonicalRef(member),\n    )\n    .map(([key]) => key);\n  const name = parseRefPointer(member).pop() ?? \"\";\n  return values.length > 0 ? { values, isImplicit: false } : { values: [name], isImplicit: true };\n}\n\nfunction conflictOf(owner: Owner, { ref: member, skipped }: Member, document: unknown) {\n  // The owner's own property is left out of an inheriting member's type (`Omit`).\n  const allowed = admittedPropertyValues(\n    resolveLocalRef(document, member),\n    owner.propertyName,\n    document,\n    skipped,\n  );\n  const { values, isImplicit } = memberValues(owner, member);\n  if (allowed === null || values.some((value) => allowed.has(value))) {\n    return null;\n  }\n  const { pointer, propertyName } = owner;\n  return { member, owner: pointer, propertyName, values, allowed: [...allowed], isImplicit };\n}\n\n/** The conflicts of the document, one per member and value list, in document order. */\nexport function findDiscriminatorValueConflicts(\n  document: unknown,\n  options: ConflictOptions = { isUnionReused: false },\n): readonly DiscriminatorValueConflict[] {\n  const conflicts = new Map<string, DiscriminatorValueConflict>();\n  const search = { ...options, document, children: allOfChildren(document) };\n  for (const owner of ownersIn(document)) {\n    for (const member of membersOf(owner, search)) {\n      const conflict = conflictOf(owner, member, document);\n      const key = JSON.stringify([member.ref, conflict?.propertyName, conflict?.values]);\n      if (conflict !== null && !conflicts.has(key)) {\n        conflicts.set(key, conflict);\n      }\n    }\n  }\n  return [...conflicts.values()];\n}\n"],"names":[],"mappings":";;;;;AAmCA,MAAM,iBAAA,GAAoB,uBAAA;AAE1B,SAAS,SAAS,KAAA,EAAqC;AACrD,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,KAAU,QAAQ,CAAC,KAAA,CAAM,QAAQ,KAAK,CAAA;AAC5E;AASA,SAAS,OAAO,IAAA,EAAyB;AACvC,EAAA,OAAA,CAAQ,MAAM,OAAA,CAAQ,IAAI,CAAA,GAAI,IAAA,GAAO,EAAC,EAAG,OAAA;AAAA,IAAQ,CAAC,IAAA,KAChD,QAAA,CAAS,IAAI,CAAA,IAAK,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,GAAW,CAAC,IAAA,CAAK,IAAI,IAAI;AAAC,GACnE;AACF;AAGA,SAAS,cAAc,MAAA,EAAwB;AAC7C,EAAA,OAAO,MAAA,CAAO,UAAA,CAAW,GAAG,CAAA,GACxB,YAAA,CAAa,MAAM,CAAA,GACnB,CAAA,EAAG,iBAAiB,CAAA,EAAG,oBAAA,CAAqB,MAAM,CAAC,CAAA,CAAA;AACzD;AAEA,SAAS,OAAA,CAAQ,MAAkB,OAAA,EAAqC;AACtE,EAAA,MAAM,gBAAgB,IAAA,CAAK,aAAA;AAC3B,EAAA,IAAI,CAAC,QAAA,CAAS,aAAa,KAAK,OAAO,aAAA,CAAc,iBAAiB,QAAA,EAAU;AAC9E,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,UAAU,QAAA,CAAS,aAAA,CAAc,OAAO,CAAA,GACzC,aAAA,CAAc,UACf,EAAC;AACL,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,MAAA,CAAO,OAAO,CAAA,CACjC,MAAA,CAAO,CAAC,CAAA,KAAM,OAAO,CAAA,KAAM,QAAQ,CAAA,CACnC,IAAI,aAAa,CAAA;AACpB,EAAA,MAAM,UAAA,GAAa,CAAC,GAAG,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,EAAG,GAAG,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,EAAG,GAAG,MAAM,CAAA;AAC3E,EAAA,OAAO,EAAE,SAAS,OAAA,EAAQ,EAAG,cAAc,aAAA,CAAc,YAAA,EAAc,SAAS,UAAA,EAAW;AAC7F;AASA,SAAS,UAAU,KAAA,EAAsB;AACvC,EAAA,MAAM,WAAqB,EAAC;AAC5B,EAAA,KAAA,IAAS,UAAwB,KAAA,EAAO,OAAA,EAAS,OAAO,IAAA,EAAM,OAAA,GAAU,QAAQ,MAAA,EAAQ;AACtF,IAAA,QAAA,CAAS,OAAA,CAAQ,QAAQ,GAAG,CAAA;AAAA,EAC9B;AACA,EAAA,OAAO,aAAA,CAAc,cAAc,QAAQ,CAAA;AAC7C;AAEA,SAAS,WAAW,KAAA,EAAuB;AACzC,EAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,EAAA,MAAM,OAAA,GAA+B,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,GACnD,KAAK,GAAA,CAAI,CAAC,IAAA,EAAM,KAAA,KAAU,CAAC,MAAA,CAAO,KAAK,CAAA,EAAG,IAAI,CAAC,CAAA,GAC/C,QAAA,CAAS,IAAI,IACX,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,GACnB,EAAC;AACP,EAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,GAAA,EAAK,KAAK,CAAA,MAAO,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,MAAA,EAAQ,OAAM,CAAE,CAAA;AAC5E;AAMA,SAAS,SAAS,QAAA,EAA4B;AAC5C,EAAA,MAAM,QAAiB,EAAC;AACxB,EAAA,MAAM,KAAA,GAAiB,CAAC,EAAE,IAAA,EAAM,UAAU,GAAA,EAAK,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,CAAA;AACnE,EAAA,KAAA,IAAS,KAAA,GAAQ,MAAM,GAAA,EAAI,EAAG,UAAU,MAAA,EAAW,KAAA,GAAQ,KAAA,CAAM,GAAA,EAAI,EAAG;AACtE,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,CAAM,IAAI,CAAA,GAAI,OAAA,CAAQ,KAAA,CAAM,IAAA,EAAM,MAAM,SAAA,CAAU,KAAK,CAAC,CAAA,GAAI,IAAA;AACnF,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAAA,IAClB;AACA,IAAA,SAAA,CAAU,KAAA,EAAO,UAAA,CAAW,KAAK,CAAA,CAAE,SAAS,CAAA;AAAA,EAC9C;AACA,EAAA,OAAO,KAAA;AACT;AA6BA,SAAS,kBAAA,CAAmB,OAAc,MAAA,EAA0C;AAClF,EAAA,MAAM,WAAW,MAAA,CAAO,QAAA,CAAS,IAAI,KAAA,CAAM,OAAO,KAAK,EAAC;AACxD,EAAA,MAAM,UAAU,CAAC,GAAA,KAAgB,eAAA,CAAgB,MAAA,CAAO,UAAU,GAAG,CAAA;AACrE,EAAA,MAAM,QAAQ,MAAA,CAAO,aAAA,GAAgB,QAAQ,KAAA,CAAM,OAAA,EAAS,OAAO,CAAA,GAAI,MAAA;AACvE,EAAA,OAAO,KAAA,KAAU,MAAA,GACb,QAAA,GACA,QAAA,CAAS,MAAA,CAAO,CAAC,KAAA,KAAU,aAAA,CAAc,KAAA,EAAO,KAAA,CAAM,GAAA,EAAK,OAAO,CAAC,CAAA;AACzE;AAGA,SAAS,cAAc,QAAA,EAAyC;AAC9D,EAAA,MAAM,OAAA,GAAU,eAAA,CAAgB,QAAA,EAAU,sBAAsB,CAAA;AAChE,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAqB;AAC1C,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,MAAM,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,QAAA,CAAS,OAAO,CAAA,GAAI,OAAA,GAAU,EAAE,CAAA,EAAG;AAC7E,IAAA,IAAI,CAAC,QAAA,CAAS,MAAM,CAAA,EAAG;AACrB,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAA,GAAQ,EAAE,GAAA,EAAK,CAAA,EAAG,iBAAiB,GAAG,oBAAA,CAAqB,IAAI,CAAC,CAAA,CAAA,EAAI,MAAA,EAAO;AACjF,IAAA,KAAA,MAAW,UAAU,IAAI,GAAA,CAAI,OAAO,MAAA,CAAO,KAAK,CAAC,CAAA,EAAG;AAClD,MAAA,MAAM,QAAA,GAAW,QAAA,CAAS,GAAA,CAAI,MAAM,KAAK,EAAC;AAC1C,MAAA,QAAA,CAAS,KAAK,KAAK,CAAA;AACnB,MAAA,QAAA,CAAS,GAAA,CAAI,QAAQ,QAAQ,CAAA;AAAA,IAC/B;AAAA,EACF;AACA,EAAA,OAAO,QAAA;AACT;AAGA,SAAS,YAAA,CAAa,QAAoB,YAAA,EAA+B;AACvE,EAAA,MAAM,gBAAgB,MAAA,CAAO,aAAA;AAC7B,EAAA,OAAO,QAAA,CAAS,aAAa,CAAA,IAAK,aAAA,CAAc,YAAA,KAAiB,YAAA;AACnE;AAQA,SAAS,iBAAA,CAAkB,OAAc,MAAA,EAAkC;AACzE,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,MAAM,0BAAU,IAAI,GAAA,CAAI,CAAC,KAAA,CAAM,OAAO,CAAC,CAAA;AACvC,EAAA,MAAM,OAAA,GAAoB,CAAC,EAAE,GAAA,EAAK,MAAM,OAAA,EAAS,OAAA,kBAAS,IAAI,GAAA,CAAI,CAAC,KAAA,CAAM,OAAO,CAAC,GAAG,CAAA;AACpF,EAAA,KAAA,IAAS,MAAA,GAAS,QAAQ,KAAA,EAAM,EAAG,WAAW,MAAA,EAAW,MAAA,GAAS,OAAA,CAAQ,KAAA,EAAM,EAAG;AACjF,IAAA,MAAM,QAAA,GACJ,MAAA,CAAO,GAAA,KAAQ,KAAA,CAAM,UACjB,kBAAA,CAAmB,KAAA,EAAO,MAAM,CAAA,GAC/B,OAAO,QAAA,CAAS,GAAA,CAAI,MAAA,CAAO,GAAG,KAAK,EAAC;AAC3C,IAAA,KAAA,MAAW,SAAS,QAAA,EAAU;AAC5B,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,KAAA,CAAM,GAAG,CAAA,EAAG;AAC1B,QAAA;AAAA,MACF;AACA,MAAA,OAAA,CAAQ,GAAA,CAAI,MAAM,GAAG,CAAA;AACrB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,GAAA,EAAK,KAAA,CAAM,KAAK,OAAA,EAAS,MAAA,CAAO,SAAS,CAAA;AACtD,MAAA,IAAI,CAAC,YAAA,CAAa,KAAA,CAAM,MAAA,EAAQ,KAAA,CAAM,YAAY,CAAA,EAAG;AACnD,QAAA,OAAA,CAAQ,KAAK,EAAE,GAAA,EAAK,KAAA,CAAM,GAAA,EAAK,yBAAS,IAAI,GAAA,CAAI,CAAC,GAAG,OAAO,OAAA,EAAS,KAAA,CAAM,GAAG,CAAC,GAAG,CAAA;AAAA,MACnF;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,SAAA,CAAU,OAAc,MAAA,EAAkC;AACjE,EAAA,MAAM,SAAS,KAAA,CAAM,UAAA,CAAW,GAAA,CAAI,CAAC,SAAS,EAAE,GAAA,EAAK,OAAA,kBAAS,IAAI,IAAI,CAAC,KAAA,CAAM,OAAO,CAAC,GAAE,CAAE,CAAA;AACzF,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAoB;AACxC,EAAA,KAAA,MAAW,MAAA,IAAU,CAAC,GAAG,MAAA,EAAQ,GAAG,iBAAA,CAAkB,KAAA,EAAO,MAAM,CAAC,CAAA,EAAG;AAErE,IAAA,MAAM,GAAA,GAAM,YAAA,CAAa,MAAA,CAAO,GAAG,CAAA;AACnC,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA,EAAG;AACrB,MAAA,OAAA,CAAQ,GAAA,CAAI,KAAK,MAAM,CAAA;AAAA,IACzB;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,OAAA,CAAQ,MAAA,EAAQ,CAAA;AAC7B;AAEA,SAAS,YAAA,CAAa,OAAc,MAAA,EAA2D;AAC7F,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,OAAA,CAAQ,KAAA,CAAM,OAAO,CAAA,CACxC,MAAA;AAAA,IACC,CAAC,GAAG,MAAM,CAAA,KAAM,OAAO,MAAA,KAAW,QAAA,IAAY,aAAA,CAAc,MAAM,CAAA,KAAM,YAAA,CAAa,MAAM;AAAA,IAE5F,GAAA,CAAI,CAAC,CAAC,GAAG,MAAM,GAAG,CAAA;AACrB,EAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,MAAM,CAAA,CAAE,KAAI,IAAK,EAAA;AAC9C,EAAA,OAAO,MAAA,CAAO,MAAA,GAAS,CAAA,GAAI,EAAE,QAAQ,UAAA,EAAY,KAAA,EAAM,GAAI,EAAE,MAAA,EAAQ,CAAC,IAAI,CAAA,EAAG,YAAY,IAAA,EAAK;AAChG;AAEA,SAAS,WAAW,KAAA,EAAc,EAAE,KAAK,MAAA,EAAQ,OAAA,IAAmB,QAAA,EAAmB;AAErF,EAAA,MAAM,OAAA,GAAU,sBAAA;AAAA,IACd,eAAA,CAAgB,UAAU,MAAM,CAAA;AAAA,IAChC,KAAA,CAAM,YAAA;AAAA,IACN,QAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,EAAE,MAAA,EAAQ,UAAA,EAAW,GAAI,YAAA,CAAa,OAAO,MAAM,CAAA;AACzD,EAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,MAAA,CAAO,IAAA,CAAK,CAAC,UAAU,OAAA,CAAQ,GAAA,CAAI,KAAK,CAAC,CAAA,EAAG;AAClE,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,EAAE,OAAA,EAAS,YAAA,EAAa,GAAI,KAAA;AAClC,EAAA,OAAO,EAAE,MAAA,EAAQ,KAAA,EAAO,OAAA,EAAS,YAAA,EAAc,MAAA,EAAQ,OAAA,EAAS,CAAC,GAAG,OAAO,CAAA,EAAG,UAAA,EAAW;AAC3F;AAGO,SAAS,gCACd,QAAA,EACA,OAAA,GAA2B,EAAE,aAAA,EAAe,OAAM,EACX;AACvC,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAwC;AAC9D,EAAA,MAAM,MAAA,GAAS,EAAE,GAAG,OAAA,EAAS,UAAU,QAAA,EAAU,aAAA,CAAc,QAAQ,CAAA,EAAE;AACzE,EAAA,KAAA,MAAW,KAAA,IAAS,QAAA,CAAS,QAAQ,CAAA,EAAG;AACtC,IAAA,KAAA,MAAW,MAAA,IAAU,SAAA,CAAU,KAAA,EAAO,MAAM,CAAA,EAAG;AAC7C,MAAA,MAAM,QAAA,GAAW,UAAA,CAAW,KAAA,EAAO,MAAA,EAAQ,QAAQ,CAAA;AACnD,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,SAAA,CAAU,CAAC,MAAA,CAAO,KAAK,QAAA,EAAU,YAAA,EAAc,QAAA,EAAU,MAAM,CAAC,CAAA;AACjF,MAAA,IAAI,aAAa,IAAA,IAAQ,CAAC,SAAA,CAAU,GAAA,CAAI,GAAG,CAAA,EAAG;AAC5C,QAAA,SAAA,CAAU,GAAA,CAAI,KAAK,QAAQ,CAAA;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,SAAA,CAAU,MAAA,EAAQ,CAAA;AAC/B;;"}

package/dist/domain/openapi/document-places.cjs

@@ -0,0 +1,55 @@
+'use strict';
+
+const pathItemObject = require('./path-item-object.cjs');
+
+const OPERATION_KEYS = /* @__PURE__ */ new Set([...pathItemObject.HTTP_METHODS, pathItemObject.QUERY_METHOD]);
+const FIELDS = {
+  root: {
+    paths: "namedPathItems",
+    webhooks: "namedPathItems",
+    components: "components",
+    $defs: "other"
+  },
+  components: {
+    parameters: "input",
+    requestBodies: "input",
+    pathItems: "namedPathItems",
+    callbacks: "namedCallbacks"
+  },
+  pathItem: { parameters: "input", [pathItemObject.ADDITIONAL_OPERATIONS_KEY]: "namedOperations" },
+  operation: { parameters: "input", requestBody: "input", callbacks: "namedCallbacks" }
+};
+const NAMED = {
+  namedPathItems: "pathItem",
+  namedCallbacks: "callback",
+  callback: "pathItem",
+  namedOperations: "operation"
+};
+function nextPlace(place, segment) {
+  const named = NAMED[place];
+  if (named !== void 0) {
+    return named;
+  }
+  if (place === "pathItem" && OPERATION_KEYS.has(segment)) {
+    return "operation";
+  }
+  const fields = FIELDS[place] ?? {};
+  if (Object.hasOwn(fields, segment)) {
+    return fields[segment];
+  }
+  return place === "root" ? "outside" : "other";
+}
+const TERMINAL_PLACES = /* @__PURE__ */ new Set(["outside", "input", "other"]);
+function placeOf(segments) {
+  let place = "root";
+  for (const segment of segments) {
+    place = nextPlace(place, segment);
+    if (TERMINAL_PLACES.has(place)) {
+      return place;
+    }
+  }
+  return place;
+}
+
+exports.placeOf = placeOf;
+//# sourceMappingURL=document-places.cjs.map

package/dist/domain/openapi/document-places.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"document-places.cjs","sources":["../../../src/domain/openapi/document-places.ts"],"sourcesContent":["import { ADDITIONAL_OPERATIONS_KEY, HTTP_METHODS, QUERY_METHOD } from \"./path-item-object.js\";\n\n/**\n * The places of an OpenAPI document that a JSON Pointer passes through, read from the document's\n * structure rather than from the words of the pointer. `named*` places and `callback` are maps\n * whose next segment is a name (a path, a component name, a callback expression). `outside` (a\n * root key that is no document key), `input` (a parameter or a request body) and `other` end the\n * walk.\n */\nexport type DocumentPlace =\n  | \"root\"\n  | \"outside\"\n  | \"components\"\n  | \"namedPathItems\"\n  | \"namedCallbacks\"\n  | \"callback\"\n  | \"pathItem\"\n  | \"namedOperations\"\n  | \"operation\"\n  | \"input\"\n  | \"other\";\n\nconst OPERATION_KEYS: ReadonlySet<string> = new Set([...HTTP_METHODS, QUERY_METHOD]);\n\n/** The place each fixed field leads to; any other field leads to `other`. */\nconst FIELDS: Readonly<Partial<Record<DocumentPlace, Readonly<Record<string, DocumentPlace>>>>> = {\n  root: {\n    paths: \"namedPathItems\",\n    webhooks: \"namedPathItems\",\n    components: \"components\",\n    $defs: \"other\",\n  },\n  components: {\n    parameters: \"input\",\n    requestBodies: \"input\",\n    pathItems: \"namedPathItems\",\n    callbacks: \"namedCallbacks\",\n  },\n  pathItem: { parameters: \"input\", [ADDITIONAL_OPERATIONS_KEY]: \"namedOperations\" },\n  operation: { parameters: \"input\", requestBody: \"input\", callbacks: \"namedCallbacks\" },\n};\n\n/** Maps whose every key leads to the same place. */\nconst NAMED: Readonly<Partial<Record<DocumentPlace, DocumentPlace>>> = {\n  namedPathItems: \"pathItem\",\n  namedCallbacks: \"callback\",\n  callback: \"pathItem\",\n  namedOperations: \"operation\",\n};\n\nfunction nextPlace(place: DocumentPlace, segment: string): DocumentPlace {\n  const named = NAMED[place];\n  if (named !== undefined) {\n    return named;\n  }\n  if (place === \"pathItem\" && OPERATION_KEYS.has(segment)) {\n    return \"operation\";\n  }\n  const fields = FIELDS[place] ?? {};\n  if (Object.hasOwn(fields, segment)) {\n    return fields[segment] as DocumentPlace;\n  }\n  return place === \"root\" ? \"outside\" : \"other\";\n}\n\nconst TERMINAL_PLACES: ReadonlySet<DocumentPlace> = new Set([\"outside\", \"input\", \"other\"]);\n\n/** The place the segments of a pointer (after `#`) lead to; the walk stops at a terminal place. */\nexport function placeOf(segments: Iterable<string>): DocumentPlace {\n  let place: DocumentPlace = \"root\";\n  for (const segment of segments) {\n    place = nextPlace(place, segment);\n    if (TERMINAL_PLACES.has(place)) {\n      return place;\n    }\n  }\n  return place;\n}\n"],"names":["HTTP_METHODS","QUERY_METHOD","ADDITIONAL_OPERATIONS_KEY"],"mappings":";;;;AAsBA,MAAM,iCAAsC,IAAI,GAAA,CAAI,CAAC,GAAGA,2BAAA,EAAcC,2BAAY,CAAC,CAAA;AAGnF,MAAM,MAAA,GAA4F;AAAA,EAChG,IAAA,EAAM;AAAA,IACJ,KAAA,EAAO,gBAAA;AAAA,IACP,QAAA,EAAU,gBAAA;AAAA,IACV,UAAA,EAAY,YAAA;AAAA,IACZ,KAAA,EAAO;AAAA,GACT;AAAA,EACA,UAAA,EAAY;AAAA,IACV,UAAA,EAAY,OAAA;AAAA,IACZ,aAAA,EAAe,OAAA;AAAA,IACf,SAAA,EAAW,gBAAA;AAAA,IACX,SAAA,EAAW;AAAA,GACb;AAAA,EACA,UAAU,EAAE,UAAA,EAAY,SAAS,CAACC,wCAAyB,GAAG,iBAAA,EAAkB;AAAA,EAChF,WAAW,EAAE,UAAA,EAAY,SAAS,WAAA,EAAa,OAAA,EAAS,WAAW,gBAAA;AACrE,CAAA;AAGA,MAAM,KAAA,GAAiE;AAAA,EACrE,cAAA,EAAgB,UAAA;AAAA,EAChB,cAAA,EAAgB,UAAA;AAAA,EAChB,QAAA,EAAU,UAAA;AAAA,EACV,eAAA,EAAiB;AACnB,CAAA;AAEA,SAAS,SAAA,CAAU,OAAsB,OAAA,EAAgC;AACvE,EAAA,MAAM,KAAA,GAAQ,MAAM,KAAK,CAAA;AACzB,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IAAI,KAAA,KAAU,UAAA,IAAc,cAAA,CAAe,GAAA,CAAI,OAAO,CAAA,EAAG;AACvD,IAAA,OAAO,WAAA;AAAA,EACT;AACA,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,KAAK,CAAA,IAAK,EAAC;AACjC,EAAA,IAAI,MAAA,CAAO,MAAA,CAAO,MAAA,EAAQ,OAAO,CAAA,EAAG;AAClC,IAAA,OAAO,OAAO,OAAO,CAAA;AAAA,EACvB;AACA,EAAA,OAAO,KAAA,KAAU,SAAS,SAAA,GAAY,OAAA;AACxC;AAEA,MAAM,kCAA8C,IAAI,GAAA,CAAI,CAAC,SAAA,EAAW,OAAA,EAAS,OAAO,CAAC,CAAA;AAGlF,SAAS,QAAQ,QAAA,EAA2C;AACjE,EAAA,IAAI,KAAA,GAAuB,MAAA;AAC3B,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,KAAA,GAAQ,SAAA,CAAU,OAAO,OAAO,CAAA;AAChC,IAAA,IAAI,eAAA,CAAgB,GAAA,CAAI,KAAK,CAAA,EAAG;AAC9B,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;;"}

package/dist/domain/openapi/document-places.mjs

@@ -0,0 +1,53 @@
+import { HTTP_METHODS, QUERY_METHOD, ADDITIONAL_OPERATIONS_KEY } from './path-item-object.mjs';
+
+const OPERATION_KEYS = /* @__PURE__ */ new Set([...HTTP_METHODS, QUERY_METHOD]);
+const FIELDS = {
+  root: {
+    paths: "namedPathItems",
+    webhooks: "namedPathItems",
+    components: "components",
+    $defs: "other"
+  },
+  components: {
+    parameters: "input",
+    requestBodies: "input",
+    pathItems: "namedPathItems",
+    callbacks: "namedCallbacks"
+  },
+  pathItem: { parameters: "input", [ADDITIONAL_OPERATIONS_KEY]: "namedOperations" },
+  operation: { parameters: "input", requestBody: "input", callbacks: "namedCallbacks" }
+};
+const NAMED = {
+  namedPathItems: "pathItem",
+  namedCallbacks: "callback",
+  callback: "pathItem",
+  namedOperations: "operation"
+};
+function nextPlace(place, segment) {
+  const named = NAMED[place];
+  if (named !== void 0) {
+    return named;
+  }
+  if (place === "pathItem" && OPERATION_KEYS.has(segment)) {
+    return "operation";
+  }
+  const fields = FIELDS[place] ?? {};
+  if (Object.hasOwn(fields, segment)) {
+    return fields[segment];
+  }
+  return place === "root" ? "outside" : "other";
+}
+const TERMINAL_PLACES = /* @__PURE__ */ new Set(["outside", "input", "other"]);
+function placeOf(segments) {
+  let place = "root";
+  for (const segment of segments) {
+    place = nextPlace(place, segment);
+    if (TERMINAL_PLACES.has(place)) {
+      return place;
+    }
+  }
+  return place;
+}
+
+export { placeOf };
+//# sourceMappingURL=document-places.mjs.map

package/dist/domain/openapi/document-places.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"document-places.mjs","sources":["../../../src/domain/openapi/document-places.ts"],"sourcesContent":["import { ADDITIONAL_OPERATIONS_KEY, HTTP_METHODS, QUERY_METHOD } from \"./path-item-object.js\";\n\n/**\n * The places of an OpenAPI document that a JSON Pointer passes through, read from the document's\n * structure rather than from the words of the pointer. `named*` places and `callback` are maps\n * whose next segment is a name (a path, a component name, a callback expression). `outside` (a\n * root key that is no document key), `input` (a parameter or a request body) and `other` end the\n * walk.\n */\nexport type DocumentPlace =\n  | \"root\"\n  | \"outside\"\n  | \"components\"\n  | \"namedPathItems\"\n  | \"namedCallbacks\"\n  | \"callback\"\n  | \"pathItem\"\n  | \"namedOperations\"\n  | \"operation\"\n  | \"input\"\n  | \"other\";\n\nconst OPERATION_KEYS: ReadonlySet<string> = new Set([...HTTP_METHODS, QUERY_METHOD]);\n\n/** The place each fixed field leads to; any other field leads to `other`. */\nconst FIELDS: Readonly<Partial<Record<DocumentPlace, Readonly<Record<string, DocumentPlace>>>>> = {\n  root: {\n    paths: \"namedPathItems\",\n    webhooks: \"namedPathItems\",\n    components: \"components\",\n    $defs: \"other\",\n  },\n  components: {\n    parameters: \"input\",\n    requestBodies: \"input\",\n    pathItems: \"namedPathItems\",\n    callbacks: \"namedCallbacks\",\n  },\n  pathItem: { parameters: \"input\", [ADDITIONAL_OPERATIONS_KEY]: \"namedOperations\" },\n  operation: { parameters: \"input\", requestBody: \"input\", callbacks: \"namedCallbacks\" },\n};\n\n/** Maps whose every key leads to the same place. */\nconst NAMED: Readonly<Partial<Record<DocumentPlace, DocumentPlace>>> = {\n  namedPathItems: \"pathItem\",\n  namedCallbacks: \"callback\",\n  callback: \"pathItem\",\n  namedOperations: \"operation\",\n};\n\nfunction nextPlace(place: DocumentPlace, segment: string): DocumentPlace {\n  const named = NAMED[place];\n  if (named !== undefined) {\n    return named;\n  }\n  if (place === \"pathItem\" && OPERATION_KEYS.has(segment)) {\n    return \"operation\";\n  }\n  const fields = FIELDS[place] ?? {};\n  if (Object.hasOwn(fields, segment)) {\n    return fields[segment] as DocumentPlace;\n  }\n  return place === \"root\" ? \"outside\" : \"other\";\n}\n\nconst TERMINAL_PLACES: ReadonlySet<DocumentPlace> = new Set([\"outside\", \"input\", \"other\"]);\n\n/** The place the segments of a pointer (after `#`) lead to; the walk stops at a terminal place. */\nexport function placeOf(segments: Iterable<string>): DocumentPlace {\n  let place: DocumentPlace = \"root\";\n  for (const segment of segments) {\n    place = nextPlace(place, segment);\n    if (TERMINAL_PLACES.has(place)) {\n      return place;\n    }\n  }\n  return place;\n}\n"],"names":[],"mappings":";;AAsBA,MAAM,iCAAsC,IAAI,GAAA,CAAI,CAAC,GAAG,YAAA,EAAc,YAAY,CAAC,CAAA;AAGnF,MAAM,MAAA,GAA4F;AAAA,EAChG,IAAA,EAAM;AAAA,IACJ,KAAA,EAAO,gBAAA;AAAA,IACP,QAAA,EAAU,gBAAA;AAAA,IACV,UAAA,EAAY,YAAA;AAAA,IACZ,KAAA,EAAO;AAAA,GACT;AAAA,EACA,UAAA,EAAY;AAAA,IACV,UAAA,EAAY,OAAA;AAAA,IACZ,aAAA,EAAe,OAAA;AAAA,IACf,SAAA,EAAW,gBAAA;AAAA,IACX,SAAA,EAAW;AAAA,GACb;AAAA,EACA,UAAU,EAAE,UAAA,EAAY,SAAS,CAAC,yBAAyB,GAAG,iBAAA,EAAkB;AAAA,EAChF,WAAW,EAAE,UAAA,EAAY,SAAS,WAAA,EAAa,OAAA,EAAS,WAAW,gBAAA;AACrE,CAAA;AAGA,MAAM,KAAA,GAAiE;AAAA,EACrE,cAAA,EAAgB,UAAA;AAAA,EAChB,cAAA,EAAgB,UAAA;AAAA,EAChB,QAAA,EAAU,UAAA;AAAA,EACV,eAAA,EAAiB;AACnB,CAAA;AAEA,SAAS,SAAA,CAAU,OAAsB,OAAA,EAAgC;AACvE,EAAA,MAAM,KAAA,GAAQ,MAAM,KAAK,CAAA;AACzB,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IAAI,KAAA,KAAU,UAAA,IAAc,cAAA,CAAe,GAAA,CAAI,OAAO,CAAA,EAAG;AACvD,IAAA,OAAO,WAAA;AAAA,EACT;AACA,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,KAAK,CAAA,IAAK,EAAC;AACjC,EAAA,IAAI,MAAA,CAAO,MAAA,CAAO,MAAA,EAAQ,OAAO,CAAA,EAAG;AAClC,IAAA,OAAO,OAAO,OAAO,CAAA;AAAA,EACvB;AACA,EAAA,OAAO,KAAA,KAAU,SAAS,SAAA,GAAY,OAAA;AACxC;AAEA,MAAM,kCAA8C,IAAI,GAAA,CAAI,CAAC,SAAA,EAAW,OAAA,EAAS,OAAO,CAAC,CAAA;AAGlF,SAAS,QAAQ,QAAA,EAA2C;AACjE,EAAA,IAAI,KAAA,GAAuB,MAAA;AAC3B,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,KAAA,GAAQ,SAAA,CAAU,OAAO,OAAO,CAAA;AAChC,IAAA,IAAI,eAAA,CAAgB,GAAA,CAAI,KAAK,CAAA,EAAG;AAC9B,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;;"}

package/dist/domain/openapi/json-pointer.cjs

@@ -8,7 +8,45 @@ function unescapePointerSegment(segment) {
   return decodeURIComponent(segment.replaceAll("~1", "/").replaceAll("~0", "~"));
 }
 function escapePointerSegment(segment) {
-  return segment.replaceAll("~", "~0").replaceAll("/", "~1").replaceAll("%", "%25");
+  return segment.replaceAll("~", "~0").replaceAll("/", "~1").replaceAll("%", "%25").replaceAll("#", "%23");
+}
+const ROOT_POINTER = "#";
+function appendPointer(base, segments) {
+  let pointer = pointerBase(base);
+  for (const segment of segments) {
+    if (segment !== void 0 && segment !== null && segment !== "") {
+      pointer = childPointer(pointer, String(segment));
+    }
+  }
+  return pointer;
+}
+function childPointer(pointer, key) {
+  return `${pointer}/${escapePointerSegment(key)}`;
+}
+function canonicalRef(ref) {
+  if (!ref.startsWith(`${ROOT_POINTER}/`)) {
+    return ref;
+  }
+  return appendPointer(ROOT_POINTER, refSegments(ref));
+}
+function refSegments(ref) {
+  try {
+    return parseRefPointer(ref);
+  } catch (error) {
+    if (!(error instanceof URIError)) {
+      throw error;
+    }
+    return writtenSegments(ref);
+  }
+}
+function writtenSegments(ref) {
+  return ref.slice(ROOT_POINTER.length + 1).split("/").filter((segment) => segment.length > 0).map((segment) => segment.replaceAll("~1", "/").replaceAll("~0", "~"));
+}
+function pointerBase(base) {
+  if (base === void 0 || base === "") {
+    return ROOT_POINTER;
+  }
+  return base === ROOT_POINTER || base.startsWith(`${ROOT_POINTER}/`) ? base : createRef([base]);
 }
 function createRef(parts) {
   let ref = "#";
@@ -25,6 +63,10 @@ function createRef(parts) {
   return ref;
 }
 
+exports.ROOT_POINTER = ROOT_POINTER;
+exports.appendPointer = appendPointer;
+exports.canonicalRef = canonicalRef;
+exports.childPointer = childPointer;
 exports.createRef = createRef;
 exports.escapePointerSegment = escapePointerSegment;
 exports.parseRefPointer = parseRefPointer;

package/dist/domain/openapi/json-pointer.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"json-pointer.cjs","sources":["../../../src/domain/openapi/json-pointer.ts"],"sourcesContent":["/**\n * The JSON Pointer of a `$ref` as path segments, with the semantics of Redocly's `parseRef`, which\n * the original generator used: the part after the first `#/`, split at `/`, each segment unescaped\n * (`~1` → `/`, `~0` → `~`, then percent-decoding), and empty segments dropped.\n *\n * Throws URIError for a malformed percent escape, as the original does.\n */\nexport function parseRefPointer(ref: string): string[] {\n  const [, pointer = \"\"] = ref.split(\"#/\");\n  return pointer\n    .split(\"/\")\n    .map(unescapePointerSegment)\n    .filter((segment) => segment.length > 0);\n}\n\nfunction unescapePointerSegment(segment: string): string {\n  return decodeURIComponent(segment.replaceAll(\"~1\", \"/\").replaceAll(\"~0\", \"~\"));\n}\n\n/**\n * Escape one segment for a JSON Pointer in a `$ref` fragment: `~` → `~0`, `/` → `~1`, and `%` →\n * `%25`, because reading a pointer back percent-decodes it. The original did not escape `%`, so a\n * name like `50%` threw URIError and `a%2Fb` read back as `a/b` (upstream #2251, #2828).\n */\nexport function escapePointerSegment(segment: string): string {\n  return segment.replaceAll(\"~\", \"~0\").replaceAll(\"/\", \"~1\").replaceAll(\"%\", \"%25\");\n}\n\n/**\n * Join parts into a local `$ref` (the original `createRef`). Empty parts are skipped. A part that\n * is itself a `$ref` contributes its segments; any other part is one segment.\n */\nexport function createRef(parts: readonly (string | number | null | undefined)[]): string {\n  let ref = \"#\";\n  for (const part of parts) {\n    if (part === undefined || part === null || part === \"\") {\n      continue;\n    }\n    const text = String(part);\n    const segments = parseRefPointer(text);\n    for (const segment of segments.length > 0 ? segments : [text]) {\n      ref += `/${escapePointerSegment(segment)}`;\n    }\n  }\n  return ref;\n}\n"],"names":[],"mappings":";;AAOO,SAAS,gBAAgB,GAAA,EAAuB;AACrD,EAAA,MAAM,GAAG,OAAA,GAAU,EAAE,CAAA,GAAI,GAAA,CAAI,MAAM,IAAI,CAAA;AACvC,EAAA,OAAO,OAAA,CACJ,KAAA,CAAM,GAAG,CAAA,CACT,GAAA,CAAI,sBAAsB,CAAA,CAC1B,MAAA,CAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,MAAA,GAAS,CAAC,CAAA;AAC3C;AAEA,SAAS,uBAAuB,OAAA,EAAyB;AACvD,EAAA,OAAO,kBAAA,CAAmB,QAAQ,UAAA,CAAW,IAAA,EAAM,GAAG,CAAA,CAAE,UAAA,CAAW,IAAA,EAAM,GAAG,CAAC,CAAA;AAC/E;AAOO,SAAS,qBAAqB,OAAA,EAAyB;AAC5D,EAAA,OAAO,OAAA,CAAQ,UAAA,CAAW,GAAA,EAAK,IAAI,CAAA,CAAE,UAAA,CAAW,GAAA,EAAK,IAAI,CAAA,CAAE,UAAA,CAAW,GAAA,EAAK,KAAK,CAAA;AAClF;AAMO,SAAS,UAAU,KAAA,EAAgE;AACxF,EAAA,IAAI,GAAA,GAAM,GAAA;AACV,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,KAAS,IAAA,IAAQ,SAAS,EAAA,EAAI;AACtD,MAAA;AAAA,IACF;AACA,IAAA,MAAM,IAAA,GAAO,OAAO,IAAI,CAAA;AACxB,IAAA,MAAM,QAAA,GAAW,gBAAgB,IAAI,CAAA;AACrC,IAAA,KAAA,MAAW,WAAW,QAAA,CAAS,MAAA,GAAS,IAAI,QAAA,GAAW,CAAC,IAAI,CAAA,EAAG;AAC7D,MAAA,GAAA,IAAO,CAAA,CAAA,EAAI,oBAAA,CAAqB,OAAO,CAAC,CAAA,CAAA;AAAA,IAC1C;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;;;;"}
+{"version":3,"file":"json-pointer.cjs","sources":["../../../src/domain/openapi/json-pointer.ts"],"sourcesContent":["/**\n * The JSON Pointer of a `$ref` as path segments, with the semantics of Redocly's `parseRef`, which\n * the original generator used: the part after the first `#/`, split at `/`, each segment unescaped\n * (`~1` → `/`, `~0` → `~`, then percent-decoding), and empty segments dropped.\n *\n * Throws URIError for a malformed percent escape, as the original does.\n */\nexport function parseRefPointer(ref: string): string[] {\n  const [, pointer = \"\"] = ref.split(\"#/\");\n  return pointer\n    .split(\"/\")\n    .map(unescapePointerSegment)\n    .filter((segment) => segment.length > 0);\n}\n\nfunction unescapePointerSegment(segment: string): string {\n  return decodeURIComponent(segment.replaceAll(\"~1\", \"/\").replaceAll(\"~0\", \"~\"));\n}\n\n/**\n * Escape one segment for a JSON Pointer in a `$ref` fragment: `~` → `~0` and `/` → `~1` (RFC 6901),\n * then `%` → `%25` and `#` → `%23`, the two characters of a key that a URI fragment cannot hold as\n * written (RFC 6901 §6, RFC 3986). Reading a pointer back percent-decodes it, so the original's\n * unescaped `%` threw URIError for `50%` and read `a%2Fb` as `a/b` (upstream #2251, #2828), and\n * reading starts at the first `#/`, so an unescaped key `a#` cut the pointer short.\n */\nexport function escapePointerSegment(segment: string): string {\n  return segment\n    .replaceAll(\"~\", \"~0\")\n    .replaceAll(\"/\", \"~1\")\n    .replaceAll(\"%\", \"%25\")\n    .replaceAll(\"#\", \"%23\");\n}\n\n/** The pointer of the document root. */\nexport const ROOT_POINTER = \"#\";\n\n/** A raw pointer segment; a missing one (`undefined`, `null` or empty) is skipped. */\nexport type PointerSegment = string | number | null | undefined;\n\n/**\n * Extend the pointer `base` with raw segments: document keys, such as a path, a property name or a\n * media type, and array indexes. Each segment is escaped and never read as a `$ref`, so a key like\n * `#/%41` stays one segment and reads back unchanged with {@link parseRefPointer}. A missing\n * segment, such as the absent `name` of a parameter, is skipped, as the original `createRef` did,\n * and an empty one too, because `parseRefPointer` drops it.\n */\nexport function appendPointer(\n  base: string | undefined,\n  segments: readonly PointerSegment[],\n): string {\n  let pointer = pointerBase(base);\n  for (const segment of segments) {\n    if (segment !== undefined && segment !== null && segment !== \"\") {\n      pointer = childPointer(pointer, String(segment));\n    }\n  }\n  return pointer;\n}\n\n/**\n * The pointer of the child `key` of the node at `pointer`, with `key` escaped. Unlike\n * {@link appendPointer}, an empty key is a child too: a document walk names every key it visits.\n */\nexport function childPointer(pointer: string, key: string): string {\n  return `${pointer}/${escapePointerSegment(key)}`;\n}\n\n/**\n * A local `$ref` or `mapping` value in the form {@link appendPointer} builds, so that pointers\n * compare as text whatever escapes the document chose: `.../a#b` and `.../a%23b` are both\n * `.../a%23b`. Redocly writes a bundled `mapping` value percent-decoded, which is no pointer for a\n * key with `%` (`.../50%`), so such a text is read as written. Any other text, such as an\n * external `$ref` or a bare schema name, is returned unchanged.\n */\nexport function canonicalRef(ref: string): string {\n  if (!ref.startsWith(`${ROOT_POINTER}/`)) {\n    return ref;\n  }\n  return appendPointer(ROOT_POINTER, refSegments(ref));\n}\n\nfunction refSegments(ref: string): string[] {\n  try {\n    return parseRefPointer(ref);\n  } catch (error) {\n    if (!(error instanceof URIError)) {\n      throw error;\n    }\n    return writtenSegments(ref);\n  }\n}\n\n/** The segments of a pointer that is not percent-encoded: only `~1` and `~0` are escapes. */\nfunction writtenSegments(ref: string): string[] {\n  return ref\n    .slice(ROOT_POINTER.length + 1)\n    .split(\"/\")\n    .filter((segment) => segment.length > 0)\n    .map((segment) => segment.replaceAll(\"~1\", \"/\").replaceAll(\"~0\", \"~\"));\n}\n\n/**\n * A pointer (`#` or `#/...`) is kept as written; a missing base is the root. Any other text is a\n * `path` given to the exported transformers, such as `/items/{id}` or `other.yaml#/a`, which the\n * original read as a `createRef` part, so it is read the same way here.\n */\nfunction pointerBase(base: string | undefined): string {\n  if (base === undefined || base === \"\") {\n    return ROOT_POINTER;\n  }\n  return base === ROOT_POINTER || base.startsWith(`${ROOT_POINTER}/`) ? base : createRef([base]);\n}\n\n/**\n * Join parts into a local `$ref` (the original `createRef`, exported for 1.x by ADR-034). Empty\n * parts are skipped. A part that contains `#/` is parsed as a `$ref` and contributes its decoded\n * segments, so it throws URIError for a malformed percent escape; any other part is one segment.\n * Because of that parsing, the generator does not pass document keys here: it builds pointers\n * with {@link appendPointer}, which never parses a segment.\n */\nexport function createRef(parts: readonly PointerSegment[]): string {\n  let ref = \"#\";\n  for (const part of parts) {\n    if (part === undefined || part === null || part === \"\") {\n      continue;\n    }\n    const text = String(part);\n    const segments = parseRefPointer(text);\n    for (const segment of segments.length > 0 ? segments : [text]) {\n      ref += `/${escapePointerSegment(segment)}`;\n    }\n  }\n  return ref;\n}\n"],"names":[],"mappings":";;AAOO,SAAS,gBAAgB,GAAA,EAAuB;AACrD,EAAA,MAAM,GAAG,OAAA,GAAU,EAAE,CAAA,GAAI,GAAA,CAAI,MAAM,IAAI,CAAA;AACvC,EAAA,OAAO,OAAA,CACJ,KAAA,CAAM,GAAG,CAAA,CACT,GAAA,CAAI,sBAAsB,CAAA,CAC1B,MAAA,CAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,MAAA,GAAS,CAAC,CAAA;AAC3C;AAEA,SAAS,uBAAuB,OAAA,EAAyB;AACvD,EAAA,OAAO,kBAAA,CAAmB,QAAQ,UAAA,CAAW,IAAA,EAAM,GAAG,CAAA,CAAE,UAAA,CAAW,IAAA,EAAM,GAAG,CAAC,CAAA;AAC/E;AASO,SAAS,qBAAqB,OAAA,EAAyB;AAC5D,EAAA,OAAO,OAAA,CACJ,UAAA,CAAW,GAAA,EAAK,IAAI,EACpB,UAAA,CAAW,GAAA,EAAK,IAAI,CAAA,CACpB,WAAW,GAAA,EAAK,KAAK,CAAA,CACrB,UAAA,CAAW,KAAK,KAAK,CAAA;AAC1B;AAGO,MAAM,YAAA,GAAe;AAYrB,SAAS,aAAA,CACd,MACA,QAAA,EACQ;AACR,EAAA,IAAI,OAAA,GAAU,YAAY,IAAI,CAAA;AAC9B,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,IAAI,OAAA,KAAY,MAAA,IAAa,OAAA,KAAY,IAAA,IAAQ,YAAY,EAAA,EAAI;AAC/D,MAAA,OAAA,GAAU,YAAA,CAAa,OAAA,EAAS,MAAA,CAAO,OAAO,CAAC,CAAA;AAAA,IACjD;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;AAMO,SAAS,YAAA,CAAa,SAAiB,GAAA,EAAqB;AACjE,EAAA,OAAO,CAAA,EAAG,OAAO,CAAA,CAAA,EAAI,oBAAA,CAAqB,GAAG,CAAC,CAAA,CAAA;AAChD;AASO,SAAS,aAAa,GAAA,EAAqB;AAChD,EAAA,IAAI,CAAC,GAAA,CAAI,UAAA,CAAW,CAAA,EAAG,YAAY,GAAG,CAAA,EAAG;AACvC,IAAA,OAAO,GAAA;AAAA,EACT;AACA,EAAA,OAAO,aAAA,CAAc,YAAA,EAAc,WAAA,CAAY,GAAG,CAAC,CAAA;AACrD;AAEA,SAAS,YAAY,GAAA,EAAuB;AAC1C,EAAA,IAAI;AACF,IAAA,OAAO,gBAAgB,GAAG,CAAA;AAAA,EAC5B,SAAS,KAAA,EAAO;AACd,IAAA,IAAI,EAAE,iBAAiB,QAAA,CAAA,EAAW;AAChC,MAAA,MAAM,KAAA;AAAA,IACR;AACA,IAAA,OAAO,gBAAgB,GAAG,CAAA;AAAA,EAC5B;AACF;AAGA,SAAS,gBAAgB,GAAA,EAAuB;AAC9C,EAAA,OAAO,GAAA,CACJ,KAAA,CAAM,YAAA,CAAa,MAAA,GAAS,CAAC,CAAA,CAC7B,KAAA,CAAM,GAAG,CAAA,CACT,MAAA,CAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,MAAA,GAAS,CAAC,CAAA,CACtC,GAAA,CAAI,CAAC,OAAA,KAAY,OAAA,CAAQ,UAAA,CAAW,IAAA,EAAM,GAAG,CAAA,CAAE,UAAA,CAAW,IAAA,EAAM,GAAG,CAAC,CAAA;AACzE;AAOA,SAAS,YAAY,IAAA,EAAkC;AACrD,EAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,KAAS,EAAA,EAAI;AACrC,IAAA,OAAO,YAAA;AAAA,EACT;AACA,EAAA,OAAO,IAAA,KAAS,YAAA,IAAgB,IAAA,CAAK,UAAA,CAAW,CAAA,EAAG,YAAY,CAAA,CAAA,CAAG,CAAA,GAAI,IAAA,GAAO,SAAA,CAAU,CAAC,IAAI,CAAC,CAAA;AAC/F;AASO,SAAS,UAAU,KAAA,EAA0C;AAClE,EAAA,IAAI,GAAA,GAAM,GAAA;AACV,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,KAAS,IAAA,IAAQ,SAAS,EAAA,EAAI;AACtD,MAAA;AAAA,IACF;AACA,IAAA,MAAM,IAAA,GAAO,OAAO,IAAI,CAAA;AACxB,IAAA,MAAM,QAAA,GAAW,gBAAgB,IAAI,CAAA;AACrC,IAAA,KAAA,MAAW,WAAW,QAAA,CAAS,MAAA,GAAS,IAAI,QAAA,GAAW,CAAC,IAAI,CAAA,EAAG;AAC7D,MAAA,GAAA,IAAO,CAAA,CAAA,EAAI,oBAAA,CAAqB,OAAO,CAAC,CAAA,CAAA;AAAA,IAC1C;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;;;;;;;;"}

package/dist/domain/openapi/json-pointer.mjs

@@ -6,7 +6,45 @@ function unescapePointerSegment(segment) {
   return decodeURIComponent(segment.replaceAll("~1", "/").replaceAll("~0", "~"));
 }
 function escapePointerSegment(segment) {
-  return segment.replaceAll("~", "~0").replaceAll("/", "~1").replaceAll("%", "%25");
+  return segment.replaceAll("~", "~0").replaceAll("/", "~1").replaceAll("%", "%25").replaceAll("#", "%23");
+}
+const ROOT_POINTER = "#";
+function appendPointer(base, segments) {
+  let pointer = pointerBase(base);
+  for (const segment of segments) {
+    if (segment !== void 0 && segment !== null && segment !== "") {
+      pointer = childPointer(pointer, String(segment));
+    }
+  }
+  return pointer;
+}
+function childPointer(pointer, key) {
+  return `${pointer}/${escapePointerSegment(key)}`;
+}
+function canonicalRef(ref) {
+  if (!ref.startsWith(`${ROOT_POINTER}/`)) {
+    return ref;
+  }
+  return appendPointer(ROOT_POINTER, refSegments(ref));
+}
+function refSegments(ref) {
+  try {
+    return parseRefPointer(ref);
+  } catch (error) {
+    if (!(error instanceof URIError)) {
+      throw error;
+    }
+    return writtenSegments(ref);
+  }
+}
+function writtenSegments(ref) {
+  return ref.slice(ROOT_POINTER.length + 1).split("/").filter((segment) => segment.length > 0).map((segment) => segment.replaceAll("~1", "/").replaceAll("~0", "~"));
+}
+function pointerBase(base) {
+  if (base === void 0 || base === "") {
+    return ROOT_POINTER;
+  }
+  return base === ROOT_POINTER || base.startsWith(`${ROOT_POINTER}/`) ? base : createRef([base]);
 }
 function createRef(parts) {
   let ref = "#";
@@ -23,5 +61,5 @@ function createRef(parts) {
   return ref;
 }
 
-export { createRef, escapePointerSegment, parseRefPointer };
+export { ROOT_POINTER, appendPointer, canonicalRef, childPointer, createRef, escapePointerSegment, parseRefPointer };
 //# sourceMappingURL=json-pointer.mjs.map

package/dist/domain/openapi/json-pointer.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"json-pointer.mjs","sources":["../../../src/domain/openapi/json-pointer.ts"],"sourcesContent":["/**\n * The JSON Pointer of a `$ref` as path segments, with the semantics of Redocly's `parseRef`, which\n * the original generator used: the part after the first `#/`, split at `/`, each segment unescaped\n * (`~1` → `/`, `~0` → `~`, then percent-decoding), and empty segments dropped.\n *\n * Throws URIError for a malformed percent escape, as the original does.\n */\nexport function parseRefPointer(ref: string): string[] {\n  const [, pointer = \"\"] = ref.split(\"#/\");\n  return pointer\n    .split(\"/\")\n    .map(unescapePointerSegment)\n    .filter((segment) => segment.length > 0);\n}\n\nfunction unescapePointerSegment(segment: string): string {\n  return decodeURIComponent(segment.replaceAll(\"~1\", \"/\").replaceAll(\"~0\", \"~\"));\n}\n\n/**\n * Escape one segment for a JSON Pointer in a `$ref` fragment: `~` → `~0`, `/` → `~1`, and `%` →\n * `%25`, because reading a pointer back percent-decodes it. The original did not escape `%`, so a\n * name like `50%` threw URIError and `a%2Fb` read back as `a/b` (upstream #2251, #2828).\n */\nexport function escapePointerSegment(segment: string): string {\n  return segment.replaceAll(\"~\", \"~0\").replaceAll(\"/\", \"~1\").replaceAll(\"%\", \"%25\");\n}\n\n/**\n * Join parts into a local `$ref` (the original `createRef`). Empty parts are skipped. A part that\n * is itself a `$ref` contributes its segments; any other part is one segment.\n */\nexport function createRef(parts: readonly (string | number | null | undefined)[]): string {\n  let ref = \"#\";\n  for (const part of parts) {\n    if (part === undefined || part === null || part === \"\") {\n      continue;\n    }\n    const text = String(part);\n    const segments = parseRefPointer(text);\n    for (const segment of segments.length > 0 ? segments : [text]) {\n      ref += `/${escapePointerSegment(segment)}`;\n    }\n  }\n  return ref;\n}\n"],"names":[],"mappings":"AAOO,SAAS,gBAAgB,GAAA,EAAuB;AACrD,EAAA,MAAM,GAAG,OAAA,GAAU,EAAE,CAAA,GAAI,GAAA,CAAI,MAAM,IAAI,CAAA;AACvC,EAAA,OAAO,OAAA,CACJ,KAAA,CAAM,GAAG,CAAA,CACT,GAAA,CAAI,sBAAsB,CAAA,CAC1B,MAAA,CAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,MAAA,GAAS,CAAC,CAAA;AAC3C;AAEA,SAAS,uBAAuB,OAAA,EAAyB;AACvD,EAAA,OAAO,kBAAA,CAAmB,QAAQ,UAAA,CAAW,IAAA,EAAM,GAAG,CAAA,CAAE,UAAA,CAAW,IAAA,EAAM,GAAG,CAAC,CAAA;AAC/E;AAOO,SAAS,qBAAqB,OAAA,EAAyB;AAC5D,EAAA,OAAO,OAAA,CAAQ,UAAA,CAAW,GAAA,EAAK,IAAI,CAAA,CAAE,UAAA,CAAW,GAAA,EAAK,IAAI,CAAA,CAAE,UAAA,CAAW,GAAA,EAAK,KAAK,CAAA;AAClF;AAMO,SAAS,UAAU,KAAA,EAAgE;AACxF,EAAA,IAAI,GAAA,GAAM,GAAA;AACV,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,KAAS,IAAA,IAAQ,SAAS,EAAA,EAAI;AACtD,MAAA;AAAA,IACF;AACA,IAAA,MAAM,IAAA,GAAO,OAAO,IAAI,CAAA;AACxB,IAAA,MAAM,QAAA,GAAW,gBAAgB,IAAI,CAAA;AACrC,IAAA,KAAA,MAAW,WAAW,QAAA,CAAS,MAAA,GAAS,IAAI,QAAA,GAAW,CAAC,IAAI,CAAA,EAAG;AAC7D,MAAA,GAAA,IAAO,CAAA,CAAA,EAAI,oBAAA,CAAqB,OAAO,CAAC,CAAA,CAAA;AAAA,IAC1C;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;;"}
+{"version":3,"file":"json-pointer.mjs","sources":["../../../src/domain/openapi/json-pointer.ts"],"sourcesContent":["/**\n * The JSON Pointer of a `$ref` as path segments, with the semantics of Redocly's `parseRef`, which\n * the original generator used: the part after the first `#/`, split at `/`, each segment unescaped\n * (`~1` → `/`, `~0` → `~`, then percent-decoding), and empty segments dropped.\n *\n * Throws URIError for a malformed percent escape, as the original does.\n */\nexport function parseRefPointer(ref: string): string[] {\n  const [, pointer = \"\"] = ref.split(\"#/\");\n  return pointer\n    .split(\"/\")\n    .map(unescapePointerSegment)\n    .filter((segment) => segment.length > 0);\n}\n\nfunction unescapePointerSegment(segment: string): string {\n  return decodeURIComponent(segment.replaceAll(\"~1\", \"/\").replaceAll(\"~0\", \"~\"));\n}\n\n/**\n * Escape one segment for a JSON Pointer in a `$ref` fragment: `~` → `~0` and `/` → `~1` (RFC 6901),\n * then `%` → `%25` and `#` → `%23`, the two characters of a key that a URI fragment cannot hold as\n * written (RFC 6901 §6, RFC 3986). Reading a pointer back percent-decodes it, so the original's\n * unescaped `%` threw URIError for `50%` and read `a%2Fb` as `a/b` (upstream #2251, #2828), and\n * reading starts at the first `#/`, so an unescaped key `a#` cut the pointer short.\n */\nexport function escapePointerSegment(segment: string): string {\n  return segment\n    .replaceAll(\"~\", \"~0\")\n    .replaceAll(\"/\", \"~1\")\n    .replaceAll(\"%\", \"%25\")\n    .replaceAll(\"#\", \"%23\");\n}\n\n/** The pointer of the document root. */\nexport const ROOT_POINTER = \"#\";\n\n/** A raw pointer segment; a missing one (`undefined`, `null` or empty) is skipped. */\nexport type PointerSegment = string | number | null | undefined;\n\n/**\n * Extend the pointer `base` with raw segments: document keys, such as a path, a property name or a\n * media type, and array indexes. Each segment is escaped and never read as a `$ref`, so a key like\n * `#/%41` stays one segment and reads back unchanged with {@link parseRefPointer}. A missing\n * segment, such as the absent `name` of a parameter, is skipped, as the original `createRef` did,\n * and an empty one too, because `parseRefPointer` drops it.\n */\nexport function appendPointer(\n  base: string | undefined,\n  segments: readonly PointerSegment[],\n): string {\n  let pointer = pointerBase(base);\n  for (const segment of segments) {\n    if (segment !== undefined && segment !== null && segment !== \"\") {\n      pointer = childPointer(pointer, String(segment));\n    }\n  }\n  return pointer;\n}\n\n/**\n * The pointer of the child `key` of the node at `pointer`, with `key` escaped. Unlike\n * {@link appendPointer}, an empty key is a child too: a document walk names every key it visits.\n */\nexport function childPointer(pointer: string, key: string): string {\n  return `${pointer}/${escapePointerSegment(key)}`;\n}\n\n/**\n * A local `$ref` or `mapping` value in the form {@link appendPointer} builds, so that pointers\n * compare as text whatever escapes the document chose: `.../a#b` and `.../a%23b` are both\n * `.../a%23b`. Redocly writes a bundled `mapping` value percent-decoded, which is no pointer for a\n * key with `%` (`.../50%`), so such a text is read as written. Any other text, such as an\n * external `$ref` or a bare schema name, is returned unchanged.\n */\nexport function canonicalRef(ref: string): string {\n  if (!ref.startsWith(`${ROOT_POINTER}/`)) {\n    return ref;\n  }\n  return appendPointer(ROOT_POINTER, refSegments(ref));\n}\n\nfunction refSegments(ref: string): string[] {\n  try {\n    return parseRefPointer(ref);\n  } catch (error) {\n    if (!(error instanceof URIError)) {\n      throw error;\n    }\n    return writtenSegments(ref);\n  }\n}\n\n/** The segments of a pointer that is not percent-encoded: only `~1` and `~0` are escapes. */\nfunction writtenSegments(ref: string): string[] {\n  return ref\n    .slice(ROOT_POINTER.length + 1)\n    .split(\"/\")\n    .filter((segment) => segment.length > 0)\n    .map((segment) => segment.replaceAll(\"~1\", \"/\").replaceAll(\"~0\", \"~\"));\n}\n\n/**\n * A pointer (`#` or `#/...`) is kept as written; a missing base is the root. Any other text is a\n * `path` given to the exported transformers, such as `/items/{id}` or `other.yaml#/a`, which the\n * original read as a `createRef` part, so it is read the same way here.\n */\nfunction pointerBase(base: string | undefined): string {\n  if (base === undefined || base === \"\") {\n    return ROOT_POINTER;\n  }\n  return base === ROOT_POINTER || base.startsWith(`${ROOT_POINTER}/`) ? base : createRef([base]);\n}\n\n/**\n * Join parts into a local `$ref` (the original `createRef`, exported for 1.x by ADR-034). Empty\n * parts are skipped. A part that contains `#/` is parsed as a `$ref` and contributes its decoded\n * segments, so it throws URIError for a malformed percent escape; any other part is one segment.\n * Because of that parsing, the generator does not pass document keys here: it builds pointers\n * with {@link appendPointer}, which never parses a segment.\n */\nexport function createRef(parts: readonly PointerSegment[]): string {\n  let ref = \"#\";\n  for (const part of parts) {\n    if (part === undefined || part === null || part === \"\") {\n      continue;\n    }\n    const text = String(part);\n    const segments = parseRefPointer(text);\n    for (const segment of segments.length > 0 ? segments : [text]) {\n      ref += `/${escapePointerSegment(segment)}`;\n    }\n  }\n  return ref;\n}\n"],"names":[],"mappings":"AAOO,SAAS,gBAAgB,GAAA,EAAuB;AACrD,EAAA,MAAM,GAAG,OAAA,GAAU,EAAE,CAAA,GAAI,GAAA,CAAI,MAAM,IAAI,CAAA;AACvC,EAAA,OAAO,OAAA,CACJ,KAAA,CAAM,GAAG,CAAA,CACT,GAAA,CAAI,sBAAsB,CAAA,CAC1B,MAAA,CAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,MAAA,GAAS,CAAC,CAAA;AAC3C;AAEA,SAAS,uBAAuB,OAAA,EAAyB;AACvD,EAAA,OAAO,kBAAA,CAAmB,QAAQ,UAAA,CAAW,IAAA,EAAM,GAAG,CAAA,CAAE,UAAA,CAAW,IAAA,EAAM,GAAG,CAAC,CAAA;AAC/E;AASO,SAAS,qBAAqB,OAAA,EAAyB;AAC5D,EAAA,OAAO,OAAA,CACJ,UAAA,CAAW,GAAA,EAAK,IAAI,EACpB,UAAA,CAAW,GAAA,EAAK,IAAI,CAAA,CACpB,WAAW,GAAA,EAAK,KAAK,CAAA,CACrB,UAAA,CAAW,KAAK,KAAK,CAAA;AAC1B;AAGO,MAAM,YAAA,GAAe;AAYrB,SAAS,aAAA,CACd,MACA,QAAA,EACQ;AACR,EAAA,IAAI,OAAA,GAAU,YAAY,IAAI,CAAA;AAC9B,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,IAAI,OAAA,KAAY,MAAA,IAAa,OAAA,KAAY,IAAA,IAAQ,YAAY,EAAA,EAAI;AAC/D,MAAA,OAAA,GAAU,YAAA,CAAa,OAAA,EAAS,MAAA,CAAO,OAAO,CAAC,CAAA;AAAA,IACjD;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;AAMO,SAAS,YAAA,CAAa,SAAiB,GAAA,EAAqB;AACjE,EAAA,OAAO,CAAA,EAAG,OAAO,CAAA,CAAA,EAAI,oBAAA,CAAqB,GAAG,CAAC,CAAA,CAAA;AAChD;AASO,SAAS,aAAa,GAAA,EAAqB;AAChD,EAAA,IAAI,CAAC,GAAA,CAAI,UAAA,CAAW,CAAA,EAAG,YAAY,GAAG,CAAA,EAAG;AACvC,IAAA,OAAO,GAAA;AAAA,EACT;AACA,EAAA,OAAO,aAAA,CAAc,YAAA,EAAc,WAAA,CAAY,GAAG,CAAC,CAAA;AACrD;AAEA,SAAS,YAAY,GAAA,EAAuB;AAC1C,EAAA,IAAI;AACF,IAAA,OAAO,gBAAgB,GAAG,CAAA;AAAA,EAC5B,SAAS,KAAA,EAAO;AACd,IAAA,IAAI,EAAE,iBAAiB,QAAA,CAAA,EAAW;AAChC,MAAA,MAAM,KAAA;AAAA,IACR;AACA,IAAA,OAAO,gBAAgB,GAAG,CAAA;AAAA,EAC5B;AACF;AAGA,SAAS,gBAAgB,GAAA,EAAuB;AAC9C,EAAA,OAAO,GAAA,CACJ,KAAA,CAAM,YAAA,CAAa,MAAA,GAAS,CAAC,CAAA,CAC7B,KAAA,CAAM,GAAG,CAAA,CACT,MAAA,CAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,MAAA,GAAS,CAAC,CAAA,CACtC,GAAA,CAAI,CAAC,OAAA,KAAY,OAAA,CAAQ,UAAA,CAAW,IAAA,EAAM,GAAG,CAAA,CAAE,UAAA,CAAW,IAAA,EAAM,GAAG,CAAC,CAAA;AACzE;AAOA,SAAS,YAAY,IAAA,EAAkC;AACrD,EAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,KAAS,EAAA,EAAI;AACrC,IAAA,OAAO,YAAA;AAAA,EACT;AACA,EAAA,OAAO,IAAA,KAAS,YAAA,IAAgB,IAAA,CAAK,UAAA,CAAW,CAAA,EAAG,YAAY,CAAA,CAAA,CAAG,CAAA,GAAI,IAAA,GAAO,SAAA,CAAU,CAAC,IAAI,CAAC,CAAA;AAC/F;AASO,SAAS,UAAU,KAAA,EAA0C;AAClE,EAAA,IAAI,GAAA,GAAM,GAAA;AACV,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,KAAS,IAAA,IAAQ,SAAS,EAAA,EAAI;AACtD,MAAA;AAAA,IACF;AACA,IAAA,MAAM,IAAA,GAAO,OAAO,IAAI,CAAA;AACxB,IAAA,MAAM,QAAA,GAAW,gBAAgB,IAAI,CAAA;AACrC,IAAA,KAAA,MAAW,WAAW,QAAA,CAAS,MAAA,GAAS,IAAI,QAAA,GAAW,CAAC,IAAI,CAAA,EAAG;AAC7D,MAAA,GAAA,IAAO,CAAA,CAAA,EAAI,oBAAA,CAAqB,OAAO,CAAC,CAAA,CAAA;AAAA,IAC1C;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;;"}

package/dist/domain/openapi/schema-dialect.cjs

@@ -0,0 +1,15 @@
+'use strict';
+
+const SCHEMA_DIALECTS = {
+  OPENAPI_3_0: "openapi-3.0",
+  JSON_SCHEMA_2020_12: "json-schema-2020-12"
+};
+const OPENAPI_3_0_RE = /^3\.0(?:\.|$)/;
+function schemaDialectOf(openapiVersion) {
+  const isOpenApi30 = typeof openapiVersion !== "string" || OPENAPI_3_0_RE.test(openapiVersion);
+  return isOpenApi30 ? SCHEMA_DIALECTS.OPENAPI_3_0 : SCHEMA_DIALECTS.JSON_SCHEMA_2020_12;
+}
+
+exports.SCHEMA_DIALECTS = SCHEMA_DIALECTS;
+exports.schemaDialectOf = schemaDialectOf;
+//# sourceMappingURL=schema-dialect.cjs.map

package/dist/domain/openapi/schema-dialect.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema-dialect.cjs","sources":["../../../src/domain/openapi/schema-dialect.ts"],"sourcesContent":["/**\n * The schema dialect of a document. OpenAPI 3.0 Schema Objects ignore every keyword next to a\n * `$ref` (OpenAPI 3.0.3, Reference Object). OpenAPI 3.1 and 3.2 use JSON Schema 2020-12, where a\n * `$ref` is one keyword among the others, and all of them apply (JSON Schema Core §8.2.3.1).\n */\nexport const SCHEMA_DIALECTS = {\n  OPENAPI_3_0: \"openapi-3.0\",\n  JSON_SCHEMA_2020_12: \"json-schema-2020-12\",\n} as const;\n\nexport type SchemaDialect = (typeof SCHEMA_DIALECTS)[keyof typeof SCHEMA_DIALECTS];\n\nconst OPENAPI_3_0_RE = /^3\\.0(?:\\.|$)/;\n\n/**\n * The dialect of a document's `openapi` version. Without a version (a schema passed to a\n * transformer on its own) it is OpenAPI 3.0, which keeps the output the original gives.\n */\nexport function schemaDialectOf(openapiVersion: unknown): SchemaDialect {\n  const isOpenApi30 = typeof openapiVersion !== \"string\" || OPENAPI_3_0_RE.test(openapiVersion);\n  return isOpenApi30 ? SCHEMA_DIALECTS.OPENAPI_3_0 : SCHEMA_DIALECTS.JSON_SCHEMA_2020_12;\n}\n"],"names":[],"mappings":";;AAKO,MAAM,eAAA,GAAkB;AAAA,EAC7B,WAAA,EAAa,aAAA;AAAA,EACb,mBAAA,EAAqB;AACvB;AAIA,MAAM,cAAA,GAAiB,eAAA;AAMhB,SAAS,gBAAgB,cAAA,EAAwC;AACtE,EAAA,MAAM,cAAc,OAAO,cAAA,KAAmB,QAAA,IAAY,cAAA,CAAe,KAAK,cAAc,CAAA;AAC5F,EAAA,OAAO,WAAA,GAAc,eAAA,CAAgB,WAAA,GAAc,eAAA,CAAgB,mBAAA;AACrE;;;"}

package/dist/domain/openapi/schema-dialect.mjs

@@ -0,0 +1,12 @@
+const SCHEMA_DIALECTS = {
+  OPENAPI_3_0: "openapi-3.0",
+  JSON_SCHEMA_2020_12: "json-schema-2020-12"
+};
+const OPENAPI_3_0_RE = /^3\.0(?:\.|$)/;
+function schemaDialectOf(openapiVersion) {
+  const isOpenApi30 = typeof openapiVersion !== "string" || OPENAPI_3_0_RE.test(openapiVersion);
+  return isOpenApi30 ? SCHEMA_DIALECTS.OPENAPI_3_0 : SCHEMA_DIALECTS.JSON_SCHEMA_2020_12;
+}
+
+export { SCHEMA_DIALECTS, schemaDialectOf };
+//# sourceMappingURL=schema-dialect.mjs.map

package/dist/domain/openapi/schema-dialect.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema-dialect.mjs","sources":["../../../src/domain/openapi/schema-dialect.ts"],"sourcesContent":["/**\n * The schema dialect of a document. OpenAPI 3.0 Schema Objects ignore every keyword next to a\n * `$ref` (OpenAPI 3.0.3, Reference Object). OpenAPI 3.1 and 3.2 use JSON Schema 2020-12, where a\n * `$ref` is one keyword among the others, and all of them apply (JSON Schema Core §8.2.3.1).\n */\nexport const SCHEMA_DIALECTS = {\n  OPENAPI_3_0: \"openapi-3.0\",\n  JSON_SCHEMA_2020_12: \"json-schema-2020-12\",\n} as const;\n\nexport type SchemaDialect = (typeof SCHEMA_DIALECTS)[keyof typeof SCHEMA_DIALECTS];\n\nconst OPENAPI_3_0_RE = /^3\\.0(?:\\.|$)/;\n\n/**\n * The dialect of a document's `openapi` version. Without a version (a schema passed to a\n * transformer on its own) it is OpenAPI 3.0, which keeps the output the original gives.\n */\nexport function schemaDialectOf(openapiVersion: unknown): SchemaDialect {\n  const isOpenApi30 = typeof openapiVersion !== \"string\" || OPENAPI_3_0_RE.test(openapiVersion);\n  return isOpenApi30 ? SCHEMA_DIALECTS.OPENAPI_3_0 : SCHEMA_DIALECTS.JSON_SCHEMA_2020_12;\n}\n"],"names":[],"mappings":"AAKO,MAAM,eAAA,GAAkB;AAAA,EAC7B,WAAA,EAAa,aAAA;AAAA,EACb,mBAAA,EAAqB;AACvB;AAIA,MAAM,cAAA,GAAiB,eAAA;AAMhB,SAAS,gBAAgB,cAAA,EAAwC;AACtE,EAAA,MAAM,cAAc,OAAO,cAAA,KAAmB,QAAA,IAAY,cAAA,CAAe,KAAK,cAAc,CAAA;AAC5F,EAAA,OAAO,WAAA,GAAc,eAAA,CAAgB,WAAA,GAAc,eAAA,CAAgB,mBAAA;AACrE;;"}

package/dist/domain/openapi/unsupported-features.cjs

@@ -31,7 +31,7 @@ function locatedParameters(document, parameters, segments) {
   }
   return parameters.flatMap((entry, index) => {
     const parameter = resolveLocal(document, entry);
-    const pointer = jsonPointer.createRef([...segments, String(index)]);
+    const pointer = jsonPointer.appendPointer(jsonPointer.ROOT_POINTER, [...segments, index]);
     return isObject(parameter) ? [{ pointer, parameter }] : [];
   });
 }