openapi-typesafe 0.0.0 → 1.0.0-rc.1

package/dist/application/transform/document/root-type-aliases.mjs

@@ -0,0 +1,67 @@
+import { irRaw } from '../../../domain/ir/constructors.mjs';
+import { escapeSingleQuotedText } from '../../../domain/ir/raw-text-escapes.mjs';
+import { globalTypeReferences } from './global-type-references.mjs';
+
+const REFERENCE_PREFIX = "components['";
+function rootTypeAlias(name, kind, item) {
+  return {
+    kind: "typeAlias",
+    name,
+    isExported: true,
+    // The original writes the reference as text, with single quotes, and did not escape the
+    // name: a quote in it could add code to the generated file (intentional fix).
+    type: irRaw(`${REFERENCE_PREFIX}${kind}']['${escapeSingleQuotedText(item)}']`),
+    comments: []
+  };
+}
+function isRootTypeAlias(declaration) {
+  return declaration.kind === "typeAlias" && declaration.type.kind === "raw" && declaration.type.text.startsWith(REFERENCE_PREFIX);
+}
+function footerTypeNames(declarations) {
+  return new Set(
+    declarations.flatMap((declaration) => {
+      if (declaration.kind === "enum") {
+        return [declaration.name];
+      }
+      return declaration.kind === "rawDeclaration" && declaration.name !== void 0 ? [declaration.name] : [];
+    })
+  );
+}
+function declaredNames(declarations) {
+  return new Set(
+    declarations.flatMap(
+      (declaration) => "name" in declaration && declaration.name !== void 0 ? [declaration.name] : []
+    )
+  );
+}
+function freeName(name, taken) {
+  let candidate = `${name}_2`;
+  for (let counter = 3; taken.has(candidate); counter++) {
+    candidate = `${name}_${counter}`;
+  }
+  return candidate;
+}
+function renameTakenAliases(body, footer, closing = []) {
+  const reserved = footerTypeNames(footer);
+  for (const name of globalTypeReferences([...body, ...footer, ...closing])) {
+    reserved.add(name);
+  }
+  const taken = declaredNames([...body, ...footer, ...closing]);
+  const aliasNames = /* @__PURE__ */ new Set();
+  return body.map((declaration) => {
+    if (!isRootTypeAlias(declaration)) {
+      return declaration;
+    }
+    const isRepeated = aliasNames.has(declaration.name);
+    aliasNames.add(declaration.name);
+    if (!isRepeated && !reserved.has(declaration.name)) {
+      return declaration;
+    }
+    const name = freeName(declaration.name, taken);
+    taken.add(name);
+    return { ...declaration, name };
+  });
+}
+
+export { renameTakenAliases, rootTypeAlias };
+//# sourceMappingURL=root-type-aliases.mjs.map

package/dist/application/transform/document/root-type-aliases.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"root-type-aliases.mjs","sources":["../../../../src/application/transform/document/root-type-aliases.ts"],"sourcesContent":["import { irRaw } from \"../../../domain/ir/constructors.js\";\nimport type { IrDeclaration, IrTypeAliasDeclaration } from \"../../../domain/ir/nodes.js\";\nimport { escapeSingleQuotedText } from \"../../../domain/ir/raw-text-escapes.js\";\nimport type { ComponentKind } from \"../../../domain/openapi/components-object.js\";\nimport { globalTypeReferences } from \"./global-type-references.js\";\n\n/** The `--root-types` aliases: `export type Pet = components['schemas']['Pet'];`. */\n\nconst REFERENCE_PREFIX = \"components['\";\n\n/** The alias of one component. */\nexport function rootTypeAlias(\n  name: string,\n  kind: ComponentKind,\n  item: string,\n): IrTypeAliasDeclaration {\n  return {\n    kind: \"typeAlias\",\n    name,\n    isExported: true,\n    // The original writes the reference as text, with single quotes, and did not escape the\n    // name: a quote in it could add code to the generated file (intentional fix).\n    type: irRaw(`${REFERENCE_PREFIX}${kind}']['${escapeSingleQuotedText(item)}']`),\n    comments: [],\n  };\n}\n\nfunction isRootTypeAlias(declaration: IrDeclaration): declaration is IrTypeAliasDeclaration {\n  return (\n    declaration.kind === \"typeAlias\" &&\n    declaration.type.kind === \"raw\" &&\n    declaration.type.text.startsWith(REFERENCE_PREFIX)\n  );\n}\n\n/**\n * The type names the footer declares that an alias must not take: enums, and helper types such as\n * `WithRequired`. Value declarations (`--enum-values` arrays) live in another namespace.\n */\nfunction footerTypeNames(declarations: readonly IrDeclaration[]): Set<string> {\n  return new Set(\n    declarations.flatMap((declaration) => {\n      if (declaration.kind === \"enum\") {\n        return [declaration.name];\n      }\n      return declaration.kind === \"rawDeclaration\" && declaration.name !== undefined\n        ? [declaration.name]\n        : [];\n    }),\n  );\n}\n\nfunction declaredNames(declarations: readonly IrDeclaration[]): Set<string> {\n  return new Set(\n    declarations.flatMap((declaration) =>\n      \"name\" in declaration && declaration.name !== undefined ? [declaration.name] : [],\n    ),\n  );\n}\n\nfunction freeName(name: string, taken: ReadonlySet<string>): string {\n  let candidate = `${name}_2`;\n  for (let counter = 3; taken.has(candidate); counter++) {\n    candidate = `${name}_${counter}`;\n  }\n  return candidate;\n}\n\n/**\n * Rename each root alias whose name an enum or a helper type of the footer also declares, or that\n * shadows a TypeScript global type the output refers to (`Record` in `Record<string, never>`), to\n * the next free `Name_2`, `Name_3`, … (the suffix `--root-types` uses for its own conflicts). The\n * footer and the globals keep their names, because the generated types refer to them. Before, the\n * output did not compile (enums: upstream #2099, #2341, #2206; helpers: a schema named\n * `WithRequired`, roadmap R11; globals: TS2315). Other declarations are returned unchanged.\n *\n * With the `root-type-numbering` fix (ADR-021, roadmap R13, backlog 30) the body also holds the\n * aliases a later schema of one exported name took the name from, after the other aliases and\n * under that same name. Each gets the next free number in body order, after the alias that kept\n * the name got its own: so the fix only adds exports, and every other alias keeps the name it has\n * without the fix.\n */\nexport function renameTakenAliases<T extends IrDeclaration>(\n  body: readonly T[],\n  footer: readonly IrDeclaration[],\n  closing: readonly IrDeclaration[] = [],\n): T[] {\n  const reserved = footerTypeNames(footer);\n  for (const name of globalTypeReferences([...body, ...footer, ...closing])) {\n    reserved.add(name);\n  }\n  const taken = declaredNames([...body, ...footer, ...closing]);\n  const aliasNames = new Set<string>();\n  return body.map((declaration) => {\n    if (!isRootTypeAlias(declaration)) {\n      return declaration;\n    }\n    const isRepeated = aliasNames.has(declaration.name);\n    aliasNames.add(declaration.name);\n    if (!isRepeated && !reserved.has(declaration.name)) {\n      return declaration;\n    }\n    const name = freeName(declaration.name, taken);\n    taken.add(name);\n    return { ...declaration, name };\n  });\n}\n"],"names":[],"mappings":";;;;AAQA,MAAM,gBAAA,GAAmB,cAAA;AAGlB,SAAS,aAAA,CACd,IAAA,EACA,IAAA,EACA,IAAA,EACwB;AACxB,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,WAAA;AAAA,IACN,IAAA;AAAA,IACA,UAAA,EAAY,IAAA;AAAA;AAAA;AAAA,IAGZ,IAAA,EAAM,KAAA,CAAM,CAAA,EAAG,gBAAgB,CAAA,EAAG,IAAI,CAAA,IAAA,EAAO,sBAAA,CAAuB,IAAI,CAAC,CAAA,EAAA,CAAI,CAAA;AAAA,IAC7E,UAAU;AAAC,GACb;AACF;AAEA,SAAS,gBAAgB,WAAA,EAAmE;AAC1F,EAAA,OACE,WAAA,CAAY,IAAA,KAAS,WAAA,IACrB,WAAA,CAAY,IAAA,CAAK,IAAA,KAAS,KAAA,IAC1B,WAAA,CAAY,IAAA,CAAK,IAAA,CAAK,UAAA,CAAW,gBAAgB,CAAA;AAErD;AAMA,SAAS,gBAAgB,YAAA,EAAqD;AAC5E,EAAA,OAAO,IAAI,GAAA;AAAA,IACT,YAAA,CAAa,OAAA,CAAQ,CAAC,WAAA,KAAgB;AACpC,MAAA,IAAI,WAAA,CAAY,SAAS,MAAA,EAAQ;AAC/B,QAAA,OAAO,CAAC,YAAY,IAAI,CAAA;AAAA,MAC1B;AACA,MAAA,OAAO,WAAA,CAAY,IAAA,KAAS,gBAAA,IAAoB,WAAA,CAAY,IAAA,KAAS,SACjE,CAAC,WAAA,CAAY,IAAI,CAAA,GACjB,EAAC;AAAA,IACP,CAAC;AAAA,GACH;AACF;AAEA,SAAS,cAAc,YAAA,EAAqD;AAC1E,EAAA,OAAO,IAAI,GAAA;AAAA,IACT,YAAA,CAAa,OAAA;AAAA,MAAQ,CAAC,WAAA,KACpB,MAAA,IAAU,WAAA,IAAe,WAAA,CAAY,IAAA,KAAS,MAAA,GAAY,CAAC,WAAA,CAAY,IAAI,CAAA,GAAI;AAAC;AAClF,GACF;AACF;AAEA,SAAS,QAAA,CAAS,MAAc,KAAA,EAAoC;AAClE,EAAA,IAAI,SAAA,GAAY,GAAG,IAAI,CAAA,EAAA,CAAA;AACvB,EAAA,KAAA,IAAS,UAAU,CAAA,EAAG,KAAA,CAAM,GAAA,CAAI,SAAS,GAAG,OAAA,EAAA,EAAW;AACrD,IAAA,SAAA,GAAY,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,OAAO,CAAA,CAAA;AAAA,EAChC;AACA,EAAA,OAAO,SAAA;AACT;AAgBO,SAAS,kBAAA,CACd,IAAA,EACA,MAAA,EACA,OAAA,GAAoC,EAAC,EAChC;AACL,EAAA,MAAM,QAAA,GAAW,gBAAgB,MAAM,CAAA;AACvC,EAAA,KAAA,MAAW,IAAA,IAAQ,oBAAA,CAAqB,CAAC,GAAG,IAAA,EAAM,GAAG,MAAA,EAAQ,GAAG,OAAO,CAAC,CAAA,EAAG;AACzE,IAAA,QAAA,CAAS,IAAI,IAAI,CAAA;AAAA,EACnB;AACA,EAAA,MAAM,KAAA,GAAQ,cAAc,CAAC,GAAG,MAAM,GAAG,MAAA,EAAQ,GAAG,OAAO,CAAC,CAAA;AAC5D,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AACnC,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,WAAA,KAAgB;AAC/B,IAAA,IAAI,CAAC,eAAA,CAAgB,WAAW,CAAA,EAAG;AACjC,MAAA,OAAO,WAAA;AAAA,IACT;AACA,IAAA,MAAM,UAAA,GAAa,UAAA,CAAW,GAAA,CAAI,WAAA,CAAY,IAAI,CAAA;AAClD,IAAA,UAAA,CAAW,GAAA,CAAI,YAAY,IAAI,CAAA;AAC/B,IAAA,IAAI,CAAC,UAAA,IAAc,CAAC,SAAS,GAAA,CAAI,WAAA,CAAY,IAAI,CAAA,EAAG;AAClD,MAAA,OAAO,WAAA;AAAA,IACT;AACA,IAAA,MAAM,IAAA,GAAO,QAAA,CAAS,WAAA,CAAY,IAAA,EAAM,KAAK,CAAA;AAC7C,IAAA,KAAA,CAAM,IAAI,IAAI,CAAA;AACd,IAAA,OAAO,EAAE,GAAG,WAAA,EAAa,IAAA,EAAK;AAAA,EAChC,CAAC,CAAA;AACH;;"}

