openapi-typesafe 0.0.0 → 1.0.0-rc.1

package/dist/application/transform/document/type-assignability.mjs

@@ -0,0 +1,190 @@
+import { irBoolean } from '../../../domain/ir/constructors.mjs';
+import { everyOf, someOf, crossCategoryRelation, primitiveRelation } from './assignability.mjs';
+import { relateLists } from './list-assignability.mjs';
+import { createTypeKey } from './type-key.mjs';
+import { TypeResolution, propertiesOf, indexSignaturesOf, readType, nameOf } from './type-resolution.mjs';
+
+function resultOf(results, source, target) {
+  return results.get(source)?.get(target);
+}
+function setResult(results, pair, value) {
+  const byTarget = results.get(pair.source) ?? /* @__PURE__ */ new Map();
+  byTarget.set(pair.target, value);
+  results.set(pair.source, byTarget);
+}
+function isWeakTypeRejected(source, target) {
+  const targetProperties = [...propertiesOf(target).values()];
+  const isWeak = targetProperties.length > 0 && indexSignaturesOf(target).length === 0 && targetProperties.every((property) => property.isOptional);
+  const sourceNames = [...propertiesOf(source).keys()];
+  return isWeak && sourceNames.length > 0 && !sourceNames.some((name) => targetProperties.some((property) => nameOf(property) === name));
+}
+function isStringIndex(signature) {
+  return signature.parameterType.kind === "keyword" && signature.parameterType.keyword === "string";
+}
+const BOOLEAN_MEMBERS = [irBoolean(true), irBoolean(false)];
+function sourceUnionMembers(source, target) {
+  if (source.kind === "union") {
+    return source.types;
+  }
+  const isBoolean = source.kind === "keyword" && source.keyword === "boolean";
+  return isBoolean && target.kind === "union" ? BOOLEAN_MEMBERS : null;
+}
+class AssignabilityCheck {
+  inProgress = /* @__PURE__ */ new Map();
+  results = /* @__PURE__ */ new Map();
+  typeKeyOf = createTypeKey();
+  resolution;
+  /** How often a pair being compared was assumed related, and how deep the comparison is. */
+  assumptions = 0;
+  depth = 0;
+  constructor(lookup) {
+    this.resolution = new TypeResolution(lookup);
+  }
+  relate(source, target) {
+    const pair = {
+      source: this.resolution.resolved(source),
+      target: this.resolution.resolved(target)
+    };
+    if (pair.source === pair.target || this.typeKeyOf(pair.source) === this.typeKeyOf(pair.target)) {
+      return "assignable";
+    }
+    const known = resultOf(this.results, pair.source, pair.target);
+    if (known !== void 0) {
+      return known;
+    }
+    if (resultOf(this.inProgress, pair.source, pair.target) !== void 0) {
+      this.assumptions += 1;
+      return "assignable";
+    }
+    const assumedBefore = this.assumptions;
+    setResult(this.inProgress, pair, "assignable");
+    this.depth += 1;
+    const result = this.compare(pair.source, pair.target);
+    this.depth -= 1;
+    this.inProgress.get(pair.source)?.delete(pair.target);
+    if (result !== "assignable" || this.assumptions === assumedBefore || this.depth === 0) {
+      setResult(this.results, pair, result);
+    }
+    return result;
+  }
+  compare(source, target) {
+    if (target.kind === "keyword" && target.keyword === "unknown") {
+      return "assignable";
+    }
+    if (source.kind === "keyword" && source.keyword === "never") {
+      return "assignable";
+    }
+    const sourceMembers = sourceUnionMembers(source, target);
+    if (sourceMembers !== null) {
+      return everyOf(sourceMembers, (member) => this.relate(member, target));
+    }
+    if (target.kind === "intersection") {
+      return everyOf(target.types, (member) => this.relateToIntersectionPart(source, member));
+    }
+    if (target.kind === "union") {
+      return this.relateToUnion(source, target);
+    }
+    if (source.kind === "intersection") {
+      const fits = source.types.some((part) => this.relate(part, target) === "assignable");
+      return fits ? "assignable" : "undecided";
+    }
+    return this.compareSingle(source, target);
+  }
+  /**
+   * A part of an intersection the check cannot merge into one object. The checker skips the weak
+   * type check for such a part, so a rejection that may rest on it decides nothing.
+   */
+  relateToIntersectionPart(source, part) {
+    const result = this.relate(source, part);
+    const from = this.resolution.resolved(source);
+    const to = this.resolution.resolved(part);
+    const isWeakRejection = from.kind === "object" && to.kind === "object" && isWeakTypeRejected(from, to);
+    return result === "rejected" && isWeakRejection ? "undecided" : result;
+  }
+  /**
+   * An object may fit a union of objects that none of its members accepts alone, through a
+   * discriminant property (`{ k: "a" | "b" }` fits `{ k: "a" } | { k: "b" }`); not modelled.
+   */
+  relateToUnion(source, target) {
+    const result = someOf(target.types, (member) => this.relate(source, member));
+    const objectMembers = target.types.filter(
+      (member) => this.resolution.resolved(member).kind === "object"
+    );
+    const mayBeDiscriminated = source.kind === "object" && objectMembers.length > 1;
+    return result === "rejected" && mayBeDiscriminated ? "undecided" : result;
+  }
+  compareSingle(source, target) {
+    const crossCategory = crossCategoryRelation(source, target);
+    if (crossCategory !== null) {
+      return crossCategory;
+    }
+    switch (source.kind) {
+      case "array":
+      case "tuple":
+      case "readonly":
+        return relateLists(source, target, (from, to) => this.relate(from, to));
+      case "object":
+        return this.relateObjects(source, target);
+      default:
+        return primitiveRelation(source, target);
+    }
+  }
+  relateObjects(source, target) {
+    if (isWeakTypeRejected(source, target)) {
+      return "rejected";
+    }
+    const sourceProperties = propertiesOf(source);
+    const indexes = everyOf(
+      indexSignaturesOf(target),
+      (signature) => this.relateToIndex(source, signature)
+    );
+    if (indexes === "rejected") {
+      return indexes;
+    }
+    const properties = everyOf(
+      [...propertiesOf(target).values()],
+      (property) => this.relateProperty(sourceProperties.get(nameOf(property)), property)
+    );
+    return everyOf([indexes, properties], (result) => result);
+  }
+  /**
+   * A string index signature of the target. A string index of the source is compared with it;
+   * without one, every property and index signature of the source is. An optional property is
+   * compared without the `undefined` its optionality adds, as the checker does.
+   */
+  relateToIndex(source, signature) {
+    if (!isStringIndex(signature)) {
+      return "undecided";
+    }
+    const indexes = indexSignaturesOf(source);
+    const own = indexes.find(isStringIndex);
+    if (own !== void 0) {
+      return this.relate(own.type, signature.type);
+    }
+    const types = [
+      ...[...propertiesOf(source).values()].map((property) => property.type),
+      ...indexes.map((index) => index.type)
+    ];
+    return everyOf(types, (type) => this.relate(type, signature.type));
+  }
+  /**
+   * A property of the target. A missing optional one is not checked, not even against a string
+   * index of the source; a missing or optional source property fails a required one (TS2741).
+   */
+  relateProperty(source, target) {
+    if (source === void 0) {
+      return target.isOptional ? "assignable" : "rejected";
+    }
+    if (source.isOptional && !target.isOptional) {
+      return "rejected";
+    }
+    return this.relate(readType(source), readType(target));
+  }
+}
+function assignabilityProof(lookup) {
+  const check = new AssignabilityCheck(lookup);
+  return (source, target) => check.relate(source, target);
+}
+
+export { assignabilityProof };
+//# sourceMappingURL=type-assignability.mjs.map

