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

package/dist/application/transform/footer/document-footer.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"document-footer.mjs","sources":["../../../../src/application/transform/footer/document-footer.ts"],"sourcesContent":["import { irReference } from \"../../../domain/ir/constructors.js\";\nimport type {\n  IrDeclaration,\n  IrEnumDeclaration,\n  IrPropertySignature,\n  IrType,\n} from \"../../../domain/ir/nodes.js\";\nimport { HELPER_TYPES, type HelperType } from \"../helper-types.js\";\nimport type {\n  EnumDeclarationRequest,\n  EnumMemberMetadata,\n  EnumValuesRequest,\n} from \"../schema/schema-context.js\";\nimport type { DocumentFooter } from \"../transform-context.js\";\nimport {\n  type DeclaredMembers,\n  EnumNaming,\n  enumDeclaration,\n  withoutDeclaredMembers,\n} from \"./enum-naming.js\";\nimport { FIRST_SCHEMA_NAMES, type SharedEnumNames } from \"./shared-enum-names.js\";\n\n/** Where footer declarations go, in order: the run's `ctx.injectFooter`, open to user code. */\nexport interface FooterSink {\n  /** Whether a type alias with this name is declared already (by the generator or a user). */\n  hasTypeAlias(name: string): boolean;\n  add(declaration: IrDeclaration): void;\n  /** Add a member to the `operations` interface, declared first if needed; see `DocumentFooter`. */\n  addOperation(build: () => IrPropertySignature): void;\n}\n\n/**\n * The `--dedupe-enums` key of the original: the values in default sort order, each paired with\n * the metadata at its sorted position (not the value's own metadata), as the original does.\n */\nfunction dedupeKey(request: EnumDeclarationRequest): string {\n  return [...request.values]\n    .sort(compareAsStrings)\n    .map((value, index) => metadataKey(String(value), request.metadata[index]))\n    .join(\",\");\n}\n\n/** `Array.prototype.sort` without a comparator: compares the values as strings. */\nfunction compareAsStrings(left: string | number, right: string | number): number {\n  const leftText = String(left);\n  const rightText = String(right);\n  if (leftText === rightText) {\n    return 0;\n  }\n  return leftText < rightText ? -1 : 1;\n}\n\nfunction metadataKey(value: string, metadata: EnumMemberMetadata | undefined): string {\n  return `${metadata?.name ?? value}:${metadata?.description || \"\"}`;\n}\n\n/** Separates a repeated `--enum-values` array name from its number, as root type aliases do. */\nconst ENUM_VALUES_NUMBER_SEPARATOR = \"_\";\n\n/** The whole declaration: an equal key means the same enum, member for member. */\nfunction declarationKey(name: string, request: EnumDeclarationRequest): string {\n  return JSON.stringify([name, request.values, request.metadata]);\n}\n\n/**\n * The footer of one run: enums (deduplicated with `--dedupe-enums`), `--enum-values` arrays, the\n * helper types they need, and the `operations` interface. Replaces the original's module-level\n * `enumCache`, so runs no longer share enums (research/legacy-bugs.md, item 3).\n */\nexport class RunFooter implements DocumentFooter {\n  private readonly naming = new EnumNaming();\n  private readonly enumNamesByKey = new Map<string, string>();\n  /** Declarations added already: the same one twice fails with \"Duplicate identifier\". */\n  private readonly declaredEnums = new Set<string>();\n  /** The member names of each declared enum, by value. */\n  private readonly membersByEnum = new Map<string, Map<string | number, string>>();\n  /** The members of each declared enum name, by member name. */\n  private readonly declaredMembers = new Map<string, Map<string, string | number>>();\n  /** `--enum-values` arrays added already: their declared name by name, type and values. */\n  private readonly declaredEnumValues = new Map<string, string>();\n  /** The declared `--enum-values` array names. */\n  private readonly enumValuesNames = new Set<string>();\n  private readonly sink: FooterSink;\n  private readonly isDedupingEnums: boolean;\n  private readonly sharedNames: SharedEnumNames;\n\n  constructor(\n    sink: FooterSink,\n    isDedupingEnums: boolean,\n    sharedNames: SharedEnumNames = FIRST_SCHEMA_NAMES,\n  ) {\n    this.sink = sink;\n    this.isDedupingEnums = isDedupingEnums;\n    this.sharedNames = sharedNames;\n  }\n\n  addEnum(request: EnumDeclarationRequest): string {\n    // The name is built before the cache lookup: it advances the naming state either way.\n    const ownName = this.naming.enumName(request.name);\n    const key = this.isDedupingEnums ? dedupeKey(request) : null;\n    // Every schema of a shared enum goes to `sharedNames`, the later ones too.\n    const name = key === null ? ownName : this.sharedNames.nameOf(key, ownName, request);\n    const known = key === null ? undefined : this.enumNamesByKey.get(key);\n    if (known !== undefined) {\n      return known;\n    }\n    // Only a repeated member fails to compile; two empty declarations merge, so they stay.\n    const declared = request.values.length > 0 ? declarationKey(name, request) : null;\n    if (declared !== null && this.declaredEnums.has(declared)) {\n      return name;\n    }\n    if (declared !== null) {\n      this.declaredEnums.add(declared);\n    }\n    const declaration = this.withoutRepeats(enumDeclaration(name, request, this.naming));\n    if (declaration !== null) {\n      this.record(declaration);\n      this.sink.add(declaration);\n    }\n    if (key !== null) {\n      this.enumNamesByKey.set(key, name);\n    }\n    return name;\n  }\n\n  /** The declaration without members an earlier one of the name has; null when none is left. */\n  private withoutRepeats(declaration: IrEnumDeclaration): IrEnumDeclaration | null {\n    const earlier: DeclaredMembers | undefined = this.declaredMembers.get(declaration.name);\n    if (earlier === undefined) {\n      return declaration;\n    }\n    const merged = withoutDeclaredMembers(declaration, earlier);\n    // Two empty declarations merge into one empty enum, which compiles, so the second stays.\n    return merged.members.length === 0 && declaration.members.length > 0 ? null : merged;\n  }\n\n  /** The members of a declaration; the first member of a value names it. */\n  private record(declaration: IrEnumDeclaration): void {\n    const byName = this.declaredMembers.get(declaration.name) ?? new Map();\n    const byValue = this.membersByEnum.get(declaration.name) ?? new Map();\n    for (const member of declaration.members) {\n      byName.set(member.name, member.value);\n      if (!byValue.has(member.value)) {\n        byValue.set(member.value, member.name);\n      }\n    }\n    this.declaredMembers.set(declaration.name, byName);\n    this.membersByEnum.set(declaration.name, byValue);\n  }\n\n  enumMembers(name: string): ReadonlyMap<string | number, string> {\n    return this.membersByEnum.get(name) ?? new Map();\n  }\n\n  addEnumValues(request: EnumValuesRequest): void {\n    const baseName = this.naming.arrayName(request.name);\n    // The same array twice fails with \"Cannot redeclare\"; a schema typed twice adds it twice.\n    const declared = JSON.stringify([baseName, request.type, request.values]);\n    if (this.declaredEnumValues.has(declared)) {\n      return;\n    }\n    const name = this.freeEnumValuesName(baseName);\n    this.declaredEnumValues.set(declared, name);\n    this.enumValuesNames.add(name);\n    this.require(HELPER_TYPES.flattenedDeepRequired);\n    this.require(HELPER_TYPES.readonlyArray);\n    this.sink.add({\n      kind: \"constArray\",\n      name,\n      isExported: true,\n      type: readonlyArrayOf(request.type),\n      values: request.values,\n      comments: [],\n    });\n  }\n\n  /**\n   * Another array may have the name: `Discount/type` and `discount/type`, or a property and an\n   * inline `allOf` item of one schema, typed at one location. A redeclared `const` does not\n   * compile, so a later one gets the next number (`discountTypeValues_2`). Every unnumbered name\n   * ends with `Values`, so a number never takes a name that a later array needs.\n   */\n  private freeEnumValuesName(name: string): string {\n    let candidate = name;\n    for (let count = 2; this.enumValuesNames.has(candidate); count++) {\n      candidate = `${name}${ENUM_VALUES_NUMBER_SEPARATOR}${count}`;\n    }\n    return candidate;\n  }\n\n  requireWithRequired(): void {\n    this.require(HELPER_TYPES.withRequired);\n  }\n\n  requirePropertyValues(): void {\n    this.require(HELPER_TYPES.propertyValues);\n  }\n\n  addOperation(build: () => IrPropertySignature): void {\n    this.sink.addOperation(build);\n  }\n\n  private require(helper: HelperType): void {\n    if (!this.sink.hasTypeAlias(helper.name)) {\n      this.sink.add({ kind: \"rawDeclaration\", name: helper.name, text: helper.text });\n    }\n  }\n}\n\nfunction readonlyArrayOf(type: IrType): IrType {\n  return irReference(HELPER_TYPES.readonlyArray.name, [type]);\n}\n"],"names":[],"mappings":";;;;;AAmCA,SAAS,UAAU,OAAA,EAAyC;AAC1D,EAAA,OAAO,CAAC,GAAG,OAAA,CAAQ,MAAM,EACtB,IAAA,CAAK,gBAAgB,CAAA,CACrB,GAAA,CAAI,CAAC,KAAA,EAAO,UAAU,WAAA,CAAY,MAAA,CAAO,KAAK,CAAA,EAAG,OAAA,CAAQ,QAAA,CAAS,KAAK,CAAC,CAAC,CAAA,CACzE,IAAA,CAAK,GAAG,CAAA;AACb;AAGA,SAAS,gBAAA,CAAiB,MAAuB,KAAA,EAAgC;AAC/E,EAAA,MAAM,QAAA,GAAW,OAAO,IAAI,CAAA;AAC5B,EAAA,MAAM,SAAA,GAAY,OAAO,KAAK,CAAA;AAC9B,EAAA,IAAI,aAAa,SAAA,EAAW;AAC1B,IAAA,OAAO,CAAA;AAAA,EACT;AACA,EAAA,OAAO,QAAA,GAAW,YAAY,EAAA,GAAK,CAAA;AACrC;AAEA,SAAS,WAAA,CAAY,OAAe,QAAA,EAAkD;AACpF,EAAA,OAAO,GAAG,QAAA,EAAU,IAAA,IAAQ,KAAK,CAAA,CAAA,EAAI,QAAA,EAAU,eAAe,EAAE,CAAA,CAAA;AAClE;AAGA,MAAM,4BAAA,GAA+B,GAAA;AAGrC,SAAS,cAAA,CAAe,MAAc,OAAA,EAAyC;AAC7E,EAAA,OAAO,IAAA,CAAK,UAAU,CAAC,IAAA,EAAM,QAAQ,MAAA,EAAQ,OAAA,CAAQ,QAAQ,CAAC,CAAA;AAChE;AAOO,MAAM,SAAA,CAAoC;AAAA,EAC9B,MAAA,GAAS,IAAI,UAAA,EAAW;AAAA,EACxB,cAAA,uBAAqB,GAAA,EAAoB;AAAA;AAAA,EAEzC,aAAA,uBAAoB,GAAA,EAAY;AAAA;AAAA,EAEhC,aAAA,uBAAoB,GAAA,EAA0C;AAAA;AAAA,EAE9D,eAAA,uBAAsB,GAAA,EAA0C;AAAA;AAAA,EAEhE,kBAAA,uBAAyB,GAAA,EAAoB;AAAA;AAAA,EAE7C,eAAA,uBAAsB,GAAA,EAAY;AAAA,EAClC,IAAA;AAAA,EACA,eAAA;AAAA,EACA,WAAA;AAAA,EAEjB,WAAA,CACE,IAAA,EACA,eAAA,EACA,WAAA,GAA+B,kBAAA,EAC/B;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,eAAA,GAAkB,eAAA;AACvB,IAAA,IAAA,CAAK,WAAA,GAAc,WAAA;AAAA,EACrB;AAAA,EAEA,QAAQ,OAAA,EAAyC;AAE/C,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,MAAA,CAAO,QAAA,CAAS,QAAQ,IAAI,CAAA;AACjD,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,eAAA,GAAkB,SAAA,CAAU,OAAO,CAAA,GAAI,IAAA;AAExD,IAAA,MAAM,IAAA,GAAO,QAAQ,IAAA,GAAO,OAAA,GAAU,KAAK,WAAA,CAAY,MAAA,CAAO,GAAA,EAAK,OAAA,EAAS,OAAO,CAAA;AACnF,IAAA,MAAM,QAAQ,GAAA,KAAQ,IAAA,GAAO,SAAY,IAAA,CAAK,cAAA,CAAe,IAAI,GAAG,CAAA;AACpE,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,MAAM,QAAA,GAAW,QAAQ,MAAA,CAAO,MAAA,GAAS,IAAI,cAAA,CAAe,IAAA,EAAM,OAAO,CAAA,GAAI,IAAA;AAC7E,IAAA,IAAI,aAAa,IAAA,IAAQ,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,QAAQ,CAAA,EAAG;AACzD,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,aAAa,IAAA,EAAM;AACrB,MAAA,IAAA,CAAK,aAAA,CAAc,IAAI,QAAQ,CAAA;AAAA,IACjC;AACA,IAAA,MAAM,WAAA,GAAc,KAAK,cAAA,CAAe,eAAA,CAAgB,MAAM,OAAA,EAAS,IAAA,CAAK,MAAM,CAAC,CAAA;AACnF,IAAA,IAAI,gBAAgB,IAAA,EAAM;AACxB,MAAA,IAAA,CAAK,OAAO,WAAW,CAAA;AACvB,MAAA,IAAA,CAAK,IAAA,CAAK,IAAI,WAAW,CAAA;AAAA,IAC3B;AACA,IAAA,IAAI,QAAQ,IAAA,EAAM;AAChB,MAAA,IAAA,CAAK,cAAA,CAAe,GAAA,CAAI,GAAA,EAAK,IAAI,CAAA;AAAA,IACnC;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA,EAGQ,eAAe,WAAA,EAA0D;AAC/E,IAAA,MAAM,OAAA,GAAuC,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,YAAY,IAAI,CAAA;AACtF,IAAA,IAAI,YAAY,MAAA,EAAW;AACzB,MAAA,OAAO,WAAA;AAAA,IACT;AACA,IAAA,MAAM,MAAA,GAAS,sBAAA,CAAuB,WAAA,EAAa,OAAO,CAAA;AAE1D,IAAA,OAAO,MAAA,CAAO,QAAQ,MAAA,KAAW,CAAA,IAAK,YAAY,OAAA,CAAQ,MAAA,GAAS,IAAI,IAAA,GAAO,MAAA;AAAA,EAChF;AAAA;AAAA,EAGQ,OAAO,WAAA,EAAsC;AACnD,IAAA,MAAM,MAAA,GAAS,KAAK,eAAA,CAAgB,GAAA,CAAI,YAAY,IAAI,CAAA,wBAAS,GAAA,EAAI;AACrE,IAAA,MAAM,OAAA,GAAU,KAAK,aAAA,CAAc,GAAA,CAAI,YAAY,IAAI,CAAA,wBAAS,GAAA,EAAI;AACpE,IAAA,KAAA,MAAW,MAAA,IAAU,YAAY,OAAA,EAAS;AACxC,MAAA,MAAA,CAAO,GAAA,CAAI,MAAA,CAAO,IAAA,EAAM,MAAA,CAAO,KAAK,CAAA;AACpC,MAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,KAAK,CAAA,EAAG;AAC9B,QAAA,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,KAAA,EAAO,MAAA,CAAO,IAAI,CAAA;AAAA,MACvC;AAAA,IACF;AACA,IAAA,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,MAAM,CAAA;AACjD,IAAA,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,OAAO,CAAA;AAAA,EAClD;AAAA,EAEA,YAAY,IAAA,EAAoD;AAC9D,IAAA,OAAO,KAAK,aAAA,CAAc,GAAA,CAAI,IAAI,CAAA,wBAAS,GAAA,EAAI;AAAA,EACjD;AAAA,EAEA,cAAc,OAAA,EAAkC;AAC9C,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,SAAA,CAAU,QAAQ,IAAI,CAAA;AAEnD,IAAA,MAAM,QAAA,GAAW,KAAK,SAAA,CAAU,CAAC,UAAU,OAAA,CAAQ,IAAA,EAAM,OAAA,CAAQ,MAAM,CAAC,CAAA;AACxE,IAAA,IAAI,IAAA,CAAK,kBAAA,CAAmB,GAAA,CAAI,QAAQ,CAAA,EAAG;AACzC,MAAA;AAAA,IACF;AACA,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,kBAAA,CAAmB,QAAQ,CAAA;AAC7C,IAAA,IAAA,CAAK,kBAAA,CAAmB,GAAA,CAAI,QAAA,EAAU,IAAI,CAAA;AAC1C,IAAA,IAAA,CAAK,eAAA,CAAgB,IAAI,IAAI,CAAA;AAC7B,IAAA,IAAA,CAAK,OAAA,CAAQ,aAAa,qBAAqB,CAAA;AAC/C,IAAA,IAAA,CAAK,OAAA,CAAQ,aAAa,aAAa,CAAA;AACvC,IAAA,IAAA,CAAK,KAAK,GAAA,CAAI;AAAA,MACZ,IAAA,EAAM,YAAA;AAAA,MACN,IAAA;AAAA,MACA,UAAA,EAAY,IAAA;AAAA,MACZ,IAAA,EAAM,eAAA,CAAgB,OAAA,CAAQ,IAAI,CAAA;AAAA,MAClC,QAAQ,OAAA,CAAQ,MAAA;AAAA,MAChB,UAAU;AAAC,KACZ,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,mBAAmB,IAAA,EAAsB;AAC/C,IAAA,IAAI,SAAA,GAAY,IAAA;AAChB,IAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,IAAA,CAAK,gBAAgB,GAAA,CAAI,SAAS,GAAG,KAAA,EAAA,EAAS;AAChE,MAAA,SAAA,GAAY,CAAA,EAAG,IAAI,CAAA,EAAG,4BAA4B,GAAG,KAAK,CAAA,CAAA;AAAA,IAC5D;AACA,IAAA,OAAO,SAAA;AAAA,EACT;AAAA,EAEA,mBAAA,GAA4B;AAC1B,IAAA,IAAA,CAAK,OAAA,CAAQ,aAAa,YAAY,CAAA;AAAA,EACxC;AAAA,EAEA,qBAAA,GAA8B;AAC5B,IAAA,IAAA,CAAK,OAAA,CAAQ,aAAa,cAAc,CAAA;AAAA,EAC1C;AAAA,EAEA,aAAa,KAAA,EAAwC;AACnD,IAAA,IAAA,CAAK,IAAA,CAAK,aAAa,KAAK,CAAA;AAAA,EAC9B;AAAA,EAEQ,QAAQ,MAAA,EAA0B;AACxC,IAAA,IAAI,CAAC,IAAA,CAAK,IAAA,CAAK,YAAA,CAAa,MAAA,CAAO,IAAI,CAAA,EAAG;AACxC,MAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,EAAE,IAAA,EAAM,gBAAA,EAAkB,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,CAAA;AAAA,IAChF;AAAA,EACF;AACF;AAEA,SAAS,gBAAgB,IAAA,EAAsB;AAC7C,EAAA,OAAO,YAAY,YAAA,CAAa,aAAA,CAAc,IAAA,EAAM,CAAC,IAAI,CAAC,CAAA;AAC5D;;"}
+{"version":3,"file":"document-footer.mjs","sources":["../../../../src/application/transform/footer/document-footer.ts"],"sourcesContent":["import { irReference } from \"../../../domain/ir/constructors.js\";\nimport type {\n  IrDeclaration,\n  IrEnumDeclaration,\n  IrPropertySignature,\n  IrType,\n} from \"../../../domain/ir/nodes.js\";\nimport { HELPER_TYPES, type HelperType } from \"../helper-types.js\";\nimport type {\n  EnumDeclarationRequest,\n  EnumMemberMetadata,\n  EnumValuesRequest,\n} from \"../schema/schema-context.js\";\nimport type { DocumentFooter } from \"../transform-context.js\";\nimport { EnumNameClaims } from \"./enum-name-claims.js\";\nimport {\n  type DeclaredMembers,\n  EnumNaming,\n  enumDeclaration,\n  withoutDeclaredMembers,\n} from \"./enum-naming.js\";\nimport { OperationKeys } from \"./operation-keys.js\";\nimport { FIRST_SCHEMA_NAMES, type SharedEnumNames } from \"./shared-enum-names.js\";\n\n/** Where footer declarations go, in order: the run's `ctx.injectFooter`, open to user code. */\nexport interface FooterSink {\n  /** Whether a type alias with this name is declared already (by the generator or a user). */\n  hasTypeAlias(name: string): boolean;\n  add(declaration: IrDeclaration): void;\n  /** Add a member to the `operations` interface, declared first if needed; see `DocumentFooter`. */\n  addOperation(build: () => IrPropertySignature): void;\n}\n\n/**\n * The `--dedupe-enums` key of the original: the values in default sort order, each paired with\n * the metadata at its sorted position (not the value's own metadata), as the original does.\n */\nfunction dedupeKey(request: EnumDeclarationRequest): string {\n  return [...request.values]\n    .sort(compareAsStrings)\n    .map((value, index) => metadataKey(String(value), request.metadata[index]))\n    .join(\",\");\n}\n\n/** `Array.prototype.sort` without a comparator: compares the values as strings. */\nfunction compareAsStrings(left: string | number, right: string | number): number {\n  const leftText = String(left);\n  const rightText = String(right);\n  if (leftText === rightText) {\n    return 0;\n  }\n  return leftText < rightText ? -1 : 1;\n}\n\nfunction metadataKey(value: string, metadata: EnumMemberMetadata | undefined): string {\n  return `${metadata?.name ?? value}:${metadata?.description || \"\"}`;\n}\n\n/** Separates a repeated `--enum-values` array name from its number, as root type aliases do. */\nconst ENUM_VALUES_NUMBER_SEPARATOR = \"_\";\n\n/** The whole declaration: an equal key means the same enum, member for member. */\nfunction declarationKey(name: string, request: EnumDeclarationRequest): string {\n  return JSON.stringify([name, request.values, request.metadata]);\n}\n\n/** The naming state a run's footer shares with the rest of the run. */\nexport interface RunFooterNames {\n  readonly enums: EnumNameClaims;\n  readonly operations: OperationKeys;\n}\n\n/**\n * The footer of one run: enums (deduplicated with `--dedupe-enums`), `--enum-values` arrays, the\n * helper types they need, and the `operations` interface. Replaces the original's module-level\n * `enumCache`, so runs no longer share enums (research/legacy-bugs.md, item 3).\n */\nexport class RunFooter implements DocumentFooter {\n  private readonly naming = new EnumNaming();\n  private readonly enumNamesByKey = new Map<string, string>();\n  /** Declarations added already: the same one twice fails with \"Duplicate identifier\". */\n  private readonly declaredEnums = new Set<string>();\n  /** The member names of each declared enum, by value. */\n  private readonly membersByEnum = new Map<string, Map<string | number, string>>();\n  /** The members of each declared enum name, by member name. */\n  private readonly declaredMembers = new Map<string, Map<string, string | number>>();\n  /** `--enum-values` arrays added already: their declared name by name, type and values. */\n  private readonly declaredEnumValues = new Map<string, string>();\n  /** The declared `--enum-values` array names. */\n  private readonly enumValuesNames = new Set<string>();\n  private readonly sink: FooterSink;\n  private readonly isDedupingEnums: boolean;\n  private readonly sharedNames: SharedEnumNames;\n  private readonly names: RunFooterNames;\n\n  constructor(\n    sink: FooterSink,\n    isDedupingEnums: boolean,\n    sharedNames: SharedEnumNames = FIRST_SCHEMA_NAMES,\n    names: RunFooterNames = { enums: new EnumNameClaims(), operations: new OperationKeys() },\n  ) {\n    this.sink = sink;\n    this.isDedupingEnums = isDedupingEnums;\n    this.sharedNames = sharedNames;\n    this.names = names;\n  }\n\n  addEnum(request: EnumDeclarationRequest): string {\n    // The name is built before the cache lookup: it advances the naming state either way.\n    const ownName = this.naming.enumName(request.name);\n    const key = this.isDedupingEnums ? dedupeKey(request) : null;\n    // Every schema of a shared enum goes to `sharedNames`, the later ones too.\n    const sharedName = key === null ? ownName : this.sharedNames.nameOf(key, ownName, request);\n    const known = key === null ? undefined : this.enumNamesByKey.get(key);\n    if (known !== undefined) {\n      return known;\n    }\n    // The owner is the schema location: its requests share one enum, with `--dedupe-enums` too.\n    const name = this.names.enums.nameFor(sharedName, request.name);\n    // Only a repeated member fails to compile; two empty declarations merge, so they stay.\n    const declared = request.values.length > 0 ? declarationKey(name, request) : null;\n    if (declared !== null && this.declaredEnums.has(declared)) {\n      return name;\n    }\n    if (declared !== null) {\n      this.declaredEnums.add(declared);\n    }\n    const declaration = this.withoutRepeats(enumDeclaration(name, request, this.naming));\n    if (declaration !== null) {\n      this.record(declaration);\n      this.sink.add(declaration);\n    }\n    if (key !== null) {\n      this.enumNamesByKey.set(key, name);\n    }\n    return name;\n  }\n\n  /** The declaration without members an earlier one of the name has; null when none is left. */\n  private withoutRepeats(declaration: IrEnumDeclaration): IrEnumDeclaration | null {\n    const earlier: DeclaredMembers | undefined = this.declaredMembers.get(declaration.name);\n    if (earlier === undefined) {\n      return declaration;\n    }\n    const merged = withoutDeclaredMembers(declaration, earlier);\n    // Two empty declarations merge into one empty enum, which compiles, so the second stays.\n    return merged.members.length === 0 && declaration.members.length > 0 ? null : merged;\n  }\n\n  /** The members of a declaration; the first member of a value names it. */\n  private record(declaration: IrEnumDeclaration): void {\n    const byName = this.declaredMembers.get(declaration.name) ?? new Map();\n    const byValue = this.membersByEnum.get(declaration.name) ?? new Map();\n    for (const member of declaration.members) {\n      byName.set(member.name, member.value);\n      if (!byValue.has(member.value)) {\n        byValue.set(member.value, member.name);\n      }\n    }\n    this.declaredMembers.set(declaration.name, byName);\n    this.membersByEnum.set(declaration.name, byValue);\n  }\n\n  enumMembers(name: string): ReadonlyMap<string | number, string> {\n    return this.membersByEnum.get(name) ?? new Map();\n  }\n\n  addEnumValues(request: EnumValuesRequest): void {\n    const baseName = this.naming.arrayName(request.name);\n    // The same array twice fails with \"Cannot redeclare\"; a schema typed twice adds it twice.\n    const declared = JSON.stringify([baseName, request.type, request.values]);\n    if (this.declaredEnumValues.has(declared)) {\n      return;\n    }\n    const name = this.freeEnumValuesName(baseName);\n    this.declaredEnumValues.set(declared, name);\n    this.enumValuesNames.add(name);\n    this.require(HELPER_TYPES.flattenedDeepRequired);\n    this.require(HELPER_TYPES.readonlyArray);\n    this.sink.add({\n      kind: \"constArray\",\n      name,\n      isExported: true,\n      type: readonlyArrayOf(request.type),\n      values: request.values,\n      comments: [],\n    });\n  }\n\n  /**\n   * Another array may have the name: `Discount/type` and `discount/type`, or a property and an\n   * inline `allOf` item of one schema, typed at one location. A redeclared `const` does not\n   * compile, so a later one gets the next number (`discountTypeValues_2`). Every unnumbered name\n   * ends with `Values`, so a number never takes a name that a later array needs.\n   */\n  private freeEnumValuesName(name: string): string {\n    let candidate = name;\n    for (let count = 2; this.enumValuesNames.has(candidate); count++) {\n      candidate = `${name}${ENUM_VALUES_NUMBER_SEPARATOR}${count}`;\n    }\n    return candidate;\n  }\n\n  requireWithRequired(): void {\n    this.require(HELPER_TYPES.withRequired);\n  }\n\n  requirePropertyValues(): void {\n    this.require(HELPER_TYPES.propertyValues);\n  }\n\n  addOperation(build: () => IrPropertySignature): void {\n    this.sink.addOperation(build);\n  }\n\n  operationKey(operationId: string): string {\n    return this.names.operations.keyFor(operationId);\n  }\n\n  private require(helper: HelperType): void {\n    if (!this.sink.hasTypeAlias(helper.name)) {\n      this.sink.add({ kind: \"rawDeclaration\", name: helper.name, text: helper.text });\n    }\n  }\n}\n\nfunction readonlyArrayOf(type: IrType): IrType {\n  return irReference(HELPER_TYPES.readonlyArray.name, [type]);\n}\n"],"names":[],"mappings":";;;;;;;AAqCA,SAAS,UAAU,OAAA,EAAyC;AAC1D,EAAA,OAAO,CAAC,GAAG,OAAA,CAAQ,MAAM,EACtB,IAAA,CAAK,gBAAgB,CAAA,CACrB,GAAA,CAAI,CAAC,KAAA,EAAO,UAAU,WAAA,CAAY,MAAA,CAAO,KAAK,CAAA,EAAG,OAAA,CAAQ,QAAA,CAAS,KAAK,CAAC,CAAC,CAAA,CACzE,IAAA,CAAK,GAAG,CAAA;AACb;AAGA,SAAS,gBAAA,CAAiB,MAAuB,KAAA,EAAgC;AAC/E,EAAA,MAAM,QAAA,GAAW,OAAO,IAAI,CAAA;AAC5B,EAAA,MAAM,SAAA,GAAY,OAAO,KAAK,CAAA;AAC9B,EAAA,IAAI,aAAa,SAAA,EAAW;AAC1B,IAAA,OAAO,CAAA;AAAA,EACT;AACA,EAAA,OAAO,QAAA,GAAW,YAAY,EAAA,GAAK,CAAA;AACrC;AAEA,SAAS,WAAA,CAAY,OAAe,QAAA,EAAkD;AACpF,EAAA,OAAO,GAAG,QAAA,EAAU,IAAA,IAAQ,KAAK,CAAA,CAAA,EAAI,QAAA,EAAU,eAAe,EAAE,CAAA,CAAA;AAClE;AAGA,MAAM,4BAAA,GAA+B,GAAA;AAGrC,SAAS,cAAA,CAAe,MAAc,OAAA,EAAyC;AAC7E,EAAA,OAAO,IAAA,CAAK,UAAU,CAAC,IAAA,EAAM,QAAQ,MAAA,EAAQ,OAAA,CAAQ,QAAQ,CAAC,CAAA;AAChE;AAaO,MAAM,SAAA,CAAoC;AAAA,EAC9B,MAAA,GAAS,IAAI,UAAA,EAAW;AAAA,EACxB,cAAA,uBAAqB,GAAA,EAAoB;AAAA;AAAA,EAEzC,aAAA,uBAAoB,GAAA,EAAY;AAAA;AAAA,EAEhC,aAAA,uBAAoB,GAAA,EAA0C;AAAA;AAAA,EAE9D,eAAA,uBAAsB,GAAA,EAA0C;AAAA;AAAA,EAEhE,kBAAA,uBAAyB,GAAA,EAAoB;AAAA;AAAA,EAE7C,eAAA,uBAAsB,GAAA,EAAY;AAAA,EAClC,IAAA;AAAA,EACA,eAAA;AAAA,EACA,WAAA;AAAA,EACA,KAAA;AAAA,EAEjB,WAAA,CACE,IAAA,EACA,eAAA,EACA,WAAA,GAA+B,oBAC/B,KAAA,GAAwB,EAAE,KAAA,EAAO,IAAI,gBAAe,EAAG,UAAA,EAAY,IAAI,aAAA,IAAgB,EACvF;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,eAAA,GAAkB,eAAA;AACvB,IAAA,IAAA,CAAK,WAAA,GAAc,WAAA;AACnB,IAAA,IAAA,CAAK,KAAA,GAAQ,KAAA;AAAA,EACf;AAAA,EAEA,QAAQ,OAAA,EAAyC;AAE/C,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,MAAA,CAAO,QAAA,CAAS,QAAQ,IAAI,CAAA;AACjD,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,eAAA,GAAkB,SAAA,CAAU,OAAO,CAAA,GAAI,IAAA;AAExD,IAAA,MAAM,UAAA,GAAa,QAAQ,IAAA,GAAO,OAAA,GAAU,KAAK,WAAA,CAAY,MAAA,CAAO,GAAA,EAAK,OAAA,EAAS,OAAO,CAAA;AACzF,IAAA,MAAM,QAAQ,GAAA,KAAQ,IAAA,GAAO,SAAY,IAAA,CAAK,cAAA,CAAe,IAAI,GAAG,CAAA;AACpE,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,MAAM,OAAO,IAAA,CAAK,KAAA,CAAM,MAAM,OAAA,CAAQ,UAAA,EAAY,QAAQ,IAAI,CAAA;AAE9D,IAAA,MAAM,QAAA,GAAW,QAAQ,MAAA,CAAO,MAAA,GAAS,IAAI,cAAA,CAAe,IAAA,EAAM,OAAO,CAAA,GAAI,IAAA;AAC7E,IAAA,IAAI,aAAa,IAAA,IAAQ,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,QAAQ,CAAA,EAAG;AACzD,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,aAAa,IAAA,EAAM;AACrB,MAAA,IAAA,CAAK,aAAA,CAAc,IAAI,QAAQ,CAAA;AAAA,IACjC;AACA,IAAA,MAAM,WAAA,GAAc,KAAK,cAAA,CAAe,eAAA,CAAgB,MAAM,OAAA,EAAS,IAAA,CAAK,MAAM,CAAC,CAAA;AACnF,IAAA,IAAI,gBAAgB,IAAA,EAAM;AACxB,MAAA,IAAA,CAAK,OAAO,WAAW,CAAA;AACvB,MAAA,IAAA,CAAK,IAAA,CAAK,IAAI,WAAW,CAAA;AAAA,IAC3B;AACA,IAAA,IAAI,QAAQ,IAAA,EAAM;AAChB,MAAA,IAAA,CAAK,cAAA,CAAe,GAAA,CAAI,GAAA,EAAK,IAAI,CAAA;AAAA,IACnC;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA,EAGQ,eAAe,WAAA,EAA0D;AAC/E,IAAA,MAAM,OAAA,GAAuC,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,YAAY,IAAI,CAAA;AACtF,IAAA,IAAI,YAAY,MAAA,EAAW;AACzB,MAAA,OAAO,WAAA;AAAA,IACT;AACA,IAAA,MAAM,MAAA,GAAS,sBAAA,CAAuB,WAAA,EAAa,OAAO,CAAA;AAE1D,IAAA,OAAO,MAAA,CAAO,QAAQ,MAAA,KAAW,CAAA,IAAK,YAAY,OAAA,CAAQ,MAAA,GAAS,IAAI,IAAA,GAAO,MAAA;AAAA,EAChF;AAAA;AAAA,EAGQ,OAAO,WAAA,EAAsC;AACnD,IAAA,MAAM,MAAA,GAAS,KAAK,eAAA,CAAgB,GAAA,CAAI,YAAY,IAAI,CAAA,wBAAS,GAAA,EAAI;AACrE,IAAA,MAAM,OAAA,GAAU,KAAK,aAAA,CAAc,GAAA,CAAI,YAAY,IAAI,CAAA,wBAAS,GAAA,EAAI;AACpE,IAAA,KAAA,MAAW,MAAA,IAAU,YAAY,OAAA,EAAS;AACxC,MAAA,MAAA,CAAO,GAAA,CAAI,MAAA,CAAO,IAAA,EAAM,MAAA,CAAO,KAAK,CAAA;AACpC,MAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,KAAK,CAAA,EAAG;AAC9B,QAAA,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,KAAA,EAAO,MAAA,CAAO,IAAI,CAAA;AAAA,MACvC;AAAA,IACF;AACA,IAAA,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,MAAM,CAAA;AACjD,IAAA,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,OAAO,CAAA;AAAA,EAClD;AAAA,EAEA,YAAY,IAAA,EAAoD;AAC9D,IAAA,OAAO,KAAK,aAAA,CAAc,GAAA,CAAI,IAAI,CAAA,wBAAS,GAAA,EAAI;AAAA,EACjD;AAAA,EAEA,cAAc,OAAA,EAAkC;AAC9C,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,SAAA,CAAU,QAAQ,IAAI,CAAA;AAEnD,IAAA,MAAM,QAAA,GAAW,KAAK,SAAA,CAAU,CAAC,UAAU,OAAA,CAAQ,IAAA,EAAM,OAAA,CAAQ,MAAM,CAAC,CAAA;AACxE,IAAA,IAAI,IAAA,CAAK,kBAAA,CAAmB,GAAA,CAAI,QAAQ,CAAA,EAAG;AACzC,MAAA;AAAA,IACF;AACA,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,kBAAA,CAAmB,QAAQ,CAAA;AAC7C,IAAA,IAAA,CAAK,kBAAA,CAAmB,GAAA,CAAI,QAAA,EAAU,IAAI,CAAA;AAC1C,IAAA,IAAA,CAAK,eAAA,CAAgB,IAAI,IAAI,CAAA;AAC7B,IAAA,IAAA,CAAK,OAAA,CAAQ,aAAa,qBAAqB,CAAA;AAC/C,IAAA,IAAA,CAAK,OAAA,CAAQ,aAAa,aAAa,CAAA;AACvC,IAAA,IAAA,CAAK,KAAK,GAAA,CAAI;AAAA,MACZ,IAAA,EAAM,YAAA;AAAA,MACN,IAAA;AAAA,MACA,UAAA,EAAY,IAAA;AAAA,MACZ,IAAA,EAAM,eAAA,CAAgB,OAAA,CAAQ,IAAI,CAAA;AAAA,MAClC,QAAQ,OAAA,CAAQ,MAAA;AAAA,MAChB,UAAU;AAAC,KACZ,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,mBAAmB,IAAA,EAAsB;AAC/C,IAAA,IAAI,SAAA,GAAY,IAAA;AAChB,IAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,IAAA,CAAK,gBAAgB,GAAA,CAAI,SAAS,GAAG,KAAA,EAAA,EAAS;AAChE,MAAA,SAAA,GAAY,CAAA,EAAG,IAAI,CAAA,EAAG,4BAA4B,GAAG,KAAK,CAAA,CAAA;AAAA,IAC5D;AACA,IAAA,OAAO,SAAA;AAAA,EACT;AAAA,EAEA,mBAAA,GAA4B;AAC1B,IAAA,IAAA,CAAK,OAAA,CAAQ,aAAa,YAAY,CAAA;AAAA,EACxC;AAAA,EAEA,qBAAA,GAA8B;AAC5B,IAAA,IAAA,CAAK,OAAA,CAAQ,aAAa,cAAc,CAAA;AAAA,EAC1C;AAAA,EAEA,aAAa,KAAA,EAAwC;AACnD,IAAA,IAAA,CAAK,IAAA,CAAK,aAAa,KAAK,CAAA;AAAA,EAC9B;AAAA,EAEA,aAAa,WAAA,EAA6B;AACxC,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,UAAA,CAAW,MAAA,CAAO,WAAW,CAAA;AAAA,EACjD;AAAA,EAEQ,QAAQ,MAAA,EAA0B;AACxC,IAAA,IAAI,CAAC,IAAA,CAAK,IAAA,CAAK,YAAA,CAAa,MAAA,CAAO,IAAI,CAAA,EAAG;AACxC,MAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,EAAE,IAAA,EAAM,gBAAA,EAAkB,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,CAAA;AAAA,IAChF;AAAA,EACF;AACF;AAEA,SAAS,gBAAgB,IAAA,EAAsB;AAC7C,EAAA,OAAO,YAAY,YAAA,CAAa,aAAA,CAAc,IAAA,EAAM,CAAC,IAAI,CAAC,CAAA;AAC5D;;"}