package/dist/application/transform/document/template-key-match.cjs

@@ -0,0 +1,128 @@
+'use strict';
+
+function textAt(shape, index) {
+  return shape.texts[index];
+}
+function isNumberText(text) {
+  return text !== "" && Number.isFinite(Number(text));
+}
+function isValidMatch(match, placeholder) {
+  if (placeholder === "string") {
+    return true;
+  }
+  if (match.kind === "text") {
+    return isNumberText(match.text);
+  }
+  const { texts, types } = match.shape;
+  return texts.length === 2 && texts[0] === "" && texts[1] === "" && types[0] === "number";
+}
+class LiteralPartsScan {
+  matches = [];
+  cursor;
+  source;
+  lastSourceIndex;
+  remainingEndText;
+  constructor(source, startPosition, endTextLength) {
+    this.source = source;
+    this.lastSourceIndex = source.texts.length - 1;
+    const endText = textAt(source, this.lastSourceIndex);
+    this.remainingEndText = endText.slice(0, endText.length - endTextLength);
+    this.cursor = { segment: 0, position: startPosition };
+  }
+  /** The matches for the target's texts between its first and last; null when one is missing. */
+  run(delimiters) {
+    for (const delimiter of delimiters) {
+      if (!this.matchDelimiter(delimiter)) {
+        return null;
+      }
+    }
+    this.addMatch(this.lastSourceIndex, this.sourceText(this.lastSourceIndex).length);
+    return this.matches;
+  }
+  matchDelimiter(delimiter) {
+    const { segment, position } = this.cursor;
+    if (delimiter.length > 0) {
+      const found = this.find(delimiter);
+      if (found === null) {
+        return false;
+      }
+      this.addMatch(found.segment, found.position);
+      this.cursor = { ...this.cursor, position: this.cursor.position + delimiter.length };
+      return true;
+    }
+    if (position < this.sourceText(segment).length) {
+      this.addMatch(segment, position + 1);
+      return true;
+    }
+    if (segment < this.lastSourceIndex) {
+      this.addMatch(segment + 1, 0);
+      return true;
+    }
+    return false;
+  }
+  /** The first occurrence of the delimiter at or after the cursor, in this or a later text. */
+  find(delimiter) {
+    let { segment, position } = this.cursor;
+    while (segment < this.source.texts.length) {
+      const index = this.sourceText(segment).indexOf(delimiter, position);
+      if (index >= 0) {
+        return { segment, position: index };
+      }
+      segment += 1;
+      position = 0;
+    }
+    return null;
+  }
+  sourceText(index) {
+    return index < this.lastSourceIndex ? textAt(this.source, index) : this.remainingEndText;
+  }
+  addMatch(segment, position) {
+    const start = this.cursor;
+    if (segment === start.segment) {
+      const text = this.sourceText(segment).slice(start.position, position);
+      this.matches.push({ kind: "text", text });
+    } else {
+      const texts = [
+        textAt(this.source, start.segment).slice(start.position),
+        ...this.source.texts.slice(start.segment + 1, segment),
+        this.sourceText(segment).slice(0, position)
+      ];
+      const types = this.source.types.slice(start.segment, segment);
+      this.matches.push({ kind: "template", shape: { texts, types } });
+    }
+    this.cursor = { segment, position };
+  }
+}
+function inferMatches(source, target) {
+  const sourceStart = textAt(source, 0);
+  const sourceEnd = textAt(source, source.texts.length - 1);
+  const targetStart = textAt(target, 0);
+  const targetEnd = textAt(target, target.texts.length - 1);
+  const isTooShort = source.texts.length === 1 && sourceStart.length < targetStart.length + targetEnd.length;
+  if (isTooShort || !sourceStart.startsWith(targetStart) || !sourceEnd.endsWith(targetEnd)) {
+    return null;
+  }
+  const scan = new LiteralPartsScan(source, targetStart.length, targetEnd.length);
+  return scan.run(target.texts.slice(1, -1));
+}
+function haveSameTexts(source, target) {
+  return source.texts.length === target.texts.length && source.texts.every((text, index) => text === target.texts[index]);
+}
+function isAssignableToTemplate(source, target) {
+  if (source.types.length > 0 && haveSameTexts(source, target)) {
+    return source.types.every((type, index) => {
+      const placeholder = target.types[index];
+      return placeholder === "string" || type === placeholder;
+    });
+  }
+  const matches = inferMatches(source, target);
+  const isEveryMatchValid = matches?.every((match, index) => {
+    const placeholder = target.types[index];
+    return placeholder !== void 0 && isValidMatch(match, placeholder);
+  });
+  return isEveryMatchValid === true;
+}
+
+exports.isAssignableToTemplate = isAssignableToTemplate;
+exports.isNumberText = isNumberText;
+//# sourceMappingURL=template-key-match.cjs.map

