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

package/dist/application/transform/footer/enum-values-check.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"enum-values-check.mjs","sources":["../../../../src/application/transform/footer/enum-values-check.ts"],"sourcesContent":["import { irArray, irReadonly, irReference } from \"../../../domain/ir/constructors.js\";\nimport type { IrConstArrayDeclaration, IrDeclaration, IrType } from \"../../../domain/ir/nodes.js\";\nimport { HELPER_TYPES } from \"../helper-types.js\";\nimport { literalType } from \"../literal-type.js\";\nimport { unionOf } from \"../type-combinators.js\";\nimport { type Evaluated, type Evaluation, NEVER } from \"./evaluation.js\";\nimport { TypeEvaluator } from \"./type-evaluation.js\";\n\n/**\n * `--enum-values` arrays are typed by the location of their schema in the generated types\n * (`FlattenedDeepRequired<components>[\"schemas\"][\"A\"][\"status\"]`). Where that type surely does not\n * hold the values (ADR-027), the array is typed by its own values instead, so it compiles:\n * - the location indexes a key the generated type does not have (`definitions`, `allOf`, a\n *   property of `unknown`), or\n * - the type there does not admit a listed value (an `allOf` of different enums, a discriminator\n *   value the property enum does not list, an array next to other `anyOf` members).\n * Everything else stays as it was.\n */\n\n/** Why an array got its own values as its type. */\nexport type EnumValuesRetype =\n  /** The location's type admits only other values, or none: the document contradicts itself. */\n  | { readonly kind: \"excluded\"; readonly name: string; readonly excluded: readonly unknown[] }\n  /** The location could not be typed; nothing to report, the array is right now. */\n  | { readonly kind: \"untyped\"; readonly name: string };\n\ntype Admission = \"yes\" | \"no\" | \"opaque\";\n\nfunction literalAdmission(type: IrType, value: string | number): Admission {\n  switch (type.kind) {\n    case \"stringLiteral\":\n    case \"numberLiteral\":\n      return type.value === value ? \"yes\" : \"no\";\n    case \"booleanLiteral\":\n      return \"no\";\n    case \"keyword\":\n      if (type.keyword === \"unknown\") {\n        return \"yes\";\n      }\n      return type.keyword === typeof value ? \"yes\" : \"no\";\n    case \"object\":\n      // `{}` (as in `string & {}`) admits every value but `null` and `undefined`.\n      return type.members.length === 0 ? \"yes\" : \"no\";\n    case \"array\":\n      return \"no\";\n    default:\n      return \"opaque\";\n  }\n}\n\nfunction admission(evaluator: TypeEvaluator, value: Evaluated, item: string | number): Admission {\n  const { type } = value;\n  if (type.kind === \"union\" || type.kind === \"intersection\") {\n    const parts = type.types.map((part) => {\n      const expanded = evaluator.expand({ ...value, type: part });\n      return expanded.kind === \"type\" ? admission(evaluator, expanded, item) : \"opaque\";\n    });\n    // A union admits a value one member admits; an intersection excludes one a part excludes.\n    const decisive: Admission = type.kind === \"union\" ? \"yes\" : \"no\";\n    if (parts.includes(decisive)) {\n      return decisive;\n    }\n    return parts.includes(\"opaque\") ? \"opaque\" : decisive === \"yes\" ? \"no\" : \"yes\";\n  }\n  return literalAdmission(type, item);\n}\n\n/** `ReadonlyArray<T>`: an array type `T` is the array itself, so its elements are checked. */\nfunction elementOf(evaluator: TypeEvaluator, value: Evaluated): Evaluation {\n  const members = evaluator.membersOf(value);\n  const elements = members.map((member) =>\n    member.kind === \"type\" && member.type.kind === \"array\" ? member.type.element : null,\n  );\n  if (members.length === 0 || elements.some((element) => element === null)) {\n    return value;\n  }\n  return evaluator.expand({ ...value, type: unionOf(elements as IrType[]) });\n}\n\nconst LITERAL_KINDS: ReadonlySet<string> = new Set([\n  \"stringLiteral\",\n  \"numberLiteral\",\n  \"booleanLiteral\",\n]);\n\n/** Whether a type is made of literals only (or `never`): a finite set of values. */\nfunction isFiniteType(evaluator: TypeEvaluator, value: Evaluated): boolean {\n  const { type } = value;\n  if (type.kind === \"union\" || type.kind === \"intersection\") {\n    return type.types.every((part) => {\n      const expanded = evaluator.expand({ ...value, type: part });\n      return expanded.kind === \"type\" && isFiniteType(evaluator, expanded);\n    });\n  }\n  return LITERAL_KINDS.has(type.kind) || (type.kind === \"keyword\" && type.keyword === \"never\");\n}\n\nfunction locationType(declaration: IrConstArrayDeclaration): IrType | null {\n  const { type } = declaration;\n  const isTyped = type.kind === \"reference\" && type.name === HELPER_TYPES.readonlyArray.name;\n  return isTyped ? (type.typeArguments[0] ?? null) : null;\n}\n\nfunction retypeOf(\n  evaluator: TypeEvaluator,\n  declaration: IrConstArrayDeclaration,\n): EnumValuesRetype | null {\n  const location = locationType(declaration);\n  const evaluated = location === null ? null : evaluator.evaluate(location);\n  if (evaluated === null || evaluated.kind === \"opaque\") {\n    return null;\n  }\n  if (evaluated.kind === \"missing\") {\n    return { kind: \"untyped\", name: declaration.name };\n  }\n  const element = elementOf(evaluator, evaluated);\n  if (element.kind !== \"type\") {\n    return element.kind === \"missing\" ? { kind: \"untyped\", name: declaration.name } : null;\n  }\n  if (declaration.values.length === 0 && isNever(element.type)) {\n    // The `ReadonlyArray` helper of `never` is `never` (`never` extends an array): not even `[]`.\n    return { kind: \"untyped\", name: declaration.name };\n  }\n  const results = declaration.values.map((value) => admission(evaluator, element, value));\n  if (!results.includes(\"no\")) {\n    return null;\n  }\n  if (!isFiniteType(evaluator, element)) {\n    return { kind: \"untyped\", name: declaration.name };\n  }\n  const excluded = declaration.values.filter((_, index) => results[index] === \"no\");\n  return { kind: \"excluded\", name: declaration.name, excluded };\n}\n\nfunction isNever(type: IrType): boolean {\n  return type.kind === \"keyword\" && type.keyword === \"never\";\n}\n\n/** The values' own type; with no values `readonly never[]` (`ReadonlyArray<never>` is never). */\nfunction ownValuesType(declaration: IrConstArrayDeclaration): IrType {\n  if (declaration.values.length === 0) {\n    return irReadonly(irArray(NEVER));\n  }\n  const values = unionOf(declaration.values.map((value) => literalType(value)));\n  return irReference(HELPER_TYPES.readonlyArray.name, [values]);\n}\n\n/**\n * The footer with each `--enum-values` array whose location type does not hold its values typed\n * by its own values, and why each one changed. `declarations` are the document's types.\n */\nexport function checkedEnumValues<T>(\n  footer: readonly (T | IrDeclaration)[],\n  declarations: readonly IrDeclaration[],\n  isDeclaration: (entry: T | IrDeclaration) => entry is IrDeclaration,\n): { footer: (T | IrDeclaration)[]; retyped: EnumValuesRetype[] } {\n  const evaluator = new TypeEvaluator([...declarations, ...footer.filter(isDeclaration)]);\n  const retyped: EnumValuesRetype[] = [];\n  const checked = footer.map((entry) => {\n    if (!isDeclaration(entry) || entry.kind !== \"constArray\") {\n      return entry;\n    }\n    const retype = retypeOf(evaluator, entry);\n    if (retype === null) {\n      return entry;\n    }\n    retyped.push(retype);\n    return { ...entry, type: ownValuesType(entry) };\n  });\n  return { footer: checked, retyped };\n}\n"],"names":[],"mappings":";;;;;;;AA4BA,SAAS,gBAAA,CAAiB,MAAc,KAAA,EAAmC;AACzE,EAAA,QAAQ,KAAK,IAAA;AAAM,IACjB,KAAK,eAAA;AAAA,IACL,KAAK,eAAA;AACH,MAAA,OAAO,IAAA,CAAK,KAAA,KAAU,KAAA,GAAQ,KAAA,GAAQ,IAAA;AAAA,IACxC,KAAK,gBAAA;AACH,MAAA,OAAO,IAAA;AAAA,IACT,KAAK,SAAA;AACH,MAAA,IAAI,IAAA,CAAK,YAAY,SAAA,EAAW;AAC9B,QAAA,OAAO,KAAA;AAAA,MACT;AACA,MAAA,OAAO,IAAA,CAAK,OAAA,KAAY,OAAO,KAAA,GAAQ,KAAA,GAAQ,IAAA;AAAA,IACjD,KAAK,QAAA;AAEH,MAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,MAAA,KAAW,CAAA,GAAI,KAAA,GAAQ,IAAA;AAAA,IAC7C,KAAK,OAAA;AACH,MAAA,OAAO,IAAA;AAAA,IACT;AACE,MAAA,OAAO,QAAA;AAAA;AAEb;AAEA,SAAS,SAAA,CAAU,SAAA,EAA0B,KAAA,EAAkB,IAAA,EAAkC;AAC/F,EAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,OAAA,IAAW,IAAA,CAAK,SAAS,cAAA,EAAgB;AACzD,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AACrC,MAAA,MAAM,QAAA,GAAW,UAAU,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,MAAM,CAAA;AAC1D,MAAA,OAAO,SAAS,IAAA,KAAS,MAAA,GAAS,UAAU,SAAA,EAAW,QAAA,EAAU,IAAI,CAAA,GAAI,QAAA;AAAA,IAC3E,CAAC,CAAA;AAED,IAAA,MAAM,QAAA,GAAsB,IAAA,CAAK,IAAA,KAAS,OAAA,GAAU,KAAA,GAAQ,IAAA;AAC5D,IAAA,IAAI,KAAA,CAAM,QAAA,CAAS,QAAQ,CAAA,EAAG;AAC5B,MAAA,OAAO,QAAA;AAAA,IACT;AACA,IAAA,OAAO,MAAM,QAAA,CAAS,QAAQ,IAAI,QAAA,GAAW,QAAA,KAAa,QAAQ,IAAA,GAAO,KAAA;AAAA,EAC3E;AACA,EAAA,OAAO,gBAAA,CAAiB,MAAM,IAAI,CAAA;AACpC;AAGA,SAAS,SAAA,CAAU,WAA0B,KAAA,EAA8B;AACzE,EAAA,MAAM,OAAA,GAAU,SAAA,CAAU,SAAA,CAAU,KAAK,CAAA;AACzC,EAAA,MAAM,WAAW,OAAA,CAAQ,GAAA;AAAA,IAAI,CAAC,MAAA,KAC5B,MAAA,CAAO,IAAA,KAAS,MAAA,IAAU,MAAA,CAAO,IAAA,CAAK,IAAA,KAAS,OAAA,GAAU,MAAA,CAAO,IAAA,CAAK,OAAA,GAAU;AAAA,GACjF;AACA,EAAA,IAAI,OAAA,CAAQ,WAAW,CAAA,IAAK,QAAA,CAAS,KAAK,CAAC,OAAA,KAAY,OAAA,KAAY,IAAI,CAAA,EAAG;AACxE,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,OAAO,SAAA,CAAU,OAAO,EAAE,GAAG,OAAO,IAAA,EAAM,OAAA,CAAQ,QAAoB,CAAA,EAAG,CAAA;AAC3E;AAEA,MAAM,aAAA,uBAAyC,GAAA,CAAI;AAAA,EACjD,eAAA;AAAA,EACA,eAAA;AAAA,EACA;AACF,CAAC,CAAA;AAGD,SAAS,YAAA,CAAa,WAA0B,KAAA,EAA2B;AACzE,EAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,OAAA,IAAW,IAAA,CAAK,SAAS,cAAA,EAAgB;AACzD,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,CAAC,IAAA,KAAS;AAChC,MAAA,MAAM,QAAA,GAAW,UAAU,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,MAAM,CAAA;AAC1D,MAAA,OAAO,QAAA,CAAS,IAAA,KAAS,MAAA,IAAU,YAAA,CAAa,WAAW,QAAQ,CAAA;AAAA,IACrE,CAAC,CAAA;AAAA,EACH;AACA,EAAA,OAAO,aAAA,CAAc,IAAI,IAAA,CAAK,IAAI,KAAM,IAAA,CAAK,IAAA,KAAS,SAAA,IAAa,IAAA,CAAK,OAAA,KAAY,OAAA;AACtF;AAEA,SAAS,aAAa,WAAA,EAAqD;AACzE,EAAA,MAAM,EAAE,MAAK,GAAI,WAAA;AACjB,EAAA,MAAM,UAAU,IAAA,CAAK,IAAA,KAAS,eAAe,IAAA,CAAK,IAAA,KAAS,aAAa,aAAA,CAAc,IAAA;AACtF,EAAA,OAAO,OAAA,GAAW,IAAA,CAAK,aAAA,CAAc,CAAC,KAAK,IAAA,GAAQ,IAAA;AACrD;AAEA,SAAS,QAAA,CACP,WACA,WAAA,EACyB;AACzB,EAAA,MAAM,QAAA,GAAW,aAAa,WAAW,CAAA;AACzC,EAAA,MAAM,YAAY,QAAA,KAAa,IAAA,GAAO,IAAA,GAAO,SAAA,CAAU,SAAS,QAAQ,CAAA;AACxE,EAAA,IAAI,SAAA,KAAc,IAAA,IAAQ,SAAA,CAAU,IAAA,KAAS,QAAA,EAAU;AACrD,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,SAAA,CAAU,SAAS,SAAA,EAAW;AAChC,IAAA,OAAO,EAAE,IAAA,EAAM,SAAA,EAAW,IAAA,EAAM,YAAY,IAAA,EAAK;AAAA,EACnD;AACA,EAAA,MAAM,OAAA,GAAU,SAAA,CAAU,SAAA,EAAW,SAAS,CAAA;AAC9C,EAAA,IAAI,OAAA,CAAQ,SAAS,MAAA,EAAQ;AAC3B,IAAA,OAAO,OAAA,CAAQ,SAAS,SAAA,GAAY,EAAE,MAAM,SAAA,EAAW,IAAA,EAAM,WAAA,CAAY,IAAA,EAAK,GAAI,IAAA;AAAA,EACpF;AACA,EAAA,IAAI,YAAY,MAAA,CAAO,MAAA,KAAW,KAAK,OAAA,CAAQ,OAAA,CAAQ,IAAI,CAAA,EAAG;AAE5D,IAAA,OAAO,EAAE,IAAA,EAAM,SAAA,EAAW,IAAA,EAAM,YAAY,IAAA,EAAK;AAAA,EACnD;AACA,EAAA,MAAM,OAAA,GAAU,WAAA,CAAY,MAAA,CAAO,GAAA,CAAI,CAAC,UAAU,SAAA,CAAU,SAAA,EAAW,OAAA,EAAS,KAAK,CAAC,CAAA;AACtF,EAAA,IAAI,CAAC,OAAA,CAAQ,QAAA,CAAS,IAAI,CAAA,EAAG;AAC3B,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,CAAC,YAAA,CAAa,SAAA,EAAW,OAAO,CAAA,EAAG;AACrC,IAAA,OAAO,EAAE,IAAA,EAAM,SAAA,EAAW,IAAA,EAAM,YAAY,IAAA,EAAK;AAAA,EACnD;AACA,EAAA,MAAM,QAAA,GAAW,WAAA,CAAY,MAAA,CAAO,MAAA,CAAO,CAAC,GAAG,KAAA,KAAU,OAAA,CAAQ,KAAK,CAAA,KAAM,IAAI,CAAA;AAChF,EAAA,OAAO,EAAE,IAAA,EAAM,UAAA,EAAY,IAAA,EAAM,WAAA,CAAY,MAAM,QAAA,EAAS;AAC9D;AAEA,SAAS,QAAQ,IAAA,EAAuB;AACtC,EAAA,OAAO,IAAA,CAAK,IAAA,KAAS,SAAA,IAAa,IAAA,CAAK,OAAA,KAAY,OAAA;AACrD;AAGA,SAAS,cAAc,WAAA,EAA8C;AACnE,EAAA,IAAI,WAAA,CAAY,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG;AACnC,IAAA,OAAO,UAAA,CAAW,OAAA,CAAQ,KAAK,CAAC,CAAA;AAAA,EAClC;AACA,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,WAAA,CAAY,MAAA,CAAO,GAAA,CAAI,CAAC,KAAA,KAAU,WAAA,CAAY,KAAK,CAAC,CAAC,CAAA;AAC5E,EAAA,OAAO,YAAY,YAAA,CAAa,aAAA,CAAc,IAAA,EAAM,CAAC,MAAM,CAAC,CAAA;AAC9D;AAMO,SAAS,iBAAA,CACd,MAAA,EACA,YAAA,EACA,aAAA,EACgE;AAChE,EAAA,MAAM,SAAA,GAAY,IAAI,aAAA,CAAc,CAAC,GAAG,YAAA,EAAc,GAAG,MAAA,CAAO,MAAA,CAAO,aAAa,CAAC,CAAC,CAAA;AACtF,EAAA,MAAM,UAA8B,EAAC;AACrC,EAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,CAAC,KAAA,KAAU;AACpC,IAAA,IAAI,CAAC,aAAA,CAAc,KAAK,CAAA,IAAK,KAAA,CAAM,SAAS,YAAA,EAAc;AACxD,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,MAAM,MAAA,GAAS,QAAA,CAAS,SAAA,EAAW,KAAK,CAAA;AACxC,IAAA,IAAI,WAAW,IAAA,EAAM;AACnB,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,OAAA,CAAQ,KAAK,MAAM,CAAA;AACnB,IAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,aAAA,CAAc,KAAK,CAAA,EAAE;AAAA,EAChD,CAAC,CAAA;AACD,EAAA,OAAO,EAAE,MAAA,EAAQ,OAAA,EAAS,OAAA,EAAQ;AACpC;;"}

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

