openapi-typesafe 0.0.0 → 1.0.0-rc.1

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

@@ -0,0 +1,244 @@
+import { OPAQUE, absorbed, unionType, propertyKey, MISSING, NEVER } from './evaluation.mjs';
+import { markerObject, omitted, extracted, isNeverIntersection, declaredFirst } from './type-rules.mjs';
+
+const MAX_EXPANSIONS = 200;
+const DEEP_PREFIX = "FlattenedDeepRequired<";
+const MAX_DISTRIBUTED = 64;
+const NULLISH = /* @__PURE__ */ new Set(["null", "undefined"]);
+class TypeEvaluator {
+  declared = /* @__PURE__ */ new Map();
+  expansions = 0;
+  constructor(declarations) {
+    for (const declaration of declarations) {
+      if (declaration.kind === "interface") {
+        this.declared.set(declaration.name, { kind: "object", members: declaration.members });
+      } else if (declaration.kind === "typeAlias") {
+        this.declared.set(declaration.name, declaration.type);
+      }
+    }
+  }
+  /** Evaluate a type written in the footer; the expansion budget starts again. */
+  evaluate(type) {
+    this.expansions = 0;
+    return this.expand({ kind: "type", type, deep: false });
+  }
+  /** The type with references, `readonly` and indexed access resolved at the top. */
+  expand(value) {
+    const { type } = value;
+    switch (type.kind) {
+      case "readonly":
+        return this.expand({ ...value, type: type.type });
+      case "indexedAccess":
+        return this.indexedAccess(value, type.object, type.index);
+      case "reference":
+        return this.reference(value, type.name, type.typeArguments);
+      case "raw":
+      case "tuple":
+        return OPAQUE;
+      default:
+        return value;
+    }
+  }
+  indexedAccess(value, object, index) {
+    const owner = this.expand({ ...value, type: object });
+    return owner.kind === "type" ? this.index(owner, index) : owner;
+  }
+  reference(value, name, args) {
+    if (this.expansions++ > MAX_EXPANSIONS) {
+      return OPAQUE;
+    }
+    if (name.startsWith(DEEP_PREFIX) && name.endsWith(">")) {
+      const root = this.declared.get(name.slice(DEEP_PREFIX.length, -1));
+      return root === void 0 ? OPAQUE : this.expand({ kind: "type", type: root, deep: true });
+    }
+    const declared = args.length === 0 ? this.declared.get(name) : void 0;
+    if (declared !== void 0) {
+      return this.expand({ ...value, type: declared });
+    }
+    const [first, second] = args;
+    if (first === void 0) {
+      return OPAQUE;
+    }
+    const argument = this.expand({ ...value, type: first });
+    if (argument.kind !== "type") {
+      return argument;
+    }
+    return this.helper(name, argument, second);
+  }
+  helper(name, argument, second) {
+    switch (name) {
+      case "NonNullable":
+        return this.withoutNullish(argument);
+      case "WithRequired":
+      case "Readonly":
+        return argument;
+      case "Extract":
+        return second === void 0 ? OPAQUE : this.extract(argument, second);
+      case "Omit":
+        return second === void 0 ? OPAQUE : omitted(this, argument, second);
+      default:
+        return markerObject(name, argument) ?? OPAQUE;
+    }
+  }
+  /**
+   * The members of a union, each expanded; an intersection with unions in it is distributed over
+   * them (`A & (B | C)` is `(A & B) | (A & C)`), as TypeScript normalizes it. A type that is not a
+   * union is its only member. A union with an `any` or `unknown` member is that keyword alone.
+   */
+  membersOf(value) {
+    const expanded = this.expand(value);
+    if (expanded.kind !== "type") {
+      return [expanded];
+    }
+    const { type } = expanded;
+    if (type.kind === "union") {
+      return absorbed(
+        type.types.flatMap((member) => this.membersOf({ ...expanded, type: member }))
+      );
+    }
+    return type.kind === "intersection" ? this.distributed(expanded, type.types) : [expanded];
+  }
+  distributed(value, parts) {
+    const memberLists = parts.map((part) => this.membersOf({ ...value, type: part }));
+    const size = memberLists.reduce((product, list) => product * list.length, 1);
+    if (size > MAX_DISTRIBUTED || memberLists.some((list) => list.some((m) => m.kind !== "type"))) {
+      return [OPAQUE];
+    }
+    let combinations = [[]];
+    for (const list of memberLists) {
+      combinations = combinations.flatMap((done) => list.map((member) => [...done, member.type]));
+    }
+    return combinations.map((types) => ({ ...value, type: intersectionType(types) }));
+  }
+  withoutNullish(value) {
+    const members = this.membersOf(value);
+    if (members.some((member) => member.kind !== "type")) {
+      return OPAQUE;
+    }
+    const kept = members.filter((member) => !isNullish(member.type));
+    return { ...value, type: unionType(kept.map((member) => member.type)) };
+  }
+  /** `Extract<T, { key: unknown }>` keeps the members that have `key`; other probes are opaque. */
+  extract(value, probe) {
+    const [member] = probe.kind === "object" ? probe.members : [];
+    if (probe.kind !== "object" || probe.members.length !== 1 || member?.kind !== "property") {
+      return OPAQUE;
+    }
+    return extracted(this, value, propertyKey(member.name));
+  }
+  /** `value[index]` for a string literal, `string` or `number` index. */
+  index(value, index) {
+    const owner = this.expand(value);
+    if (owner.kind !== "type") {
+      return owner;
+    }
+    if (this.membersOf(owner).length > 1) {
+      return this.unionIndex(owner, index);
+    }
+    const { type } = owner;
+    switch (type.kind) {
+      case "object":
+        return this.memberType(owner, type.members, index);
+      case "intersection":
+        return this.partsIndex(owner, type.types, index);
+      case "union":
+        return this.unionIndex(owner, index);
+      case "array":
+        return isNumberIndex(index) ? this.flattened(owner, type.element) : builtInIndex(index);
+      case "keyword":
+        return type.keyword === "never" ? owner : builtInIndex(index);
+      default:
+        return builtInIndex(index);
+    }
+  }
+  memberType(owner, members, index) {
+    const key = indexKey(index);
+    const property = members.find(
+      (member) => member.kind === "property" && key !== null && propertyKey(member.name) === key
+    );
+    if (property !== void 0) {
+      return this.flattened(owner, property.type);
+    }
+    const signature = members.find((member) => member.kind === "indexSignature");
+    if (signature !== void 0) {
+      return this.flattened(owner, signature.type);
+    }
+    return key === null || isObjectBuiltIn(key) ? OPAQUE : MISSING;
+  }
+  partsIndex(owner, parts, index) {
+    if (isNeverIntersection(this, owner, parts)) {
+      return { ...owner, type: NEVER };
+    }
+    const found = parts.map((type) => this.index({ ...owner, type }, index));
+    if (found.some((part) => part.kind === "opaque")) {
+      return OPAQUE;
+    }
+    const read = parts.map((type, at) => ({ type, found: found[at] }));
+    const types = declaredFirst(this, owner, indexKey(index), read).flatMap(
+      (part) => part.kind === "type" ? [part.type] : []
+    );
+    return types.length === 0 ? MISSING : { ...owner, type: intersectionType(types) };
+  }
+  unionIndex(owner, index) {
+    const found = this.membersOf(owner).map(
+      (member) => member.kind === "type" ? this.index(member, index) : member
+    );
+    if (found.some((member) => member.kind === "missing")) {
+      return MISSING;
+    }
+    if (found.some((member) => member.kind === "opaque")) {
+      return OPAQUE;
+    }
+    return { ...owner, type: unionType(found.map((member) => member.type)) };
+  }
+  /**
+   * A member read through `FlattenedDeepRequired`: a value that is only arrays (and `undefined` or
+   * `null`) is replaced by its elements, anything else loses `undefined` and `null`.
+   */
+  flattened(owner, type) {
+    const member = { ...owner, type };
+    if (!owner.deep) {
+      return this.expand(member);
+    }
+    const members = this.membersOf(member);
+    if (members.some((candidate) => candidate.kind !== "type")) {
+      return OPAQUE;
+    }
+    const present = members.filter((candidate) => !isNullish(candidate.type));
+    const elements = present.map((candidate) => arrayElement(candidate.type));
+    if (present.length > 0 && elements.every((element) => element !== null)) {
+      return this.expand({ ...owner, type: unionType(elements) });
+    }
+    return { ...owner, type: unionType(present.map((candidate) => candidate.type)) };
+  }
+}
+function isNullish(type) {
+  return type.kind === "keyword" && NULLISH.has(type.keyword);
+}
+function arrayElement(type) {
+  return type.kind === "array" ? type.element : null;
+}
+function intersectionType(types) {
+  return types.length === 1 ? types[0] : { kind: "intersection", types };
+}
+function indexKey(index) {
+  if (index.kind === "stringLiteral") {
+    return index.value;
+  }
+  return index.kind === "numberLiteral" ? String(index.value) : null;
+}
+function isNumberIndex(index) {
+  const key = indexKey(index);
+  return index.kind === "keyword" && index.keyword === "number" || /^\d+$/.test(key ?? "");
+}
+function isObjectBuiltIn(key) {
+  return key in {};
+}
+function builtInIndex(index) {
+  const key = indexKey(index);
+  const isBuiltIn = key === null || key in String.prototype || key in Array.prototype;
+  return isBuiltIn || key in Number.prototype ? OPAQUE : MISSING;
+}
+
+export { TypeEvaluator };
+//# sourceMappingURL=type-evaluation.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"type-evaluation.mjs","sources":["../../../../src/application/transform/footer/type-evaluation.ts"],"sourcesContent":["import type { IrDeclaration, IrMember, IrType } from \"../../../domain/ir/nodes.js\";\nimport {\n  absorbed,\n  type Evaluated,\n  type Evaluation,\n  MISSING,\n  NEVER,\n  OPAQUE,\n  propertyKey,\n  unionType,\n} from \"./evaluation.js\";\nimport {\n  declaredFirst,\n  extracted,\n  isNeverIntersection,\n  markerObject,\n  omitted,\n} from \"./type-rules.js\";\n\n/**\n * A small evaluator of the generated types, as TypeScript reads them, for the `--enum-values`\n * check (ADR-027). It follows the declarations of the document and the helper types the generator\n * writes (`NonNullable`, `Extract`, `WithRequired`, `Omit`, `Record`, `FlattenedDeepRequired`). Its\n * answers are sure: a key is `missing` only where TypeScript reports it, and every type it does\n * not model is `opaque`, which never counts as an error.\n */\n\n/** How many references one evaluation expands; a deeper one is opaque. */\nconst MAX_EXPANSIONS = 200;\nconst DEEP_PREFIX = \"FlattenedDeepRequired<\";\n/** How many members distributing an intersection may give; more is opaque. */\nconst MAX_DISTRIBUTED = 64;\nconst NULLISH: ReadonlySet<string> = new Set([\"null\", \"undefined\"]);\n\nexport class TypeEvaluator {\n  private readonly declared = new Map<string, IrType>();\n  private expansions = 0;\n\n  constructor(declarations: readonly IrDeclaration[]) {\n    for (const declaration of declarations) {\n      if (declaration.kind === \"interface\") {\n        this.declared.set(declaration.name, { kind: \"object\", members: declaration.members });\n      } else if (declaration.kind === \"typeAlias\") {\n        this.declared.set(declaration.name, declaration.type);\n      }\n    }\n  }\n\n  /** Evaluate a type written in the footer; the expansion budget starts again. */\n  evaluate(type: IrType): Evaluation {\n    this.expansions = 0;\n    return this.expand({ kind: \"type\", type, deep: false });\n  }\n\n  /** The type with references, `readonly` and indexed access resolved at the top. */\n  expand(value: Evaluated): Evaluation {\n    const { type } = value;\n    switch (type.kind) {\n      case \"readonly\":\n        return this.expand({ ...value, type: type.type });\n      case \"indexedAccess\":\n        return this.indexedAccess(value, type.object, type.index);\n      case \"reference\":\n        return this.reference(value, type.name, type.typeArguments);\n      case \"raw\":\n      case \"tuple\":\n        return OPAQUE;\n      default:\n        return value;\n    }\n  }\n\n  private indexedAccess(value: Evaluated, object: IrType, index: IrType): Evaluation {\n    const owner = this.expand({ ...value, type: object });\n    return owner.kind === \"type\" ? this.index(owner, index) : owner;\n  }\n\n  private reference(value: Evaluated, name: string, args: readonly IrType[]): Evaluation {\n    // Only references cost budget: re-expanding an already expanded value (as the checks after\n    // `evaluate` do) is free, so a large evaluation does not leave its checks opaque.\n    if (this.expansions++ > MAX_EXPANSIONS) {\n      return OPAQUE;\n    }\n    if (name.startsWith(DEEP_PREFIX) && name.endsWith(\">\")) {\n      const root = this.declared.get(name.slice(DEEP_PREFIX.length, -1));\n      return root === undefined ? OPAQUE : this.expand({ kind: \"type\", type: root, deep: true });\n    }\n    const declared = args.length === 0 ? this.declared.get(name) : undefined;\n    if (declared !== undefined) {\n      return this.expand({ ...value, type: declared });\n    }\n    const [first, second] = args;\n    if (first === undefined) {\n      return OPAQUE;\n    }\n    const argument = this.expand({ ...value, type: first });\n    if (argument.kind !== \"type\") {\n      return argument;\n    }\n    return this.helper(name, argument, second);\n  }\n\n  private helper(name: string, argument: Evaluated, second: IrType | undefined): Evaluation {\n    switch (name) {\n      case \"NonNullable\":\n        return this.withoutNullish(argument);\n      case \"WithRequired\":\n      case \"Readonly\":\n        return argument;\n      case \"Extract\":\n        return second === undefined ? OPAQUE : this.extract(argument, second);\n      case \"Omit\":\n        return second === undefined ? OPAQUE : omitted(this, argument, second);\n      default:\n        return markerObject(name, argument) ?? OPAQUE;\n    }\n  }\n\n  /**\n   * The members of a union, each expanded; an intersection with unions in it is distributed over\n   * them (`A & (B | C)` is `(A & B) | (A & C)`), as TypeScript normalizes it. A type that is not a\n   * union is its only member. A union with an `any` or `unknown` member is that keyword alone.\n   */\n  membersOf(value: Evaluated): readonly Evaluation[] {\n    const expanded = this.expand(value);\n    if (expanded.kind !== \"type\") {\n      return [expanded];\n    }\n    const { type } = expanded;\n    if (type.kind === \"union\") {\n      return absorbed(\n        type.types.flatMap((member) => this.membersOf({ ...expanded, type: member })),\n      );\n    }\n    return type.kind === \"intersection\" ? this.distributed(expanded, type.types) : [expanded];\n  }\n\n  private distributed(value: Evaluated, parts: readonly IrType[]): readonly Evaluation[] {\n    const memberLists = parts.map((part) => this.membersOf({ ...value, type: part }));\n    const size = memberLists.reduce((product, list) => product * list.length, 1);\n    if (size > MAX_DISTRIBUTED || memberLists.some((list) => list.some((m) => m.kind !== \"type\"))) {\n      return [OPAQUE];\n    }\n    let combinations: IrType[][] = [[]];\n    for (const list of memberLists as Evaluated[][]) {\n      combinations = combinations.flatMap((done) => list.map((member) => [...done, member.type]));\n    }\n    return combinations.map((types) => ({ ...value, type: intersectionType(types) }));\n  }\n\n  private withoutNullish(value: Evaluated): Evaluation {\n    const members = this.membersOf(value);\n    if (members.some((member) => member.kind !== \"type\")) {\n      return OPAQUE;\n    }\n    const kept = (members as Evaluated[]).filter((member) => !isNullish(member.type));\n    return { ...value, type: unionType(kept.map((member) => member.type)) };\n  }\n\n  /** `Extract<T, { key: unknown }>` keeps the members that have `key`; other probes are opaque. */\n  private extract(value: Evaluated, probe: IrType): Evaluation {\n    const [member] = probe.kind === \"object\" ? probe.members : [];\n    if (probe.kind !== \"object\" || probe.members.length !== 1 || member?.kind !== \"property\") {\n      return OPAQUE;\n    }\n    return extracted(this, value, propertyKey(member.name));\n  }\n\n  /** `value[index]` for a string literal, `string` or `number` index. */\n  index(value: Evaluated, index: IrType): Evaluation {\n    const owner = this.expand(value);\n    if (owner.kind !== \"type\") {\n      return owner;\n    }\n    if (this.membersOf(owner).length > 1) {\n      return this.unionIndex(owner, index);\n    }\n    const { type } = owner;\n    switch (type.kind) {\n      case \"object\":\n        return this.memberType(owner, type.members, index);\n      case \"intersection\":\n        return this.partsIndex(owner, type.types, index);\n      case \"union\":\n        return this.unionIndex(owner, index);\n      case \"array\":\n        return isNumberIndex(index) ? this.flattened(owner, type.element) : builtInIndex(index);\n      case \"keyword\":\n        return type.keyword === \"never\" ? owner : builtInIndex(index);\n      default:\n        return builtInIndex(index);\n    }\n  }\n\n  private memberType(owner: Evaluated, members: readonly IrMember[], index: IrType): Evaluation {\n    const key = indexKey(index);\n    const property = members.find(\n      (member) => member.kind === \"property\" && key !== null && propertyKey(member.name) === key,\n    );\n    if (property !== undefined) {\n      return this.flattened(owner, property.type);\n    }\n    const signature = members.find((member) => member.kind === \"indexSignature\");\n    if (signature !== undefined) {\n      return this.flattened(owner, signature.type);\n    }\n    return key === null || isObjectBuiltIn(key) ? OPAQUE : MISSING;\n  }\n\n  private partsIndex(owner: Evaluated, parts: readonly IrType[], index: IrType): Evaluation {\n    if (isNeverIntersection(this, owner, parts)) {\n      return { ...owner, type: NEVER };\n    }\n    const found = parts.map((type) => this.index({ ...owner, type }, index));\n    if (found.some((part) => part.kind === \"opaque\")) {\n      return OPAQUE;\n    }\n    const read = parts.map((type, at) => ({ type, found: found[at] as Evaluation }));\n    const types = declaredFirst(this, owner, indexKey(index), read).flatMap((part) =>\n      part.kind === \"type\" ? [part.type] : [],\n    );\n    return types.length === 0 ? MISSING : { ...owner, type: intersectionType(types) };\n  }\n\n  private unionIndex(owner: Evaluated, index: IrType): Evaluation {\n    const found = this.membersOf(owner).map((member) =>\n      member.kind === \"type\" ? this.index(member, index) : member,\n    );\n    if (found.some((member) => member.kind === \"missing\")) {\n      return MISSING;\n    }\n    if (found.some((member) => member.kind === \"opaque\")) {\n      return OPAQUE;\n    }\n    return { ...owner, type: unionType((found as Evaluated[]).map((member) => member.type)) };\n  }\n\n  /**\n   * A member read through `FlattenedDeepRequired`: a value that is only arrays (and `undefined` or\n   * `null`) is replaced by its elements, anything else loses `undefined` and `null`.\n   */\n  private flattened(owner: Evaluated, type: IrType): Evaluation {\n    const member: Evaluated = { ...owner, type };\n    if (!owner.deep) {\n      return this.expand(member);\n    }\n    const members = this.membersOf(member);\n    if (members.some((candidate) => candidate.kind !== \"type\")) {\n      return OPAQUE;\n    }\n    const present = (members as Evaluated[]).filter((candidate) => !isNullish(candidate.type));\n    const elements = present.map((candidate) => arrayElement(candidate.type));\n    if (present.length > 0 && elements.every((element) => element !== null)) {\n      return this.expand({ ...owner, type: unionType(elements as IrType[]) });\n    }\n    return { ...owner, type: unionType(present.map((candidate) => candidate.type)) };\n  }\n}\n\nfunction isNullish(type: IrType): boolean {\n  return type.kind === \"keyword\" && NULLISH.has(type.keyword);\n}\n\n/** The element of an expanded member; expanding already dropped `readonly`. */\nfunction arrayElement(type: IrType): IrType | null {\n  return type.kind === \"array\" ? type.element : null;\n}\n\nfunction intersectionType(types: readonly IrType[]): IrType {\n  return types.length === 1 ? (types[0] as IrType) : { kind: \"intersection\", types };\n}\n\nfunction indexKey(index: IrType): string | null {\n  if (index.kind === \"stringLiteral\") {\n    return index.value;\n  }\n  return index.kind === \"numberLiteral\" ? String(index.value) : null;\n}\n\nfunction isNumberIndex(index: IrType): boolean {\n  const key = indexKey(index);\n  return (index.kind === \"keyword\" && index.keyword === \"number\") || /^\\d+$/.test(key ?? \"\");\n}\n\nfunction isObjectBuiltIn(key: string): boolean {\n  return key in {};\n}\n\n/** A key of a primitive or an array: a built-in member is opaque, any other key is missing. */\nfunction builtInIndex(index: IrType): Evaluation {\n  const key = indexKey(index);\n  const isBuiltIn = key === null || key in String.prototype || key in Array.prototype;\n  return isBuiltIn || key in Number.prototype ? OPAQUE : MISSING;\n}\n"],"names":[],"mappings":";;;AA4BA,MAAM,cAAA,GAAiB,GAAA;AACvB,MAAM,WAAA,GAAc,wBAAA;AAEpB,MAAM,eAAA,GAAkB,EAAA;AACxB,MAAM,0BAA+B,IAAI,GAAA,CAAI,CAAC,MAAA,EAAQ,WAAW,CAAC,CAAA;AAE3D,MAAM,aAAA,CAAc;AAAA,EACR,QAAA,uBAAe,GAAA,EAAoB;AAAA,EAC5C,UAAA,GAAa,CAAA;AAAA,EAErB,YAAY,YAAA,EAAwC;AAClD,IAAA,KAAA,MAAW,eAAe,YAAA,EAAc;AACtC,MAAA,IAAI,WAAA,CAAY,SAAS,WAAA,EAAa;AACpC,QAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,EAAE,MAAM,QAAA,EAAU,OAAA,EAAS,WAAA,CAAY,OAAA,EAAS,CAAA;AAAA,MACtF,CAAA,MAAA,IAAW,WAAA,CAAY,IAAA,KAAS,WAAA,EAAa;AAC3C,QAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,YAAY,IAAI,CAAA;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,SAAS,IAAA,EAA0B;AACjC,IAAA,IAAA,CAAK,UAAA,GAAa,CAAA;AAClB,IAAA,OAAO,IAAA,CAAK,OAAO,EAAE,IAAA,EAAM,QAAQ,IAAA,EAAM,IAAA,EAAM,OAAO,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,OAAO,KAAA,EAA8B;AACnC,IAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,IAAA,QAAQ,KAAK,IAAA;AAAM,MACjB,KAAK,UAAA;AACH,QAAA,OAAO,IAAA,CAAK,OAAO,EAAE,GAAG,OAAO,IAAA,EAAM,IAAA,CAAK,MAAM,CAAA;AAAA,MAClD,KAAK,eAAA;AACH,QAAA,OAAO,KAAK,aAAA,CAAc,KAAA,EAAO,IAAA,CAAK,MAAA,EAAQ,KAAK,KAAK,CAAA;AAAA,MAC1D,KAAK,WAAA;AACH,QAAA,OAAO,KAAK,SAAA,CAAU,KAAA,EAAO,IAAA,CAAK,IAAA,EAAM,KAAK,aAAa,CAAA;AAAA,MAC5D,KAAK,KAAA;AAAA,MACL,KAAK,OAAA;AACH,QAAA,OAAO,MAAA;AAAA,MACT;AACE,QAAA,OAAO,KAAA;AAAA;AACX,EACF;AAAA,EAEQ,aAAA,CAAc,KAAA,EAAkB,MAAA,EAAgB,KAAA,EAA2B;AACjF,IAAA,MAAM,KAAA,GAAQ,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,QAAQ,CAAA;AACpD,IAAA,OAAO,MAAM,IAAA,KAAS,MAAA,GAAS,KAAK,KAAA,CAAM,KAAA,EAAO,KAAK,CAAA,GAAI,KAAA;AAAA,EAC5D;AAAA,EAEQ,SAAA,CAAU,KAAA,EAAkB,IAAA,EAAc,IAAA,EAAqC;AAGrF,IAAA,IAAI,IAAA,CAAK,eAAe,cAAA,EAAgB;AACtC,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,IAAI,KAAK,UAAA,CAAW,WAAW,KAAK,IAAA,CAAK,QAAA,CAAS,GAAG,CAAA,EAAG;AACtD,MAAA,MAAM,IAAA,GAAO,KAAK,QAAA,CAAS,GAAA,CAAI,KAAK,KAAA,CAAM,WAAA,CAAY,MAAA,EAAQ,EAAE,CAAC,CAAA;AACjE,MAAA,OAAO,IAAA,KAAS,MAAA,GAAY,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,CAAA;AAAA,IAC3F;AACA,IAAA,MAAM,QAAA,GAAW,KAAK,MAAA,KAAW,CAAA,GAAI,KAAK,QAAA,CAAS,GAAA,CAAI,IAAI,CAAA,GAAI,MAAA;AAC/D,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,OAAO,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,UAAU,CAAA;AAAA,IACjD;AACA,IAAA,MAAM,CAAC,KAAA,EAAO,MAAM,CAAA,GAAI,IAAA;AACxB,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,MAAM,QAAA,GAAW,KAAK,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,OAAO,CAAA;AACtD,IAAA,IAAI,QAAA,CAAS,SAAS,MAAA,EAAQ;AAC5B,MAAA,OAAO,QAAA;AAAA,IACT;AACA,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,EAAM,QAAA,EAAU,MAAM,CAAA;AAAA,EAC3C;AAAA,EAEQ,MAAA,CAAO,IAAA,EAAc,QAAA,EAAqB,MAAA,EAAwC;AACxF,IAAA,QAAQ,IAAA;AAAM,MACZ,KAAK,aAAA;AACH,QAAA,OAAO,IAAA,CAAK,eAAe,QAAQ,CAAA;AAAA,MACrC,KAAK,cAAA;AAAA,MACL,KAAK,UAAA;AACH,QAAA,OAAO,QAAA;AAAA,MACT,KAAK,SAAA;AACH,QAAA,OAAO,WAAW,MAAA,GAAY,MAAA,GAAS,IAAA,CAAK,OAAA,CAAQ,UAAU,MAAM,CAAA;AAAA,MACtE,KAAK,MAAA;AACH,QAAA,OAAO,WAAW,MAAA,GAAY,MAAA,GAAS,OAAA,CAAQ,IAAA,EAAM,UAAU,MAAM,CAAA;AAAA,MACvE;AACE,QAAA,OAAO,YAAA,CAAa,IAAA,EAAM,QAAQ,CAAA,IAAK,MAAA;AAAA;AAC3C,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU,KAAA,EAAyC;AACjD,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAClC,IAAA,IAAI,QAAA,CAAS,SAAS,MAAA,EAAQ;AAC5B,MAAA,OAAO,CAAC,QAAQ,CAAA;AAAA,IAClB;AACA,IAAA,MAAM,EAAE,MAAK,GAAI,QAAA;AACjB,IAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AACzB,MAAA,OAAO,QAAA;AAAA,QACL,IAAA,CAAK,KAAA,CAAM,OAAA,CAAQ,CAAC,MAAA,KAAW,IAAA,CAAK,SAAA,CAAU,EAAE,GAAG,QAAA,EAAU,IAAA,EAAM,MAAA,EAAQ,CAAC;AAAA,OAC9E;AAAA,IACF;AACA,IAAA,OAAO,IAAA,CAAK,IAAA,KAAS,cAAA,GAAiB,IAAA,CAAK,WAAA,CAAY,UAAU,IAAA,CAAK,KAAK,CAAA,GAAI,CAAC,QAAQ,CAAA;AAAA,EAC1F;AAAA,EAEQ,WAAA,CAAY,OAAkB,KAAA,EAAiD;AACrF,IAAA,MAAM,WAAA,GAAc,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,SAAA,CAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,IAAA,EAAM,CAAC,CAAA;AAChF,IAAA,MAAM,IAAA,GAAO,YAAY,MAAA,CAAO,CAAC,SAAS,IAAA,KAAS,OAAA,GAAU,IAAA,CAAK,MAAA,EAAQ,CAAC,CAAA;AAC3E,IAAA,IAAI,IAAA,GAAO,eAAA,IAAmB,WAAA,CAAY,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAM,CAAC,CAAA,EAAG;AAC7F,MAAA,OAAO,CAAC,MAAM,CAAA;AAAA,IAChB;AACA,IAAA,IAAI,YAAA,GAA2B,CAAC,EAAE,CAAA;AAClC,IAAA,KAAA,MAAW,QAAQ,WAAA,EAA8B;AAC/C,MAAA,YAAA,GAAe,YAAA,CAAa,OAAA,CAAQ,CAAC,IAAA,KAAS,KAAK,GAAA,CAAI,CAAC,MAAA,KAAW,CAAC,GAAG,IAAA,EAAM,MAAA,CAAO,IAAI,CAAC,CAAC,CAAA;AAAA,IAC5F;AACA,IAAA,OAAO,YAAA,CAAa,GAAA,CAAI,CAAC,KAAA,MAAW,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,gBAAA,CAAiB,KAAK,CAAA,EAAE,CAAE,CAAA;AAAA,EAClF;AAAA,EAEQ,eAAe,KAAA,EAA8B;AACnD,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,SAAA,CAAU,KAAK,CAAA;AACpC,IAAA,IAAI,QAAQ,IAAA,CAAK,CAAC,WAAW,MAAA,CAAO,IAAA,KAAS,MAAM,CAAA,EAAG;AACpD,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,MAAM,IAAA,GAAQ,QAAwB,MAAA,CAAO,CAAC,WAAW,CAAC,SAAA,CAAU,MAAA,CAAO,IAAI,CAAC,CAAA;AAChF,IAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,SAAA,CAAU,IAAA,CAAK,GAAA,CAAI,CAAC,MAAA,KAAW,MAAA,CAAO,IAAI,CAAC,CAAA,EAAE;AAAA,EACxE;AAAA;AAAA,EAGQ,OAAA,CAAQ,OAAkB,KAAA,EAA2B;AAC3D,IAAA,MAAM,CAAC,MAAM,CAAA,GAAI,KAAA,CAAM,SAAS,QAAA,GAAW,KAAA,CAAM,UAAU,EAAC;AAC5D,IAAA,IAAI,KAAA,CAAM,SAAS,QAAA,IAAY,KAAA,CAAM,QAAQ,MAAA,KAAW,CAAA,IAAK,MAAA,EAAQ,IAAA,KAAS,UAAA,EAAY;AACxF,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,OAAO,UAAU,IAAA,EAAM,KAAA,EAAO,WAAA,CAAY,MAAA,CAAO,IAAI,CAAC,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,KAAA,CAAM,OAAkB,KAAA,EAA2B;AACjD,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC/B,IAAA,IAAI,KAAA,CAAM,SAAS,MAAA,EAAQ;AACzB,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,IAAI,IAAA,CAAK,SAAA,CAAU,KAAK,CAAA,CAAE,SAAS,CAAA,EAAG;AACpC,MAAA,OAAO,IAAA,CAAK,UAAA,CAAW,KAAA,EAAO,KAAK,CAAA;AAAA,IACrC;AACA,IAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,IAAA,QAAQ,KAAK,IAAA;AAAM,MACjB,KAAK,QAAA;AACH,QAAA,OAAO,IAAA,CAAK,UAAA,CAAW,KAAA,EAAO,IAAA,CAAK,SAAS,KAAK,CAAA;AAAA,MACnD,KAAK,cAAA;AACH,QAAA,OAAO,IAAA,CAAK,UAAA,CAAW,KAAA,EAAO,IAAA,CAAK,OAAO,KAAK,CAAA;AAAA,MACjD,KAAK,OAAA;AACH,QAAA,OAAO,IAAA,CAAK,UAAA,CAAW,KAAA,EAAO,KAAK,CAAA;AAAA,MACrC,KAAK,OAAA;AACH,QAAA,OAAO,aAAA,CAAc,KAAK,CAAA,GAAI,IAAA,CAAK,SAAA,CAAU,OAAO,IAAA,CAAK,OAAO,CAAA,GAAI,YAAA,CAAa,KAAK,CAAA;AAAA,MACxF,KAAK,SAAA;AACH,QAAA,OAAO,IAAA,CAAK,OAAA,KAAY,OAAA,GAAU,KAAA,GAAQ,aAAa,KAAK,CAAA;AAAA,MAC9D;AACE,QAAA,OAAO,aAAa,KAAK,CAAA;AAAA;AAC7B,EACF;AAAA,EAEQ,UAAA,CAAW,KAAA,EAAkB,OAAA,EAA8B,KAAA,EAA2B;AAC5F,IAAA,MAAM,GAAA,GAAM,SAAS,KAAK,CAAA;AAC1B,IAAA,MAAM,WAAW,OAAA,CAAQ,IAAA;AAAA,MACvB,CAAC,MAAA,KAAW,MAAA,CAAO,IAAA,KAAS,UAAA,IAAc,QAAQ,IAAA,IAAQ,WAAA,CAAY,MAAA,CAAO,IAAI,CAAA,KAAM;AAAA,KACzF;AACA,IAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,MAAA,OAAO,IAAA,CAAK,SAAA,CAAU,KAAA,EAAO,QAAA,CAAS,IAAI,CAAA;AAAA,IAC5C;AACA,IAAA,MAAM,YAAY,OAAA,CAAQ,IAAA,CAAK,CAAC,MAAA,KAAW,MAAA,CAAO,SAAS,gBAAgB,CAAA;AAC3E,IAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,MAAA,OAAO,IAAA,CAAK,SAAA,CAAU,KAAA,EAAO,SAAA,CAAU,IAAI,CAAA;AAAA,IAC7C;AACA,IAAA,OAAO,GAAA,KAAQ,IAAA,IAAQ,eAAA,CAAgB,GAAG,IAAI,MAAA,GAAS,OAAA;AAAA,EACzD;AAAA,EAEQ,UAAA,CAAW,KAAA,EAAkB,KAAA,EAA0B,KAAA,EAA2B;AACxF,IAAA,IAAI,mBAAA,CAAoB,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA,EAAG;AAC3C,MAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,KAAA,EAAM;AAAA,IACjC;AACA,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,KAAA,CAAM,EAAE,GAAG,KAAA,EAAO,IAAA,EAAK,EAAG,KAAK,CAAC,CAAA;AACvE,IAAA,IAAI,MAAM,IAAA,CAAK,CAAC,SAAS,IAAA,CAAK,IAAA,KAAS,QAAQ,CAAA,EAAG;AAChD,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,EAAM,EAAA,MAAQ,EAAE,IAAA,EAAM,KAAA,EAAO,KAAA,CAAM,EAAE,CAAA,EAAgB,CAAE,CAAA;AAC/E,IAAA,MAAM,KAAA,GAAQ,cAAc,IAAA,EAAM,KAAA,EAAO,SAAS,KAAK,CAAA,EAAG,IAAI,CAAA,CAAE,OAAA;AAAA,MAAQ,CAAC,SACvE,IAAA,CAAK,IAAA,KAAS,SAAS,CAAC,IAAA,CAAK,IAAI,CAAA,GAAI;AAAC,KACxC;AACA,IAAA,OAAO,KAAA,CAAM,MAAA,KAAW,CAAA,GAAI,OAAA,GAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,gBAAA,CAAiB,KAAK,CAAA,EAAE;AAAA,EAClF;AAAA,EAEQ,UAAA,CAAW,OAAkB,KAAA,EAA2B;AAC9D,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,SAAA,CAAU,KAAK,CAAA,CAAE,GAAA;AAAA,MAAI,CAAC,WACvC,MAAA,CAAO,IAAA,KAAS,SAAS,IAAA,CAAK,KAAA,CAAM,MAAA,EAAQ,KAAK,CAAA,GAAI;AAAA,KACvD;AACA,IAAA,IAAI,MAAM,IAAA,CAAK,CAAC,WAAW,MAAA,CAAO,IAAA,KAAS,SAAS,CAAA,EAAG;AACrD,MAAA,OAAO,OAAA;AAAA,IACT;AACA,IAAA,IAAI,MAAM,IAAA,CAAK,CAAC,WAAW,MAAA,CAAO,IAAA,KAAS,QAAQ,CAAA,EAAG;AACpD,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,SAAA,CAAW,KAAA,CAAsB,GAAA,CAAI,CAAC,MAAA,KAAW,MAAA,CAAO,IAAI,CAAC,CAAA,EAAE;AAAA,EAC1F;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,SAAA,CAAU,OAAkB,IAAA,EAA0B;AAC5D,IAAA,MAAM,MAAA,GAAoB,EAAE,GAAG,KAAA,EAAO,IAAA,EAAK;AAC3C,IAAA,IAAI,CAAC,MAAM,IAAA,EAAM;AACf,MAAA,OAAO,IAAA,CAAK,OAAO,MAAM,CAAA;AAAA,IAC3B;AACA,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,SAAA,CAAU,MAAM,CAAA;AACrC,IAAA,IAAI,QAAQ,IAAA,CAAK,CAAC,cAAc,SAAA,CAAU,IAAA,KAAS,MAAM,CAAA,EAAG;AAC1D,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,MAAM,OAAA,GAAW,QAAwB,MAAA,CAAO,CAAC,cAAc,CAAC,SAAA,CAAU,SAAA,CAAU,IAAI,CAAC,CAAA;AACzF,IAAA,MAAM,QAAA,GAAW,QAAQ,GAAA,CAAI,CAAC,cAAc,YAAA,CAAa,SAAA,CAAU,IAAI,CAAC,CAAA;AACxE,IAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,IAAK,QAAA,CAAS,MAAM,CAAC,OAAA,KAAY,OAAA,KAAY,IAAI,CAAA,EAAG;AACvE,MAAA,OAAO,IAAA,CAAK,OAAO,EAAE,GAAG,OAAO,IAAA,EAAM,SAAA,CAAU,QAAoB,CAAA,EAAG,CAAA;AAAA,IACxE;AACA,IAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,SAAA,CAAU,OAAA,CAAQ,GAAA,CAAI,CAAC,SAAA,KAAc,SAAA,CAAU,IAAI,CAAC,CAAA,EAAE;AAAA,EACjF;AACF;AAEA,SAAS,UAAU,IAAA,EAAuB;AACxC,EAAA,OAAO,KAAK,IAAA,KAAS,SAAA,IAAa,OAAA,CAAQ,GAAA,CAAI,KAAK,OAAO,CAAA;AAC5D;AAGA,SAAS,aAAa,IAAA,EAA6B;AACjD,EAAA,OAAO,IAAA,CAAK,IAAA,KAAS,OAAA,GAAU,IAAA,CAAK,OAAA,GAAU,IAAA;AAChD;AAEA,SAAS,iBAAiB,KAAA,EAAkC;AAC1D,EAAA,OAAO,KAAA,CAAM,WAAW,CAAA,GAAK,KAAA,CAAM,CAAC,CAAA,GAAe,EAAE,IAAA,EAAM,cAAA,EAAgB,KAAA,EAAM;AACnF;AAEA,SAAS,SAAS,KAAA,EAA8B;AAC9C,EAAA,IAAI,KAAA,CAAM,SAAS,eAAA,EAAiB;AAClC,IAAA,OAAO,KAAA,CAAM,KAAA;AAAA,EACf;AACA,EAAA,OAAO,MAAM,IAAA,KAAS,eAAA,GAAkB,MAAA,CAAO,KAAA,CAAM,KAAK,CAAA,GAAI,IAAA;AAChE;AAEA,SAAS,cAAc,KAAA,EAAwB;AAC7C,EAAA,MAAM,GAAA,GAAM,SAAS,KAAK,CAAA;AAC1B,EAAA,OAAQ,KAAA,CAAM,SAAS,SAAA,IAAa,KAAA,CAAM,YAAY,QAAA,IAAa,OAAA,CAAQ,IAAA,CAAK,GAAA,IAAO,EAAE,CAAA;AAC3F;AAEA,SAAS,gBAAgB,GAAA,EAAsB;AAC7C,EAAA,OAAO,OAAO,EAAC;AACjB;AAGA,SAAS,aAAa,KAAA,EAA2B;AAC/C,EAAA,MAAM,GAAA,GAAM,SAAS,KAAK,CAAA;AAC1B,EAAA,MAAM,YAAY,GAAA,KAAQ,IAAA,IAAQ,OAAO,MAAA,CAAO,SAAA,IAAa,OAAO,KAAA,CAAM,SAAA;AAC1E,EAAA,OAAO,SAAA,IAAa,GAAA,IAAO,MAAA,CAAO,SAAA,GAAY,MAAA,GAAS,OAAA;AACzD;;"}

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