package/dist/application/transform/document/template-key-match.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"template-key-match.cjs","sources":["../../../../src/application/transform/document/template-key-match.ts"],"sourcesContent":["/**\n * Whether a key type is assignable to a template literal key type, decided the way TypeScript's\n * checker decides it (`inferFromLiteralPartsToTemplateLiteral` and\n * `isValidTypeForTemplateLiteralPlaceholder` in TypeScript 5 and 6). An index signature checks\n * exactly the keys that are assignable to its key type, so the overlap check must match the\n * checker, not the strings a template stands for: the checker matches each text of the target at\n * its first occurrence, so it misses some keys a regular expression would match, and a key it\n * misses is never checked against the signature.\n */\n\n/** A placeholder type of a template, after `${boolean}` became the texts `true` and `false`. */\nexport type TemplatePlaceholder = \"string\" | \"number\";\n\n/**\n * A key type as TypeScript stores a template literal: texts around placeholders, one more text\n * than placeholders. A string literal is one text and no placeholder.\n */\nexport interface TemplateShape {\n  readonly texts: readonly string[];\n  readonly types: readonly TemplatePlaceholder[];\n}\n\n/** The text at an index of the shape; every caller passes one of `0 .. types.length`. */\nfunction textAt(shape: TemplateShape, index: number): string {\n  return shape.texts[index] as string;\n}\n\n/** The type the checker infers for one target placeholder: a text, or a slice of the source. */\ntype InferredMatch =\n  | { readonly kind: \"text\"; readonly text: string }\n  | { readonly kind: \"template\"; readonly shape: TemplateShape };\n\n/** TypeScript's `isValidNumberString(text, false)`: a text that converts to a finite number. */\nexport function isNumberText(text: string): boolean {\n  return text !== \"\" && Number.isFinite(Number(text));\n}\n\n/** Whether the inferred type fits a placeholder: any string for `string`, a number for `number`. */\nfunction isValidMatch(match: InferredMatch, placeholder: TemplatePlaceholder): boolean {\n  if (placeholder === \"string\") {\n    return true;\n  }\n  if (match.kind === \"text\") {\n    return isNumberText(match.text);\n  }\n  const { texts, types } = match.shape;\n  return texts.length === 2 && texts[0] === \"\" && texts[1] === \"\" && types[0] === \"number\";\n}\n\n/** The state of the scan through the source: the current text and the position in it. */\ninterface Cursor {\n  readonly segment: number;\n  readonly position: number;\n}\n\n/** The scan of `inferFromLiteralPartsToTemplateLiteral`, over one source and one target. */\nclass LiteralPartsScan {\n  private readonly matches: InferredMatch[] = [];\n  private cursor: Cursor;\n  private readonly source: TemplateShape;\n  private readonly lastSourceIndex: number;\n  private readonly remainingEndText: string;\n\n  constructor(source: TemplateShape, startPosition: number, endTextLength: number) {\n    this.source = source;\n    this.lastSourceIndex = source.texts.length - 1;\n    const endText = textAt(source, this.lastSourceIndex);\n    this.remainingEndText = endText.slice(0, endText.length - endTextLength);\n    this.cursor = { segment: 0, position: startPosition };\n  }\n\n  /** The matches for the target's texts between its first and last; null when one is missing. */\n  run(delimiters: readonly string[]): readonly InferredMatch[] | null {\n    for (const delimiter of delimiters) {\n      if (!this.matchDelimiter(delimiter)) {\n        return null;\n      }\n    }\n    this.addMatch(this.lastSourceIndex, this.sourceText(this.lastSourceIndex).length);\n    return this.matches;\n  }\n\n  private matchDelimiter(delimiter: string): boolean {\n    const { segment, position } = this.cursor;\n    if (delimiter.length > 0) {\n      const found = this.find(delimiter);\n      if (found === null) {\n        return false;\n      }\n      this.addMatch(found.segment, found.position);\n      this.cursor = { ...this.cursor, position: this.cursor.position + delimiter.length };\n      return true;\n    }\n    if (position < this.sourceText(segment).length) {\n      this.addMatch(segment, position + 1);\n      return true;\n    }\n    if (segment < this.lastSourceIndex) {\n      this.addMatch(segment + 1, 0);\n      return true;\n    }\n    return false;\n  }\n\n  /** The first occurrence of the delimiter at or after the cursor, in this or a later text. */\n  private find(delimiter: string): Cursor | null {\n    let { segment, position } = this.cursor;\n    while (segment < this.source.texts.length) {\n      const index = this.sourceText(segment).indexOf(delimiter, position);\n      if (index >= 0) {\n        return { segment, position: index };\n      }\n      segment += 1;\n      position = 0;\n    }\n    return null;\n  }\n\n  private sourceText(index: number): string {\n    return index < this.lastSourceIndex ? textAt(this.source, index) : this.remainingEndText;\n  }\n\n  private addMatch(segment: number, position: number): void {\n    const start = this.cursor;\n    if (segment === start.segment) {\n      const text = this.sourceText(segment).slice(start.position, position);\n      this.matches.push({ kind: \"text\", text });\n    } else {\n      const texts = [\n        textAt(this.source, start.segment).slice(start.position),\n        ...this.source.texts.slice(start.segment + 1, segment),\n        this.sourceText(segment).slice(0, position),\n      ];\n      const types = this.source.types.slice(start.segment, segment);\n      this.matches.push({ kind: \"template\", shape: { texts, types } });\n    }\n    this.cursor = { segment, position };\n  }\n}\n\n/** The checker's inferences for the target's placeholders; null when the texts do not fit. */\nfunction inferMatches(\n  source: TemplateShape,\n  target: TemplateShape,\n): readonly InferredMatch[] | null {\n  const sourceStart = textAt(source, 0);\n  const sourceEnd = textAt(source, source.texts.length - 1);\n  const targetStart = textAt(target, 0);\n  const targetEnd = textAt(target, target.texts.length - 1);\n  const isTooShort =\n    source.texts.length === 1 && sourceStart.length < targetStart.length + targetEnd.length;\n  if (isTooShort || !sourceStart.startsWith(targetStart) || !sourceEnd.endsWith(targetEnd)) {\n    return null;\n  }\n  const scan = new LiteralPartsScan(source, targetStart.length, targetEnd.length);\n  return scan.run(target.texts.slice(1, -1));\n}\n\nfunction haveSameTexts(source: TemplateShape, target: TemplateShape): boolean {\n  return (\n    source.texts.length === target.texts.length &&\n    source.texts.every((text, index) => text === target.texts[index])\n  );\n}\n\n/**\n * Whether the source key type is assignable to the target template. Templates with the same texts\n * compare placeholder by placeholder (`inferTypesFromTemplateLiteralType`).\n */\nexport function isAssignableToTemplate(source: TemplateShape, target: TemplateShape): boolean {\n  if (source.types.length > 0 && haveSameTexts(source, target)) {\n    return source.types.every((type, index) => {\n      const placeholder = target.types[index];\n      return placeholder === \"string\" || type === placeholder;\n    });\n  }\n  const matches = inferMatches(source, target);\n  const isEveryMatchValid = matches?.every((match, index) => {\n    const placeholder = target.types[index];\n    return placeholder !== undefined && isValidMatch(match, placeholder);\n  });\n  return isEveryMatchValid === true;\n}\n"],"names":[],"mappings":";;AAuBA,SAAS,MAAA,CAAO,OAAsB,KAAA,EAAuB;AAC3D,EAAA,OAAO,KAAA,CAAM,MAAM,KAAK,CAAA;AAC1B;AAQO,SAAS,aAAa,IAAA,EAAuB;AAClD,EAAA,OAAO,SAAS,EAAA,IAAM,MAAA,CAAO,QAAA,CAAS,MAAA,CAAO,IAAI,CAAC,CAAA;AACpD;AAGA,SAAS,YAAA,CAAa,OAAsB,WAAA,EAA2C;AACrF,EAAA,IAAI,gBAAgB,QAAA,EAAU;AAC5B,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,KAAA,CAAM,SAAS,MAAA,EAAQ;AACzB,IAAA,OAAO,YAAA,CAAa,MAAM,IAAI,CAAA;AAAA,EAChC;AACA,EAAA,MAAM,EAAE,KAAA,EAAO,KAAA,EAAM,GAAI,KAAA,CAAM,KAAA;AAC/B,EAAA,OAAO,KAAA,CAAM,MAAA,KAAW,CAAA,IAAK,KAAA,CAAM,CAAC,CAAA,KAAM,EAAA,IAAM,KAAA,CAAM,CAAC,CAAA,KAAM,EAAA,IAAM,KAAA,CAAM,CAAC,CAAA,KAAM,QAAA;AAClF;AASA,MAAM,gBAAA,CAAiB;AAAA,EACJ,UAA2B,EAAC;AAAA,EACrC,MAAA;AAAA,EACS,MAAA;AAAA,EACA,eAAA;AAAA,EACA,gBAAA;AAAA,EAEjB,WAAA,CAAY,MAAA,EAAuB,aAAA,EAAuB,aAAA,EAAuB;AAC/E,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AACd,IAAA,IAAA,CAAK,eAAA,GAAkB,MAAA,CAAO,KAAA,CAAM,MAAA,GAAS,CAAA;AAC7C,IAAA,MAAM,OAAA,GAAU,MAAA,CAAO,MAAA,EAAQ,IAAA,CAAK,eAAe,CAAA;AACnD,IAAA,IAAA,CAAK,mBAAmB,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,OAAA,CAAQ,SAAS,aAAa,CAAA;AACvE,IAAA,IAAA,CAAK,MAAA,GAAS,EAAE,OAAA,EAAS,CAAA,EAAG,UAAU,aAAA,EAAc;AAAA,EACtD;AAAA;AAAA,EAGA,IAAI,UAAA,EAAgE;AAClE,IAAA,KAAA,MAAW,aAAa,UAAA,EAAY;AAClC,MAAA,IAAI,CAAC,IAAA,CAAK,cAAA,CAAe,SAAS,CAAA,EAAG;AACnC,QAAA,OAAO,IAAA;AAAA,MACT;AAAA,IACF;AACA,IAAA,IAAA,CAAK,QAAA,CAAS,KAAK,eAAA,EAAiB,IAAA,CAAK,WAAW,IAAA,CAAK,eAAe,EAAE,MAAM,CAAA;AAChF,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA,EAEQ,eAAe,SAAA,EAA4B;AACjD,IAAA,MAAM,EAAE,OAAA,EAAS,QAAA,EAAS,GAAI,IAAA,CAAK,MAAA;AACnC,IAAA,IAAI,SAAA,CAAU,SAAS,CAAA,EAAG;AACxB,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,IAAA,CAAK,SAAS,CAAA;AACjC,MAAA,IAAI,UAAU,IAAA,EAAM;AAClB,QAAA,OAAO,KAAA;AAAA,MACT;AACA,MAAA,IAAA,CAAK,QAAA,CAAS,KAAA,CAAM,OAAA,EAAS,KAAA,CAAM,QAAQ,CAAA;AAC3C,MAAA,IAAA,CAAK,MAAA,GAAS,EAAE,GAAG,IAAA,CAAK,MAAA,EAAQ,UAAU,IAAA,CAAK,MAAA,CAAO,QAAA,GAAW,SAAA,CAAU,MAAA,EAAO;AAClF,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,QAAA,GAAW,IAAA,CAAK,UAAA,CAAW,OAAO,EAAE,MAAA,EAAQ;AAC9C,MAAA,IAAA,CAAK,QAAA,CAAS,OAAA,EAAS,QAAA,GAAW,CAAC,CAAA;AACnC,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,OAAA,GAAU,KAAK,eAAA,EAAiB;AAClC,MAAA,IAAA,CAAK,QAAA,CAAS,OAAA,GAAU,CAAA,EAAG,CAAC,CAAA;AAC5B,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA,EAGQ,KAAK,SAAA,EAAkC;AAC7C,IAAA,IAAI,EAAE,OAAA,EAAS,QAAA,EAAS,GAAI,IAAA,CAAK,MAAA;AACjC,IAAA,OAAO,OAAA,GAAU,IAAA,CAAK,MAAA,CAAO,KAAA,CAAM,MAAA,EAAQ;AACzC,MAAA,MAAM,QAAQ,IAAA,CAAK,UAAA,CAAW,OAAO,CAAA,CAAE,OAAA,CAAQ,WAAW,QAAQ,CAAA;AAClE,MAAA,IAAI,SAAS,CAAA,EAAG;AACd,QAAA,OAAO,EAAE,OAAA,EAAS,QAAA,EAAU,KAAA,EAAM;AAAA,MACpC;AACA,MAAA,OAAA,IAAW,CAAA;AACX,MAAA,QAAA,GAAW,CAAA;AAAA,IACb;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEQ,WAAW,KAAA,EAAuB;AACxC,IAAA,OAAO,KAAA,GAAQ,KAAK,eAAA,GAAkB,MAAA,CAAO,KAAK,MAAA,EAAQ,KAAK,IAAI,IAAA,CAAK,gBAAA;AAAA,EAC1E;AAAA,EAEQ,QAAA,CAAS,SAAiB,QAAA,EAAwB;AACxD,IAAA,MAAM,QAAQ,IAAA,CAAK,MAAA;AACnB,IAAA,IAAI,OAAA,KAAY,MAAM,OAAA,EAAS;AAC7B,MAAA,MAAM,IAAA,GAAO,KAAK,UAAA,CAAW,OAAO,EAAE,KAAA,CAAM,KAAA,CAAM,UAAU,QAAQ,CAAA;AACpE,MAAA,IAAA,CAAK,QAAQ,IAAA,CAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,MAAM,CAAA;AAAA,IAC1C,CAAA,MAAO;AACL,MAAA,MAAM,KAAA,GAAQ;AAAA,QACZ,MAAA,CAAO,KAAK,MAAA,EAAQ,KAAA,CAAM,OAAO,CAAA,CAAE,KAAA,CAAM,MAAM,QAAQ,CAAA;AAAA,QACvD,GAAG,KAAK,MAAA,CAAO,KAAA,CAAM,MAAM,KAAA,CAAM,OAAA,GAAU,GAAG,OAAO,CAAA;AAAA,QACrD,KAAK,UAAA,CAAW,OAAO,CAAA,CAAE,KAAA,CAAM,GAAG,QAAQ;AAAA,OAC5C;AACA,MAAA,MAAM,QAAQ,IAAA,CAAK,MAAA,CAAO,MAAM,KAAA,CAAM,KAAA,CAAM,SAAS,OAAO,CAAA;AAC5D,MAAA,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,EAAE,IAAA,EAAM,UAAA,EAAY,OAAO,EAAE,KAAA,EAAO,KAAA,EAAM,EAAG,CAAA;AAAA,IACjE;AACA,IAAA,IAAA,CAAK,MAAA,GAAS,EAAE,OAAA,EAAS,QAAA,EAAS;AAAA,EACpC;AACF;AAGA,SAAS,YAAA,CACP,QACA,MAAA,EACiC;AACjC,EAAA,MAAM,WAAA,GAAc,MAAA,CAAO,MAAA,EAAQ,CAAC,CAAA;AACpC,EAAA,MAAM,YAAY,MAAA,CAAO,MAAA,EAAQ,MAAA,CAAO,KAAA,CAAM,SAAS,CAAC,CAAA;AACxD,EAAA,MAAM,WAAA,GAAc,MAAA,CAAO,MAAA,EAAQ,CAAC,CAAA;AACpC,EAAA,MAAM,YAAY,MAAA,CAAO,MAAA,EAAQ,MAAA,CAAO,KAAA,CAAM,SAAS,CAAC,CAAA;AACxD,EAAA,MAAM,UAAA,GACJ,OAAO,KAAA,CAAM,MAAA,KAAW,KAAK,WAAA,CAAY,MAAA,GAAS,WAAA,CAAY,MAAA,GAAS,SAAA,CAAU,MAAA;AACnF,EAAA,IAAI,UAAA,IAAc,CAAC,WAAA,CAAY,UAAA,CAAW,WAAW,KAAK,CAAC,SAAA,CAAU,QAAA,CAAS,SAAS,CAAA,EAAG;AACxF,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAO,IAAI,gBAAA,CAAiB,QAAQ,WAAA,CAAY,MAAA,EAAQ,UAAU,MAAM,CAAA;AAC9E,EAAA,OAAO,KAAK,GAAA,CAAI,MAAA,CAAO,MAAM,KAAA,CAAM,CAAA,EAAG,EAAE,CAAC,CAAA;AAC3C;AAEA,SAAS,aAAA,CAAc,QAAuB,MAAA,EAAgC;AAC5E,EAAA,OACE,OAAO,KAAA,CAAM,MAAA,KAAW,MAAA,CAAO,KAAA,CAAM,UACrC,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,CAAC,MAAM,KAAA,KAAU,IAAA,KAAS,MAAA,CAAO,KAAA,CAAM,KAAK,CAAC,CAAA;AAEpE;AAMO,SAAS,sBAAA,CAAuB,QAAuB,MAAA,EAAgC;AAC5F,EAAA,IAAI,OAAO,KAAA,CAAM,MAAA,GAAS,KAAK,aAAA,CAAc,MAAA,EAAQ,MAAM,CAAA,EAAG;AAC5D,IAAA,OAAO,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,CAAC,MAAM,KAAA,KAAU;AACzC,MAAA,MAAM,WAAA,GAAc,MAAA,CAAO,KAAA,CAAM,KAAK,CAAA;AACtC,MAAA,OAAO,WAAA,KAAgB,YAAY,IAAA,KAAS,WAAA;AAAA,IAC9C,CAAC,CAAA;AAAA,EACH;AACA,EAAA,MAAM,OAAA,GAAU,YAAA,CAAa,MAAA,EAAQ,MAAM,CAAA;AAC3C,EAAA,MAAM,iBAAA,GAAoB,OAAA,EAAS,KAAA,CAAM,CAAC,OAAO,KAAA,KAAU;AACzD,IAAA,MAAM,WAAA,GAAc,MAAA,CAAO,KAAA,CAAM,KAAK,CAAA;AACtC,IAAA,OAAO,WAAA,KAAgB,MAAA,IAAa,YAAA,CAAa,KAAA,EAAO,WAAW,CAAA;AAAA,EACrE,CAAC,CAAA;AACD,EAAA,OAAO,iBAAA,KAAsB,IAAA;AAC/B;;;"}