@@ -0,0 +1,42 @@
+'use strict';
+
+const MISSING = { kind: "missing" };
+const OPAQUE = { kind: "opaque" };
+const NEVER = { kind: "keyword", keyword: "never" };
+function unionType(types) {
+  if (types.length === 1) {
+    return types[0];
+  }
+  return types.length === 0 ? NEVER : { kind: "union", types };
+}
+function intersectionType(types) {
+  return types.length === 1 ? types[0] : { kind: "intersection", types };
+}
+const NULLISH = /* @__PURE__ */ new Set(["null", "undefined"]);
+function isNullish(type) {
+  return type.kind === "keyword" && NULLISH.has(type.keyword);
+}
+function propertyKey(name) {
+  return name.kind === "string" ? name.value : name.text;
+}
+function isKeyword(member, keyword) {
+  return member.kind === "type" && member.type.kind === "keyword" && member.type.keyword === keyword;
+}
+function absorbed(members) {
+  const any = members.find((member) => isKeyword(member, "any"));
+  const unknown = members.find((member) => isKeyword(member, "unknown"));
+  if (any !== void 0 || unknown === void 0) {
+    return any === void 0 ? members : [any];
+  }
+  return members.some((member) => member.kind !== "type") ? [OPAQUE] : [unknown];
+}
+
+exports.MISSING = MISSING;
+exports.NEVER = NEVER;
+exports.OPAQUE = OPAQUE;
+exports.absorbed = absorbed;
+exports.intersectionType = intersectionType;
+exports.isNullish = isNullish;
+exports.propertyKey = propertyKey;
+exports.unionType = unionType;
+//# sourceMappingURL=evaluation.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"evaluation.cjs","sources":["../../../../src/application/transform/footer/evaluation.ts"],"sourcesContent":["import type { IrPropertyName, IrType } from \"../../../domain/ir/nodes.js\";\n\n/** The values the evaluator of the `--enum-values` check works with (ADR-027). */\n\n/** A type as evaluated: `deep` is set inside `FlattenedDeepRequired`. */\nexport interface Evaluated {\n  readonly kind: \"type\";\n  readonly type: IrType;\n  readonly deep: boolean;\n}\n\nexport type Evaluation = Evaluated | { readonly kind: \"missing\" } | { readonly kind: \"opaque\" };\n\nexport const MISSING: Evaluation = { kind: \"missing\" };\nexport const OPAQUE: Evaluation = { kind: \"opaque\" };\n\nexport const NEVER: IrType = { kind: \"keyword\", keyword: \"never\" };\n\nexport function unionType(types: readonly IrType[]): IrType {\n  if (types.length === 1) {\n    return types[0] as IrType;\n  }\n  return types.length === 0 ? NEVER : { kind: \"union\", types };\n}\n\nexport function intersectionType(types: readonly IrType[]): IrType {\n  return types.length === 1 ? (types[0] as IrType) : { kind: \"intersection\", types };\n}\n\nconst NULLISH: ReadonlySet<string> = new Set([\"null\", \"undefined\"]);\n\nexport function isNullish(type: IrType): boolean {\n  return type.kind === \"keyword\" && NULLISH.has(type.keyword);\n}\n\nexport function propertyKey(name: IrPropertyName): string {\n  return name.kind === \"string\" ? name.value : name.text;\n}\n\nfunction isKeyword(member: Evaluation, keyword: string): boolean {\n  return (\n    member.kind === \"type\" && member.type.kind === \"keyword\" && member.type.keyword === keyword\n  );\n}\n\n/**\n * Union members as TypeScript reduces them: `any` absorbs every member, `unknown` every member\n * but `any`, so `{ a: X } | unknown` is `unknown`. An opaque member may be `any`.\n */\nexport function absorbed(members: readonly Evaluation[]): readonly Evaluation[] {\n  const any = members.find((member) => isKeyword(member, \"any\"));\n  const unknown = members.find((member) => isKeyword(member, \"unknown\"));\n  if (any !== undefined || unknown === undefined) {\n    return any === undefined ? members : [any];\n  }\n  return members.some((member) => member.kind !== \"type\") ? [OPAQUE] : [unknown];\n}\n"],"names":[],"mappings":";;AAaO,MAAM,OAAA,GAAsB,EAAE,IAAA,EAAM,SAAA;AACpC,MAAM,MAAA,GAAqB,EAAE,IAAA,EAAM,QAAA;AAEnC,MAAM,KAAA,GAAgB,EAAE,IAAA,EAAM,SAAA,EAAW,SAAS,OAAA;AAElD,SAAS,UAAU,KAAA,EAAkC;AAC1D,EAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACtB,IAAA,OAAO,MAAM,CAAC,CAAA;AAAA,EAChB;AACA,EAAA,OAAO,MAAM,MAAA,KAAW,CAAA,GAAI,QAAQ,EAAE,IAAA,EAAM,SAAS,KAAA,EAAM;AAC7D;AAEO,SAAS,iBAAiB,KAAA,EAAkC;AACjE,EAAA,OAAO,KAAA,CAAM,WAAW,CAAA,GAAK,KAAA,CAAM,CAAC,CAAA,GAAe,EAAE,IAAA,EAAM,cAAA,EAAgB,KAAA,EAAM;AACnF;AAEA,MAAM,0BAA+B,IAAI,GAAA,CAAI,CAAC,MAAA,EAAQ,WAAW,CAAC,CAAA;AAE3D,SAAS,UAAU,IAAA,EAAuB;AAC/C,EAAA,OAAO,KAAK,IAAA,KAAS,SAAA,IAAa,OAAA,CAAQ,GAAA,CAAI,KAAK,OAAO,CAAA;AAC5D;AAEO,SAAS,YAAY,IAAA,EAA8B;AACxD,EAAA,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,GAAW,IAAA,CAAK,QAAQ,IAAA,CAAK,IAAA;AACpD;AAEA,SAAS,SAAA,CAAU,QAAoB,OAAA,EAA0B;AAC/D,EAAA,OACE,MAAA,CAAO,SAAS,MAAA,IAAU,MAAA,CAAO,KAAK,IAAA,KAAS,SAAA,IAAa,MAAA,CAAO,IAAA,CAAK,OAAA,KAAY,OAAA;AAExF;AAMO,SAAS,SAAS,OAAA,EAAuD;AAC9E,EAAA,MAAM,GAAA,GAAM,QAAQ,IAAA,CAAK,CAAC,WAAW,SAAA,CAAU,MAAA,EAAQ,KAAK,CAAC,CAAA;AAC7D,EAAA,MAAM,OAAA,GAAU,QAAQ,IAAA,CAAK,CAAC,WAAW,SAAA,CAAU,MAAA,EAAQ,SAAS,CAAC,CAAA;AACrE,EAAA,IAAI,GAAA,KAAQ,MAAA,IAAa,OAAA,KAAY,MAAA,EAAW;AAC9C,IAAA,OAAO,GAAA,KAAQ,MAAA,GAAY,OAAA,GAAU,CAAC,GAAG,CAAA;AAAA,EAC3C;AACA,EAAA,OAAO,OAAA,CAAQ,IAAA,CAAK,CAAC,MAAA,KAAW,MAAA,CAAO,IAAA,KAAS,MAAM,CAAA,GAAI,CAAC,MAAM,CAAA,GAAI,CAAC,OAAO,CAAA;AAC/E;;;;;;;;;"}

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

