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

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

@@ -0,0 +1,107 @@
+'use strict';
+
+const evaluation = require('./evaluation.cjs');
+const typeRules = require('./type-rules.cjs');
+
+function indexType(types, value, index) {
+  const owner = types.expand(value);
+  if (owner.kind !== "type") {
+    return owner;
+  }
+  if (types.membersOf(owner).length > 1) {
+    return unionIndex(types, owner, index);
+  }
+  const { type } = owner;
+  switch (type.kind) {
+    case "object":
+      return memberType(types, owner, type.members, index);
+    case "intersection":
+      return partsIndex(types, owner, type.types, index);
+    case "union":
+      return unionIndex(types, owner, index);
+    case "array":
+      return isNumberIndex(index) ? flattened(types, owner, type.element) : builtInIndex(index);
+    case "keyword":
+      return type.keyword === "never" ? owner : builtInIndex(index);
+    default:
+      return builtInIndex(index);
+  }
+}
+function memberType(types, owner, members, index) {
+  const key = indexKey(index);
+  const property = members.find(
+    (member) => member.kind === "property" && key !== null && evaluation.propertyKey(member.name) === key
+  );
+  if (property !== void 0) {
+    return flattened(types, owner, property.type);
+  }
+  const signature = members.find((member) => member.kind === "indexSignature");
+  if (signature !== void 0) {
+    return flattened(types, owner, signature.type);
+  }
+  return key === null || isObjectBuiltIn(key) ? evaluation.OPAQUE : evaluation.MISSING;
+}
+function partsIndex(types, owner, parts, index) {
+  if (typeRules.isNeverIntersection(types, owner, parts)) {
+    return { ...owner, type: evaluation.NEVER };
+  }
+  const found = parts.map((type) => types.index({ ...owner, type }, index));
+  if (found.some((part) => part.kind === "opaque")) {
+    return evaluation.OPAQUE;
+  }
+  const read = parts.map((type, at) => ({ type, found: found[at] }));
+  const kept = typeRules.declaredFirst(types, owner, indexKey(index), read).flatMap(
+    (part) => part.kind === "type" ? [part.type] : []
+  );
+  return kept.length === 0 ? evaluation.MISSING : { ...owner, type: evaluation.intersectionType(kept) };
+}
+function unionIndex(types, owner, index) {
+  const found = types.membersOf(owner).map((member) => member.kind === "type" ? types.index(member, index) : member);
+  if (found.some((member) => member.kind === "missing")) {
+    return evaluation.MISSING;
+  }
+  if (found.some((member) => member.kind === "opaque")) {
+    return evaluation.OPAQUE;
+  }
+  return { ...owner, type: evaluation.unionType(found.map((member) => member.type)) };
+}
+function flattened(types, owner, type) {
+  const member = { ...owner, type };
+  if (!owner.deep) {
+    return types.expand(member);
+  }
+  const members = types.membersOf(member);
+  if (members.some((candidate) => candidate.kind !== "type")) {
+    return evaluation.OPAQUE;
+  }
+  const present = members.filter((candidate) => !evaluation.isNullish(candidate.type));
+  const elements = present.map((candidate) => arrayElement(candidate.type));
+  if (present.length > 0 && elements.every((element) => element !== null)) {
+    return types.expand({ ...owner, type: evaluation.unionType(elements) });
+  }
+  return { ...owner, type: evaluation.unionType(present.map((candidate) => candidate.type)) };
+}
+function arrayElement(type) {
+  return type.kind === "array" ? type.element : null;
+}
+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 ? evaluation.OPAQUE : evaluation.MISSING;
+}
+
+exports.indexType = indexType;
+//# sourceMappingURL=type-indexing.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"type-indexing.cjs","sources":["../../../../src/application/transform/footer/type-indexing.ts"],"sourcesContent":["import type { IrMember, IrType } from \"../../../domain/ir/nodes.js\";\nimport {\n  type Evaluated,\n  type Evaluation,\n  intersectionType,\n  isNullish,\n  MISSING,\n  NEVER,\n  OPAQUE,\n  propertyKey,\n  unionType,\n} from \"./evaluation.js\";\nimport { declaredFirst, isNeverIntersection, type TypeExpansion } from \"./type-rules.js\";\n\n/**\n * Indexed access (`T[\"key\"]`, `T[number]`) on the generated types, as TypeScript reads it, for\n * the evaluator of the `--enum-values` check (ADR-027).\n */\n\n/** The part of the evaluator that indexed access uses. */\nexport interface IndexedTypes extends TypeExpansion {\n  expand(value: Evaluated): Evaluation;\n  index(value: Evaluated, index: IrType): Evaluation;\n}\n\n/** `value[index]` for a string literal, `string` or `number` index. */\nexport function indexType(types: IndexedTypes, value: Evaluated, index: IrType): Evaluation {\n  const owner = types.expand(value);\n  if (owner.kind !== \"type\") {\n    return owner;\n  }\n  if (types.membersOf(owner).length > 1) {\n    return unionIndex(types, owner, index);\n  }\n  const { type } = owner;\n  switch (type.kind) {\n    case \"object\":\n      return memberType(types, owner, type.members, index);\n    case \"intersection\":\n      return partsIndex(types, owner, type.types, index);\n    case \"union\":\n      return unionIndex(types, owner, index);\n    case \"array\":\n      return isNumberIndex(index) ? flattened(types, 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\nfunction memberType(\n  types: IndexedTypes,\n  owner: Evaluated,\n  members: readonly IrMember[],\n  index: IrType,\n): 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 flattened(types, owner, property.type);\n  }\n  const signature = members.find((member) => member.kind === \"indexSignature\");\n  if (signature !== undefined) {\n    return flattened(types, owner, signature.type);\n  }\n  return key === null || isObjectBuiltIn(key) ? OPAQUE : MISSING;\n}\n\nfunction partsIndex(\n  types: IndexedTypes,\n  owner: Evaluated,\n  parts: readonly IrType[],\n  index: IrType,\n): Evaluation {\n  if (isNeverIntersection(types, owner, parts)) {\n    return { ...owner, type: NEVER };\n  }\n  const found = parts.map((type) => types.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 kept = declaredFirst(types, owner, indexKey(index), read).flatMap((part) =>\n    part.kind === \"type\" ? [part.type] : [],\n  );\n  return kept.length === 0 ? MISSING : { ...owner, type: intersectionType(kept) };\n}\n\nfunction unionIndex(types: IndexedTypes, owner: Evaluated, index: IrType): Evaluation {\n  const found = types\n    .membersOf(owner)\n    .map((member) => (member.kind === \"type\" ? types.index(member, index) : member));\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 */\nfunction flattened(types: IndexedTypes, owner: Evaluated, type: IrType): Evaluation {\n  const member: Evaluated = { ...owner, type };\n  if (!owner.deep) {\n    return types.expand(member);\n  }\n  const members = types.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 types.expand({ ...owner, type: unionType(elements as IrType[]) });\n  }\n  return { ...owner, type: unionType(present.map((candidate) => candidate.type)) };\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 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":["propertyKey","OPAQUE","MISSING","isNeverIntersection","NEVER","declaredFirst","intersectionType","unionType","isNullish"],"mappings":";;;;;AA0BO,SAAS,SAAA,CAAU,KAAA,EAAqB,KAAA,EAAkB,KAAA,EAA2B;AAC1F,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,MAAA,CAAO,KAAK,CAAA;AAChC,EAAA,IAAI,KAAA,CAAM,SAAS,MAAA,EAAQ;AACzB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IAAI,KAAA,CAAM,SAAA,CAAU,KAAK,CAAA,CAAE,SAAS,CAAA,EAAG;AACrC,IAAA,OAAO,UAAA,CAAW,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA;AAAA,EACvC;AACA,EAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,EAAA,QAAQ,KAAK,IAAA;AAAM,IACjB,KAAK,QAAA;AACH,MAAA,OAAO,UAAA,CAAW,KAAA,EAAO,KAAA,EAAO,IAAA,CAAK,SAAS,KAAK,CAAA;AAAA,IACrD,KAAK,cAAA;AACH,MAAA,OAAO,UAAA,CAAW,KAAA,EAAO,KAAA,EAAO,IAAA,CAAK,OAAO,KAAK,CAAA;AAAA,IACnD,KAAK,OAAA;AACH,MAAA,OAAO,UAAA,CAAW,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA;AAAA,IACvC,KAAK,OAAA;AACH,MAAA,OAAO,aAAA,CAAc,KAAK,CAAA,GAAI,SAAA,CAAU,KAAA,EAAO,OAAO,IAAA,CAAK,OAAO,CAAA,GAAI,YAAA,CAAa,KAAK,CAAA;AAAA,IAC1F,KAAK,SAAA;AACH,MAAA,OAAO,IAAA,CAAK,OAAA,KAAY,OAAA,GAAU,KAAA,GAAQ,aAAa,KAAK,CAAA;AAAA,IAC9D;AACE,MAAA,OAAO,aAAa,KAAK,CAAA;AAAA;AAE/B;AAEA,SAAS,UAAA,CACP,KAAA,EACA,KAAA,EACA,OAAA,EACA,KAAA,EACY;AACZ,EAAA,MAAM,GAAA,GAAM,SAAS,KAAK,CAAA;AAC1B,EAAA,MAAM,WAAW,OAAA,CAAQ,IAAA;AAAA,IACvB,CAAC,MAAA,KAAW,MAAA,CAAO,IAAA,KAAS,UAAA,IAAc,QAAQ,IAAA,IAAQA,sBAAA,CAAY,MAAA,CAAO,IAAI,CAAA,KAAM;AAAA,GACzF;AACA,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,OAAO,SAAA,CAAU,KAAA,EAAO,KAAA,EAAO,QAAA,CAAS,IAAI,CAAA;AAAA,EAC9C;AACA,EAAA,MAAM,YAAY,OAAA,CAAQ,IAAA,CAAK,CAAC,MAAA,KAAW,MAAA,CAAO,SAAS,gBAAgB,CAAA;AAC3E,EAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,IAAA,OAAO,SAAA,CAAU,KAAA,EAAO,KAAA,EAAO,SAAA,CAAU,IAAI,CAAA;AAAA,EAC/C;AACA,EAAA,OAAO,GAAA,KAAQ,IAAA,IAAQ,eAAA,CAAgB,GAAG,IAAIC,iBAAA,GAASC,kBAAA;AACzD;AAEA,SAAS,UAAA,CACP,KAAA,EACA,KAAA,EACA,KAAA,EACA,KAAA,EACY;AACZ,EAAA,IAAIC,6BAAA,CAAoB,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA,EAAG;AAC5C,IAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAMC,gBAAA,EAAM;AAAA,EACjC;AACA,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,KAAA,CAAM,KAAA,CAAM,EAAE,GAAG,KAAA,EAAO,IAAA,EAAK,EAAG,KAAK,CAAC,CAAA;AACxE,EAAA,IAAI,MAAM,IAAA,CAAK,CAAC,SAAS,IAAA,CAAK,IAAA,KAAS,QAAQ,CAAA,EAAG;AAChD,IAAA,OAAOH,iBAAA;AAAA,EACT;AACA,EAAA,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,EAAA,MAAM,IAAA,GAAOI,wBAAc,KAAA,EAAO,KAAA,EAAO,SAAS,KAAK,CAAA,EAAG,IAAI,CAAA,CAAE,OAAA;AAAA,IAAQ,CAAC,SACvE,IAAA,CAAK,IAAA,KAAS,SAAS,CAAC,IAAA,CAAK,IAAI,CAAA,GAAI;AAAC,GACxC;AACA,EAAA,OAAO,IAAA,CAAK,MAAA,KAAW,CAAA,GAAIH,kBAAA,GAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAMI,2BAAA,CAAiB,IAAI,CAAA,EAAE;AAChF;AAEA,SAAS,UAAA,CAAW,KAAA,EAAqB,KAAA,EAAkB,KAAA,EAA2B;AACpF,EAAA,MAAM,QAAQ,KAAA,CACX,SAAA,CAAU,KAAK,CAAA,CACf,IAAI,CAAC,MAAA,KAAY,MAAA,CAAO,IAAA,KAAS,SAAS,KAAA,CAAM,KAAA,CAAM,MAAA,EAAQ,KAAK,IAAI,MAAO,CAAA;AACjF,EAAA,IAAI,MAAM,IAAA,CAAK,CAAC,WAAW,MAAA,CAAO,IAAA,KAAS,SAAS,CAAA,EAAG;AACrD,IAAA,OAAOJ,kBAAA;AAAA,EACT;AACA,EAAA,IAAI,MAAM,IAAA,CAAK,CAAC,WAAW,MAAA,CAAO,IAAA,KAAS,QAAQ,CAAA,EAAG;AACpD,IAAA,OAAOD,iBAAA;AAAA,EACT;AACA,EAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAMM,oBAAA,CAAW,KAAA,CAAsB,GAAA,CAAI,CAAC,MAAA,KAAW,MAAA,CAAO,IAAI,CAAC,CAAA,EAAE;AAC1F;AAMA,SAAS,SAAA,CAAU,KAAA,EAAqB,KAAA,EAAkB,IAAA,EAA0B;AAClF,EAAA,MAAM,MAAA,GAAoB,EAAE,GAAG,KAAA,EAAO,IAAA,EAAK;AAC3C,EAAA,IAAI,CAAC,MAAM,IAAA,EAAM;AACf,IAAA,OAAO,KAAA,CAAM,OAAO,MAAM,CAAA;AAAA,EAC5B;AACA,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,SAAA,CAAU,MAAM,CAAA;AACtC,EAAA,IAAI,QAAQ,IAAA,CAAK,CAAC,cAAc,SAAA,CAAU,IAAA,KAAS,MAAM,CAAA,EAAG;AAC1D,IAAA,OAAON,iBAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAA,GAAW,QAAwB,MAAA,CAAO,CAAC,cAAc,CAACO,oBAAA,CAAU,SAAA,CAAU,IAAI,CAAC,CAAA;AACzF,EAAA,MAAM,QAAA,GAAW,QAAQ,GAAA,CAAI,CAAC,cAAc,YAAA,CAAa,SAAA,CAAU,IAAI,CAAC,CAAA;AACxE,EAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,IAAK,QAAA,CAAS,MAAM,CAAC,OAAA,KAAY,OAAA,KAAY,IAAI,CAAA,EAAG;AACvE,IAAA,OAAO,KAAA,CAAM,OAAO,EAAE,GAAG,OAAO,IAAA,EAAMD,oBAAA,CAAU,QAAoB,CAAA,EAAG,CAAA;AAAA,EACzE;AACA,EAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAMA,oBAAA,CAAU,OAAA,CAAQ,GAAA,CAAI,CAAC,SAAA,KAAc,SAAA,CAAU,IAAI,CAAC,CAAA,EAAE;AACjF;AAGA,SAAS,aAAa,IAAA,EAA6B;AACjD,EAAA,OAAO,IAAA,CAAK,IAAA,KAAS,OAAA,GAAU,IAAA,CAAK,OAAA,GAAU,IAAA;AAChD;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,GAAYN,iBAAA,GAASC,kBAAA;AACzD;;"}

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

