openapi-typesafe 0.0.0 → 1.0.0-rc.1

package/dist/application/stack-overflow.cjs

@@ -0,0 +1,36 @@
+'use strict';
+
+const errors = require('../domain/errors.cjs');
+
+const STACK_OVERFLOW_MESSAGE = /maximum call stack size exceeded/i;
+function isStackOverflowError(error) {
+  return error instanceof RangeError && STACK_OVERFLOW_MESSAGE.test(error.message);
+}
+function schemaTooDeepError(step, cause) {
+  return new errors.OpenAPITypesafeError({
+    code: errors.ERROR_CODES.SCHEMA_TOO_DEEP,
+    message: `The schema is nested too deeply to ${step}: the call stack ran out. Both inline schemas and chains of $ref (each schema referring to the next) count; shorten the deepest.`,
+    details: { step },
+    cause
+  });
+}
+function withStackOverflowReported(step, run) {
+  try {
+    return run();
+  } catch (error) {
+    throw isStackOverflowError(error) ? schemaTooDeepError(step, error) : error;
+  }
+}
+async function withStackOverflowReportedAsync(step, run) {
+  try {
+    return await run();
+  } catch (error) {
+    throw isStackOverflowError(error) ? schemaTooDeepError(step, error) : error;
+  }
+}
+
+exports.isStackOverflowError = isStackOverflowError;
+exports.schemaTooDeepError = schemaTooDeepError;
+exports.withStackOverflowReported = withStackOverflowReported;
+exports.withStackOverflowReportedAsync = withStackOverflowReportedAsync;
+//# sourceMappingURL=stack-overflow.cjs.map

package/dist/application/stack-overflow.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack-overflow.cjs","sources":["../../src/application/stack-overflow.ts"],"sourcesContent":["import { ERROR_CODES, OpenAPITypesafeError } from \"../domain/errors.js\";\n\n/**\n * Deeply nested schemas (ENGINEERING_PLAN 8.5). Loading, bundling, transforming and printing walk\n * schemas recursively, and Redocly follows each `$ref` inside the walk. On the default Node.js\n * stack, about 550 levels of inline schemas or a chain of about 900 `$ref`s (each schema refers to\n * the next) run out of call stack. Real documents stay far below: every YAML or JSON file goes\n * through the YAML parser, which stops at 100 levels, and the whole corpus passes. The overflow is\n * reported as a typed error instead of a `RangeError` with a stack trace.\n */\n\n/** The step that ran out of call stack; named in the message and the details. */\nexport type DeepSchemaStep = \"load\" | \"transform\" | \"print\";\n\n/** V8 and JavaScriptCore (Node.js, Deno, Bun) throw a `RangeError` with this message. */\nconst STACK_OVERFLOW_MESSAGE = /maximum call stack size exceeded/i;\n\n/** Whether a thrown value is a call stack overflow. */\nexport function isStackOverflowError(error: unknown): boolean {\n  return error instanceof RangeError && STACK_OVERFLOW_MESSAGE.test(error.message);\n}\n\n/** The typed error for a document nested too deeply for the call stack. */\nexport function schemaTooDeepError(step: DeepSchemaStep, cause: unknown): OpenAPITypesafeError {\n  return new OpenAPITypesafeError({\n    code: ERROR_CODES.SCHEMA_TOO_DEEP,\n    message:\n      `The schema is nested too deeply to ${step}: the call stack ran out. Both inline ` +\n      \"schemas and chains of $ref (each schema referring to the next) count; shorten the deepest.\",\n    details: { step },\n    cause,\n  });\n}\n\n/** Run a step and report a stack overflow in it as SCHEMA_TOO_DEEP; other errors pass through. */\nexport function withStackOverflowReported<T>(step: DeepSchemaStep, run: () => T): T {\n  try {\n    return run();\n  } catch (error) {\n    throw isStackOverflowError(error) ? schemaTooDeepError(step, error) : error;\n  }\n}\n\n/** The asynchronous form of `withStackOverflowReported`. */\nexport async function withStackOverflowReportedAsync<T>(\n  step: DeepSchemaStep,\n  run: () => Promise<T>,\n): Promise<T> {\n  try {\n    return await run();\n  } catch (error) {\n    throw isStackOverflowError(error) ? schemaTooDeepError(step, error) : error;\n  }\n}\n"],"names":["OpenAPITypesafeError","ERROR_CODES"],"mappings":";;;;AAeA,MAAM,sBAAA,GAAyB,mCAAA;AAGxB,SAAS,qBAAqB,KAAA,EAAyB;AAC5D,EAAA,OAAO,KAAA,YAAiB,UAAA,IAAc,sBAAA,CAAuB,IAAA,CAAK,MAAM,OAAO,CAAA;AACjF;AAGO,SAAS,kBAAA,CAAmB,MAAsB,KAAA,EAAsC;AAC7F,EAAA,OAAO,IAAIA,2BAAA,CAAqB;AAAA,IAC9B,MAAMC,kBAAA,CAAY,eAAA;AAAA,IAClB,OAAA,EACE,sCAAsC,IAAI,CAAA,gIAAA,CAAA;AAAA,IAE5C,OAAA,EAAS,EAAE,IAAA,EAAK;AAAA,IAChB;AAAA,GACD,CAAA;AACH;AAGO,SAAS,yBAAA,CAA6B,MAAsB,GAAA,EAAiB;AAClF,EAAA,IAAI;AACF,IAAA,OAAO,GAAA,EAAI;AAAA,EACb,SAAS,KAAA,EAAO;AACd,IAAA,MAAM,qBAAqB,KAAK,CAAA,GAAI,kBAAA,CAAmB,IAAA,EAAM,KAAK,CAAA,GAAI,KAAA;AAAA,EACxE;AACF;AAGA,eAAsB,8BAAA,CACpB,MACA,GAAA,EACY;AACZ,EAAA,IAAI;AACF,IAAA,OAAO,MAAM,GAAA,EAAI;AAAA,EACnB,SAAS,KAAA,EAAO;AACd,IAAA,MAAM,qBAAqB,KAAK,CAAA,GAAI,kBAAA,CAAmB,IAAA,EAAM,KAAK,CAAA,GAAI,KAAA;AAAA,EACxE;AACF;;;;;"}

package/dist/application/stack-overflow.mjs

@@ -0,0 +1,31 @@
+import { OpenAPITypesafeError, ERROR_CODES } from '../domain/errors.mjs';
+
+const STACK_OVERFLOW_MESSAGE = /maximum call stack size exceeded/i;
+function isStackOverflowError(error) {
+  return error instanceof RangeError && STACK_OVERFLOW_MESSAGE.test(error.message);
+}
+function schemaTooDeepError(step, cause) {
+  return new OpenAPITypesafeError({
+    code: ERROR_CODES.SCHEMA_TOO_DEEP,
+    message: `The schema is nested too deeply to ${step}: the call stack ran out. Both inline schemas and chains of $ref (each schema referring to the next) count; shorten the deepest.`,
+    details: { step },
+    cause
+  });
+}
+function withStackOverflowReported(step, run) {
+  try {
+    return run();
+  } catch (error) {
+    throw isStackOverflowError(error) ? schemaTooDeepError(step, error) : error;
+  }
+}
+async function withStackOverflowReportedAsync(step, run) {
+  try {
+    return await run();
+  } catch (error) {
+    throw isStackOverflowError(error) ? schemaTooDeepError(step, error) : error;
+  }
+}
+
+export { isStackOverflowError, schemaTooDeepError, withStackOverflowReported, withStackOverflowReportedAsync };
+//# sourceMappingURL=stack-overflow.mjs.map