@@ -0,0 +1,33 @@
+const MISSING = { kind: "missing" };
+const OPAQUE = { kind: "opaque" };
+const NEVER = { kind: "keyword", keyword: "never" };
+function unionType(types) {
+  if (types.length === 1) {
+    return types[0];
+  }
+  return types.length === 0 ? NEVER : { kind: "union", types };
+}
+function intersectionType(types) {
+  return types.length === 1 ? types[0] : { kind: "intersection", types };
+}
+const NULLISH = /* @__PURE__ */ new Set(["null", "undefined"]);
+function isNullish(type) {
+  return type.kind === "keyword" && NULLISH.has(type.keyword);
+}
+function propertyKey(name) {
+  return name.kind === "string" ? name.value : name.text;
+}
+function isKeyword(member, keyword) {
+  return member.kind === "type" && member.type.kind === "keyword" && member.type.keyword === keyword;
+}
+function absorbed(members) {
+  const any = members.find((member) => isKeyword(member, "any"));
+  const unknown = members.find((member) => isKeyword(member, "unknown"));
+  if (any !== void 0 || unknown === void 0) {
+    return any === void 0 ? members : [any];
+  }
+  return members.some((member) => member.kind !== "type") ? [OPAQUE] : [unknown];
+}
+
+export { MISSING, NEVER, OPAQUE, absorbed, intersectionType, isNullish, propertyKey, unionType };
+//# sourceMappingURL=evaluation.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"evaluation.mjs","sources":["../../../../src/application/transform/footer/evaluation.ts"],"sourcesContent":["import type { IrPropertyName, IrType } from \"../../../domain/ir/nodes.js\";\n\n/** The values the evaluator of the `--enum-values` check works with (ADR-027). */\n\n/** A type as evaluated: `deep` is set inside `FlattenedDeepRequired`. */\nexport interface Evaluated {\n  readonly kind: \"type\";\n  readonly type: IrType;\n  readonly deep: boolean;\n}\n\nexport type Evaluation = Evaluated | { readonly kind: \"missing\" } | { readonly kind: \"opaque\" };\n\nexport const MISSING: Evaluation = { kind: \"missing\" };\nexport const OPAQUE: Evaluation = { kind: \"opaque\" };\n\nexport const NEVER: IrType = { kind: \"keyword\", keyword: \"never\" };\n\nexport function unionType(types: readonly IrType[]): IrType {\n  if (types.length === 1) {\n    return types[0] as IrType;\n  }\n  return types.length === 0 ? NEVER : { kind: \"union\", types };\n}\n\nexport function intersectionType(types: readonly IrType[]): IrType {\n  return types.length === 1 ? (types[0] as IrType) : { kind: \"intersection\", types };\n}\n\nconst NULLISH: ReadonlySet<string> = new Set([\"null\", \"undefined\"]);\n\nexport function isNullish(type: IrType): boolean {\n  return type.kind === \"keyword\" && NULLISH.has(type.keyword);\n}\n\nexport function propertyKey(name: IrPropertyName): string {\n  return name.kind === \"string\" ? name.value : name.text;\n}\n\nfunction isKeyword(member: Evaluation, keyword: string): boolean {\n  return (\n    member.kind === \"type\" && member.type.kind === \"keyword\" && member.type.keyword === keyword\n  );\n}\n\n/**\n * Union members as TypeScript reduces them: `any` absorbs every member, `unknown` every member\n * but `any`, so `{ a: X } | unknown` is `unknown`. An opaque member may be `any`.\n */\nexport function absorbed(members: readonly Evaluation[]): readonly Evaluation[] {\n  const any = members.find((member) => isKeyword(member, \"any\"));\n  const unknown = members.find((member) => isKeyword(member, \"unknown\"));\n  if (any !== undefined || unknown === undefined) {\n    return any === undefined ? members : [any];\n  }\n  return members.some((member) => member.kind !== \"type\") ? [OPAQUE] : [unknown];\n}\n"],"names":[],"mappings":"AAaO,MAAM,OAAA,GAAsB,EAAE,IAAA,EAAM,SAAA;AACpC,MAAM,MAAA,GAAqB,EAAE,IAAA,EAAM,QAAA;AAEnC,MAAM,KAAA,GAAgB,EAAE,IAAA,EAAM,SAAA,EAAW,SAAS,OAAA;AAElD,SAAS,UAAU,KAAA,EAAkC;AAC1D,EAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACtB,IAAA,OAAO,MAAM,CAAC,CAAA;AAAA,EAChB;AACA,EAAA,OAAO,MAAM,MAAA,KAAW,CAAA,GAAI,QAAQ,EAAE,IAAA,EAAM,SAAS,KAAA,EAAM;AAC7D;AAEO,SAAS,iBAAiB,KAAA,EAAkC;AACjE,EAAA,OAAO,KAAA,CAAM,WAAW,CAAA,GAAK,KAAA,CAAM,CAAC,CAAA,GAAe,EAAE,IAAA,EAAM,cAAA,EAAgB,KAAA,EAAM;AACnF;AAEA,MAAM,0BAA+B,IAAI,GAAA,CAAI,CAAC,MAAA,EAAQ,WAAW,CAAC,CAAA;AAE3D,SAAS,UAAU,IAAA,EAAuB;AAC/C,EAAA,OAAO,KAAK,IAAA,KAAS,SAAA,IAAa,OAAA,CAAQ,GAAA,CAAI,KAAK,OAAO,CAAA;AAC5D;AAEO,SAAS,YAAY,IAAA,EAA8B;AACxD,EAAA,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,GAAW,IAAA,CAAK,QAAQ,IAAA,CAAK,IAAA;AACpD;AAEA,SAAS,SAAA,CAAU,QAAoB,OAAA,EAA0B;AAC/D,EAAA,OACE,MAAA,CAAO,SAAS,MAAA,IAAU,MAAA,CAAO,KAAK,IAAA,KAAS,SAAA,IAAa,MAAA,CAAO,IAAA,CAAK,OAAA,KAAY,OAAA;AAExF;AAMO,SAAS,SAAS,OAAA,EAAuD;AAC9E,EAAA,MAAM,GAAA,GAAM,QAAQ,IAAA,CAAK,CAAC,WAAW,SAAA,CAAU,MAAA,EAAQ,KAAK,CAAC,CAAA;AAC7D,EAAA,MAAM,OAAA,GAAU,QAAQ,IAAA,CAAK,CAAC,WAAW,SAAA,CAAU,MAAA,EAAQ,SAAS,CAAC,CAAA;AACrE,EAAA,IAAI,GAAA,KAAQ,MAAA,IAAa,OAAA,KAAY,MAAA,EAAW;AAC9C,IAAA,OAAO,GAAA,KAAQ,MAAA,GAAY,OAAA,GAAU,CAAC,GAAG,CAAA;AAAA,EAC3C;AACA,EAAA,OAAO,OAAA,CAAQ,IAAA,CAAK,CAAC,MAAA,KAAW,MAAA,CAAO,IAAA,KAAS,MAAM,CAAA,GAAI,CAAC,MAAM,CAAA,GAAI,CAAC,OAAO,CAAA;AAC/E;;"}