package/dist/application/transform/document/type-assignability.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-assignability.mjs","sources":["../../../../src/application/transform/document/type-assignability.ts"],"sourcesContent":["import { irBoolean } from \"../../../domain/ir/constructors.js\";\nimport type {\n  IrIndexSignature,\n  IrObjectType,\n  IrPropertySignature,\n  IrType,\n  IrUnionType,\n} from \"../../../domain/ir/nodes.js\";\nimport {\n  type Assignability,\n  crossCategoryRelation,\n  everyOf,\n  primitiveRelation,\n  someOf,\n} from \"./assignability.js\";\nimport type { DeclaredTypeLookup } from \"./declared-types.js\";\nimport { type IrListType, relateLists } from \"./list-assignability.js\";\nimport { createTypeKey } from \"./type-key.js\";\nimport {\n  indexSignaturesOf,\n  nameOf,\n  propertiesOf,\n  readType,\n  TypeResolution,\n} from \"./type-resolution.js\";\n\n/**\n * Whether TypeScript accepts one type where another is expected (`strict`, without\n * `exactOptionalPropertyTypes`), for the `--path-params-as-types` overlap check. It follows the\n * checker's rules for the types the generator writes: unions, intersections, objects with optional\n * properties and index signatures, weak types, arrays, tuples, literals and keywords, and the\n * references to declarations of the document. A pair it does not model (a utility type, raw text)\n * is undecided unless both are the same type, and an undecided pair keeps the original output.\n */\n\n/** Results by source type, then by target type. */\ntype PairResults = Map<IrType, Map<IrType, Assignability>>;\n\nfunction resultOf(results: PairResults, source: IrType, target: IrType): Assignability | undefined {\n  return results.get(source)?.get(target);\n}\n\nfunction setResult(\n  results: PairResults,\n  pair: { readonly source: IrType; readonly target: IrType },\n  value: Assignability,\n): void {\n  const byTarget = results.get(pair.source) ?? new Map<IrType, Assignability>();\n  byTarget.set(pair.target, value);\n  results.set(pair.source, byTarget);\n}\n\n/** A weak type has only optional properties; TypeScript rejects a source sharing none (TS2559). */\nfunction isWeakTypeRejected(source: IrObjectType, target: IrObjectType): boolean {\n  const targetProperties = [...propertiesOf(target).values()];\n  const isWeak =\n    targetProperties.length > 0 &&\n    indexSignaturesOf(target).length === 0 &&\n    targetProperties.every((property) => property.isOptional);\n  const sourceNames = [...propertiesOf(source).keys()];\n  return (\n    isWeak &&\n    sourceNames.length > 0 &&\n    !sourceNames.some((name) => targetProperties.some((property) => nameOf(property) === name))\n  );\n}\n\nfunction isStringIndex(signature: IrIndexSignature): boolean {\n  return signature.parameterType.kind === \"keyword\" && signature.parameterType.keyword === \"string\";\n}\n\n/** `boolean` as the checker stores it: the union `true | false`. */\nconst BOOLEAN_MEMBERS: readonly IrType[] = [irBoolean(true), irBoolean(false)];\n\n/**\n * The members a source is compared by, one by one, or null for a source compared as a whole.\n * `boolean` counts as `true | false` against a union, which it fits though it fits neither member\n * alone; `string` and `number` are no finite unions, so no literal union holds all their values.\n */\nfunction sourceUnionMembers(source: IrType, target: IrType): readonly IrType[] | null {\n  if (source.kind === \"union\") {\n    return source.types;\n  }\n  const isBoolean = source.kind === \"keyword\" && source.keyword === \"boolean\";\n  return isBoolean && target.kind === \"union\" ? BOOLEAN_MEMBERS : null;\n}\n\n/** The memoized check over the declarations of one generated file. */\nclass AssignabilityCheck {\n  private readonly inProgress: PairResults = new Map();\n  private readonly results: PairResults = new Map();\n  private readonly typeKeyOf = createTypeKey();\n  private readonly resolution: TypeResolution;\n  /** How often a pair being compared was assumed related, and how deep the comparison is. */\n  private assumptions = 0;\n  private depth = 0;\n\n  constructor(lookup: DeclaredTypeLookup) {\n    this.resolution = new TypeResolution(lookup);\n  }\n\n  relate(source: IrType, target: IrType): Assignability {\n    const pair = {\n      source: this.resolution.resolved(source),\n      target: this.resolution.resolved(target),\n    };\n    if (\n      pair.source === pair.target ||\n      this.typeKeyOf(pair.source) === this.typeKeyOf(pair.target)\n    ) {\n      return \"assignable\";\n    }\n    const known = resultOf(this.results, pair.source, pair.target);\n    if (known !== undefined) {\n      return known;\n    }\n    // A pair being compared is assumed related, as the checker does for recursive types.\n    if (resultOf(this.inProgress, pair.source, pair.target) !== undefined) {\n      this.assumptions += 1;\n      return \"assignable\";\n    }\n    const assumedBefore = this.assumptions;\n    setResult(this.inProgress, pair, \"assignable\");\n    this.depth += 1;\n    const result = this.compare(pair.source, pair.target);\n    this.depth -= 1;\n    this.inProgress.get(pair.source)?.delete(pair.target);\n    // \"Assignable\" that rests on an assumption about an outer pair holds only if that pair does,\n    // so it is kept only once no outer pair is open. The assumption can only make a pair more\n    // related, so a rejection or an undecided pair reached under it is safe to keep.\n    if (result !== \"assignable\" || this.assumptions === assumedBefore || this.depth === 0) {\n      setResult(this.results, pair, result);\n    }\n    return result;\n  }\n\n  private compare(source: IrType, target: IrType): Assignability {\n    if (target.kind === \"keyword\" && target.keyword === \"unknown\") {\n      return \"assignable\";\n    }\n    if (source.kind === \"keyword\" && source.keyword === \"never\") {\n      return \"assignable\";\n    }\n    const sourceMembers = sourceUnionMembers(source, target);\n    if (sourceMembers !== null) {\n      return everyOf(sourceMembers, (member) => this.relate(member, target));\n    }\n    if (target.kind === \"intersection\") {\n      return everyOf(target.types, (member) => this.relateToIntersectionPart(source, member));\n    }\n    if (target.kind === \"union\") {\n      return this.relateToUnion(source, target);\n    }\n    if (source.kind === \"intersection\") {\n      // A part that fits is enough; the parts as one type are not modelled (see `merged`).\n      const fits = source.types.some((part) => this.relate(part, target) === \"assignable\");\n      return fits ? \"assignable\" : \"undecided\";\n    }\n    return this.compareSingle(source, target);\n  }\n\n  /**\n   * A part of an intersection the check cannot merge into one object. The checker skips the weak\n   * type check for such a part, so a rejection that may rest on it decides nothing.\n   */\n  private relateToIntersectionPart(source: IrType, part: IrType): Assignability {\n    const result = this.relate(source, part);\n    const from = this.resolution.resolved(source);\n    const to = this.resolution.resolved(part);\n    const isWeakRejection =\n      from.kind === \"object\" && to.kind === \"object\" && isWeakTypeRejected(from, to);\n    return result === \"rejected\" && isWeakRejection ? \"undecided\" : result;\n  }\n\n  /**\n   * An object may fit a union of objects that none of its members accepts alone, through a\n   * discriminant property (`{ k: \"a\" | \"b\" }` fits `{ k: \"a\" } | { k: \"b\" }`); not modelled.\n   */\n  private relateToUnion(source: IrType, target: IrUnionType): Assignability {\n    const result = someOf(target.types, (member) => this.relate(source, member));\n    const objectMembers = target.types.filter(\n      (member) => this.resolution.resolved(member).kind === \"object\",\n    );\n    const mayBeDiscriminated = source.kind === \"object\" && objectMembers.length > 1;\n    return result === \"rejected\" && mayBeDiscriminated ? \"undecided\" : result;\n  }\n\n  private compareSingle(source: IrType, target: IrType): Assignability {\n    const crossCategory = crossCategoryRelation(source, target);\n    if (crossCategory !== null) {\n      return crossCategory;\n    }\n    switch (source.kind) {\n      case \"array\":\n      case \"tuple\":\n      case \"readonly\":\n        return relateLists(source, target as IrListType, (from, to) => this.relate(from, to));\n      case \"object\":\n        return this.relateObjects(source, target as IrObjectType);\n      default:\n        return primitiveRelation(source, target);\n    }\n  }\n\n  private relateObjects(source: IrObjectType, target: IrObjectType): Assignability {\n    if (isWeakTypeRejected(source, target)) {\n      return \"rejected\";\n    }\n    const sourceProperties = propertiesOf(source);\n    const indexes = everyOf(indexSignaturesOf(target), (signature) =>\n      this.relateToIndex(source, signature),\n    );\n    if (indexes === \"rejected\") {\n      return indexes;\n    }\n    const properties = everyOf([...propertiesOf(target).values()], (property) =>\n      this.relateProperty(sourceProperties.get(nameOf(property)), property),\n    );\n    return everyOf([indexes, properties], (result) => result);\n  }\n\n  /**\n   * A string index signature of the target. A string index of the source is compared with it;\n   * without one, every property and index signature of the source is. An optional property is\n   * compared without the `undefined` its optionality adds, as the checker does.\n   */\n  private relateToIndex(source: IrObjectType, signature: IrIndexSignature): Assignability {\n    if (!isStringIndex(signature)) {\n      return \"undecided\";\n    }\n    const indexes = indexSignaturesOf(source);\n    const own = indexes.find(isStringIndex);\n    if (own !== undefined) {\n      return this.relate(own.type, signature.type);\n    }\n    const types = [\n      ...[...propertiesOf(source).values()].map((property) => property.type),\n      ...indexes.map((index) => index.type),\n    ];\n    return everyOf(types, (type) => this.relate(type, signature.type));\n  }\n\n  /**\n   * A property of the target. A missing optional one is not checked, not even against a string\n   * index of the source; a missing or optional source property fails a required one (TS2741).\n   */\n  private relateProperty(\n    source: IrPropertySignature | undefined,\n    target: IrPropertySignature,\n  ): Assignability {\n    if (source === undefined) {\n      return target.isOptional ? \"assignable\" : \"rejected\";\n    }\n    if (source.isOptional && !target.isOptional) {\n      return \"rejected\";\n    }\n    return this.relate(readType(source), readType(target));\n  }\n}\n\n/** What the check proves about a source type where a target is expected. */\nexport type AssignabilityProof = (source: IrType, target: IrType) => Assignability;\n\n/** One memoized check, for all the comparisons of a `paths` type. */\nexport function assignabilityProof(lookup: DeclaredTypeLookup): AssignabilityProof {\n  const check = new AssignabilityCheck(lookup);\n  return (source, target) => check.relate(source, target);\n}\n"],"names":[],"mappings":";;;;;;AAsCA,SAAS,QAAA,CAAS,OAAA,EAAsB,MAAA,EAAgB,MAAA,EAA2C;AACjG,EAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,EAAG,IAAI,MAAM,CAAA;AACxC;AAEA,SAAS,SAAA,CACP,OAAA,EACA,IAAA,EACA,KAAA,EACM;AACN,EAAA,MAAM,WAAW,OAAA,CAAQ,GAAA,CAAI,KAAK,MAAM,CAAA,wBAAS,GAAA,EAA2B;AAC5E,EAAA,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,KAAK,CAAA;AAC/B,EAAA,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,QAAQ,CAAA;AACnC;AAGA,SAAS,kBAAA,CAAmB,QAAsB,MAAA,EAA+B;AAC/E,EAAA,MAAM,mBAAmB,CAAC,GAAG,aAAa,MAAM,CAAA,CAAE,QAAQ,CAAA;AAC1D,EAAA,MAAM,MAAA,GACJ,gBAAA,CAAiB,MAAA,GAAS,CAAA,IAC1B,kBAAkB,MAAM,CAAA,CAAE,MAAA,KAAW,CAAA,IACrC,gBAAA,CAAiB,KAAA,CAAM,CAAC,QAAA,KAAa,SAAS,UAAU,CAAA;AAC1D,EAAA,MAAM,cAAc,CAAC,GAAG,aAAa,MAAM,CAAA,CAAE,MAAM,CAAA;AACnD,EAAA,OACE,UACA,WAAA,CAAY,MAAA,GAAS,CAAA,IACrB,CAAC,YAAY,IAAA,CAAK,CAAC,IAAA,KAAS,gBAAA,CAAiB,KAAK,CAAC,QAAA,KAAa,OAAO,QAAQ,CAAA,KAAM,IAAI,CAAC,CAAA;AAE9F;AAEA,SAAS,cAAc,SAAA,EAAsC;AAC3D,EAAA,OAAO,UAAU,aAAA,CAAc,IAAA,KAAS,SAAA,IAAa,SAAA,CAAU,cAAc,OAAA,KAAY,QAAA;AAC3F;AAGA,MAAM,kBAAqC,CAAC,SAAA,CAAU,IAAI,CAAA,EAAG,SAAA,CAAU,KAAK,CAAC,CAAA;AAO7E,SAAS,kBAAA,CAAmB,QAAgB,MAAA,EAA0C;AACpF,EAAA,IAAI,MAAA,CAAO,SAAS,OAAA,EAAS;AAC3B,IAAA,OAAO,MAAA,CAAO,KAAA;AAAA,EAChB;AACA,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,KAAS,SAAA,IAAa,OAAO,OAAA,KAAY,SAAA;AAClE,EAAA,OAAO,SAAA,IAAa,MAAA,CAAO,IAAA,KAAS,OAAA,GAAU,eAAA,GAAkB,IAAA;AAClE;AAGA,MAAM,kBAAA,CAAmB;AAAA,EACN,UAAA,uBAA8B,GAAA,EAAI;AAAA,EAClC,OAAA,uBAA2B,GAAA,EAAI;AAAA,EAC/B,YAAY,aAAA,EAAc;AAAA,EAC1B,UAAA;AAAA;AAAA,EAET,WAAA,GAAc,CAAA;AAAA,EACd,KAAA,GAAQ,CAAA;AAAA,EAEhB,YAAY,MAAA,EAA4B;AACtC,IAAA,IAAA,CAAK,UAAA,GAAa,IAAI,cAAA,CAAe,MAAM,CAAA;AAAA,EAC7C;AAAA,EAEA,MAAA,CAAO,QAAgB,MAAA,EAA+B;AACpD,IAAA,MAAM,IAAA,GAAO;AAAA,MACX,MAAA,EAAQ,IAAA,CAAK,UAAA,CAAW,QAAA,CAAS,MAAM,CAAA;AAAA,MACvC,MAAA,EAAQ,IAAA,CAAK,UAAA,CAAW,QAAA,CAAS,MAAM;AAAA,KACzC;AACA,IAAA,IACE,IAAA,CAAK,MAAA,KAAW,IAAA,CAAK,MAAA,IACrB,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,MAAM,CAAA,KAAM,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,MAAM,CAAA,EAC1D;AACA,MAAA,OAAO,YAAA;AAAA,IACT;AACA,IAAA,MAAM,QAAQ,QAAA,CAAS,IAAA,CAAK,SAAS,IAAA,CAAK,MAAA,EAAQ,KAAK,MAAM,CAAA;AAC7D,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,IAAI,QAAA,CAAS,KAAK,UAAA,EAAY,IAAA,CAAK,QAAQ,IAAA,CAAK,MAAM,MAAM,MAAA,EAAW;AACrE,MAAA,IAAA,CAAK,WAAA,IAAe,CAAA;AACpB,MAAA,OAAO,YAAA;AAAA,IACT;AACA,IAAA,MAAM,gBAAgB,IAAA,CAAK,WAAA;AAC3B,IAAA,SAAA,CAAU,IAAA,CAAK,UAAA,EAAY,IAAA,EAAM,YAAY,CAAA;AAC7C,IAAA,IAAA,CAAK,KAAA,IAAS,CAAA;AACd,IAAA,MAAM,SAAS,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,MAAA,EAAQ,KAAK,MAAM,CAAA;AACpD,IAAA,IAAA,CAAK,KAAA,IAAS,CAAA;AACd,IAAA,IAAA,CAAK,WAAW,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG,MAAA,CAAO,KAAK,MAAM,CAAA;AAIpD,IAAA,IAAI,WAAW,YAAA,IAAgB,IAAA,CAAK,gBAAgB,aAAA,IAAiB,IAAA,CAAK,UAAU,CAAA,EAAG;AACrF,MAAA,SAAA,CAAU,IAAA,CAAK,OAAA,EAAS,IAAA,EAAM,MAAM,CAAA;AAAA,IACtC;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,OAAA,CAAQ,QAAgB,MAAA,EAA+B;AAC7D,IAAA,IAAI,MAAA,CAAO,IAAA,KAAS,SAAA,IAAa,MAAA,CAAO,YAAY,SAAA,EAAW;AAC7D,MAAA,OAAO,YAAA;AAAA,IACT;AACA,IAAA,IAAI,MAAA,CAAO,IAAA,KAAS,SAAA,IAAa,MAAA,CAAO,YAAY,OAAA,EAAS;AAC3D,MAAA,OAAO,YAAA;AAAA,IACT;AACA,IAAA,MAAM,aAAA,GAAgB,kBAAA,CAAmB,MAAA,EAAQ,MAAM,CAAA;AACvD,IAAA,IAAI,kBAAkB,IAAA,EAAM;AAC1B,MAAA,OAAO,OAAA,CAAQ,eAAe,CAAC,MAAA,KAAW,KAAK,MAAA,CAAO,MAAA,EAAQ,MAAM,CAAC,CAAA;AAAA,IACvE;AACA,IAAA,IAAI,MAAA,CAAO,SAAS,cAAA,EAAgB;AAClC,MAAA,OAAO,OAAA,CAAQ,OAAO,KAAA,EAAO,CAAC,WAAW,IAAA,CAAK,wBAAA,CAAyB,MAAA,EAAQ,MAAM,CAAC,CAAA;AAAA,IACxF;AACA,IAAA,IAAI,MAAA,CAAO,SAAS,OAAA,EAAS;AAC3B,MAAA,OAAO,IAAA,CAAK,aAAA,CAAc,MAAA,EAAQ,MAAM,CAAA;AAAA,IAC1C;AACA,IAAA,IAAI,MAAA,CAAO,SAAS,cAAA,EAAgB;AAElC,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,KAAA,CAAM,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,MAAA,CAAO,IAAA,EAAM,MAAM,CAAA,KAAM,YAAY,CAAA;AACnF,MAAA,OAAO,OAAO,YAAA,GAAe,WAAA;AAAA,IAC/B;AACA,IAAA,OAAO,IAAA,CAAK,aAAA,CAAc,MAAA,EAAQ,MAAM,CAAA;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,wBAAA,CAAyB,QAAgB,IAAA,EAA6B;AAC5E,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,MAAA,EAAQ,IAAI,CAAA;AACvC,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,UAAA,CAAW,QAAA,CAAS,MAAM,CAAA;AAC5C,IAAA,MAAM,EAAA,GAAK,IAAA,CAAK,UAAA,CAAW,QAAA,CAAS,IAAI,CAAA;AACxC,IAAA,MAAM,eAAA,GACJ,KAAK,IAAA,KAAS,QAAA,IAAY,GAAG,IAAA,KAAS,QAAA,IAAY,kBAAA,CAAmB,IAAA,EAAM,EAAE,CAAA;AAC/E,IAAA,OAAO,MAAA,KAAW,UAAA,IAAc,eAAA,GAAkB,WAAA,GAAc,MAAA;AAAA,EAClE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,aAAA,CAAc,QAAgB,MAAA,EAAoC;AACxE,IAAA,MAAM,MAAA,GAAS,MAAA,CAAO,MAAA,CAAO,KAAA,EAAO,CAAC,WAAW,IAAA,CAAK,MAAA,CAAO,MAAA,EAAQ,MAAM,CAAC,CAAA;AAC3E,IAAA,MAAM,aAAA,GAAgB,OAAO,KAAA,CAAM,MAAA;AAAA,MACjC,CAAC,MAAA,KAAW,IAAA,CAAK,WAAW,QAAA,CAAS,MAAM,EAAE,IAAA,KAAS;AAAA,KACxD;AACA,IAAA,MAAM,kBAAA,GAAqB,MAAA,CAAO,IAAA,KAAS,QAAA,IAAY,cAAc,MAAA,GAAS,CAAA;AAC9E,IAAA,OAAO,MAAA,KAAW,UAAA,IAAc,kBAAA,GAAqB,WAAA,GAAc,MAAA;AAAA,EACrE;AAAA,EAEQ,aAAA,CAAc,QAAgB,MAAA,EAA+B;AACnE,IAAA,MAAM,aAAA,GAAgB,qBAAA,CAAsB,MAAA,EAAQ,MAAM,CAAA;AAC1D,IAAA,IAAI,kBAAkB,IAAA,EAAM;AAC1B,MAAA,OAAO,aAAA;AAAA,IACT;AACA,IAAA,QAAQ,OAAO,IAAA;AAAM,MACnB,KAAK,OAAA;AAAA,MACL,KAAK,OAAA;AAAA,MACL,KAAK,UAAA;AACH,QAAA,OAAO,WAAA,CAAY,MAAA,EAAQ,MAAA,EAAsB,CAAC,IAAA,EAAM,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,EAAM,EAAE,CAAC,CAAA;AAAA,MACtF,KAAK,QAAA;AACH,QAAA,OAAO,IAAA,CAAK,aAAA,CAAc,MAAA,EAAQ,MAAsB,CAAA;AAAA,MAC1D;AACE,QAAA,OAAO,iBAAA,CAAkB,QAAQ,MAAM,CAAA;AAAA;AAC3C,EACF;AAAA,EAEQ,aAAA,CAAc,QAAsB,MAAA,EAAqC;AAC/E,IAAA,IAAI,kBAAA,CAAmB,MAAA,EAAQ,MAAM,CAAA,EAAG;AACtC,MAAA,OAAO,UAAA;AAAA,IACT;AACA,IAAA,MAAM,gBAAA,GAAmB,aAAa,MAAM,CAAA;AAC5C,IAAA,MAAM,OAAA,GAAU,OAAA;AAAA,MAAQ,kBAAkB,MAAM,CAAA;AAAA,MAAG,CAAC,SAAA,KAClD,IAAA,CAAK,aAAA,CAAc,QAAQ,SAAS;AAAA,KACtC;AACA,IAAA,IAAI,YAAY,UAAA,EAAY;AAC1B,MAAA,OAAO,OAAA;AAAA,IACT;AACA,IAAA,MAAM,UAAA,GAAa,OAAA;AAAA,MAAQ,CAAC,GAAG,YAAA,CAAa,MAAM,CAAA,CAAE,QAAQ,CAAA;AAAA,MAAG,CAAC,QAAA,KAC9D,IAAA,CAAK,cAAA,CAAe,gBAAA,CAAiB,IAAI,MAAA,CAAO,QAAQ,CAAC,CAAA,EAAG,QAAQ;AAAA,KACtE;AACA,IAAA,OAAO,QAAQ,CAAC,OAAA,EAAS,UAAU,CAAA,EAAG,CAAC,WAAW,MAAM,CAAA;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,aAAA,CAAc,QAAsB,SAAA,EAA4C;AACtF,IAAA,IAAI,CAAC,aAAA,CAAc,SAAS,CAAA,EAAG;AAC7B,MAAA,OAAO,WAAA;AAAA,IACT;AACA,IAAA,MAAM,OAAA,GAAU,kBAAkB,MAAM,CAAA;AACxC,IAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,IAAA,CAAK,aAAa,CAAA;AACtC,IAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,MAAA,OAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,IAAA,EAAM,UAAU,IAAI,CAAA;AAAA,IAC7C;AACA,IAAA,MAAM,KAAA,GAAQ;AAAA,MACZ,GAAG,CAAC,GAAG,YAAA,CAAa,MAAM,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,QAAA,KAAa,SAAS,IAAI,CAAA;AAAA,MACrE,GAAG,OAAA,CAAQ,GAAA,CAAI,CAAC,KAAA,KAAU,MAAM,IAAI;AAAA,KACtC;AACA,IAAA,OAAO,OAAA,CAAQ,OAAO,CAAC,IAAA,KAAS,KAAK,MAAA,CAAO,IAAA,EAAM,SAAA,CAAU,IAAI,CAAC,CAAA;AAAA,EACnE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,cAAA,CACN,QACA,MAAA,EACe;AACf,IAAA,IAAI,WAAW,MAAA,EAAW;AACxB,MAAA,OAAO,MAAA,CAAO,aAAa,YAAA,GAAe,UAAA;AAAA,IAC5C;AACA,IAAA,IAAI,MAAA,CAAO,UAAA,IAAc,CAAC,MAAA,CAAO,UAAA,EAAY;AAC3C,MAAA,OAAO,UAAA;AAAA,IACT;AACA,IAAA,OAAO,KAAK,MAAA,CAAO,QAAA,CAAS,MAAM,CAAA,EAAG,QAAA,CAAS,MAAM,CAAC,CAAA;AAAA,EACvD;AACF;AAMO,SAAS,mBAAmB,MAAA,EAAgD;AACjF,EAAA,MAAM,KAAA,GAAQ,IAAI,kBAAA,CAAmB,MAAM,CAAA;AAC3C,EAAA,OAAO,CAAC,MAAA,EAAQ,MAAA,KAAW,KAAA,CAAM,MAAA,CAAO,QAAQ,MAAM,CAAA;AACxD;;"}