package/dist/application/stack-overflow.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack-overflow.mjs","sources":["../../src/application/stack-overflow.ts"],"sourcesContent":["import { ERROR_CODES, OpenAPITypesafeError } from \"../domain/errors.js\";\n\n/**\n * Deeply nested schemas (ENGINEERING_PLAN 8.5). Loading, bundling, transforming and printing walk\n * schemas recursively, and Redocly follows each `$ref` inside the walk. On the default Node.js\n * stack, about 550 levels of inline schemas or a chain of about 900 `$ref`s (each schema refers to\n * the next) run out of call stack. Real documents stay far below: every YAML or JSON file goes\n * through the YAML parser, which stops at 100 levels, and the whole corpus passes. The overflow is\n * reported as a typed error instead of a `RangeError` with a stack trace.\n */\n\n/** The step that ran out of call stack; named in the message and the details. */\nexport type DeepSchemaStep = \"load\" | \"transform\" | \"print\";\n\n/** V8 and JavaScriptCore (Node.js, Deno, Bun) throw a `RangeError` with this message. */\nconst STACK_OVERFLOW_MESSAGE = /maximum call stack size exceeded/i;\n\n/** Whether a thrown value is a call stack overflow. */\nexport function isStackOverflowError(error: unknown): boolean {\n  return error instanceof RangeError && STACK_OVERFLOW_MESSAGE.test(error.message);\n}\n\n/** The typed error for a document nested too deeply for the call stack. */\nexport function schemaTooDeepError(step: DeepSchemaStep, cause: unknown): OpenAPITypesafeError {\n  return new OpenAPITypesafeError({\n    code: ERROR_CODES.SCHEMA_TOO_DEEP,\n    message:\n      `The schema is nested too deeply to ${step}: the call stack ran out. Both inline ` +\n      \"schemas and chains of $ref (each schema referring to the next) count; shorten the deepest.\",\n    details: { step },\n    cause,\n  });\n}\n\n/** Run a step and report a stack overflow in it as SCHEMA_TOO_DEEP; other errors pass through. */\nexport function withStackOverflowReported<T>(step: DeepSchemaStep, run: () => T): T {\n  try {\n    return run();\n  } catch (error) {\n    throw isStackOverflowError(error) ? schemaTooDeepError(step, error) : error;\n  }\n}\n\n/** The asynchronous form of `withStackOverflowReported`. */\nexport async function withStackOverflowReportedAsync<T>(\n  step: DeepSchemaStep,\n  run: () => Promise<T>,\n): Promise<T> {\n  try {\n    return await run();\n  } catch (error) {\n    throw isStackOverflowError(error) ? schemaTooDeepError(step, error) : error;\n  }\n}\n"],"names":[],"mappings":";;AAeA,MAAM,sBAAA,GAAyB,mCAAA;AAGxB,SAAS,qBAAqB,KAAA,EAAyB;AAC5D,EAAA,OAAO,KAAA,YAAiB,UAAA,IAAc,sBAAA,CAAuB,IAAA,CAAK,MAAM,OAAO,CAAA;AACjF;AAGO,SAAS,kBAAA,CAAmB,MAAsB,KAAA,EAAsC;AAC7F,EAAA,OAAO,IAAI,oBAAA,CAAqB;AAAA,IAC9B,MAAM,WAAA,CAAY,eAAA;AAAA,IAClB,OAAA,EACE,sCAAsC,IAAI,CAAA,gIAAA,CAAA;AAAA,IAE5C,OAAA,EAAS,EAAE,IAAA,EAAK;AAAA,IAChB;AAAA,GACD,CAAA;AACH;AAGO,SAAS,yBAAA,CAA6B,MAAsB,GAAA,EAAiB;AAClF,EAAA,IAAI;AACF,IAAA,OAAO,GAAA,EAAI;AAAA,EACb,SAAS,KAAA,EAAO;AACd,IAAA,MAAM,qBAAqB,KAAK,CAAA,GAAI,kBAAA,CAAmB,IAAA,EAAM,KAAK,CAAA,GAAI,KAAA;AAAA,EACxE;AACF;AAGA,eAAsB,8BAAA,CACpB,MACA,GAAA,EACY;AACZ,EAAA,IAAI;AACF,IAAA,OAAO,MAAM,GAAA,EAAI;AAAA,EACnB,SAAS,KAAA,EAAO;AACd,IAAA,MAAM,qBAAqB,KAAK,CAAA,GAAI,kBAAA,CAAmB,IAAA,EAAM,KAAK,CAAA,GAAI,KAAA;AAAA,EACxE;AACF;;"}

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