package/dist/application/transform/footer/shared-enum-names.cjs

@@ -0,0 +1,60 @@
+'use strict';
+
+const enumNaming = require('./enum-naming.cjs');
+
+const FIRST_SCHEMA_NAMES = { nameOf: (_key, name) => name };
+function isBetterName(candidate, other) {
+  if (candidate.isComponentSchema !== other.isComponentSchema) {
+    return candidate.isComponentSchema;
+  }
+  if (candidate.name.length !== other.name.length) {
+    return candidate.name.length < other.name.length;
+  }
+  return candidate.name < other.name;
+}
+function ranked(candidates) {
+  return [...candidates].sort((left, right) => {
+    if (left.name === right.name && left.isComponentSchema === right.isComponentSchema) {
+      return 0;
+    }
+    return isBetterName(left, right) ? -1 : 1;
+  });
+}
+class SharedEnumNameRecorder {
+  candidatesByKey = /* @__PURE__ */ new Map();
+  nameOf(key, name, request) {
+    const candidate = {
+      name: new enumNaming.EnumNaming().enumName(request.name),
+      isComponentSchema: request.isComponentSchema
+    };
+    const candidates = this.candidatesByKey.get(key);
+    if (candidates === void 0) {
+      this.candidatesByKey.set(key, [candidate]);
+    } else {
+      candidates.push(candidate);
+    }
+    return name;
+  }
+  /**
+   * The best name of each enum. Two enums whose best names are the same (two schemas that give
+   * one name) are resolved in key order: the later one takes its next name that is free.
+   */
+  chosenNames() {
+    const chosen = /* @__PURE__ */ new Map();
+    const taken = /* @__PURE__ */ new Set();
+    const keys = [...this.candidatesByKey.keys()].sort();
+    for (const key of keys) {
+      const names = ranked(this.candidatesByKey.get(key) ?? []).map(({ name: name2 }) => name2);
+      const name = names.find((candidate) => !taken.has(candidate)) ?? names[0];
+      if (name !== void 0) {
+        chosen.set(key, name);
+        taken.add(name);
+      }
+    }
+    return { nameOf: (key, name) => chosen.get(key) ?? name };
+  }
+}
+
+exports.FIRST_SCHEMA_NAMES = FIRST_SCHEMA_NAMES;
+exports.SharedEnumNameRecorder = SharedEnumNameRecorder;
+//# sourceMappingURL=shared-enum-names.cjs.map