package/dist/application/transform/footer/enum-name-claims.cjs

@@ -0,0 +1,48 @@
+'use strict';
+
+const numberedNames = require('../numbered-names.cjs');
+
+class EnumNameClaims {
+  mayBeNeeded;
+  /** The first owner of each name an enum asked for. */
+  owners = /* @__PURE__ */ new Map();
+  /** The name given to each owner, by name asked for and owner. */
+  given = /* @__PURE__ */ new Map();
+  /** Every name given, and every name the output may need. */
+  taken;
+  /** A numbered name given only because the output may need the name asked for: that name. */
+  standIns = /* @__PURE__ */ new Map();
+  /** `mayBeNeeded`: the names an enum avoids until the end of the run; empty outside a run. */
+  constructor(mayBeNeeded = /* @__PURE__ */ new Set()) {
+    this.mayBeNeeded = mayBeNeeded;
+    this.taken = new Set(mayBeNeeded);
+  }
+  /** The declaration name of the enum `owner` asks to name `name`; the same for every request. */
+  nameFor(name, owner) {
+    const key = JSON.stringify([name, owner]);
+    const known = this.given.get(key);
+    if (known !== void 0) {
+      return known;
+    }
+    const isFirstOwner = (this.owners.get(name) ?? owner) === owner;
+    this.owners.set(name, this.owners.get(name) ?? owner);
+    const isFree = isFirstOwner && !this.taken.has(name);
+    const declared = isFree ? name : numberedNames.freeNumberedName(name, this.taken);
+    if (isFirstOwner && this.mayBeNeeded.has(name)) {
+      this.standIns.set(declared, name);
+    }
+    this.taken.add(declared);
+    this.given.set(key, declared);
+    return declared;
+  }
+  /**
+   * The numbered names to rename back to the name asked for, because `needed` (the names the
+   * finished output declares or refers to) does not hold that name.
+   */
+  givenBack(needed) {
+    return new Map([...this.standIns].filter(([, name]) => !needed.has(name)));
+  }
+}
+
+exports.EnumNameClaims = EnumNameClaims;
+//# sourceMappingURL=enum-name-claims.cjs.map