package/dist/application/transform/document/template-key-match.mjs

@@ -0,0 +1,125 @@
+function textAt(shape, index) {
+  return shape.texts[index];
+}
+function isNumberText(text) {
+  return text !== "" && Number.isFinite(Number(text));
+}
+function isValidMatch(match, placeholder) {
+  if (placeholder === "string") {
+    return true;
+  }
+  if (match.kind === "text") {
+    return isNumberText(match.text);
+  }
+  const { texts, types } = match.shape;
+  return texts.length === 2 && texts[0] === "" && texts[1] === "" && types[0] === "number";
+}
+class LiteralPartsScan {
+  matches = [];
+  cursor;
+  source;
+  lastSourceIndex;
+  remainingEndText;
+  constructor(source, startPosition, endTextLength) {
+    this.source = source;
+    this.lastSourceIndex = source.texts.length - 1;
+    const endText = textAt(source, this.lastSourceIndex);
+    this.remainingEndText = endText.slice(0, endText.length - endTextLength);
+    this.cursor = { segment: 0, position: startPosition };
+  }
+  /** The matches for the target's texts between its first and last; null when one is missing. */
+  run(delimiters) {
+    for (const delimiter of delimiters) {
+      if (!this.matchDelimiter(delimiter)) {
+        return null;
+      }
+    }
+    this.addMatch(this.lastSourceIndex, this.sourceText(this.lastSourceIndex).length);
+    return this.matches;
+  }
+  matchDelimiter(delimiter) {
+    const { segment, position } = this.cursor;
+    if (delimiter.length > 0) {
+      const found = this.find(delimiter);
+      if (found === null) {
+        return false;
+      }
+      this.addMatch(found.segment, found.position);
+      this.cursor = { ...this.cursor, position: this.cursor.position + delimiter.length };
+      return true;
+    }
+    if (position < this.sourceText(segment).length) {
+      this.addMatch(segment, position + 1);
+      return true;
+    }
+    if (segment < this.lastSourceIndex) {
+      this.addMatch(segment + 1, 0);
+      return true;
+    }
+    return false;
+  }
+  /** The first occurrence of the delimiter at or after the cursor, in this or a later text. */
+  find(delimiter) {
+    let { segment, position } = this.cursor;
+    while (segment < this.source.texts.length) {
+      const index = this.sourceText(segment).indexOf(delimiter, position);
+      if (index >= 0) {
+        return { segment, position: index };
+      }
+      segment += 1;
+      position = 0;
+    }
+    return null;
+  }
+  sourceText(index) {
+    return index < this.lastSourceIndex ? textAt(this.source, index) : this.remainingEndText;
+  }
+  addMatch(segment, position) {
+    const start = this.cursor;
+    if (segment === start.segment) {
+      const text = this.sourceText(segment).slice(start.position, position);
+      this.matches.push({ kind: "text", text });
+    } else {
+      const texts = [
+        textAt(this.source, start.segment).slice(start.position),
+        ...this.source.texts.slice(start.segment + 1, segment),
+        this.sourceText(segment).slice(0, position)
+      ];
+      const types = this.source.types.slice(start.segment, segment);
+      this.matches.push({ kind: "template", shape: { texts, types } });
+    }
+    this.cursor = { segment, position };
+  }
+}
+function inferMatches(source, target) {
+  const sourceStart = textAt(source, 0);
+  const sourceEnd = textAt(source, source.texts.length - 1);
+  const targetStart = textAt(target, 0);
+  const targetEnd = textAt(target, target.texts.length - 1);
+  const isTooShort = source.texts.length === 1 && sourceStart.length < targetStart.length + targetEnd.length;
+  if (isTooShort || !sourceStart.startsWith(targetStart) || !sourceEnd.endsWith(targetEnd)) {
+    return null;
+  }
+  const scan = new LiteralPartsScan(source, targetStart.length, targetEnd.length);
+  return scan.run(target.texts.slice(1, -1));
+}
+function haveSameTexts(source, target) {
+  return source.texts.length === target.texts.length && source.texts.every((text, index) => text === target.texts[index]);
+}
+function isAssignableToTemplate(source, target) {
+  if (source.types.length > 0 && haveSameTexts(source, target)) {
+    return source.types.every((type, index) => {
+      const placeholder = target.types[index];
+      return placeholder === "string" || type === placeholder;
+    });
+  }
+  const matches = inferMatches(source, target);
+  const isEveryMatchValid = matches?.every((match, index) => {
+    const placeholder = target.types[index];
+    return placeholder !== void 0 && isValidMatch(match, placeholder);
+  });
+  return isEveryMatchValid === true;
+}
+
+export { isAssignableToTemplate, isNumberText };
+//# sourceMappingURL=template-key-match.mjs.map