package/dist/application/transform/document/type-key.cjs

@@ -0,0 +1,70 @@
+'use strict';
+
+const assertNever = require('../../../domain/assert-never.cjs');
+
+function nameKey(name) {
+  return JSON.stringify(name.kind === "string" ? name.value : name.text);
+}
+function memberKey(member, typeKeyOf) {
+  if (member.kind === "indexSignature") {
+    const readonly2 = member.isReadonly ? "readonly " : "";
+    return `${readonly2}[${typeKeyOf(member.parameterType)}]:${typeKeyOf(member.type)}`;
+  }
+  const readonly = member.isReadonly ? "readonly " : "";
+  const optional = member.isOptional ? "?" : "";
+  return `${readonly}${nameKey(member.name)}${optional}:${typeKeyOf(member.type)}`;
+}
+function listKey(types, typeKeyOf) {
+  return types.map(typeKeyOf).join(",");
+}
+function elementKey(element, typeKeyOf) {
+  const prefix = element.isRest ? "..." : "";
+  return `${prefix}${typeKeyOf(element.type)}${element.isOptional ? "?" : ""}`;
+}
+function computeKey(type, typeKeyOf) {
+  switch (type.kind) {
+    case "keyword":
+      return type.keyword;
+    case "stringLiteral":
+      return JSON.stringify(type.value);
+    case "numberLiteral":
+    case "booleanLiteral":
+      return String(type.value);
+    case "reference":
+      return `${type.name}<${listKey(type.typeArguments, typeKeyOf)}>`;
+    case "array":
+      return `(${typeKeyOf(type.element)})[]`;
+    case "tuple":
+      return `[${type.elements.map((element) => elementKey(element, typeKeyOf)).join(",")}]`;
+    case "union":
+      return `union(${listKey(type.types, typeKeyOf)})`;
+    case "intersection":
+      return `intersection(${listKey(type.types, typeKeyOf)})`;
+    case "object":
+      return `{${type.members.map((member) => memberKey(member, typeKeyOf)).join(";")}}`;
+    case "indexedAccess":
+      return `${typeKeyOf(type.object)}[${typeKeyOf(type.index)}]`;
+    case "readonly":
+      return `readonly(${typeKeyOf(type.type)})`;
+    case "raw":
+      return `raw(${type.text})`;
+    default:
+      return assertNever.assertNever(type);
+  }
+}
+function createTypeKey() {
+  const keys = /* @__PURE__ */ new WeakMap();
+  const typeKeyOf = (type) => {
+    const known = keys.get(type);
+    if (known !== void 0) {
+      return known;
+    }
+    const key = computeKey(type, typeKeyOf);
+    keys.set(type, key);
+    return key;
+  };
+  return typeKeyOf;
+}
+
+exports.createTypeKey = createTypeKey;
+//# sourceMappingURL=type-key.cjs.map