@@ -0,0 +1,172 @@
+'use strict';
+
+const constructors = require('../../../domain/ir/constructors.cjs');
+const propertyName = require('../../../domain/ir/property-name.cjs');
+const evaluation = require('./evaluation.cjs');
+
+function objectParts(types, value, parts) {
+  return parts.flatMap((part) => {
+    const members = types.membersOf({ ...value, type: part });
+    const [only] = members;
+    if (members.length !== 1 || only?.kind !== "type") {
+      return [null];
+    }
+    if (only.type.kind === "intersection") {
+      return objectParts(types, only, only.type.types);
+    }
+    return [only.type.kind === "object" ? only.type : null];
+  });
+}
+function unitOf(type) {
+  switch (type.kind) {
+    case "stringLiteral":
+      return `s:${type.value}`;
+    case "numberLiteral":
+      return `n:${type.value}`;
+    case "booleanLiteral":
+      return `b:${type.value}`;
+    case "keyword":
+      return type.keyword === "null" || type.keyword === "undefined" ? type.keyword : null;
+    default:
+      return null;
+  }
+}
+function unitsOf(types, value, type) {
+  const units = types.membersOf({ ...value, type }).map((member) => {
+    return member.kind === "type" ? unitOf(member.type) : null;
+  });
+  return units.includes(null) ? null : new Set(units);
+}
+function propertiesNamed(objects, key) {
+  return objects.flatMap((object) => {
+    const members = object.members;
+    return members.filter(
+      (member) => member.kind === "property" && evaluation.propertyKey(member.name) === key
+    );
+  });
+}
+function isNeverProperty(types, value, found) {
+  if (found.length < 2 || found.every((property) => property.isOptional)) {
+    return false;
+  }
+  const sets = found.map((property) => unitsOf(types, value, property.type));
+  if (sets.includes(null)) {
+    return false;
+  }
+  const [first, ...rest] = sets;
+  const shared = [...first].filter((unit) => rest.every((set) => set.has(unit)));
+  return shared.length === 0;
+}
+function isNullishObject(types, value, parts) {
+  const singles = parts.map((part) => {
+    const members = types.membersOf({ ...value, type: part });
+    const [only] = members;
+    return members.length === 1 && only?.kind === "type" ? only.type : null;
+  });
+  const isNullish = (type) => type?.kind === "keyword" && (type.keyword === "null" || type.keyword === "undefined");
+  return singles.some(isNullish) && singles.some((type) => type?.kind === "object");
+}
+function isNeverIntersection(types, value, parts) {
+  if (isNullishObject(types, value, parts)) {
+    return true;
+  }
+  const objects = objectParts(types, value, parts).filter((part) => part !== null);
+  if (objects.length < 2) {
+    return false;
+  }
+  const keys = new Set(
+    objects.flatMap(
+      (object) => object.members.flatMap(
+        (member) => member.kind === "property" ? [evaluation.propertyKey(member.name)] : []
+      )
+    )
+  );
+  const valueOfKeys = { ...value, deep: false };
+  return [...keys].some(
+    (key) => isNeverProperty(types, valueOfKeys, propertiesNamed(objects, key))
+  );
+}
+function isSignatureOnly(types, value, key) {
+  const members = types.membersOf(value);
+  const [only] = members;
+  if (key === null || members.length !== 1 || only?.kind !== "type" || only.type.kind !== "object") {
+    return false;
+  }
+  const { members: declared } = only.type;
+  const hasSignature = declared.some((member) => member.kind === "indexSignature");
+  return hasSignature && propertiesNamed([only.type], key).length === 0;
+}
+function declaredFirst(types, value, key, parts) {
+  const bySignature = parts.map(({ type }) => isSignatureOnly(types, { ...value, type }, key));
+  const isDeclared = parts.some(({ found }, at) => found.kind === "type" && !bySignature[at]);
+  return parts.filter((_, at) => !(isDeclared && bySignature[at])).map(({ found }) => found);
+}
+function hasKey(value, key) {
+  const { type } = value;
+  if (type.kind === "intersection") {
+    return type.types.some((part) => hasKey({ ...value, type: part }, key));
+  }
+  if (type.kind !== "object") {
+    return false;
+  }
+  return propertiesNamed([type], key).some((property) => value.deep || !property.isOptional);
+}
+function extracted(types, value, key) {
+  const members = types.membersOf(value);
+  if (members.some((member) => member.kind !== "type")) {
+    return evaluation.OPAQUE;
+  }
+  const kept = members.filter((member) => hasKey(member, key));
+  if (kept.length === 0) {
+    return evaluation.MISSING;
+  }
+  return { ...value, type: evaluation.unionType(kept.map((member) => member.type)) };
+}
+function omittedKeys(types, value, keys) {
+  const members = types.membersOf({ ...value, type: keys });
+  const names = members.map(
+    (member) => member.kind === "type" && member.type.kind === "stringLiteral" ? member.type.value : null
+  );
+  return names.includes(null) ? null : new Set(names);
+}
+function hasSharedProperty(members) {
+  const names = members.flatMap(
+    (member) => member.kind === "property" ? [evaluation.propertyKey(member.name)] : []
+  );
+  return new Set(names).size !== names.length;
+}
+function omitted(types, value, keys) {
+  const names = omittedKeys(types, value, keys);
+  const objects = objectParts(types, value, [value.type]);
+  if (names === null || objects.length === 0 || objects.includes(null)) {
+    return evaluation.OPAQUE;
+  }
+  const members = objects.flatMap((object) => object.members);
+  if (hasSharedProperty(members)) {
+    return evaluation.OPAQUE;
+  }
+  const signatures = members.filter((member) => member.kind === "indexSignature");
+  const kept = signatures.length > 0 ? signatures : members.filter(
+    (member) => member.kind !== "property" || !names.has(evaluation.propertyKey(member.name))
+  );
+  return { ...value, type: { kind: "object", members: kept } };
+}
+const READ_WRITE_MARKER_KEYS = /* @__PURE__ */ new Map([
+  ["$Read", "$read"],
+  ["$Write", "$write"]
+]);
+function markerObject(name, argument) {
+  const key = READ_WRITE_MARKER_KEYS.get(name);
+  if (key === void 0) {
+    return null;
+  }
+  const member = constructors.irProperty(propertyName.toPropertyName(key), argument.type, { isReadonly: true });
+  return { ...argument, type: constructors.irObject([member]) };
+}
+
+exports.declaredFirst = declaredFirst;
+exports.extracted = extracted;
+exports.isNeverIntersection = isNeverIntersection;
+exports.markerObject = markerObject;
+exports.omitted = omitted;
+//# sourceMappingURL=type-rules.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"type-rules.cjs","sources":["../../../../src/application/transform/footer/type-rules.ts"],"sourcesContent":["import { irObject, irProperty } from \"../../../domain/ir/constructors.js\";\nimport type {\n  IrMember,\n  IrObjectType,\n  IrPropertySignature,\n  IrType,\n} from \"../../../domain/ir/nodes.js\";\nimport { toPropertyName } from \"../../../domain/ir/property-name.js\";\nimport {\n  type Evaluated,\n  type Evaluation,\n  MISSING,\n  OPAQUE,\n  propertyKey,\n  unionType,\n} from \"./evaluation.js\";\n\n/**\n * Rules of TypeScript about intersections, `Omit` and `Extract` that the `--enum-values` check\n * needs (ADR-027). They read the types as written, before `FlattenedDeepRequired`.\n */\n\n/** The part of the evaluator these rules use. */\nexport interface TypeExpansion {\n  membersOf(value: Evaluated): readonly Evaluation[];\n}\n\n/** A unit value of a type: a literal, `null` or `undefined`. */\ntype Unit = string;\n\n/**\n * The parts an intersection is made of, nested intersections flattened: each object type, or\n * `null` for a part that is not one.\n */\nfunction objectParts(\n  types: TypeExpansion,\n  value: Evaluated,\n  parts: readonly IrType[],\n): (IrObjectType | null)[] {\n  return parts.flatMap((part) => {\n    const members = types.membersOf({ ...value, type: part });\n    const [only] = members;\n    if (members.length !== 1 || only?.kind !== \"type\") {\n      return [null];\n    }\n    if (only.type.kind === \"intersection\") {\n      return objectParts(types, only, only.type.types);\n    }\n    return [only.type.kind === \"object\" ? only.type : null];\n  });\n}\n\nfunction unitOf(type: IrType): Unit | null {\n  switch (type.kind) {\n    case \"stringLiteral\":\n      return `s:${type.value}`;\n    case \"numberLiteral\":\n      return `n:${type.value}`;\n    case \"booleanLiteral\":\n      return `b:${type.value}`;\n    case \"keyword\":\n      return type.keyword === \"null\" || type.keyword === \"undefined\" ? type.keyword : null;\n    default:\n      return null;\n  }\n}\n\n/** The unit values of a type made only of units, or `null` where it has other values. */\nfunction unitsOf(types: TypeExpansion, value: Evaluated, type: IrType): ReadonlySet<Unit> | null {\n  const units = types.membersOf({ ...value, type }).map((member) => {\n    return member.kind === \"type\" ? unitOf(member.type) : null;\n  });\n  return units.includes(null) ? null : new Set(units as Unit[]);\n}\n\nfunction propertiesNamed(objects: readonly IrObjectType[], key: string): IrPropertySignature[] {\n  return objects.flatMap((object) => {\n    const members: readonly IrMember[] = object.members;\n    return members.filter(\n      (member): member is IrPropertySignature =>\n        member.kind === \"property\" && propertyKey(member.name) === key,\n    );\n  });\n}\n\n/** Whether properties of the same name share no unit value, one of them required. */\nfunction isNeverProperty(\n  types: TypeExpansion,\n  value: Evaluated,\n  found: IrPropertySignature[],\n): boolean {\n  if (found.length < 2 || found.every((property) => property.isOptional)) {\n    return false;\n  }\n  const sets = found.map((property) => unitsOf(types, value, property.type));\n  if (sets.includes(null)) {\n    return false;\n  }\n  // At least two properties, so at least two sets.\n  const [first, ...rest] = sets as [ReadonlySet<Unit>, ...ReadonlySet<Unit>[]];\n  const shared = [...first].filter((unit) => rest.every((set) => set.has(unit)));\n  return shared.length === 0;\n}\n\n/** Whether an intersection has `null` or `undefined` next to an object: `null & { a: 1 }`. */\nfunction isNullishObject(types: TypeExpansion, value: Evaluated, parts: readonly IrType[]) {\n  const singles = parts.map((part) => {\n    const members = types.membersOf({ ...value, type: part });\n    const [only] = members;\n    return members.length === 1 && only?.kind === \"type\" ? only.type : null;\n  });\n  const isNullish = (type: IrType | null) =>\n    type?.kind === \"keyword\" && (type.keyword === \"null\" || type.keyword === \"undefined\");\n  return singles.some(isNullish) && singles.some((type) => type?.kind === \"object\");\n}\n\n/**\n * Whether TypeScript reduces an intersection to `never`: `null` or `undefined` meets an object,\n * or objects share a property with literal types that have no value in common, one of them\n * requiring it (`{ a: \"x\" } & { a: \"y\" }`). Other properties are left alone, so the answer is\n * sure where it is yes.\n */\nexport function isNeverIntersection(\n  types: TypeExpansion,\n  value: Evaluated,\n  parts: readonly IrType[],\n): boolean {\n  if (isNullishObject(types, value, parts)) {\n    return true;\n  }\n  const objects = objectParts(types, value, parts).filter((part) => part !== null);\n  if (objects.length < 2) {\n    return false;\n  }\n  const keys = new Set(\n    objects.flatMap((object) =>\n      object.members.flatMap((member) =>\n        member.kind === \"property\" ? [propertyKey(member.name)] : [],\n      ),\n    ),\n  );\n  const valueOfKeys = { ...value, deep: false };\n  return [...keys].some((key) =>\n    isNeverProperty(types, valueOfKeys, propertiesNamed(objects, key)),\n  );\n}\n\n/** Whether `key` reaches only an index signature of this object: it declares no such property. */\nfunction isSignatureOnly(types: TypeExpansion, value: Evaluated, key: string | null): boolean {\n  const members = types.membersOf(value);\n  const [only] = members;\n  if (\n    key === null ||\n    members.length !== 1 ||\n    only?.kind !== \"type\" ||\n    only.type.kind !== \"object\"\n  ) {\n    return false;\n  }\n  const { members: declared } = only.type;\n  const hasSignature = declared.some((member) => member.kind === \"indexSignature\");\n  return hasSignature && propertiesNamed([only.type], key).length === 0;\n}\n\n/**\n * The parts of an intersection indexed by `index`, as TypeScript reads them: where one part\n * declares the property, the index signatures of the others do not take part\n * (`{ a: X } & { [key: string]: Y }` gives `X` for `a`).\n */\nexport function declaredFirst(\n  types: TypeExpansion,\n  value: Evaluated,\n  key: string | null,\n  parts: readonly { readonly type: IrType; readonly found: Evaluation }[],\n): Evaluation[] {\n  const bySignature = parts.map(({ type }) => isSignatureOnly(types, { ...value, type }, key));\n  const isDeclared = parts.some(({ found }, at) => found.kind === \"type\" && !bySignature[at]);\n  return parts.filter((_, at) => !(isDeclared && bySignature[at])).map(({ found }) => found);\n}\n\n/**\n * Whether a member of `membersOf` has `key` as a property that `{ key: unknown }` accepts: written\n * and, outside `FlattenedDeepRequired`, required. An index signature does not count, as in\n * TypeScript. Such a member is expanded, parts included, so it is an object, an intersection of\n * members, or a primitive or array type, which has no such property; a type the evaluator cannot\n * read makes `membersOf` opaque instead.\n */\nfunction hasKey(value: Evaluated, key: string): boolean {\n  const { type } = value;\n  if (type.kind === \"intersection\") {\n    return type.types.some((part) => hasKey({ ...value, type: part }, key));\n  }\n  if (type.kind !== \"object\") {\n    return false;\n  }\n  return propertiesNamed([type], key).some((property) => value.deep || !property.isOptional);\n}\n\n/**\n * `Extract<T, { key: unknown }>`: the members of `T` that have `key`. When none has it the\n * result is `never`; it is `missing` here, as the location then types nothing.\n */\nexport function extracted(types: TypeExpansion, value: Evaluated, key: string): Evaluation {\n  const members = types.membersOf(value);\n  if (members.some((member) => member.kind !== \"type\")) {\n    return OPAQUE;\n  }\n  const kept = (members as Evaluated[]).filter((member) => hasKey(member, key));\n  if (kept.length === 0) {\n    return MISSING;\n  }\n  return { ...value, type: unionType(kept.map((member) => member.type)) };\n}\n\nfunction omittedKeys(types: TypeExpansion, value: Evaluated, keys: IrType): Set<string> | null {\n  const members = types.membersOf({ ...value, type: keys });\n  const names = members.map((member) =>\n    member.kind === \"type\" && member.type.kind === \"stringLiteral\" ? member.type.value : null,\n  );\n  return names.includes(null) ? null : new Set(names as string[]);\n}\n\n/** Whether two members name the same property: merging them would need their intersection. */\nfunction hasSharedProperty(members: readonly IrMember[]): boolean {\n  const names = members.flatMap((member) =>\n    member.kind === \"property\" ? [propertyKey(member.name)] : [],\n  );\n  return new Set(names).size !== names.length;\n}\n\n/**\n * `Omit<T, K>` for literal keys `K` over an object or an intersection of objects. A string index\n * signature makes `keyof T` all strings, so only the index signatures are left.\n */\nexport function omitted(types: TypeExpansion, value: Evaluated, keys: IrType): Evaluation {\n  const names = omittedKeys(types, value, keys);\n  const objects = objectParts(types, value, [value.type]);\n  if (names === null || objects.length === 0 || objects.includes(null)) {\n    return OPAQUE;\n  }\n  const members = (objects as IrObjectType[]).flatMap((object) => object.members);\n  if (hasSharedProperty(members)) {\n    return OPAQUE;\n  }\n  const signatures = members.filter((member) => member.kind === \"indexSignature\");\n  const kept =\n    signatures.length > 0\n      ? signatures\n      : members.filter(\n          (member) => member.kind !== \"property\" || !names.has(propertyKey(member.name)),\n        );\n  return { ...value, type: { kind: \"object\", members: kept } };\n}\n\n/** The `--read-write-markers` types and their one member (`READ_WRITE_MARKER_TYPES`). */\nconst READ_WRITE_MARKER_KEYS: ReadonlyMap<string, string> = new Map([\n  [\"$Read\", \"$read\"],\n  [\"$Write\", \"$write\"],\n]);\n\n/** `$Read<T>` is `{ readonly $read: T }`: an object, which holds no enum value. */\nexport function markerObject(name: string, argument: Evaluated): Evaluated | null {\n  const key = READ_WRITE_MARKER_KEYS.get(name);\n  if (key === undefined) {\n    return null;\n  }\n  const member = irProperty(toPropertyName(key), argument.type, { isReadonly: true });\n  return { ...argument, type: irObject([member]) };\n}\n"],"names":["propertyKey","OPAQUE","MISSING","unionType","irProperty","toPropertyName","irObject"],"mappings":";;;;;;AAkCA,SAAS,WAAA,CACP,KAAA,EACA,KAAA,EACA,KAAA,EACyB;AACzB,EAAA,OAAO,KAAA,CAAM,OAAA,CAAQ,CAAC,IAAA,KAAS;AAC7B,IAAA,MAAM,OAAA,GAAU,MAAM,SAAA,CAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,MAAM,CAAA;AACxD,IAAA,MAAM,CAAC,IAAI,CAAA,GAAI,OAAA;AACf,IAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,CAAA,IAAK,IAAA,EAAM,SAAS,MAAA,EAAQ;AACjD,MAAA,OAAO,CAAC,IAAI,CAAA;AAAA,IACd;AACA,IAAA,IAAI,IAAA,CAAK,IAAA,CAAK,IAAA,KAAS,cAAA,EAAgB;AACrC,MAAA,OAAO,WAAA,CAAY,KAAA,EAAO,IAAA,EAAM,IAAA,CAAK,KAAK,KAAK,CAAA;AAAA,IACjD;AACA,IAAA,OAAO,CAAC,IAAA,CAAK,IAAA,CAAK,SAAS,QAAA,GAAW,IAAA,CAAK,OAAO,IAAI,CAAA;AAAA,EACxD,CAAC,CAAA;AACH;AAEA,SAAS,OAAO,IAAA,EAA2B;AACzC,EAAA,QAAQ,KAAK,IAAA;AAAM,IACjB,KAAK,eAAA;AACH,MAAA,OAAO,CAAA,EAAA,EAAK,KAAK,KAAK,CAAA,CAAA;AAAA,IACxB,KAAK,eAAA;AACH,MAAA,OAAO,CAAA,EAAA,EAAK,KAAK,KAAK,CAAA,CAAA;AAAA,IACxB,KAAK,gBAAA;AACH,MAAA,OAAO,CAAA,EAAA,EAAK,KAAK,KAAK,CAAA,CAAA;AAAA,IACxB,KAAK,SAAA;AACH,MAAA,OAAO,KAAK,OAAA,KAAY,MAAA,IAAU,KAAK,OAAA,KAAY,WAAA,GAAc,KAAK,OAAA,GAAU,IAAA;AAAA,IAClF;AACE,MAAA,OAAO,IAAA;AAAA;AAEb;AAGA,SAAS,OAAA,CAAQ,KAAA,EAAsB,KAAA,EAAkB,IAAA,EAAwC;AAC/F,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,SAAA,CAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,CAAA,CAAE,GAAA,CAAI,CAAC,MAAA,KAAW;AAChE,IAAA,OAAO,OAAO,IAAA,KAAS,MAAA,GAAS,MAAA,CAAO,MAAA,CAAO,IAAI,CAAA,GAAI,IAAA;AAAA,EACxD,CAAC,CAAA;AACD,EAAA,OAAO,MAAM,QAAA,CAAS,IAAI,IAAI,IAAA,GAAO,IAAI,IAAI,KAAe,CAAA;AAC9D;AAEA,SAAS,eAAA,CAAgB,SAAkC,GAAA,EAAoC;AAC7F,EAAA,OAAO,OAAA,CAAQ,OAAA,CAAQ,CAAC,MAAA,KAAW;AACjC,IAAA,MAAM,UAA+B,MAAA,CAAO,OAAA;AAC5C,IAAA,OAAO,OAAA,CAAQ,MAAA;AAAA,MACb,CAAC,WACC,MAAA,CAAO,IAAA,KAAS,cAAcA,sBAAA,CAAY,MAAA,CAAO,IAAI,CAAA,KAAM;AAAA,KAC/D;AAAA,EACF,CAAC,CAAA;AACH;AAGA,SAAS,eAAA,CACP,KAAA,EACA,KAAA,EACA,KAAA,EACS;AACT,EAAA,IAAI,KAAA,CAAM,SAAS,CAAA,IAAK,KAAA,CAAM,MAAM,CAAC,QAAA,KAAa,QAAA,CAAS,UAAU,CAAA,EAAG;AACtE,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,GAAA,CAAI,CAAC,QAAA,KAAa,QAAQ,KAAA,EAAO,KAAA,EAAO,QAAA,CAAS,IAAI,CAAC,CAAA;AACzE,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,MAAM,CAAC,KAAA,EAAO,GAAG,IAAI,CAAA,GAAI,IAAA;AACzB,EAAA,MAAM,SAAS,CAAC,GAAG,KAAK,CAAA,CAAE,OAAO,CAAC,IAAA,KAAS,IAAA,CAAK,KAAA,CAAM,CAAC,GAAA,KAAQ,GAAA,CAAI,GAAA,CAAI,IAAI,CAAC,CAAC,CAAA;AAC7E,EAAA,OAAO,OAAO,MAAA,KAAW,CAAA;AAC3B;AAGA,SAAS,eAAA,CAAgB,KAAA,EAAsB,KAAA,EAAkB,KAAA,EAA0B;AACzF,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AAClC,IAAA,MAAM,OAAA,GAAU,MAAM,SAAA,CAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,MAAM,CAAA;AACxD,IAAA,MAAM,CAAC,IAAI,CAAA,GAAI,OAAA;AACf,IAAA,OAAO,QAAQ,MAAA,KAAW,CAAA,IAAK,MAAM,IAAA,KAAS,MAAA,GAAS,KAAK,IAAA,GAAO,IAAA;AAAA,EACrE,CAAC,CAAA;AACD,EAAA,MAAM,SAAA,GAAY,CAAC,IAAA,KACjB,IAAA,EAAM,IAAA,KAAS,cAAc,IAAA,CAAK,OAAA,KAAY,MAAA,IAAU,IAAA,CAAK,OAAA,KAAY,WAAA,CAAA;AAC3E,EAAA,OAAO,OAAA,CAAQ,IAAA,CAAK,SAAS,CAAA,IAAK,OAAA,CAAQ,KAAK,CAAC,IAAA,KAAS,IAAA,EAAM,IAAA,KAAS,QAAQ,CAAA;AAClF;AAQO,SAAS,mBAAA,CACd,KAAA,EACA,KAAA,EACA,KAAA,EACS;AACT,EAAA,IAAI,eAAA,CAAgB,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA,EAAG;AACxC,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAA,GAAU,WAAA,CAAY,KAAA,EAAO,KAAA,EAAO,KAAK,EAAE,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,KAAS,IAAI,CAAA;AAC/E,EAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAO,IAAI,GAAA;AAAA,IACf,OAAA,CAAQ,OAAA;AAAA,MAAQ,CAAC,MAAA,KACf,MAAA,CAAO,OAAA,CAAQ,OAAA;AAAA,QAAQ,CAAC,MAAA,KACtB,MAAA,CAAO,IAAA,KAAS,UAAA,GAAa,CAACA,sBAAA,CAAY,MAAA,CAAO,IAAI,CAAC,CAAA,GAAI;AAAC;AAC7D;AACF,GACF;AACA,EAAA,MAAM,WAAA,GAAc,EAAE,GAAG,KAAA,EAAO,MAAM,KAAA,EAAM;AAC5C,EAAA,OAAO,CAAC,GAAG,IAAI,CAAA,CAAE,IAAA;AAAA,IAAK,CAAC,QACrB,eAAA,CAAgB,KAAA,EAAO,aAAa,eAAA,CAAgB,OAAA,EAAS,GAAG,CAAC;AAAA,GACnE;AACF;AAGA,SAAS,eAAA,CAAgB,KAAA,EAAsB,KAAA,EAAkB,GAAA,EAA6B;AAC5F,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,SAAA,CAAU,KAAK,CAAA;AACrC,EAAA,MAAM,CAAC,IAAI,CAAA,GAAI,OAAA;AACf,EAAA,IACE,GAAA,KAAQ,IAAA,IACR,OAAA,CAAQ,MAAA,KAAW,CAAA,IACnB,IAAA,EAAM,IAAA,KAAS,MAAA,IACf,IAAA,CAAK,IAAA,CAAK,IAAA,KAAS,QAAA,EACnB;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,EAAE,OAAA,EAAS,QAAA,EAAS,GAAI,IAAA,CAAK,IAAA;AACnC,EAAA,MAAM,eAAe,QAAA,CAAS,IAAA,CAAK,CAAC,MAAA,KAAW,MAAA,CAAO,SAAS,gBAAgB,CAAA;AAC/E,EAAA,OAAO,YAAA,IAAgB,gBAAgB,CAAC,IAAA,CAAK,IAAI,CAAA,EAAG,GAAG,EAAE,MAAA,KAAW,CAAA;AACtE;AAOO,SAAS,aAAA,CACd,KAAA,EACA,KAAA,EACA,GAAA,EACA,KAAA,EACc;AACd,EAAA,MAAM,WAAA,GAAc,KAAA,CAAM,GAAA,CAAI,CAAC,EAAE,IAAA,EAAK,KAAM,eAAA,CAAgB,KAAA,EAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAK,EAAG,GAAG,CAAC,CAAA;AAC3F,EAAA,MAAM,UAAA,GAAa,KAAA,CAAM,IAAA,CAAK,CAAC,EAAE,KAAA,EAAM,EAAG,EAAA,KAAO,KAAA,CAAM,IAAA,KAAS,MAAA,IAAU,CAAC,WAAA,CAAY,EAAE,CAAC,CAAA;AAC1F,EAAA,OAAO,MAAM,MAAA,CAAO,CAAC,CAAA,EAAG,EAAA,KAAO,EAAE,UAAA,IAAc,WAAA,CAAY,EAAE,CAAA,CAAE,EAAE,GAAA,CAAI,CAAC,EAAE,KAAA,OAAY,KAAK,CAAA;AAC3F;AASA,SAAS,MAAA,CAAO,OAAkB,GAAA,EAAsB;AACtD,EAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,EAAA,IAAI,IAAA,CAAK,SAAS,cAAA,EAAgB;AAChC,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,CAAC,IAAA,KAAS,MAAA,CAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,IAAA,EAAK,EAAG,GAAG,CAAC,CAAA;AAAA,EACxE;AACA,EAAA,IAAI,IAAA,CAAK,SAAS,QAAA,EAAU;AAC1B,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,OAAO,eAAA,CAAgB,CAAC,IAAI,CAAA,EAAG,GAAG,CAAA,CAAE,IAAA,CAAK,CAAC,QAAA,KAAa,KAAA,CAAM,IAAA,IAAQ,CAAC,SAAS,UAAU,CAAA;AAC3F;AAMO,SAAS,SAAA,CAAU,KAAA,EAAsB,KAAA,EAAkB,GAAA,EAAyB;AACzF,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,SAAA,CAAU,KAAK,CAAA;AACrC,EAAA,IAAI,QAAQ,IAAA,CAAK,CAAC,WAAW,MAAA,CAAO,IAAA,KAAS,MAAM,CAAA,EAAG;AACpD,IAAA,OAAOC,iBAAA;AAAA,EACT;AACA,EAAA,MAAM,IAAA,GAAQ,QAAwB,MAAA,CAAO,CAAC,WAAW,MAAA,CAAO,MAAA,EAAQ,GAAG,CAAC,CAAA;AAC5E,EAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACrB,IAAA,OAAOC,kBAAA;AAAA,EACT;AACA,EAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAMC,oBAAA,CAAU,IAAA,CAAK,GAAA,CAAI,CAAC,MAAA,KAAW,MAAA,CAAO,IAAI,CAAC,CAAA,EAAE;AACxE;AAEA,SAAS,WAAA,CAAY,KAAA,EAAsB,KAAA,EAAkB,IAAA,EAAkC;AAC7F,EAAA,MAAM,OAAA,GAAU,MAAM,SAAA,CAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,MAAM,CAAA;AACxD,EAAA,MAAM,QAAQ,OAAA,CAAQ,GAAA;AAAA,IAAI,CAAC,MAAA,KACzB,MAAA,CAAO,IAAA,KAAS,MAAA,IAAU,MAAA,CAAO,IAAA,CAAK,IAAA,KAAS,eAAA,GAAkB,MAAA,CAAO,IAAA,CAAK,KAAA,GAAQ;AAAA,GACvF;AACA,EAAA,OAAO,MAAM,QAAA,CAAS,IAAI,IAAI,IAAA,GAAO,IAAI,IAAI,KAAiB,CAAA;AAChE;AAGA,SAAS,kBAAkB,OAAA,EAAuC;AAChE,EAAA,MAAM,QAAQ,OAAA,CAAQ,OAAA;AAAA,IAAQ,CAAC,MAAA,KAC7B,MAAA,CAAO,IAAA,KAAS,UAAA,GAAa,CAACH,sBAAA,CAAY,MAAA,CAAO,IAAI,CAAC,CAAA,GAAI;AAAC,GAC7D;AACA,EAAA,OAAO,IAAI,GAAA,CAAI,KAAK,CAAA,CAAE,SAAS,KAAA,CAAM,MAAA;AACvC;AAMO,SAAS,OAAA,CAAQ,KAAA,EAAsB,KAAA,EAAkB,IAAA,EAA0B;AACxF,EAAA,MAAM,KAAA,GAAQ,WAAA,CAAY,KAAA,EAAO,KAAA,EAAO,IAAI,CAAA;AAC5C,EAAA,MAAM,UAAU,WAAA,CAAY,KAAA,EAAO,OAAO,CAAC,KAAA,CAAM,IAAI,CAAC,CAAA;AACtD,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAA,CAAQ,MAAA,KAAW,KAAK,OAAA,CAAQ,QAAA,CAAS,IAAI,CAAA,EAAG;AACpE,IAAA,OAAOC,iBAAA;AAAA,EACT;AACA,EAAA,MAAM,UAAW,OAAA,CAA2B,OAAA,CAAQ,CAAC,MAAA,KAAW,OAAO,OAAO,CAAA;AAC9E,EAAA,IAAI,iBAAA,CAAkB,OAAO,CAAA,EAAG;AAC9B,IAAA,OAAOA,iBAAA;AAAA,EACT;AACA,EAAA,MAAM,aAAa,OAAA,CAAQ,MAAA,CAAO,CAAC,MAAA,KAAW,MAAA,CAAO,SAAS,gBAAgB,CAAA;AAC9E,EAAA,MAAM,IAAA,GACJ,UAAA,CAAW,MAAA,GAAS,CAAA,GAChB,aACA,OAAA,CAAQ,MAAA;AAAA,IACN,CAAC,MAAA,KAAW,MAAA,CAAO,IAAA,KAAS,UAAA,IAAc,CAAC,KAAA,CAAM,GAAA,CAAID,sBAAA,CAAY,MAAA,CAAO,IAAI,CAAC;AAAA,GAC/E;AACN,EAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,IAAA,EAAK,EAAE;AAC7D;AAGA,MAAM,sBAAA,uBAA0D,GAAA,CAAI;AAAA,EAClE,CAAC,SAAS,OAAO,CAAA;AAAA,EACjB,CAAC,UAAU,QAAQ;AACrB,CAAC,CAAA;AAGM,SAAS,YAAA,CAAa,MAAc,QAAA,EAAuC;AAChF,EAAA,MAAM,GAAA,GAAM,sBAAA,CAAuB,GAAA,CAAI,IAAI,CAAA;AAC3C,EAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,MAAA,GAASI,uBAAA,CAAWC,2BAAA,CAAe,GAAG,CAAA,EAAG,SAAS,IAAA,EAAM,EAAE,UAAA,EAAY,IAAA,EAAM,CAAA;AAClF,EAAA,OAAO,EAAE,GAAG,QAAA,EAAU,IAAA,EAAMC,sBAAS,CAAC,MAAM,CAAC,CAAA,EAAE;AACjD;;;;;;"}

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