package/dist/application/transform/footer/shared-enum-names.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"shared-enum-names.cjs","sources":["../../../../src/application/transform/footer/shared-enum-names.ts"],"sourcesContent":["import type { EnumDeclarationRequest } from \"../schema/schema-context.js\";\nimport { EnumNaming } from \"./enum-naming.js\";\n\n/**\n * How `--dedupe-enums` names the one enum that schemas with the same members share. `key` is the\n * dedupe key of the members; `name` is the name the schema gives with the run's naming state.\n */\nexport interface SharedEnumNames {\n  /** Called for every schema of the enum, in document order; returns the name to declare. */\n  nameOf(key: string, name: string, request: EnumDeclarationRequest): string;\n}\n\n/** The original: the enum takes the name of the first schema in the document. */\nexport const FIRST_SCHEMA_NAMES: SharedEnumNames = { nameOf: (_key, name) => name };\n\ninterface NameCandidate {\n  readonly name: string;\n  readonly isComponentSchema: boolean;\n}\n\n/**\n * Whether `candidate` names the enum better than `other`: a component schema that is the enum\n * itself, then the shorter name, then the earlier one in code-unit order. No part depends on the\n * document order, so adding or moving a schema changes the name only when the new one ranks first.\n */\nfunction isBetterName(candidate: NameCandidate, other: NameCandidate): boolean {\n  if (candidate.isComponentSchema !== other.isComponentSchema) {\n    return candidate.isComponentSchema;\n  }\n  if (candidate.name.length !== other.name.length) {\n    return candidate.name.length < other.name.length;\n  }\n  return candidate.name < other.name;\n}\n\n/** The candidates from best to worst. */\nfunction ranked(candidates: readonly NameCandidate[]): NameCandidate[] {\n  return [...candidates].sort((left, right) => {\n    if (left.name === right.name && left.isComponentSchema === right.isComponentSchema) {\n      return 0;\n    }\n    return isBetterName(left, right) ? -1 : 1;\n  });\n}\n\n/**\n * The `dedupe-enum-names` fix (ADR-021, upstream #1683), first pass: records every schema of each\n * shared enum and keeps the run's own names. `chosenNames` gives the names for the second pass.\n */\nexport class SharedEnumNameRecorder implements SharedEnumNames {\n  private readonly candidatesByKey = new Map<string, NameCandidate[]>();\n\n  nameOf(key: string, name: string, request: EnumDeclarationRequest): string {\n    // A fresh naming state: the run's state depends on the names built before (EnumNaming).\n    const candidate = {\n      name: new EnumNaming().enumName(request.name),\n      isComponentSchema: request.isComponentSchema,\n    };\n    const candidates = this.candidatesByKey.get(key);\n    if (candidates === undefined) {\n      this.candidatesByKey.set(key, [candidate]);\n    } else {\n      candidates.push(candidate);\n    }\n    return name;\n  }\n\n  /**\n   * The best name of each enum. Two enums whose best names are the same (two schemas that give\n   * one name) are resolved in key order: the later one takes its next name that is free.\n   */\n  chosenNames(): SharedEnumNames {\n    const chosen = new Map<string, string>();\n    const taken = new Set<string>();\n    const keys = [...this.candidatesByKey.keys()].sort();\n    for (const key of keys) {\n      const names = ranked(this.candidatesByKey.get(key) ?? []).map(({ name }) => name);\n      const name = names.find((candidate) => !taken.has(candidate)) ?? names[0];\n      if (name !== undefined) {\n        chosen.set(key, name);\n        taken.add(name);\n      }\n    }\n    return { nameOf: (key, name) => chosen.get(key) ?? name };\n  }\n}\n"],"names":["EnumNaming","name"],"mappings":";;;;AAaO,MAAM,qBAAsC,EAAE,MAAA,EAAQ,CAAC,IAAA,EAAM,SAAS,IAAA;AAY7E,SAAS,YAAA,CAAa,WAA0B,KAAA,EAA+B;AAC7E,EAAA,IAAI,SAAA,CAAU,iBAAA,KAAsB,KAAA,CAAM,iBAAA,EAAmB;AAC3D,IAAA,OAAO,SAAA,CAAU,iBAAA;AAAA,EACnB;AACA,EAAA,IAAI,SAAA,CAAU,IAAA,CAAK,MAAA,KAAW,KAAA,CAAM,KAAK,MAAA,EAAQ;AAC/C,IAAA,OAAO,SAAA,CAAU,IAAA,CAAK,MAAA,GAAS,KAAA,CAAM,IAAA,CAAK,MAAA;AAAA,EAC5C;AACA,EAAA,OAAO,SAAA,CAAU,OAAO,KAAA,CAAM,IAAA;AAChC;AAGA,SAAS,OAAO,UAAA,EAAuD;AACrE,EAAA,OAAO,CAAC,GAAG,UAAU,EAAE,IAAA,CAAK,CAAC,MAAM,KAAA,KAAU;AAC3C,IAAA,IAAI,KAAK,IAAA,KAAS,KAAA,CAAM,QAAQ,IAAA,CAAK,iBAAA,KAAsB,MAAM,iBAAA,EAAmB;AAClF,MAAA,OAAO,CAAA;AAAA,IACT;AACA,IAAA,OAAO,YAAA,CAAa,IAAA,EAAM,KAAK,CAAA,GAAI,EAAA,GAAK,CAAA;AAAA,EAC1C,CAAC,CAAA;AACH;AAMO,MAAM,sBAAA,CAAkD;AAAA,EAC5C,eAAA,uBAAsB,GAAA,EAA6B;AAAA,EAEpE,MAAA,CAAO,GAAA,EAAa,IAAA,EAAc,OAAA,EAAyC;AAEzE,IAAA,MAAM,SAAA,GAAY;AAAA,MAChB,MAAM,IAAIA,qBAAA,EAAW,CAAE,QAAA,CAAS,QAAQ,IAAI,CAAA;AAAA,MAC5C,mBAAmB,OAAA,CAAQ;AAAA,KAC7B;AACA,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA;AAC/C,IAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,MAAA,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,GAAA,EAAK,CAAC,SAAS,CAAC,CAAA;AAAA,IAC3C,CAAA,MAAO;AACL,MAAA,UAAA,CAAW,KAAK,SAAS,CAAA;AAAA,IAC3B;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAA,GAA+B;AAC7B,IAAA,MAAM,MAAA,uBAAa,GAAA,EAAoB;AACvC,IAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,IAAA,MAAM,IAAA,GAAO,CAAC,GAAG,IAAA,CAAK,gBAAgB,IAAA,EAAM,EAAE,IAAA,EAAK;AACnD,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,MAAA,MAAM,QAAQ,MAAA,CAAO,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA,IAAK,EAAE,CAAA,CAAE,IAAI,CAAC,EAAE,IAAA,EAAAC,KAAAA,OAAWA,KAAI,CAAA;AAChF,MAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,CAAK,CAAC,SAAA,KAAc,CAAC,KAAA,CAAM,GAAA,CAAI,SAAS,CAAC,CAAA,IAAK,KAAA,CAAM,CAAC,CAAA;AACxE,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,MAAA,CAAO,GAAA,CAAI,KAAK,IAAI,CAAA;AACpB,QAAA,KAAA,CAAM,IAAI,IAAI,CAAA;AAAA,MAChB;AAAA,IACF;AACA,IAAA,OAAO,EAAE,QAAQ,CAAC,GAAA,EAAK,SAAS,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA,IAAK,IAAA,EAAK;AAAA,EAC1D;AACF;;;"}