package/dist/application/transform/document/type-key.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-key.cjs","sources":["../../../../src/application/transform/document/type-key.ts"],"sourcesContent":["import { assertNever } from \"../../../domain/assert-never.js\";\nimport type { IrMember, IrPropertyName, IrTupleElement, IrType } from \"../../../domain/ir/nodes.js\";\n\n/**\n * A text that is the same for two types exactly when they are written the same, comments left\n * out: the overlap check accepts a type it does not model when it is the same as the other.\n */\n\nfunction nameKey(name: IrPropertyName): string {\n  return JSON.stringify(name.kind === \"string\" ? name.value : name.text);\n}\n\nfunction memberKey(member: IrMember, typeKeyOf: TypeKey): string {\n  if (member.kind === \"indexSignature\") {\n    const readonly = member.isReadonly ? \"readonly \" : \"\";\n    return `${readonly}[${typeKeyOf(member.parameterType)}]:${typeKeyOf(member.type)}`;\n  }\n  const readonly = member.isReadonly ? \"readonly \" : \"\";\n  const optional = member.isOptional ? \"?\" : \"\";\n  return `${readonly}${nameKey(member.name)}${optional}:${typeKeyOf(member.type)}`;\n}\n\nfunction listKey(types: readonly IrType[], typeKeyOf: TypeKey): string {\n  return types.map(typeKeyOf).join(\",\");\n}\n\nfunction elementKey(element: IrTupleElement, typeKeyOf: TypeKey): string {\n  const prefix = element.isRest ? \"...\" : \"\";\n  return `${prefix}${typeKeyOf(element.type)}${element.isOptional ? \"?\" : \"\"}`;\n}\n\nfunction computeKey(type: IrType, typeKeyOf: TypeKey): string {\n  switch (type.kind) {\n    case \"keyword\":\n      return type.keyword;\n    case \"stringLiteral\":\n      return JSON.stringify(type.value);\n    case \"numberLiteral\":\n    case \"booleanLiteral\":\n      return String(type.value);\n    case \"reference\":\n      return `${type.name}<${listKey(type.typeArguments, typeKeyOf)}>`;\n    case \"array\":\n      return `(${typeKeyOf(type.element)})[]`;\n    case \"tuple\":\n      return `[${type.elements.map((element) => elementKey(element, typeKeyOf)).join(\",\")}]`;\n    case \"union\":\n      return `union(${listKey(type.types, typeKeyOf)})`;\n    case \"intersection\":\n      return `intersection(${listKey(type.types, typeKeyOf)})`;\n    case \"object\":\n      return `{${type.members.map((member) => memberKey(member, typeKeyOf)).join(\";\")}}`;\n    case \"indexedAccess\":\n      return `${typeKeyOf(type.object)}[${typeKeyOf(type.index)}]`;\n    case \"readonly\":\n      return `readonly(${typeKeyOf(type.type)})`;\n    case \"raw\":\n      return `raw(${type.text})`;\n    default:\n      return assertNever(type);\n  }\n}\n\n/** The key of a type. */\nexport type TypeKey = (type: IrType) => string;\n\n/** A key function that computes each node's key once; one per comparison, not shared. */\nexport function createTypeKey(): TypeKey {\n  const keys = new WeakMap<IrType, string>();\n  const typeKeyOf: TypeKey = (type) => {\n    const known = keys.get(type);\n    if (known !== undefined) {\n      return known;\n    }\n    const key = computeKey(type, typeKeyOf);\n    keys.set(type, key);\n    return key;\n  };\n  return typeKeyOf;\n}\n"],"names":["readonly","assertNever"],"mappings":";;;;AAQA,SAAS,QAAQ,IAAA,EAA8B;AAC7C,EAAA,OAAO,IAAA,CAAK,UAAU,IAAA,CAAK,IAAA,KAAS,WAAW,IAAA,CAAK,KAAA,GAAQ,KAAK,IAAI,CAAA;AACvE;AAEA,SAAS,SAAA,CAAU,QAAkB,SAAA,EAA4B;AAC/D,EAAA,IAAI,MAAA,CAAO,SAAS,gBAAA,EAAkB;AACpC,IAAA,MAAMA,SAAAA,GAAW,MAAA,CAAO,UAAA,GAAa,WAAA,GAAc,EAAA;AACnD,IAAA,OAAO,CAAA,EAAGA,SAAQ,CAAA,CAAA,EAAI,SAAA,CAAU,MAAA,CAAO,aAAa,CAAC,CAAA,EAAA,EAAK,SAAA,CAAU,MAAA,CAAO,IAAI,CAAC,CAAA,CAAA;AAAA,EAClF;AACA,EAAA,MAAM,QAAA,GAAW,MAAA,CAAO,UAAA,GAAa,WAAA,GAAc,EAAA;AACnD,EAAA,MAAM,QAAA,GAAW,MAAA,CAAO,UAAA,GAAa,GAAA,GAAM,EAAA;AAC3C,EAAA,OAAO,CAAA,EAAG,QAAQ,CAAA,EAAG,OAAA,CAAQ,MAAA,CAAO,IAAI,CAAC,CAAA,EAAG,QAAQ,CAAA,CAAA,EAAI,SAAA,CAAU,MAAA,CAAO,IAAI,CAAC,CAAA,CAAA;AAChF;AAEA,SAAS,OAAA,CAAQ,OAA0B,SAAA,EAA4B;AACrE,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,SAAS,CAAA,CAAE,KAAK,GAAG,CAAA;AACtC;AAEA,SAAS,UAAA,CAAW,SAAyB,SAAA,EAA4B;AACvE,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,MAAA,GAAS,KAAA,GAAQ,EAAA;AACxC,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,EAAG,SAAA,CAAU,OAAA,CAAQ,IAAI,CAAC,CAAA,EAAG,OAAA,CAAQ,UAAA,GAAa,GAAA,GAAM,EAAE,CAAA,CAAA;AAC5E;AAEA,SAAS,UAAA,CAAW,MAAc,SAAA,EAA4B;AAC5D,EAAA,QAAQ,KAAK,IAAA;AAAM,IACjB,KAAK,SAAA;AACH,MAAA,OAAO,IAAA,CAAK,OAAA;AAAA,IACd,KAAK,eAAA;AACH,MAAA,OAAO,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,KAAK,CAAA;AAAA,IAClC,KAAK,eAAA;AAAA,IACL,KAAK,gBAAA;AACH,MAAA,OAAO,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,IAC1B,KAAK,WAAA;AACH,MAAA,OAAO,CAAA,EAAG,KAAK,IAAI,CAAA,CAAA,EAAI,QAAQ,IAAA,CAAK,aAAA,EAAe,SAAS,CAAC,CAAA,CAAA,CAAA;AAAA,IAC/D,KAAK,OAAA;AACH,MAAA,OAAO,CAAA,CAAA,EAAI,SAAA,CAAU,IAAA,CAAK,OAAO,CAAC,CAAA,GAAA,CAAA;AAAA,IACpC,KAAK,OAAA;AACH,MAAA,OAAO,CAAA,CAAA,EAAI,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,CAAC,OAAA,KAAY,UAAA,CAAW,OAAA,EAAS,SAAS,CAAC,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,IACrF,KAAK,OAAA;AACH,MAAA,OAAO,CAAA,MAAA,EAAS,OAAA,CAAQ,IAAA,CAAK,KAAA,EAAO,SAAS,CAAC,CAAA,CAAA,CAAA;AAAA,IAChD,KAAK,cAAA;AACH,MAAA,OAAO,CAAA,aAAA,EAAgB,OAAA,CAAQ,IAAA,CAAK,KAAA,EAAO,SAAS,CAAC,CAAA,CAAA,CAAA;AAAA,IACvD,KAAK,QAAA;AACH,MAAA,OAAO,CAAA,CAAA,EAAI,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,KAAW,SAAA,CAAU,MAAA,EAAQ,SAAS,CAAC,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,IACjF,KAAK,eAAA;AACH,MAAA,OAAO,CAAA,EAAG,UAAU,IAAA,CAAK,MAAM,CAAC,CAAA,CAAA,EAAI,SAAA,CAAU,IAAA,CAAK,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IAC3D,KAAK,UAAA;AACH,MAAA,OAAO,CAAA,SAAA,EAAY,SAAA,CAAU,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,IACzC,KAAK,KAAA;AACH,MAAA,OAAO,CAAA,IAAA,EAAO,KAAK,IAAI,CAAA,CAAA,CAAA;AAAA,IACzB;AACE,MAAA,OAAOC,wBAAY,IAAI,CAAA;AAAA;AAE7B;AAMO,SAAS,aAAA,GAAyB;AACvC,EAAA,MAAM,IAAA,uBAAW,OAAA,EAAwB;AACzC,EAAA,MAAM,SAAA,GAAqB,CAAC,IAAA,KAAS;AACnC,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,IAAI,CAAA;AAC3B,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,MAAM,GAAA,GAAM,UAAA,CAAW,IAAA,EAAM,SAAS,CAAA;AACtC,IAAA,IAAA,CAAK,GAAA,CAAI,MAAM,GAAG,CAAA;AAClB,IAAA,OAAO,GAAA;AAAA,EACT,CAAA;AACA,EAAA,OAAO,SAAA;AACT;;"}