package/dist/application/transform/document/template-key-match.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"template-key-match.mjs","sources":["../../../../src/application/transform/document/template-key-match.ts"],"sourcesContent":["/**\n * Whether a key type is assignable to a template literal key type, decided the way TypeScript's\n * checker decides it (`inferFromLiteralPartsToTemplateLiteral` and\n * `isValidTypeForTemplateLiteralPlaceholder` in TypeScript 5 and 6). An index signature checks\n * exactly the keys that are assignable to its key type, so the overlap check must match the\n * checker, not the strings a template stands for: the checker matches each text of the target at\n * its first occurrence, so it misses some keys a regular expression would match, and a key it\n * misses is never checked against the signature.\n */\n\n/** A placeholder type of a template, after `${boolean}` became the texts `true` and `false`. */\nexport type TemplatePlaceholder = \"string\" | \"number\";\n\n/**\n * A key type as TypeScript stores a template literal: texts around placeholders, one more text\n * than placeholders. A string literal is one text and no placeholder.\n */\nexport interface TemplateShape {\n  readonly texts: readonly string[];\n  readonly types: readonly TemplatePlaceholder[];\n}\n\n/** The text at an index of the shape; every caller passes one of `0 .. types.length`. */\nfunction textAt(shape: TemplateShape, index: number): string {\n  return shape.texts[index] as string;\n}\n\n/** The type the checker infers for one target placeholder: a text, or a slice of the source. */\ntype InferredMatch =\n  | { readonly kind: \"text\"; readonly text: string }\n  | { readonly kind: \"template\"; readonly shape: TemplateShape };\n\n/** TypeScript's `isValidNumberString(text, false)`: a text that converts to a finite number. */\nexport function isNumberText(text: string): boolean {\n  return text !== \"\" && Number.isFinite(Number(text));\n}\n\n/** Whether the inferred type fits a placeholder: any string for `string`, a number for `number`. */\nfunction isValidMatch(match: InferredMatch, placeholder: TemplatePlaceholder): boolean {\n  if (placeholder === \"string\") {\n    return true;\n  }\n  if (match.kind === \"text\") {\n    return isNumberText(match.text);\n  }\n  const { texts, types } = match.shape;\n  return texts.length === 2 && texts[0] === \"\" && texts[1] === \"\" && types[0] === \"number\";\n}\n\n/** The state of the scan through the source: the current text and the position in it. */\ninterface Cursor {\n  readonly segment: number;\n  readonly position: number;\n}\n\n/** The scan of `inferFromLiteralPartsToTemplateLiteral`, over one source and one target. */\nclass LiteralPartsScan {\n  private readonly matches: InferredMatch[] = [];\n  private cursor: Cursor;\n  private readonly source: TemplateShape;\n  private readonly lastSourceIndex: number;\n  private readonly remainingEndText: string;\n\n  constructor(source: TemplateShape, startPosition: number, endTextLength: number) {\n    this.source = source;\n    this.lastSourceIndex = source.texts.length - 1;\n    const endText = textAt(source, this.lastSourceIndex);\n    this.remainingEndText = endText.slice(0, endText.length - endTextLength);\n    this.cursor = { segment: 0, position: startPosition };\n  }\n\n  /** The matches for the target's texts between its first and last; null when one is missing. */\n  run(delimiters: readonly string[]): readonly InferredMatch[] | null {\n    for (const delimiter of delimiters) {\n      if (!this.matchDelimiter(delimiter)) {\n        return null;\n      }\n    }\n    this.addMatch(this.lastSourceIndex, this.sourceText(this.lastSourceIndex).length);\n    return this.matches;\n  }\n\n  private matchDelimiter(delimiter: string): boolean {\n    const { segment, position } = this.cursor;\n    if (delimiter.length > 0) {\n      const found = this.find(delimiter);\n      if (found === null) {\n        return false;\n      }\n      this.addMatch(found.segment, found.position);\n      this.cursor = { ...this.cursor, position: this.cursor.position + delimiter.length };\n      return true;\n    }\n    if (position < this.sourceText(segment).length) {\n      this.addMatch(segment, position + 1);\n      return true;\n    }\n    if (segment < this.lastSourceIndex) {\n      this.addMatch(segment + 1, 0);\n      return true;\n    }\n    return false;\n  }\n\n  /** The first occurrence of the delimiter at or after the cursor, in this or a later text. */\n  private find(delimiter: string): Cursor | null {\n    let { segment, position } = this.cursor;\n    while (segment < this.source.texts.length) {\n      const index = this.sourceText(segment).indexOf(delimiter, position);\n      if (index >= 0) {\n        return { segment, position: index };\n      }\n      segment += 1;\n      position = 0;\n    }\n    return null;\n  }\n\n  private sourceText(index: number): string {\n    return index < this.lastSourceIndex ? textAt(this.source, index) : this.remainingEndText;\n  }\n\n  private addMatch(segment: number, position: number): void {\n    const start = this.cursor;\n    if (segment === start.segment) {\n      const text = this.sourceText(segment).slice(start.position, position);\n      this.matches.push({ kind: \"text\", text });\n    } else {\n      const texts = [\n        textAt(this.source, start.segment).slice(start.position),\n        ...this.source.texts.slice(start.segment + 1, segment),\n        this.sourceText(segment).slice(0, position),\n      ];\n      const types = this.source.types.slice(start.segment, segment);\n      this.matches.push({ kind: \"template\", shape: { texts, types } });\n    }\n    this.cursor = { segment, position };\n  }\n}\n\n/** The checker's inferences for the target's placeholders; null when the texts do not fit. */\nfunction inferMatches(\n  source: TemplateShape,\n  target: TemplateShape,\n): readonly InferredMatch[] | null {\n  const sourceStart = textAt(source, 0);\n  const sourceEnd = textAt(source, source.texts.length - 1);\n  const targetStart = textAt(target, 0);\n  const targetEnd = textAt(target, target.texts.length - 1);\n  const isTooShort =\n    source.texts.length === 1 && sourceStart.length < targetStart.length + targetEnd.length;\n  if (isTooShort || !sourceStart.startsWith(targetStart) || !sourceEnd.endsWith(targetEnd)) {\n    return null;\n  }\n  const scan = new LiteralPartsScan(source, targetStart.length, targetEnd.length);\n  return scan.run(target.texts.slice(1, -1));\n}\n\nfunction haveSameTexts(source: TemplateShape, target: TemplateShape): boolean {\n  return (\n    source.texts.length === target.texts.length &&\n    source.texts.every((text, index) => text === target.texts[index])\n  );\n}\n\n/**\n * Whether the source key type is assignable to the target template. Templates with the same texts\n * compare placeholder by placeholder (`inferTypesFromTemplateLiteralType`).\n */\nexport function isAssignableToTemplate(source: TemplateShape, target: TemplateShape): boolean {\n  if (source.types.length > 0 && haveSameTexts(source, target)) {\n    return source.types.every((type, index) => {\n      const placeholder = target.types[index];\n      return placeholder === \"string\" || type === placeholder;\n    });\n  }\n  const matches = inferMatches(source, target);\n  const isEveryMatchValid = matches?.every((match, index) => {\n    const placeholder = target.types[index];\n    return placeholder !== undefined && isValidMatch(match, placeholder);\n  });\n  return isEveryMatchValid === true;\n}\n"],"names":[],"mappings":"AAuBA,SAAS,MAAA,CAAO,OAAsB,KAAA,EAAuB;AAC3D,EAAA,OAAO,KAAA,CAAM,MAAM,KAAK,CAAA;AAC1B;AAQO,SAAS,aAAa,IAAA,EAAuB;AAClD,EAAA,OAAO,SAAS,EAAA,IAAM,MAAA,CAAO,QAAA,CAAS,MAAA,CAAO,IAAI,CAAC,CAAA;AACpD;AAGA,SAAS,YAAA,CAAa,OAAsB,WAAA,EAA2C;AACrF,EAAA,IAAI,gBAAgB,QAAA,EAAU;AAC5B,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,KAAA,CAAM,SAAS,MAAA,EAAQ;AACzB,IAAA,OAAO,YAAA,CAAa,MAAM,IAAI,CAAA;AAAA,EAChC;AACA,EAAA,MAAM,EAAE,KAAA,EAAO,KAAA,EAAM,GAAI,KAAA,CAAM,KAAA;AAC/B,EAAA,OAAO,KAAA,CAAM,MAAA,KAAW,CAAA,IAAK,KAAA,CAAM,CAAC,CAAA,KAAM,EAAA,IAAM,KAAA,CAAM,CAAC,CAAA,KAAM,EAAA,IAAM,KAAA,CAAM,CAAC,CAAA,KAAM,QAAA;AAClF;AASA,MAAM,gBAAA,CAAiB;AAAA,EACJ,UAA2B,EAAC;AAAA,EACrC,MAAA;AAAA,EACS,MAAA;AAAA,EACA,eAAA;AAAA,EACA,gBAAA;AAAA,EAEjB,WAAA,CAAY,MAAA,EAAuB,aAAA,EAAuB,aAAA,EAAuB;AAC/E,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AACd,IAAA,IAAA,CAAK,eAAA,GAAkB,MAAA,CAAO,KAAA,CAAM,MAAA,GAAS,CAAA;AAC7C,IAAA,MAAM,OAAA,GAAU,MAAA,CAAO,MAAA,EAAQ,IAAA,CAAK,eAAe,CAAA;AACnD,IAAA,IAAA,CAAK,mBAAmB,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,OAAA,CAAQ,SAAS,aAAa,CAAA;AACvE,IAAA,IAAA,CAAK,MAAA,GAAS,EAAE,OAAA,EAAS,CAAA,EAAG,UAAU,aAAA,EAAc;AAAA,EACtD;AAAA;AAAA,EAGA,IAAI,UAAA,EAAgE;AAClE,IAAA,KAAA,MAAW,aAAa,UAAA,EAAY;AAClC,MAAA,IAAI,CAAC,IAAA,CAAK,cAAA,CAAe,SAAS,CAAA,EAAG;AACnC,QAAA,OAAO,IAAA;AAAA,MACT;AAAA,IACF;AACA,IAAA,IAAA,CAAK,QAAA,CAAS,KAAK,eAAA,EAAiB,IAAA,CAAK,WAAW,IAAA,CAAK,eAAe,EAAE,MAAM,CAAA;AAChF,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA,EAEQ,eAAe,SAAA,EAA4B;AACjD,IAAA,MAAM,EAAE,OAAA,EAAS,QAAA,EAAS,GAAI,IAAA,CAAK,MAAA;AACnC,IAAA,IAAI,SAAA,CAAU,SAAS,CAAA,EAAG;AACxB,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,IAAA,CAAK,SAAS,CAAA;AACjC,MAAA,IAAI,UAAU,IAAA,EAAM;AAClB,QAAA,OAAO,KAAA;AAAA,MACT;AACA,MAAA,IAAA,CAAK,QAAA,CAAS,KAAA,CAAM,OAAA,EAAS,KAAA,CAAM,QAAQ,CAAA;AAC3C,MAAA,IAAA,CAAK,MAAA,GAAS,EAAE,GAAG,IAAA,CAAK,MAAA,EAAQ,UAAU,IAAA,CAAK,MAAA,CAAO,QAAA,GAAW,SAAA,CAAU,MAAA,EAAO;AAClF,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,QAAA,GAAW,IAAA,CAAK,UAAA,CAAW,OAAO,EAAE,MAAA,EAAQ;AAC9C,MAAA,IAAA,CAAK,QAAA,CAAS,OAAA,EAAS,QAAA,GAAW,CAAC,CAAA;AACnC,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,OAAA,GAAU,KAAK,eAAA,EAAiB;AAClC,MAAA,IAAA,CAAK,QAAA,CAAS,OAAA,GAAU,CAAA,EAAG,CAAC,CAAA;AAC5B,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA,EAGQ,KAAK,SAAA,EAAkC;AAC7C,IAAA,IAAI,EAAE,OAAA,EAAS,QAAA,EAAS,GAAI,IAAA,CAAK,MAAA;AACjC,IAAA,OAAO,OAAA,GAAU,IAAA,CAAK,MAAA,CAAO,KAAA,CAAM,MAAA,EAAQ;AACzC,MAAA,MAAM,QAAQ,IAAA,CAAK,UAAA,CAAW,OAAO,CAAA,CAAE,OAAA,CAAQ,WAAW,QAAQ,CAAA;AAClE,MAAA,IAAI,SAAS,CAAA,EAAG;AACd,QAAA,OAAO,EAAE,OAAA,EAAS,QAAA,EAAU,KAAA,EAAM;AAAA,MACpC;AACA,MAAA,OAAA,IAAW,CAAA;AACX,MAAA,QAAA,GAAW,CAAA;AAAA,IACb;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEQ,WAAW,KAAA,EAAuB;AACxC,IAAA,OAAO,KAAA,GAAQ,KAAK,eAAA,GAAkB,MAAA,CAAO,KAAK,MAAA,EAAQ,KAAK,IAAI,IAAA,CAAK,gBAAA;AAAA,EAC1E;AAAA,EAEQ,QAAA,CAAS,SAAiB,QAAA,EAAwB;AACxD,IAAA,MAAM,QAAQ,IAAA,CAAK,MAAA;AACnB,IAAA,IAAI,OAAA,KAAY,MAAM,OAAA,EAAS;AAC7B,MAAA,MAAM,IAAA,GAAO,KAAK,UAAA,CAAW,OAAO,EAAE,KAAA,CAAM,KAAA,CAAM,UAAU,QAAQ,CAAA;AACpE,MAAA,IAAA,CAAK,QAAQ,IAAA,CAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,MAAM,CAAA;AAAA,IAC1C,CAAA,MAAO;AACL,MAAA,MAAM,KAAA,GAAQ;AAAA,QACZ,MAAA,CAAO,KAAK,MAAA,EAAQ,KAAA,CAAM,OAAO,CAAA,CAAE,KAAA,CAAM,MAAM,QAAQ,CAAA;AAAA,QACvD,GAAG,KAAK,MAAA,CAAO,KAAA,CAAM,MAAM,KAAA,CAAM,OAAA,GAAU,GAAG,OAAO,CAAA;AAAA,QACrD,KAAK,UAAA,CAAW,OAAO,CAAA,CAAE,KAAA,CAAM,GAAG,QAAQ;AAAA,OAC5C;AACA,MAAA,MAAM,QAAQ,IAAA,CAAK,MAAA,CAAO,MAAM,KAAA,CAAM,KAAA,CAAM,SAAS,OAAO,CAAA;AAC5D,MAAA,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,EAAE,IAAA,EAAM,UAAA,EAAY,OAAO,EAAE,KAAA,EAAO,KAAA,EAAM,EAAG,CAAA;AAAA,IACjE;AACA,IAAA,IAAA,CAAK,MAAA,GAAS,EAAE,OAAA,EAAS,QAAA,EAAS;AAAA,EACpC;AACF;AAGA,SAAS,YAAA,CACP,QACA,MAAA,EACiC;AACjC,EAAA,MAAM,WAAA,GAAc,MAAA,CAAO,MAAA,EAAQ,CAAC,CAAA;AACpC,EAAA,MAAM,YAAY,MAAA,CAAO,MAAA,EAAQ,MAAA,CAAO,KAAA,CAAM,SAAS,CAAC,CAAA;AACxD,EAAA,MAAM,WAAA,GAAc,MAAA,CAAO,MAAA,EAAQ,CAAC,CAAA;AACpC,EAAA,MAAM,YAAY,MAAA,CAAO,MAAA,EAAQ,MAAA,CAAO,KAAA,CAAM,SAAS,CAAC,CAAA;AACxD,EAAA,MAAM,UAAA,GACJ,OAAO,KAAA,CAAM,MAAA,KAAW,KAAK,WAAA,CAAY,MAAA,GAAS,WAAA,CAAY,MAAA,GAAS,SAAA,CAAU,MAAA;AACnF,EAAA,IAAI,UAAA,IAAc,CAAC,WAAA,CAAY,UAAA,CAAW,WAAW,KAAK,CAAC,SAAA,CAAU,QAAA,CAAS,SAAS,CAAA,EAAG;AACxF,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAO,IAAI,gBAAA,CAAiB,QAAQ,WAAA,CAAY,MAAA,EAAQ,UAAU,MAAM,CAAA;AAC9E,EAAA,OAAO,KAAK,GAAA,CAAI,MAAA,CAAO,MAAM,KAAA,CAAM,CAAA,EAAG,EAAE,CAAC,CAAA;AAC3C;AAEA,SAAS,aAAA,CAAc,QAAuB,MAAA,EAAgC;AAC5E,EAAA,OACE,OAAO,KAAA,CAAM,MAAA,KAAW,MAAA,CAAO,KAAA,CAAM,UACrC,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,CAAC,MAAM,KAAA,KAAU,IAAA,KAAS,MAAA,CAAO,KAAA,CAAM,KAAK,CAAC,CAAA;AAEpE;AAMO,SAAS,sBAAA,CAAuB,QAAuB,MAAA,EAAgC;AAC5F,EAAA,IAAI,OAAO,KAAA,CAAM,MAAA,GAAS,KAAK,aAAA,CAAc,MAAA,EAAQ,MAAM,CAAA,EAAG;AAC5D,IAAA,OAAO,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,CAAC,MAAM,KAAA,KAAU;AACzC,MAAA,MAAM,WAAA,GAAc,MAAA,CAAO,KAAA,CAAM,KAAK,CAAA;AACtC,MAAA,OAAO,WAAA,KAAgB,YAAY,IAAA,KAAS,WAAA;AAAA,IAC9C,CAAC,CAAA;AAAA,EACH;AACA,EAAA,MAAM,OAAA,GAAU,YAAA,CAAa,MAAA,EAAQ,MAAM,CAAA;AAC3C,EAAA,MAAM,iBAAA,GAAoB,OAAA,EAAS,KAAA,CAAM,CAAC,OAAO,KAAA,KAAU;AACzD,IAAA,MAAM,WAAA,GAAc,MAAA,CAAO,KAAA,CAAM,KAAK,CAAA;AACtC,IAAA,OAAO,WAAA,KAAgB,MAAA,IAAa,YAAA,CAAa,KAAA,EAAO,WAAW,CAAA;AAAA,EACrE,CAAC,CAAA;AACD,EAAA,OAAO,iBAAA,KAAsB,IAAA;AAC/B;;"}

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