package/dist/application/transform/footer/enum-name-claims.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"enum-name-claims.cjs","sources":["../../../../src/application/transform/footer/enum-name-claims.ts"],"sourcesContent":["import { freeNumberedName } from \"../numbered-names.js\";\n\n/**\n * The names of the `--enum` declarations of one run, unique across the enums and apart from the\n * names the rest of the output may need.\n *\n * Every enum has an owner: the schema location it is named after, or with `--dedupe-enums` its\n * members. Two owners whose names come out the same (`status` and `Status`) merged into one enum\n * before, so each accepted the values of the other (upstream behavior). Now the first owner keeps\n * the name and each later one gets the next free `Name_2`, `Name_3`, …; requests of one owner (a\n * property and an inline `allOf` item of one schema) still share one enum.\n *\n * An enum also gives way to a name the output may need, which is only known at the end: a global\n * type the output refers to (the `Blob` of `--binary-as-blob`, the `Record` of\n * `Record<string, never>`), a helper type, or `ApiPaths`. Until then it takes the numbered name;\n * `givenBack` lists the ones whose own name the output turned out not to need, so output that\n * compiled before keeps its names (ADR-021).\n */\nexport class EnumNameClaims {\n  private readonly mayBeNeeded: ReadonlySet<string>;\n  /** The first owner of each name an enum asked for. */\n  private readonly owners = new Map<string, string>();\n  /** The name given to each owner, by name asked for and owner. */\n  private readonly given = new Map<string, string>();\n  /** Every name given, and every name the output may need. */\n  private readonly taken: Set<string>;\n  /** A numbered name given only because the output may need the name asked for: that name. */\n  private readonly standIns = new Map<string, string>();\n\n  /** `mayBeNeeded`: the names an enum avoids until the end of the run; empty outside a run. */\n  constructor(mayBeNeeded: ReadonlySet<string> = new Set()) {\n    this.mayBeNeeded = mayBeNeeded;\n    this.taken = new Set(mayBeNeeded);\n  }\n\n  /** The declaration name of the enum `owner` asks to name `name`; the same for every request. */\n  nameFor(name: string, owner: string): string {\n    const key = JSON.stringify([name, owner]);\n    const known = this.given.get(key);\n    if (known !== undefined) {\n      return known;\n    }\n    const isFirstOwner = (this.owners.get(name) ?? owner) === owner;\n    this.owners.set(name, this.owners.get(name) ?? owner);\n    const isFree = isFirstOwner && !this.taken.has(name);\n    const declared = isFree ? name : freeNumberedName(name, this.taken);\n    if (isFirstOwner && this.mayBeNeeded.has(name)) {\n      this.standIns.set(declared, name);\n    }\n    this.taken.add(declared);\n    this.given.set(key, declared);\n    return declared;\n  }\n\n  /**\n   * The numbered names to rename back to the name asked for, because `needed` (the names the\n   * finished output declares or refers to) does not hold that name.\n   */\n  givenBack(needed: ReadonlySet<string>): ReadonlyMap<string, string> {\n    return new Map([...this.standIns].filter(([, name]) => !needed.has(name)));\n  }\n}\n"],"names":["freeNumberedName"],"mappings":";;;;AAkBO,MAAM,cAAA,CAAe;AAAA,EACT,WAAA;AAAA;AAAA,EAEA,MAAA,uBAAa,GAAA,EAAoB;AAAA;AAAA,EAEjC,KAAA,uBAAY,GAAA,EAAoB;AAAA;AAAA,EAEhC,KAAA;AAAA;AAAA,EAEA,QAAA,uBAAe,GAAA,EAAoB;AAAA;AAAA,EAGpD,WAAA,CAAY,WAAA,mBAAmC,IAAI,GAAA,EAAI,EAAG;AACxD,IAAA,IAAA,CAAK,WAAA,GAAc,WAAA;AACnB,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAI,GAAA,CAAI,WAAW,CAAA;AAAA,EAClC;AAAA;AAAA,EAGA,OAAA,CAAQ,MAAc,KAAA,EAAuB;AAC3C,IAAA,MAAM,MAAM,IAAA,CAAK,SAAA,CAAU,CAAC,IAAA,EAAM,KAAK,CAAC,CAAA;AACxC,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AAChC,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,MAAM,gBAAgB,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,IAAI,KAAK,KAAA,MAAW,KAAA;AAC1D,IAAA,IAAA,CAAK,MAAA,CAAO,IAAI,IAAA,EAAM,IAAA,CAAK,OAAO,GAAA,CAAI,IAAI,KAAK,KAAK,CAAA;AACpD,IAAA,MAAM,SAAS,YAAA,IAAgB,CAAC,IAAA,CAAK,KAAA,CAAM,IAAI,IAAI,CAAA;AACnD,IAAA,MAAM,WAAW,MAAA,GAAS,IAAA,GAAOA,8BAAA,CAAiB,IAAA,EAAM,KAAK,KAAK,CAAA;AAClE,IAAA,IAAI,YAAA,IAAgB,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,IAAI,CAAA,EAAG;AAC9C,MAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,QAAA,EAAU,IAAI,CAAA;AAAA,IAClC;AACA,IAAA,IAAA,CAAK,KAAA,CAAM,IAAI,QAAQ,CAAA;AACvB,IAAA,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,QAAQ,CAAA;AAC5B,IAAA,OAAO,QAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAU,MAAA,EAA0D;AAClE,IAAA,OAAO,IAAI,GAAA,CAAI,CAAC,GAAG,IAAA,CAAK,QAAQ,EAAE,MAAA,CAAO,CAAC,GAAG,IAAI,CAAA,KAAM,CAAC,OAAO,GAAA,CAAI,IAAI,CAAC,CAAC,CAAA;AAAA,EAC3E;AACF;;"}

package/dist/application/transform/footer/enum-name-claims.mjs

@@ -0,0 +1,46 @@
+import { freeNumberedName } from '../numbered-names.mjs';
+
+class EnumNameClaims {
+  mayBeNeeded;
+  /** The first owner of each name an enum asked for. */
+  owners = /* @__PURE__ */ new Map();
+  /** The name given to each owner, by name asked for and owner. */
+  given = /* @__PURE__ */ new Map();
+  /** Every name given, and every name the output may need. */
+  taken;
+  /** A numbered name given only because the output may need the name asked for: that name. */
+  standIns = /* @__PURE__ */ new Map();
+  /** `mayBeNeeded`: the names an enum avoids until the end of the run; empty outside a run. */
+  constructor(mayBeNeeded = /* @__PURE__ */ new Set()) {
+    this.mayBeNeeded = mayBeNeeded;
+    this.taken = new Set(mayBeNeeded);
+  }
+  /** The declaration name of the enum `owner` asks to name `name`; the same for every request. */
+  nameFor(name, owner) {
+    const key = JSON.stringify([name, owner]);
+    const known = this.given.get(key);
+    if (known !== void 0) {
+      return known;
+    }
+    const isFirstOwner = (this.owners.get(name) ?? owner) === owner;
+    this.owners.set(name, this.owners.get(name) ?? owner);
+    const isFree = isFirstOwner && !this.taken.has(name);
+    const declared = isFree ? name : freeNumberedName(name, this.taken);
+    if (isFirstOwner && this.mayBeNeeded.has(name)) {
+      this.standIns.set(declared, name);
+    }
+    this.taken.add(declared);
+    this.given.set(key, declared);
+    return declared;
+  }
+  /**
+   * The numbered names to rename back to the name asked for, because `needed` (the names the
+   * finished output declares or refers to) does not hold that name.
+   */
+  givenBack(needed) {
+    return new Map([...this.standIns].filter(([, name]) => !needed.has(name)));
+  }
+}
+
+export { EnumNameClaims };
+//# sourceMappingURL=enum-name-claims.mjs.map

package/dist/application/transform/footer/enum-name-claims.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"enum-name-claims.mjs","sources":["../../../../src/application/transform/footer/enum-name-claims.ts"],"sourcesContent":["import { freeNumberedName } from \"../numbered-names.js\";\n\n/**\n * The names of the `--enum` declarations of one run, unique across the enums and apart from the\n * names the rest of the output may need.\n *\n * Every enum has an owner: the schema location it is named after, or with `--dedupe-enums` its\n * members. Two owners whose names come out the same (`status` and `Status`) merged into one enum\n * before, so each accepted the values of the other (upstream behavior). Now the first owner keeps\n * the name and each later one gets the next free `Name_2`, `Name_3`, …; requests of one owner (a\n * property and an inline `allOf` item of one schema) still share one enum.\n *\n * An enum also gives way to a name the output may need, which is only known at the end: a global\n * type the output refers to (the `Blob` of `--binary-as-blob`, the `Record` of\n * `Record<string, never>`), a helper type, or `ApiPaths`. Until then it takes the numbered name;\n * `givenBack` lists the ones whose own name the output turned out not to need, so output that\n * compiled before keeps its names (ADR-021).\n */\nexport class EnumNameClaims {\n  private readonly mayBeNeeded: ReadonlySet<string>;\n  /** The first owner of each name an enum asked for. */\n  private readonly owners = new Map<string, string>();\n  /** The name given to each owner, by name asked for and owner. */\n  private readonly given = new Map<string, string>();\n  /** Every name given, and every name the output may need. */\n  private readonly taken: Set<string>;\n  /** A numbered name given only because the output may need the name asked for: that name. */\n  private readonly standIns = new Map<string, string>();\n\n  /** `mayBeNeeded`: the names an enum avoids until the end of the run; empty outside a run. */\n  constructor(mayBeNeeded: ReadonlySet<string> = new Set()) {\n    this.mayBeNeeded = mayBeNeeded;\n    this.taken = new Set(mayBeNeeded);\n  }\n\n  /** The declaration name of the enum `owner` asks to name `name`; the same for every request. */\n  nameFor(name: string, owner: string): string {\n    const key = JSON.stringify([name, owner]);\n    const known = this.given.get(key);\n    if (known !== undefined) {\n      return known;\n    }\n    const isFirstOwner = (this.owners.get(name) ?? owner) === owner;\n    this.owners.set(name, this.owners.get(name) ?? owner);\n    const isFree = isFirstOwner && !this.taken.has(name);\n    const declared = isFree ? name : freeNumberedName(name, this.taken);\n    if (isFirstOwner && this.mayBeNeeded.has(name)) {\n      this.standIns.set(declared, name);\n    }\n    this.taken.add(declared);\n    this.given.set(key, declared);\n    return declared;\n  }\n\n  /**\n   * The numbered names to rename back to the name asked for, because `needed` (the names the\n   * finished output declares or refers to) does not hold that name.\n   */\n  givenBack(needed: ReadonlySet<string>): ReadonlyMap<string, string> {\n    return new Map([...this.standIns].filter(([, name]) => !needed.has(name)));\n  }\n}\n"],"names":[],"mappings":";;AAkBO,MAAM,cAAA,CAAe;AAAA,EACT,WAAA;AAAA;AAAA,EAEA,MAAA,uBAAa,GAAA,EAAoB;AAAA;AAAA,EAEjC,KAAA,uBAAY,GAAA,EAAoB;AAAA;AAAA,EAEhC,KAAA;AAAA;AAAA,EAEA,QAAA,uBAAe,GAAA,EAAoB;AAAA;AAAA,EAGpD,WAAA,CAAY,WAAA,mBAAmC,IAAI,GAAA,EAAI,EAAG;AACxD,IAAA,IAAA,CAAK,WAAA,GAAc,WAAA;AACnB,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAI,GAAA,CAAI,WAAW,CAAA;AAAA,EAClC;AAAA;AAAA,EAGA,OAAA,CAAQ,MAAc,KAAA,EAAuB;AAC3C,IAAA,MAAM,MAAM,IAAA,CAAK,SAAA,CAAU,CAAC,IAAA,EAAM,KAAK,CAAC,CAAA;AACxC,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AAChC,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,MAAM,gBAAgB,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,IAAI,KAAK,KAAA,MAAW,KAAA;AAC1D,IAAA,IAAA,CAAK,MAAA,CAAO,IAAI,IAAA,EAAM,IAAA,CAAK,OAAO,GAAA,CAAI,IAAI,KAAK,KAAK,CAAA;AACpD,IAAA,MAAM,SAAS,YAAA,IAAgB,CAAC,IAAA,CAAK,KAAA,CAAM,IAAI,IAAI,CAAA;AACnD,IAAA,MAAM,WAAW,MAAA,GAAS,IAAA,GAAO,gBAAA,CAAiB,IAAA,EAAM,KAAK,KAAK,CAAA;AAClE,IAAA,IAAI,YAAA,IAAgB,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,IAAI,CAAA,EAAG;AAC9C,MAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,QAAA,EAAU,IAAI,CAAA;AAAA,IAClC;AACA,IAAA,IAAA,CAAK,KAAA,CAAM,IAAI,QAAQ,CAAA;AACvB,IAAA,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,QAAQ,CAAA;AAC5B,IAAA,OAAO,QAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAU,MAAA,EAA0D;AAClE,IAAA,OAAO,IAAI,GAAA,CAAI,CAAC,GAAG,IAAA,CAAK,QAAQ,EAAE,MAAA,CAAO,CAAC,GAAG,IAAI,CAAA,KAAM,CAAC,OAAO,GAAA,CAAI,IAAI,CAAC,CAAC,CAAA;AAAA,EAC3E;AACF;;"}

package/dist/application/transform/footer/operation-keys.cjs

@@ -0,0 +1,23 @@
+'use strict';
+
+class OperationKeys {
+  written;
+  taken = /* @__PURE__ */ new Set();
+  /** `written`: every operation key of the document; empty outside a document run. */
+  constructor(written = /* @__PURE__ */ new Set()) {
+    this.written = written;
+  }
+  /** The key of the next operation with this key, written or numbered. */
+  keyFor(key) {
+    let unique = key;
+    for (let count = 2; this.taken.has(unique); count += 1) {
+      const candidate = `${key}${count}`;
+      unique = this.written.has(candidate) ? unique : candidate;
+    }
+    this.taken.add(unique);
+    return unique;
+  }
+}
+
+exports.OperationKeys = OperationKeys;
+//# sourceMappingURL=operation-keys.cjs.map

package/dist/application/transform/footer/operation-keys.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"operation-keys.cjs","sources":["../../../../src/application/transform/footer/operation-keys.ts"],"sourcesContent":["/**\n * The keys of the `operations` interface in one run. A repeated `operationId` (Redocly warns\n * about it) gave the interface two members of one name, which did not compile (TS2300). Now the\n * first operation with an ID keeps it, and each later one gets the lowest number from 2 whose key\n * no operation of the document has: the second `listItems` is `listItems2`, the name\n * `--make-paths-enum` gives it in `ApiPaths` too. Keys follow the order the operations are\n * transformed in, which is the document order (or the `--alphabetize` order).\n */\nexport class OperationKeys {\n  private readonly written: ReadonlySet<string>;\n  private readonly taken = new Set<string>();\n\n  /** `written`: every operation key of the document; empty outside a document run. */\n  constructor(written: ReadonlySet<string> = new Set()) {\n    this.written = written;\n  }\n\n  /** The key of the next operation with this key, written or numbered. */\n  keyFor(key: string): string {\n    let unique = key;\n    for (let count = 2; this.taken.has(unique); count += 1) {\n      const candidate = `${key}${count}`;\n      unique = this.written.has(candidate) ? unique : candidate;\n    }\n    this.taken.add(unique);\n    return unique;\n  }\n}\n"],"names":[],"mappings":";;AAQO,MAAM,aAAA,CAAc;AAAA,EACR,OAAA;AAAA,EACA,KAAA,uBAAY,GAAA,EAAY;AAAA;AAAA,EAGzC,WAAA,CAAY,OAAA,mBAA+B,IAAI,GAAA,EAAI,EAAG;AACpD,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AAAA,EACjB;AAAA;AAAA,EAGA,OAAO,GAAA,EAAqB;AAC1B,IAAA,IAAI,MAAA,GAAS,GAAA;AACb,IAAA,KAAA,IAAS,KAAA,GAAQ,GAAG,IAAA,CAAK,KAAA,CAAM,IAAI,MAAM,CAAA,EAAG,SAAS,CAAA,EAAG;AACtD,MAAA,MAAM,SAAA,GAAY,CAAA,EAAG,GAAG,CAAA,EAAG,KAAK,CAAA,CAAA;AAChC,MAAA,MAAA,GAAS,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,SAAS,IAAI,MAAA,GAAS,SAAA;AAAA,IAClD;AACA,IAAA,IAAA,CAAK,KAAA,CAAM,IAAI,MAAM,CAAA;AACrB,IAAA,OAAO,MAAA;AAAA,EACT;AACF;;"}

package/dist/application/transform/footer/operation-keys.mjs

@@ -0,0 +1,21 @@
+class OperationKeys {
+  written;
+  taken = /* @__PURE__ */ new Set();
+  /** `written`: every operation key of the document; empty outside a document run. */
+  constructor(written = /* @__PURE__ */ new Set()) {
+    this.written = written;
+  }
+  /** The key of the next operation with this key, written or numbered. */
+  keyFor(key) {
+    let unique = key;
+    for (let count = 2; this.taken.has(unique); count += 1) {
+      const candidate = `${key}${count}`;
+      unique = this.written.has(candidate) ? unique : candidate;
+    }
+    this.taken.add(unique);
+    return unique;
+  }
+}
+
+export { OperationKeys };
+//# sourceMappingURL=operation-keys.mjs.map

package/dist/application/transform/footer/operation-keys.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"operation-keys.mjs","sources":["../../../../src/application/transform/footer/operation-keys.ts"],"sourcesContent":["/**\n * The keys of the `operations` interface in one run. A repeated `operationId` (Redocly warns\n * about it) gave the interface two members of one name, which did not compile (TS2300). Now the\n * first operation with an ID keeps it, and each later one gets the lowest number from 2 whose key\n * no operation of the document has: the second `listItems` is `listItems2`, the name\n * `--make-paths-enum` gives it in `ApiPaths` too. Keys follow the order the operations are\n * transformed in, which is the document order (or the `--alphabetize` order).\n */\nexport class OperationKeys {\n  private readonly written: ReadonlySet<string>;\n  private readonly taken = new Set<string>();\n\n  /** `written`: every operation key of the document; empty outside a document run. */\n  constructor(written: ReadonlySet<string> = new Set()) {\n    this.written = written;\n  }\n\n  /** The key of the next operation with this key, written or numbered. */\n  keyFor(key: string): string {\n    let unique = key;\n    for (let count = 2; this.taken.has(unique); count += 1) {\n      const candidate = `${key}${count}`;\n      unique = this.written.has(candidate) ? unique : candidate;\n    }\n    this.taken.add(unique);\n    return unique;\n  }\n}\n"],"names":[],"mappings":"AAQO,MAAM,aAAA,CAAc;AAAA,EACR,OAAA;AAAA,EACA,KAAA,uBAAY,GAAA,EAAY;AAAA;AAAA,EAGzC,WAAA,CAAY,OAAA,mBAA+B,IAAI,GAAA,EAAI,EAAG;AACpD,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AAAA,EACjB;AAAA;AAAA,EAGA,OAAO,GAAA,EAAqB;AAC1B,IAAA,IAAI,MAAA,GAAS,GAAA;AACb,IAAA,KAAA,IAAS,KAAA,GAAQ,GAAG,IAAA,CAAK,KAAA,CAAM,IAAI,MAAM,CAAA,EAAG,SAAS,CAAA,EAAG;AACtD,MAAA,MAAM,SAAA,GAAY,CAAA,EAAG,GAAG,CAAA,EAAG,KAAK,CAAA,CAAA;AAChC,MAAA,MAAA,GAAS,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,SAAS,IAAI,MAAA,GAAS,SAAA;AAAA,IAClD;AACA,IAAA,IAAA,CAAK,KAAA,CAAM,IAAI,MAAM,CAAA;AACrB,IAAA,OAAO,MAAA;AAAA,EACT;AACF;;"}

package/dist/application/transform/footer/type-evaluation.cjs

@@ -5,7 +5,7 @@ const typeIndexing = require('./type-indexing.cjs');
 const typeRules = require('./type-rules.cjs');
 
 const MAX_EXPANSIONS = 200;