package/dist/application/transform/document/type-key.mjs

@@ -0,0 +1,68 @@
+import { assertNever } from '../../../domain/assert-never.mjs';
+
+function nameKey(name) {
+  return JSON.stringify(name.kind === "string" ? name.value : name.text);
+}
+function memberKey(member, typeKeyOf) {
+  if (member.kind === "indexSignature") {
+    const readonly2 = member.isReadonly ? "readonly " : "";
+    return `${readonly2}[${typeKeyOf(member.parameterType)}]:${typeKeyOf(member.type)}`;
+  }
+  const readonly = member.isReadonly ? "readonly " : "";
+  const optional = member.isOptional ? "?" : "";
+  return `${readonly}${nameKey(member.name)}${optional}:${typeKeyOf(member.type)}`;
+}
+function listKey(types, typeKeyOf) {
+  return types.map(typeKeyOf).join(",");
+}
+function elementKey(element, typeKeyOf) {
+  const prefix = element.isRest ? "..." : "";
+  return `${prefix}${typeKeyOf(element.type)}${element.isOptional ? "?" : ""}`;
+}
+function computeKey(type, typeKeyOf) {
+  switch (type.kind) {
+    case "keyword":
+      return type.keyword;
+    case "stringLiteral":
+      return JSON.stringify(type.value);
+    case "numberLiteral":
+    case "booleanLiteral":
+      return String(type.value);
+    case "reference":
+      return `${type.name}<${listKey(type.typeArguments, typeKeyOf)}>`;
+    case "array":
+      return `(${typeKeyOf(type.element)})[]`;
+    case "tuple":
+      return `[${type.elements.map((element) => elementKey(element, typeKeyOf)).join(",")}]`;
+    case "union":
+      return `union(${listKey(type.types, typeKeyOf)})`;
+    case "intersection":
+      return `intersection(${listKey(type.types, typeKeyOf)})`;
+    case "object":
+      return `{${type.members.map((member) => memberKey(member, typeKeyOf)).join(";")}}`;
+    case "indexedAccess":
+      return `${typeKeyOf(type.object)}[${typeKeyOf(type.index)}]`;
+    case "readonly":
+      return `readonly(${typeKeyOf(type.type)})`;
+    case "raw":
+      return `raw(${type.text})`;
+    default:
+      return assertNever(type);
+  }
+}
+function createTypeKey() {
+  const keys = /* @__PURE__ */ new WeakMap();
+  const typeKeyOf = (type) => {
+    const known = keys.get(type);
+    if (known !== void 0) {
+      return known;
+    }
+    const key = computeKey(type, typeKeyOf);
+    keys.set(type, key);
+    return key;
+  };
+  return typeKeyOf;
+}
+
+export { createTypeKey };
+//# sourceMappingURL=type-key.mjs.map