package/dist/application/transform/footer/shared-enum-names.mjs

@@ -0,0 +1,57 @@
+import { EnumNaming } from './enum-naming.mjs';
+
+const FIRST_SCHEMA_NAMES = { nameOf: (_key, name) => name };
+function isBetterName(candidate, other) {
+  if (candidate.isComponentSchema !== other.isComponentSchema) {
+    return candidate.isComponentSchema;
+  }
+  if (candidate.name.length !== other.name.length) {
+    return candidate.name.length < other.name.length;
+  }
+  return candidate.name < other.name;
+}
+function ranked(candidates) {
+  return [...candidates].sort((left, right) => {
+    if (left.name === right.name && left.isComponentSchema === right.isComponentSchema) {
+      return 0;
+    }
+    return isBetterName(left, right) ? -1 : 1;
+  });
+}
+class SharedEnumNameRecorder {
+  candidatesByKey = /* @__PURE__ */ new Map();
+  nameOf(key, name, request) {
+    const candidate = {
+      name: new EnumNaming().enumName(request.name),
+      isComponentSchema: request.isComponentSchema
+    };
+    const candidates = this.candidatesByKey.get(key);
+    if (candidates === void 0) {
+      this.candidatesByKey.set(key, [candidate]);
+    } else {
+      candidates.push(candidate);
+    }
+    return name;
+  }
+  /**
+   * The best name of each enum. Two enums whose best names are the same (two schemas that give
+   * one name) are resolved in key order: the later one takes its next name that is free.
+   */
+  chosenNames() {
+    const chosen = /* @__PURE__ */ new Map();
+    const taken = /* @__PURE__ */ new Set();
+    const keys = [...this.candidatesByKey.keys()].sort();
+    for (const key of keys) {
+      const names = ranked(this.candidatesByKey.get(key) ?? []).map(({ name: name2 }) => name2);
+      const name = names.find((candidate) => !taken.has(candidate)) ?? names[0];
+      if (name !== void 0) {
+        chosen.set(key, name);
+        taken.add(name);
+      }
+    }
+    return { nameOf: (key, name) => chosen.get(key) ?? name };
+  }
+}
+
+export { FIRST_SCHEMA_NAMES, SharedEnumNameRecorder };
+//# sourceMappingURL=shared-enum-names.mjs.map

