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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

package/dist/application/transform/footer/document-footer.cjs

@@ -3,6 +3,7 @@
 const constructors = require('../../../domain/ir/constructors.cjs');
 const helperTypes = require('../helper-types.cjs');
 const enumNaming = require('./enum-naming.cjs');
+const sharedEnumNames = require('./shared-enum-names.cjs');
 
 function dedupeKey(request) {
   return [...request.values].sort(compareAsStrings).map((value, index) => metadataKey(String(value), request.metadata[index])).join(",");
@@ -18,6 +19,7 @@ function compareAsStrings(left, right) {
 function metadataKey(value, metadata) {
   return `${metadata?.name ?? value}:${metadata?.description || ""}`;
 }
+const ENUM_VALUES_NUMBER_SEPARATOR = "_";
 function declarationKey(name, request) {
   return JSON.stringify([name, request.values, request.metadata]);
 }
@@ -26,15 +28,26 @@ class RunFooter {
   enumNamesByKey = /* @__PURE__ */ new Map();
   /** Declarations added already: the same one twice fails with "Duplicate identifier". */
   declaredEnums = /* @__PURE__ */ new Set();
+  /** The member names of each declared enum, by value. */
+  membersByEnum = /* @__PURE__ */ new Map();
+  /** The members of each declared enum name, by member name. */
+  declaredMembers = /* @__PURE__ */ new Map();
+  /** `--enum-values` arrays added already: their declared name by name, type and values. */
+  declaredEnumValues = /* @__PURE__ */ new Map();
+  /** The declared `--enum-values` array names. */
+  enumValuesNames = /* @__PURE__ */ new Set();
   sink;
   isDedupingEnums;
-  constructor(sink, isDedupingEnums) {
+  sharedNames;
+  constructor(sink, isDedupingEnums, sharedNames = sharedEnumNames.FIRST_SCHEMA_NAMES) {
     this.sink = sink;
     this.isDedupingEnums = isDedupingEnums;
+    this.sharedNames = sharedNames;
   }
   addEnum(request) {
-    const name = this.naming.enumName(request.name);
+    const ownName = this.naming.enumName(request.name);
     const key = this.isDedupingEnums ? dedupeKey(request) : null;
+    const name = key === null ? ownName : this.sharedNames.nameOf(key, ownName, request);
     const known = key === null ? void 0 : this.enumNamesByKey.get(key);
     if (known !== void 0) {
       return known;
@@ -46,14 +59,50 @@ class RunFooter {
     if (declared !== null) {
       this.declaredEnums.add(declared);
     }
-    this.sink.add(enumNaming.enumDeclaration(name, request, this.naming));
+    const declaration = this.withoutRepeats(enumNaming.enumDeclaration(name, request, this.naming));
+    if (declaration !== null) {
+      this.record(declaration);
+      this.sink.add(declaration);
+    }
     if (key !== null) {
       this.enumNamesByKey.set(key, name);
     }
     return name;
   }
+  /** The declaration without members an earlier one of the name has; null when none is left. */
+  withoutRepeats(declaration) {
+    const earlier = this.declaredMembers.get(declaration.name);
+    if (earlier === void 0) {
+      return declaration;
+    }
+    const merged = enumNaming.withoutDeclaredMembers(declaration, earlier);
+    return merged.members.length === 0 && declaration.members.length > 0 ? null : merged;
+  }
+  /** The members of a declaration; the first member of a value names it. */
+  record(declaration) {
+    const byName = this.declaredMembers.get(declaration.name) ?? /* @__PURE__ */ new Map();
+    const byValue = this.membersByEnum.get(declaration.name) ?? /* @__PURE__ */ new Map();
+    for (const member of declaration.members) {
+      byName.set(member.name, member.value);
+      if (!byValue.has(member.value)) {
+        byValue.set(member.value, member.name);
+      }
+    }
+    this.declaredMembers.set(declaration.name, byName);
+    this.membersByEnum.set(declaration.name, byValue);
+  }
+  enumMembers(name) {
+    return this.membersByEnum.get(name) ?? /* @__PURE__ */ new Map();
+  }
   addEnumValues(request) {
-    const name = this.naming.arrayName(request.name);
+    const baseName = this.naming.arrayName(request.name);
+    const declared = JSON.stringify([baseName, request.type, request.values]);
+    if (this.declaredEnumValues.has(declared)) {
+      return;
+    }
+    const name = this.freeEnumValuesName(baseName);
+    this.declaredEnumValues.set(declared, name);
+    this.enumValuesNames.add(name);
     this.require(helperTypes.HELPER_TYPES.flattenedDeepRequired);
     this.require(helperTypes.HELPER_TYPES.readonlyArray);
     this.sink.add({
@@ -65,6 +114,19 @@ class RunFooter {
       comments: []
     });
   }
+  /**
+   * Another array may have the name: `Discount/type` and `discount/type`, or a property and an
+   * inline `allOf` item of one schema, typed at one location. A redeclared `const` does not
+   * compile, so a later one gets the next number (`discountTypeValues_2`). Every unnumbered name
+   * ends with `Values`, so a number never takes a name that a later array needs.
+   */
+  freeEnumValuesName(name) {
+    let candidate = name;
+    for (let count = 2; this.enumValuesNames.has(candidate); count++) {
+      candidate = `${name}${ENUM_VALUES_NUMBER_SEPARATOR}${count}`;
+    }
+    return candidate;
+  }
   requireWithRequired() {
     this.require(helperTypes.HELPER_TYPES.withRequired);
   }

package/dist/application/transform/footer/document-footer.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"document-footer.cjs","sources":["../../../../src/application/transform/footer/document-footer.ts"],"sourcesContent":["import { irReference } from \"../../../domain/ir/constructors.js\";\nimport type { IrDeclaration, IrPropertySignature, IrType } from \"../../../domain/ir/nodes.js\";\nimport { HELPER_TYPES, type HelperType } from \"../helper-types.js\";\nimport type {\n  EnumDeclarationRequest,\n  EnumMemberMetadata,\n  EnumValuesRequest,\n} from \"../schema/schema-context.js\";\nimport type { DocumentFooter } from \"../transform-context.js\";\nimport { EnumNaming, enumDeclaration } from \"./enum-naming.js\";\n\n/** Where footer declarations go, in order: the run's `ctx.injectFooter`, open to user code. */\nexport interface FooterSink {\n  /** Whether a type alias with this name is declared already (by the generator or a user). */\n  hasTypeAlias(name: string): boolean;\n  add(declaration: IrDeclaration): void;\n  /** Add a member to the `operations` interface, declared first if needed; see `DocumentFooter`. */\n  addOperation(build: () => IrPropertySignature): void;\n}\n\n/**\n * The `--dedupe-enums` key of the original: the values in default sort order, each paired with\n * the metadata at its sorted position (not the value's own metadata), as the original does.\n */\nfunction dedupeKey(request: EnumDeclarationRequest): string {\n  return [...request.values]\n    .sort(compareAsStrings)\n    .map((value, index) => metadataKey(String(value), request.metadata[index]))\n    .join(\",\");\n}\n\n/** `Array.prototype.sort` without a comparator: compares the values as strings. */\nfunction compareAsStrings(left: string | number, right: string | number): number {\n  const leftText = String(left);\n  const rightText = String(right);\n  if (leftText === rightText) {\n    return 0;\n  }\n  return leftText < rightText ? -1 : 1;\n}\n\nfunction metadataKey(value: string, metadata: EnumMemberMetadata | undefined): string {\n  return `${metadata?.name ?? value}:${metadata?.description || \"\"}`;\n}\n\n/** The whole declaration: an equal key means the same enum, member for member. */\nfunction declarationKey(name: string, request: EnumDeclarationRequest): string {\n  return JSON.stringify([name, request.values, request.metadata]);\n}\n\n/**\n * The footer of one run: enums (deduplicated with `--dedupe-enums`), `--enum-values` arrays, the\n * helper types they need, and the `operations` interface. Replaces the original's module-level\n * `enumCache`, so runs no longer share enums (research/legacy-bugs.md, item 3).\n */\nexport class RunFooter implements DocumentFooter {\n  private readonly naming = new EnumNaming();\n  private readonly enumNamesByKey = new Map<string, string>();\n  /** Declarations added already: the same one twice fails with \"Duplicate identifier\". */\n  private readonly declaredEnums = new Set<string>();\n  private readonly sink: FooterSink;\n  private readonly isDedupingEnums: boolean;\n\n  constructor(sink: FooterSink, isDedupingEnums: boolean) {\n    this.sink = sink;\n    this.isDedupingEnums = isDedupingEnums;\n  }\n\n  addEnum(request: EnumDeclarationRequest): string {\n    // The name is built before the cache lookup: it advances the naming state either way.\n    const name = this.naming.enumName(request.name);\n    const key = this.isDedupingEnums ? dedupeKey(request) : null;\n    const known = key === null ? undefined : this.enumNamesByKey.get(key);\n    if (known !== undefined) {\n      return known;\n    }\n    // Only a repeated member fails to compile; two empty declarations merge, so they stay.\n    const declared = request.values.length > 0 ? declarationKey(name, request) : null;\n    if (declared !== null && this.declaredEnums.has(declared)) {\n      return name;\n    }\n    if (declared !== null) {\n      this.declaredEnums.add(declared);\n    }\n    this.sink.add(enumDeclaration(name, request, this.naming));\n    if (key !== null) {\n      this.enumNamesByKey.set(key, name);\n    }\n    return name;\n  }\n\n  addEnumValues(request: EnumValuesRequest): void {\n    const name = this.naming.arrayName(request.name);\n    this.require(HELPER_TYPES.flattenedDeepRequired);\n    this.require(HELPER_TYPES.readonlyArray);\n    this.sink.add({\n      kind: \"constArray\",\n      name,\n      isExported: true,\n      type: readonlyArrayOf(request.type),\n      values: request.values,\n      comments: [],\n    });\n  }\n\n  requireWithRequired(): void {\n    this.require(HELPER_TYPES.withRequired);\n  }\n\n  requirePropertyValues(): void {\n    this.require(HELPER_TYPES.propertyValues);\n  }\n\n  addOperation(build: () => IrPropertySignature): void {\n    this.sink.addOperation(build);\n  }\n\n  private require(helper: HelperType): void {\n    if (!this.sink.hasTypeAlias(helper.name)) {\n      this.sink.add({ kind: \"rawDeclaration\", name: helper.name, text: helper.text });\n    }\n  }\n}\n\nfunction readonlyArrayOf(type: IrType): IrType {\n  return irReference(HELPER_TYPES.readonlyArray.name, [type]);\n}\n"],"names":["EnumNaming","enumDeclaration","HELPER_TYPES","irReference"],"mappings":";;;;;;AAwBA,SAAS,UAAU,OAAA,EAAyC;AAC1D,EAAA,OAAO,CAAC,GAAG,OAAA,CAAQ,MAAM,EACtB,IAAA,CAAK,gBAAgB,CAAA,CACrB,GAAA,CAAI,CAAC,KAAA,EAAO,UAAU,WAAA,CAAY,MAAA,CAAO,KAAK,CAAA,EAAG,OAAA,CAAQ,QAAA,CAAS,KAAK,CAAC,CAAC,CAAA,CACzE,IAAA,CAAK,GAAG,CAAA;AACb;AAGA,SAAS,gBAAA,CAAiB,MAAuB,KAAA,EAAgC;AAC/E,EAAA,MAAM,QAAA,GAAW,OAAO,IAAI,CAAA;AAC5B,EAAA,MAAM,SAAA,GAAY,OAAO,KAAK,CAAA;AAC9B,EAAA,IAAI,aAAa,SAAA,EAAW;AAC1B,IAAA,OAAO,CAAA;AAAA,EACT;AACA,EAAA,OAAO,QAAA,GAAW,YAAY,EAAA,GAAK,CAAA;AACrC;AAEA,SAAS,WAAA,CAAY,OAAe,QAAA,EAAkD;AACpF,EAAA,OAAO,GAAG,QAAA,EAAU,IAAA,IAAQ,KAAK,CAAA,CAAA,EAAI,QAAA,EAAU,eAAe,EAAE,CAAA,CAAA;AAClE;AAGA,SAAS,cAAA,CAAe,MAAc,OAAA,EAAyC;AAC7E,EAAA,OAAO,IAAA,CAAK,UAAU,CAAC,IAAA,EAAM,QAAQ,MAAA,EAAQ,OAAA,CAAQ,QAAQ,CAAC,CAAA;AAChE;AAOO,MAAM,SAAA,CAAoC;AAAA,EAC9B,MAAA,GAAS,IAAIA,qBAAA,EAAW;AAAA,EACxB,cAAA,uBAAqB,GAAA,EAAoB;AAAA;AAAA,EAEzC,aAAA,uBAAoB,GAAA,EAAY;AAAA,EAChC,IAAA;AAAA,EACA,eAAA;AAAA,EAEjB,WAAA,CAAY,MAAkB,eAAA,EAA0B;AACtD,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,eAAA,GAAkB,eAAA;AAAA,EACzB;AAAA,EAEA,QAAQ,OAAA,EAAyC;AAE/C,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,MAAA,CAAO,QAAA,CAAS,QAAQ,IAAI,CAAA;AAC9C,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,eAAA,GAAkB,SAAA,CAAU,OAAO,CAAA,GAAI,IAAA;AACxD,IAAA,MAAM,QAAQ,GAAA,KAAQ,IAAA,GAAO,SAAY,IAAA,CAAK,cAAA,CAAe,IAAI,GAAG,CAAA;AACpE,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,MAAM,QAAA,GAAW,QAAQ,MAAA,CAAO,MAAA,GAAS,IAAI,cAAA,CAAe,IAAA,EAAM,OAAO,CAAA,GAAI,IAAA;AAC7E,IAAA,IAAI,aAAa,IAAA,IAAQ,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,QAAQ,CAAA,EAAG;AACzD,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,aAAa,IAAA,EAAM;AACrB,MAAA,IAAA,CAAK,aAAA,CAAc,IAAI,QAAQ,CAAA;AAAA,IACjC;AACA,IAAA,IAAA,CAAK,KAAK,GAAA,CAAIC,0BAAA,CAAgB,MAAM,OAAA,EAAS,IAAA,CAAK,MAAM,CAAC,CAAA;AACzD,IAAA,IAAI,QAAQ,IAAA,EAAM;AAChB,MAAA,IAAA,CAAK,cAAA,CAAe,GAAA,CAAI,GAAA,EAAK,IAAI,CAAA;AAAA,IACnC;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,cAAc,OAAA,EAAkC;AAC9C,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,MAAA,CAAO,SAAA,CAAU,QAAQ,IAAI,CAAA;AAC/C,IAAA,IAAA,CAAK,OAAA,CAAQC,yBAAa,qBAAqB,CAAA;AAC/C,IAAA,IAAA,CAAK,OAAA,CAAQA,yBAAa,aAAa,CAAA;AACvC,IAAA,IAAA,CAAK,KAAK,GAAA,CAAI;AAAA,MACZ,IAAA,EAAM,YAAA;AAAA,MACN,IAAA;AAAA,MACA,UAAA,EAAY,IAAA;AAAA,MACZ,IAAA,EAAM,eAAA,CAAgB,OAAA,CAAQ,IAAI,CAAA;AAAA,MAClC,QAAQ,OAAA,CAAQ,MAAA;AAAA,MAChB,UAAU;AAAC,KACZ,CAAA;AAAA,EACH;AAAA,EAEA,mBAAA,GAA4B;AAC1B,IAAA,IAAA,CAAK,OAAA,CAAQA,yBAAa,YAAY,CAAA;AAAA,EACxC;AAAA,EAEA,qBAAA,GAA8B;AAC5B,IAAA,IAAA,CAAK,OAAA,CAAQA,yBAAa,cAAc,CAAA;AAAA,EAC1C;AAAA,EAEA,aAAa,KAAA,EAAwC;AACnD,IAAA,IAAA,CAAK,IAAA,CAAK,aAAa,KAAK,CAAA;AAAA,EAC9B;AAAA,EAEQ,QAAQ,MAAA,EAA0B;AACxC,IAAA,IAAI,CAAC,IAAA,CAAK,IAAA,CAAK,YAAA,CAAa,MAAA,CAAO,IAAI,CAAA,EAAG;AACxC,MAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,EAAE,IAAA,EAAM,gBAAA,EAAkB,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,CAAA;AAAA,IAChF;AAAA,EACF;AACF;AAEA,SAAS,gBAAgB,IAAA,EAAsB;AAC7C,EAAA,OAAOC,yBAAYD,wBAAA,CAAa,aAAA,CAAc,IAAA,EAAM,CAAC,IAAI,CAAC,CAAA;AAC5D;;"}
+{"version":3,"file":"document-footer.cjs","sources":["../../../../src/application/transform/footer/document-footer.ts"],"sourcesContent":["import { irReference } from \"../../../domain/ir/constructors.js\";\nimport type {\n  IrDeclaration,\n  IrEnumDeclaration,\n  IrPropertySignature,\n  IrType,\n} from \"../../../domain/ir/nodes.js\";\nimport { HELPER_TYPES, type HelperType } from \"../helper-types.js\";\nimport type {\n  EnumDeclarationRequest,\n  EnumMemberMetadata,\n  EnumValuesRequest,\n} from \"../schema/schema-context.js\";\nimport type { DocumentFooter } from \"../transform-context.js\";\nimport {\n  type DeclaredMembers,\n  EnumNaming,\n  enumDeclaration,\n  withoutDeclaredMembers,\n} from \"./enum-naming.js\";\nimport { FIRST_SCHEMA_NAMES, type SharedEnumNames } from \"./shared-enum-names.js\";\n\n/** Where footer declarations go, in order: the run's `ctx.injectFooter`, open to user code. */\nexport interface FooterSink {\n  /** Whether a type alias with this name is declared already (by the generator or a user). */\n  hasTypeAlias(name: string): boolean;\n  add(declaration: IrDeclaration): void;\n  /** Add a member to the `operations` interface, declared first if needed; see `DocumentFooter`. */\n  addOperation(build: () => IrPropertySignature): void;\n}\n\n/**\n * The `--dedupe-enums` key of the original: the values in default sort order, each paired with\n * the metadata at its sorted position (not the value's own metadata), as the original does.\n */\nfunction dedupeKey(request: EnumDeclarationRequest): string {\n  return [...request.values]\n    .sort(compareAsStrings)\n    .map((value, index) => metadataKey(String(value), request.metadata[index]))\n    .join(\",\");\n}\n\n/** `Array.prototype.sort` without a comparator: compares the values as strings. */\nfunction compareAsStrings(left: string | number, right: string | number): number {\n  const leftText = String(left);\n  const rightText = String(right);\n  if (leftText === rightText) {\n    return 0;\n  }\n  return leftText < rightText ? -1 : 1;\n}\n\nfunction metadataKey(value: string, metadata: EnumMemberMetadata | undefined): string {\n  return `${metadata?.name ?? value}:${metadata?.description || \"\"}`;\n}\n\n/** Separates a repeated `--enum-values` array name from its number, as root type aliases do. */\nconst ENUM_VALUES_NUMBER_SEPARATOR = \"_\";\n\n/** The whole declaration: an equal key means the same enum, member for member. */\nfunction declarationKey(name: string, request: EnumDeclarationRequest): string {\n  return JSON.stringify([name, request.values, request.metadata]);\n}\n\n/**\n * The footer of one run: enums (deduplicated with `--dedupe-enums`), `--enum-values` arrays, the\n * helper types they need, and the `operations` interface. Replaces the original's module-level\n * `enumCache`, so runs no longer share enums (research/legacy-bugs.md, item 3).\n */\nexport class RunFooter implements DocumentFooter {\n  private readonly naming = new EnumNaming();\n  private readonly enumNamesByKey = new Map<string, string>();\n  /** Declarations added already: the same one twice fails with \"Duplicate identifier\". */\n  private readonly declaredEnums = new Set<string>();\n  /** The member names of each declared enum, by value. */\n  private readonly membersByEnum = new Map<string, Map<string | number, string>>();\n  /** The members of each declared enum name, by member name. */\n  private readonly declaredMembers = new Map<string, Map<string, string | number>>();\n  /** `--enum-values` arrays added already: their declared name by name, type and values. */\n  private readonly declaredEnumValues = new Map<string, string>();\n  /** The declared `--enum-values` array names. */\n  private readonly enumValuesNames = new Set<string>();\n  private readonly sink: FooterSink;\n  private readonly isDedupingEnums: boolean;\n  private readonly sharedNames: SharedEnumNames;\n\n  constructor(\n    sink: FooterSink,\n    isDedupingEnums: boolean,\n    sharedNames: SharedEnumNames = FIRST_SCHEMA_NAMES,\n  ) {\n    this.sink = sink;\n    this.isDedupingEnums = isDedupingEnums;\n    this.sharedNames = sharedNames;\n  }\n\n  addEnum(request: EnumDeclarationRequest): string {\n    // The name is built before the cache lookup: it advances the naming state either way.\n    const ownName = this.naming.enumName(request.name);\n    const key = this.isDedupingEnums ? dedupeKey(request) : null;\n    // Every schema of a shared enum goes to `sharedNames`, the later ones too.\n    const name = key === null ? ownName : this.sharedNames.nameOf(key, ownName, request);\n    const known = key === null ? undefined : this.enumNamesByKey.get(key);\n    if (known !== undefined) {\n      return known;\n    }\n    // Only a repeated member fails to compile; two empty declarations merge, so they stay.\n    const declared = request.values.length > 0 ? declarationKey(name, request) : null;\n    if (declared !== null && this.declaredEnums.has(declared)) {\n      return name;\n    }\n    if (declared !== null) {\n      this.declaredEnums.add(declared);\n    }\n    const declaration = this.withoutRepeats(enumDeclaration(name, request, this.naming));\n    if (declaration !== null) {\n      this.record(declaration);\n      this.sink.add(declaration);\n    }\n    if (key !== null) {\n      this.enumNamesByKey.set(key, name);\n    }\n    return name;\n  }\n\n  /** The declaration without members an earlier one of the name has; null when none is left. */\n  private withoutRepeats(declaration: IrEnumDeclaration): IrEnumDeclaration | null {\n    const earlier: DeclaredMembers | undefined = this.declaredMembers.get(declaration.name);\n    if (earlier === undefined) {\n      return declaration;\n    }\n    const merged = withoutDeclaredMembers(declaration, earlier);\n    // Two empty declarations merge into one empty enum, which compiles, so the second stays.\n    return merged.members.length === 0 && declaration.members.length > 0 ? null : merged;\n  }\n\n  /** The members of a declaration; the first member of a value names it. */\n  private record(declaration: IrEnumDeclaration): void {\n    const byName = this.declaredMembers.get(declaration.name) ?? new Map();\n    const byValue = this.membersByEnum.get(declaration.name) ?? new Map();\n    for (const member of declaration.members) {\n      byName.set(member.name, member.value);\n      if (!byValue.has(member.value)) {\n        byValue.set(member.value, member.name);\n      }\n    }\n    this.declaredMembers.set(declaration.name, byName);\n    this.membersByEnum.set(declaration.name, byValue);\n  }\n\n  enumMembers(name: string): ReadonlyMap<string | number, string> {\n    return this.membersByEnum.get(name) ?? new Map();\n  }\n\n  addEnumValues(request: EnumValuesRequest): void {\n    const baseName = this.naming.arrayName(request.name);\n    // The same array twice fails with \"Cannot redeclare\"; a schema typed twice adds it twice.\n    const declared = JSON.stringify([baseName, request.type, request.values]);\n    if (this.declaredEnumValues.has(declared)) {\n      return;\n    }\n    const name = this.freeEnumValuesName(baseName);\n    this.declaredEnumValues.set(declared, name);\n    this.enumValuesNames.add(name);\n    this.require(HELPER_TYPES.flattenedDeepRequired);\n    this.require(HELPER_TYPES.readonlyArray);\n    this.sink.add({\n      kind: \"constArray\",\n      name,\n      isExported: true,\n      type: readonlyArrayOf(request.type),\n      values: request.values,\n      comments: [],\n    });\n  }\n\n  /**\n   * Another array may have the name: `Discount/type` and `discount/type`, or a property and an\n   * inline `allOf` item of one schema, typed at one location. A redeclared `const` does not\n   * compile, so a later one gets the next number (`discountTypeValues_2`). Every unnumbered name\n   * ends with `Values`, so a number never takes a name that a later array needs.\n   */\n  private freeEnumValuesName(name: string): string {\n    let candidate = name;\n    for (let count = 2; this.enumValuesNames.has(candidate); count++) {\n      candidate = `${name}${ENUM_VALUES_NUMBER_SEPARATOR}${count}`;\n    }\n    return candidate;\n  }\n\n  requireWithRequired(): void {\n    this.require(HELPER_TYPES.withRequired);\n  }\n\n  requirePropertyValues(): void {\n    this.require(HELPER_TYPES.propertyValues);\n  }\n\n  addOperation(build: () => IrPropertySignature): void {\n    this.sink.addOperation(build);\n  }\n\n  private require(helper: HelperType): void {\n    if (!this.sink.hasTypeAlias(helper.name)) {\n      this.sink.add({ kind: \"rawDeclaration\", name: helper.name, text: helper.text });\n    }\n  }\n}\n\nfunction readonlyArrayOf(type: IrType): IrType {\n  return irReference(HELPER_TYPES.readonlyArray.name, [type]);\n}\n"],"names":["EnumNaming","FIRST_SCHEMA_NAMES","enumDeclaration","withoutDeclaredMembers","HELPER_TYPES","irReference"],"mappings":";;;;;;;AAmCA,SAAS,UAAU,OAAA,EAAyC;AAC1D,EAAA,OAAO,CAAC,GAAG,OAAA,CAAQ,MAAM,EACtB,IAAA,CAAK,gBAAgB,CAAA,CACrB,GAAA,CAAI,CAAC,KAAA,EAAO,UAAU,WAAA,CAAY,MAAA,CAAO,KAAK,CAAA,EAAG,OAAA,CAAQ,QAAA,CAAS,KAAK,CAAC,CAAC,CAAA,CACzE,IAAA,CAAK,GAAG,CAAA;AACb;AAGA,SAAS,gBAAA,CAAiB,MAAuB,KAAA,EAAgC;AAC/E,EAAA,MAAM,QAAA,GAAW,OAAO,IAAI,CAAA;AAC5B,EAAA,MAAM,SAAA,GAAY,OAAO,KAAK,CAAA;AAC9B,EAAA,IAAI,aAAa,SAAA,EAAW;AAC1B,IAAA,OAAO,CAAA;AAAA,EACT;AACA,EAAA,OAAO,QAAA,GAAW,YAAY,EAAA,GAAK,CAAA;AACrC;AAEA,SAAS,WAAA,CAAY,OAAe,QAAA,EAAkD;AACpF,EAAA,OAAO,GAAG,QAAA,EAAU,IAAA,IAAQ,KAAK,CAAA,CAAA,EAAI,QAAA,EAAU,eAAe,EAAE,CAAA,CAAA;AAClE;AAGA,MAAM,4BAAA,GAA+B,GAAA;AAGrC,SAAS,cAAA,CAAe,MAAc,OAAA,EAAyC;AAC7E,EAAA,OAAO,IAAA,CAAK,UAAU,CAAC,IAAA,EAAM,QAAQ,MAAA,EAAQ,OAAA,CAAQ,QAAQ,CAAC,CAAA;AAChE;AAOO,MAAM,SAAA,CAAoC;AAAA,EAC9B,MAAA,GAAS,IAAIA,qBAAA,EAAW;AAAA,EACxB,cAAA,uBAAqB,GAAA,EAAoB;AAAA;AAAA,EAEzC,aAAA,uBAAoB,GAAA,EAAY;AAAA;AAAA,EAEhC,aAAA,uBAAoB,GAAA,EAA0C;AAAA;AAAA,EAE9D,eAAA,uBAAsB,GAAA,EAA0C;AAAA;AAAA,EAEhE,kBAAA,uBAAyB,GAAA,EAAoB;AAAA;AAAA,EAE7C,eAAA,uBAAsB,GAAA,EAAY;AAAA,EAClC,IAAA;AAAA,EACA,eAAA;AAAA,EACA,WAAA;AAAA,EAEjB,WAAA,CACE,IAAA,EACA,eAAA,EACA,WAAA,GAA+BC,kCAAA,EAC/B;AACA,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,eAAA,GAAkB,eAAA;AACvB,IAAA,IAAA,CAAK,WAAA,GAAc,WAAA;AAAA,EACrB;AAAA,EAEA,QAAQ,OAAA,EAAyC;AAE/C,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,MAAA,CAAO,QAAA,CAAS,QAAQ,IAAI,CAAA;AACjD,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,eAAA,GAAkB,SAAA,CAAU,OAAO,CAAA,GAAI,IAAA;AAExD,IAAA,MAAM,IAAA,GAAO,QAAQ,IAAA,GAAO,OAAA,GAAU,KAAK,WAAA,CAAY,MAAA,CAAO,GAAA,EAAK,OAAA,EAAS,OAAO,CAAA;AACnF,IAAA,MAAM,QAAQ,GAAA,KAAQ,IAAA,GAAO,SAAY,IAAA,CAAK,cAAA,CAAe,IAAI,GAAG,CAAA;AACpE,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,MAAM,QAAA,GAAW,QAAQ,MAAA,CAAO,MAAA,GAAS,IAAI,cAAA,CAAe,IAAA,EAAM,OAAO,CAAA,GAAI,IAAA;AAC7E,IAAA,IAAI,aAAa,IAAA,IAAQ,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,QAAQ,CAAA,EAAG;AACzD,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,aAAa,IAAA,EAAM;AACrB,MAAA,IAAA,CAAK,aAAA,CAAc,IAAI,QAAQ,CAAA;AAAA,IACjC;AACA,IAAA,MAAM,WAAA,GAAc,KAAK,cAAA,CAAeC,0BAAA,CAAgB,MAAM,OAAA,EAAS,IAAA,CAAK,MAAM,CAAC,CAAA;AACnF,IAAA,IAAI,gBAAgB,IAAA,EAAM;AACxB,MAAA,IAAA,CAAK,OAAO,WAAW,CAAA;AACvB,MAAA,IAAA,CAAK,IAAA,CAAK,IAAI,WAAW,CAAA;AAAA,IAC3B;AACA,IAAA,IAAI,QAAQ,IAAA,EAAM;AAChB,MAAA,IAAA,CAAK,cAAA,CAAe,GAAA,CAAI,GAAA,EAAK,IAAI,CAAA;AAAA,IACnC;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA,EAGQ,eAAe,WAAA,EAA0D;AAC/E,IAAA,MAAM,OAAA,GAAuC,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,YAAY,IAAI,CAAA;AACtF,IAAA,IAAI,YAAY,MAAA,EAAW;AACzB,MAAA,OAAO,WAAA;AAAA,IACT;AACA,IAAA,MAAM,MAAA,GAASC,iCAAA,CAAuB,WAAA,EAAa,OAAO,CAAA;AAE1D,IAAA,OAAO,MAAA,CAAO,QAAQ,MAAA,KAAW,CAAA,IAAK,YAAY,OAAA,CAAQ,MAAA,GAAS,IAAI,IAAA,GAAO,MAAA;AAAA,EAChF;AAAA;AAAA,EAGQ,OAAO,WAAA,EAAsC;AACnD,IAAA,MAAM,MAAA,GAAS,KAAK,eAAA,CAAgB,GAAA,CAAI,YAAY,IAAI,CAAA,wBAAS,GAAA,EAAI;AACrE,IAAA,MAAM,OAAA,GAAU,KAAK,aAAA,CAAc,GAAA,CAAI,YAAY,IAAI,CAAA,wBAAS,GAAA,EAAI;AACpE,IAAA,KAAA,MAAW,MAAA,IAAU,YAAY,OAAA,EAAS;AACxC,MAAA,MAAA,CAAO,GAAA,CAAI,MAAA,CAAO,IAAA,EAAM,MAAA,CAAO,KAAK,CAAA;AACpC,MAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,KAAK,CAAA,EAAG;AAC9B,QAAA,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,KAAA,EAAO,MAAA,CAAO,IAAI,CAAA;AAAA,MACvC;AAAA,IACF;AACA,IAAA,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,MAAM,CAAA;AACjD,IAAA,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,WAAA,CAAY,IAAA,EAAM,OAAO,CAAA;AAAA,EAClD;AAAA,EAEA,YAAY,IAAA,EAAoD;AAC9D,IAAA,OAAO,KAAK,aAAA,CAAc,GAAA,CAAI,IAAI,CAAA,wBAAS,GAAA,EAAI;AAAA,EACjD;AAAA,EAEA,cAAc,OAAA,EAAkC;AAC9C,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,SAAA,CAAU,QAAQ,IAAI,CAAA;AAEnD,IAAA,MAAM,QAAA,GAAW,KAAK,SAAA,CAAU,CAAC,UAAU,OAAA,CAAQ,IAAA,EAAM,OAAA,CAAQ,MAAM,CAAC,CAAA;AACxE,IAAA,IAAI,IAAA,CAAK,kBAAA,CAAmB,GAAA,CAAI,QAAQ,CAAA,EAAG;AACzC,MAAA;AAAA,IACF;AACA,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,kBAAA,CAAmB,QAAQ,CAAA;AAC7C,IAAA,IAAA,CAAK,kBAAA,CAAmB,GAAA,CAAI,QAAA,EAAU,IAAI,CAAA;AAC1C,IAAA,IAAA,CAAK,eAAA,CAAgB,IAAI,IAAI,CAAA;AAC7B,IAAA,IAAA,CAAK,OAAA,CAAQC,yBAAa,qBAAqB,CAAA;AAC/C,IAAA,IAAA,CAAK,OAAA,CAAQA,yBAAa,aAAa,CAAA;AACvC,IAAA,IAAA,CAAK,KAAK,GAAA,CAAI;AAAA,MACZ,IAAA,EAAM,YAAA;AAAA,MACN,IAAA;AAAA,MACA,UAAA,EAAY,IAAA;AAAA,MACZ,IAAA,EAAM,eAAA,CAAgB,OAAA,CAAQ,IAAI,CAAA;AAAA,MAClC,QAAQ,OAAA,CAAQ,MAAA;AAAA,MAChB,UAAU;AAAC,KACZ,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,mBAAmB,IAAA,EAAsB;AAC/C,IAAA,IAAI,SAAA,GAAY,IAAA;AAChB,IAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,IAAA,CAAK,gBAAgB,GAAA,CAAI,SAAS,GAAG,KAAA,EAAA,EAAS;AAChE,MAAA,SAAA,GAAY,CAAA,EAAG,IAAI,CAAA,EAAG,4BAA4B,GAAG,KAAK,CAAA,CAAA;AAAA,IAC5D;AACA,IAAA,OAAO,SAAA;AAAA,EACT;AAAA,EAEA,mBAAA,GAA4B;AAC1B,IAAA,IAAA,CAAK,OAAA,CAAQA,yBAAa,YAAY,CAAA;AAAA,EACxC;AAAA,EAEA,qBAAA,GAA8B;AAC5B,IAAA,IAAA,CAAK,OAAA,CAAQA,yBAAa,cAAc,CAAA;AAAA,EAC1C;AAAA,EAEA,aAAa,KAAA,EAAwC;AACnD,IAAA,IAAA,CAAK,IAAA,CAAK,aAAa,KAAK,CAAA;AAAA,EAC9B;AAAA,EAEQ,QAAQ,MAAA,EAA0B;AACxC,IAAA,IAAI,CAAC,IAAA,CAAK,IAAA,CAAK,YAAA,CAAa,MAAA,CAAO,IAAI,CAAA,EAAG;AACxC,MAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,EAAE,IAAA,EAAM,gBAAA,EAAkB,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,CAAA;AAAA,IAChF;AAAA,EACF;AACF;AAEA,SAAS,gBAAgB,IAAA,EAAsB;AAC7C,EAAA,OAAOC,yBAAYD,wBAAA,CAAa,aAAA,CAAc,IAAA,EAAM,CAAC,IAAI,CAAC,CAAA;AAC5D;;"}