package/dist/application/transform/document/type-key.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-key.mjs","sources":["../../../../src/application/transform/document/type-key.ts"],"sourcesContent":["import { assertNever } from \"../../../domain/assert-never.js\";\nimport type { IrMember, IrPropertyName, IrTupleElement, IrType } from \"../../../domain/ir/nodes.js\";\n\n/**\n * A text that is the same for two types exactly when they are written the same, comments left\n * out: the overlap check accepts a type it does not model when it is the same as the other.\n */\n\nfunction nameKey(name: IrPropertyName): string {\n  return JSON.stringify(name.kind === \"string\" ? name.value : name.text);\n}\n\nfunction memberKey(member: IrMember, typeKeyOf: TypeKey): string {\n  if (member.kind === \"indexSignature\") {\n    const readonly = member.isReadonly ? \"readonly \" : \"\";\n    return `${readonly}[${typeKeyOf(member.parameterType)}]:${typeKeyOf(member.type)}`;\n  }\n  const readonly = member.isReadonly ? \"readonly \" : \"\";\n  const optional = member.isOptional ? \"?\" : \"\";\n  return `${readonly}${nameKey(member.name)}${optional}:${typeKeyOf(member.type)}`;\n}\n\nfunction listKey(types: readonly IrType[], typeKeyOf: TypeKey): string {\n  return types.map(typeKeyOf).join(\",\");\n}\n\nfunction elementKey(element: IrTupleElement, typeKeyOf: TypeKey): string {\n  const prefix = element.isRest ? \"...\" : \"\";\n  return `${prefix}${typeKeyOf(element.type)}${element.isOptional ? \"?\" : \"\"}`;\n}\n\nfunction computeKey(type: IrType, typeKeyOf: TypeKey): string {\n  switch (type.kind) {\n    case \"keyword\":\n      return type.keyword;\n    case \"stringLiteral\":\n      return JSON.stringify(type.value);\n    case \"numberLiteral\":\n    case \"booleanLiteral\":\n      return String(type.value);\n    case \"reference\":\n      return `${type.name}<${listKey(type.typeArguments, typeKeyOf)}>`;\n    case \"array\":\n      return `(${typeKeyOf(type.element)})[]`;\n    case \"tuple\":\n      return `[${type.elements.map((element) => elementKey(element, typeKeyOf)).join(\",\")}]`;\n    case \"union\":\n      return `union(${listKey(type.types, typeKeyOf)})`;\n    case \"intersection\":\n      return `intersection(${listKey(type.types, typeKeyOf)})`;\n    case \"object\":\n      return `{${type.members.map((member) => memberKey(member, typeKeyOf)).join(\";\")}}`;\n    case \"indexedAccess\":\n      return `${typeKeyOf(type.object)}[${typeKeyOf(type.index)}]`;\n    case \"readonly\":\n      return `readonly(${typeKeyOf(type.type)})`;\n    case \"raw\":\n      return `raw(${type.text})`;\n    default:\n      return assertNever(type);\n  }\n}\n\n/** The key of a type. */\nexport type TypeKey = (type: IrType) => string;\n\n/** A key function that computes each node's key once; one per comparison, not shared. */\nexport function createTypeKey(): TypeKey {\n  const keys = new WeakMap<IrType, string>();\n  const typeKeyOf: TypeKey = (type) => {\n    const known = keys.get(type);\n    if (known !== undefined) {\n      return known;\n    }\n    const key = computeKey(type, typeKeyOf);\n    keys.set(type, key);\n    return key;\n  };\n  return typeKeyOf;\n}\n"],"names":["readonly"],"mappings":";;AAQA,SAAS,QAAQ,IAAA,EAA8B;AAC7C,EAAA,OAAO,IAAA,CAAK,UAAU,IAAA,CAAK,IAAA,KAAS,WAAW,IAAA,CAAK,KAAA,GAAQ,KAAK,IAAI,CAAA;AACvE;AAEA,SAAS,SAAA,CAAU,QAAkB,SAAA,EAA4B;AAC/D,EAAA,IAAI,MAAA,CAAO,SAAS,gBAAA,EAAkB;AACpC,IAAA,MAAMA,SAAAA,GAAW,MAAA,CAAO,UAAA,GAAa,WAAA,GAAc,EAAA;AACnD,IAAA,OAAO,CAAA,EAAGA,SAAQ,CAAA,CAAA,EAAI,SAAA,CAAU,MAAA,CAAO,aAAa,CAAC,CAAA,EAAA,EAAK,SAAA,CAAU,MAAA,CAAO,IAAI,CAAC,CAAA,CAAA;AAAA,EAClF;AACA,EAAA,MAAM,QAAA,GAAW,MAAA,CAAO,UAAA,GAAa,WAAA,GAAc,EAAA;AACnD,EAAA,MAAM,QAAA,GAAW,MAAA,CAAO,UAAA,GAAa,GAAA,GAAM,EAAA;AAC3C,EAAA,OAAO,CAAA,EAAG,QAAQ,CAAA,EAAG,OAAA,CAAQ,MAAA,CAAO,IAAI,CAAC,CAAA,EAAG,QAAQ,CAAA,CAAA,EAAI,SAAA,CAAU,MAAA,CAAO,IAAI,CAAC,CAAA,CAAA;AAChF;AAEA,SAAS,OAAA,CAAQ,OAA0B,SAAA,EAA4B;AACrE,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,SAAS,CAAA,CAAE,KAAK,GAAG,CAAA;AACtC;AAEA,SAAS,UAAA,CAAW,SAAyB,SAAA,EAA4B;AACvE,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,MAAA,GAAS,KAAA,GAAQ,EAAA;AACxC,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,EAAG,SAAA,CAAU,OAAA,CAAQ,IAAI,CAAC,CAAA,EAAG,OAAA,CAAQ,UAAA,GAAa,GAAA,GAAM,EAAE,CAAA,CAAA;AAC5E;AAEA,SAAS,UAAA,CAAW,MAAc,SAAA,EAA4B;AAC5D,EAAA,QAAQ,KAAK,IAAA;AAAM,IACjB,KAAK,SAAA;AACH,MAAA,OAAO,IAAA,CAAK,OAAA;AAAA,IACd,KAAK,eAAA;AACH,MAAA,OAAO,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,KAAK,CAAA;AAAA,IAClC,KAAK,eAAA;AAAA,IACL,KAAK,gBAAA;AACH,MAAA,OAAO,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,IAC1B,KAAK,WAAA;AACH,MAAA,OAAO,CAAA,EAAG,KAAK,IAAI,CAAA,CAAA,EAAI,QAAQ,IAAA,CAAK,aAAA,EAAe,SAAS,CAAC,CAAA,CAAA,CAAA;AAAA,IAC/D,KAAK,OAAA;AACH,MAAA,OAAO,CAAA,CAAA,EAAI,SAAA,CAAU,IAAA,CAAK,OAAO,CAAC,CAAA,GAAA,CAAA;AAAA,IACpC,KAAK,OAAA;AACH,MAAA,OAAO,CAAA,CAAA,EAAI,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,CAAC,OAAA,KAAY,UAAA,CAAW,OAAA,EAAS,SAAS,CAAC,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,IACrF,KAAK,OAAA;AACH,MAAA,OAAO,CAAA,MAAA,EAAS,OAAA,CAAQ,IAAA,CAAK,KAAA,EAAO,SAAS,CAAC,CAAA,CAAA,CAAA;AAAA,IAChD,KAAK,cAAA;AACH,MAAA,OAAO,CAAA,aAAA,EAAgB,OAAA,CAAQ,IAAA,CAAK,KAAA,EAAO,SAAS,CAAC,CAAA,CAAA,CAAA;AAAA,IACvD,KAAK,QAAA;AACH,MAAA,OAAO,CAAA,CAAA,EAAI,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,KAAW,SAAA,CAAU,MAAA,EAAQ,SAAS,CAAC,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,IACjF,KAAK,eAAA;AACH,MAAA,OAAO,CAAA,EAAG,UAAU,IAAA,CAAK,MAAM,CAAC,CAAA,CAAA,EAAI,SAAA,CAAU,IAAA,CAAK,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IAC3D,KAAK,UAAA;AACH,MAAA,OAAO,CAAA,SAAA,EAAY,SAAA,CAAU,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,IACzC,KAAK,KAAA;AACH,MAAA,OAAO,CAAA,IAAA,EAAO,KAAK,IAAI,CAAA,CAAA,CAAA;AAAA,IACzB;AACE,MAAA,OAAO,YAAY,IAAI,CAAA;AAAA;AAE7B;AAMO,SAAS,aAAA,GAAyB;AACvC,EAAA,MAAM,IAAA,uBAAW,OAAA,EAAwB;AACzC,EAAA,MAAM,SAAA,GAAqB,CAAC,IAAA,KAAS;AACnC,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,IAAI,CAAA;AAC3B,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,MAAM,GAAA,GAAM,UAAA,CAAW,IAAA,EAAM,SAAS,CAAA;AACtC,IAAA,IAAA,CAAK,GAAA,CAAI,MAAM,GAAG,CAAA;AAClB,IAAA,OAAO,GAAA;AAAA,EACT,CAAA;AACA,EAAA,OAAO,SAAA;AACT;;"}