package/dist/application/transform/footer/shared-enum-names.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"shared-enum-names.mjs","sources":["../../../../src/application/transform/footer/shared-enum-names.ts"],"sourcesContent":["import type { EnumDeclarationRequest } from \"../schema/schema-context.js\";\nimport { EnumNaming } from \"./enum-naming.js\";\n\n/**\n * How `--dedupe-enums` names the one enum that schemas with the same members share. `key` is the\n * dedupe key of the members; `name` is the name the schema gives with the run's naming state.\n */\nexport interface SharedEnumNames {\n  /** Called for every schema of the enum, in document order; returns the name to declare. */\n  nameOf(key: string, name: string, request: EnumDeclarationRequest): string;\n}\n\n/** The original: the enum takes the name of the first schema in the document. */\nexport const FIRST_SCHEMA_NAMES: SharedEnumNames = { nameOf: (_key, name) => name };\n\ninterface NameCandidate {\n  readonly name: string;\n  readonly isComponentSchema: boolean;\n}\n\n/**\n * Whether `candidate` names the enum better than `other`: a component schema that is the enum\n * itself, then the shorter name, then the earlier one in code-unit order. No part depends on the\n * document order, so adding or moving a schema changes the name only when the new one ranks first.\n */\nfunction isBetterName(candidate: NameCandidate, other: NameCandidate): boolean {\n  if (candidate.isComponentSchema !== other.isComponentSchema) {\n    return candidate.isComponentSchema;\n  }\n  if (candidate.name.length !== other.name.length) {\n    return candidate.name.length < other.name.length;\n  }\n  return candidate.name < other.name;\n}\n\n/** The candidates from best to worst. */\nfunction ranked(candidates: readonly NameCandidate[]): NameCandidate[] {\n  return [...candidates].sort((left, right) => {\n    if (left.name === right.name && left.isComponentSchema === right.isComponentSchema) {\n      return 0;\n    }\n    return isBetterName(left, right) ? -1 : 1;\n  });\n}\n\n/**\n * The `dedupe-enum-names` fix (ADR-021, upstream #1683), first pass: records every schema of each\n * shared enum and keeps the run's own names. `chosenNames` gives the names for the second pass.\n */\nexport class SharedEnumNameRecorder implements SharedEnumNames {\n  private readonly candidatesByKey = new Map<string, NameCandidate[]>();\n\n  nameOf(key: string, name: string, request: EnumDeclarationRequest): string {\n    // A fresh naming state: the run's state depends on the names built before (EnumNaming).\n    const candidate = {\n      name: new EnumNaming().enumName(request.name),\n      isComponentSchema: request.isComponentSchema,\n    };\n    const candidates = this.candidatesByKey.get(key);\n    if (candidates === undefined) {\n      this.candidatesByKey.set(key, [candidate]);\n    } else {\n      candidates.push(candidate);\n    }\n    return name;\n  }\n\n  /**\n   * The best name of each enum. Two enums whose best names are the same (two schemas that give\n   * one name) are resolved in key order: the later one takes its next name that is free.\n   */\n  chosenNames(): SharedEnumNames {\n    const chosen = new Map<string, string>();\n    const taken = new Set<string>();\n    const keys = [...this.candidatesByKey.keys()].sort();\n    for (const key of keys) {\n      const names = ranked(this.candidatesByKey.get(key) ?? []).map(({ name }) => name);\n      const name = names.find((candidate) => !taken.has(candidate)) ?? names[0];\n      if (name !== undefined) {\n        chosen.set(key, name);\n        taken.add(name);\n      }\n    }\n    return { nameOf: (key, name) => chosen.get(key) ?? name };\n  }\n}\n"],"names":["name"],"mappings":";;AAaO,MAAM,qBAAsC,EAAE,MAAA,EAAQ,CAAC,IAAA,EAAM,SAAS,IAAA;AAY7E,SAAS,YAAA,CAAa,WAA0B,KAAA,EAA+B;AAC7E,EAAA,IAAI,SAAA,CAAU,iBAAA,KAAsB,KAAA,CAAM,iBAAA,EAAmB;AAC3D,IAAA,OAAO,SAAA,CAAU,iBAAA;AAAA,EACnB;AACA,EAAA,IAAI,SAAA,CAAU,IAAA,CAAK,MAAA,KAAW,KAAA,CAAM,KAAK,MAAA,EAAQ;AAC/C,IAAA,OAAO,SAAA,CAAU,IAAA,CAAK,MAAA,GAAS,KAAA,CAAM,IAAA,CAAK,MAAA;AAAA,EAC5C;AACA,EAAA,OAAO,SAAA,CAAU,OAAO,KAAA,CAAM,IAAA;AAChC;AAGA,SAAS,OAAO,UAAA,EAAuD;AACrE,EAAA,OAAO,CAAC,GAAG,UAAU,EAAE,IAAA,CAAK,CAAC,MAAM,KAAA,KAAU;AAC3C,IAAA,IAAI,KAAK,IAAA,KAAS,KAAA,CAAM,QAAQ,IAAA,CAAK,iBAAA,KAAsB,MAAM,iBAAA,EAAmB;AAClF,MAAA,OAAO,CAAA;AAAA,IACT;AACA,IAAA,OAAO,YAAA,CAAa,IAAA,EAAM,KAAK,CAAA,GAAI,EAAA,GAAK,CAAA;AAAA,EAC1C,CAAC,CAAA;AACH;AAMO,MAAM,sBAAA,CAAkD;AAAA,EAC5C,eAAA,uBAAsB,GAAA,EAA6B;AAAA,EAEpE,MAAA,CAAO,GAAA,EAAa,IAAA,EAAc,OAAA,EAAyC;AAEzE,IAAA,MAAM,SAAA,GAAY;AAAA,MAChB,MAAM,IAAI,UAAA,EAAW,CAAE,QAAA,CAAS,QAAQ,IAAI,CAAA;AAAA,MAC5C,mBAAmB,OAAA,CAAQ;AAAA,KAC7B;AACA,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA;AAC/C,IAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,MAAA,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,GAAA,EAAK,CAAC,SAAS,CAAC,CAAA;AAAA,IAC3C,CAAA,MAAO;AACL,MAAA,UAAA,CAAW,KAAK,SAAS,CAAA;AAAA,IAC3B;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAA,GAA+B;AAC7B,IAAA,MAAM,MAAA,uBAAa,GAAA,EAAoB;AACvC,IAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,IAAA,MAAM,IAAA,GAAO,CAAC,GAAG,IAAA,CAAK,gBAAgB,IAAA,EAAM,EAAE,IAAA,EAAK;AACnD,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,MAAA,MAAM,QAAQ,MAAA,CAAO,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,GAAG,CAAA,IAAK,EAAE,CAAA,CAAE,IAAI,CAAC,EAAE,IAAA,EAAAA,KAAAA,OAAWA,KAAI,CAAA;AAChF,MAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,CAAK,CAAC,SAAA,KAAc,CAAC,KAAA,CAAM,GAAA,CAAI,SAAS,CAAC,CAAA,IAAK,KAAA,CAAM,CAAC,CAAA;AACxE,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,MAAA,CAAO,GAAA,CAAI,KAAK,IAAI,CAAA;AACpB,QAAA,KAAA,CAAM,IAAI,IAAI,CAAA;AAAA,MAChB;AAAA,IACF;AACA,IAAA,OAAO,EAAE,QAAQ,CAAC,GAAA,EAAK,SAAS,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA,IAAK,IAAA,EAAK;AAAA,EAC1D;AACF;;"}

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