@@ -0,0 +1,144 @@
+'use strict';
+
+const typeResolution = require('./type-resolution.cjs');
+
+function everyOf(items, relate) {
+  let result = "assignable";
+  for (const [index, item] of items.entries()) {
+    const each = relate(item, index);
+    if (each === "rejected") {
+      return "rejected";
+    }
+    if (each === "undecided") {
+      result = "undecided";
+    }
+  }
+  return result;
+}
+function someOf(items, relate) {
+  let result = "rejected";
+  for (const item of items) {
+    const each = relate(item);
+    if (each === "assignable") {
+      return "assignable";
+    }
+    if (each === "undecided") {
+      result = "undecided";
+    }
+  }
+  return result;
+}
+function provenBy(condition) {
+  return condition ? "assignable" : "rejected";
+}
+function categoryOf(type) {
+  switch (type.kind) {
+    case "keyword":
+    case "stringLiteral":
+    case "numberLiteral":
+    case "booleanLiteral":
+      return "primitive";
+    case "array":
+    case "tuple":
+    case "readonly":
+      return "list";
+    case "object":
+      return "object";
+    default:
+      return "opaque";
+  }
+}
+const NO_OBJECT_KEYWORDS = /* @__PURE__ */ new Set(["null", "undefined", "unknown", "never"]);
+const ARRAY_MEMBER_NAMES = /* @__PURE__ */ new Set([
+  "length",
+  "toString",
+  "toLocaleString",
+  "pop",
+  "push",
+  "concat",
+  "join",
+  "reverse",
+  "shift",
+  "slice",
+  "sort",
+  "splice",
+  "unshift",
+  "indexOf",
+  "lastIndexOf",
+  "every",
+  "some",
+  "forEach",
+  "map",
+  "filter",
+  "reduce",
+  "reduceRight",
+  "find",
+  "findIndex",
+  "fill",
+  "copyWithin",
+  "entries",
+  "keys",
+  "values",
+  "includes",
+  "flatMap",
+  "flat",
+  "at",
+  "findLast",
+  "findLastIndex",
+  "toReversed",
+  "toSorted",
+  "toSpliced",
+  "with"
+]);
+const ARRAY_LENGTH = "length";
+const ELEMENT_NAME_RE = /^\d+$/;
+function isListMemberName(name) {
+  return ARRAY_MEMBER_NAMES.has(name) || ELEMENT_NAME_RE.test(name);
+}
+function listToObject(target) {
+  const properties = [...typeResolution.propertiesOf(target).values()];
+  const isForeign = (property) => !isListMemberName(typeResolution.nameOf(property));
+  const needsForeign = properties.some((property) => !property.isOptional && isForeign(property));
+  const isWeak = properties.length > 0 && typeResolution.indexSignaturesOf(target).length === 0 && properties.every((property) => property.isOptional);
+  return needsForeign || isWeak && properties.every(isForeign) ? "rejected" : "undecided";
+}
+function primitiveToObject(source) {
+  const isNoObject = source.kind === "keyword" && NO_OBJECT_KEYWORDS.has(source.keyword);
+  return isNoObject ? "rejected" : "undecided";
+}
+function objectToList(source) {
+  return typeResolution.propertiesOf(source).has(ARRAY_LENGTH) ? "undecided" : "rejected";
+}
+function crossCategoryRelation(source, target) {
+  const from = categoryOf(source);
+  const to = categoryOf(target);
+  if (from === "opaque" || to === "opaque") {
+    return "undecided";
+  }
+  if (from === to) {
+    return null;
+  }
+  if (to !== "object") {
+    return source.kind === "object" && to === "list" ? objectToList(source) : "rejected";
+  }
+  return from === "primitive" ? primitiveToObject(source) : listToObject(target);
+}
+const LITERAL_KEYWORDS = {
+  stringLiteral: "string",
+  numberLiteral: "number",
+  booleanLiteral: "boolean"
+};
+function primitiveRelation(source, target) {
+  if (target.kind !== "keyword" || source.kind === "keyword") {
+    return "rejected";
+  }
+  const keyword = LITERAL_KEYWORDS[source.kind];
+  return provenBy(keyword === target.keyword);
+}
+
+exports.crossCategoryRelation = crossCategoryRelation;
+exports.everyOf = everyOf;
+exports.primitiveRelation = primitiveRelation;
+exports.provenBy = provenBy;
+exports.someOf = someOf;
+//# sourceMappingURL=assignability.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"assignability.cjs","sources":["../../../../src/application/transform/document/assignability.ts"],"sourcesContent":["import type { IrObjectType, IrPropertySignature, IrType } from \"../../../domain/ir/nodes.js\";\nimport { indexSignaturesOf, nameOf, propertiesOf } from \"./type-resolution.js\";\n\n/**\n * What the `--path-params-as-types` overlap check knows about one type where another is expected.\n * `assignable` and `rejected` are proofs of what TypeScript decides (`strict`, without\n * `exactOptionalPropertyTypes`); `undecided` is a pair the check does not model, such as a utility\n * type or raw text. Only a rejection changes the output, so an undecided pair keeps the original.\n */\nexport type Assignability = \"assignable\" | \"rejected\" | \"undecided\";\n\n/**\n * All of the relations: rejected when one is, assignable when each is. The relations are computed\n * lazily, so a rejection stops the rest.\n */\nexport function everyOf<T>(\n  items: readonly T[],\n  relate: (item: T, index: number) => Assignability,\n): Assignability {\n  let result: Assignability = \"assignable\";\n  for (const [index, item] of items.entries()) {\n    const each = relate(item, index);\n    if (each === \"rejected\") {\n      return \"rejected\";\n    }\n    if (each === \"undecided\") {\n      result = \"undecided\";\n    }\n  }\n  return result;\n}\n\n/** One of the relations: assignable when one is, rejected when each is. */\nexport function someOf<T>(items: readonly T[], relate: (item: T) => Assignability): Assignability {\n  let result: Assignability = \"rejected\";\n  for (const item of items) {\n    const each = relate(item);\n    if (each === \"assignable\") {\n      return \"assignable\";\n    }\n    if (each === \"undecided\") {\n      result = \"undecided\";\n    }\n  }\n  return result;\n}\n\n/** Assignable when the condition holds, rejected when it does not. */\nexport function provenBy(condition: boolean): Assignability {\n  return condition ? \"assignable\" : \"rejected\";\n}\n\n/**\n * The kinds of resolved types the check tells apart. A type of one kind is never assignable to a\n * type of another, except that a primitive or a list may fit an object type (`string` fits\n * `{ length: number }`), which the check models only in part. `opaque` is any type it cannot\n * read.\n */\ntype TypeCategory = \"primitive\" | \"list\" | \"object\" | \"opaque\";\n\nfunction categoryOf(type: IrType): TypeCategory {\n  switch (type.kind) {\n    case \"keyword\":\n    case \"stringLiteral\":\n    case \"numberLiteral\":\n    case \"booleanLiteral\":\n      return \"primitive\";\n    case \"array\":\n    case \"tuple\":\n    case \"readonly\":\n      return \"list\";\n    case \"object\":\n      return \"object\";\n    default:\n      return \"opaque\";\n  }\n}\n\n/** Keywords that are no object: `{}` rejects them under `strictNullChecks`. */\nconst NO_OBJECT_KEYWORDS: ReadonlySet<string> = new Set([\"null\", \"undefined\", \"unknown\", \"never\"]);\n\n/**\n * The members of `ReadonlyArray` and `Array` in the TypeScript libraries up to ESNext. An object\n * type that needs a property of another name is no list; a numeric name may be a tuple element.\n */\nconst ARRAY_MEMBER_NAMES: ReadonlySet<string> = new Set([\n  \"length\",\n  \"toString\",\n  \"toLocaleString\",\n  \"pop\",\n  \"push\",\n  \"concat\",\n  \"join\",\n  \"reverse\",\n  \"shift\",\n  \"slice\",\n  \"sort\",\n  \"splice\",\n  \"unshift\",\n  \"indexOf\",\n  \"lastIndexOf\",\n  \"every\",\n  \"some\",\n  \"forEach\",\n  \"map\",\n  \"filter\",\n  \"reduce\",\n  \"reduceRight\",\n  \"find\",\n  \"findIndex\",\n  \"fill\",\n  \"copyWithin\",\n  \"entries\",\n  \"keys\",\n  \"values\",\n  \"includes\",\n  \"flatMap\",\n  \"flat\",\n  \"at\",\n  \"findLast\",\n  \"findLastIndex\",\n  \"toReversed\",\n  \"toSorted\",\n  \"toSpliced\",\n  \"with\",\n]);\n\nconst ARRAY_LENGTH = \"length\";\n/** A tuple element's name: `\"0\"`, `\"1\"`. */\nconst ELEMENT_NAME_RE = /^\\d+$/;\n\nfunction isListMemberName(name: string): boolean {\n  return ARRAY_MEMBER_NAMES.has(name) || ELEMENT_NAME_RE.test(name);\n}\n\n/**\n * Whether a list fits an object type. It does not when the object needs a property no list has\n * (TS2741), or when the object is a weak type and no list has one of its properties (TS2559).\n */\nfunction listToObject(target: IrObjectType): Assignability {\n  const properties = [...propertiesOf(target).values()];\n  const isForeign = (property: IrPropertySignature) => !isListMemberName(nameOf(property));\n  const needsForeign = properties.some((property) => !property.isOptional && isForeign(property));\n  const isWeak =\n    properties.length > 0 &&\n    indexSignaturesOf(target).length === 0 &&\n    properties.every((property) => property.isOptional);\n  return needsForeign || (isWeak && properties.every(isForeign)) ? \"rejected\" : \"undecided\";\n}\n\n/**\n * Whether a primitive fits an object type: `null`, `undefined` and `unknown` never do; any other\n * may (`{}`, `{ length: number }`), which is not modelled.\n */\nfunction primitiveToObject(source: IrType): Assignability {\n  const isNoObject = source.kind === \"keyword\" && NO_OBJECT_KEYWORDS.has(source.keyword);\n  return isNoObject ? \"rejected\" : \"undecided\";\n}\n\n/** An object type fits an array only with all of its members; `length` is the first it needs. */\nfunction objectToList(source: IrObjectType): Assignability {\n  return propertiesOf(source).has(ARRAY_LENGTH) ? \"undecided\" : \"rejected\";\n}\n\n/**\n * The relation of two types of different categories, or null when they are of the same one.\n * Primitive and list targets accept nothing of another category; see `TypeCategory`.\n */\nexport function crossCategoryRelation(source: IrType, target: IrType): Assignability | null {\n  const from = categoryOf(source);\n  const to = categoryOf(target);\n  if (from === \"opaque\" || to === \"opaque\") {\n    return \"undecided\";\n  }\n  if (from === to) {\n    return null;\n  }\n  if (to !== \"object\") {\n    return source.kind === \"object\" && to === \"list\" ? objectToList(source) : \"rejected\";\n  }\n  return from === \"primitive\" ? primitiveToObject(source) : listToObject(target as IrObjectType);\n}\n\n/** The keyword a literal type belongs to. */\nconst LITERAL_KEYWORDS = {\n  stringLiteral: \"string\",\n  numberLiteral: \"number\",\n  booleanLiteral: \"boolean\",\n} as const;\n\n/**\n * The relation of two primitive types written differently (the same text is assignable). A\n * literal fits its keyword; any other pair is rejected: different keywords, different literals,\n * a keyword for one literal (a union of literals is compared in `type-assignability.ts`), and\n * anything for `never`.\n */\nexport function primitiveRelation(source: IrType, target: IrType): Assignability {\n  if (target.kind !== \"keyword\" || source.kind === \"keyword\") {\n    return \"rejected\";\n  }\n  const keyword = (LITERAL_KEYWORDS as Partial<Record<IrType[\"kind\"], string>>)[source.kind];\n  return provenBy(keyword === target.keyword);\n}\n"],"names":["propertiesOf","nameOf","indexSignaturesOf"],"mappings":";;;;AAeO,SAAS,OAAA,CACd,OACA,MAAA,EACe;AACf,EAAA,IAAI,MAAA,GAAwB,YAAA;AAC5B,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,IAAI,CAAA,IAAK,KAAA,CAAM,SAAQ,EAAG;AAC3C,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,IAAA,EAAM,KAAK,CAAA;AAC/B,IAAA,IAAI,SAAS,UAAA,EAAY;AACvB,MAAA,OAAO,UAAA;AAAA,IACT;AACA,IAAA,IAAI,SAAS,WAAA,EAAa;AACxB,MAAA,MAAA,GAAS,WAAA;AAAA,IACX;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,MAAA,CAAU,OAAqB,MAAA,EAAmD;AAChG,EAAA,IAAI,MAAA,GAAwB,UAAA;AAC5B,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,IAAA,GAAO,OAAO,IAAI,CAAA;AACxB,IAAA,IAAI,SAAS,YAAA,EAAc;AACzB,MAAA,OAAO,YAAA;AAAA,IACT;AACA,IAAA,IAAI,SAAS,WAAA,EAAa;AACxB,MAAA,MAAA,GAAS,WAAA;AAAA,IACX;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,SAAS,SAAA,EAAmC;AAC1D,EAAA,OAAO,YAAY,YAAA,GAAe,UAAA;AACpC;AAUA,SAAS,WAAW,IAAA,EAA4B;AAC9C,EAAA,QAAQ,KAAK,IAAA;AAAM,IACjB,KAAK,SAAA;AAAA,IACL,KAAK,eAAA;AAAA,IACL,KAAK,eAAA;AAAA,IACL,KAAK,gBAAA;AACH,MAAA,OAAO,WAAA;AAAA,IACT,KAAK,OAAA;AAAA,IACL,KAAK,OAAA;AAAA,IACL,KAAK,UAAA;AACH,MAAA,OAAO,MAAA;AAAA,IACT,KAAK,QAAA;AACH,MAAA,OAAO,QAAA;AAAA,IACT;AACE,MAAA,OAAO,QAAA;AAAA;AAEb;AAGA,MAAM,kBAAA,uBAA8C,GAAA,CAAI,CAAC,QAAQ,WAAA,EAAa,SAAA,EAAW,OAAO,CAAC,CAAA;AAMjG,MAAM,kBAAA,uBAA8C,GAAA,CAAI;AAAA,EACtD,QAAA;AAAA,EACA,UAAA;AAAA,EACA,gBAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,QAAA;AAAA,EACA,MAAA;AAAA,EACA,SAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,QAAA;AAAA,EACA,SAAA;AAAA,EACA,SAAA;AAAA,EACA,aAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,SAAA;AAAA,EACA,KAAA;AAAA,EACA,QAAA;AAAA,EACA,QAAA;AAAA,EACA,aAAA;AAAA,EACA,MAAA;AAAA,EACA,WAAA;AAAA,EACA,MAAA;AAAA,EACA,YAAA;AAAA,EACA,SAAA;AAAA,EACA,MAAA;AAAA,EACA,QAAA;AAAA,EACA,UAAA;AAAA,EACA,SAAA;AAAA,EACA,MAAA;AAAA,EACA,IAAA;AAAA,EACA,UAAA;AAAA,EACA,eAAA;AAAA,EACA,YAAA;AAAA,EACA,UAAA;AAAA,EACA,WAAA;AAAA,EACA;AACF,CAAC,CAAA;AAED,MAAM,YAAA,GAAe,QAAA;AAErB,MAAM,eAAA,GAAkB,OAAA;AAExB,SAAS,iBAAiB,IAAA,EAAuB;AAC/C,EAAA,OAAO,mBAAmB,GAAA,CAAI,IAAI,CAAA,IAAK,eAAA,CAAgB,KAAK,IAAI,CAAA;AAClE;AAMA,SAAS,aAAa,MAAA,EAAqC;AACzD,EAAA,MAAM,aAAa,CAAC,GAAGA,4BAAa,MAAM,CAAA,CAAE,QAAQ,CAAA;AACpD,EAAA,MAAM,YAAY,CAAC,QAAA,KAAkC,CAAC,gBAAA,CAAiBC,qBAAA,CAAO,QAAQ,CAAC,CAAA;AACvF,EAAA,MAAM,YAAA,GAAe,UAAA,CAAW,IAAA,CAAK,CAAC,QAAA,KAAa,CAAC,QAAA,CAAS,UAAA,IAAc,SAAA,CAAU,QAAQ,CAAC,CAAA;AAC9F,EAAA,MAAM,MAAA,GACJ,UAAA,CAAW,MAAA,GAAS,CAAA,IACpBC,iCAAkB,MAAM,CAAA,CAAE,MAAA,KAAW,CAAA,IACrC,UAAA,CAAW,KAAA,CAAM,CAAC,QAAA,KAAa,SAAS,UAAU,CAAA;AACpD,EAAA,OAAO,gBAAiB,MAAA,IAAU,UAAA,CAAW,KAAA,CAAM,SAAS,IAAK,UAAA,GAAa,WAAA;AAChF;AAMA,SAAS,kBAAkB,MAAA,EAA+B;AACxD,EAAA,MAAM,aAAa,MAAA,CAAO,IAAA,KAAS,aAAa,kBAAA,CAAmB,GAAA,CAAI,OAAO,OAAO,CAAA;AACrF,EAAA,OAAO,aAAa,UAAA,GAAa,WAAA;AACnC;AAGA,SAAS,aAAa,MAAA,EAAqC;AACzD,EAAA,OAAOF,4BAAa,MAAM,CAAA,CAAE,GAAA,CAAI,YAAY,IAAI,WAAA,GAAc,UAAA;AAChE;AAMO,SAAS,qBAAA,CAAsB,QAAgB,MAAA,EAAsC;AAC1F,EAAA,MAAM,IAAA,GAAO,WAAW,MAAM,CAAA;AAC9B,EAAA,MAAM,EAAA,GAAK,WAAW,MAAM,CAAA;AAC5B,EAAA,IAAI,IAAA,KAAS,QAAA,IAAY,EAAA,KAAO,QAAA,EAAU;AACxC,IAAA,OAAO,WAAA;AAAA,EACT;AACA,EAAA,IAAI,SAAS,EAAA,EAAI;AACf,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,OAAO,QAAA,EAAU;AACnB,IAAA,OAAO,OAAO,IAAA,KAAS,QAAA,IAAY,OAAO,MAAA,GAAS,YAAA,CAAa,MAAM,CAAA,GAAI,UAAA;AAAA,EAC5E;AACA,EAAA,OAAO,SAAS,WAAA,GAAc,iBAAA,CAAkB,MAAM,CAAA,GAAI,aAAa,MAAsB,CAAA;AAC/F;AAGA,MAAM,gBAAA,GAAmB;AAAA,EACvB,aAAA,EAAe,QAAA;AAAA,EACf,aAAA,EAAe,QAAA;AAAA,EACf,cAAA,EAAgB;AAClB,CAAA;AAQO,SAAS,iBAAA,CAAkB,QAAgB,MAAA,EAA+B;AAC/E,EAAA,IAAI,MAAA,CAAO,IAAA,KAAS,SAAA,IAAa,MAAA,CAAO,SAAS,SAAA,EAAW;AAC1D,IAAA,OAAO,UAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAA,GAAW,gBAAA,CAA6D,MAAA,CAAO,IAAI,CAAA;AACzF,EAAA,OAAO,QAAA,CAAS,OAAA,KAAY,MAAA,CAAO,OAAO,CAAA;AAC5C;;;;;;"}

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