-const DEEP_PREFIX = "FlattenedDeepRequired<";
+const DEEP_HELPER = "FlattenedDeepRequired";
 const MAX_DISTRIBUTED = 64;
 class TypeEvaluator {
   declared = /* @__PURE__ */ new Map();
@@ -49,15 +49,15 @@ class TypeEvaluator {
     if (this.expansions++ > MAX_EXPANSIONS) {
       return evaluation.OPAQUE;
     }
-    if (name.startsWith(DEEP_PREFIX) && name.endsWith(">")) {
-      const root = this.declared.get(name.slice(DEEP_PREFIX.length, -1));
+    const [first, second] = args;
+    if (name === DEEP_HELPER && first?.kind === "reference" && first.typeArguments.length === 0) {
+      const root = this.declared.get(first.name);
       return root === void 0 ? evaluation.OPAQUE : this.expand({ kind: "type", type: root, deep: true });
     }
     const declared = args.length === 0 ? this.declared.get(name) : void 0;
     if (declared !== void 0) {
       return this.expand({ ...value, type: declared });
     }
-    const [first, second] = args;
     if (first === void 0) {
       return evaluation.OPAQUE;
     }

package/dist/application/transform/footer/type-evaluation.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"type-evaluation.cjs","sources":["../../../../src/application/transform/footer/type-evaluation.ts"],"sourcesContent":["import type { IrDeclaration, IrType } from \"../../../domain/ir/nodes.js\";\nimport {\n  absorbed,\n  type Evaluated,\n  type Evaluation,\n  intersectionType,\n  isNullish,\n  OPAQUE,\n  propertyKey,\n  unionType,\n} from \"./evaluation.js\";\nimport { indexType } from \"./type-indexing.js\";\nimport { extracted, markerObject, omitted } from \"./type-rules.js\";\n\n/**\n * A small evaluator of the generated types, as TypeScript reads them, for the `--enum-values`\n * check (ADR-027). It follows the declarations of the document and the helper types the generator\n * writes (`NonNullable`, `Extract`, `WithRequired`, `Omit`, `Record`, `FlattenedDeepRequired`). Its\n * answers are sure: a key is `missing` only where TypeScript reports it, and every type it does\n * not model is `opaque`, which never counts as an error.\n */\n\n/** How many references one evaluation expands; a deeper one is opaque. */\nconst MAX_EXPANSIONS = 200;\nconst DEEP_PREFIX = \"FlattenedDeepRequired<\";\n/** How many members distributing an intersection may give; more is opaque. */\nconst MAX_DISTRIBUTED = 64;\n\nexport class TypeEvaluator {\n  private readonly declared = new Map<string, IrType>();\n  private expansions = 0;\n\n  constructor(declarations: readonly IrDeclaration[]) {\n    for (const declaration of declarations) {\n      if (declaration.kind === \"interface\") {\n        this.declared.set(declaration.name, { kind: \"object\", members: declaration.members });\n      } else if (declaration.kind === \"typeAlias\") {\n        this.declared.set(declaration.name, declaration.type);\n      }\n    }\n  }\n\n  /** Evaluate a type written in the footer; the expansion budget starts again. */\n  evaluate(type: IrType): Evaluation {\n    this.expansions = 0;\n    return this.expand({ kind: \"type\", type, deep: false });\n  }\n\n  /** The type with references, `readonly` and indexed access resolved at the top. */\n  expand(value: Evaluated): Evaluation {\n    const { type } = value;\n    switch (type.kind) {\n      case \"readonly\":\n        return this.expand({ ...value, type: type.type });\n      case \"indexedAccess\":\n        return this.indexedAccess(value, type.object, type.index);\n      case \"reference\":\n        return this.reference(value, type.name, type.typeArguments);\n      case \"raw\":\n      case \"tuple\":\n        return OPAQUE;\n      default:\n        return value;\n    }\n  }\n\n  private indexedAccess(value: Evaluated, object: IrType, index: IrType): Evaluation {\n    const owner = this.expand({ ...value, type: object });\n    return owner.kind === \"type\" ? this.index(owner, index) : owner;\n  }\n\n  private reference(value: Evaluated, name: string, args: readonly IrType[]): Evaluation {\n    // Only references cost budget: re-expanding an already expanded value (as the checks after\n    // `evaluate` do) is free, so a large evaluation does not leave its checks opaque.\n    if (this.expansions++ > MAX_EXPANSIONS) {\n      return OPAQUE;\n    }\n    if (name.startsWith(DEEP_PREFIX) && name.endsWith(\">\")) {\n      const root = this.declared.get(name.slice(DEEP_PREFIX.length, -1));\n      return root === undefined ? OPAQUE : this.expand({ kind: \"type\", type: root, deep: true });\n    }\n    const declared = args.length === 0 ? this.declared.get(name) : undefined;\n    if (declared !== undefined) {\n      return this.expand({ ...value, type: declared });\n    }\n    const [first, second] = args;\n    if (first === undefined) {\n      return OPAQUE;\n    }\n    const argument = this.expand({ ...value, type: first });\n    if (argument.kind !== \"type\") {\n      return argument;\n    }\n    return this.helper(name, argument, second);\n  }\n\n  private helper(name: string, argument: Evaluated, second: IrType | undefined): Evaluation {\n    switch (name) {\n      case \"NonNullable\":\n        return this.withoutNullish(argument);\n      case \"WithRequired\":\n      case \"Readonly\":\n        return argument;\n      case \"Extract\":\n        return second === undefined ? OPAQUE : this.extract(argument, second);\n      case \"Omit\":\n        return second === undefined ? OPAQUE : omitted(this, argument, second);\n      default:\n        return markerObject(name, argument) ?? OPAQUE;\n    }\n  }\n\n  /**\n   * The members of a union, each expanded; an intersection with unions in it is distributed over\n   * them (`A & (B | C)` is `(A & B) | (A & C)`), as TypeScript normalizes it. A type that is not a\n   * union is its only member. A union with an `any` or `unknown` member is that keyword alone.\n   */\n  membersOf(value: Evaluated): readonly Evaluation[] {\n    const expanded = this.expand(value);\n    if (expanded.kind !== \"type\") {\n      return [expanded];\n    }\n    const { type } = expanded;\n    if (type.kind === \"union\") {\n      return absorbed(\n        type.types.flatMap((member) => this.membersOf({ ...expanded, type: member })),\n      );\n    }\n    return type.kind === \"intersection\" ? this.distributed(expanded, type.types) : [expanded];\n  }\n\n  private distributed(value: Evaluated, parts: readonly IrType[]): readonly Evaluation[] {\n    const memberLists = parts.map((part) => this.membersOf({ ...value, type: part }));\n    const size = memberLists.reduce((product, list) => product * list.length, 1);\n    if (size > MAX_DISTRIBUTED || memberLists.some((list) => list.some((m) => m.kind !== \"type\"))) {\n      return [OPAQUE];\n    }\n    let combinations: IrType[][] = [[]];\n    for (const list of memberLists as Evaluated[][]) {\n      combinations = combinations.flatMap((done) => list.map((member) => [...done, member.type]));\n    }\n    return combinations.map((types) => ({ ...value, type: intersectionType(types) }));\n  }\n\n  private withoutNullish(value: Evaluated): Evaluation {\n    const members = this.membersOf(value);\n    if (members.some((member) => member.kind !== \"type\")) {\n      return OPAQUE;\n    }\n    const kept = (members as Evaluated[]).filter((member) => !isNullish(member.type));\n    return { ...value, type: unionType(kept.map((member) => member.type)) };\n  }\n\n  /** `Extract<T, { key: unknown }>` keeps the members that have `key`; other probes are opaque. */\n  private extract(value: Evaluated, probe: IrType): Evaluation {\n    const [member] = probe.kind === \"object\" ? probe.members : [];\n    if (probe.kind !== \"object\" || probe.members.length !== 1 || member?.kind !== \"property\") {\n      return OPAQUE;\n    }\n    return extracted(this, value, propertyKey(member.name));\n  }\n\n  /** `value[index]` for a string literal, `string` or `number` index. */\n  index(value: Evaluated, index: IrType): Evaluation {\n    return indexType(this, value, index);\n  }\n}\n"],"names":["OPAQUE","omitted","markerObject","absorbed","intersectionType","isNullish","unionType","extracted","propertyKey","indexType"],"mappings":";;;;;;AAuBA,MAAM,cAAA,GAAiB,GAAA;AACvB,MAAM,WAAA,GAAc,wBAAA;AAEpB,MAAM,eAAA,GAAkB,EAAA;AAEjB,MAAM,aAAA,CAAc;AAAA,EACR,QAAA,uBAAe,GAAA,EAAoB;AAAA,EAC5C,UAAA,GAAa,CAAA;AAAA,EAErB,YAAY,YAAA,EAAwC;AAClD,IAAA,KAAA,MAAW,eAAe,YAAA,EAAc;AACtC,MAAA,IAAI,WAAA,CAAY,SAAS,WAAA,EAAa;AACpC,QAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,EAAE,MAAM,QAAA,EAAU,OAAA,EAAS,WAAA,CAAY,OAAA,EAAS,CAAA;AAAA,MACtF,CAAA,MAAA,IAAW,WAAA,CAAY,IAAA,KAAS,WAAA,EAAa;AAC3C,QAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,YAAY,IAAI,CAAA;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,SAAS,IAAA,EAA0B;AACjC,IAAA,IAAA,CAAK,UAAA,GAAa,CAAA;AAClB,IAAA,OAAO,IAAA,CAAK,OAAO,EAAE,IAAA,EAAM,QAAQ,IAAA,EAAM,IAAA,EAAM,OAAO,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,OAAO,KAAA,EAA8B;AACnC,IAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,IAAA,QAAQ,KAAK,IAAA;AAAM,MACjB,KAAK,UAAA;AACH,QAAA,OAAO,IAAA,CAAK,OAAO,EAAE,GAAG,OAAO,IAAA,EAAM,IAAA,CAAK,MAAM,CAAA;AAAA,MAClD,KAAK,eAAA;AACH,QAAA,OAAO,KAAK,aAAA,CAAc,KAAA,EAAO,IAAA,CAAK,MAAA,EAAQ,KAAK,KAAK,CAAA;AAAA,MAC1D,KAAK,WAAA;AACH,QAAA,OAAO,KAAK,SAAA,CAAU,KAAA,EAAO,IAAA,CAAK,IAAA,EAAM,KAAK,aAAa,CAAA;AAAA,MAC5D,KAAK,KAAA;AAAA,MACL,KAAK,OAAA;AACH,QAAA,OAAOA,iBAAA;AAAA,MACT;AACE,QAAA,OAAO,KAAA;AAAA;AACX,EACF;AAAA,EAEQ,aAAA,CAAc,KAAA,EAAkB,MAAA,EAAgB,KAAA,EAA2B;AACjF,IAAA,MAAM,KAAA,GAAQ,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,QAAQ,CAAA;AACpD,IAAA,OAAO,MAAM,IAAA,KAAS,MAAA,GAAS,KAAK,KAAA,CAAM,KAAA,EAAO,KAAK,CAAA,GAAI,KAAA;AAAA,EAC5D;AAAA,EAEQ,SAAA,CAAU,KAAA,EAAkB,IAAA,EAAc,IAAA,EAAqC;AAGrF,IAAA,IAAI,IAAA,CAAK,eAAe,cAAA,EAAgB;AACtC,MAAA,OAAOA,iBAAA;AAAA,IACT;AACA,IAAA,IAAI,KAAK,UAAA,CAAW,WAAW,KAAK,IAAA,CAAK,QAAA,CAAS,GAAG,CAAA,EAAG;AACtD,MAAA,MAAM,IAAA,GAAO,KAAK,QAAA,CAAS,GAAA,CAAI,KAAK,KAAA,CAAM,WAAA,CAAY,MAAA,EAAQ,EAAE,CAAC,CAAA;AACjE,MAAA,OAAO,IAAA,KAAS,MAAA,GAAYA,iBAAA,GAAS,IAAA,CAAK,MAAA,CAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,CAAA;AAAA,IAC3F;AACA,IAAA,MAAM,QAAA,GAAW,KAAK,MAAA,KAAW,CAAA,GAAI,KAAK,QAAA,CAAS,GAAA,CAAI,IAAI,CAAA,GAAI,MAAA;AAC/D,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,OAAO,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,UAAU,CAAA;AAAA,IACjD;AACA,IAAA,MAAM,CAAC,KAAA,EAAO,MAAM,CAAA,GAAI,IAAA;AACxB,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAOA,iBAAA;AAAA,IACT;AACA,IAAA,MAAM,QAAA,GAAW,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,OAAO,CAAA;AACtD,IAAA,IAAI,QAAA,CAAS,SAAS,MAAA,EAAQ;AAC5B,MAAA,OAAO,QAAA;AAAA,IACT;AACA,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,EAAM,QAAA,EAAU,MAAM,CAAA;AAAA,EAC3C;AAAA,EAEQ,MAAA,CAAO,IAAA,EAAc,QAAA,EAAqB,MAAA,EAAwC;AACxF,IAAA,QAAQ,IAAA;AAAM,MACZ,KAAK,aAAA;AACH,QAAA,OAAO,IAAA,CAAK,eAAe,QAAQ,CAAA;AAAA,MACrC,KAAK,cAAA;AAAA,MACL,KAAK,UAAA;AACH,QAAA,OAAO,QAAA;AAAA,MACT,KAAK,SAAA;AACH,QAAA,OAAO,WAAW,MAAA,GAAYA,iBAAA,GAAS,IAAA,CAAK,OAAA,CAAQ,UAAU,MAAM,CAAA;AAAA,MACtE,KAAK,MAAA;AACH,QAAA,OAAO,WAAW,MAAA,GAAYA,iBAAA,GAASC,iBAAA,CAAQ,IAAA,EAAM,UAAU,MAAM,CAAA;AAAA,MACvE;AACE,QAAA,OAAOC,sBAAA,CAAa,IAAA,EAAM,QAAQ,CAAA,IAAKF,iBAAA;AAAA;AAC3C,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU,KAAA,EAAyC;AACjD,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAClC,IAAA,IAAI,QAAA,CAAS,SAAS,MAAA,EAAQ;AAC5B,MAAA,OAAO,CAAC,QAAQ,CAAA;AAAA,IAClB;AACA,IAAA,MAAM,EAAE,MAAK,GAAI,QAAA;AACjB,IAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AACzB,MAAA,OAAOG,mBAAA;AAAA,QACL,IAAA,CAAK,KAAA,CAAM,OAAA,CAAQ,CAAC,MAAA,KAAW,IAAA,CAAK,SAAA,CAAU,EAAE,GAAG,QAAA,EAAU,IAAA,EAAM,MAAA,EAAQ,CAAC;AAAA,OAC9E;AAAA,IACF;AACA,IAAA,OAAO,IAAA,CAAK,IAAA,KAAS,cAAA,GAAiB,IAAA,CAAK,WAAA,CAAY,UAAU,IAAA,CAAK,KAAK,CAAA,GAAI,CAAC,QAAQ,CAAA;AAAA,EAC1F;AAAA,EAEQ,WAAA,CAAY,OAAkB,KAAA,EAAiD;AACrF,IAAA,MAAM,WAAA,GAAc,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,SAAA,CAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,IAAA,EAAM,CAAC,CAAA;AAChF,IAAA,MAAM,IAAA,GAAO,YAAY,MAAA,CAAO,CAAC,SAAS,IAAA,KAAS,OAAA,GAAU,IAAA,CAAK,MAAA,EAAQ,CAAC,CAAA;AAC3E,IAAA,IAAI,IAAA,GAAO,eAAA,IAAmB,WAAA,CAAY,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAM,CAAC,CAAA,EAAG;AAC7F,MAAA,OAAO,CAACH,iBAAM,CAAA;AAAA,IAChB;AACA,IAAA,IAAI,YAAA,GAA2B,CAAC,EAAE,CAAA;AAClC,IAAA,KAAA,MAAW,QAAQ,WAAA,EAA8B;AAC/C,MAAA,YAAA,GAAe,YAAA,CAAa,OAAA,CAAQ,CAAC,IAAA,KAAS,KAAK,GAAA,CAAI,CAAC,MAAA,KAAW,CAAC,GAAG,IAAA,EAAM,MAAA,CAAO,IAAI,CAAC,CAAC,CAAA;AAAA,IAC5F;AACA,IAAA,OAAO,YAAA,CAAa,GAAA,CAAI,CAAC,KAAA,MAAW,EAAE,GAAG,KAAA,EAAO,IAAA,EAAMI,2BAAA,CAAiB,KAAK,CAAA,EAAE,CAAE,CAAA;AAAA,EAClF;AAAA,EAEQ,eAAe,KAAA,EAA8B;AACnD,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,SAAA,CAAU,KAAK,CAAA;AACpC,IAAA,IAAI,QAAQ,IAAA,CAAK,CAAC,WAAW,MAAA,CAAO,IAAA,KAAS,MAAM,CAAA,EAAG;AACpD,MAAA,OAAOJ,iBAAA;AAAA,IACT;AACA,IAAA,MAAM,IAAA,GAAQ,QAAwB,MAAA,CAAO,CAAC,WAAW,CAACK,oBAAA,CAAU,MAAA,CAAO,IAAI,CAAC,CAAA;AAChF,IAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAMC,oBAAA,CAAU,IAAA,CAAK,GAAA,CAAI,CAAC,MAAA,KAAW,MAAA,CAAO,IAAI,CAAC,CAAA,EAAE;AAAA,EACxE;AAAA;AAAA,EAGQ,OAAA,CAAQ,OAAkB,KAAA,EAA2B;AAC3D,IAAA,MAAM,CAAC,MAAM,CAAA,GAAI,KAAA,CAAM,SAAS,QAAA,GAAW,KAAA,CAAM,UAAU,EAAC;AAC5D,IAAA,IAAI,KAAA,CAAM,SAAS,QAAA,IAAY,KAAA,CAAM,QAAQ,MAAA,KAAW,CAAA,IAAK,MAAA,EAAQ,IAAA,KAAS,UAAA,EAAY;AACxF,MAAA,OAAON,iBAAA;AAAA,IACT;AACA,IAAA,OAAOO,oBAAU,IAAA,EAAM,KAAA,EAAOC,sBAAA,CAAY,MAAA,CAAO,IAAI,CAAC,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,KAAA,CAAM,OAAkB,KAAA,EAA2B;AACjD,IAAA,OAAOC,sBAAA,CAAU,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA;AAAA,EACrC;AACF;;"}
+{"version":3,"file":"type-evaluation.cjs","sources":["../../../../src/application/transform/footer/type-evaluation.ts"],"sourcesContent":["import type { IrDeclaration, IrType } from \"../../../domain/ir/nodes.js\";\nimport {\n  absorbed,\n  type Evaluated,\n  type Evaluation,\n  intersectionType,\n  isNullish,\n  OPAQUE,\n  propertyKey,\n  unionType,\n} from \"./evaluation.js\";\nimport { indexType } from \"./type-indexing.js\";\nimport { extracted, markerObject, omitted } from \"./type-rules.js\";\n\n/**\n * A small evaluator of the generated types, as TypeScript reads them, for the `--enum-values`\n * check (ADR-027). It follows the declarations of the document and the helper types the generator\n * writes (`NonNullable`, `Extract`, `WithRequired`, `Omit`, `Record`, `FlattenedDeepRequired`). Its\n * answers are sure: a key is `missing` only where TypeScript reports it, and every type it does\n * not model is `opaque`, which never counts as an error.\n */\n\n/** How many references one evaluation expands; a deeper one is opaque. */\nconst MAX_EXPANSIONS = 200;\nconst DEEP_HELPER = \"FlattenedDeepRequired\";\n/** How many members distributing an intersection may give; more is opaque. */\nconst MAX_DISTRIBUTED = 64;\n\nexport class TypeEvaluator {\n  private readonly declared = new Map<string, IrType>();\n  private expansions = 0;\n\n  constructor(declarations: readonly IrDeclaration[]) {\n    for (const declaration of declarations) {\n      if (declaration.kind === \"interface\") {\n        this.declared.set(declaration.name, { kind: \"object\", members: declaration.members });\n      } else if (declaration.kind === \"typeAlias\") {\n        this.declared.set(declaration.name, declaration.type);\n      }\n    }\n  }\n\n  /** Evaluate a type written in the footer; the expansion budget starts again. */\n  evaluate(type: IrType): Evaluation {\n    this.expansions = 0;\n    return this.expand({ kind: \"type\", type, deep: false });\n  }\n\n  /** The type with references, `readonly` and indexed access resolved at the top. */\n  expand(value: Evaluated): Evaluation {\n    const { type } = value;\n    switch (type.kind) {\n      case \"readonly\":\n        return this.expand({ ...value, type: type.type });\n      case \"indexedAccess\":\n        return this.indexedAccess(value, type.object, type.index);\n      case \"reference\":\n        return this.reference(value, type.name, type.typeArguments);\n      case \"raw\":\n      case \"tuple\":\n        return OPAQUE;\n      default:\n        return value;\n    }\n  }\n\n  private indexedAccess(value: Evaluated, object: IrType, index: IrType): Evaluation {\n    const owner = this.expand({ ...value, type: object });\n    return owner.kind === \"type\" ? this.index(owner, index) : owner;\n  }\n\n  private reference(value: Evaluated, name: string, args: readonly IrType[]): Evaluation {\n    // Only references cost budget: re-expanding an already expanded value (as the checks after\n    // `evaluate` do) is free, so a large evaluation does not leave its checks opaque.\n    if (this.expansions++ > MAX_EXPANSIONS) {\n      return OPAQUE;\n    }\n    const [first, second] = args;\n    if (name === DEEP_HELPER && first?.kind === \"reference\" && first.typeArguments.length === 0) {\n      const root = this.declared.get(first.name);\n      return root === undefined ? OPAQUE : this.expand({ kind: \"type\", type: root, deep: true });\n    }\n    const declared = args.length === 0 ? this.declared.get(name) : undefined;\n    if (declared !== undefined) {\n      return this.expand({ ...value, type: declared });\n    }\n    if (first === undefined) {\n      return OPAQUE;\n    }\n    const argument = this.expand({ ...value, type: first });\n    if (argument.kind !== \"type\") {\n      return argument;\n    }\n    return this.helper(name, argument, second);\n  }\n\n  private helper(name: string, argument: Evaluated, second: IrType | undefined): Evaluation {\n    switch (name) {\n      case \"NonNullable\":\n        return this.withoutNullish(argument);\n      case \"WithRequired\":\n      case \"Readonly\":\n        return argument;\n      case \"Extract\":\n        return second === undefined ? OPAQUE : this.extract(argument, second);\n      case \"Omit\":\n        return second === undefined ? OPAQUE : omitted(this, argument, second);\n      default:\n        return markerObject(name, argument) ?? OPAQUE;\n    }\n  }\n\n  /**\n   * The members of a union, each expanded; an intersection with unions in it is distributed over\n   * them (`A & (B | C)` is `(A & B) | (A & C)`), as TypeScript normalizes it. A type that is not a\n   * union is its only member. A union with an `any` or `unknown` member is that keyword alone.\n   */\n  membersOf(value: Evaluated): readonly Evaluation[] {\n    const expanded = this.expand(value);\n    if (expanded.kind !== \"type\") {\n      return [expanded];\n    }\n    const { type } = expanded;\n    if (type.kind === \"union\") {\n      return absorbed(\n        type.types.flatMap((member) => this.membersOf({ ...expanded, type: member })),\n      );\n    }\n    return type.kind === \"intersection\" ? this.distributed(expanded, type.types) : [expanded];\n  }\n\n  private distributed(value: Evaluated, parts: readonly IrType[]): readonly Evaluation[] {\n    const memberLists = parts.map((part) => this.membersOf({ ...value, type: part }));\n    const size = memberLists.reduce((product, list) => product * list.length, 1);\n    if (size > MAX_DISTRIBUTED || memberLists.some((list) => list.some((m) => m.kind !== \"type\"))) {\n      return [OPAQUE];\n    }\n    let combinations: IrType[][] = [[]];\n    for (const list of memberLists as Evaluated[][]) {\n      combinations = combinations.flatMap((done) => list.map((member) => [...done, member.type]));\n    }\n    return combinations.map((types) => ({ ...value, type: intersectionType(types) }));\n  }\n\n  private withoutNullish(value: Evaluated): Evaluation {\n    const members = this.membersOf(value);\n    if (members.some((member) => member.kind !== \"type\")) {\n      return OPAQUE;\n    }\n    const kept = (members as Evaluated[]).filter((member) => !isNullish(member.type));\n    return { ...value, type: unionType(kept.map((member) => member.type)) };\n  }\n\n  /** `Extract<T, { key: unknown }>` keeps the members that have `key`; other probes are opaque. */\n  private extract(value: Evaluated, probe: IrType): Evaluation {\n    const [member] = probe.kind === \"object\" ? probe.members : [];\n    if (probe.kind !== \"object\" || probe.members.length !== 1 || member?.kind !== \"property\") {\n      return OPAQUE;\n    }\n    return extracted(this, value, propertyKey(member.name));\n  }\n\n  /** `value[index]` for a string literal, `string` or `number` index. */\n  index(value: Evaluated, index: IrType): Evaluation {\n    return indexType(this, value, index);\n  }\n}\n"],"names":["OPAQUE","omitted","markerObject","absorbed","intersectionType","isNullish","unionType","extracted","propertyKey","indexType"],"mappings":";;;;;;AAuBA,MAAM,cAAA,GAAiB,GAAA;AACvB,MAAM,WAAA,GAAc,uBAAA;AAEpB,MAAM,eAAA,GAAkB,EAAA;AAEjB,MAAM,aAAA,CAAc;AAAA,EACR,QAAA,uBAAe,GAAA,EAAoB;AAAA,EAC5C,UAAA,GAAa,CAAA;AAAA,EAErB,YAAY,YAAA,EAAwC;AAClD,IAAA,KAAA,MAAW,eAAe,YAAA,EAAc;AACtC,MAAA,IAAI,WAAA,CAAY,SAAS,WAAA,EAAa;AACpC,QAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,EAAE,MAAM,QAAA,EAAU,OAAA,EAAS,WAAA,CAAY,OAAA,EAAS,CAAA;AAAA,MACtF,CAAA,MAAA,IAAW,WAAA,CAAY,IAAA,KAAS,WAAA,EAAa;AAC3C,QAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,YAAY,IAAI,CAAA;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,SAAS,IAAA,EAA0B;AACjC,IAAA,IAAA,CAAK,UAAA,GAAa,CAAA;AAClB,IAAA,OAAO,IAAA,CAAK,OAAO,EAAE,IAAA,EAAM,QAAQ,IAAA,EAAM,IAAA,EAAM,OAAO,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,OAAO,KAAA,EAA8B;AACnC,IAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,IAAA,QAAQ,KAAK,IAAA;AAAM,MACjB,KAAK,UAAA;AACH,QAAA,OAAO,IAAA,CAAK,OAAO,EAAE,GAAG,OAAO,IAAA,EAAM,IAAA,CAAK,MAAM,CAAA;AAAA,MAClD,KAAK,eAAA;AACH,QAAA,OAAO,KAAK,aAAA,CAAc,KAAA,EAAO,IAAA,CAAK,MAAA,EAAQ,KAAK,KAAK,CAAA;AAAA,MAC1D,KAAK,WAAA;AACH,QAAA,OAAO,KAAK,SAAA,CAAU,KAAA,EAAO,IAAA,CAAK,IAAA,EAAM,KAAK,aAAa,CAAA;AAAA,MAC5D,KAAK,KAAA;AAAA,MACL,KAAK,OAAA;AACH,QAAA,OAAOA,iBAAA;AAAA,MACT;AACE,QAAA,OAAO,KAAA;AAAA;AACX,EACF;AAAA,EAEQ,aAAA,CAAc,KAAA,EAAkB,MAAA,EAAgB,KAAA,EAA2B;AACjF,IAAA,MAAM,KAAA,GAAQ,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,QAAQ,CAAA;AACpD,IAAA,OAAO,MAAM,IAAA,KAAS,MAAA,GAAS,KAAK,KAAA,CAAM,KAAA,EAAO,KAAK,CAAA,GAAI,KAAA;AAAA,EAC5D;AAAA,EAEQ,SAAA,CAAU,KAAA,EAAkB,IAAA,EAAc,IAAA,EAAqC;AAGrF,IAAA,IAAI,IAAA,CAAK,eAAe,cAAA,EAAgB;AACtC,MAAA,OAAOA,iBAAA;AAAA,IACT;AACA,IAAA,MAAM,CAAC,KAAA,EAAO,MAAM,CAAA,GAAI,IAAA;AACxB,IAAA,IAAI,IAAA,KAAS,eAAe,KAAA,EAAO,IAAA,KAAS,eAAe,KAAA,CAAM,aAAA,CAAc,WAAW,CAAA,EAAG;AAC3F,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,MAAM,IAAI,CAAA;AACzC,MAAA,OAAO,IAAA,KAAS,MAAA,GAAYA,iBAAA,GAAS,IAAA,CAAK,MAAA,CAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,CAAA;AAAA,IAC3F;AACA,IAAA,MAAM,QAAA,GAAW,KAAK,MAAA,KAAW,CAAA,GAAI,KAAK,QAAA,CAAS,GAAA,CAAI,IAAI,CAAA,GAAI,MAAA;AAC/D,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,OAAO,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,UAAU,CAAA;AAAA,IACjD;AACA,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAOA,iBAAA;AAAA,IACT;AACA,IAAA,MAAM,QAAA,GAAW,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,OAAO,CAAA;AACtD,IAAA,IAAI,QAAA,CAAS,SAAS,MAAA,EAAQ;AAC5B,MAAA,OAAO,QAAA;AAAA,IACT;AACA,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,EAAM,QAAA,EAAU,MAAM,CAAA;AAAA,EAC3C;AAAA,EAEQ,MAAA,CAAO,IAAA,EAAc,QAAA,EAAqB,MAAA,EAAwC;AACxF,IAAA,QAAQ,IAAA;AAAM,MACZ,KAAK,aAAA;AACH,QAAA,OAAO,IAAA,CAAK,eAAe,QAAQ,CAAA;AAAA,MACrC,KAAK,cAAA;AAAA,MACL,KAAK,UAAA;AACH,QAAA,OAAO,QAAA;AAAA,MACT,KAAK,SAAA;AACH,QAAA,OAAO,WAAW,MAAA,GAAYA,iBAAA,GAAS,IAAA,CAAK,OAAA,CAAQ,UAAU,MAAM,CAAA;AAAA,MACtE,KAAK,MAAA;AACH,QAAA,OAAO,WAAW,MAAA,GAAYA,iBAAA,GAASC,iBAAA,CAAQ,IAAA,EAAM,UAAU,MAAM,CAAA;AAAA,MACvE;AACE,QAAA,OAAOC,sBAAA,CAAa,IAAA,EAAM,QAAQ,CAAA,IAAKF,iBAAA;AAAA;AAC3C,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU,KAAA,EAAyC;AACjD,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAClC,IAAA,IAAI,QAAA,CAAS,SAAS,MAAA,EAAQ;AAC5B,MAAA,OAAO,CAAC,QAAQ,CAAA;AAAA,IAClB;AACA,IAAA,MAAM,EAAE,MAAK,GAAI,QAAA;AACjB,IAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AACzB,MAAA,OAAOG,mBAAA;AAAA,QACL,IAAA,CAAK,KAAA,CAAM,OAAA,CAAQ,CAAC,MAAA,KAAW,IAAA,CAAK,SAAA,CAAU,EAAE,GAAG,QAAA,EAAU,IAAA,EAAM,MAAA,EAAQ,CAAC;AAAA,OAC9E;AAAA,IACF;AACA,IAAA,OAAO,IAAA,CAAK,IAAA,KAAS,cAAA,GAAiB,IAAA,CAAK,WAAA,CAAY,UAAU,IAAA,CAAK,KAAK,CAAA,GAAI,CAAC,QAAQ,CAAA;AAAA,EAC1F;AAAA,EAEQ,WAAA,CAAY,OAAkB,KAAA,EAAiD;AACrF,IAAA,MAAM,WAAA,GAAc,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,SAAA,CAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,IAAA,EAAM,CAAC,CAAA;AAChF,IAAA,MAAM,IAAA,GAAO,YAAY,MAAA,CAAO,CAAC,SAAS,IAAA,KAAS,OAAA,GAAU,IAAA,CAAK,MAAA,EAAQ,CAAC,CAAA;AAC3E,IAAA,IAAI,IAAA,GAAO,eAAA,IAAmB,WAAA,CAAY,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAM,CAAC,CAAA,EAAG;AAC7F,MAAA,OAAO,CAACH,iBAAM,CAAA;AAAA,IAChB;AACA,IAAA,IAAI,YAAA,GAA2B,CAAC,EAAE,CAAA;AAClC,IAAA,KAAA,MAAW,QAAQ,WAAA,EAA8B;AAC/C,MAAA,YAAA,GAAe,YAAA,CAAa,OAAA,CAAQ,CAAC,IAAA,KAAS,KAAK,GAAA,CAAI,CAAC,MAAA,KAAW,CAAC,GAAG,IAAA,EAAM,MAAA,CAAO,IAAI,CAAC,CAAC,CAAA;AAAA,IAC5F;AACA,IAAA,OAAO,YAAA,CAAa,GAAA,CAAI,CAAC,KAAA,MAAW,EAAE,GAAG,KAAA,EAAO,IAAA,EAAMI,2BAAA,CAAiB,KAAK,CAAA,EAAE,CAAE,CAAA;AAAA,EAClF;AAAA,EAEQ,eAAe,KAAA,EAA8B;AACnD,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,SAAA,CAAU,KAAK,CAAA;AACpC,IAAA,IAAI,QAAQ,IAAA,CAAK,CAAC,WAAW,MAAA,CAAO,IAAA,KAAS,MAAM,CAAA,EAAG;AACpD,MAAA,OAAOJ,iBAAA;AAAA,IACT;AACA,IAAA,MAAM,IAAA,GAAQ,QAAwB,MAAA,CAAO,CAAC,WAAW,CAACK,oBAAA,CAAU,MAAA,CAAO,IAAI,CAAC,CAAA;AAChF,IAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAMC,oBAAA,CAAU,IAAA,CAAK,GAAA,CAAI,CAAC,MAAA,KAAW,MAAA,CAAO,IAAI,CAAC,CAAA,EAAE;AAAA,EACxE;AAAA;AAAA,EAGQ,OAAA,CAAQ,OAAkB,KAAA,EAA2B;AAC3D,IAAA,MAAM,CAAC,MAAM,CAAA,GAAI,KAAA,CAAM,SAAS,QAAA,GAAW,KAAA,CAAM,UAAU,EAAC;AAC5D,IAAA,IAAI,KAAA,CAAM,SAAS,QAAA,IAAY,KAAA,CAAM,QAAQ,MAAA,KAAW,CAAA,IAAK,MAAA,EAAQ,IAAA,KAAS,UAAA,EAAY;AACxF,MAAA,OAAON,iBAAA;AAAA,IACT;AACA,IAAA,OAAOO,oBAAU,IAAA,EAAM,KAAA,EAAOC,sBAAA,CAAY,MAAA,CAAO,IAAI,CAAC,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,KAAA,CAAM,OAAkB,KAAA,EAA2B;AACjD,IAAA,OAAOC,sBAAA,CAAU,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA;AAAA,EACrC;AACF;;"}

package/dist/application/transform/footer/type-evaluation.mjs

@@ -3,7 +3,7 @@ import { indexType } from './type-indexing.mjs';
 import { markerObject, omitted, extracted } from './type-rules.mjs';
 
 const MAX_EXPANSIONS = 200;
-const DEEP_PREFIX = "FlattenedDeepRequired<";
+const DEEP_HELPER = "FlattenedDeepRequired";
 const MAX_DISTRIBUTED = 64;
 class TypeEvaluator {
   declared = /* @__PURE__ */ new Map();
@@ -47,15 +47,15 @@ class TypeEvaluator {
     if (this.expansions++ > MAX_EXPANSIONS) {
       return OPAQUE;
     }
-    if (name.startsWith(DEEP_PREFIX) && name.endsWith(">")) {
-      const root = this.declared.get(name.slice(DEEP_PREFIX.length, -1));
+    const [first, second] = args;
+    if (name === DEEP_HELPER && first?.kind === "reference" && first.typeArguments.length === 0) {
+      const root = this.declared.get(first.name);
       return root === void 0 ? OPAQUE : this.expand({ kind: "type", type: root, deep: true });
     }
     const declared = args.length === 0 ? this.declared.get(name) : void 0;
     if (declared !== void 0) {
       return this.expand({ ...value, type: declared });
     }
-    const [first, second] = args;
     if (first === void 0) {
       return OPAQUE;
     }

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

@@ -1 +1 @@
-{"version":3,"file":"type-evaluation.mjs","sources":["../../../../src/application/transform/footer/type-evaluation.ts"],"sourcesContent":["import type { IrDeclaration, IrType } from \"../../../domain/ir/nodes.js\";\nimport {\n  absorbed,\n  type Evaluated,\n  type Evaluation,\n  intersectionType,\n  isNullish,\n  OPAQUE,\n  propertyKey,\n  unionType,\n} from \"./evaluation.js\";\nimport { indexType } from \"./type-indexing.js\";\nimport { extracted, markerObject, omitted } from \"./type-rules.js\";\n\n/**\n * A small evaluator of the generated types, as TypeScript reads them, for the `--enum-values`\n * check (ADR-027). It follows the declarations of the document and the helper types the generator\n * writes (`NonNullable`, `Extract`, `WithRequired`, `Omit`, `Record`, `FlattenedDeepRequired`). Its\n * answers are sure: a key is `missing` only where TypeScript reports it, and every type it does\n * not model is `opaque`, which never counts as an error.\n */\n\n/** How many references one evaluation expands; a deeper one is opaque. */\nconst MAX_EXPANSIONS = 200;\nconst DEEP_PREFIX = \"FlattenedDeepRequired<\";\n/** How many members distributing an intersection may give; more is opaque. */\nconst MAX_DISTRIBUTED = 64;\n\nexport class TypeEvaluator {\n  private readonly declared = new Map<string, IrType>();\n  private expansions = 0;\n\n  constructor(declarations: readonly IrDeclaration[]) {\n    for (const declaration of declarations) {\n      if (declaration.kind === \"interface\") {\n        this.declared.set(declaration.name, { kind: \"object\", members: declaration.members });\n      } else if (declaration.kind === \"typeAlias\") {\n        this.declared.set(declaration.name, declaration.type);\n      }\n    }\n  }\n\n  /** Evaluate a type written in the footer; the expansion budget starts again. */\n  evaluate(type: IrType): Evaluation {\n    this.expansions = 0;\n    return this.expand({ kind: \"type\", type, deep: false });\n  }\n\n  /** The type with references, `readonly` and indexed access resolved at the top. */\n  expand(value: Evaluated): Evaluation {\n    const { type } = value;\n    switch (type.kind) {\n      case \"readonly\":\n        return this.expand({ ...value, type: type.type });\n      case \"indexedAccess\":\n        return this.indexedAccess(value, type.object, type.index);\n      case \"reference\":\n        return this.reference(value, type.name, type.typeArguments);\n      case \"raw\":\n      case \"tuple\":\n        return OPAQUE;\n      default:\n        return value;\n    }\n  }\n\n  private indexedAccess(value: Evaluated, object: IrType, index: IrType): Evaluation {\n    const owner = this.expand({ ...value, type: object });\n    return owner.kind === \"type\" ? this.index(owner, index) : owner;\n  }\n\n  private reference(value: Evaluated, name: string, args: readonly IrType[]): Evaluation {\n    // Only references cost budget: re-expanding an already expanded value (as the checks after\n    // `evaluate` do) is free, so a large evaluation does not leave its checks opaque.\n    if (this.expansions++ > MAX_EXPANSIONS) {\n      return OPAQUE;\n    }\n    if (name.startsWith(DEEP_PREFIX) && name.endsWith(\">\")) {\n      const root = this.declared.get(name.slice(DEEP_PREFIX.length, -1));\n      return root === undefined ? OPAQUE : this.expand({ kind: \"type\", type: root, deep: true });\n    }\n    const declared = args.length === 0 ? this.declared.get(name) : undefined;\n    if (declared !== undefined) {\n      return this.expand({ ...value, type: declared });\n    }\n    const [first, second] = args;\n    if (first === undefined) {\n      return OPAQUE;\n    }\n    const argument = this.expand({ ...value, type: first });\n    if (argument.kind !== \"type\") {\n      return argument;\n    }\n    return this.helper(name, argument, second);\n  }\n\n  private helper(name: string, argument: Evaluated, second: IrType | undefined): Evaluation {\n    switch (name) {\n      case \"NonNullable\":\n        return this.withoutNullish(argument);\n      case \"WithRequired\":\n      case \"Readonly\":\n        return argument;\n      case \"Extract\":\n        return second === undefined ? OPAQUE : this.extract(argument, second);\n      case \"Omit\":\n        return second === undefined ? OPAQUE : omitted(this, argument, second);\n      default:\n        return markerObject(name, argument) ?? OPAQUE;\n    }\n  }\n\n  /**\n   * The members of a union, each expanded; an intersection with unions in it is distributed over\n   * them (`A & (B | C)` is `(A & B) | (A & C)`), as TypeScript normalizes it. A type that is not a\n   * union is its only member. A union with an `any` or `unknown` member is that keyword alone.\n   */\n  membersOf(value: Evaluated): readonly Evaluation[] {\n    const expanded = this.expand(value);\n    if (expanded.kind !== \"type\") {\n      return [expanded];\n    }\n    const { type } = expanded;\n    if (type.kind === \"union\") {\n      return absorbed(\n        type.types.flatMap((member) => this.membersOf({ ...expanded, type: member })),\n      );\n    }\n    return type.kind === \"intersection\" ? this.distributed(expanded, type.types) : [expanded];\n  }\n\n  private distributed(value: Evaluated, parts: readonly IrType[]): readonly Evaluation[] {\n    const memberLists = parts.map((part) => this.membersOf({ ...value, type: part }));\n    const size = memberLists.reduce((product, list) => product * list.length, 1);\n    if (size > MAX_DISTRIBUTED || memberLists.some((list) => list.some((m) => m.kind !== \"type\"))) {\n      return [OPAQUE];\n    }\n    let combinations: IrType[][] = [[]];\n    for (const list of memberLists as Evaluated[][]) {\n      combinations = combinations.flatMap((done) => list.map((member) => [...done, member.type]));\n    }\n    return combinations.map((types) => ({ ...value, type: intersectionType(types) }));\n  }\n\n  private withoutNullish(value: Evaluated): Evaluation {\n    const members = this.membersOf(value);\n    if (members.some((member) => member.kind !== \"type\")) {\n      return OPAQUE;\n    }\n    const kept = (members as Evaluated[]).filter((member) => !isNullish(member.type));\n    return { ...value, type: unionType(kept.map((member) => member.type)) };\n  }\n\n  /** `Extract<T, { key: unknown }>` keeps the members that have `key`; other probes are opaque. */\n  private extract(value: Evaluated, probe: IrType): Evaluation {\n    const [member] = probe.kind === \"object\" ? probe.members : [];\n    if (probe.kind !== \"object\" || probe.members.length !== 1 || member?.kind !== \"property\") {\n      return OPAQUE;\n    }\n    return extracted(this, value, propertyKey(member.name));\n  }\n\n  /** `value[index]` for a string literal, `string` or `number` index. */\n  index(value: Evaluated, index: IrType): Evaluation {\n    return indexType(this, value, index);\n  }\n}\n"],"names":[],"mappings":";;;;AAuBA,MAAM,cAAA,GAAiB,GAAA;AACvB,MAAM,WAAA,GAAc,wBAAA;AAEpB,MAAM,eAAA,GAAkB,EAAA;AAEjB,MAAM,aAAA,CAAc;AAAA,EACR,QAAA,uBAAe,GAAA,EAAoB;AAAA,EAC5C,UAAA,GAAa,CAAA;AAAA,EAErB,YAAY,YAAA,EAAwC;AAClD,IAAA,KAAA,MAAW,eAAe,YAAA,EAAc;AACtC,MAAA,IAAI,WAAA,CAAY,SAAS,WAAA,EAAa;AACpC,QAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,EAAE,MAAM,QAAA,EAAU,OAAA,EAAS,WAAA,CAAY,OAAA,EAAS,CAAA;AAAA,MACtF,CAAA,MAAA,IAAW,WAAA,CAAY,IAAA,KAAS,WAAA,EAAa;AAC3C,QAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,YAAY,IAAI,CAAA;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,SAAS,IAAA,EAA0B;AACjC,IAAA,IAAA,CAAK,UAAA,GAAa,CAAA;AAClB,IAAA,OAAO,IAAA,CAAK,OAAO,EAAE,IAAA,EAAM,QAAQ,IAAA,EAAM,IAAA,EAAM,OAAO,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,OAAO,KAAA,EAA8B;AACnC,IAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,IAAA,QAAQ,KAAK,IAAA;AAAM,MACjB,KAAK,UAAA;AACH,QAAA,OAAO,IAAA,CAAK,OAAO,EAAE,GAAG,OAAO,IAAA,EAAM,IAAA,CAAK,MAAM,CAAA;AAAA,MAClD,KAAK,eAAA;AACH,QAAA,OAAO,KAAK,aAAA,CAAc,KAAA,EAAO,IAAA,CAAK,MAAA,EAAQ,KAAK,KAAK,CAAA;AAAA,MAC1D,KAAK,WAAA;AACH,QAAA,OAAO,KAAK,SAAA,CAAU,KAAA,EAAO,IAAA,CAAK,IAAA,EAAM,KAAK,aAAa,CAAA;AAAA,MAC5D,KAAK,KAAA;AAAA,MACL,KAAK,OAAA;AACH,QAAA,OAAO,MAAA;AAAA,MACT;AACE,QAAA,OAAO,KAAA;AAAA;AACX,EACF;AAAA,EAEQ,aAAA,CAAc,KAAA,EAAkB,MAAA,EAAgB,KAAA,EAA2B;AACjF,IAAA,MAAM,KAAA,GAAQ,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,QAAQ,CAAA;AACpD,IAAA,OAAO,MAAM,IAAA,KAAS,MAAA,GAAS,KAAK,KAAA,CAAM,KAAA,EAAO,KAAK,CAAA,GAAI,KAAA;AAAA,EAC5D;AAAA,EAEQ,SAAA,CAAU,KAAA,EAAkB,IAAA,EAAc,IAAA,EAAqC;AAGrF,IAAA,IAAI,IAAA,CAAK,eAAe,cAAA,EAAgB;AACtC,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,IAAI,KAAK,UAAA,CAAW,WAAW,KAAK,IAAA,CAAK,QAAA,CAAS,GAAG,CAAA,EAAG;AACtD,MAAA,MAAM,IAAA,GAAO,KAAK,QAAA,CAAS,GAAA,CAAI,KAAK,KAAA,CAAM,WAAA,CAAY,MAAA,EAAQ,EAAE,CAAC,CAAA;AACjE,MAAA,OAAO,IAAA,KAAS,MAAA,GAAY,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,CAAA;AAAA,IAC3F;AACA,IAAA,MAAM,QAAA,GAAW,KAAK,MAAA,KAAW,CAAA,GAAI,KAAK,QAAA,CAAS,GAAA,CAAI,IAAI,CAAA,GAAI,MAAA;AAC/D,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,OAAO,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,UAAU,CAAA;AAAA,IACjD;AACA,IAAA,MAAM,CAAC,KAAA,EAAO,MAAM,CAAA,GAAI,IAAA;AACxB,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,MAAM,QAAA,GAAW,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,OAAO,CAAA;AACtD,IAAA,IAAI,QAAA,CAAS,SAAS,MAAA,EAAQ;AAC5B,MAAA,OAAO,QAAA;AAAA,IACT;AACA,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,EAAM,QAAA,EAAU,MAAM,CAAA;AAAA,EAC3C;AAAA,EAEQ,MAAA,CAAO,IAAA,EAAc,QAAA,EAAqB,MAAA,EAAwC;AACxF,IAAA,QAAQ,IAAA;AAAM,MACZ,KAAK,aAAA;AACH,QAAA,OAAO,IAAA,CAAK,eAAe,QAAQ,CAAA;AAAA,MACrC,KAAK,cAAA;AAAA,MACL,KAAK,UAAA;AACH,QAAA,OAAO,QAAA;AAAA,MACT,KAAK,SAAA;AACH,QAAA,OAAO,WAAW,MAAA,GAAY,MAAA,GAAS,IAAA,CAAK,OAAA,CAAQ,UAAU,MAAM,CAAA;AAAA,MACtE,KAAK,MAAA;AACH,QAAA,OAAO,WAAW,MAAA,GAAY,MAAA,GAAS,OAAA,CAAQ,IAAA,EAAM,UAAU,MAAM,CAAA;AAAA,MACvE;AACE,QAAA,OAAO,YAAA,CAAa,IAAA,EAAM,QAAQ,CAAA,IAAK,MAAA;AAAA;AAC3C,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU,KAAA,EAAyC;AACjD,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAClC,IAAA,IAAI,QAAA,CAAS,SAAS,MAAA,EAAQ;AAC5B,MAAA,OAAO,CAAC,QAAQ,CAAA;AAAA,IAClB;AACA,IAAA,MAAM,EAAE,MAAK,GAAI,QAAA;AACjB,IAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AACzB,MAAA,OAAO,QAAA;AAAA,QACL,IAAA,CAAK,KAAA,CAAM,OAAA,CAAQ,CAAC,MAAA,KAAW,IAAA,CAAK,SAAA,CAAU,EAAE,GAAG,QAAA,EAAU,IAAA,EAAM,MAAA,EAAQ,CAAC;AAAA,OAC9E;AAAA,IACF;AACA,IAAA,OAAO,IAAA,CAAK,IAAA,KAAS,cAAA,GAAiB,IAAA,CAAK,WAAA,CAAY,UAAU,IAAA,CAAK,KAAK,CAAA,GAAI,CAAC,QAAQ,CAAA;AAAA,EAC1F;AAAA,EAEQ,WAAA,CAAY,OAAkB,KAAA,EAAiD;AACrF,IAAA,MAAM,WAAA,GAAc,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,SAAA,CAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,IAAA,EAAM,CAAC,CAAA;AAChF,IAAA,MAAM,IAAA,GAAO,YAAY,MAAA,CAAO,CAAC,SAAS,IAAA,KAAS,OAAA,GAAU,IAAA,CAAK,MAAA,EAAQ,CAAC,CAAA;AAC3E,IAAA,IAAI,IAAA,GAAO,eAAA,IAAmB,WAAA,CAAY,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAM,CAAC,CAAA,EAAG;AAC7F,MAAA,OAAO,CAAC,MAAM,CAAA;AAAA,IAChB;AACA,IAAA,IAAI,YAAA,GAA2B,CAAC,EAAE,CAAA;AAClC,IAAA,KAAA,MAAW,QAAQ,WAAA,EAA8B;AAC/C,MAAA,YAAA,GAAe,YAAA,CAAa,OAAA,CAAQ,CAAC,IAAA,KAAS,KAAK,GAAA,CAAI,CAAC,MAAA,KAAW,CAAC,GAAG,IAAA,EAAM,MAAA,CAAO,IAAI,CAAC,CAAC,CAAA;AAAA,IAC5F;AACA,IAAA,OAAO,YAAA,CAAa,GAAA,CAAI,CAAC,KAAA,MAAW,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,gBAAA,CAAiB,KAAK,CAAA,EAAE,CAAE,CAAA;AAAA,EAClF;AAAA,EAEQ,eAAe,KAAA,EAA8B;AACnD,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,SAAA,CAAU,KAAK,CAAA;AACpC,IAAA,IAAI,QAAQ,IAAA,CAAK,CAAC,WAAW,MAAA,CAAO,IAAA,KAAS,MAAM,CAAA,EAAG;AACpD,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,MAAM,IAAA,GAAQ,QAAwB,MAAA,CAAO,CAAC,WAAW,CAAC,SAAA,CAAU,MAAA,CAAO,IAAI,CAAC,CAAA;AAChF,IAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,SAAA,CAAU,IAAA,CAAK,GAAA,CAAI,CAAC,MAAA,KAAW,MAAA,CAAO,IAAI,CAAC,CAAA,EAAE;AAAA,EACxE;AAAA;AAAA,EAGQ,OAAA,CAAQ,OAAkB,KAAA,EAA2B;AAC3D,IAAA,MAAM,CAAC,MAAM,CAAA,GAAI,KAAA,CAAM,SAAS,QAAA,GAAW,KAAA,CAAM,UAAU,EAAC;AAC5D,IAAA,IAAI,KAAA,CAAM,SAAS,QAAA,IAAY,KAAA,CAAM,QAAQ,MAAA,KAAW,CAAA,IAAK,MAAA,EAAQ,IAAA,KAAS,UAAA,EAAY;AACxF,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,OAAO,UAAU,IAAA,EAAM,KAAA,EAAO,WAAA,CAAY,MAAA,CAAO,IAAI,CAAC,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,KAAA,CAAM,OAAkB,KAAA,EAA2B;AACjD,IAAA,OAAO,SAAA,CAAU,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA;AAAA,EACrC;AACF;;"}
+{"version":3,"file":"type-evaluation.mjs","sources":["../../../../src/application/transform/footer/type-evaluation.ts"],"sourcesContent":["import type { IrDeclaration, IrType } from \"../../../domain/ir/nodes.js\";\nimport {\n  absorbed,\n  type Evaluated,\n  type Evaluation,\n  intersectionType,\n  isNullish,\n  OPAQUE,\n  propertyKey,\n  unionType,\n} from \"./evaluation.js\";\nimport { indexType } from \"./type-indexing.js\";\nimport { extracted, markerObject, omitted } from \"./type-rules.js\";\n\n/**\n * A small evaluator of the generated types, as TypeScript reads them, for the `--enum-values`\n * check (ADR-027). It follows the declarations of the document and the helper types the generator\n * writes (`NonNullable`, `Extract`, `WithRequired`, `Omit`, `Record`, `FlattenedDeepRequired`). Its\n * answers are sure: a key is `missing` only where TypeScript reports it, and every type it does\n * not model is `opaque`, which never counts as an error.\n */\n\n/** How many references one evaluation expands; a deeper one is opaque. */\nconst MAX_EXPANSIONS = 200;\nconst DEEP_HELPER = \"FlattenedDeepRequired\";\n/** How many members distributing an intersection may give; more is opaque. */\nconst MAX_DISTRIBUTED = 64;\n\nexport class TypeEvaluator {\n  private readonly declared = new Map<string, IrType>();\n  private expansions = 0;\n\n  constructor(declarations: readonly IrDeclaration[]) {\n    for (const declaration of declarations) {\n      if (declaration.kind === \"interface\") {\n        this.declared.set(declaration.name, { kind: \"object\", members: declaration.members });\n      } else if (declaration.kind === \"typeAlias\") {\n        this.declared.set(declaration.name, declaration.type);\n      }\n    }\n  }\n\n  /** Evaluate a type written in the footer; the expansion budget starts again. */\n  evaluate(type: IrType): Evaluation {\n    this.expansions = 0;\n    return this.expand({ kind: \"type\", type, deep: false });\n  }\n\n  /** The type with references, `readonly` and indexed access resolved at the top. */\n  expand(value: Evaluated): Evaluation {\n    const { type } = value;\n    switch (type.kind) {\n      case \"readonly\":\n        return this.expand({ ...value, type: type.type });\n      case \"indexedAccess\":\n        return this.indexedAccess(value, type.object, type.index);\n      case \"reference\":\n        return this.reference(value, type.name, type.typeArguments);\n      case \"raw\":\n      case \"tuple\":\n        return OPAQUE;\n      default:\n        return value;\n    }\n  }\n\n  private indexedAccess(value: Evaluated, object: IrType, index: IrType): Evaluation {\n    const owner = this.expand({ ...value, type: object });\n    return owner.kind === \"type\" ? this.index(owner, index) : owner;\n  }\n\n  private reference(value: Evaluated, name: string, args: readonly IrType[]): Evaluation {\n    // Only references cost budget: re-expanding an already expanded value (as the checks after\n    // `evaluate` do) is free, so a large evaluation does not leave its checks opaque.\n    if (this.expansions++ > MAX_EXPANSIONS) {\n      return OPAQUE;\n    }\n    const [first, second] = args;\n    if (name === DEEP_HELPER && first?.kind === \"reference\" && first.typeArguments.length === 0) {\n      const root = this.declared.get(first.name);\n      return root === undefined ? OPAQUE : this.expand({ kind: \"type\", type: root, deep: true });\n    }\n    const declared = args.length === 0 ? this.declared.get(name) : undefined;\n    if (declared !== undefined) {\n      return this.expand({ ...value, type: declared });\n    }\n    if (first === undefined) {\n      return OPAQUE;\n    }\n    const argument = this.expand({ ...value, type: first });\n    if (argument.kind !== \"type\") {\n      return argument;\n    }\n    return this.helper(name, argument, second);\n  }\n\n  private helper(name: string, argument: Evaluated, second: IrType | undefined): Evaluation {\n    switch (name) {\n      case \"NonNullable\":\n        return this.withoutNullish(argument);\n      case \"WithRequired\":\n      case \"Readonly\":\n        return argument;\n      case \"Extract\":\n        return second === undefined ? OPAQUE : this.extract(argument, second);\n      case \"Omit\":\n        return second === undefined ? OPAQUE : omitted(this, argument, second);\n      default:\n        return markerObject(name, argument) ?? OPAQUE;\n    }\n  }\n\n  /**\n   * The members of a union, each expanded; an intersection with unions in it is distributed over\n   * them (`A & (B | C)` is `(A & B) | (A & C)`), as TypeScript normalizes it. A type that is not a\n   * union is its only member. A union with an `any` or `unknown` member is that keyword alone.\n   */\n  membersOf(value: Evaluated): readonly Evaluation[] {\n    const expanded = this.expand(value);\n    if (expanded.kind !== \"type\") {\n      return [expanded];\n    }\n    const { type } = expanded;\n    if (type.kind === \"union\") {\n      return absorbed(\n        type.types.flatMap((member) => this.membersOf({ ...expanded, type: member })),\n      );\n    }\n    return type.kind === \"intersection\" ? this.distributed(expanded, type.types) : [expanded];\n  }\n\n  private distributed(value: Evaluated, parts: readonly IrType[]): readonly Evaluation[] {\n    const memberLists = parts.map((part) => this.membersOf({ ...value, type: part }));\n    const size = memberLists.reduce((product, list) => product * list.length, 1);\n    if (size > MAX_DISTRIBUTED || memberLists.some((list) => list.some((m) => m.kind !== \"type\"))) {\n      return [OPAQUE];\n    }\n    let combinations: IrType[][] = [[]];\n    for (const list of memberLists as Evaluated[][]) {\n      combinations = combinations.flatMap((done) => list.map((member) => [...done, member.type]));\n    }\n    return combinations.map((types) => ({ ...value, type: intersectionType(types) }));\n  }\n\n  private withoutNullish(value: Evaluated): Evaluation {\n    const members = this.membersOf(value);\n    if (members.some((member) => member.kind !== \"type\")) {\n      return OPAQUE;\n    }\n    const kept = (members as Evaluated[]).filter((member) => !isNullish(member.type));\n    return { ...value, type: unionType(kept.map((member) => member.type)) };\n  }\n\n  /** `Extract<T, { key: unknown }>` keeps the members that have `key`; other probes are opaque. */\n  private extract(value: Evaluated, probe: IrType): Evaluation {\n    const [member] = probe.kind === \"object\" ? probe.members : [];\n    if (probe.kind !== \"object\" || probe.members.length !== 1 || member?.kind !== \"property\") {\n      return OPAQUE;\n    }\n    return extracted(this, value, propertyKey(member.name));\n  }\n\n  /** `value[index]` for a string literal, `string` or `number` index. */\n  index(value: Evaluated, index: IrType): Evaluation {\n    return indexType(this, value, index);\n  }\n}\n"],"names":[],"mappings":";;;;AAuBA,MAAM,cAAA,GAAiB,GAAA;AACvB,MAAM,WAAA,GAAc,uBAAA;AAEpB,MAAM,eAAA,GAAkB,EAAA;AAEjB,MAAM,aAAA,CAAc;AAAA,EACR,QAAA,uBAAe,GAAA,EAAoB;AAAA,EAC5C,UAAA,GAAa,CAAA;AAAA,EAErB,YAAY,YAAA,EAAwC;AAClD,IAAA,KAAA,MAAW,eAAe,YAAA,EAAc;AACtC,MAAA,IAAI,WAAA,CAAY,SAAS,WAAA,EAAa;AACpC,QAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,EAAE,MAAM,QAAA,EAAU,OAAA,EAAS,WAAA,CAAY,OAAA,EAAS,CAAA;AAAA,MACtF,CAAA,MAAA,IAAW,WAAA,CAAY,IAAA,KAAS,WAAA,EAAa;AAC3C,QAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,YAAY,IAAI,CAAA;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,SAAS,IAAA,EAA0B;AACjC,IAAA,IAAA,CAAK,UAAA,GAAa,CAAA;AAClB,IAAA,OAAO,IAAA,CAAK,OAAO,EAAE,IAAA,EAAM,QAAQ,IAAA,EAAM,IAAA,EAAM,OAAO,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,OAAO,KAAA,EAA8B;AACnC,IAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,IAAA,QAAQ,KAAK,IAAA;AAAM,MACjB,KAAK,UAAA;AACH,QAAA,OAAO,IAAA,CAAK,OAAO,EAAE,GAAG,OAAO,IAAA,EAAM,IAAA,CAAK,MAAM,CAAA;AAAA,MAClD,KAAK,eAAA;AACH,QAAA,OAAO,KAAK,aAAA,CAAc,KAAA,EAAO,IAAA,CAAK,MAAA,EAAQ,KAAK,KAAK,CAAA;AAAA,MAC1D,KAAK,WAAA;AACH,QAAA,OAAO,KAAK,SAAA,CAAU,KAAA,EAAO,IAAA,CAAK,IAAA,EAAM,KAAK,aAAa,CAAA;AAAA,MAC5D,KAAK,KAAA;AAAA,MACL,KAAK,OAAA;AACH,QAAA,OAAO,MAAA;AAAA,MACT;AACE,QAAA,OAAO,KAAA;AAAA;AACX,EACF;AAAA,EAEQ,aAAA,CAAc,KAAA,EAAkB,MAAA,EAAgB,KAAA,EAA2B;AACjF,IAAA,MAAM,KAAA,GAAQ,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,QAAQ,CAAA;AACpD,IAAA,OAAO,MAAM,IAAA,KAAS,MAAA,GAAS,KAAK,KAAA,CAAM,KAAA,EAAO,KAAK,CAAA,GAAI,KAAA;AAAA,EAC5D;AAAA,EAEQ,SAAA,CAAU,KAAA,EAAkB,IAAA,EAAc,IAAA,EAAqC;AAGrF,IAAA,IAAI,IAAA,CAAK,eAAe,cAAA,EAAgB;AACtC,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,MAAM,CAAC,KAAA,EAAO,MAAM,CAAA,GAAI,IAAA;AACxB,IAAA,IAAI,IAAA,KAAS,eAAe,KAAA,EAAO,IAAA,KAAS,eAAe,KAAA,CAAM,aAAA,CAAc,WAAW,CAAA,EAAG;AAC3F,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,MAAM,IAAI,CAAA;AACzC,MAAA,OAAO,IAAA,KAAS,MAAA,GAAY,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,CAAA;AAAA,IAC3F;AACA,IAAA,MAAM,QAAA,GAAW,KAAK,MAAA,KAAW,CAAA,GAAI,KAAK,QAAA,CAAS,GAAA,CAAI,IAAI,CAAA,GAAI,MAAA;AAC/D,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,OAAO,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,UAAU,CAAA;AAAA,IACjD;AACA,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,MAAM,QAAA,GAAW,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,OAAO,CAAA;AACtD,IAAA,IAAI,QAAA,CAAS,SAAS,MAAA,EAAQ;AAC5B,MAAA,OAAO,QAAA;AAAA,IACT;AACA,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,EAAM,QAAA,EAAU,MAAM,CAAA;AAAA,EAC3C;AAAA,EAEQ,MAAA,CAAO,IAAA,EAAc,QAAA,EAAqB,MAAA,EAAwC;AACxF,IAAA,QAAQ,IAAA;AAAM,MACZ,KAAK,aAAA;AACH,QAAA,OAAO,IAAA,CAAK,eAAe,QAAQ,CAAA;AAAA,MACrC,KAAK,cAAA;AAAA,MACL,KAAK,UAAA;AACH,QAAA,OAAO,QAAA;AAAA,MACT,KAAK,SAAA;AACH,QAAA,OAAO,WAAW,MAAA,GAAY,MAAA,GAAS,IAAA,CAAK,OAAA,CAAQ,UAAU,MAAM,CAAA;AAAA,MACtE,KAAK,MAAA;AACH,QAAA,OAAO,WAAW,MAAA,GAAY,MAAA,GAAS,OAAA,CAAQ,IAAA,EAAM,UAAU,MAAM,CAAA;AAAA,MACvE;AACE,QAAA,OAAO,YAAA,CAAa,IAAA,EAAM,QAAQ,CAAA,IAAK,MAAA;AAAA;AAC3C,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU,KAAA,EAAyC;AACjD,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAClC,IAAA,IAAI,QAAA,CAAS,SAAS,MAAA,EAAQ;AAC5B,MAAA,OAAO,CAAC,QAAQ,CAAA;AAAA,IAClB;AACA,IAAA,MAAM,EAAE,MAAK,GAAI,QAAA;AACjB,IAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AACzB,MAAA,OAAO,QAAA;AAAA,QACL,IAAA,CAAK,KAAA,CAAM,OAAA,CAAQ,CAAC,MAAA,KAAW,IAAA,CAAK,SAAA,CAAU,EAAE,GAAG,QAAA,EAAU,IAAA,EAAM,MAAA,EAAQ,CAAC;AAAA,OAC9E;AAAA,IACF;AACA,IAAA,OAAO,IAAA,CAAK,IAAA,KAAS,cAAA,GAAiB,IAAA,CAAK,WAAA,CAAY,UAAU,IAAA,CAAK,KAAK,CAAA,GAAI,CAAC,QAAQ,CAAA;AAAA,EAC1F;AAAA,EAEQ,WAAA,CAAY,OAAkB,KAAA,EAAiD;AACrF,IAAA,MAAM,WAAA,GAAc,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,SAAA,CAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,IAAA,EAAM,CAAC,CAAA;AAChF,IAAA,MAAM,IAAA,GAAO,YAAY,MAAA,CAAO,CAAC,SAAS,IAAA,KAAS,OAAA,GAAU,IAAA,CAAK,MAAA,EAAQ,CAAC,CAAA;AAC3E,IAAA,IAAI,IAAA,GAAO,eAAA,IAAmB,WAAA,CAAY,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAM,CAAC,CAAA,EAAG;AAC7F,MAAA,OAAO,CAAC,MAAM,CAAA;AAAA,IAChB;AACA,IAAA,IAAI,YAAA,GAA2B,CAAC,EAAE,CAAA;AAClC,IAAA,KAAA,MAAW,QAAQ,WAAA,EAA8B;AAC/C,MAAA,YAAA,GAAe,YAAA,CAAa,OAAA,CAAQ,CAAC,IAAA,KAAS,KAAK,GAAA,CAAI,CAAC,MAAA,KAAW,CAAC,GAAG,IAAA,EAAM,MAAA,CAAO,IAAI,CAAC,CAAC,CAAA;AAAA,IAC5F;AACA,IAAA,OAAO,YAAA,CAAa,GAAA,CAAI,CAAC,KAAA,MAAW,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,gBAAA,CAAiB,KAAK,CAAA,EAAE,CAAE,CAAA;AAAA,EAClF;AAAA,EAEQ,eAAe,KAAA,EAA8B;AACnD,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,SAAA,CAAU,KAAK,CAAA;AACpC,IAAA,IAAI,QAAQ,IAAA,CAAK,CAAC,WAAW,MAAA,CAAO,IAAA,KAAS,MAAM,CAAA,EAAG;AACpD,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,MAAM,IAAA,GAAQ,QAAwB,MAAA,CAAO,CAAC,WAAW,CAAC,SAAA,CAAU,MAAA,CAAO,IAAI,CAAC,CAAA;AAChF,IAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,SAAA,CAAU,IAAA,CAAK,GAAA,CAAI,CAAC,MAAA,KAAW,MAAA,CAAO,IAAI,CAAC,CAAA,EAAE;AAAA,EACxE;AAAA;AAAA,EAGQ,OAAA,CAAQ,OAAkB,KAAA,EAA2B;AAC3D,IAAA,MAAM,CAAC,MAAM,CAAA,GAAI,KAAA,CAAM,SAAS,QAAA,GAAW,KAAA,CAAM,UAAU,EAAC;AAC5D,IAAA,IAAI,KAAA,CAAM,SAAS,QAAA,IAAY,KAAA,CAAM,QAAQ,MAAA,KAAW,CAAA,IAAK,MAAA,EAAQ,IAAA,KAAS,UAAA,EAAY;AACxF,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,OAAO,UAAU,IAAA,EAAM,KAAA,EAAO,WAAA,CAAY,MAAA,CAAO,IAAI,CAAC,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,KAAA,CAAM,OAAkB,KAAA,EAA2B;AACjD,IAAA,OAAO,SAAA,CAAU,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA;AAAA,EACrC;AACF;;"}

package/dist/application/transform/helper-types.cjs

@@ -47,7 +47,7 @@ const READ_WRITE_MARKER_TYPES = lines(
   "type ReadWritePrimitive = string | number | boolean | bigint | symbol | null | undefined;",
   "type ReadWriteLeaf = ReadWritePrimitive | ((...args: never) => unknown);",
   "type ReadWriteMarkedKeys<T, Marker> = {",
-  "    [K in keyof T]-?: NonNullable<T[K]> extends never ? never : NonNullable<T[K]> extends Marker ? K : never;",
+  "    [K in keyof T]-?: 0 extends 1 & T[K] ? never : NonNullable<T[K]> extends never ? never : NonNullable<T[K]> extends Marker ? K : never;",
   "}[keyof T];",
   'type ReadWriteResolveArray<T extends readonly unknown[], Resolved extends "read" | "write"> = T[number][] extends T ? T extends unknown[] ? ReadWriteResolve<T[number], Resolved>[] : readonly ReadWriteResolve<T[number], Resolved>[] : {',
   "    [K in keyof T]: ReadWriteResolve<T[K], Resolved>;",

package/dist/application/transform/helper-types.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"helper-types.cjs","sources":["../../../src/application/transform/helper-types.ts"],"sourcesContent":["/**\n * The helper type aliases the generator adds to the footer, declared once each. The text is the\n * original's source text as the TypeScript printer printed it, so printing it as written gives\n * the original output (ENGINEERING_PLAN 6.2 and 6.6), except for the fixes noted below.\n */\nexport interface HelperType {\n  readonly name: string;\n  readonly text: string;\n}\n\nfunction lines(...parts: readonly string[]): string {\n  return parts.join(\"\\n\");\n}\n\nexport const HELPER_TYPES = {\n  withRequired: {\n    name: \"WithRequired\",\n    text: lines(\"type WithRequired<T, K extends keyof T> = T & {\", \"    [P in K]-?: T[P];\", \"};\"),\n  },\n  // `unevaluated-properties` (roadmap R11): the value types of every member of a union, so a\n  // `$ref` to a `oneOf` schema gives the values of each variant, not only of the shared keys.\n  propertyValues: {\n    name: \"PropertyValues\",\n    text: \"type PropertyValues<T> = T extends unknown ? T[keyof T] : never;\",\n  },\n  // Task 7.4 changes the original text on purpose: `readonly unknown[]` also flattens the arrays\n  // of `--immutable` (upstream #2714, #2749), and `NonNullable` looks through nullable parents\n  // (upstream #2737). The old text did not compile for those schemas.\n  flattenedDeepRequired: {\n    name: \"FlattenedDeepRequired\",\n    text: lines(\n      \"type FlattenedDeepRequired<T> = {\",\n      \"    [K in keyof T]-?: FlattenedDeepRequired<T[K] extends readonly unknown[] | undefined | \" +\n        \"null ? Extract<T[K], readonly unknown[]>[number] : NonNullable<T[K]>>;\",\n      \"};\",\n    ),\n  },\n  // `readonly unknown[]`: a readonly array value type stays as is (upstream #2749).\n  readonlyArray: {\n    name: \"ReadonlyArray\",\n    text: lines(\n      \"type ReadonlyArray<T> = [\",\n      \"    Exclude<T, undefined>\",\n      \"] extends [\",\n      \"    readonly unknown[]\",\n      \"] ? Readonly<Exclude<T, undefined>> : Readonly<Exclude<T, undefined>[]>;\",\n    ),\n  },\n} as const satisfies Readonly<Record<string, HelperType>>;\n\n/**\n * The `--read-write-markers` helper types, written before the root types. Task 7.6 replaces the\n * original text on purpose (ADR-014): primitives (also branded), readonly arrays, tuples,\n * intersected arrays and null-only properties keep their types (upstream #2615, #2620, #2632,\n * #2717, #2765). The declarations equal `Readable` / `Writable` of openapi-typesafe-helpers\n * (`test/api/read-write-marker-types.test.ts`); the text is what the TypeScript printer prints.\n */\nexport const READ_WRITE_MARKER_TYPES = lines(\n  \"export type $Read<T> = {\",\n  \"    readonly $read: T;\",\n  \"};\",\n  \"export type $Write<T> = {\",\n  \"    readonly $write: T;\",\n  \"};\",\n  \"type ReadWritePrimitive = string | number | boolean | bigint | symbol | null | undefined;\",\n  \"type ReadWriteLeaf = ReadWritePrimitive | ((...args: never) => unknown);\",\n  \"type ReadWriteMarkedKeys<T, Marker> = {\",\n  \"    [K in keyof T]-?: NonNullable<T[K]> extends never ? never : NonNullable<T[K]> \" +\n    \"extends Marker ? K : never;\",\n  \"}[keyof T];\",\n  'type ReadWriteResolveArray<T extends readonly unknown[], Resolved extends \"read\" | ' +\n    '\"write\"> = T[number][] extends T ? T extends unknown[] ? ReadWriteResolve<T[number], ' +\n    \"Resolved>[] : readonly ReadWriteResolve<T[number], Resolved>[] : {\",\n  \"    [K in keyof T]: ReadWriteResolve<T[K], Resolved>;\",\n  \"};\",\n  'type ReadWriteResolve<T, Resolved extends \"read\" | \"write\"> = Resolved extends \"read\" ? ' +\n    \"Readable<T> : Writable<T>;\",\n  \"export type Readable<T> = T extends $Write<any> ? never : T extends $Read<infer U> ? \" +\n    \"Readable<U> : T extends ReadWriteLeaf ? T : T extends readonly unknown[] ? \" +\n    'ReadWriteResolveArray<T, \"read\"> : T extends object ? {',\n  \"    [K in keyof T as K extends ReadWriteMarkedKeys<T, $Write<any>> ? never : K]: \" +\n    \"Readable<T[K]>;\",\n  \"} : T;\",\n  \"export type Writable<T> = T extends $Read<any> ? never : T extends $Write<infer U> ? \" +\n    \"Writable<U> : T extends ReadWriteLeaf ? T : T extends readonly unknown[] ? \" +\n    'ReadWriteResolveArray<T, \"write\"> : T extends object ? {',\n  \"    [K in keyof T as K extends ReadWriteMarkedKeys<T, $Read<any>> ? never : K]: \" +\n    \"Writable<T[K]>;\",\n  \"} & {\",\n  \"    [K in ReadWriteMarkedKeys<T, $Read<any>>]?: never;\",\n  \"} : T;\",\n);\n"],"names":[],"mappings":";;AAUA,SAAS,SAAS,KAAA,EAAkC;AAClD,EAAA,OAAO,KAAA,CAAM,KAAK,IAAI,CAAA;AACxB;AAEO,MAAM,YAAA,GAAe;AAAA,EAC1B,YAAA,EAAc;AAAA,IACZ,IAAA,EAAM,cAAA;AAAA,IACN,IAAA,EAAM,KAAA,CAAM,iDAAA,EAAmD,uBAAA,EAAyB,IAAI;AAAA,GAC9F;AAAA;AAAA;AAAA,EAGA,cAAA,EAAgB;AAAA,IACd,IAAA,EAAM,gBAAA;AAAA,IACN,IAAA,EAAM;AAAA,GACR;AAAA;AAAA;AAAA;AAAA,EAIA,qBAAA,EAAuB;AAAA,IACrB,IAAA,EAAM,uBAAA;AAAA,IACN,IAAA,EAAM,KAAA;AAAA,MACJ,mCAAA;AAAA,MACA,kKAAA;AAAA,MAEA;AAAA;AACF,GACF;AAAA;AAAA,EAEA,aAAA,EAAe;AAAA,IACb,IAAA,EAAM,eAAA;AAAA,IACN,IAAA,EAAM,KAAA;AAAA,MACJ,2BAAA;AAAA,MACA,2BAAA;AAAA,MACA,aAAA;AAAA,MACA,wBAAA;AAAA,MACA;AAAA;AACF;AAEJ;AASO,MAAM,uBAAA,GAA0B,KAAA;AAAA,EACrC,0BAAA;AAAA,EACA,wBAAA;AAAA,EACA,IAAA;AAAA,EACA,2BAAA;AAAA,EACA,yBAAA;AAAA,EACA,IAAA;AAAA,EACA,2FAAA;AAAA,EACA,0EAAA;AAAA,EACA,yCAAA;AAAA,EACA,+GAAA;AAAA,EAEA,aAAA;AAAA,EACA,4OAAA;AAAA,EAGA,uDAAA;AAAA,EACA,IAAA;AAAA,EACA,oHAAA;AAAA,EAEA,yNAAA;AAAA,EAGA,kGAAA;AAAA,EAEA,QAAA;AAAA,EACA,0NAAA;AAAA,EAGA,iGAAA;AAAA,EAEA,OAAA;AAAA,EACA,wDAAA;AAAA,EACA;AACF;;;"}
+{"version":3,"file":"helper-types.cjs","sources":["../../../src/application/transform/helper-types.ts"],"sourcesContent":["/**\n * The helper type aliases the generator adds to the footer, declared once each. The text is the\n * original's source text as the TypeScript printer printed it, so printing it as written gives\n * the original output (ENGINEERING_PLAN 6.2 and 6.6), except for the fixes noted below.\n */\nexport interface HelperType {\n  readonly name: string;\n  readonly text: string;\n}\n\nfunction lines(...parts: readonly string[]): string {\n  return parts.join(\"\\n\");\n}\n\nexport const HELPER_TYPES = {\n  withRequired: {\n    name: \"WithRequired\",\n    text: lines(\"type WithRequired<T, K extends keyof T> = T & {\", \"    [P in K]-?: T[P];\", \"};\"),\n  },\n  // `unevaluated-properties` (roadmap R11): the value types of every member of a union, so a\n  // `$ref` to a `oneOf` schema gives the values of each variant, not only of the shared keys.\n  propertyValues: {\n    name: \"PropertyValues\",\n    text: \"type PropertyValues<T> = T extends unknown ? T[keyof T] : never;\",\n  },\n  // Task 7.4 changes the original text on purpose: `readonly unknown[]` also flattens the arrays\n  // of `--immutable` (upstream #2714, #2749), and `NonNullable` looks through nullable parents\n  // (upstream #2737). The old text did not compile for those schemas.\n  flattenedDeepRequired: {\n    name: \"FlattenedDeepRequired\",\n    text: lines(\n      \"type FlattenedDeepRequired<T> = {\",\n      \"    [K in keyof T]-?: FlattenedDeepRequired<T[K] extends readonly unknown[] | undefined | \" +\n        \"null ? Extract<T[K], readonly unknown[]>[number] : NonNullable<T[K]>>;\",\n      \"};\",\n    ),\n  },\n  // `readonly unknown[]`: a readonly array value type stays as is (upstream #2749).\n  readonlyArray: {\n    name: \"ReadonlyArray\",\n    text: lines(\n      \"type ReadonlyArray<T> = [\",\n      \"    Exclude<T, undefined>\",\n      \"] extends [\",\n      \"    readonly unknown[]\",\n      \"] ? Readonly<Exclude<T, undefined>> : Readonly<Exclude<T, undefined>[]>;\",\n    ),\n  },\n} as const satisfies Readonly<Record<string, HelperType>>;\n\n/**\n * The `--read-write-markers` helper types, written before the root types. Task 7.6 replaces the\n * original text on purpose (ADR-014): primitives (also branded), readonly arrays, tuples,\n * intersected arrays, null-only and `any` properties keep their types (upstream #2615, #2620,\n * #2632, #2717, #2765). The declarations equal the `Readable` / `Writable` that\n * openapi-typesafe-fetch declares (`test/api/read-write-marker-types.test.ts`); the text is what\n * the TypeScript printer prints.\n */\nexport const READ_WRITE_MARKER_TYPES = lines(\n  \"export type $Read<T> = {\",\n  \"    readonly $read: T;\",\n  \"};\",\n  \"export type $Write<T> = {\",\n  \"    readonly $write: T;\",\n  \"};\",\n  \"type ReadWritePrimitive = string | number | boolean | bigint | symbol | null | undefined;\",\n  \"type ReadWriteLeaf = ReadWritePrimitive | ((...args: never) => unknown);\",\n  \"type ReadWriteMarkedKeys<T, Marker> = {\",\n  \"    [K in keyof T]-?: 0 extends 1 & T[K] ? never : NonNullable<T[K]> extends never ? never : \" +\n    \"NonNullable<T[K]> extends Marker ? K : never;\",\n  \"}[keyof T];\",\n  'type ReadWriteResolveArray<T extends readonly unknown[], Resolved extends \"read\" | ' +\n    '\"write\"> = T[number][] extends T ? T extends unknown[] ? ReadWriteResolve<T[number], ' +\n    \"Resolved>[] : readonly ReadWriteResolve<T[number], Resolved>[] : {\",\n  \"    [K in keyof T]: ReadWriteResolve<T[K], Resolved>;\",\n  \"};\",\n  'type ReadWriteResolve<T, Resolved extends \"read\" | \"write\"> = Resolved extends \"read\" ? ' +\n    \"Readable<T> : Writable<T>;\",\n  \"export type Readable<T> = T extends $Write<any> ? never : T extends $Read<infer U> ? \" +\n    \"Readable<U> : T extends ReadWriteLeaf ? T : T extends readonly unknown[] ? \" +\n    'ReadWriteResolveArray<T, \"read\"> : T extends object ? {',\n  \"    [K in keyof T as K extends ReadWriteMarkedKeys<T, $Write<any>> ? never : K]: \" +\n    \"Readable<T[K]>;\",\n  \"} : T;\",\n  \"export type Writable<T> = T extends $Read<any> ? never : T extends $Write<infer U> ? \" +\n    \"Writable<U> : T extends ReadWriteLeaf ? T : T extends readonly unknown[] ? \" +\n    'ReadWriteResolveArray<T, \"write\"> : T extends object ? {',\n  \"    [K in keyof T as K extends ReadWriteMarkedKeys<T, $Read<any>> ? never : K]: \" +\n    \"Writable<T[K]>;\",\n  \"} & {\",\n  \"    [K in ReadWriteMarkedKeys<T, $Read<any>>]?: never;\",\n  \"} : T;\",\n);\n"],"names":[],"mappings":";;AAUA,SAAS,SAAS,KAAA,EAAkC;AAClD,EAAA,OAAO,KAAA,CAAM,KAAK,IAAI,CAAA;AACxB;AAEO,MAAM,YAAA,GAAe;AAAA,EAC1B,YAAA,EAAc;AAAA,IACZ,IAAA,EAAM,cAAA;AAAA,IACN,IAAA,EAAM,KAAA,CAAM,iDAAA,EAAmD,uBAAA,EAAyB,IAAI;AAAA,GAC9F;AAAA;AAAA;AAAA,EAGA,cAAA,EAAgB;AAAA,IACd,IAAA,EAAM,gBAAA;AAAA,IACN,IAAA,EAAM;AAAA,GACR;AAAA;AAAA;AAAA;AAAA,EAIA,qBAAA,EAAuB;AAAA,IACrB,IAAA,EAAM,uBAAA;AAAA,IACN,IAAA,EAAM,KAAA;AAAA,MACJ,mCAAA;AAAA,MACA,kKAAA;AAAA,MAEA;AAAA;AACF,GACF;AAAA;AAAA,EAEA,aAAA,EAAe;AAAA,IACb,IAAA,EAAM,eAAA;AAAA,IACN,IAAA,EAAM,KAAA;AAAA,MACJ,2BAAA;AAAA,MACA,2BAAA;AAAA,MACA,aAAA;AAAA,MACA,wBAAA;AAAA,MACA;AAAA;AACF;AAEJ;AAUO,MAAM,uBAAA,GAA0B,KAAA;AAAA,EACrC,0BAAA;AAAA,EACA,wBAAA;AAAA,EACA,IAAA;AAAA,EACA,2BAAA;AAAA,EACA,yBAAA;AAAA,EACA,IAAA;AAAA,EACA,2FAAA;AAAA,EACA,0EAAA;AAAA,EACA,yCAAA;AAAA,EACA,4IAAA;AAAA,EAEA,aAAA;AAAA,EACA,4OAAA;AAAA,EAGA,uDAAA;AAAA,EACA,IAAA;AAAA,EACA,oHAAA;AAAA,EAEA,yNAAA;AAAA,EAGA,kGAAA;AAAA,EAEA,QAAA;AAAA,EACA,0NAAA;AAAA,EAGA,iGAAA;AAAA,EAEA,OAAA;AAAA,EACA,wDAAA;AAAA,EACA;AACF;;;"}

package/dist/application/transform/helper-types.mjs

@@ -45,7 +45,7 @@ const READ_WRITE_MARKER_TYPES = lines(
   "type ReadWritePrimitive = string | number | boolean | bigint | symbol | null | undefined;",
   "type ReadWriteLeaf = ReadWritePrimitive | ((...args: never) => unknown);",
   "type ReadWriteMarkedKeys<T, Marker> = {",
-  "    [K in keyof T]-?: NonNullable<T[K]> extends never ? never : NonNullable<T[K]> extends Marker ? K : never;",
+  "    [K in keyof T]-?: 0 extends 1 & T[K] ? never : NonNullable<T[K]> extends never ? never : NonNullable<T[K]> extends Marker ? K : never;",
   "}[keyof T];",
   'type ReadWriteResolveArray<T extends readonly unknown[], Resolved extends "read" | "write"> = T[number][] extends T ? T extends unknown[] ? ReadWriteResolve<T[number], Resolved>[] : readonly ReadWriteResolve<T[number], Resolved>[] : {',
   "    [K in keyof T]: ReadWriteResolve<T[K], Resolved>;",

package/dist/application/transform/helper-types.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"helper-types.mjs","sources":["../../../src/application/transform/helper-types.ts"],"sourcesContent":["/**\n * The helper type aliases the generator adds to the footer, declared once each. The text is the\n * original's source text as the TypeScript printer printed it, so printing it as written gives\n * the original output (ENGINEERING_PLAN 6.2 and 6.6), except for the fixes noted below.\n */\nexport interface HelperType {\n  readonly name: string;\n  readonly text: string;\n}\n\nfunction lines(...parts: readonly string[]): string {\n  return parts.join(\"\\n\");\n}\n\nexport const HELPER_TYPES = {\n  withRequired: {\n    name: \"WithRequired\",\n    text: lines(\"type WithRequired<T, K extends keyof T> = T & {\", \"    [P in K]-?: T[P];\", \"};\"),\n  },\n  // `unevaluated-properties` (roadmap R11): the value types of every member of a union, so a\n  // `$ref` to a `oneOf` schema gives the values of each variant, not only of the shared keys.\n  propertyValues: {\n    name: \"PropertyValues\",\n    text: \"type PropertyValues<T> = T extends unknown ? T[keyof T] : never;\",\n  },\n  // Task 7.4 changes the original text on purpose: `readonly unknown[]` also flattens the arrays\n  // of `--immutable` (upstream #2714, #2749), and `NonNullable` looks through nullable parents\n  // (upstream #2737). The old text did not compile for those schemas.\n  flattenedDeepRequired: {\n    name: \"FlattenedDeepRequired\",\n    text: lines(\n      \"type FlattenedDeepRequired<T> = {\",\n      \"    [K in keyof T]-?: FlattenedDeepRequired<T[K] extends readonly unknown[] | undefined | \" +\n        \"null ? Extract<T[K], readonly unknown[]>[number] : NonNullable<T[K]>>;\",\n      \"};\",\n    ),\n  },\n  // `readonly unknown[]`: a readonly array value type stays as is (upstream #2749).\n  readonlyArray: {\n    name: \"ReadonlyArray\",\n    text: lines(\n      \"type ReadonlyArray<T> = [\",\n      \"    Exclude<T, undefined>\",\n      \"] extends [\",\n      \"    readonly unknown[]\",\n      \"] ? Readonly<Exclude<T, undefined>> : Readonly<Exclude<T, undefined>[]>;\",\n    ),\n  },\n} as const satisfies Readonly<Record<string, HelperType>>;\n\n/**\n * The `--read-write-markers` helper types, written before the root types. Task 7.6 replaces the\n * original text on purpose (ADR-014): primitives (also branded), readonly arrays, tuples,\n * intersected arrays and null-only properties keep their types (upstream #2615, #2620, #2632,\n * #2717, #2765). The declarations equal `Readable` / `Writable` of openapi-typesafe-helpers\n * (`test/api/read-write-marker-types.test.ts`); the text is what the TypeScript printer prints.\n */\nexport const READ_WRITE_MARKER_TYPES = lines(\n  \"export type $Read<T> = {\",\n  \"    readonly $read: T;\",\n  \"};\",\n  \"export type $Write<T> = {\",\n  \"    readonly $write: T;\",\n  \"};\",\n  \"type ReadWritePrimitive = string | number | boolean | bigint | symbol | null | undefined;\",\n  \"type ReadWriteLeaf = ReadWritePrimitive | ((...args: never) => unknown);\",\n  \"type ReadWriteMarkedKeys<T, Marker> = {\",\n  \"    [K in keyof T]-?: NonNullable<T[K]> extends never ? never : NonNullable<T[K]> \" +\n    \"extends Marker ? K : never;\",\n  \"}[keyof T];\",\n  'type ReadWriteResolveArray<T extends readonly unknown[], Resolved extends \"read\" | ' +\n    '\"write\"> = T[number][] extends T ? T extends unknown[] ? ReadWriteResolve<T[number], ' +\n    \"Resolved>[] : readonly ReadWriteResolve<T[number], Resolved>[] : {\",\n  \"    [K in keyof T]: ReadWriteResolve<T[K], Resolved>;\",\n  \"};\",\n  'type ReadWriteResolve<T, Resolved extends \"read\" | \"write\"> = Resolved extends \"read\" ? ' +\n    \"Readable<T> : Writable<T>;\",\n  \"export type Readable<T> = T extends $Write<any> ? never : T extends $Read<infer U> ? \" +\n    \"Readable<U> : T extends ReadWriteLeaf ? T : T extends readonly unknown[] ? \" +\n    'ReadWriteResolveArray<T, \"read\"> : T extends object ? {',\n  \"    [K in keyof T as K extends ReadWriteMarkedKeys<T, $Write<any>> ? never : K]: \" +\n    \"Readable<T[K]>;\",\n  \"} : T;\",\n  \"export type Writable<T> = T extends $Read<any> ? never : T extends $Write<infer U> ? \" +\n    \"Writable<U> : T extends ReadWriteLeaf ? T : T extends readonly unknown[] ? \" +\n    'ReadWriteResolveArray<T, \"write\"> : T extends object ? {',\n  \"    [K in keyof T as K extends ReadWriteMarkedKeys<T, $Read<any>> ? never : K]: \" +\n    \"Writable<T[K]>;\",\n  \"} & {\",\n  \"    [K in ReadWriteMarkedKeys<T, $Read<any>>]?: never;\",\n  \"} : T;\",\n);\n"],"names":[],"mappings":"AAUA,SAAS,SAAS,KAAA,EAAkC;AAClD,EAAA,OAAO,KAAA,CAAM,KAAK,IAAI,CAAA;AACxB;AAEO,MAAM,YAAA,GAAe;AAAA,EAC1B,YAAA,EAAc;AAAA,IACZ,IAAA,EAAM,cAAA;AAAA,IACN,IAAA,EAAM,KAAA,CAAM,iDAAA,EAAmD,uBAAA,EAAyB,IAAI;AAAA,GAC9F;AAAA;AAAA;AAAA,EAGA,cAAA,EAAgB;AAAA,IACd,IAAA,EAAM,gBAAA;AAAA,IACN,IAAA,EAAM;AAAA,GACR;AAAA;AAAA;AAAA;AAAA,EAIA,qBAAA,EAAuB;AAAA,IACrB,IAAA,EAAM,uBAAA;AAAA,IACN,IAAA,EAAM,KAAA;AAAA,MACJ,mCAAA;AAAA,MACA,kKAAA;AAAA,MAEA;AAAA;AACF,GACF;AAAA;AAAA,EAEA,aAAA,EAAe;AAAA,IACb,IAAA,EAAM,eAAA;AAAA,IACN,IAAA,EAAM,KAAA;AAAA,MACJ,2BAAA;AAAA,MACA,2BAAA;AAAA,MACA,aAAA;AAAA,MACA,wBAAA;AAAA,MACA;AAAA;AACF;AAEJ;AASO,MAAM,uBAAA,GAA0B,KAAA;AAAA,EACrC,0BAAA;AAAA,EACA,wBAAA;AAAA,EACA,IAAA;AAAA,EACA,2BAAA;AAAA,EACA,yBAAA;AAAA,EACA,IAAA;AAAA,EACA,2FAAA;AAAA,EACA,0EAAA;AAAA,EACA,yCAAA;AAAA,EACA,+GAAA;AAAA,EAEA,aAAA;AAAA,EACA,4OAAA;AAAA,EAGA,uDAAA;AAAA,EACA,IAAA;AAAA,EACA,oHAAA;AAAA,EAEA,yNAAA;AAAA,EAGA,kGAAA;AAAA,EAEA,QAAA;AAAA,EACA,0NAAA;AAAA,EAGA,iGAAA;AAAA,EAEA,OAAA;AAAA,EACA,wDAAA;AAAA,EACA;AACF;;"}
+{"version":3,"file":"helper-types.mjs","sources":["../../../src/application/transform/helper-types.ts"],"sourcesContent":["/**\n * The helper type aliases the generator adds to the footer, declared once each. The text is the\n * original's source text as the TypeScript printer printed it, so printing it as written gives\n * the original output (ENGINEERING_PLAN 6.2 and 6.6), except for the fixes noted below.\n */\nexport interface HelperType {\n  readonly name: string;\n  readonly text: string;\n}\n\nfunction lines(...parts: readonly string[]): string {\n  return parts.join(\"\\n\");\n}\n\nexport const HELPER_TYPES = {\n  withRequired: {\n    name: \"WithRequired\",\n    text: lines(\"type WithRequired<T, K extends keyof T> = T & {\", \"    [P in K]-?: T[P];\", \"};\"),\n  },\n  // `unevaluated-properties` (roadmap R11): the value types of every member of a union, so a\n  // `$ref` to a `oneOf` schema gives the values of each variant, not only of the shared keys.\n  propertyValues: {\n    name: \"PropertyValues\",\n    text: \"type PropertyValues<T> = T extends unknown ? T[keyof T] : never;\",\n  },\n  // Task 7.4 changes the original text on purpose: `readonly unknown[]` also flattens the arrays\n  // of `--immutable` (upstream #2714, #2749), and `NonNullable` looks through nullable parents\n  // (upstream #2737). The old text did not compile for those schemas.\n  flattenedDeepRequired: {\n    name: \"FlattenedDeepRequired\",\n    text: lines(\n      \"type FlattenedDeepRequired<T> = {\",\n      \"    [K in keyof T]-?: FlattenedDeepRequired<T[K] extends readonly unknown[] | undefined | \" +\n        \"null ? Extract<T[K], readonly unknown[]>[number] : NonNullable<T[K]>>;\",\n      \"};\",\n    ),\n  },\n  // `readonly unknown[]`: a readonly array value type stays as is (upstream #2749).\n  readonlyArray: {\n    name: \"ReadonlyArray\",\n    text: lines(\n      \"type ReadonlyArray<T> = [\",\n      \"    Exclude<T, undefined>\",\n      \"] extends [\",\n      \"    readonly unknown[]\",\n      \"] ? Readonly<Exclude<T, undefined>> : Readonly<Exclude<T, undefined>[]>;\",\n    ),\n  },\n} as const satisfies Readonly<Record<string, HelperType>>;\n\n/**\n * The `--read-write-markers` helper types, written before the root types. Task 7.6 replaces the\n * original text on purpose (ADR-014): primitives (also branded), readonly arrays, tuples,\n * intersected arrays, null-only and `any` properties keep their types (upstream #2615, #2620,\n * #2632, #2717, #2765). The declarations equal the `Readable` / `Writable` that\n * openapi-typesafe-fetch declares (`test/api/read-write-marker-types.test.ts`); the text is what\n * the TypeScript printer prints.\n */\nexport const READ_WRITE_MARKER_TYPES = lines(\n  \"export type $Read<T> = {\",\n  \"    readonly $read: T;\",\n  \"};\",\n  \"export type $Write<T> = {\",\n  \"    readonly $write: T;\",\n  \"};\",\n  \"type ReadWritePrimitive = string | number | boolean | bigint | symbol | null | undefined;\",\n  \"type ReadWriteLeaf = ReadWritePrimitive | ((...args: never) => unknown);\",\n  \"type ReadWriteMarkedKeys<T, Marker> = {\",\n  \"    [K in keyof T]-?: 0 extends 1 & T[K] ? never : NonNullable<T[K]> extends never ? never : \" +\n    \"NonNullable<T[K]> extends Marker ? K : never;\",\n  \"}[keyof T];\",\n  'type ReadWriteResolveArray<T extends readonly unknown[], Resolved extends \"read\" | ' +\n    '\"write\"> = T[number][] extends T ? T extends unknown[] ? ReadWriteResolve<T[number], ' +\n    \"Resolved>[] : readonly ReadWriteResolve<T[number], Resolved>[] : {\",\n  \"    [K in keyof T]: ReadWriteResolve<T[K], Resolved>;\",\n  \"};\",\n  'type ReadWriteResolve<T, Resolved extends \"read\" | \"write\"> = Resolved extends \"read\" ? ' +\n    \"Readable<T> : Writable<T>;\",\n  \"export type Readable<T> = T extends $Write<any> ? never : T extends $Read<infer U> ? \" +\n    \"Readable<U> : T extends ReadWriteLeaf ? T : T extends readonly unknown[] ? \" +\n    'ReadWriteResolveArray<T, \"read\"> : T extends object ? {',\n  \"    [K in keyof T as K extends ReadWriteMarkedKeys<T, $Write<any>> ? never : K]: \" +\n    \"Readable<T[K]>;\",\n  \"} : T;\",\n  \"export type Writable<T> = T extends $Read<any> ? never : T extends $Write<infer U> ? \" +\n    \"Writable<U> : T extends ReadWriteLeaf ? T : T extends readonly unknown[] ? \" +\n    'ReadWriteResolveArray<T, \"write\"> : T extends object ? {',\n  \"    [K in keyof T as K extends ReadWriteMarkedKeys<T, $Read<any>> ? never : K]: \" +\n    \"Writable<T[K]>;\",\n  \"} & {\",\n  \"    [K in ReadWriteMarkedKeys<T, $Read<any>>]?: never;\",\n  \"} : T;\",\n);\n"],"names":[],"mappings":"AAUA,SAAS,SAAS,KAAA,EAAkC;AAClD,EAAA,OAAO,KAAA,CAAM,KAAK,IAAI,CAAA;AACxB;AAEO,MAAM,YAAA,GAAe;AAAA,EAC1B,YAAA,EAAc;AAAA,IACZ,IAAA,EAAM,cAAA;AAAA,IACN,IAAA,EAAM,KAAA,CAAM,iDAAA,EAAmD,uBAAA,EAAyB,IAAI;AAAA,GAC9F;AAAA;AAAA;AAAA,EAGA,cAAA,EAAgB;AAAA,IACd,IAAA,EAAM,gBAAA;AAAA,IACN,IAAA,EAAM;AAAA,GACR;AAAA;AAAA;AAAA;AAAA,EAIA,qBAAA,EAAuB;AAAA,IACrB,IAAA,EAAM,uBAAA;AAAA,IACN,IAAA,EAAM,KAAA;AAAA,MACJ,mCAAA;AAAA,MACA,kKAAA;AAAA,MAEA;AAAA;AACF,GACF;AAAA;AAAA,EAEA,aAAA,EAAe;AAAA,IACb,IAAA,EAAM,eAAA;AAAA,IACN,IAAA,EAAM,KAAA;AAAA,MACJ,2BAAA;AAAA,MACA,2BAAA;AAAA,MACA,aAAA;AAAA,MACA,wBAAA;AAAA,MACA;AAAA;AACF;AAEJ;AAUO,MAAM,uBAAA,GAA0B,KAAA;AAAA,EACrC,0BAAA;AAAA,EACA,wBAAA;AAAA,EACA,IAAA;AAAA,EACA,2BAAA;AAAA,EACA,yBAAA;AAAA,EACA,IAAA;AAAA,EACA,2FAAA;AAAA,EACA,0EAAA;AAAA,EACA,yCAAA;AAAA,EACA,4IAAA;AAAA,EAEA,aAAA;AAAA,EACA,4OAAA;AAAA,EAGA,uDAAA;AAAA,EACA,IAAA;AAAA,EACA,oHAAA;AAAA,EAEA,yNAAA;AAAA,EAGA,kGAAA;AAAA,EAEA,QAAA;AAAA,EACA,0NAAA;AAAA,EAGA,iGAAA;AAAA,EAEA,OAAA;AAAA,EACA,wDAAA;AAAA,EACA;AACF;;"}

package/dist/application/transform/numbered-names.cjs

@@ -13,6 +13,15 @@ function withNumberedRepeats(names, numbered) {
     return unique;
   });
 }
+const DECLARATION_NUMBER_SEPARATOR = "_";
+function freeNumberedName(name, taken) {
+  let count = 2;
+  while (taken.has(`${name}${DECLARATION_NUMBER_SEPARATOR}${count}`)) {
+    count += 1;
+  }
+  return `${name}${DECLARATION_NUMBER_SEPARATOR}${count}`;
+}
 
+exports.freeNumberedName = freeNumberedName;
 exports.withNumberedRepeats = withNumberedRepeats;
 //# sourceMappingURL=numbered-names.cjs.map

package/dist/application/transform/numbered-names.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"numbered-names.cjs","sources":["../../../src/application/transform/numbered-names.ts"],"sourcesContent":["/** Builds the name for the `count`-th use of `name` (2, 3…). */\nexport type NumberedName = (name: string, count: number) => string;\n\n/**\n * Names made unique, in order: the first use of a name keeps it, each repeat gets the lowest\n * number from 2 whose name is not written anywhere in the list.\n */\nexport function withNumberedRepeats(names: readonly string[], numbered: NumberedName): string[] {\n  const written = new Set(names);\n  const taken = new Set<string>();\n  return names.map((name) => {\n    let unique = name;\n    for (let count = 2; taken.has(unique); count += 1) {\n      const candidate = numbered(name, count);\n      unique = written.has(candidate) ? unique : candidate;\n    }\n    taken.add(unique);\n    return unique;\n  });\n}\n"],"names":[],"mappings":";;AAOO,SAAS,mBAAA,CAAoB,OAA0B,QAAA,EAAkC;AAC9F,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,KAAK,CAAA;AAC7B,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AACzB,IAAA,IAAI,MAAA,GAAS,IAAA;AACb,IAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,CAAM,IAAI,MAAM,CAAA,EAAG,SAAS,CAAA,EAAG;AACjD,MAAA,MAAM,SAAA,GAAY,QAAA,CAAS,IAAA,EAAM,KAAK,CAAA;AACtC,MAAA,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,GAAI,MAAA,GAAS,SAAA;AAAA,IAC7C;AACA,IAAA,KAAA,CAAM,IAAI,MAAM,CAAA;AAChB,IAAA,OAAO,MAAA;AAAA,EACT,CAAC,CAAA;AACH;;"}
+{"version":3,"file":"numbered-names.cjs","sources":["../../../src/application/transform/numbered-names.ts"],"sourcesContent":["/** Builds the name for the `count`-th use of `name` (2, 3…). */\nexport type NumberedName = (name: string, count: number) => string;\n\n/**\n * Names made unique, in order: the first use of a name keeps it, each repeat gets the lowest\n * number from 2 whose name is not written anywhere in the list.\n */\nexport function withNumberedRepeats(names: readonly string[], numbered: NumberedName): string[] {\n  const written = new Set(names);\n  const taken = new Set<string>();\n  return names.map((name) => {\n    let unique = name;\n    for (let count = 2; taken.has(unique); count += 1) {\n      const candidate = numbered(name, count);\n      unique = written.has(candidate) ? unique : candidate;\n    }\n    taken.add(unique);\n    return unique;\n  });\n}\n\n/** Separates a repeated declaration name from its number: `Status` → `Status_2`. */\nconst DECLARATION_NUMBER_SEPARATOR = \"_\";\n\n/**\n * The first of `Name_2`, `Name_3`, … that `taken` does not hold: the suffix `--root-types` uses for\n * its own conflicts, and every other declaration that must give way to another name.\n */\nexport function freeNumberedName(name: string, taken: ReadonlySet<string>): string {\n  let count = 2;\n  while (taken.has(`${name}${DECLARATION_NUMBER_SEPARATOR}${count}`)) {\n    count += 1;\n  }\n  return `${name}${DECLARATION_NUMBER_SEPARATOR}${count}`;\n}\n"],"names":[],"mappings":";;AAOO,SAAS,mBAAA,CAAoB,OAA0B,QAAA,EAAkC;AAC9F,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,KAAK,CAAA;AAC7B,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AACzB,IAAA,IAAI,MAAA,GAAS,IAAA;AACb,IAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,CAAM,IAAI,MAAM,CAAA,EAAG,SAAS,CAAA,EAAG;AACjD,MAAA,MAAM,SAAA,GAAY,QAAA,CAAS,IAAA,EAAM,KAAK,CAAA;AACtC,MAAA,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,GAAI,MAAA,GAAS,SAAA;AAAA,IAC7C;AACA,IAAA,KAAA,CAAM,IAAI,MAAM,CAAA;AAChB,IAAA,OAAO,MAAA;AAAA,EACT,CAAC,CAAA;AACH;AAGA,MAAM,4BAAA,GAA+B,GAAA;AAM9B,SAAS,gBAAA,CAAiB,MAAc,KAAA,EAAoC;AACjF,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,OAAO,KAAA,CAAM,IAAI,CAAA,EAAG,IAAI,GAAG,4BAA4B,CAAA,EAAG,KAAK,CAAA,CAAE,CAAA,EAAG;AAClE,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,OAAO,CAAA,EAAG,IAAI,CAAA,EAAG,4BAA4B,GAAG,KAAK,CAAA,CAAA;AACvD;;;"}

package/dist/application/transform/numbered-names.mjs

@@ -11,6 +11,14 @@ function withNumberedRepeats(names, numbered) {
     return unique;
   });
 }