@@ -0,0 +1,138 @@
+'use strict';
+
+const evaluation = require('./evaluation.cjs');
+const typeIndexing = require('./type-indexing.cjs');
+const typeRules = require('./type-rules.cjs');
+
+const MAX_EXPANSIONS = 200;
+const DEEP_PREFIX = "FlattenedDeepRequired<";
+const MAX_DISTRIBUTED = 64;
+class TypeEvaluator {
+  declared = /* @__PURE__ */ new Map();
+  expansions = 0;
+  constructor(declarations) {
+    for (const declaration of declarations) {
+      if (declaration.kind === "interface") {
+        this.declared.set(declaration.name, { kind: "object", members: declaration.members });
+      } else if (declaration.kind === "typeAlias") {
+        this.declared.set(declaration.name, declaration.type);
+      }
+    }
+  }
+  /** Evaluate a type written in the footer; the expansion budget starts again. */
+  evaluate(type) {
+    this.expansions = 0;
+    return this.expand({ kind: "type", type, deep: false });
+  }
+  /** The type with references, `readonly` and indexed access resolved at the top. */
+  expand(value) {
+    const { type } = value;
+    switch (type.kind) {
+      case "readonly":
+        return this.expand({ ...value, type: type.type });
+      case "indexedAccess":
+        return this.indexedAccess(value, type.object, type.index);
+      case "reference":
+        return this.reference(value, type.name, type.typeArguments);
+      case "raw":
+      case "tuple":
+        return evaluation.OPAQUE;
+      default:
+        return value;
+    }
+  }
+  indexedAccess(value, object, index) {
+    const owner = this.expand({ ...value, type: object });
+    return owner.kind === "type" ? this.index(owner, index) : owner;
+  }
+  reference(value, name, args) {
+    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));
+      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;
+    }
+    const argument = this.expand({ ...value, type: first });
+    if (argument.kind !== "type") {
+      return argument;
+    }
+    return this.helper(name, argument, second);
+  }
+  helper(name, argument, second) {
+    switch (name) {
+      case "NonNullable":
+        return this.withoutNullish(argument);
+      case "WithRequired":
+      case "Readonly":
+        return argument;
+      case "Extract":
+        return second === void 0 ? evaluation.OPAQUE : this.extract(argument, second);
+      case "Omit":
+        return second === void 0 ? evaluation.OPAQUE : typeRules.omitted(this, argument, second);
+      default:
+        return typeRules.markerObject(name, argument) ?? evaluation.OPAQUE;
+    }
+  }
+  /**
+   * The members of a union, each expanded; an intersection with unions in it is distributed over
+   * them (`A & (B | C)` is `(A & B) | (A & C)`), as TypeScript normalizes it. A type that is not a
+   * union is its only member. A union with an `any` or `unknown` member is that keyword alone.
+   */
+  membersOf(value) {
+    const expanded = this.expand(value);
+    if (expanded.kind !== "type") {
+      return [expanded];
+    }
+    const { type } = expanded;
+    if (type.kind === "union") {
+      return evaluation.absorbed(
+        type.types.flatMap((member) => this.membersOf({ ...expanded, type: member }))
+      );
+    }
+    return type.kind === "intersection" ? this.distributed(expanded, type.types) : [expanded];
+  }
+  distributed(value, parts) {
+    const memberLists = parts.map((part) => this.membersOf({ ...value, type: part }));
+    const size = memberLists.reduce((product, list) => product * list.length, 1);
+    if (size > MAX_DISTRIBUTED || memberLists.some((list) => list.some((m) => m.kind !== "type"))) {
+      return [evaluation.OPAQUE];
+    }
+    let combinations = [[]];
+    for (const list of memberLists) {
+      combinations = combinations.flatMap((done) => list.map((member) => [...done, member.type]));
+    }
+    return combinations.map((types) => ({ ...value, type: evaluation.intersectionType(types) }));
+  }
+  withoutNullish(value) {
+    const members = this.membersOf(value);
+    if (members.some((member) => member.kind !== "type")) {
+      return evaluation.OPAQUE;
+    }
+    const kept = members.filter((member) => !evaluation.isNullish(member.type));
+    return { ...value, type: evaluation.unionType(kept.map((member) => member.type)) };
+  }
+  /** `Extract<T, { key: unknown }>` keeps the members that have `key`; other probes are opaque. */
+  extract(value, probe) {
+    const [member] = probe.kind === "object" ? probe.members : [];
+    if (probe.kind !== "object" || probe.members.length !== 1 || member?.kind !== "property") {
+      return evaluation.OPAQUE;
+    }
+    return typeRules.extracted(this, value, evaluation.propertyKey(member.name));
+  }
+  /** `value[index]` for a string literal, `string` or `number` index. */
+  index(value, index) {
+    return typeIndexing.indexType(this, value, index);
+  }
+}
+
+exports.TypeEvaluator = TypeEvaluator;
+//# sourceMappingURL=type-evaluation.cjs.map

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

@@ -0,0 +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;;"}

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

@@ -0,0 +1,136 @@
+import { OPAQUE, absorbed, intersectionType, isNullish, unionType, propertyKey } from './evaluation.mjs';
+import { indexType } from './type-indexing.mjs';
+import { markerObject, omitted, extracted } from './type-rules.mjs';
+
+const MAX_EXPANSIONS = 200;
+const DEEP_PREFIX = "FlattenedDeepRequired<";
+const MAX_DISTRIBUTED = 64;
+class TypeEvaluator {
+  declared = /* @__PURE__ */ new Map();
+  expansions = 0;
+  constructor(declarations) {
+    for (const declaration of declarations) {
+      if (declaration.kind === "interface") {
+        this.declared.set(declaration.name, { kind: "object", members: declaration.members });
+      } else if (declaration.kind === "typeAlias") {
+        this.declared.set(declaration.name, declaration.type);
+      }
+    }
+  }
+  /** Evaluate a type written in the footer; the expansion budget starts again. */
+  evaluate(type) {
+    this.expansions = 0;
+    return this.expand({ kind: "type", type, deep: false });
+  }
+  /** The type with references, `readonly` and indexed access resolved at the top. */
+  expand(value) {
+    const { type } = value;
+    switch (type.kind) {
+      case "readonly":
+        return this.expand({ ...value, type: type.type });
+      case "indexedAccess":
+        return this.indexedAccess(value, type.object, type.index);
+      case "reference":
+        return this.reference(value, type.name, type.typeArguments);
+      case "raw":
+      case "tuple":
+        return OPAQUE;
+      default:
+        return value;
+    }
+  }
+  indexedAccess(value, object, index) {
+    const owner = this.expand({ ...value, type: object });
+    return owner.kind === "type" ? this.index(owner, index) : owner;
+  }
+  reference(value, name, args) {
+    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));
+      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;
+    }
+    const argument = this.expand({ ...value, type: first });
+    if (argument.kind !== "type") {
+      return argument;
+    }
+    return this.helper(name, argument, second);
+  }
+  helper(name, argument, second) {
+    switch (name) {
+      case "NonNullable":
+        return this.withoutNullish(argument);
+      case "WithRequired":
+      case "Readonly":
+        return argument;
+      case "Extract":
+        return second === void 0 ? OPAQUE : this.extract(argument, second);
+      case "Omit":
+        return second === void 0 ? OPAQUE : omitted(this, argument, second);
+      default:
+        return markerObject(name, argument) ?? OPAQUE;
+    }
+  }
+  /**
+   * The members of a union, each expanded; an intersection with unions in it is distributed over
+   * them (`A & (B | C)` is `(A & B) | (A & C)`), as TypeScript normalizes it. A type that is not a
+   * union is its only member. A union with an `any` or `unknown` member is that keyword alone.
+   */
+  membersOf(value) {
+    const expanded = this.expand(value);
+    if (expanded.kind !== "type") {
+      return [expanded];
+    }
+    const { type } = expanded;
+    if (type.kind === "union") {
+      return absorbed(
+        type.types.flatMap((member) => this.membersOf({ ...expanded, type: member }))
+      );
+    }
+    return type.kind === "intersection" ? this.distributed(expanded, type.types) : [expanded];
+  }
+  distributed(value, parts) {
+    const memberLists = parts.map((part) => this.membersOf({ ...value, type: part }));
+    const size = memberLists.reduce((product, list) => product * list.length, 1);
+    if (size > MAX_DISTRIBUTED || memberLists.some((list) => list.some((m) => m.kind !== "type"))) {
+      return [OPAQUE];
+    }
+    let combinations = [[]];
+    for (const list of memberLists) {
+      combinations = combinations.flatMap((done) => list.map((member) => [...done, member.type]));
+    }
+    return combinations.map((types) => ({ ...value, type: intersectionType(types) }));
+  }
+  withoutNullish(value) {
+    const members = this.membersOf(value);
+    if (members.some((member) => member.kind !== "type")) {
+      return OPAQUE;
+    }
+    const kept = members.filter((member) => !isNullish(member.type));
+    return { ...value, type: unionType(kept.map((member) => member.type)) };
+  }
+  /** `Extract<T, { key: unknown }>` keeps the members that have `key`; other probes are opaque. */
+  extract(value, probe) {
+    const [member] = probe.kind === "object" ? probe.members : [];
+    if (probe.kind !== "object" || probe.members.length !== 1 || member?.kind !== "property") {
+      return OPAQUE;
+    }
+    return extracted(this, value, propertyKey(member.name));
+  }
+  /** `value[index]` for a string literal, `string` or `number` index. */
+  index(value, index) {
+    return indexType(this, value, index);
+  }
+}
+
+export { TypeEvaluator };
+//# sourceMappingURL=type-evaluation.mjs.map

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

@@ -0,0 +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;;"}