@@ -0,0 +1,192 @@
+'use strict';
+
+const constructors = require('../../../domain/ir/constructors.cjs');
+const assignability = require('./assignability.cjs');
+const listAssignability = require('./list-assignability.cjs');
+const typeKey = require('./type-key.cjs');
+const typeResolution = require('./type-resolution.cjs');
+
+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 = [...typeResolution.propertiesOf(target).values()];
+  const isWeak = targetProperties.length > 0 && typeResolution.indexSignaturesOf(target).length === 0 && targetProperties.every((property) => property.isOptional);
+  const sourceNames = [...typeResolution.propertiesOf(source).keys()];
+  return isWeak && sourceNames.length > 0 && !sourceNames.some((name) => targetProperties.some((property) => typeResolution.nameOf(property) === name));
+}
+function isStringIndex(signature) {
+  return signature.parameterType.kind === "keyword" && signature.parameterType.keyword === "string";
+}
+const BOOLEAN_MEMBERS = [constructors.irBoolean(true), constructors.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 = typeKey.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.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 assignability.everyOf(sourceMembers, (member) => this.relate(member, target));
+    }
+    if (target.kind === "intersection") {
+      return assignability.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 = assignability.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 = assignability.crossCategoryRelation(source, target);
+    if (crossCategory !== null) {
+      return crossCategory;
+    }
+    switch (source.kind) {
+      case "array":
+      case "tuple":
+      case "readonly":
+        return listAssignability.relateLists(source, target, (from, to) => this.relate(from, to));
+      case "object":
+        return this.relateObjects(source, target);
+      default:
+        return assignability.primitiveRelation(source, target);
+    }
+  }
+  relateObjects(source, target) {
+    if (isWeakTypeRejected(source, target)) {
+      return "rejected";
+    }
+    const sourceProperties = typeResolution.propertiesOf(source);
+    const indexes = assignability.everyOf(
+      typeResolution.indexSignaturesOf(target),
+      (signature) => this.relateToIndex(source, signature)
+    );
+    if (indexes === "rejected") {
+      return indexes;
+    }
+    const properties = assignability.everyOf(
+      [...typeResolution.propertiesOf(target).values()],
+      (property) => this.relateProperty(sourceProperties.get(typeResolution.nameOf(property)), property)
+    );
+    return assignability.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 = typeResolution.indexSignaturesOf(source);
+    const own = indexes.find(isStringIndex);
+    if (own !== void 0) {
+      return this.relate(own.type, signature.type);
+    }
+    const types = [
+      ...[...typeResolution.propertiesOf(source).values()].map((property) => property.type),
+      ...indexes.map((index) => index.type)
+    ];
+    return assignability.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(typeResolution.readType(source), typeResolution.readType(target));
+  }
+}
+function assignabilityProof(lookup) {
+  const check = new AssignabilityCheck(lookup);
+  return (source, target) => check.relate(source, target);
+}
+
+exports.assignabilityProof = assignabilityProof;
+//# sourceMappingURL=type-assignability.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"type-assignability.cjs","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":["propertiesOf","indexSignaturesOf","nameOf","irBoolean","createTypeKey","TypeResolution","everyOf","someOf","crossCategoryRelation","relateLists","primitiveRelation","readType"],"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,GAAGA,4BAAa,MAAM,CAAA,CAAE,QAAQ,CAAA;AAC1D,EAAA,MAAM,MAAA,GACJ,gBAAA,CAAiB,MAAA,GAAS,CAAA,IAC1BC,iCAAkB,MAAM,CAAA,CAAE,MAAA,KAAW,CAAA,IACrC,gBAAA,CAAiB,KAAA,CAAM,CAAC,QAAA,KAAa,SAAS,UAAU,CAAA;AAC1D,EAAA,MAAM,cAAc,CAAC,GAAGD,4BAAa,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,KAAaE,sBAAO,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,CAACC,sBAAA,CAAU,IAAI,CAAA,EAAGA,sBAAA,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,YAAYC,qBAAA,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,IAAIC,6BAAA,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,OAAOC,qBAAA,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,OAAOA,qBAAA,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,GAASC,oBAAA,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,GAAgBC,mCAAA,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,OAAOC,6BAAA,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,OAAOC,+BAAA,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,GAAmBV,4BAAa,MAAM,CAAA;AAC5C,IAAA,MAAM,OAAA,GAAUM,qBAAA;AAAA,MAAQL,iCAAkB,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,GAAaK,qBAAA;AAAA,MAAQ,CAAC,GAAGN,2BAAA,CAAa,MAAM,CAAA,CAAE,QAAQ,CAAA;AAAA,MAAG,CAAC,QAAA,KAC9D,IAAA,CAAK,cAAA,CAAe,gBAAA,CAAiB,IAAIE,qBAAA,CAAO,QAAQ,CAAC,CAAA,EAAG,QAAQ;AAAA,KACtE;AACA,IAAA,OAAOI,sBAAQ,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,GAAUL,iCAAkB,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,GAAGD,2BAAA,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,OAAOM,qBAAA,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,CAAOK,uBAAA,CAAS,MAAM,CAAA,EAAGA,uBAAA,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;;"}