package/dist/application/transform/document/type-resolution.cjs

@@ -0,0 +1,131 @@
+'use strict';
+
+const UNDEFINED = { kind: "keyword", keyword: "undefined" };
+function nameOf(member) {
+  return member.name.kind === "string" ? member.name.value : member.name.text;
+}
+function propertiesOf(type) {
+  const properties = type.members.filter(
+    (member) => member.kind === "property"
+  );
+  return new Map(properties.map((property) => [nameOf(property), property]));
+}
+function indexSignaturesOf(type) {
+  return type.members.filter(
+    (member) => member.kind === "indexSignature"
+  );
+}
+function readType(property) {
+  return property.isOptional ? { kind: "union", types: [property.type, UNDEFINED] } : property.type;
+}
+function arrayElement(type) {
+  const list = type.kind === "readonly" ? type.type : type;
+  return list.kind === "array" ? list.element : null;
+}
+function mergedProperty(first, second) {
+  return {
+    ...first,
+    type: { kind: "intersection", types: [first.type, second.type] },
+    isOptional: first.isOptional && second.isOptional,
+    isReadonly: first.isReadonly || second.isReadonly
+  };
+}
+class TypeResolution {
+  lookup;
+  resolvedTypes = /* @__PURE__ */ new Map();
+  constructor(lookup) {
+    this.lookup = lookup;
+  }
+  /** The type a reference names, followed through references to references; computed once. */
+  resolved(type) {
+    const known = this.resolvedTypes.get(type);
+    if (known !== void 0) {
+      return known;
+    }
+    this.resolvedTypes.set(type, type);
+    const seen = /* @__PURE__ */ new Set();
+    let current = type;
+    while (!seen.has(current)) {
+      seen.add(current);
+      const named = this.lookup(current) ?? this.indexedProperty(current);
+      if (named === null) {
+        break;
+      }
+      current = named;
+    }
+    const result = current.kind === "intersection" ? this.merged(current) ?? current : current;
+    this.resolvedTypes.set(type, result);
+    return result;
+  }
+  /**
+   * `T["key"]` read from the object type `T` resolves to, which the lookup does not do for an
+   * object it reached through another lookup (`paths["/a/{id}"]["get"]`). An optional property
+   * reads as `T | undefined`; `T[number]` is the element of the array `T`.
+   */
+  indexedProperty(type) {
+    if (type.kind !== "indexedAccess") {
+      return null;
+    }
+    const { index } = type;
+    if (index.kind === "keyword" && index.keyword === "number") {
+      return arrayElement(this.resolved(type.object));
+    }
+    const object = this.resolved(type.object);
+    if (index.kind !== "stringLiteral" || object.kind !== "object") {
+      return null;
+    }
+    const property = propertiesOf(object).get(index.value);
+    return property === void 0 ? null : readType(property);
+  }
+  /**
+   * An intersection of object types as the one object TypeScript makes of it: a property in
+   * several parts has the intersection of their types, and is optional only when it is in each.
+   * Null when a part is no object type.
+   */
+  merged(type) {
+    const parts = this.objectParts(type);
+    if (parts === null) {
+      return null;
+    }
+    const properties = /* @__PURE__ */ new Map();
+    const indexes = [];
+    for (const member of parts.flatMap((part) => part.members)) {
+      if (member.kind === "indexSignature") {
+        indexes.push(member);
+        continue;
+      }
+      const name = nameOf(member);
+      const other = properties.get(name);
+      properties.set(name, other === void 0 ? member : mergedProperty(other, member));
+    }
+    return { kind: "object", members: [...properties.values(), ...indexes] };
+  }
+  /**
+   * The object types an intersection is made of, nested ones flattened; null for any other, and
+   * for an intersection that contains itself, which TypeScript does not merge either.
+   */
+  objectParts(type, visiting = /* @__PURE__ */ new Set()) {
+    if (type.kind === "object") {
+      return [type];
+    }
+    if (type.kind !== "intersection" || visiting.has(type)) {
+      return null;
+    }
+    const parts = [];
+    for (const part of type.types) {
+      const objects = this.objectParts(this.resolved(part), /* @__PURE__ */ new Set([...visiting, type]));
+      if (objects === null) {
+        return null;
+      }
+      parts.push(...objects);
+    }
+    return parts;
+  }
+}
+
+exports.TypeResolution = TypeResolution;
+exports.indexSignaturesOf = indexSignaturesOf;
+exports.nameOf = nameOf;
+exports.propertiesOf = propertiesOf;
+exports.readType = readType;
+//# sourceMappingURL=type-resolution.cjs.map