@@ -0,0 +1,138 @@
+import { propertiesOf, indexSignaturesOf, nameOf } from './type-resolution.mjs';
+
+function everyOf(items, relate) {
+  let result = "assignable";
+  for (const [index, item] of items.entries()) {
+    const each = relate(item, index);
+    if (each === "rejected") {
+      return "rejected";
+    }
+    if (each === "undecided") {
+      result = "undecided";
+    }
+  }
+  return result;
+}
+function someOf(items, relate) {
+  let result = "rejected";
+  for (const item of items) {
+    const each = relate(item);
+    if (each === "assignable") {
+      return "assignable";
+    }
+    if (each === "undecided") {
+      result = "undecided";
+    }
+  }
+  return result;
+}
+function provenBy(condition) {
+  return condition ? "assignable" : "rejected";
+}
+function categoryOf(type) {
+  switch (type.kind) {
+    case "keyword":
+    case "stringLiteral":
+    case "numberLiteral":
+    case "booleanLiteral":
+      return "primitive";
+    case "array":
+    case "tuple":
+    case "readonly":
+      return "list";
+    case "object":
+      return "object";
+    default:
+      return "opaque";
+  }
+}
+const NO_OBJECT_KEYWORDS = /* @__PURE__ */ new Set(["null", "undefined", "unknown", "never"]);
+const ARRAY_MEMBER_NAMES = /* @__PURE__ */ new Set([
+  "length",
+  "toString",
+  "toLocaleString",
+  "pop",
+  "push",
+  "concat",
+  "join",
+  "reverse",
+  "shift",
+  "slice",
+  "sort",
+  "splice",
+  "unshift",
+  "indexOf",
+  "lastIndexOf",
+  "every",
+  "some",
+  "forEach",
+  "map",
+  "filter",
+  "reduce",
+  "reduceRight",
+  "find",
+  "findIndex",
+  "fill",
+  "copyWithin",
+  "entries",
+  "keys",
+  "values",
+  "includes",
+  "flatMap",
+  "flat",
+  "at",
+  "findLast",
+  "findLastIndex",
+  "toReversed",
+  "toSorted",
+  "toSpliced",
+  "with"
+]);
+const ARRAY_LENGTH = "length";
+const ELEMENT_NAME_RE = /^\d+$/;
+function isListMemberName(name) {
+  return ARRAY_MEMBER_NAMES.has(name) || ELEMENT_NAME_RE.test(name);
+}
+function listToObject(target) {
+  const properties = [...propertiesOf(target).values()];
+  const isForeign = (property) => !isListMemberName(nameOf(property));
+  const needsForeign = properties.some((property) => !property.isOptional && isForeign(property));
+  const isWeak = properties.length > 0 && indexSignaturesOf(target).length === 0 && properties.every((property) => property.isOptional);
+  return needsForeign || isWeak && properties.every(isForeign) ? "rejected" : "undecided";
+}
+function primitiveToObject(source) {
+  const isNoObject = source.kind === "keyword" && NO_OBJECT_KEYWORDS.has(source.keyword);
+  return isNoObject ? "rejected" : "undecided";
+}
+function objectToList(source) {
+  return propertiesOf(source).has(ARRAY_LENGTH) ? "undecided" : "rejected";
+}
+function crossCategoryRelation(source, target) {
+  const from = categoryOf(source);
+  const to = categoryOf(target);
+  if (from === "opaque" || to === "opaque") {
+    return "undecided";
+  }
+  if (from === to) {
+    return null;
+  }
+  if (to !== "object") {
+    return source.kind === "object" && to === "list" ? objectToList(source) : "rejected";
+  }
+  return from === "primitive" ? primitiveToObject(source) : listToObject(target);
+}
+const LITERAL_KEYWORDS = {
+  stringLiteral: "string",
+  numberLiteral: "number",
+  booleanLiteral: "boolean"
+};
+function primitiveRelation(source, target) {
+  if (target.kind !== "keyword" || source.kind === "keyword") {
+    return "rejected";
+  }
+  const keyword = LITERAL_KEYWORDS[source.kind];
+  return provenBy(keyword === target.keyword);
+}
+
+export { crossCategoryRelation, everyOf, primitiveRelation, provenBy, someOf };
+//# sourceMappingURL=assignability.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"assignability.mjs","sources":["../../../../src/application/transform/document/assignability.ts"],"sourcesContent":["import type { IrObjectType, IrPropertySignature, IrType } from \"../../../domain/ir/nodes.js\";\nimport { indexSignaturesOf, nameOf, propertiesOf } from \"./type-resolution.js\";\n\n/**\n * What the `--path-params-as-types` overlap check knows about one type where another is expected.\n * `assignable` and `rejected` are proofs of what TypeScript decides (`strict`, without\n * `exactOptionalPropertyTypes`); `undecided` is a pair the check does not model, such as a utility\n * type or raw text. Only a rejection changes the output, so an undecided pair keeps the original.\n */\nexport type Assignability = \"assignable\" | \"rejected\" | \"undecided\";\n\n/**\n * All of the relations: rejected when one is, assignable when each is. The relations are computed\n * lazily, so a rejection stops the rest.\n */\nexport function everyOf<T>(\n  items: readonly T[],\n  relate: (item: T, index: number) => Assignability,\n): Assignability {\n  let result: Assignability = \"assignable\";\n  for (const [index, item] of items.entries()) {\n    const each = relate(item, index);\n    if (each === \"rejected\") {\n      return \"rejected\";\n    }\n    if (each === \"undecided\") {\n      result = \"undecided\";\n    }\n  }\n  return result;\n}\n\n/** One of the relations: assignable when one is, rejected when each is. */\nexport function someOf<T>(items: readonly T[], relate: (item: T) => Assignability): Assignability {\n  let result: Assignability = \"rejected\";\n  for (const item of items) {\n    const each = relate(item);\n    if (each === \"assignable\") {\n      return \"assignable\";\n    }\n    if (each === \"undecided\") {\n      result = \"undecided\";\n    }\n  }\n  return result;\n}\n\n/** Assignable when the condition holds, rejected when it does not. */\nexport function provenBy(condition: boolean): Assignability {\n  return condition ? \"assignable\" : \"rejected\";\n}\n\n/**\n * The kinds of resolved types the check tells apart. A type of one kind is never assignable to a\n * type of another, except that a primitive or a list may fit an object type (`string` fits\n * `{ length: number }`), which the check models only in part. `opaque` is any type it cannot\n * read.\n */\ntype TypeCategory = \"primitive\" | \"list\" | \"object\" | \"opaque\";\n\nfunction categoryOf(type: IrType): TypeCategory {\n  switch (type.kind) {\n    case \"keyword\":\n    case \"stringLiteral\":\n    case \"numberLiteral\":\n    case \"booleanLiteral\":\n      return \"primitive\";\n    case \"array\":\n    case \"tuple\":\n    case \"readonly\":\n      return \"list\";\n    case \"object\":\n      return \"object\";\n    default:\n      return \"opaque\";\n  }\n}\n\n/** Keywords that are no object: `{}` rejects them under `strictNullChecks`. */\nconst NO_OBJECT_KEYWORDS: ReadonlySet<string> = new Set([\"null\", \"undefined\", \"unknown\", \"never\"]);\n\n/**\n * The members of `ReadonlyArray` and `Array` in the TypeScript libraries up to ESNext. An object\n * type that needs a property of another name is no list; a numeric name may be a tuple element.\n */\nconst ARRAY_MEMBER_NAMES: ReadonlySet<string> = new Set([\n  \"length\",\n  \"toString\",\n  \"toLocaleString\",\n  \"pop\",\n  \"push\",\n  \"concat\",\n  \"join\",\n  \"reverse\",\n  \"shift\",\n  \"slice\",\n  \"sort\",\n  \"splice\",\n  \"unshift\",\n  \"indexOf\",\n  \"lastIndexOf\",\n  \"every\",\n  \"some\",\n  \"forEach\",\n  \"map\",\n  \"filter\",\n  \"reduce\",\n  \"reduceRight\",\n  \"find\",\n  \"findIndex\",\n  \"fill\",\n  \"copyWithin\",\n  \"entries\",\n  \"keys\",\n  \"values\",\n  \"includes\",\n  \"flatMap\",\n  \"flat\",\n  \"at\",\n  \"findLast\",\n  \"findLastIndex\",\n  \"toReversed\",\n  \"toSorted\",\n  \"toSpliced\",\n  \"with\",\n]);\n\nconst ARRAY_LENGTH = \"length\";\n/** A tuple element's name: `\"0\"`, `\"1\"`. */\nconst ELEMENT_NAME_RE = /^\\d+$/;\n\nfunction isListMemberName(name: string): boolean {\n  return ARRAY_MEMBER_NAMES.has(name) || ELEMENT_NAME_RE.test(name);\n}\n\n/**\n * Whether a list fits an object type. It does not when the object needs a property no list has\n * (TS2741), or when the object is a weak type and no list has one of its properties (TS2559).\n */\nfunction listToObject(target: IrObjectType): Assignability {\n  const properties = [...propertiesOf(target).values()];\n  const isForeign = (property: IrPropertySignature) => !isListMemberName(nameOf(property));\n  const needsForeign = properties.some((property) => !property.isOptional && isForeign(property));\n  const isWeak =\n    properties.length > 0 &&\n    indexSignaturesOf(target).length === 0 &&\n    properties.every((property) => property.isOptional);\n  return needsForeign || (isWeak && properties.every(isForeign)) ? \"rejected\" : \"undecided\";\n}\n\n/**\n * Whether a primitive fits an object type: `null`, `undefined` and `unknown` never do; any other\n * may (`{}`, `{ length: number }`), which is not modelled.\n */\nfunction primitiveToObject(source: IrType): Assignability {\n  const isNoObject = source.kind === \"keyword\" && NO_OBJECT_KEYWORDS.has(source.keyword);\n  return isNoObject ? \"rejected\" : \"undecided\";\n}\n\n/** An object type fits an array only with all of its members; `length` is the first it needs. */\nfunction objectToList(source: IrObjectType): Assignability {\n  return propertiesOf(source).has(ARRAY_LENGTH) ? \"undecided\" : \"rejected\";\n}\n\n/**\n * The relation of two types of different categories, or null when they are of the same one.\n * Primitive and list targets accept nothing of another category; see `TypeCategory`.\n */\nexport function crossCategoryRelation(source: IrType, target: IrType): Assignability | null {\n  const from = categoryOf(source);\n  const to = categoryOf(target);\n  if (from === \"opaque\" || to === \"opaque\") {\n    return \"undecided\";\n  }\n  if (from === to) {\n    return null;\n  }\n  if (to !== \"object\") {\n    return source.kind === \"object\" && to === \"list\" ? objectToList(source) : \"rejected\";\n  }\n  return from === \"primitive\" ? primitiveToObject(source) : listToObject(target as IrObjectType);\n}\n\n/** The keyword a literal type belongs to. */\nconst LITERAL_KEYWORDS = {\n  stringLiteral: \"string\",\n  numberLiteral: \"number\",\n  booleanLiteral: \"boolean\",\n} as const;\n\n/**\n * The relation of two primitive types written differently (the same text is assignable). A\n * literal fits its keyword; any other pair is rejected: different keywords, different literals,\n * a keyword for one literal (a union of literals is compared in `type-assignability.ts`), and\n * anything for `never`.\n */\nexport function primitiveRelation(source: IrType, target: IrType): Assignability {\n  if (target.kind !== \"keyword\" || source.kind === \"keyword\") {\n    return \"rejected\";\n  }\n  const keyword = (LITERAL_KEYWORDS as Partial<Record<IrType[\"kind\"], string>>)[source.kind];\n  return provenBy(keyword === target.keyword);\n}\n"],"names":[],"mappings":";;AAeO,SAAS,OAAA,CACd,OACA,MAAA,EACe;AACf,EAAA,IAAI,MAAA,GAAwB,YAAA;AAC5B,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,IAAI,CAAA,IAAK,KAAA,CAAM,SAAQ,EAAG;AAC3C,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,IAAA,EAAM,KAAK,CAAA;AAC/B,IAAA,IAAI,SAAS,UAAA,EAAY;AACvB,MAAA,OAAO,UAAA;AAAA,IACT;AACA,IAAA,IAAI,SAAS,WAAA,EAAa;AACxB,MAAA,MAAA,GAAS,WAAA;AAAA,IACX;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,MAAA,CAAU,OAAqB,MAAA,EAAmD;AAChG,EAAA,IAAI,MAAA,GAAwB,UAAA;AAC5B,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,IAAA,GAAO,OAAO,IAAI,CAAA;AACxB,IAAA,IAAI,SAAS,YAAA,EAAc;AACzB,MAAA,OAAO,YAAA;AAAA,IACT;AACA,IAAA,IAAI,SAAS,WAAA,EAAa;AACxB,MAAA,MAAA,GAAS,WAAA;AAAA,IACX;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,SAAS,SAAA,EAAmC;AAC1D,EAAA,OAAO,YAAY,YAAA,GAAe,UAAA;AACpC;AAUA,SAAS,WAAW,IAAA,EAA4B;AAC9C,EAAA,QAAQ,KAAK,IAAA;AAAM,IACjB,KAAK,SAAA;AAAA,IACL,KAAK,eAAA;AAAA,IACL,KAAK,eAAA;AAAA,IACL,KAAK,gBAAA;AACH,MAAA,OAAO,WAAA;AAAA,IACT,KAAK,OAAA;AAAA,IACL,KAAK,OAAA;AAAA,IACL,KAAK,UAAA;AACH,MAAA,OAAO,MAAA;AAAA,IACT,KAAK,QAAA;AACH,MAAA,OAAO,QAAA;AAAA,IACT;AACE,MAAA,OAAO,QAAA;AAAA;AAEb;AAGA,MAAM,kBAAA,uBAA8C,GAAA,CAAI,CAAC,QAAQ,WAAA,EAAa,SAAA,EAAW,OAAO,CAAC,CAAA;AAMjG,MAAM,kBAAA,uBAA8C,GAAA,CAAI;AAAA,EACtD,QAAA;AAAA,EACA,UAAA;AAAA,EACA,gBAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,QAAA;AAAA,EACA,MAAA;AAAA,EACA,SAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,QAAA;AAAA,EACA,SAAA;AAAA,EACA,SAAA;AAAA,EACA,aAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,SAAA;AAAA,EACA,KAAA;AAAA,EACA,QAAA;AAAA,EACA,QAAA;AAAA,EACA,aAAA;AAAA,EACA,MAAA;AAAA,EACA,WAAA;AAAA,EACA,MAAA;AAAA,EACA,YAAA;AAAA,EACA,SAAA;AAAA,EACA,MAAA;AAAA,EACA,QAAA;AAAA,EACA,UAAA;AAAA,EACA,SAAA;AAAA,EACA,MAAA;AAAA,EACA,IAAA;AAAA,EACA,UAAA;AAAA,EACA,eAAA;AAAA,EACA,YAAA;AAAA,EACA,UAAA;AAAA,EACA,WAAA;AAAA,EACA;AACF,CAAC,CAAA;AAED,MAAM,YAAA,GAAe,QAAA;AAErB,MAAM,eAAA,GAAkB,OAAA;AAExB,SAAS,iBAAiB,IAAA,EAAuB;AAC/C,EAAA,OAAO,mBAAmB,GAAA,CAAI,IAAI,CAAA,IAAK,eAAA,CAAgB,KAAK,IAAI,CAAA;AAClE;AAMA,SAAS,aAAa,MAAA,EAAqC;AACzD,EAAA,MAAM,aAAa,CAAC,GAAG,aAAa,MAAM,CAAA,CAAE,QAAQ,CAAA;AACpD,EAAA,MAAM,YAAY,CAAC,QAAA,KAAkC,CAAC,gBAAA,CAAiB,MAAA,CAAO,QAAQ,CAAC,CAAA;AACvF,EAAA,MAAM,YAAA,GAAe,UAAA,CAAW,IAAA,CAAK,CAAC,QAAA,KAAa,CAAC,QAAA,CAAS,UAAA,IAAc,SAAA,CAAU,QAAQ,CAAC,CAAA;AAC9F,EAAA,MAAM,MAAA,GACJ,UAAA,CAAW,MAAA,GAAS,CAAA,IACpB,kBAAkB,MAAM,CAAA,CAAE,MAAA,KAAW,CAAA,IACrC,UAAA,CAAW,KAAA,CAAM,CAAC,QAAA,KAAa,SAAS,UAAU,CAAA;AACpD,EAAA,OAAO,gBAAiB,MAAA,IAAU,UAAA,CAAW,KAAA,CAAM,SAAS,IAAK,UAAA,GAAa,WAAA;AAChF;AAMA,SAAS,kBAAkB,MAAA,EAA+B;AACxD,EAAA,MAAM,aAAa,MAAA,CAAO,IAAA,KAAS,aAAa,kBAAA,CAAmB,GAAA,CAAI,OAAO,OAAO,CAAA;AACrF,EAAA,OAAO,aAAa,UAAA,GAAa,WAAA;AACnC;AAGA,SAAS,aAAa,MAAA,EAAqC;AACzD,EAAA,OAAO,aAAa,MAAM,CAAA,CAAE,GAAA,CAAI,YAAY,IAAI,WAAA,GAAc,UAAA;AAChE;AAMO,SAAS,qBAAA,CAAsB,QAAgB,MAAA,EAAsC;AAC1F,EAAA,MAAM,IAAA,GAAO,WAAW,MAAM,CAAA;AAC9B,EAAA,MAAM,EAAA,GAAK,WAAW,MAAM,CAAA;AAC5B,EAAA,IAAI,IAAA,KAAS,QAAA,IAAY,EAAA,KAAO,QAAA,EAAU;AACxC,IAAA,OAAO,WAAA;AAAA,EACT;AACA,EAAA,IAAI,SAAS,EAAA,EAAI;AACf,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,OAAO,QAAA,EAAU;AACnB,IAAA,OAAO,OAAO,IAAA,KAAS,QAAA,IAAY,OAAO,MAAA,GAAS,YAAA,CAAa,MAAM,CAAA,GAAI,UAAA;AAAA,EAC5E;AACA,EAAA,OAAO,SAAS,WAAA,GAAc,iBAAA,CAAkB,MAAM,CAAA,GAAI,aAAa,MAAsB,CAAA;AAC/F;AAGA,MAAM,gBAAA,GAAmB;AAAA,EACvB,aAAA,EAAe,QAAA;AAAA,EACf,aAAA,EAAe,QAAA;AAAA,EACf,cAAA,EAAgB;AAClB,CAAA;AAQO,SAAS,iBAAA,CAAkB,QAAgB,MAAA,EAA+B;AAC/E,EAAA,IAAI,MAAA,CAAO,IAAA,KAAS,SAAA,IAAa,MAAA,CAAO,SAAS,SAAA,EAAW;AAC1D,IAAA,OAAO,UAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAA,GAAW,gBAAA,CAA6D,MAAA,CAAO,IAAI,CAAA;AACzF,EAAA,OAAO,QAAA,CAAS,OAAA,KAAY,MAAA,CAAO,OAAO,CAAA;AAC5C;;"}