+const DECLARATION_NUMBER_SEPARATOR = "_";
+function freeNumberedName(name, taken) {
+  let count = 2;
+  while (taken.has(`${name}${DECLARATION_NUMBER_SEPARATOR}${count}`)) {
+    count += 1;
+  }
+  return `${name}${DECLARATION_NUMBER_SEPARATOR}${count}`;
+}
 
-export { withNumberedRepeats };
+export { freeNumberedName, withNumberedRepeats };
 //# sourceMappingURL=numbered-names.mjs.map

package/dist/application/transform/numbered-names.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"numbered-names.mjs","sources":["../../../src/application/transform/numbered-names.ts"],"sourcesContent":["/** Builds the name for the `count`-th use of `name` (2, 3…). */\nexport type NumberedName = (name: string, count: number) => string;\n\n/**\n * Names made unique, in order: the first use of a name keeps it, each repeat gets the lowest\n * number from 2 whose name is not written anywhere in the list.\n */\nexport function withNumberedRepeats(names: readonly string[], numbered: NumberedName): string[] {\n  const written = new Set(names);\n  const taken = new Set<string>();\n  return names.map((name) => {\n    let unique = name;\n    for (let count = 2; taken.has(unique); count += 1) {\n      const candidate = numbered(name, count);\n      unique = written.has(candidate) ? unique : candidate;\n    }\n    taken.add(unique);\n    return unique;\n  });\n}\n"],"names":[],"mappings":"AAOO,SAAS,mBAAA,CAAoB,OAA0B,QAAA,EAAkC;AAC9F,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,KAAK,CAAA;AAC7B,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AACzB,IAAA,IAAI,MAAA,GAAS,IAAA;AACb,IAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,CAAM,IAAI,MAAM,CAAA,EAAG,SAAS,CAAA,EAAG;AACjD,MAAA,MAAM,SAAA,GAAY,QAAA,CAAS,IAAA,EAAM,KAAK,CAAA;AACtC,MAAA,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,GAAI,MAAA,GAAS,SAAA;AAAA,IAC7C;AACA,IAAA,KAAA,CAAM,IAAI,MAAM,CAAA;AAChB,IAAA,OAAO,MAAA;AAAA,EACT,CAAC,CAAA;AACH;;"}
+{"version":3,"file":"numbered-names.mjs","sources":["../../../src/application/transform/numbered-names.ts"],"sourcesContent":["/** Builds the name for the `count`-th use of `name` (2, 3…). */\nexport type NumberedName = (name: string, count: number) => string;\n\n/**\n * Names made unique, in order: the first use of a name keeps it, each repeat gets the lowest\n * number from 2 whose name is not written anywhere in the list.\n */\nexport function withNumberedRepeats(names: readonly string[], numbered: NumberedName): string[] {\n  const written = new Set(names);\n  const taken = new Set<string>();\n  return names.map((name) => {\n    let unique = name;\n    for (let count = 2; taken.has(unique); count += 1) {\n      const candidate = numbered(name, count);\n      unique = written.has(candidate) ? unique : candidate;\n    }\n    taken.add(unique);\n    return unique;\n  });\n}\n\n/** Separates a repeated declaration name from its number: `Status` → `Status_2`. */\nconst DECLARATION_NUMBER_SEPARATOR = \"_\";\n\n/**\n * The first of `Name_2`, `Name_3`, … that `taken` does not hold: the suffix `--root-types` uses for\n * its own conflicts, and every other declaration that must give way to another name.\n */\nexport function freeNumberedName(name: string, taken: ReadonlySet<string>): string {\n  let count = 2;\n  while (taken.has(`${name}${DECLARATION_NUMBER_SEPARATOR}${count}`)) {\n    count += 1;\n  }\n  return `${name}${DECLARATION_NUMBER_SEPARATOR}${count}`;\n}\n"],"names":[],"mappings":"AAOO,SAAS,mBAAA,CAAoB,OAA0B,QAAA,EAAkC;AAC9F,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,KAAK,CAAA;AAC7B,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AACzB,IAAA,IAAI,MAAA,GAAS,IAAA;AACb,IAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,CAAM,IAAI,MAAM,CAAA,EAAG,SAAS,CAAA,EAAG;AACjD,MAAA,MAAM,SAAA,GAAY,QAAA,CAAS,IAAA,EAAM,KAAK,CAAA;AACtC,MAAA,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,GAAI,MAAA,GAAS,SAAA;AAAA,IAC7C;AACA,IAAA,KAAA,CAAM,IAAI,MAAM,CAAA;AAChB,IAAA,OAAO,MAAA;AAAA,EACT,CAAC,CAAA;AACH;AAGA,MAAM,4BAAA,GAA+B,GAAA;AAM9B,SAAS,gBAAA,CAAiB,MAAc,KAAA,EAAoC;AACjF,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,OAAO,KAAA,CAAM,IAAI,CAAA,EAAG,IAAI,GAAG,4BAA4B,CAAA,EAAG,KAAK,CAAA,CAAE,CAAA,EAAG;AAClE,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,OAAO,CAAA,EAAG,IAAI,CAAA,EAAG,4BAA4B,GAAG,KAAK,CAAA,CAAA;AACvD;;"}

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

@@ -129,7 +129,7 @@ function walkTo(ref, refs, seen) {
 function generatedLocationOf(ref, refs) {
   const walk = walkTo(ref, refs, []);
   return {
-    path: walk === null ? ref : jsonPointer.createRef(walk.path),
+    path: walk === null ? ref : jsonPointer.appendPointer(jsonPointer.ROOT_POINTER, walk.path),
     isFromAdditionalProperties: walk?.isFromAdditionalProperties ?? false
   };
 }