@@ -0,0 +1,166 @@
+import { irProperty, irObject } from '../../../domain/ir/constructors.mjs';
+import { toPropertyName } from '../../../domain/ir/property-name.mjs';
+import { OPAQUE, propertyKey, MISSING, unionType } from './evaluation.mjs';
+
+function objectParts(types, value, parts) {
+  return parts.flatMap((part) => {
+    const members = types.membersOf({ ...value, type: part });
+    const [only] = members;
+    if (members.length !== 1 || only?.kind !== "type") {
+      return [null];
+    }
+    if (only.type.kind === "intersection") {
+      return objectParts(types, only, only.type.types);
+    }
+    return [only.type.kind === "object" ? only.type : null];
+  });
+}
+function unitOf(type) {
+  switch (type.kind) {
+    case "stringLiteral":
+      return `s:${type.value}`;
+    case "numberLiteral":
+      return `n:${type.value}`;
+    case "booleanLiteral":
+      return `b:${type.value}`;
+    case "keyword":
+      return type.keyword === "null" || type.keyword === "undefined" ? type.keyword : null;
+    default:
+      return null;
+  }
+}
+function unitsOf(types, value, type) {
+  const units = types.membersOf({ ...value, type }).map((member) => {
+    return member.kind === "type" ? unitOf(member.type) : null;
+  });
+  return units.includes(null) ? null : new Set(units);
+}
+function propertiesNamed(objects, key) {
+  return objects.flatMap((object) => {
+    const members = object.members;
+    return members.filter(
+      (member) => member.kind === "property" && propertyKey(member.name) === key
+    );
+  });
+}
+function isNeverProperty(types, value, found) {
+  if (found.length < 2 || found.every((property) => property.isOptional)) {
+    return false;
+  }
+  const sets = found.map((property) => unitsOf(types, value, property.type));
+  if (sets.includes(null)) {
+    return false;
+  }
+  const [first, ...rest] = sets;
+  const shared = [...first].filter((unit) => rest.every((set) => set.has(unit)));
+  return shared.length === 0;
+}
+function isNullishObject(types, value, parts) {
+  const singles = parts.map((part) => {
+    const members = types.membersOf({ ...value, type: part });
+    const [only] = members;
+    return members.length === 1 && only?.kind === "type" ? only.type : null;
+  });
+  const isNullish = (type) => type?.kind === "keyword" && (type.keyword === "null" || type.keyword === "undefined");
+  return singles.some(isNullish) && singles.some((type) => type?.kind === "object");
+}
+function isNeverIntersection(types, value, parts) {
+  if (isNullishObject(types, value, parts)) {
+    return true;
+  }
+  const objects = objectParts(types, value, parts).filter((part) => part !== null);
+  if (objects.length < 2) {
+    return false;
+  }
+  const keys = new Set(
+    objects.flatMap(
+      (object) => object.members.flatMap(
+        (member) => member.kind === "property" ? [propertyKey(member.name)] : []
+      )
+    )
+  );
+  const valueOfKeys = { ...value, deep: false };
+  return [...keys].some(
+    (key) => isNeverProperty(types, valueOfKeys, propertiesNamed(objects, key))
+  );
+}
+function isSignatureOnly(types, value, key) {
+  const members = types.membersOf(value);
+  const [only] = members;
+  if (key === null || members.length !== 1 || only?.kind !== "type" || only.type.kind !== "object") {
+    return false;
+  }
+  const { members: declared } = only.type;
+  const hasSignature = declared.some((member) => member.kind === "indexSignature");
+  return hasSignature && propertiesNamed([only.type], key).length === 0;
+}
+function declaredFirst(types, value, key, parts) {
+  const bySignature = parts.map(({ type }) => isSignatureOnly(types, { ...value, type }, key));
+  const isDeclared = parts.some(({ found }, at) => found.kind === "type" && !bySignature[at]);
+  return parts.filter((_, at) => !(isDeclared && bySignature[at])).map(({ found }) => found);
+}
+function hasKey(value, key) {
+  const { type } = value;
+  if (type.kind === "intersection") {
+    return type.types.some((part) => hasKey({ ...value, type: part }, key));
+  }
+  if (type.kind !== "object") {
+    return false;
+  }
+  return propertiesNamed([type], key).some((property) => value.deep || !property.isOptional);
+}
+function extracted(types, value, key) {
+  const members = types.membersOf(value);
+  if (members.some((member) => member.kind !== "type")) {
+    return OPAQUE;
+  }
+  const kept = members.filter((member) => hasKey(member, key));
+  if (kept.length === 0) {
+    return MISSING;
+  }
+  return { ...value, type: unionType(kept.map((member) => member.type)) };
+}
+function omittedKeys(types, value, keys) {
+  const members = types.membersOf({ ...value, type: keys });
+  const names = members.map(
+    (member) => member.kind === "type" && member.type.kind === "stringLiteral" ? member.type.value : null
+  );
+  return names.includes(null) ? null : new Set(names);
+}
+function hasSharedProperty(members) {
+  const names = members.flatMap(
+    (member) => member.kind === "property" ? [propertyKey(member.name)] : []
+  );
+  return new Set(names).size !== names.length;
+}
+function omitted(types, value, keys) {
+  const names = omittedKeys(types, value, keys);
+  const objects = objectParts(types, value, [value.type]);
+  if (names === null || objects.length === 0 || objects.includes(null)) {
+    return OPAQUE;
+  }
+  const members = objects.flatMap((object) => object.members);
+  if (hasSharedProperty(members)) {
+    return OPAQUE;
+  }
+  const signatures = members.filter((member) => member.kind === "indexSignature");
+  const kept = signatures.length > 0 ? signatures : members.filter(
+    (member) => member.kind !== "property" || !names.has(propertyKey(member.name))
+  );
+  return { ...value, type: { kind: "object", members: kept } };
+}
+const READ_WRITE_MARKER_KEYS = /* @__PURE__ */ new Map([
+  ["$Read", "$read"],
+  ["$Write", "$write"]
+]);
+function markerObject(name, argument) {
+  const key = READ_WRITE_MARKER_KEYS.get(name);
+  if (key === void 0) {
+    return null;
+  }
+  const member = irProperty(toPropertyName(key), argument.type, { isReadonly: true });
+  return { ...argument, type: irObject([member]) };
+}
+
+export { declaredFirst, extracted, isNeverIntersection, markerObject, omitted };
+//# sourceMappingURL=type-rules.mjs.map