package/dist/application/transform/document/components.cjs

@@ -0,0 +1,104 @@
+'use strict';
+
+const constructors = require('../../../domain/ir/constructors.cjs');
+const identifierText = require('../../../domain/ir/identifier-text.cjs');
+const propertyName = require('../../../domain/ir/property-name.cjs');
+const componentsObject = require('../../../domain/openapi/components-object.cjs');
+const jsonPointer = require('../../../domain/openapi/json-pointer.cjs');
+const outputFixes = require('../../../domain/output-fixes.cjs');
+const documentEntries = require('../document-entries.cjs');
+const schemaTransform = require('../schema/schema-transform.cjs');
+const schemaComment = require('../schema-comment.cjs');
+const header = require('./header.cjs');
+const mediaType = require('./media-type.cjs');
+const parameter = require('./parameter.cjs');
+const pathItem = require('./path-item.cjs');
+const requestBody = require('./request-body.cjs');
+const response = require('./response.cjs');
+const rootTypeAliases = require('./root-type-aliases.cjs');
+
+const COMPONENT_TRANSFORMS = {
+  schemas: schemaTransform.transformSchema,
+  responses: response.responseType,
+  parameters: parameter.parameterType,
+  requestBodies: requestBody.requestBodyType,
+  headers: header.headerType,
+  pathItems: pathItem.pathItemType,
+  mediaTypes: mediaType.contentEntryType
+};
+function componentMember(kind, name, item, context) {
+  const location = { path: jsonPointer.createRef(["components", kind, name]), schema: item };
+  const type = COMPONENT_TRANSFORMS[kind](item, location, context);
+  const custom = context.callbacks.transform(item, location);
+  const property = constructors.irProperty(propertyName.toPropertyName(name), custom?.type ?? type, {
+    isOptional: custom?.isOptional ?? false,
+    isReadonly: context.options.immutable
+  });
+  return schemaComment.withSchemaComment(property, item, schemaComment.schemaCommentOptionsOf(context.options.fixes));
+}
+function rootTypeName(kind, name, aliases, context) {
+  const { options, casing } = context;
+  const prefix = casing.pascalCase(componentsObject.singularizeComponentKind(kind));
+  const isSchema = kind === "schemas";
+  const base = identifierText.withIdentifierParts(
+    options.rootTypesKeepCasing && isSchema ? name : casing.pascalCase(name)
+  );
+  const exportedName = (alias2) => {
+    const unprefixed = alias2.replace(prefix, "");
+    const isUnprefixed = options.rootTypesNoSchemaPrefix && isSchema;
+    const isTypeName = identifierText.hasIdentifierStart(unprefixed) && !identifierText.isReservedTypeName(unprefixed);
+    return isUnprefixed && isTypeName ? unprefixed : alias2;
+  };
+  let alias = `${prefix}${base}`;
+  for (let counter = 2; aliases[alias] !== void 0; counter++) {
+    alias = `${prefix}${base}_${counter}`;
+  }
+  return exportedName(alias);
+}
+function addRootAlias(request, alias) {
+  const { aliases, displaced } = request;
+  const previous = aliases[alias.name];
+  if (previous !== void 0 && displaced !== null) {
+    displaced.push(previous);
+  }
+  aliases[alias.name] = alias;
+}
+function hasRootType(kind, item, context) {
+  const { options } = context;
+  return options.rootTypes && !(options.enum && kind === "schemas" && componentsObject.isEnumSchema(item));
+}
+function kindMember(kind, request, context) {
+  const { components, isKept, aliases } = request;
+  const startedAt = context.diagnostics.now();
+  const items = [];
+  for (const [name, item] of documentEntries.documentEntries(components[kind] ?? {}, context.options, isKept)) {
+    items.push(componentMember(kind, name, item, context));
+    if (hasRootType(kind, item, context)) {
+      addRootAlias(request, rootTypeAliases.rootTypeAlias(rootTypeName(kind, name, aliases, context), kind, name));
+    }
+  }
+  const type = items.length > 0 ? constructors.irObject(items) : constructors.irKeyword("never");
+  context.diagnostics.debug(
+    `Transformed components \u2192 ${kind}`,
+    context.diagnostics.now() - startedAt
+  );
+  return constructors.irProperty(propertyName.toPropertyName(kind), type);
+}
+function componentsType(components, context, kept = /* @__PURE__ */ new Set()) {
+  const aliases = {};
+  const displaced = context.options.fixes.has(outputFixes.OutputFix.ROOT_TYPE_NUMBERING) ? [] : null;
+  const isKept = (item) => kept.has(item);
+  const request = { components, isKept, aliases, displaced };
+  const declaredKinds = componentsObject.DECLARED_COMPONENT_KINDS.filter((kind) => components[kind] !== void 0);
+  const members = [...componentsObject.COMPONENT_KINDS, ...declaredKinds].map(
+    (kind) => kindMember(kind, request, context)
+  );
+  const rootTypes = Object.values(aliases);
+  return {
+    type: constructors.irObject(members),
+    rootTypes: [...rootTypes, ...displaced ?? []]
+  };
+}
+
+exports.componentsType = componentsType;
+//# sourceMappingURL=components.cjs.map