@@ -0,0 +1,105 @@
+import { MISSING, OPAQUE, unionType, isNullish, NEVER, intersectionType, propertyKey } from './evaluation.mjs';
+import { isNeverIntersection, declaredFirst } from './type-rules.mjs';
+
+function indexType(types, value, index) {
+  const owner = types.expand(value);
+  if (owner.kind !== "type") {
+    return owner;
+  }
+  if (types.membersOf(owner).length > 1) {
+    return unionIndex(types, owner, index);
+  }
+  const { type } = owner;
+  switch (type.kind) {
+    case "object":
+      return memberType(types, owner, type.members, index);
+    case "intersection":
+      return partsIndex(types, owner, type.types, index);
+    case "union":
+      return unionIndex(types, owner, index);
+    case "array":
+      return isNumberIndex(index) ? flattened(types, owner, type.element) : builtInIndex(index);
+    case "keyword":
+      return type.keyword === "never" ? owner : builtInIndex(index);
+    default:
+      return builtInIndex(index);
+  }
+}
+function memberType(types, 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 flattened(types, owner, property.type);
+  }
+  const signature = members.find((member) => member.kind === "indexSignature");
+  if (signature !== void 0) {
+    return flattened(types, owner, signature.type);
+  }
+  return key === null || isObjectBuiltIn(key) ? OPAQUE : MISSING;
+}
+function partsIndex(types, owner, parts, index) {
+  if (isNeverIntersection(types, owner, parts)) {
+    return { ...owner, type: NEVER };
+  }
+  const found = parts.map((type) => types.index({ ...owner, type }, index));
+  if (found.some((part) => part.kind === "opaque")) {
+    return OPAQUE;
+  }
+  const read = parts.map((type, at) => ({ type, found: found[at] }));
+  const kept = declaredFirst(types, owner, indexKey(index), read).flatMap(
+    (part) => part.kind === "type" ? [part.type] : []
+  );
+  return kept.length === 0 ? MISSING : { ...owner, type: intersectionType(kept) };
+}
+function unionIndex(types, owner, index) {
+  const found = types.membersOf(owner).map((member) => member.kind === "type" ? types.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)) };
+}
+function flattened(types, owner, type) {
+  const member = { ...owner, type };
+  if (!owner.deep) {
+    return types.expand(member);
+  }
+  const members = types.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 types.expand({ ...owner, type: unionType(elements) });
+  }
+  return { ...owner, type: unionType(present.map((candidate) => candidate.type)) };
+}
+function arrayElement(type) {
+  return type.kind === "array" ? type.element : null;
+}
+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 { indexType };
+//# sourceMappingURL=type-indexing.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"type-indexing.mjs","sources":["../../../../src/application/transform/footer/type-indexing.ts"],"sourcesContent":["import type { IrMember, IrType } from \"../../../domain/ir/nodes.js\";\nimport {\n  type Evaluated,\n  type Evaluation,\n  intersectionType,\n  isNullish,\n  MISSING,\n  NEVER,\n  OPAQUE,\n  propertyKey,\n  unionType,\n} from \"./evaluation.js\";\nimport { declaredFirst, isNeverIntersection, type TypeExpansion } from \"./type-rules.js\";\n\n/**\n * Indexed access (`T[\"key\"]`, `T[number]`) on the generated types, as TypeScript reads it, for\n * the evaluator of the `--enum-values` check (ADR-027).\n */\n\n/** The part of the evaluator that indexed access uses. */\nexport interface IndexedTypes extends TypeExpansion {\n  expand(value: Evaluated): Evaluation;\n  index(value: Evaluated, index: IrType): Evaluation;\n}\n\n/** `value[index]` for a string literal, `string` or `number` index. */\nexport function indexType(types: IndexedTypes, value: Evaluated, index: IrType): Evaluation {\n  const owner = types.expand(value);\n  if (owner.kind !== \"type\") {\n    return owner;\n  }\n  if (types.membersOf(owner).length > 1) {\n    return unionIndex(types, owner, index);\n  }\n  const { type } = owner;\n  switch (type.kind) {\n    case \"object\":\n      return memberType(types, owner, type.members, index);\n    case \"intersection\":\n      return partsIndex(types, owner, type.types, index);\n    case \"union\":\n      return unionIndex(types, owner, index);\n    case \"array\":\n      return isNumberIndex(index) ? flattened(types, 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\nfunction memberType(\n  types: IndexedTypes,\n  owner: Evaluated,\n  members: readonly IrMember[],\n  index: IrType,\n): 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 flattened(types, owner, property.type);\n  }\n  const signature = members.find((member) => member.kind === \"indexSignature\");\n  if (signature !== undefined) {\n    return flattened(types, owner, signature.type);\n  }\n  return key === null || isObjectBuiltIn(key) ? OPAQUE : MISSING;\n}\n\nfunction partsIndex(\n  types: IndexedTypes,\n  owner: Evaluated,\n  parts: readonly IrType[],\n  index: IrType,\n): Evaluation {\n  if (isNeverIntersection(types, owner, parts)) {\n    return { ...owner, type: NEVER };\n  }\n  const found = parts.map((type) => types.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 kept = declaredFirst(types, owner, indexKey(index), read).flatMap((part) =>\n    part.kind === \"type\" ? [part.type] : [],\n  );\n  return kept.length === 0 ? MISSING : { ...owner, type: intersectionType(kept) };\n}\n\nfunction unionIndex(types: IndexedTypes, owner: Evaluated, index: IrType): Evaluation {\n  const found = types\n    .membersOf(owner)\n    .map((member) => (member.kind === \"type\" ? types.index(member, index) : member));\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 */\nfunction flattened(types: IndexedTypes, owner: Evaluated, type: IrType): Evaluation {\n  const member: Evaluated = { ...owner, type };\n  if (!owner.deep) {\n    return types.expand(member);\n  }\n  const members = types.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 types.expand({ ...owner, type: unionType(elements as IrType[]) });\n  }\n  return { ...owner, type: unionType(present.map((candidate) => candidate.type)) };\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 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":";;;AA0BO,SAAS,SAAA,CAAU,KAAA,EAAqB,KAAA,EAAkB,KAAA,EAA2B;AAC1F,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,MAAA,CAAO,KAAK,CAAA;AAChC,EAAA,IAAI,KAAA,CAAM,SAAS,MAAA,EAAQ;AACzB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IAAI,KAAA,CAAM,SAAA,CAAU,KAAK,CAAA,CAAE,SAAS,CAAA,EAAG;AACrC,IAAA,OAAO,UAAA,CAAW,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA;AAAA,EACvC;AACA,EAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,EAAA,QAAQ,KAAK,IAAA;AAAM,IACjB,KAAK,QAAA;AACH,MAAA,OAAO,UAAA,CAAW,KAAA,EAAO,KAAA,EAAO,IAAA,CAAK,SAAS,KAAK,CAAA;AAAA,IACrD,KAAK,cAAA;AACH,MAAA,OAAO,UAAA,CAAW,KAAA,EAAO,KAAA,EAAO,IAAA,CAAK,OAAO,KAAK,CAAA;AAAA,IACnD,KAAK,OAAA;AACH,MAAA,OAAO,UAAA,CAAW,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA;AAAA,IACvC,KAAK,OAAA;AACH,MAAA,OAAO,aAAA,CAAc,KAAK,CAAA,GAAI,SAAA,CAAU,KAAA,EAAO,OAAO,IAAA,CAAK,OAAO,CAAA,GAAI,YAAA,CAAa,KAAK,CAAA;AAAA,IAC1F,KAAK,SAAA;AACH,MAAA,OAAO,IAAA,CAAK,OAAA,KAAY,OAAA,GAAU,KAAA,GAAQ,aAAa,KAAK,CAAA;AAAA,IAC9D;AACE,MAAA,OAAO,aAAa,KAAK,CAAA;AAAA;AAE/B;AAEA,SAAS,UAAA,CACP,KAAA,EACA,KAAA,EACA,OAAA,EACA,KAAA,EACY;AACZ,EAAA,MAAM,GAAA,GAAM,SAAS,KAAK,CAAA;AAC1B,EAAA,MAAM,WAAW,OAAA,CAAQ,IAAA;AAAA,IACvB,CAAC,MAAA,KAAW,MAAA,CAAO,IAAA,KAAS,UAAA,IAAc,QAAQ,IAAA,IAAQ,WAAA,CAAY,MAAA,CAAO,IAAI,CAAA,KAAM;AAAA,GACzF;AACA,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,OAAO,SAAA,CAAU,KAAA,EAAO,KAAA,EAAO,QAAA,CAAS,IAAI,CAAA;AAAA,EAC9C;AACA,EAAA,MAAM,YAAY,OAAA,CAAQ,IAAA,CAAK,CAAC,MAAA,KAAW,MAAA,CAAO,SAAS,gBAAgB,CAAA;AAC3E,EAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,IAAA,OAAO,SAAA,CAAU,KAAA,EAAO,KAAA,EAAO,SAAA,CAAU,IAAI,CAAA;AAAA,EAC/C;AACA,EAAA,OAAO,GAAA,KAAQ,IAAA,IAAQ,eAAA,CAAgB,GAAG,IAAI,MAAA,GAAS,OAAA;AACzD;AAEA,SAAS,UAAA,CACP,KAAA,EACA,KAAA,EACA,KAAA,EACA,KAAA,EACY;AACZ,EAAA,IAAI,mBAAA,CAAoB,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA,EAAG;AAC5C,IAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,KAAA,EAAM;AAAA,EACjC;AACA,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,KAAA,CAAM,KAAA,CAAM,EAAE,GAAG,KAAA,EAAO,IAAA,EAAK,EAAG,KAAK,CAAC,CAAA;AACxE,EAAA,IAAI,MAAM,IAAA,CAAK,CAAC,SAAS,IAAA,CAAK,IAAA,KAAS,QAAQ,CAAA,EAAG;AAChD,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,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,EAAA,MAAM,IAAA,GAAO,cAAc,KAAA,EAAO,KAAA,EAAO,SAAS,KAAK,CAAA,EAAG,IAAI,CAAA,CAAE,OAAA;AAAA,IAAQ,CAAC,SACvE,IAAA,CAAK,IAAA,KAAS,SAAS,CAAC,IAAA,CAAK,IAAI,CAAA,GAAI;AAAC,GACxC;AACA,EAAA,OAAO,IAAA,CAAK,MAAA,KAAW,CAAA,GAAI,OAAA,GAAU,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,gBAAA,CAAiB,IAAI,CAAA,EAAE;AAChF;AAEA,SAAS,UAAA,CAAW,KAAA,EAAqB,KAAA,EAAkB,KAAA,EAA2B;AACpF,EAAA,MAAM,QAAQ,KAAA,CACX,SAAA,CAAU,KAAK,CAAA,CACf,IAAI,CAAC,MAAA,KAAY,MAAA,CAAO,IAAA,KAAS,SAAS,KAAA,CAAM,KAAA,CAAM,MAAA,EAAQ,KAAK,IAAI,MAAO,CAAA;AACjF,EAAA,IAAI,MAAM,IAAA,CAAK,CAAC,WAAW,MAAA,CAAO,IAAA,KAAS,SAAS,CAAA,EAAG;AACrD,IAAA,OAAO,OAAA;AAAA,EACT;AACA,EAAA,IAAI,MAAM,IAAA,CAAK,CAAC,WAAW,MAAA,CAAO,IAAA,KAAS,QAAQ,CAAA,EAAG;AACpD,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,SAAA,CAAW,KAAA,CAAsB,GAAA,CAAI,CAAC,MAAA,KAAW,MAAA,CAAO,IAAI,CAAC,CAAA,EAAE;AAC1F;AAMA,SAAS,SAAA,CAAU,KAAA,EAAqB,KAAA,EAAkB,IAAA,EAA0B;AAClF,EAAA,MAAM,MAAA,GAAoB,EAAE,GAAG,KAAA,EAAO,IAAA,EAAK;AAC3C,EAAA,IAAI,CAAC,MAAM,IAAA,EAAM;AACf,IAAA,OAAO,KAAA,CAAM,OAAO,MAAM,CAAA;AAAA,EAC5B;AACA,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,SAAA,CAAU,MAAM,CAAA;AACtC,EAAA,IAAI,QAAQ,IAAA,CAAK,CAAC,cAAc,SAAA,CAAU,IAAA,KAAS,MAAM,CAAA,EAAG;AAC1D,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAA,GAAW,QAAwB,MAAA,CAAO,CAAC,cAAc,CAAC,SAAA,CAAU,SAAA,CAAU,IAAI,CAAC,CAAA;AACzF,EAAA,MAAM,QAAA,GAAW,QAAQ,GAAA,CAAI,CAAC,cAAc,YAAA,CAAa,SAAA,CAAU,IAAI,CAAC,CAAA;AACxE,EAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,IAAK,QAAA,CAAS,MAAM,CAAC,OAAA,KAAY,OAAA,KAAY,IAAI,CAAA,EAAG;AACvE,IAAA,OAAO,KAAA,CAAM,OAAO,EAAE,GAAG,OAAO,IAAA,EAAM,SAAA,CAAU,QAAoB,CAAA,EAAG,CAAA;AAAA,EACzE;AACA,EAAA,OAAO,EAAE,GAAG,KAAA,EAAO,IAAA,EAAM,SAAA,CAAU,OAAA,CAAQ,GAAA,CAAI,CAAC,SAAA,KAAc,SAAA,CAAU,IAAI,CAAC,CAAA,EAAE;AACjF;AAGA,SAAS,aAAa,IAAA,EAA6B;AACjD,EAAA,OAAO,IAAA,CAAK,IAAA,KAAS,OAAA,GAAU,IAAA,CAAK,OAAA,GAAU,IAAA;AAChD;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