package/dist/application/transform/document/type-resolution.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-resolution.cjs","sources":["../../../../src/application/transform/document/type-resolution.ts"],"sourcesContent":["import type {\n  IrIndexSignature,\n  IrMember,\n  IrObjectType,\n  IrPropertySignature,\n  IrType,\n} from \"../../../domain/ir/nodes.js\";\nimport type { DeclaredTypeLookup } from \"./declared-types.js\";\n\n/**\n * The types the `--path-params-as-types` overlap check compares, as TypeScript sees them:\n * references followed to the declarations of the document, `T[\"key\"]` and `T[number]` read from\n * `T`, and an intersection of object types merged into one object.\n */\n\nconst UNDEFINED: IrType = { kind: \"keyword\", keyword: \"undefined\" };\n\nexport function nameOf(member: IrPropertySignature): string {\n  return member.name.kind === \"string\" ? member.name.value : member.name.text;\n}\n\nexport function propertiesOf(type: IrObjectType): Map<string, IrPropertySignature> {\n  const properties = type.members.filter(\n    (member: IrMember): member is IrPropertySignature => member.kind === \"property\",\n  );\n  return new Map(properties.map((property) => [nameOf(property), property]));\n}\n\nexport function indexSignaturesOf(type: IrObjectType): IrIndexSignature[] {\n  return type.members.filter(\n    (member: IrMember): member is IrIndexSignature => member.kind === \"indexSignature\",\n  );\n}\n\n/** The type read from a property: an optional one may be `undefined`. */\nexport function readType(property: IrPropertySignature): IrType {\n  return property.isOptional ? { kind: \"union\", types: [property.type, UNDEFINED] } : property.type;\n}\n\n/**\n * `T[number]` for an array `T`, as the generator writes for an item of an array response: the\n * element type, readonly or not. A tuple's is the union of its elements, which is not modelled.\n */\nfunction arrayElement(type: IrType): IrType | null {\n  const list = type.kind === \"readonly\" ? type.type : type;\n  return list.kind === \"array\" ? list.element : null;\n}\n\n/** One property for two of the same name in an intersection. */\nfunction mergedProperty(\n  first: IrPropertySignature,\n  second: IrPropertySignature,\n): IrPropertySignature {\n  return {\n    ...first,\n    type: { kind: \"intersection\", types: [first.type, second.type] },\n    isOptional: first.isOptional && second.isOptional,\n    isReadonly: first.isReadonly || second.isReadonly,\n  };\n}\n\n/** Resolves types once each, for one comparison. */\nexport class TypeResolution {\n  private readonly lookup: DeclaredTypeLookup;\n  private readonly resolvedTypes = new Map<IrType, IrType>();\n\n  constructor(lookup: DeclaredTypeLookup) {\n    this.lookup = lookup;\n  }\n\n  /** The type a reference names, followed through references to references; computed once. */\n  resolved(type: IrType): IrType {\n    const known = this.resolvedTypes.get(type);\n    if (known !== undefined) {\n      return known;\n    }\n    // A type that reaches itself while it is resolved stays as it is written there.\n    this.resolvedTypes.set(type, type);\n    const seen = new Set<IrType>();\n    let current = type;\n    while (!seen.has(current)) {\n      seen.add(current);\n      const named = this.lookup(current) ?? this.indexedProperty(current);\n      if (named === null) {\n        break;\n      }\n      current = named;\n    }\n    const result = current.kind === \"intersection\" ? (this.merged(current) ?? current) : current;\n    this.resolvedTypes.set(type, result);\n    return result;\n  }\n\n  /**\n   * `T[\"key\"]` read from the object type `T` resolves to, which the lookup does not do for an\n   * object it reached through another lookup (`paths[\"/a/{id}\"][\"get\"]`). An optional property\n   * reads as `T | undefined`; `T[number]` is the element of the array `T`.\n   */\n  private indexedProperty(type: IrType): IrType | null {\n    if (type.kind !== \"indexedAccess\") {\n      return null;\n    }\n    const { index } = type;\n    if (index.kind === \"keyword\" && index.keyword === \"number\") {\n      return arrayElement(this.resolved(type.object));\n    }\n    const object = this.resolved(type.object);\n    if (index.kind !== \"stringLiteral\" || object.kind !== \"object\") {\n      return null;\n    }\n    const property = propertiesOf(object).get(index.value);\n    return property === undefined ? null : readType(property);\n  }\n\n  /**\n   * An intersection of object types as the one object TypeScript makes of it: a property in\n   * several parts has the intersection of their types, and is optional only when it is in each.\n   * Null when a part is no object type.\n   */\n  private merged(type: IrType): IrObjectType | null {\n    const parts = this.objectParts(type);\n    if (parts === null) {\n      return null;\n    }\n    const properties = new Map<string, IrPropertySignature>();\n    const indexes: IrIndexSignature[] = [];\n    for (const member of parts.flatMap((part) => part.members)) {\n      if (member.kind === \"indexSignature\") {\n        indexes.push(member);\n        continue;\n      }\n      const name = nameOf(member);\n      const other = properties.get(name);\n      properties.set(name, other === undefined ? member : mergedProperty(other, member));\n    }\n    return { kind: \"object\", members: [...properties.values(), ...indexes] };\n  }\n\n  /**\n   * The object types an intersection is made of, nested ones flattened; null for any other, and\n   * for an intersection that contains itself, which TypeScript does not merge either.\n   */\n  private objectParts(\n    type: IrType,\n    visiting: ReadonlySet<IrType> = new Set(),\n  ): IrObjectType[] | null {\n    if (type.kind === \"object\") {\n      return [type];\n    }\n    if (type.kind !== \"intersection\" || visiting.has(type)) {\n      return null;\n    }\n    const parts: IrObjectType[] = [];\n    for (const part of type.types) {\n      const objects = this.objectParts(this.resolved(part), new Set([...visiting, type]));\n      if (objects === null) {\n        return null;\n      }\n      parts.push(...objects);\n    }\n    return parts;\n  }\n}\n"],"names":[],"mappings":";;AAeA,MAAM,SAAA,GAAoB,EAAE,IAAA,EAAM,SAAA,EAAW,SAAS,WAAA,EAAY;AAE3D,SAAS,OAAO,MAAA,EAAqC;AAC1D,EAAA,OAAO,MAAA,CAAO,KAAK,IAAA,KAAS,QAAA,GAAW,OAAO,IAAA,CAAK,KAAA,GAAQ,OAAO,IAAA,CAAK,IAAA;AACzE;AAEO,SAAS,aAAa,IAAA,EAAsD;AACjF,EAAA,MAAM,UAAA,GAAa,KAAK,OAAA,CAAQ,MAAA;AAAA,IAC9B,CAAC,MAAA,KAAoD,MAAA,CAAO,IAAA,KAAS;AAAA,GACvE;AACA,EAAA,OAAO,IAAI,GAAA,CAAI,UAAA,CAAW,GAAA,CAAI,CAAC,QAAA,KAAa,CAAC,MAAA,CAAO,QAAQ,CAAA,EAAG,QAAQ,CAAC,CAAC,CAAA;AAC3E;AAEO,SAAS,kBAAkB,IAAA,EAAwC;AACxE,EAAA,OAAO,KAAK,OAAA,CAAQ,MAAA;AAAA,IAClB,CAAC,MAAA,KAAiD,MAAA,CAAO,IAAA,KAAS;AAAA,GACpE;AACF;AAGO,SAAS,SAAS,QAAA,EAAuC;AAC9D,EAAA,OAAO,QAAA,CAAS,UAAA,GAAa,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,CAAC,QAAA,CAAS,IAAA,EAAM,SAAS,CAAA,EAAE,GAAI,QAAA,CAAS,IAAA;AAC/F;AAMA,SAAS,aAAa,IAAA,EAA6B;AACjD,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,IAAA,KAAS,UAAA,GAAa,KAAK,IAAA,GAAO,IAAA;AACpD,EAAA,OAAO,IAAA,CAAK,IAAA,KAAS,OAAA,GAAU,IAAA,CAAK,OAAA,GAAU,IAAA;AAChD;AAGA,SAAS,cAAA,CACP,OACA,MAAA,EACqB;AACrB,EAAA,OAAO;AAAA,IACL,GAAG,KAAA;AAAA,IACH,IAAA,EAAM,EAAE,IAAA,EAAM,cAAA,EAAgB,KAAA,EAAO,CAAC,KAAA,CAAM,IAAA,EAAM,MAAA,CAAO,IAAI,CAAA,EAAE;AAAA,IAC/D,UAAA,EAAY,KAAA,CAAM,UAAA,IAAc,MAAA,CAAO,UAAA;AAAA,IACvC,UAAA,EAAY,KAAA,CAAM,UAAA,IAAc,MAAA,CAAO;AAAA,GACzC;AACF;AAGO,MAAM,cAAA,CAAe;AAAA,EACT,MAAA;AAAA,EACA,aAAA,uBAAoB,GAAA,EAAoB;AAAA,EAEzD,YAAY,MAAA,EAA4B;AACtC,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AAAA,EAChB;AAAA;AAAA,EAGA,SAAS,IAAA,EAAsB;AAC7B,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,IAAI,CAAA;AACzC,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,IAAA,EAAM,IAAI,CAAA;AACjC,IAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,IAAA,IAAI,OAAA,GAAU,IAAA;AACd,IAAA,OAAO,CAAC,IAAA,CAAK,GAAA,CAAI,OAAO,CAAA,EAAG;AACzB,MAAA,IAAA,CAAK,IAAI,OAAO,CAAA;AAChB,MAAA,MAAM,QAAQ,IAAA,CAAK,MAAA,CAAO,OAAO,CAAA,IAAK,IAAA,CAAK,gBAAgB,OAAO,CAAA;AAClE,MAAA,IAAI,UAAU,IAAA,EAAM;AAClB,QAAA;AAAA,MACF;AACA,MAAA,OAAA,GAAU,KAAA;AAAA,IACZ;AACA,IAAA,MAAM,MAAA,GAAS,QAAQ,IAAA,KAAS,cAAA,GAAkB,KAAK,MAAA,CAAO,OAAO,KAAK,OAAA,GAAW,OAAA;AACrF,IAAA,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,IAAA,EAAM,MAAM,CAAA;AACnC,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,gBAAgB,IAAA,EAA6B;AACnD,IAAA,IAAI,IAAA,CAAK,SAAS,eAAA,EAAiB;AACjC,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,MAAM,EAAE,OAAM,GAAI,IAAA;AAClB,IAAA,IAAI,KAAA,CAAM,IAAA,KAAS,SAAA,IAAa,KAAA,CAAM,YAAY,QAAA,EAAU;AAC1D,MAAA,OAAO,YAAA,CAAa,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,MAAM,CAAC,CAAA;AAAA,IAChD;AACA,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,MAAM,CAAA;AACxC,IAAA,IAAI,KAAA,CAAM,IAAA,KAAS,eAAA,IAAmB,MAAA,CAAO,SAAS,QAAA,EAAU;AAC9D,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,MAAM,WAAW,YAAA,CAAa,MAAM,CAAA,CAAE,GAAA,CAAI,MAAM,KAAK,CAAA;AACrD,IAAA,OAAO,QAAA,KAAa,MAAA,GAAY,IAAA,GAAO,QAAA,CAAS,QAAQ,CAAA;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,OAAO,IAAA,EAAmC;AAChD,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,WAAA,CAAY,IAAI,CAAA;AACnC,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,MAAM,UAAA,uBAAiB,GAAA,EAAiC;AACxD,IAAA,MAAM,UAA8B,EAAC;AACrC,IAAA,KAAA,MAAW,UAAU,KAAA,CAAM,OAAA,CAAQ,CAAC,IAAA,KAAS,IAAA,CAAK,OAAO,CAAA,EAAG;AAC1D,MAAA,IAAI,MAAA,CAAO,SAAS,gBAAA,EAAkB;AACpC,QAAA,OAAA,CAAQ,KAAK,MAAM,CAAA;AACnB,QAAA;AAAA,MACF;AACA,MAAA,MAAM,IAAA,GAAO,OAAO,MAAM,CAAA;AAC1B,MAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,GAAA,CAAI,IAAI,CAAA;AACjC,MAAA,UAAA,CAAW,GAAA,CAAI,MAAM,KAAA,KAAU,MAAA,GAAY,SAAS,cAAA,CAAe,KAAA,EAAO,MAAM,CAAC,CAAA;AAAA,IACnF;AACA,IAAA,OAAO,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,CAAC,GAAG,UAAA,CAAW,MAAA,EAAO,EAAG,GAAG,OAAO,CAAA,EAAE;AAAA,EACzE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,WAAA,CACN,IAAA,EACA,QAAA,mBAAgC,IAAI,KAAI,EACjB;AACvB,IAAA,IAAI,IAAA,CAAK,SAAS,QAAA,EAAU;AAC1B,MAAA,OAAO,CAAC,IAAI,CAAA;AAAA,IACd;AACA,IAAA,IAAI,KAAK,IAAA,KAAS,cAAA,IAAkB,QAAA,CAAS,GAAA,CAAI,IAAI,CAAA,EAAG;AACtD,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,MAAM,QAAwB,EAAC;AAC/B,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAK,KAAA,EAAO;AAC7B,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,WAAA,CAAY,IAAA,CAAK,SAAS,IAAI,CAAA,kBAAG,IAAI,GAAA,CAAI,CAAC,GAAG,QAAA,EAAU,IAAI,CAAC,CAAC,CAAA;AAClF,MAAA,IAAI,YAAY,IAAA,EAAM;AACpB,QAAA,OAAO,IAAA;AAAA,MACT;AACA,MAAA,KAAA,CAAM,IAAA,CAAK,GAAG,OAAO,CAAA;AAAA,IACvB;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACF;;;;;;"}