package/dist/application/transform/document/components.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"components.cjs","sources":["../../../../src/application/transform/document/components.ts"],"sourcesContent":["import { irKeyword, irObject, irProperty } from \"../../../domain/ir/constructors.js\";\nimport {\n  hasIdentifierStart,\n  isReservedTypeName,\n  withIdentifierParts,\n} from \"../../../domain/ir/identifier-text.js\";\nimport type {\n  IrPropertySignature,\n  IrType,\n  IrTypeAliasDeclaration,\n} from \"../../../domain/ir/nodes.js\";\nimport { toPropertyName } from \"../../../domain/ir/property-name.js\";\nimport {\n  COMPONENT_KINDS,\n  type ComponentKind,\n  type ComponentsObject,\n  DECLARED_COMPONENT_KINDS,\n  isEnumSchema,\n  singularizeComponentKind,\n} from \"../../../domain/openapi/components-object.js\";\nimport { createRef } from \"../../../domain/openapi/json-pointer.js\";\nimport { OutputFix } from \"../../../domain/output-fixes.js\";\nimport { type DeprecatedEntryFilter, documentEntries } from \"../document-entries.js\";\nimport type { SchemaLocation } from \"../schema/schema-context.js\";\nimport { transformSchema } from \"../schema/schema-transform.js\";\nimport { schemaCommentOptionsOf, withSchemaComment } from \"../schema-comment.js\";\nimport type { TransformContext } from \"../transform-context.js\";\nimport { headerType } from \"./header.js\";\nimport { contentEntryType } from \"./media-type.js\";\nimport { parameterType } from \"./parameter.js\";\nimport { pathItemType } from \"./path-item.js\";\nimport { requestBodyType } from \"./request-body.js\";\nimport { responseType } from \"./response.js\";\nimport { rootTypeAlias } from \"./root-type-aliases.js\";\n\ntype ComponentTransform = (\n  item: never,\n  location: SchemaLocation,\n  context: TransformContext,\n) => IrType;\n\nconst COMPONENT_TRANSFORMS: Readonly<Record<ComponentKind, ComponentTransform>> = {\n  schemas: transformSchema,\n  responses: responseType,\n  parameters: parameterType,\n  requestBodies: requestBodyType,\n  headers: headerType,\n  pathItems: pathItemType,\n  mediaTypes: contentEntryType,\n};\n\n/** The `components` type and the `--root-types` aliases. */\nexport interface ComponentsResult {\n  readonly type: IrType;\n  readonly rootTypes: readonly IrTypeAliasDeclaration[];\n}\n\n/** One component; the `transform` callback may replace its type, as for nested schemas. */\nfunction componentMember(\n  kind: ComponentKind,\n  name: string,\n  item: unknown,\n  context: TransformContext,\n): IrPropertySignature {\n  const location = { path: createRef([\"components\", kind, name]), schema: item };\n  const type = COMPONENT_TRANSFORMS[kind](item as never, location, context);\n  const custom = context.callbacks.transform(item, location);\n  const property = irProperty(toPropertyName(name), custom?.type ?? type, {\n    isOptional: custom?.isOptional ?? false,\n    isReadonly: context.options.immutable,\n  });\n  return withSchemaComment(property, item, schemaCommentOptionsOf(context.options.fixes));\n}\n\n/**\n * The root alias name: `SchemaPet`, `ResponseNotFound`, … A taken name gets `_2`, `_3`, … The\n * original checks for conflicts before it removes the schema prefix, and so does this; for a clash\n * of exported names see `addRootAlias`.\n *\n * The original could build a name that is no identifier, so the generated file did not parse\n * (research/legacy-bugs.md, item 16): a kept casing keeps spaces and symbols, which become `_`;\n * and a name without the prefix can start with a digit, so it keeps the prefix (`Schema1`). A\n * kept casing without the prefix can also give a reserved name (`void`, `class`), which keeps the\n * prefix too (`Schemavoid`).\n */\nfunction rootTypeName(\n  kind: ComponentKind,\n  name: string,\n  aliases: Readonly<Record<string, IrTypeAliasDeclaration>>,\n  context: TransformContext,\n): string {\n  const { options, casing } = context;\n  const prefix = casing.pascalCase(singularizeComponentKind(kind));\n  const isSchema = kind === \"schemas\";\n  const base = withIdentifierParts(\n    options.rootTypesKeepCasing && isSchema ? name : casing.pascalCase(name),\n  );\n  const exportedName = (alias: string): string => {\n    const unprefixed = alias.replace(prefix, \"\");\n    const isUnprefixed = options.rootTypesNoSchemaPrefix && isSchema;\n    const isTypeName = hasIdentifierStart(unprefixed) && !isReservedTypeName(unprefixed);\n    return isUnprefixed && isTypeName ? unprefixed : alias;\n  };\n  let alias = `${prefix}${base}`;\n  for (let counter = 2; aliases[alias] !== undefined; counter++) {\n    alias = `${prefix}${base}_${counter}`;\n  }\n  return exportedName(alias);\n}\n\n/**\n * Add a root alias. When its exported name is taken (two schemas of one PascalCase name without\n * the prefix), the later schema takes the name, as in the original. Without the\n * `root-type-numbering` fix the earlier one then has no alias: that output is valid, so a number\n * for it would change it (backlog 30). With the fix the earlier alias is kept aside and follows\n * the others under the same name; `renameTakenAliases` numbers it once every name is known.\n */\nfunction addRootAlias(request: ComponentsRequest, alias: IrTypeAliasDeclaration): void {\n  const { aliases, displaced } = request;\n  const previous = aliases[alias.name];\n  if (previous !== undefined && displaced !== null) {\n    displaced.push(previous);\n  }\n  aliases[alias.name] = alias;\n}\n\n/** `--root-types` skips enum schemas under `--enum`: the enum itself is exported. */\nfunction hasRootType(kind: ComponentKind, item: unknown, context: TransformContext): boolean {\n  const { options } = context;\n  return options.rootTypes && !(options.enum && kind === \"schemas\" && isEnumSchema(item));\n}\n\n/** The components of one run, and the deprecated ones that kept output still references. */\ninterface ComponentsRequest {\n  readonly components: ComponentsObject;\n  readonly isKept: DeprecatedEntryFilter;\n  readonly aliases: Record<string, IrTypeAliasDeclaration>;\n  /** With the `root-type-numbering` fix: the aliases a later schema took the name of, in order. */\n  readonly displaced: IrTypeAliasDeclaration[] | null;\n}\n\nfunction kindMember(\n  kind: ComponentKind,\n  request: ComponentsRequest,\n  context: TransformContext,\n): IrPropertySignature {\n  const { components, isKept, aliases } = request;\n  const startedAt = context.diagnostics.now();\n  const items: IrPropertySignature[] = [];\n  for (const [name, item] of documentEntries(components[kind] ?? {}, context.options, isKept)) {\n    items.push(componentMember(kind, name, item, context));\n    if (hasRootType(kind, item, context)) {\n      addRootAlias(request, rootTypeAlias(rootTypeName(kind, name, aliases, context), kind, name));\n    }\n  }\n  const type = items.length > 0 ? irObject(items) : irKeyword(\"never\");\n  context.diagnostics.debug(\n    `Transformed components → ${kind}`,\n    context.diagnostics.now() - startedAt,\n  );\n  return irProperty(toPropertyName(kind), type);\n}\n\n/**\n * The `components` interface body (OpenAPI 3.1 §4.8.7), one member per component kind. With\n * `--exclude-deprecated`, `kept` holds the deprecated components that kept output references\n * (`keptDeprecatedComponents`); they stay, so no reference names a missing key.\n */\nexport function componentsType(\n  components: ComponentsObject,\n  context: TransformContext,\n  kept: ReadonlySet<object> = new Set(),\n): ComponentsResult {\n  // A plain object, as in the original: its key order (integer-like names first) is the\n  // output order.\n  const aliases: Record<string, IrTypeAliasDeclaration> = {};\n  const displaced = context.options.fixes.has(OutputFix.ROOT_TYPE_NUMBERING) ? [] : null;\n  const isKept = (item: unknown) => kept.has(item as object);\n  const request = { components, isKept, aliases, displaced };\n  const declaredKinds = DECLARED_COMPONENT_KINDS.filter((kind) => components[kind] !== undefined);\n  const members = [...COMPONENT_KINDS, ...declaredKinds].map((kind) =>\n    kindMember(kind, request, context),\n  );\n  const rootTypes = Object.values(aliases);\n  return {\n    type: irObject(members),\n    rootTypes: [...rootTypes, ...(displaced ?? [])],\n  };\n}\n"],"names":["transformSchema","responseType","parameterType","requestBodyType","headerType","pathItemType","contentEntryType","createRef","irProperty","toPropertyName","withSchemaComment","schemaCommentOptionsOf","singularizeComponentKind","withIdentifierParts","alias","hasIdentifierStart","isReservedTypeName","isEnumSchema","documentEntries","rootTypeAlias","irObject","irKeyword","OutputFix","DECLARED_COMPONENT_KINDS","COMPONENT_KINDS"],"mappings":";;;;;;;;;;;;;;;;;;;AAyCA,MAAM,oBAAA,GAA4E;AAAA,EAChF,OAAA,EAASA,+BAAA;AAAA,EACT,SAAA,EAAWC,qBAAA;AAAA,EACX,UAAA,EAAYC,uBAAA;AAAA,EACZ,aAAA,EAAeC,2BAAA;AAAA,EACf,OAAA,EAASC,iBAAA;AAAA,EACT,SAAA,EAAWC,qBAAA;AAAA,EACX,UAAA,EAAYC;AACd,CAAA;AASA,SAAS,eAAA,CACP,IAAA,EACA,IAAA,EACA,IAAA,EACA,OAAA,EACqB;AACrB,EAAA,MAAM,QAAA,GAAW,EAAE,IAAA,EAAMC,qBAAA,CAAU,CAAC,YAAA,EAAc,IAAA,EAAM,IAAI,CAAC,CAAA,EAAG,MAAA,EAAQ,IAAA,EAAK;AAC7E,EAAA,MAAM,OAAO,oBAAA,CAAqB,IAAI,CAAA,CAAE,IAAA,EAAe,UAAU,OAAO,CAAA;AACxE,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,SAAA,CAAU,SAAA,CAAU,MAAM,QAAQ,CAAA;AACzD,EAAA,MAAM,WAAWC,uBAAA,CAAWC,2BAAA,CAAe,IAAI,CAAA,EAAG,MAAA,EAAQ,QAAQ,IAAA,EAAM;AAAA,IACtE,UAAA,EAAY,QAAQ,UAAA,IAAc,KAAA;AAAA,IAClC,UAAA,EAAY,QAAQ,OAAA,CAAQ;AAAA,GAC7B,CAAA;AACD,EAAA,OAAOC,gCAAkB,QAAA,EAAU,IAAA,EAAMC,qCAAuB,OAAA,CAAQ,OAAA,CAAQ,KAAK,CAAC,CAAA;AACxF;AAaA,SAAS,YAAA,CACP,IAAA,EACA,IAAA,EACA,OAAA,EACA,OAAA,EACQ;AACR,EAAA,MAAM,EAAE,OAAA,EAAS,MAAA,EAAO,GAAI,OAAA;AAC5B,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,UAAA,CAAWC,yCAAA,CAAyB,IAAI,CAAC,CAAA;AAC/D,EAAA,MAAM,WAAW,IAAA,KAAS,SAAA;AAC1B,EAAA,MAAM,IAAA,GAAOC,kCAAA;AAAA,IACX,QAAQ,mBAAA,IAAuB,QAAA,GAAW,IAAA,GAAO,MAAA,CAAO,WAAW,IAAI;AAAA,GACzE;AACA,EAAA,MAAM,YAAA,GAAe,CAACC,MAAAA,KAA0B;AAC9C,IAAA,MAAM,UAAA,GAAaA,MAAAA,CAAM,OAAA,CAAQ,MAAA,EAAQ,EAAE,CAAA;AAC3C,IAAA,MAAM,YAAA,GAAe,QAAQ,uBAAA,IAA2B,QAAA;AACxD,IAAA,MAAM,aAAaC,iCAAA,CAAmB,UAAU,CAAA,IAAK,CAACC,kCAAmB,UAAU,CAAA;AACnF,IAAA,OAAO,YAAA,IAAgB,aAAa,UAAA,GAAaF,MAAAA;AAAA,EACnD,CAAA;AACA,EAAA,IAAI,KAAA,GAAQ,CAAA,EAAG,MAAM,CAAA,EAAG,IAAI,CAAA,CAAA;AAC5B,EAAA,KAAA,IAAS,UAAU,CAAA,EAAG,OAAA,CAAQ,KAAK,CAAA,KAAM,QAAW,OAAA,EAAA,EAAW;AAC7D,IAAA,KAAA,GAAQ,CAAA,EAAG,MAAM,CAAA,EAAG,IAAI,IAAI,OAAO,CAAA,CAAA;AAAA,EACrC;AACA,EAAA,OAAO,aAAa,KAAK,CAAA;AAC3B;AASA,SAAS,YAAA,CAAa,SAA4B,KAAA,EAAqC;AACrF,EAAA,MAAM,EAAE,OAAA,EAAS,SAAA,EAAU,GAAI,OAAA;AAC/B,EAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,KAAA,CAAM,IAAI,CAAA;AACnC,EAAA,IAAI,QAAA,KAAa,MAAA,IAAa,SAAA,KAAc,IAAA,EAAM;AAChD,IAAA,SAAA,CAAU,KAAK,QAAQ,CAAA;AAAA,EACzB;AACA,EAAA,OAAA,CAAQ,KAAA,CAAM,IAAI,CAAA,GAAI,KAAA;AACxB;AAGA,SAAS,WAAA,CAAY,IAAA,EAAqB,IAAA,EAAe,OAAA,EAAoC;AAC3F,EAAA,MAAM,EAAE,SAAQ,GAAI,OAAA;AACpB,EAAA,OAAO,OAAA,CAAQ,aAAa,EAAE,OAAA,CAAQ,QAAQ,IAAA,KAAS,SAAA,IAAaG,8BAAa,IAAI,CAAA,CAAA;AACvF;AAWA,SAAS,UAAA,CACP,IAAA,EACA,OAAA,EACA,OAAA,EACqB;AACrB,EAAA,MAAM,EAAE,UAAA,EAAY,MAAA,EAAQ,OAAA,EAAQ,GAAI,OAAA;AACxC,EAAA,MAAM,SAAA,GAAY,OAAA,CAAQ,WAAA,CAAY,GAAA,EAAI;AAC1C,EAAA,MAAM,QAA+B,EAAC;AACtC,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,CAAA,IAAKC,+BAAA,CAAgB,UAAA,CAAW,IAAI,CAAA,IAAK,EAAC,EAAG,OAAA,CAAQ,OAAA,EAAS,MAAM,CAAA,EAAG;AAC3F,IAAA,KAAA,CAAM,KAAK,eAAA,CAAgB,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,OAAO,CAAC,CAAA;AACrD,IAAA,IAAI,WAAA,CAAY,IAAA,EAAM,IAAA,EAAM,OAAO,CAAA,EAAG;AACpC,MAAA,YAAA,CAAa,OAAA,EAASC,6BAAA,CAAc,YAAA,CAAa,IAAA,EAAM,IAAA,EAAM,SAAS,OAAO,CAAA,EAAG,IAAA,EAAM,IAAI,CAAC,CAAA;AAAA,IAC7F;AAAA,EACF;AACA,EAAA,MAAM,IAAA,GAAO,MAAM,MAAA,GAAS,CAAA,GAAIC,sBAAS,KAAK,CAAA,GAAIC,uBAAU,OAAO,CAAA;AACnE,EAAA,OAAA,CAAQ,WAAA,CAAY,KAAA;AAAA,IAClB,iCAA4B,IAAI,CAAA,CAAA;AAAA,IAChC,OAAA,CAAQ,WAAA,CAAY,GAAA,EAAI,GAAI;AAAA,GAC9B;AACA,EAAA,OAAOb,uBAAA,CAAWC,2BAAA,CAAe,IAAI,CAAA,EAAG,IAAI,CAAA;AAC9C;AAOO,SAAS,eACd,UAAA,EACA,OAAA,EACA,IAAA,mBAA4B,IAAI,KAAI,EAClB;AAGlB,EAAA,MAAM,UAAkD,EAAC;AACzD,EAAA,MAAM,SAAA,GAAY,QAAQ,OAAA,CAAQ,KAAA,CAAM,IAAIa,qBAAA,CAAU,mBAAmB,CAAA,GAAI,EAAC,GAAI,IAAA;AAClF,EAAA,MAAM,MAAA,GAAS,CAAC,IAAA,KAAkB,IAAA,CAAK,IAAI,IAAc,CAAA;AACzD,EAAA,MAAM,OAAA,GAAU,EAAE,UAAA,EAAY,MAAA,EAAQ,SAAS,SAAA,EAAU;AACzD,EAAA,MAAM,aAAA,GAAgBC,0CAAyB,MAAA,CAAO,CAAC,SAAS,UAAA,CAAW,IAAI,MAAM,MAAS,CAAA;AAC9F,EAAA,MAAM,UAAU,CAAC,GAAGC,gCAAA,EAAiB,GAAG,aAAa,CAAA,CAAE,GAAA;AAAA,IAAI,CAAC,IAAA,KAC1D,UAAA,CAAW,IAAA,EAAM,SAAS,OAAO;AAAA,GACnC;AACA,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,MAAA,CAAO,OAAO,CAAA;AACvC,EAAA,OAAO;AAAA,IACL,IAAA,EAAMJ,sBAAS,OAAO,CAAA;AAAA,IACtB,WAAW,CAAC,GAAG,WAAW,GAAI,SAAA,IAAa,EAAG;AAAA,GAChD;AACF;;"}