openapi-typesafe 0.0.0 → 1.0.0-rc.0

package/dist/application/transform/helper-types.mjs

@@ -0,0 +1,65 @@
+function lines(...parts) {
+  return parts.join("\n");
+}
+const HELPER_TYPES = {
+  withRequired: {
+    name: "WithRequired",
+    text: lines("type WithRequired<T, K extends keyof T> = T & {", "    [P in K]-?: T[P];", "};")
+  },
+  // `unevaluated-properties` (roadmap R11): the value types of every member of a union, so a
+  // `$ref` to a `oneOf` schema gives the values of each variant, not only of the shared keys.
+  propertyValues: {
+    name: "PropertyValues",
+    text: "type PropertyValues<T> = T extends unknown ? T[keyof T] : never;"
+  },
+  // Task 7.4 changes the original text on purpose: `readonly unknown[]` also flattens the arrays
+  // of `--immutable` (upstream #2714, #2749), and `NonNullable` looks through nullable parents
+  // (upstream #2737). The old text did not compile for those schemas.
+  flattenedDeepRequired: {
+    name: "FlattenedDeepRequired",
+    text: lines(
+      "type FlattenedDeepRequired<T> = {",
+      "    [K in keyof T]-?: FlattenedDeepRequired<T[K] extends readonly unknown[] | undefined | null ? Extract<T[K], readonly unknown[]>[number] : NonNullable<T[K]>>;",
+      "};"
+    )
+  },
+  // `readonly unknown[]`: a readonly array value type stays as is (upstream #2749).
+  readonlyArray: {
+    name: "ReadonlyArray",
+    text: lines(
+      "type ReadonlyArray<T> = [",
+      "    Exclude<T, undefined>",
+      "] extends [",
+      "    readonly unknown[]",
+      "] ? Readonly<Exclude<T, undefined>> : Readonly<Exclude<T, undefined>[]>;"
+    )
+  }
+};
+const READ_WRITE_MARKER_TYPES = lines(
+  "export type $Read<T> = {",
+  "    readonly $read: T;",
+  "};",
+  "export type $Write<T> = {",
+  "    readonly $write: T;",
+  "};",
+  "type ReadWritePrimitive = string | number | boolean | bigint | symbol | null | undefined;",
+  "type ReadWriteLeaf = ReadWritePrimitive | ((...args: never) => unknown);",
+  "type ReadWriteMarkedKeys<T, Marker> = {",
+  "    [K in keyof T]-?: NonNullable<T[K]> extends never ? never : NonNullable<T[K]> extends Marker ? K : never;",
+  "}[keyof T];",
+  'type ReadWriteResolveArray<T extends readonly unknown[], Resolved extends "read" | "write"> = T[number][] extends T ? T extends unknown[] ? ReadWriteResolve<T[number], Resolved>[] : readonly ReadWriteResolve<T[number], Resolved>[] : {',
+  "    [K in keyof T]: ReadWriteResolve<T[K], Resolved>;",
+  "};",
+  'type ReadWriteResolve<T, Resolved extends "read" | "write"> = Resolved extends "read" ? Readable<T> : Writable<T>;',
+  'export type Readable<T> = T extends $Write<any> ? never : T extends $Read<infer U> ? Readable<U> : T extends ReadWriteLeaf ? T : T extends readonly unknown[] ? ReadWriteResolveArray<T, "read"> : T extends object ? {',
+  "    [K in keyof T as K extends ReadWriteMarkedKeys<T, $Write<any>> ? never : K]: Readable<T[K]>;",
+  "} : T;",
+  'export type Writable<T> = T extends $Read<any> ? never : T extends $Write<infer U> ? Writable<U> : T extends ReadWriteLeaf ? T : T extends readonly unknown[] ? ReadWriteResolveArray<T, "write"> : T extends object ? {',
+  "    [K in keyof T as K extends ReadWriteMarkedKeys<T, $Read<any>> ? never : K]: Writable<T[K]>;",
+  "} & {",
+  "    [K in ReadWriteMarkedKeys<T, $Read<any>>]?: never;",
+  "} : T;"
+);
+
+export { HELPER_TYPES, READ_WRITE_MARKER_TYPES };
+//# sourceMappingURL=helper-types.mjs.map

package/dist/application/transform/helper-types.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"helper-types.mjs","sources":["../../../src/application/transform/helper-types.ts"],"sourcesContent":["/**\n * The helper type aliases the generator adds to the footer, declared once each. The text is the\n * original's source text as the TypeScript printer printed it, so printing it as written gives\n * the original output (ENGINEERING_PLAN 6.2 and 6.6), except for the fixes noted below.\n */\nexport interface HelperType {\n  readonly name: string;\n  readonly text: string;\n}\n\nfunction lines(...parts: readonly string[]): string {\n  return parts.join(\"\\n\");\n}\n\nexport const HELPER_TYPES = {\n  withRequired: {\n    name: \"WithRequired\",\n    text: lines(\"type WithRequired<T, K extends keyof T> = T & {\", \"    [P in K]-?: T[P];\", \"};\"),\n  },\n  // `unevaluated-properties` (roadmap R11): the value types of every member of a union, so a\n  // `$ref` to a `oneOf` schema gives the values of each variant, not only of the shared keys.\n  propertyValues: {\n    name: \"PropertyValues\",\n    text: \"type PropertyValues<T> = T extends unknown ? T[keyof T] : never;\",\n  },\n  // Task 7.4 changes the original text on purpose: `readonly unknown[]` also flattens the arrays\n  // of `--immutable` (upstream #2714, #2749), and `NonNullable` looks through nullable parents\n  // (upstream #2737). The old text did not compile for those schemas.\n  flattenedDeepRequired: {\n    name: \"FlattenedDeepRequired\",\n    text: lines(\n      \"type FlattenedDeepRequired<T> = {\",\n      \"    [K in keyof T]-?: FlattenedDeepRequired<T[K] extends readonly unknown[] | undefined | \" +\n        \"null ? Extract<T[K], readonly unknown[]>[number] : NonNullable<T[K]>>;\",\n      \"};\",\n    ),\n  },\n  // `readonly unknown[]`: a readonly array value type stays as is (upstream #2749).\n  readonlyArray: {\n    name: \"ReadonlyArray\",\n    text: lines(\n      \"type ReadonlyArray<T> = [\",\n      \"    Exclude<T, undefined>\",\n      \"] extends [\",\n      \"    readonly unknown[]\",\n      \"] ? Readonly<Exclude<T, undefined>> : Readonly<Exclude<T, undefined>[]>;\",\n    ),\n  },\n} as const satisfies Readonly<Record<string, HelperType>>;\n\n/**\n * The `--read-write-markers` helper types, written before the root types. Task 7.6 replaces the\n * original text on purpose (ADR-014): primitives (also branded), readonly arrays, tuples,\n * intersected arrays and null-only properties keep their types (upstream #2615, #2620, #2632,\n * #2717, #2765). The declarations equal `Readable` / `Writable` of openapi-typesafe-helpers\n * (`test/api/read-write-marker-types.test.ts`); the text is what the TypeScript printer prints.\n */\nexport const READ_WRITE_MARKER_TYPES = lines(\n  \"export type $Read<T> = {\",\n  \"    readonly $read: T;\",\n  \"};\",\n  \"export type $Write<T> = {\",\n  \"    readonly $write: T;\",\n  \"};\",\n  \"type ReadWritePrimitive = string | number | boolean | bigint | symbol | null | undefined;\",\n  \"type ReadWriteLeaf = ReadWritePrimitive | ((...args: never) => unknown);\",\n  \"type ReadWriteMarkedKeys<T, Marker> = {\",\n  \"    [K in keyof T]-?: NonNullable<T[K]> extends never ? never : NonNullable<T[K]> \" +\n    \"extends Marker ? K : never;\",\n  \"}[keyof T];\",\n  'type ReadWriteResolveArray<T extends readonly unknown[], Resolved extends \"read\" | ' +\n    '\"write\"> = T[number][] extends T ? T extends unknown[] ? ReadWriteResolve<T[number], ' +\n    \"Resolved>[] : readonly ReadWriteResolve<T[number], Resolved>[] : {\",\n  \"    [K in keyof T]: ReadWriteResolve<T[K], Resolved>;\",\n  \"};\",\n  'type ReadWriteResolve<T, Resolved extends \"read\" | \"write\"> = Resolved extends \"read\" ? ' +\n    \"Readable<T> : Writable<T>;\",\n  \"export type Readable<T> = T extends $Write<any> ? never : T extends $Read<infer U> ? \" +\n    \"Readable<U> : T extends ReadWriteLeaf ? T : T extends readonly unknown[] ? \" +\n    'ReadWriteResolveArray<T, \"read\"> : T extends object ? {',\n  \"    [K in keyof T as K extends ReadWriteMarkedKeys<T, $Write<any>> ? never : K]: \" +\n    \"Readable<T[K]>;\",\n  \"} : T;\",\n  \"export type Writable<T> = T extends $Read<any> ? never : T extends $Write<infer U> ? \" +\n    \"Writable<U> : T extends ReadWriteLeaf ? T : T extends readonly unknown[] ? \" +\n    'ReadWriteResolveArray<T, \"write\"> : T extends object ? {',\n  \"    [K in keyof T as K extends ReadWriteMarkedKeys<T, $Read<any>> ? never : K]: \" +\n    \"Writable<T[K]>;\",\n  \"} & {\",\n  \"    [K in ReadWriteMarkedKeys<T, $Read<any>>]?: never;\",\n  \"} : T;\",\n);\n"],"names":[],"mappings":"AAUA,SAAS,SAAS,KAAA,EAAkC;AAClD,EAAA,OAAO,KAAA,CAAM,KAAK,IAAI,CAAA;AACxB;AAEO,MAAM,YAAA,GAAe;AAAA,EAC1B,YAAA,EAAc;AAAA,IACZ,IAAA,EAAM,cAAA;AAAA,IACN,IAAA,EAAM,KAAA,CAAM,iDAAA,EAAmD,uBAAA,EAAyB,IAAI;AAAA,GAC9F;AAAA;AAAA;AAAA,EAGA,cAAA,EAAgB;AAAA,IACd,IAAA,EAAM,gBAAA;AAAA,IACN,IAAA,EAAM;AAAA,GACR;AAAA;AAAA;AAAA;AAAA,EAIA,qBAAA,EAAuB;AAAA,IACrB,IAAA,EAAM,uBAAA;AAAA,IACN,IAAA,EAAM,KAAA;AAAA,MACJ,mCAAA;AAAA,MACA,kKAAA;AAAA,MAEA;AAAA;AACF,GACF;AAAA;AAAA,EAEA,aAAA,EAAe;AAAA,IACb,IAAA,EAAM,eAAA;AAAA,IACN,IAAA,EAAM,KAAA;AAAA,MACJ,2BAAA;AAAA,MACA,2BAAA;AAAA,MACA,aAAA;AAAA,MACA,wBAAA;AAAA,MACA;AAAA;AACF;AAEJ;AASO,MAAM,uBAAA,GAA0B,KAAA;AAAA,EACrC,0BAAA;AAAA,EACA,wBAAA;AAAA,EACA,IAAA;AAAA,EACA,2BAAA;AAAA,EACA,yBAAA;AAAA,EACA,IAAA;AAAA,EACA,2FAAA;AAAA,EACA,0EAAA;AAAA,EACA,yCAAA;AAAA,EACA,+GAAA;AAAA,EAEA,aAAA;AAAA,EACA,4OAAA;AAAA,EAGA,uDAAA;AAAA,EACA,IAAA;AAAA,EACA,oHAAA;AAAA,EAEA,yNAAA;AAAA,EAGA,kGAAA;AAAA,EAEA,QAAA;AAAA,EACA,0NAAA;AAAA,EAGA,iGAAA;AAAA,EAEA,OAAA;AAAA,EACA,wDAAA;AAAA,EACA;AACF;;"}

package/dist/application/transform/literal-type.cjs

@@ -0,0 +1,36 @@
+'use strict';
+
+const constructors = require('../../domain/ir/constructors.cjs');
+const propertyName = require('../../domain/ir/property-name.cjs');
+const sharedTypes = require('./shared-types.cjs');
+
+function objectLiteralType(value) {
+  const members = Object.entries(value).map(
+    ([key, entry]) => constructors.irProperty(propertyName.toPropertyName(key), literalType(entry))
+  );
+  return members.length > 0 ? constructors.irObject(members) : constructors.irRecord(constructors.irKeyword("string"), constructors.irKeyword("never"));
+}
+function arrayLiteralType(value) {
+  return value.length === 0 ? constructors.irArray(constructors.irKeyword("never")) : constructors.irTuple(value.map((item) => constructors.irTupleElement(literalType(item))));
+}
+function literalType(value) {
+  if (typeof value === "string") {
+    return constructors.irString(value, "json");
+  }
+  if (typeof value === "number") {
+    return Number.isFinite(value) ? constructors.irNumber(value) : constructors.irRaw(String(value));
+  }
+  if (typeof value === "boolean") {
+    return constructors.irBoolean(value);
+  }
+  if (value === null) {
+    return constructors.irKeyword("null");
+  }
+  if (Array.isArray(value)) {
+    return arrayLiteralType(value);
+  }
+  return typeof value === "object" ? objectLiteralType(value) : sharedTypes.UNKNOWN_TYPE;
+}
+
+exports.literalType = literalType;
+//# sourceMappingURL=literal-type.cjs.map

package/dist/application/transform/literal-type.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"literal-type.cjs","sources":["../../../src/application/transform/literal-type.ts"],"sourcesContent":["import {\n  irArray,\n  irBoolean,\n  irKeyword,\n  irNumber,\n  irObject,\n  irProperty,\n  irRaw,\n  irRecord,\n  irString,\n  irTuple,\n  irTupleElement,\n} from \"../../domain/ir/constructors.js\";\nimport type { IrType } from \"../../domain/ir/nodes.js\";\nimport { toPropertyName } from \"../../domain/ir/property-name.js\";\nimport { UNKNOWN_TYPE } from \"./shared-types.js\";\n\nfunction objectLiteralType(value: object): IrType {\n  const members = Object.entries(value).map(([key, entry]) =>\n    irProperty(toPropertyName(key), literalType(entry)),\n  );\n  return members.length > 0 ? irObject(members) : irRecord(irKeyword(\"string\"), irKeyword(\"never\"));\n}\n\nfunction arrayLiteralType(value: readonly unknown[]): IrType {\n  return value.length === 0\n    ? irArray(irKeyword(\"never\"))\n    : irTuple(value.map((item) => irTupleElement(literalType(item))));\n}\n\n/**\n * The literal type of a JSON value (the original `tsLiteral`): strings as JSON text, arrays as\n * tuples (an empty one as `never[]`), objects as object types (an empty one as\n * `Record<string, never>`), and anything else (`undefined`, functions) as `unknown`.\n */\nexport function literalType(value: unknown): IrType {\n  if (typeof value === \"string\") {\n    return irString(value, \"json\");\n  }\n  if (typeof value === \"number\") {\n    // YAML `.nan` and `.inf` have no literal type; the original prints them as `NaN`, `-Infinity`.\n    return Number.isFinite(value) ? irNumber(value) : irRaw(String(value));\n  }\n  if (typeof value === \"boolean\") {\n    return irBoolean(value);\n  }\n  if (value === null) {\n    return irKeyword(\"null\");\n  }\n  if (Array.isArray(value)) {\n    return arrayLiteralType(value);\n  }\n  return typeof value === \"object\" ? objectLiteralType(value) : UNKNOWN_TYPE;\n}\n"],"names":["irProperty","toPropertyName","irObject","irRecord","irKeyword","irArray","irTuple","irTupleElement","irString","irNumber","irRaw","irBoolean","UNKNOWN_TYPE"],"mappings":";;;;;;AAiBA,SAAS,kBAAkB,KAAA,EAAuB;AAChD,EAAA,MAAM,OAAA,GAAU,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,CAAE,GAAA;AAAA,IAAI,CAAC,CAAC,GAAA,EAAK,KAAK,CAAA,KACpDA,uBAAA,CAAWC,2BAAA,CAAe,GAAG,CAAA,EAAG,WAAA,CAAY,KAAK,CAAC;AAAA,GACpD;AACA,EAAA,OAAO,OAAA,CAAQ,MAAA,GAAS,CAAA,GAAIC,qBAAA,CAAS,OAAO,CAAA,GAAIC,qBAAA,CAASC,sBAAA,CAAU,QAAQ,CAAA,EAAGA,sBAAA,CAAU,OAAO,CAAC,CAAA;AAClG;AAEA,SAAS,iBAAiB,KAAA,EAAmC;AAC3D,EAAA,OAAO,MAAM,MAAA,KAAW,CAAA,GACpBC,qBAAQD,sBAAA,CAAU,OAAO,CAAC,CAAA,GAC1BE,oBAAA,CAAQ,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAASC,2BAAA,CAAe,YAAY,IAAI,CAAC,CAAC,CAAC,CAAA;AACpE;AAOO,SAAS,YAAY,KAAA,EAAwB;AAClD,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,IAAA,OAAOC,qBAAA,CAAS,OAAO,MAAM,CAAA;AAAA,EAC/B;AACA,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAE7B,IAAA,OAAO,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,GAAIC,qBAAA,CAAS,KAAK,CAAA,GAAIC,kBAAA,CAAM,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,EACvE;AACA,EAAA,IAAI,OAAO,UAAU,SAAA,EAAW;AAC9B,IAAA,OAAOC,uBAAU,KAAK,CAAA;AAAA,EACxB;AACA,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,OAAOP,uBAAU,MAAM,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,iBAAiB,KAAK,CAAA;AAAA,EAC/B;AACA,EAAA,OAAO,OAAO,KAAA,KAAU,QAAA,GAAW,iBAAA,CAAkB,KAAK,CAAA,GAAIQ,wBAAA;AAChE;;"}

package/dist/application/transform/literal-type.mjs

@@ -0,0 +1,34 @@
+import { irString, irNumber, irRaw, irBoolean, irKeyword, irArray, irTuple, irTupleElement, irProperty, irObject, irRecord } from '../../domain/ir/constructors.mjs';
+import { toPropertyName } from '../../domain/ir/property-name.mjs';
+import { UNKNOWN_TYPE } from './shared-types.mjs';
+
+function objectLiteralType(value) {
+  const members = Object.entries(value).map(
+    ([key, entry]) => irProperty(toPropertyName(key), literalType(entry))
+  );
+  return members.length > 0 ? irObject(members) : irRecord(irKeyword("string"), irKeyword("never"));
+}
+function arrayLiteralType(value) {
+  return value.length === 0 ? irArray(irKeyword("never")) : irTuple(value.map((item) => irTupleElement(literalType(item))));
+}
+function literalType(value) {
+  if (typeof value === "string") {
+    return irString(value, "json");
+  }
+  if (typeof value === "number") {
+    return Number.isFinite(value) ? irNumber(value) : irRaw(String(value));
+  }
+  if (typeof value === "boolean") {
+    return irBoolean(value);
+  }
+  if (value === null) {
+    return irKeyword("null");
+  }
+  if (Array.isArray(value)) {
+    return arrayLiteralType(value);
+  }
+  return typeof value === "object" ? objectLiteralType(value) : UNKNOWN_TYPE;
+}
+
+export { literalType };
+//# sourceMappingURL=literal-type.mjs.map

package/dist/application/transform/literal-type.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"literal-type.mjs","sources":["../../../src/application/transform/literal-type.ts"],"sourcesContent":["import {\n  irArray,\n  irBoolean,\n  irKeyword,\n  irNumber,\n  irObject,\n  irProperty,\n  irRaw,\n  irRecord,\n  irString,\n  irTuple,\n  irTupleElement,\n} from \"../../domain/ir/constructors.js\";\nimport type { IrType } from \"../../domain/ir/nodes.js\";\nimport { toPropertyName } from \"../../domain/ir/property-name.js\";\nimport { UNKNOWN_TYPE } from \"./shared-types.js\";\n\nfunction objectLiteralType(value: object): IrType {\n  const members = Object.entries(value).map(([key, entry]) =>\n    irProperty(toPropertyName(key), literalType(entry)),\n  );\n  return members.length > 0 ? irObject(members) : irRecord(irKeyword(\"string\"), irKeyword(\"never\"));\n}\n\nfunction arrayLiteralType(value: readonly unknown[]): IrType {\n  return value.length === 0\n    ? irArray(irKeyword(\"never\"))\n    : irTuple(value.map((item) => irTupleElement(literalType(item))));\n}\n\n/**\n * The literal type of a JSON value (the original `tsLiteral`): strings as JSON text, arrays as\n * tuples (an empty one as `never[]`), objects as object types (an empty one as\n * `Record<string, never>`), and anything else (`undefined`, functions) as `unknown`.\n */\nexport function literalType(value: unknown): IrType {\n  if (typeof value === \"string\") {\n    return irString(value, \"json\");\n  }\n  if (typeof value === \"number\") {\n    // YAML `.nan` and `.inf` have no literal type; the original prints them as `NaN`, `-Infinity`.\n    return Number.isFinite(value) ? irNumber(value) : irRaw(String(value));\n  }\n  if (typeof value === \"boolean\") {\n    return irBoolean(value);\n  }\n  if (value === null) {\n    return irKeyword(\"null\");\n  }\n  if (Array.isArray(value)) {\n    return arrayLiteralType(value);\n  }\n  return typeof value === \"object\" ? objectLiteralType(value) : UNKNOWN_TYPE;\n}\n"],"names":[],"mappings":";;;;AAiBA,SAAS,kBAAkB,KAAA,EAAuB;AAChD,EAAA,MAAM,OAAA,GAAU,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,CAAE,GAAA;AAAA,IAAI,CAAC,CAAC,GAAA,EAAK,KAAK,CAAA,KACpD,UAAA,CAAW,cAAA,CAAe,GAAG,CAAA,EAAG,WAAA,CAAY,KAAK,CAAC;AAAA,GACpD;AACA,EAAA,OAAO,OAAA,CAAQ,MAAA,GAAS,CAAA,GAAI,QAAA,CAAS,OAAO,CAAA,GAAI,QAAA,CAAS,SAAA,CAAU,QAAQ,CAAA,EAAG,SAAA,CAAU,OAAO,CAAC,CAAA;AAClG;AAEA,SAAS,iBAAiB,KAAA,EAAmC;AAC3D,EAAA,OAAO,MAAM,MAAA,KAAW,CAAA,GACpB,QAAQ,SAAA,CAAU,OAAO,CAAC,CAAA,GAC1B,OAAA,CAAQ,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,cAAA,CAAe,YAAY,IAAI,CAAC,CAAC,CAAC,CAAA;AACpE;AAOO,SAAS,YAAY,KAAA,EAAwB;AAClD,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,IAAA,OAAO,QAAA,CAAS,OAAO,MAAM,CAAA;AAAA,EAC/B;AACA,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAE7B,IAAA,OAAO,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,GAAI,QAAA,CAAS,KAAK,CAAA,GAAI,KAAA,CAAM,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,EACvE;AACA,EAAA,IAAI,OAAO,UAAU,SAAA,EAAW;AAC9B,IAAA,OAAO,UAAU,KAAK,CAAA;AAAA,EACxB;AACA,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,OAAO,UAAU,MAAM,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,iBAAiB,KAAK,CAAA;AAAA,EAC/B;AACA,EAAA,OAAO,OAAO,KAAA,KAAU,QAAA,GAAW,iBAAA,CAAkB,KAAK,CAAA,GAAI,YAAA;AAChE;;"}

package/dist/application/transform/numbered-names.cjs

@@ -0,0 +1,18 @@
+'use strict';
+
+function withNumberedRepeats(names, numbered) {
+  const written = new Set(names);
+  const taken = /* @__PURE__ */ new Set();
+  return names.map((name) => {
+    let unique = name;
+    for (let count = 2; taken.has(unique); count += 1) {
+      const candidate = numbered(name, count);
+      unique = written.has(candidate) ? unique : candidate;
+    }
+    taken.add(unique);
+    return unique;
+  });
+}
+
+exports.withNumberedRepeats = withNumberedRepeats;
+//# sourceMappingURL=numbered-names.cjs.map

package/dist/application/transform/numbered-names.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"numbered-names.cjs","sources":["../../../src/application/transform/numbered-names.ts"],"sourcesContent":["/** Builds the name for the `count`-th use of `name` (2, 3…). */\nexport type NumberedName = (name: string, count: number) => string;\n\n/**\n * Names made unique, in order: the first use of a name keeps it, each repeat gets the lowest\n * number from 2 whose name is not written anywhere in the list.\n */\nexport function withNumberedRepeats(names: readonly string[], numbered: NumberedName): string[] {\n  const written = new Set(names);\n  const taken = new Set<string>();\n  return names.map((name) => {\n    let unique = name;\n    for (let count = 2; taken.has(unique); count += 1) {\n      const candidate = numbered(name, count);\n      unique = written.has(candidate) ? unique : candidate;\n    }\n    taken.add(unique);\n    return unique;\n  });\n}\n"],"names":[],"mappings":";;AAOO,SAAS,mBAAA,CAAoB,OAA0B,QAAA,EAAkC;AAC9F,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,KAAK,CAAA;AAC7B,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AACzB,IAAA,IAAI,MAAA,GAAS,IAAA;AACb,IAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,CAAM,IAAI,MAAM,CAAA,EAAG,SAAS,CAAA,EAAG;AACjD,MAAA,MAAM,SAAA,GAAY,QAAA,CAAS,IAAA,EAAM,KAAK,CAAA;AACtC,MAAA,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,GAAI,MAAA,GAAS,SAAA;AAAA,IAC7C;AACA,IAAA,KAAA,CAAM,IAAI,MAAM,CAAA;AAChB,IAAA,OAAO,MAAA;AAAA,EACT,CAAC,CAAA;AACH;;"}

package/dist/application/transform/numbered-names.mjs

@@ -0,0 +1,16 @@
+function withNumberedRepeats(names, numbered) {
+  const written = new Set(names);
+  const taken = /* @__PURE__ */ new Set();
+  return names.map((name) => {
+    let unique = name;
+    for (let count = 2; taken.has(unique); count += 1) {
+      const candidate = numbered(name, count);
+      unique = written.has(candidate) ? unique : candidate;
+    }
+    taken.add(unique);
+    return unique;
+  });
+}
+
+export { withNumberedRepeats };
+//# sourceMappingURL=numbered-names.mjs.map

package/dist/application/transform/numbered-names.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"numbered-names.mjs","sources":["../../../src/application/transform/numbered-names.ts"],"sourcesContent":["/** Builds the name for the `count`-th use of `name` (2, 3…). */\nexport type NumberedName = (name: string, count: number) => string;\n\n/**\n * Names made unique, in order: the first use of a name keeps it, each repeat gets the lowest\n * number from 2 whose name is not written anywhere in the list.\n */\nexport function withNumberedRepeats(names: readonly string[], numbered: NumberedName): string[] {\n  const written = new Set(names);\n  const taken = new Set<string>();\n  return names.map((name) => {\n    let unique = name;\n    for (let count = 2; taken.has(unique); count += 1) {\n      const candidate = numbered(name, count);\n      unique = written.has(candidate) ? unique : candidate;\n    }\n    taken.add(unique);\n    return unique;\n  });\n}\n"],"names":[],"mappings":"AAOO,SAAS,mBAAA,CAAoB,OAA0B,QAAA,EAAkC;AAC9F,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,KAAK,CAAA;AAC7B,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AACzB,IAAA,IAAI,MAAA,GAAS,IAAA;AACb,IAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,CAAM,IAAI,MAAM,CAAA,EAAG,SAAS,CAAA,EAAG;AACjD,MAAA,MAAM,SAAA,GAAY,QAAA,CAAS,IAAA,EAAM,KAAK,CAAA;AACtC,MAAA,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,SAAS,CAAA,GAAI,MAAA,GAAS,SAAA;AAAA,IAC7C;AACA,IAAA,KAAA,CAAM,IAAI,MAAM,CAAA;AAChB,IAAA,OAAO,MAAA;AAAA,EACT,CAAC,CAAA;AACH;;"}

package/dist/application/transform/ref-type.cjs

@@ -0,0 +1,57 @@
+'use strict';
+
+const errors = require('../../domain/errors.cjs');
+const constructors = require('../../domain/ir/constructors.cjs');
+const jsonPointer = require('../../domain/openapi/json-pointer.cjs');
+
+class InvalidRefError extends errors.OpenAPITypesafeError {
+  constructor(ref) {
+    super({
+      code: errors.ERROR_CODES.SCHEMA_REF_INVALID,
+      message: `Error parsing $ref: ${ref}. Is this a valid $ref?`,
+      details: { ref }
+    });
+    this.name = "InvalidRefError";
+  }
+}
+function indexBy(type, ...segments) {
+  return segments.reduce(
+    (object, segment) => constructors.irIndexedAccess(object, constructors.irString(segment, "escaped")),
+    type
+  );
+}
+function extractVariantsWith(type, propertyName) {
+  const probe = constructors.irProperty({ kind: "identifier", text: propertyName }, constructors.irKeyword("unknown"));
+  return constructors.irReference("Extract", [type, constructors.irObject([probe])]);
+}
+const DEFS_KEYWORD = "$defs";
+function indexKeyword(type, segment, isLast) {
+  const indexed = indexBy(type, segment);
+  return segment === DEFS_KEYWORD && !isLast ? constructors.irReference("NonNullable", [indexed]) : indexed;
+}
+function rootType(rootSegment, isDeep) {
+  return constructors.irReference(isDeep ? `FlattenedDeepRequired<${rootSegment}>` : rootSegment);
+}
+function refType(ref, options = {}) {
+  const [rootSegment, ...pointer] = jsonPointer.parseRefPointer(ref);
+  if (rootSegment === void 0) {
+    throw new InvalidRefError(ref);
+  }
+  const extracted = new Set(options.extractProperties ?? []);
+  const lastIndex = pointer.length - 1;
+  const leading = indexBy(rootType(rootSegment, options.isDeep ?? false), ...pointer.slice(0, 2));
+  return pointer.slice(2).reduce((type, segment, offset) => {
+    if (segment === "properties") {
+      return type;
+    }
+    if (options.parameter && offset + 2 === lastIndex) {
+      return indexBy(type, options.parameter.in, options.parameter.name);
+    }
+    const isLast = offset + 2 === lastIndex;
+    return extracted.has(segment) ? indexBy(extractVariantsWith(type, segment), segment) : indexKeyword(type, segment, isLast);
+  }, leading);
+}
+
+exports.InvalidRefError = InvalidRefError;
+exports.refType = refType;
+//# sourceMappingURL=ref-type.cjs.map

package/dist/application/transform/ref-type.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"ref-type.cjs","sources":["../../../src/application/transform/ref-type.ts"],"sourcesContent":["import { ERROR_CODES, OpenAPITypesafeError } from \"../../domain/errors.js\";\nimport {\n  irIndexedAccess,\n  irKeyword,\n  irObject,\n  irProperty,\n  irReference,\n  irString,\n} from \"../../domain/ir/constructors.js\";\nimport type { IrType } from \"../../domain/ir/nodes.js\";\nimport { parseRefPointer } from \"../../domain/openapi/json-pointer.js\";\n\n/** Where a referenced parameter lives in the generated `parameters` type. */\nexport interface RefParameterTarget {\n  readonly in: string;\n  readonly name: string;\n}\n\nexport interface RefTypeOptions {\n  /** Wrap the root in `FlattenedDeepRequired<…>`. */\n  readonly isDeep?: boolean;\n  /** Segments to narrow with `Extract<T, { segment: unknown }>` before indexing. */\n  readonly extractProperties?: readonly string[];\n  /** Set when the `$ref` resolves to a parameter object: its last segment indexes `in`, `name`. */\n  readonly parameter?: RefParameterTarget | null;\n}\n\nexport class InvalidRefError extends OpenAPITypesafeError {\n  constructor(ref: string) {\n    super({\n      code: ERROR_CODES.SCHEMA_REF_INVALID,\n      message: `Error parsing $ref: ${ref}. Is this a valid $ref?`,\n      details: { ref },\n    });\n    this.name = \"InvalidRefError\";\n  }\n}\n\n/** Segments that index into the root type, always as escaped string literal types. */\nfunction indexBy(type: IrType, ...segments: readonly string[]): IrType {\n  return segments.reduce<IrType>(\n    (object, segment) => irIndexedAccess(object, irString(segment, \"escaped\")),\n    type,\n  );\n}\n\n/** `Extract<T, { name: unknown }>`; the name is written as an identifier, as in the original. */\nfunction extractVariantsWith(type: IrType, propertyName: string): IrType {\n  const probe = irProperty({ kind: \"identifier\", text: propertyName }, irKeyword(\"unknown\"));\n  return irReference(\"Extract\", [type, irObject([probe])]);\n}\n\nconst DEFS_KEYWORD = \"$defs\";\n\n/**\n * Index by `segment`. A `$defs` member is optional (it is a keyword, not data), so when more\n * segments follow it is wrapped in `NonNullable<…>` first; otherwise the next index fails on\n * `undefined` (upstream #2664).\n */\nfunction indexKeyword(type: IrType, segment: string, isLast: boolean): IrType {\n  const indexed = indexBy(type, segment);\n  return segment === DEFS_KEYWORD && !isLast ? irReference(\"NonNullable\", [indexed]) : indexed;\n}\n\nfunction rootType(rootSegment: string, isDeep: boolean): IrType {\n  return irReference(isDeep ? `FlattenedDeepRequired<${rootSegment}>` : rootSegment);\n}\n\n/**\n * The indexed-access type of a `$ref` into the generated types (the original `oapiRef`), for\n * example `components[\"schemas\"][\"Foo\"]`. The first three segments index directly. After them,\n * `properties` segments are skipped (objects are flattened, upstream issue 1742), a parameter's\n * last segment becomes `[in][name]`, and listed segments are narrowed with `Extract` first.\n *\n * Throws InvalidRefError when the `$ref` has no pointer.\n */\nexport function refType(ref: string, options: RefTypeOptions = {}): IrType {\n  const [rootSegment, ...pointer] = parseRefPointer(ref);\n  if (rootSegment === undefined) {\n    throw new InvalidRefError(ref);\n  }\n  const extracted = new Set(options.extractProperties ?? []);\n  const lastIndex = pointer.length - 1;\n  const leading = indexBy(rootType(rootSegment, options.isDeep ?? false), ...pointer.slice(0, 2));\n  return pointer.slice(2).reduce<IrType>((type, segment, offset) => {\n    if (segment === \"properties\") {\n      return type;\n    }\n    if (options.parameter && offset + 2 === lastIndex) {\n      return indexBy(type, options.parameter.in, options.parameter.name);\n    }\n    const isLast = offset + 2 === lastIndex;\n    return extracted.has(segment)\n      ? indexBy(extractVariantsWith(type, segment), segment)\n      : indexKeyword(type, segment, isLast);\n  }, leading);\n}\n"],"names":["OpenAPITypesafeError","ERROR_CODES","irIndexedAccess","irString","irProperty","irKeyword","irReference","irObject","parseRefPointer"],"mappings":";;;;;;AA2BO,MAAM,wBAAwBA,2BAAA,CAAqB;AAAA,EACxD,YAAY,GAAA,EAAa;AACvB,IAAA,KAAA,CAAM;AAAA,MACJ,MAAMC,kBAAA,CAAY,kBAAA;AAAA,MAClB,OAAA,EAAS,uBAAuB,GAAG,CAAA,uBAAA,CAAA;AAAA,MACnC,OAAA,EAAS,EAAE,GAAA;AAAI,KAChB,CAAA;AACD,IAAA,IAAA,CAAK,IAAA,GAAO,iBAAA;AAAA,EACd;AACF;AAGA,SAAS,OAAA,CAAQ,SAAiB,QAAA,EAAqC;AACrE,EAAA,OAAO,QAAA,CAAS,MAAA;AAAA,IACd,CAAC,QAAQ,OAAA,KAAYC,4BAAA,CAAgB,QAAQC,qBAAA,CAAS,OAAA,EAAS,SAAS,CAAC,CAAA;AAAA,IACzE;AAAA,GACF;AACF;AAGA,SAAS,mBAAA,CAAoB,MAAc,YAAA,EAA8B;AACvE,EAAA,MAAM,KAAA,GAAQC,uBAAA,CAAW,EAAE,IAAA,EAAM,YAAA,EAAc,MAAM,YAAA,EAAa,EAAGC,sBAAA,CAAU,SAAS,CAAC,CAAA;AACzF,EAAA,OAAOC,wBAAA,CAAY,WAAW,CAAC,IAAA,EAAMC,sBAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;AACzD;AAEA,MAAM,YAAA,GAAe,OAAA;AAOrB,SAAS,YAAA,CAAa,IAAA,EAAc,OAAA,EAAiB,MAAA,EAAyB;AAC5E,EAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,IAAA,EAAM,OAAO,CAAA;AACrC,EAAA,OAAO,OAAA,KAAY,gBAAgB,CAAC,MAAA,GAASD,yBAAY,aAAA,EAAe,CAAC,OAAO,CAAC,CAAA,GAAI,OAAA;AACvF;AAEA,SAAS,QAAA,CAAS,aAAqB,MAAA,EAAyB;AAC9D,EAAA,OAAOA,wBAAA,CAAY,MAAA,GAAS,CAAA,sBAAA,EAAyB,WAAW,MAAM,WAAW,CAAA;AACnF;AAUO,SAAS,OAAA,CAAQ,GAAA,EAAa,OAAA,GAA0B,EAAC,EAAW;AACzE,EAAA,MAAM,CAAC,WAAA,EAAa,GAAG,OAAO,CAAA,GAAIE,4BAAgB,GAAG,CAAA;AACrD,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,MAAM,IAAI,gBAAgB,GAAG,CAAA;AAAA,EAC/B;AACA,EAAA,MAAM,YAAY,IAAI,GAAA,CAAI,OAAA,CAAQ,iBAAA,IAAqB,EAAE,CAAA;AACzD,EAAA,MAAM,SAAA,GAAY,QAAQ,MAAA,GAAS,CAAA;AACnC,EAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,QAAA,CAAS,WAAA,EAAa,OAAA,CAAQ,MAAA,IAAU,KAAK,CAAA,EAAG,GAAG,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA;AAC9F,EAAA,OAAO,OAAA,CAAQ,MAAM,CAAC,CAAA,CAAE,OAAe,CAAC,IAAA,EAAM,SAAS,MAAA,KAAW;AAChE,IAAA,IAAI,YAAY,YAAA,EAAc;AAC5B,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,OAAA,CAAQ,SAAA,IAAa,MAAA,GAAS,CAAA,KAAM,SAAA,EAAW;AACjD,MAAA,OAAO,QAAQ,IAAA,EAAM,OAAA,CAAQ,UAAU,EAAA,EAAI,OAAA,CAAQ,UAAU,IAAI,CAAA;AAAA,IACnE;AACA,IAAA,MAAM,MAAA,GAAS,SAAS,CAAA,KAAM,SAAA;AAC9B,IAAA,OAAO,SAAA,CAAU,GAAA,CAAI,OAAO,CAAA,GACxB,QAAQ,mBAAA,CAAoB,IAAA,EAAM,OAAO,CAAA,EAAG,OAAO,CAAA,GACnD,YAAA,CAAa,IAAA,EAAM,SAAS,MAAM,CAAA;AAAA,EACxC,GAAG,OAAO,CAAA;AACZ;;;"}

package/dist/application/transform/ref-type.mjs

@@ -0,0 +1,54 @@
+import { OpenAPITypesafeError, ERROR_CODES } from '../../domain/errors.mjs';
+import { irIndexedAccess, irReference, irProperty, irKeyword, irObject, irString } from '../../domain/ir/constructors.mjs';
+import { parseRefPointer } from '../../domain/openapi/json-pointer.mjs';
+
+class InvalidRefError extends OpenAPITypesafeError {
+  constructor(ref) {
+    super({
+      code: ERROR_CODES.SCHEMA_REF_INVALID,
+      message: `Error parsing $ref: ${ref}. Is this a valid $ref?`,
+      details: { ref }
+    });
+    this.name = "InvalidRefError";
+  }
+}
+function indexBy(type, ...segments) {
+  return segments.reduce(
+    (object, segment) => irIndexedAccess(object, irString(segment, "escaped")),
+    type
+  );
+}
+function extractVariantsWith(type, propertyName) {
+  const probe = irProperty({ kind: "identifier", text: propertyName }, irKeyword("unknown"));
+  return irReference("Extract", [type, irObject([probe])]);
+}
+const DEFS_KEYWORD = "$defs";
+function indexKeyword(type, segment, isLast) {
+  const indexed = indexBy(type, segment);
+  return segment === DEFS_KEYWORD && !isLast ? irReference("NonNullable", [indexed]) : indexed;
+}
+function rootType(rootSegment, isDeep) {
+  return irReference(isDeep ? `FlattenedDeepRequired<${rootSegment}>` : rootSegment);
+}
+function refType(ref, options = {}) {
+  const [rootSegment, ...pointer] = parseRefPointer(ref);
+  if (rootSegment === void 0) {
+    throw new InvalidRefError(ref);
+  }
+  const extracted = new Set(options.extractProperties ?? []);
+  const lastIndex = pointer.length - 1;
+  const leading = indexBy(rootType(rootSegment, options.isDeep ?? false), ...pointer.slice(0, 2));
+  return pointer.slice(2).reduce((type, segment, offset) => {
+    if (segment === "properties") {
+      return type;
+    }
+    if (options.parameter && offset + 2 === lastIndex) {
+      return indexBy(type, options.parameter.in, options.parameter.name);
+    }
+    const isLast = offset + 2 === lastIndex;
+    return extracted.has(segment) ? indexBy(extractVariantsWith(type, segment), segment) : indexKeyword(type, segment, isLast);
+  }, leading);
+}
+
+export { InvalidRefError, refType };
+//# sourceMappingURL=ref-type.mjs.map

package/dist/application/transform/ref-type.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"ref-type.mjs","sources":["../../../src/application/transform/ref-type.ts"],"sourcesContent":["import { ERROR_CODES, OpenAPITypesafeError } from \"../../domain/errors.js\";\nimport {\n  irIndexedAccess,\n  irKeyword,\n  irObject,\n  irProperty,\n  irReference,\n  irString,\n} from \"../../domain/ir/constructors.js\";\nimport type { IrType } from \"../../domain/ir/nodes.js\";\nimport { parseRefPointer } from \"../../domain/openapi/json-pointer.js\";\n\n/** Where a referenced parameter lives in the generated `parameters` type. */\nexport interface RefParameterTarget {\n  readonly in: string;\n  readonly name: string;\n}\n\nexport interface RefTypeOptions {\n  /** Wrap the root in `FlattenedDeepRequired<…>`. */\n  readonly isDeep?: boolean;\n  /** Segments to narrow with `Extract<T, { segment: unknown }>` before indexing. */\n  readonly extractProperties?: readonly string[];\n  /** Set when the `$ref` resolves to a parameter object: its last segment indexes `in`, `name`. */\n  readonly parameter?: RefParameterTarget | null;\n}\n\nexport class InvalidRefError extends OpenAPITypesafeError {\n  constructor(ref: string) {\n    super({\n      code: ERROR_CODES.SCHEMA_REF_INVALID,\n      message: `Error parsing $ref: ${ref}. Is this a valid $ref?`,\n      details: { ref },\n    });\n    this.name = \"InvalidRefError\";\n  }\n}\n\n/** Segments that index into the root type, always as escaped string literal types. */\nfunction indexBy(type: IrType, ...segments: readonly string[]): IrType {\n  return segments.reduce<IrType>(\n    (object, segment) => irIndexedAccess(object, irString(segment, \"escaped\")),\n    type,\n  );\n}\n\n/** `Extract<T, { name: unknown }>`; the name is written as an identifier, as in the original. */\nfunction extractVariantsWith(type: IrType, propertyName: string): IrType {\n  const probe = irProperty({ kind: \"identifier\", text: propertyName }, irKeyword(\"unknown\"));\n  return irReference(\"Extract\", [type, irObject([probe])]);\n}\n\nconst DEFS_KEYWORD = \"$defs\";\n\n/**\n * Index by `segment`. A `$defs` member is optional (it is a keyword, not data), so when more\n * segments follow it is wrapped in `NonNullable<…>` first; otherwise the next index fails on\n * `undefined` (upstream #2664).\n */\nfunction indexKeyword(type: IrType, segment: string, isLast: boolean): IrType {\n  const indexed = indexBy(type, segment);\n  return segment === DEFS_KEYWORD && !isLast ? irReference(\"NonNullable\", [indexed]) : indexed;\n}\n\nfunction rootType(rootSegment: string, isDeep: boolean): IrType {\n  return irReference(isDeep ? `FlattenedDeepRequired<${rootSegment}>` : rootSegment);\n}\n\n/**\n * The indexed-access type of a `$ref` into the generated types (the original `oapiRef`), for\n * example `components[\"schemas\"][\"Foo\"]`. The first three segments index directly. After them,\n * `properties` segments are skipped (objects are flattened, upstream issue 1742), a parameter's\n * last segment becomes `[in][name]`, and listed segments are narrowed with `Extract` first.\n *\n * Throws InvalidRefError when the `$ref` has no pointer.\n */\nexport function refType(ref: string, options: RefTypeOptions = {}): IrType {\n  const [rootSegment, ...pointer] = parseRefPointer(ref);\n  if (rootSegment === undefined) {\n    throw new InvalidRefError(ref);\n  }\n  const extracted = new Set(options.extractProperties ?? []);\n  const lastIndex = pointer.length - 1;\n  const leading = indexBy(rootType(rootSegment, options.isDeep ?? false), ...pointer.slice(0, 2));\n  return pointer.slice(2).reduce<IrType>((type, segment, offset) => {\n    if (segment === \"properties\") {\n      return type;\n    }\n    if (options.parameter && offset + 2 === lastIndex) {\n      return indexBy(type, options.parameter.in, options.parameter.name);\n    }\n    const isLast = offset + 2 === lastIndex;\n    return extracted.has(segment)\n      ? indexBy(extractVariantsWith(type, segment), segment)\n      : indexKeyword(type, segment, isLast);\n  }, leading);\n}\n"],"names":[],"mappings":";;;;AA2BO,MAAM,wBAAwB,oBAAA,CAAqB;AAAA,EACxD,YAAY,GAAA,EAAa;AACvB,IAAA,KAAA,CAAM;AAAA,MACJ,MAAM,WAAA,CAAY,kBAAA;AAAA,MAClB,OAAA,EAAS,uBAAuB,GAAG,CAAA,uBAAA,CAAA;AAAA,MACnC,OAAA,EAAS,EAAE,GAAA;AAAI,KAChB,CAAA;AACD,IAAA,IAAA,CAAK,IAAA,GAAO,iBAAA;AAAA,EACd;AACF;AAGA,SAAS,OAAA,CAAQ,SAAiB,QAAA,EAAqC;AACrE,EAAA,OAAO,QAAA,CAAS,MAAA;AAAA,IACd,CAAC,QAAQ,OAAA,KAAY,eAAA,CAAgB,QAAQ,QAAA,CAAS,OAAA,EAAS,SAAS,CAAC,CAAA;AAAA,IACzE;AAAA,GACF;AACF;AAGA,SAAS,mBAAA,CAAoB,MAAc,YAAA,EAA8B;AACvE,EAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,EAAE,IAAA,EAAM,YAAA,EAAc,MAAM,YAAA,EAAa,EAAG,SAAA,CAAU,SAAS,CAAC,CAAA;AACzF,EAAA,OAAO,WAAA,CAAY,WAAW,CAAC,IAAA,EAAM,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;AACzD;AAEA,MAAM,YAAA,GAAe,OAAA;AAOrB,SAAS,YAAA,CAAa,IAAA,EAAc,OAAA,EAAiB,MAAA,EAAyB;AAC5E,EAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,IAAA,EAAM,OAAO,CAAA;AACrC,EAAA,OAAO,OAAA,KAAY,gBAAgB,CAAC,MAAA,GAAS,YAAY,aAAA,EAAe,CAAC,OAAO,CAAC,CAAA,GAAI,OAAA;AACvF;AAEA,SAAS,QAAA,CAAS,aAAqB,MAAA,EAAyB;AAC9D,EAAA,OAAO,WAAA,CAAY,MAAA,GAAS,CAAA,sBAAA,EAAyB,WAAW,MAAM,WAAW,CAAA;AACnF;AAUO,SAAS,OAAA,CAAQ,GAAA,EAAa,OAAA,GAA0B,EAAC,EAAW;AACzE,EAAA,MAAM,CAAC,WAAA,EAAa,GAAG,OAAO,CAAA,GAAI,gBAAgB,GAAG,CAAA;AACrD,EAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,IAAA,MAAM,IAAI,gBAAgB,GAAG,CAAA;AAAA,EAC/B;AACA,EAAA,MAAM,YAAY,IAAI,GAAA,CAAI,OAAA,CAAQ,iBAAA,IAAqB,EAAE,CAAA;AACzD,EAAA,MAAM,SAAA,GAAY,QAAQ,MAAA,GAAS,CAAA;AACnC,EAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,QAAA,CAAS,WAAA,EAAa,OAAA,CAAQ,MAAA,IAAU,KAAK,CAAA,EAAG,GAAG,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA;AAC9F,EAAA,OAAO,OAAA,CAAQ,MAAM,CAAC,CAAA,CAAE,OAAe,CAAC,IAAA,EAAM,SAAS,MAAA,KAAW;AAChE,IAAA,IAAI,YAAY,YAAA,EAAc;AAC5B,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,OAAA,CAAQ,SAAA,IAAa,MAAA,GAAS,CAAA,KAAM,SAAA,EAAW;AACjD,MAAA,OAAO,QAAQ,IAAA,EAAM,OAAA,CAAQ,UAAU,EAAA,EAAI,OAAA,CAAQ,UAAU,IAAI,CAAA;AAAA,IACnE;AACA,IAAA,MAAM,MAAA,GAAS,SAAS,CAAA,KAAM,SAAA;AAC9B,IAAA,OAAO,SAAA,CAAU,GAAA,CAAI,OAAO,CAAA,GACxB,QAAQ,mBAAA,CAAoB,IAAA,EAAM,OAAO,CAAA,EAAG,OAAO,CAAA,GACnD,YAAA,CAAa,IAAA,EAAM,SAAS,MAAM,CAAA;AAAA,EACxC,GAAG,OAAO,CAAA;AACZ;;"}

package/dist/application/transform/schema/array-type.cjs

@@ -0,0 +1,105 @@
+'use strict';
+
+const constructors = require('../../../domain/ir/constructors.cjs');
+const outputFixes = require('../../../domain/output-fixes.cjs');
+const sharedTypes = require('../shared-types.cjs');
+const typeCombinators = require('../type-combinators.cjs');
+
+const MAX_LENGTH_TUPLE_ELEMENTS = 30;
+function prefixTupleType(schema, request) {
+  const { items } = schema;
+  if (!schema.prefixItems && !Array.isArray(items)) {
+    return null;
+  }
+  const prefixItems = schema.prefixItems ?? items;
+  return constructors.irTuple(
+    prefixItems.map((item) => constructors.irTupleElement(request.transformNested(item, request.location)))
+  );
+}
+function singleItemType(schema, request) {
+  const { items } = schema;
+  return items ? request.transformNested(items, request.location) : sharedTypes.UNKNOWN_TYPE;
+}
+function itemType(schema, request) {
+  const tuple = prefixTupleType(schema, request);
+  if (tuple !== null) {
+    return tuple;
+  }
+  const { items } = schema;
+  if (!items) {
+    return sharedTypes.UNKNOWN_TYPE;
+  }
+  const nested = singleItemType(schema, request);
+  const isNestedArray = typeof items === "object" && "type" in items && items.type === "array";
+  return isNestedArray ? constructors.irArray(nested) : nested;
+}
+function repeat(type, count) {
+  return Array.from({ length: count }, () => type);
+}
+function lengthBounds(schema) {
+  const { minItems, maxItems } = schema;
+  const min = typeof minItems === "number" && minItems >= 0 ? minItems : 0;
+  const isMaxValid = typeof maxItems === "number" && maxItems >= 0 && min <= maxItems;
+  return { min, max: isMaxValid ? maxItems : void 0 };
+}
+function lengthTupleType(schema, item, bounds) {
+  const { min, max } = bounds;
+  if (min === max) {
+    return typeCombinators.unionOf([constructors.irTuple(repeat(item, min).map((type) => constructors.irTupleElement(type)))]);
+  }
+  if (schema.maxItems > 0) {
+    const lengths = Array.from({ length: Math.max(0, (max ?? 0) - min + 1) }, (_, index) => index);
+    return typeCombinators.unionOf(
+      lengths.map((length) => constructors.irTuple(repeat(item, length).map((type) => constructors.irTupleElement(type))))
+    );
+  }
+  const elements = repeat(item, min).map((type) => constructors.irTupleElement(type));
+  return constructors.irTuple([...elements, constructors.irTupleElement(constructors.irArray(item), true)]);
+}
+function isLengthTupleWanted(bounds, request) {
+  const { min, max } = bounds;
+  const estimatedSize = max === void 0 ? min : (max * (max + 1) - min * (min - 1)) / 2;
+  const hasBounds = min !== 0 || max !== void 0;
+  return request.context.options.arrayLength && hasBounds && estimatedSize < MAX_LENGTH_TUPLE_ELEMENTS;
+}
+function tupleOf(item, length, isOpen) {
+  const elements = repeat(item, length).map((type) => constructors.irTupleElement(type));
+  return constructors.irTuple(isOpen ? [...elements, constructors.irTupleElement(constructors.irArray(item), true)] : elements);
+}
+function fixedLengthTupleType(item, bounds, wrap) {
+  const { min, max } = bounds;
+  if (max === void 0) {
+    return wrap(tupleOf(item, min, true));
+  }
+  const lengths = Array.from({ length: max - min + 1 }, (_, index) => min + index);
+  return typeCombinators.unionOf(lengths.map((length) => wrap(tupleOf(item, length, false))));
+}
+function fixedArrayType(schema, request) {
+  const wrap = (type) => request.context.options.immutable ? constructors.irReadonly(type) : type;
+  const tuple = prefixTupleType(schema, request);
+  if (tuple !== null) {
+    return wrap(tuple);
+  }
+  const item = singleItemType(schema, request);
+  const bounds = lengthBounds(schema);
+  return isLengthTupleWanted(bounds, request) ? fixedLengthTupleType(item, bounds, wrap) : wrap(constructors.irArray(item));
+}
+function isArrayLengthFixed(request) {
+  const { arrayLength, fixes } = request.context.options;
+  return arrayLength && fixes.has(outputFixes.OutputFix.ARRAY_LENGTH_TUPLES);
+}
+function arrayType(schema, request) {
+  if (isArrayLengthFixed(request)) {
+    return fixedArrayType(schema, request);
+  }
+  const item = itemType(schema, request);
+  const bounds = lengthBounds(schema);
+  if (isLengthTupleWanted(bounds, request)) {
+    return lengthTupleType(schema, item, bounds);
+  }
+  const type = item.kind === "tuple" || item.kind === "array" ? item : constructors.irArray(item);
+  return request.context.options.immutable ? constructors.irReadonly(type) : type;
+}
+
+exports.arrayType = arrayType;
+//# sourceMappingURL=array-type.cjs.map

package/dist/application/transform/schema/array-type.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-type.cjs","sources":["../../../../src/application/transform/schema/array-type.ts"],"sourcesContent":["import { irArray, irReadonly, irTuple, irTupleElement } from \"../../../domain/ir/constructors.js\";\nimport type { IrType } from \"../../../domain/ir/nodes.js\";\nimport type { SchemaObject } from \"../../../domain/openapi/schema-object.js\";\nimport { OutputFix } from \"../../../domain/output-fixes.js\";\nimport { UNKNOWN_TYPE } from \"../shared-types.js\";\nimport { unionOf } from \"../type-combinators.js\";\nimport type { SchemaRequest } from \"./schema-rule.js\";\n\n/**\n * `--array-length` writes tuples only while the estimated number of tuple elements stays below\n * this; the original chose it as roughly where TypeScript starts to struggle with tuple inference.\n */\nconst MAX_LENGTH_TUPLE_ELEMENTS = 30;\n\n/** The tuple of `prefixItems` (or of an `items` list); null without either. */\nfunction prefixTupleType(schema: SchemaObject, request: SchemaRequest): IrType | null {\n  const { items } = schema;\n  if (!schema.prefixItems && !Array.isArray(items)) {\n    return null;\n  }\n  const prefixItems = schema.prefixItems ?? (items as SchemaObject[]);\n  return irTuple(\n    prefixItems.map((item) => irTupleElement(request.transformNested(item, request.location))),\n  );\n}\n\n/** The type of one item; `unknown` without `items`. */\nfunction singleItemType(schema: SchemaObject, request: SchemaRequest): IrType {\n  const { items } = schema;\n  return items ? request.transformNested(items as SchemaObject, request.location) : UNKNOWN_TYPE;\n}\n\n/**\n * The item type as the original returns it: a tuple stands for the whole array, and a nested\n * `type: array` item is wrapped in an array here already.\n */\nfunction itemType(schema: SchemaObject, request: SchemaRequest): IrType {\n  const tuple = prefixTupleType(schema, request);\n  if (tuple !== null) {\n    return tuple;\n  }\n  const { items } = schema;\n  // Checked first: the `in` test below throws for `items: null`.\n  if (!items) {\n    return UNKNOWN_TYPE;\n  }\n  const nested = singleItemType(schema, request);\n  const isNestedArray = typeof items === \"object\" && \"type\" in items && items.type === \"array\";\n  return isNestedArray ? irArray(nested) : nested;\n}\n\nfunction repeat(type: IrType, count: number): IrType[] {\n  return Array.from({ length: count }, () => type);\n}\n\ninterface LengthBounds {\n  readonly min: number;\n  readonly max: number | undefined;\n}\n\nfunction lengthBounds(schema: SchemaObject): LengthBounds {\n  const { minItems, maxItems } = schema;\n  const min = typeof minItems === \"number\" && minItems >= 0 ? minItems : 0;\n  const isMaxValid = typeof maxItems === \"number\" && maxItems >= 0 && min <= maxItems;\n  return { min, max: isMaxValid ? maxItems : undefined };\n}\n\n/**\n * Tuples for `--array-length`, as the original builds them. With both bounds it emits tuples of\n * length 0 to `max - min` (not `min` to `max`); the `array-length-tuples` fix corrects it.\n */\nfunction lengthTupleType(schema: SchemaObject, item: IrType, bounds: LengthBounds): IrType {\n  const { min, max } = bounds;\n  if (min === max) {\n    return unionOf([irTuple(repeat(item, min).map((type) => irTupleElement(type)))]);\n  }\n  if ((schema.maxItems as number) > 0) {\n    const lengths = Array.from({ length: Math.max(0, (max ?? 0) - min + 1) }, (_, index) => index);\n    return unionOf(\n      lengths.map((length) => irTuple(repeat(item, length).map((type) => irTupleElement(type)))),\n    );\n  }\n  const elements = repeat(item, min).map((type) => irTupleElement(type));\n  return irTuple([...elements, irTupleElement(irArray(item), true)]);\n}\n\nfunction isLengthTupleWanted(bounds: LengthBounds, request: SchemaRequest): boolean {\n  const { min, max } = bounds;\n  const estimatedSize = max === undefined ? min : (max * (max + 1) - min * (min - 1)) / 2;\n  const hasBounds = min !== 0 || max !== undefined;\n  return (\n    request.context.options.arrayLength && hasBounds && estimatedSize < MAX_LENGTH_TUPLE_ELEMENTS\n  );\n}\n\n/** Applies `--immutable` to one array or tuple type. */\ntype ArrayWrapper = (type: IrType) => IrType;\n\nfunction tupleOf(item: IrType, length: number, isOpen: boolean): IrType {\n  const elements = repeat(item, length).map((type) => irTupleElement(type));\n  return irTuple(isOpen ? [...elements, irTupleElement(irArray(item), true)] : elements);\n}\n\n/** Tuples of every length from `min` to `max`; without `max`, `min` items and a rest element. */\nfunction fixedLengthTupleType(item: IrType, bounds: LengthBounds, wrap: ArrayWrapper): IrType {\n  const { min, max } = bounds;\n  if (max === undefined) {\n    return wrap(tupleOf(item, min, true));\n  }\n  const lengths = Array.from({ length: max - min + 1 }, (_, index) => min + index);\n  return unionOf(lengths.map((length) => wrap(tupleOf(item, length, false))));\n}\n\n/**\n * `type: array` with `--array-length` and the `array-length-tuples` fix (#2048, #2330, #2546):\n * the tuples have `min` to `max` items, the item type is used as it is (a nested array stays one\n * level deep), a `prefixItems` tuple gets no length tuples around it, and `--immutable` makes\n * every tuple `readonly`.\n */\nfunction fixedArrayType(schema: SchemaObject, request: SchemaRequest): IrType {\n  const wrap: ArrayWrapper = (type) =>\n    request.context.options.immutable ? irReadonly(type) : type;\n  const tuple = prefixTupleType(schema, request);\n  if (tuple !== null) {\n    return wrap(tuple);\n  }\n  const item = singleItemType(schema, request);\n  const bounds = lengthBounds(schema);\n  return isLengthTupleWanted(bounds, request)\n    ? fixedLengthTupleType(item, bounds, wrap)\n    : wrap(irArray(item));\n}\n\nfunction isArrayLengthFixed(request: SchemaRequest): boolean {\n  const { arrayLength, fixes } = request.context.options;\n  return arrayLength && fixes.has(OutputFix.ARRAY_LENGTH_TUPLES);\n}\n\n/** `type: array`, including tuples (`prefixItems`, array `items`) and `--array-length`. */\nexport function arrayType(schema: SchemaObject, request: SchemaRequest): IrType {\n  if (isArrayLengthFixed(request)) {\n    return fixedArrayType(schema, request);\n  }\n  const item = itemType(schema, request);\n  const bounds = lengthBounds(schema);\n  if (isLengthTupleWanted(bounds, request)) {\n    return lengthTupleType(schema, item, bounds);\n  }\n  // A tuple or an array item is used as the array type itself.\n  const type = item.kind === \"tuple\" || item.kind === \"array\" ? item : irArray(item);\n  return request.context.options.immutable ? irReadonly(type) : type;\n}\n"],"names":["irTuple","irTupleElement","UNKNOWN_TYPE","irArray","unionOf","irReadonly","OutputFix"],"mappings":";;;;;;;AAYA,MAAM,yBAAA,GAA4B,EAAA;AAGlC,SAAS,eAAA,CAAgB,QAAsB,OAAA,EAAuC;AACpF,EAAA,MAAM,EAAE,OAAM,GAAI,MAAA;AAClB,EAAA,IAAI,CAAC,MAAA,CAAO,WAAA,IAAe,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChD,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,WAAA,GAAc,OAAO,WAAA,IAAgB,KAAA;AAC3C,EAAA,OAAOA,oBAAA;AAAA,IACL,WAAA,CAAY,GAAA,CAAI,CAAC,IAAA,KAASC,2BAAA,CAAe,OAAA,CAAQ,eAAA,CAAgB,IAAA,EAAM,OAAA,CAAQ,QAAQ,CAAC,CAAC;AAAA,GAC3F;AACF;AAGA,SAAS,cAAA,CAAe,QAAsB,OAAA,EAAgC;AAC5E,EAAA,MAAM,EAAE,OAAM,GAAI,MAAA;AAClB,EAAA,OAAO,QAAQ,OAAA,CAAQ,eAAA,CAAgB,KAAA,EAAuB,OAAA,CAAQ,QAAQ,CAAA,GAAIC,wBAAA;AACpF;AAMA,SAAS,QAAA,CAAS,QAAsB,OAAA,EAAgC;AACtE,EAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,MAAA,EAAQ,OAAO,CAAA;AAC7C,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,EAAE,OAAM,GAAI,MAAA;AAElB,EAAA,IAAI,CAAC,KAAA,EAAO;AACV,IAAA,OAAOA,wBAAA;AAAA,EACT;AACA,EAAA,MAAM,MAAA,GAAS,cAAA,CAAe,MAAA,EAAQ,OAAO,CAAA;AAC7C,EAAA,MAAM,gBAAgB,OAAO,KAAA,KAAU,YAAY,MAAA,IAAU,KAAA,IAAS,MAAM,IAAA,KAAS,OAAA;AACrF,EAAA,OAAO,aAAA,GAAgBC,oBAAA,CAAQ,MAAM,CAAA,GAAI,MAAA;AAC3C;AAEA,SAAS,MAAA,CAAO,MAAc,KAAA,EAAyB;AACrD,EAAA,OAAO,MAAM,IAAA,CAAK,EAAE,QAAQ,KAAA,EAAM,EAAG,MAAM,IAAI,CAAA;AACjD;AAOA,SAAS,aAAa,MAAA,EAAoC;AACxD,EAAA,MAAM,EAAE,QAAA,EAAU,QAAA,EAAS,GAAI,MAAA;AAC/B,EAAA,MAAM,MAAM,OAAO,QAAA,KAAa,QAAA,IAAY,QAAA,IAAY,IAAI,QAAA,GAAW,CAAA;AACvE,EAAA,MAAM,aAAa,OAAO,QAAA,KAAa,QAAA,IAAY,QAAA,IAAY,KAAK,GAAA,IAAO,QAAA;AAC3E,EAAA,OAAO,EAAE,GAAA,EAAK,GAAA,EAAK,UAAA,GAAa,WAAW,MAAA,EAAU;AACvD;AAMA,SAAS,eAAA,CAAgB,MAAA,EAAsB,IAAA,EAAc,MAAA,EAA8B;AACzF,EAAA,MAAM,EAAE,GAAA,EAAK,GAAA,EAAI,GAAI,MAAA;AACrB,EAAA,IAAI,QAAQ,GAAA,EAAK;AACf,IAAA,OAAOC,uBAAA,CAAQ,CAACJ,oBAAA,CAAQ,MAAA,CAAO,MAAM,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,SAASC,2BAAA,CAAe,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;AAAA,EACjF;AACA,EAAA,IAAK,MAAA,CAAO,WAAsB,CAAA,EAAG;AACnC,IAAA,MAAM,UAAU,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAK,GAAA,CAAI,CAAA,EAAA,CAAI,GAAA,IAAO,CAAA,IAAK,MAAM,CAAC,CAAA,IAAK,CAAC,CAAA,EAAG,UAAU,KAAK,CAAA;AAC7F,IAAA,OAAOG,uBAAA;AAAA,MACL,QAAQ,GAAA,CAAI,CAAC,MAAA,KAAWJ,oBAAA,CAAQ,OAAO,IAAA,EAAM,MAAM,CAAA,CAAE,GAAA,CAAI,CAAC,IAAA,KAASC,2BAAA,CAAe,IAAI,CAAC,CAAC,CAAC;AAAA,KAC3F;AAAA,EACF;AACA,EAAA,MAAM,QAAA,GAAW,MAAA,CAAO,IAAA,EAAM,GAAG,CAAA,CAAE,IAAI,CAAC,IAAA,KAASA,2BAAA,CAAe,IAAI,CAAC,CAAA;AACrE,EAAA,OAAOD,oBAAA,CAAQ,CAAC,GAAG,QAAA,EAAUC,2BAAA,CAAeE,qBAAQ,IAAI,CAAA,EAAG,IAAI,CAAC,CAAC,CAAA;AACnE;AAEA,SAAS,mBAAA,CAAoB,QAAsB,OAAA,EAAiC;AAClF,EAAA,MAAM,EAAE,GAAA,EAAK,GAAA,EAAI,GAAI,MAAA;AACrB,EAAA,MAAM,aAAA,GAAgB,QAAQ,MAAA,GAAY,GAAA,GAAA,CAAO,OAAO,GAAA,GAAM,CAAA,CAAA,GAAK,GAAA,IAAO,GAAA,GAAM,CAAA,CAAA,IAAM,CAAA;AACtF,EAAA,MAAM,SAAA,GAAY,GAAA,KAAQ,CAAA,IAAK,GAAA,KAAQ,MAAA;AACvC,EAAA,OACE,OAAA,CAAQ,OAAA,CAAQ,OAAA,CAAQ,WAAA,IAAe,aAAa,aAAA,GAAgB,yBAAA;AAExE;AAKA,SAAS,OAAA,CAAQ,IAAA,EAAc,MAAA,EAAgB,MAAA,EAAyB;AACtE,EAAA,MAAM,QAAA,GAAW,MAAA,CAAO,IAAA,EAAM,MAAM,CAAA,CAAE,IAAI,CAAC,IAAA,KAASF,2BAAA,CAAe,IAAI,CAAC,CAAA;AACxE,EAAA,OAAOD,oBAAA,CAAQ,MAAA,GAAS,CAAC,GAAG,QAAA,EAAUC,2BAAA,CAAeE,oBAAA,CAAQ,IAAI,CAAA,EAAG,IAAI,CAAC,CAAA,GAAI,QAAQ,CAAA;AACvF;AAGA,SAAS,oBAAA,CAAqB,IAAA,EAAc,MAAA,EAAsB,IAAA,EAA4B;AAC5F,EAAA,MAAM,EAAE,GAAA,EAAK,GAAA,EAAI,GAAI,MAAA;AACrB,EAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,IAAA,EAAM,GAAA,EAAK,IAAI,CAAC,CAAA;AAAA,EACtC;AACA,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,GAAA,GAAM,GAAA,GAAM,CAAA,EAAE,EAAG,CAAC,CAAA,EAAG,KAAA,KAAU,MAAM,KAAK,CAAA;AAC/E,EAAA,OAAOC,uBAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,KAAW,IAAA,CAAK,OAAA,CAAQ,IAAA,EAAM,MAAA,EAAQ,KAAK,CAAC,CAAC,CAAC,CAAA;AAC5E;AAQA,SAAS,cAAA,CAAe,QAAsB,OAAA,EAAgC;AAC5E,EAAA,MAAM,IAAA,GAAqB,CAAC,IAAA,KAC1B,OAAA,CAAQ,QAAQ,OAAA,CAAQ,SAAA,GAAYC,uBAAA,CAAW,IAAI,CAAA,GAAI,IAAA;AACzD,EAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,MAAA,EAAQ,OAAO,CAAA;AAC7C,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,OAAO,KAAK,KAAK,CAAA;AAAA,EACnB;AACA,EAAA,MAAM,IAAA,GAAO,cAAA,CAAe,MAAA,EAAQ,OAAO,CAAA;AAC3C,EAAA,MAAM,MAAA,GAAS,aAAa,MAAM,CAAA;AAClC,EAAA,OAAO,mBAAA,CAAoB,MAAA,EAAQ,OAAO,CAAA,GACtC,oBAAA,CAAqB,IAAA,EAAM,MAAA,EAAQ,IAAI,CAAA,GACvC,IAAA,CAAKF,oBAAA,CAAQ,IAAI,CAAC,CAAA;AACxB;AAEA,SAAS,mBAAmB,OAAA,EAAiC;AAC3D,EAAA,MAAM,EAAE,WAAA,EAAa,KAAA,EAAM,GAAI,QAAQ,OAAA,CAAQ,OAAA;AAC/C,EAAA,OAAO,WAAA,IAAe,KAAA,CAAM,GAAA,CAAIG,qBAAA,CAAU,mBAAmB,CAAA;AAC/D;AAGO,SAAS,SAAA,CAAU,QAAsB,OAAA,EAAgC;AAC9E,EAAA,IAAI,kBAAA,CAAmB,OAAO,CAAA,EAAG;AAC/B,IAAA,OAAO,cAAA,CAAe,QAAQ,OAAO,CAAA;AAAA,EACvC;AACA,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,MAAA,EAAQ,OAAO,CAAA;AACrC,EAAA,MAAM,MAAA,GAAS,aAAa,MAAM,CAAA;AAClC,EAAA,IAAI,mBAAA,CAAoB,MAAA,EAAQ,OAAO,CAAA,EAAG;AACxC,IAAA,OAAO,eAAA,CAAgB,MAAA,EAAQ,IAAA,EAAM,MAAM,CAAA;AAAA,EAC7C;AAEA,EAAA,MAAM,IAAA,GAAO,KAAK,IAAA,KAAS,OAAA,IAAW,KAAK,IAAA,KAAS,OAAA,GAAU,IAAA,GAAOH,oBAAA,CAAQ,IAAI,CAAA;AACjF,EAAA,OAAO,QAAQ,OAAA,CAAQ,OAAA,CAAQ,SAAA,GAAYE,uBAAA,CAAW,IAAI,CAAA,GAAI,IAAA;AAChE;;"}

package/dist/application/transform/schema/array-type.mjs

@@ -0,0 +1,103 @@
+import { irArray, irReadonly, irTuple, irTupleElement } from '../../../domain/ir/constructors.mjs';
+import { OutputFix } from '../../../domain/output-fixes.mjs';
+import { UNKNOWN_TYPE } from '../shared-types.mjs';
+import { unionOf } from '../type-combinators.mjs';
+
+const MAX_LENGTH_TUPLE_ELEMENTS = 30;
+function prefixTupleType(schema, request) {
+  const { items } = schema;
+  if (!schema.prefixItems && !Array.isArray(items)) {
+    return null;
+  }
+  const prefixItems = schema.prefixItems ?? items;
+  return irTuple(
+    prefixItems.map((item) => irTupleElement(request.transformNested(item, request.location)))
+  );
+}
+function singleItemType(schema, request) {
+  const { items } = schema;
+  return items ? request.transformNested(items, request.location) : UNKNOWN_TYPE;
+}
+function itemType(schema, request) {
+  const tuple = prefixTupleType(schema, request);
+  if (tuple !== null) {
+    return tuple;
+  }
+  const { items } = schema;
+  if (!items) {
+    return UNKNOWN_TYPE;
+  }
+  const nested = singleItemType(schema, request);
+  const isNestedArray = typeof items === "object" && "type" in items && items.type === "array";
+  return isNestedArray ? irArray(nested) : nested;
+}
+function repeat(type, count) {
+  return Array.from({ length: count }, () => type);
+}
+function lengthBounds(schema) {
+  const { minItems, maxItems } = schema;
+  const min = typeof minItems === "number" && minItems >= 0 ? minItems : 0;
+  const isMaxValid = typeof maxItems === "number" && maxItems >= 0 && min <= maxItems;
+  return { min, max: isMaxValid ? maxItems : void 0 };
+}
+function lengthTupleType(schema, item, bounds) {
+  const { min, max } = bounds;
+  if (min === max) {
+    return unionOf([irTuple(repeat(item, min).map((type) => irTupleElement(type)))]);
+  }
+  if (schema.maxItems > 0) {
+    const lengths = Array.from({ length: Math.max(0, (max ?? 0) - min + 1) }, (_, index) => index);
+    return unionOf(
+      lengths.map((length) => irTuple(repeat(item, length).map((type) => irTupleElement(type))))
+    );
+  }
+  const elements = repeat(item, min).map((type) => irTupleElement(type));
+  return irTuple([...elements, irTupleElement(irArray(item), true)]);
+}
+function isLengthTupleWanted(bounds, request) {
+  const { min, max } = bounds;
+  const estimatedSize = max === void 0 ? min : (max * (max + 1) - min * (min - 1)) / 2;
+  const hasBounds = min !== 0 || max !== void 0;
+  return request.context.options.arrayLength && hasBounds && estimatedSize < MAX_LENGTH_TUPLE_ELEMENTS;
+}
+function tupleOf(item, length, isOpen) {
+  const elements = repeat(item, length).map((type) => irTupleElement(type));
+  return irTuple(isOpen ? [...elements, irTupleElement(irArray(item), true)] : elements);
+}
+function fixedLengthTupleType(item, bounds, wrap) {
+  const { min, max } = bounds;
+  if (max === void 0) {
+    return wrap(tupleOf(item, min, true));
+  }
+  const lengths = Array.from({ length: max - min + 1 }, (_, index) => min + index);
+  return unionOf(lengths.map((length) => wrap(tupleOf(item, length, false))));
+}
+function fixedArrayType(schema, request) {
+  const wrap = (type) => request.context.options.immutable ? irReadonly(type) : type;
+  const tuple = prefixTupleType(schema, request);
+  if (tuple !== null) {
+    return wrap(tuple);
+  }
+  const item = singleItemType(schema, request);
+  const bounds = lengthBounds(schema);
+  return isLengthTupleWanted(bounds, request) ? fixedLengthTupleType(item, bounds, wrap) : wrap(irArray(item));
+}
+function isArrayLengthFixed(request) {
+  const { arrayLength, fixes } = request.context.options;
+  return arrayLength && fixes.has(OutputFix.ARRAY_LENGTH_TUPLES);
+}
+function arrayType(schema, request) {
+  if (isArrayLengthFixed(request)) {
+    return fixedArrayType(schema, request);
+  }
+  const item = itemType(schema, request);
+  const bounds = lengthBounds(schema);
+  if (isLengthTupleWanted(bounds, request)) {
+    return lengthTupleType(schema, item, bounds);
+  }
+  const type = item.kind === "tuple" || item.kind === "array" ? item : irArray(item);
+  return request.context.options.immutable ? irReadonly(type) : type;
+}
+
+export { arrayType };
+//# sourceMappingURL=array-type.mjs.map

package/dist/application/transform/schema/array-type.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-type.mjs","sources":["../../../../src/application/transform/schema/array-type.ts"],"sourcesContent":["import { irArray, irReadonly, irTuple, irTupleElement } from \"../../../domain/ir/constructors.js\";\nimport type { IrType } from \"../../../domain/ir/nodes.js\";\nimport type { SchemaObject } from \"../../../domain/openapi/schema-object.js\";\nimport { OutputFix } from \"../../../domain/output-fixes.js\";\nimport { UNKNOWN_TYPE } from \"../shared-types.js\";\nimport { unionOf } from \"../type-combinators.js\";\nimport type { SchemaRequest } from \"./schema-rule.js\";\n\n/**\n * `--array-length` writes tuples only while the estimated number of tuple elements stays below\n * this; the original chose it as roughly where TypeScript starts to struggle with tuple inference.\n */\nconst MAX_LENGTH_TUPLE_ELEMENTS = 30;\n\n/** The tuple of `prefixItems` (or of an `items` list); null without either. */\nfunction prefixTupleType(schema: SchemaObject, request: SchemaRequest): IrType | null {\n  const { items } = schema;\n  if (!schema.prefixItems && !Array.isArray(items)) {\n    return null;\n  }\n  const prefixItems = schema.prefixItems ?? (items as SchemaObject[]);\n  return irTuple(\n    prefixItems.map((item) => irTupleElement(request.transformNested(item, request.location))),\n  );\n}\n\n/** The type of one item; `unknown` without `items`. */\nfunction singleItemType(schema: SchemaObject, request: SchemaRequest): IrType {\n  const { items } = schema;\n  return items ? request.transformNested(items as SchemaObject, request.location) : UNKNOWN_TYPE;\n}\n\n/**\n * The item type as the original returns it: a tuple stands for the whole array, and a nested\n * `type: array` item is wrapped in an array here already.\n */\nfunction itemType(schema: SchemaObject, request: SchemaRequest): IrType {\n  const tuple = prefixTupleType(schema, request);\n  if (tuple !== null) {\n    return tuple;\n  }\n  const { items } = schema;\n  // Checked first: the `in` test below throws for `items: null`.\n  if (!items) {\n    return UNKNOWN_TYPE;\n  }\n  const nested = singleItemType(schema, request);\n  const isNestedArray = typeof items === \"object\" && \"type\" in items && items.type === \"array\";\n  return isNestedArray ? irArray(nested) : nested;\n}\n\nfunction repeat(type: IrType, count: number): IrType[] {\n  return Array.from({ length: count }, () => type);\n}\n\ninterface LengthBounds {\n  readonly min: number;\n  readonly max: number | undefined;\n}\n\nfunction lengthBounds(schema: SchemaObject): LengthBounds {\n  const { minItems, maxItems } = schema;\n  const min = typeof minItems === \"number\" && minItems >= 0 ? minItems : 0;\n  const isMaxValid = typeof maxItems === \"number\" && maxItems >= 0 && min <= maxItems;\n  return { min, max: isMaxValid ? maxItems : undefined };\n}\n\n/**\n * Tuples for `--array-length`, as the original builds them. With both bounds it emits tuples of\n * length 0 to `max - min` (not `min` to `max`); the `array-length-tuples` fix corrects it.\n */\nfunction lengthTupleType(schema: SchemaObject, item: IrType, bounds: LengthBounds): IrType {\n  const { min, max } = bounds;\n  if (min === max) {\n    return unionOf([irTuple(repeat(item, min).map((type) => irTupleElement(type)))]);\n  }\n  if ((schema.maxItems as number) > 0) {\n    const lengths = Array.from({ length: Math.max(0, (max ?? 0) - min + 1) }, (_, index) => index);\n    return unionOf(\n      lengths.map((length) => irTuple(repeat(item, length).map((type) => irTupleElement(type)))),\n    );\n  }\n  const elements = repeat(item, min).map((type) => irTupleElement(type));\n  return irTuple([...elements, irTupleElement(irArray(item), true)]);\n}\n\nfunction isLengthTupleWanted(bounds: LengthBounds, request: SchemaRequest): boolean {\n  const { min, max } = bounds;\n  const estimatedSize = max === undefined ? min : (max * (max + 1) - min * (min - 1)) / 2;\n  const hasBounds = min !== 0 || max !== undefined;\n  return (\n    request.context.options.arrayLength && hasBounds && estimatedSize < MAX_LENGTH_TUPLE_ELEMENTS\n  );\n}\n\n/** Applies `--immutable` to one array or tuple type. */\ntype ArrayWrapper = (type: IrType) => IrType;\n\nfunction tupleOf(item: IrType, length: number, isOpen: boolean): IrType {\n  const elements = repeat(item, length).map((type) => irTupleElement(type));\n  return irTuple(isOpen ? [...elements, irTupleElement(irArray(item), true)] : elements);\n}\n\n/** Tuples of every length from `min` to `max`; without `max`, `min` items and a rest element. */\nfunction fixedLengthTupleType(item: IrType, bounds: LengthBounds, wrap: ArrayWrapper): IrType {\n  const { min, max } = bounds;\n  if (max === undefined) {\n    return wrap(tupleOf(item, min, true));\n  }\n  const lengths = Array.from({ length: max - min + 1 }, (_, index) => min + index);\n  return unionOf(lengths.map((length) => wrap(tupleOf(item, length, false))));\n}\n\n/**\n * `type: array` with `--array-length` and the `array-length-tuples` fix (#2048, #2330, #2546):\n * the tuples have `min` to `max` items, the item type is used as it is (a nested array stays one\n * level deep), a `prefixItems` tuple gets no length tuples around it, and `--immutable` makes\n * every tuple `readonly`.\n */\nfunction fixedArrayType(schema: SchemaObject, request: SchemaRequest): IrType {\n  const wrap: ArrayWrapper = (type) =>\n    request.context.options.immutable ? irReadonly(type) : type;\n  const tuple = prefixTupleType(schema, request);\n  if (tuple !== null) {\n    return wrap(tuple);\n  }\n  const item = singleItemType(schema, request);\n  const bounds = lengthBounds(schema);\n  return isLengthTupleWanted(bounds, request)\n    ? fixedLengthTupleType(item, bounds, wrap)\n    : wrap(irArray(item));\n}\n\nfunction isArrayLengthFixed(request: SchemaRequest): boolean {\n  const { arrayLength, fixes } = request.context.options;\n  return arrayLength && fixes.has(OutputFix.ARRAY_LENGTH_TUPLES);\n}\n\n/** `type: array`, including tuples (`prefixItems`, array `items`) and `--array-length`. */\nexport function arrayType(schema: SchemaObject, request: SchemaRequest): IrType {\n  if (isArrayLengthFixed(request)) {\n    return fixedArrayType(schema, request);\n  }\n  const item = itemType(schema, request);\n  const bounds = lengthBounds(schema);\n  if (isLengthTupleWanted(bounds, request)) {\n    return lengthTupleType(schema, item, bounds);\n  }\n  // A tuple or an array item is used as the array type itself.\n  const type = item.kind === \"tuple\" || item.kind === \"array\" ? item : irArray(item);\n  return request.context.options.immutable ? irReadonly(type) : type;\n}\n"],"names":[],"mappings":";;;;;AAYA,MAAM,yBAAA,GAA4B,EAAA;AAGlC,SAAS,eAAA,CAAgB,QAAsB,OAAA,EAAuC;AACpF,EAAA,MAAM,EAAE,OAAM,GAAI,MAAA;AAClB,EAAA,IAAI,CAAC,MAAA,CAAO,WAAA,IAAe,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChD,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,WAAA,GAAc,OAAO,WAAA,IAAgB,KAAA;AAC3C,EAAA,OAAO,OAAA;AAAA,IACL,WAAA,CAAY,GAAA,CAAI,CAAC,IAAA,KAAS,cAAA,CAAe,OAAA,CAAQ,eAAA,CAAgB,IAAA,EAAM,OAAA,CAAQ,QAAQ,CAAC,CAAC;AAAA,GAC3F;AACF;AAGA,SAAS,cAAA,CAAe,QAAsB,OAAA,EAAgC;AAC5E,EAAA,MAAM,EAAE,OAAM,GAAI,MAAA;AAClB,EAAA,OAAO,QAAQ,OAAA,CAAQ,eAAA,CAAgB,KAAA,EAAuB,OAAA,CAAQ,QAAQ,CAAA,GAAI,YAAA;AACpF;AAMA,SAAS,QAAA,CAAS,QAAsB,OAAA,EAAgC;AACtE,EAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,MAAA,EAAQ,OAAO,CAAA;AAC7C,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,EAAE,OAAM,GAAI,MAAA;AAElB,EAAA,IAAI,CAAC,KAAA,EAAO;AACV,IAAA,OAAO,YAAA;AAAA,EACT;AACA,EAAA,MAAM,MAAA,GAAS,cAAA,CAAe,MAAA,EAAQ,OAAO,CAAA;AAC7C,EAAA,MAAM,gBAAgB,OAAO,KAAA,KAAU,YAAY,MAAA,IAAU,KAAA,IAAS,MAAM,IAAA,KAAS,OAAA;AACrF,EAAA,OAAO,aAAA,GAAgB,OAAA,CAAQ,MAAM,CAAA,GAAI,MAAA;AAC3C;AAEA,SAAS,MAAA,CAAO,MAAc,KAAA,EAAyB;AACrD,EAAA,OAAO,MAAM,IAAA,CAAK,EAAE,QAAQ,KAAA,EAAM,EAAG,MAAM,IAAI,CAAA;AACjD;AAOA,SAAS,aAAa,MAAA,EAAoC;AACxD,EAAA,MAAM,EAAE,QAAA,EAAU,QAAA,EAAS,GAAI,MAAA;AAC/B,EAAA,MAAM,MAAM,OAAO,QAAA,KAAa,QAAA,IAAY,QAAA,IAAY,IAAI,QAAA,GAAW,CAAA;AACvE,EAAA,MAAM,aAAa,OAAO,QAAA,KAAa,QAAA,IAAY,QAAA,IAAY,KAAK,GAAA,IAAO,QAAA;AAC3E,EAAA,OAAO,EAAE,GAAA,EAAK,GAAA,EAAK,UAAA,GAAa,WAAW,MAAA,EAAU;AACvD;AAMA,SAAS,eAAA,CAAgB,MAAA,EAAsB,IAAA,EAAc,MAAA,EAA8B;AACzF,EAAA,MAAM,EAAE,GAAA,EAAK,GAAA,EAAI,GAAI,MAAA;AACrB,EAAA,IAAI,QAAQ,GAAA,EAAK;AACf,IAAA,OAAO,OAAA,CAAQ,CAAC,OAAA,CAAQ,MAAA,CAAO,MAAM,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,SAAS,cAAA,CAAe,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;AAAA,EACjF;AACA,EAAA,IAAK,MAAA,CAAO,WAAsB,CAAA,EAAG;AACnC,IAAA,MAAM,UAAU,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAK,GAAA,CAAI,CAAA,EAAA,CAAI,GAAA,IAAO,CAAA,IAAK,MAAM,CAAC,CAAA,IAAK,CAAC,CAAA,EAAG,UAAU,KAAK,CAAA;AAC7F,IAAA,OAAO,OAAA;AAAA,MACL,QAAQ,GAAA,CAAI,CAAC,MAAA,KAAW,OAAA,CAAQ,OAAO,IAAA,EAAM,MAAM,CAAA,CAAE,GAAA,CAAI,CAAC,IAAA,KAAS,cAAA,CAAe,IAAI,CAAC,CAAC,CAAC;AAAA,KAC3F;AAAA,EACF;AACA,EAAA,MAAM,QAAA,GAAW,MAAA,CAAO,IAAA,EAAM,GAAG,CAAA,CAAE,IAAI,CAAC,IAAA,KAAS,cAAA,CAAe,IAAI,CAAC,CAAA;AACrE,EAAA,OAAO,OAAA,CAAQ,CAAC,GAAG,QAAA,EAAU,cAAA,CAAe,QAAQ,IAAI,CAAA,EAAG,IAAI,CAAC,CAAC,CAAA;AACnE;AAEA,SAAS,mBAAA,CAAoB,QAAsB,OAAA,EAAiC;AAClF,EAAA,MAAM,EAAE,GAAA,EAAK,GAAA,EAAI,GAAI,MAAA;AACrB,EAAA,MAAM,aAAA,GAAgB,QAAQ,MAAA,GAAY,GAAA,GAAA,CAAO,OAAO,GAAA,GAAM,CAAA,CAAA,GAAK,GAAA,IAAO,GAAA,GAAM,CAAA,CAAA,IAAM,CAAA;AACtF,EAAA,MAAM,SAAA,GAAY,GAAA,KAAQ,CAAA,IAAK,GAAA,KAAQ,MAAA;AACvC,EAAA,OACE,OAAA,CAAQ,OAAA,CAAQ,OAAA,CAAQ,WAAA,IAAe,aAAa,aAAA,GAAgB,yBAAA;AAExE;AAKA,SAAS,OAAA,CAAQ,IAAA,EAAc,MAAA,EAAgB,MAAA,EAAyB;AACtE,EAAA,MAAM,QAAA,GAAW,MAAA,CAAO,IAAA,EAAM,MAAM,CAAA,CAAE,IAAI,CAAC,IAAA,KAAS,cAAA,CAAe,IAAI,CAAC,CAAA;AACxE,EAAA,OAAO,OAAA,CAAQ,MAAA,GAAS,CAAC,GAAG,QAAA,EAAU,cAAA,CAAe,OAAA,CAAQ,IAAI,CAAA,EAAG,IAAI,CAAC,CAAA,GAAI,QAAQ,CAAA;AACvF;AAGA,SAAS,oBAAA,CAAqB,IAAA,EAAc,MAAA,EAAsB,IAAA,EAA4B;AAC5F,EAAA,MAAM,EAAE,GAAA,EAAK,GAAA,EAAI,GAAI,MAAA;AACrB,EAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,IAAA,EAAM,GAAA,EAAK,IAAI,CAAC,CAAA;AAAA,EACtC;AACA,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,GAAA,GAAM,GAAA,GAAM,CAAA,EAAE,EAAG,CAAC,CAAA,EAAG,KAAA,KAAU,MAAM,KAAK,CAAA;AAC/E,EAAA,OAAO,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,KAAW,IAAA,CAAK,OAAA,CAAQ,IAAA,EAAM,MAAA,EAAQ,KAAK,CAAC,CAAC,CAAC,CAAA;AAC5E;AAQA,SAAS,cAAA,CAAe,QAAsB,OAAA,EAAgC;AAC5E,EAAA,MAAM,IAAA,GAAqB,CAAC,IAAA,KAC1B,OAAA,CAAQ,QAAQ,OAAA,CAAQ,SAAA,GAAY,UAAA,CAAW,IAAI,CAAA,GAAI,IAAA;AACzD,EAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,MAAA,EAAQ,OAAO,CAAA;AAC7C,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,OAAO,KAAK,KAAK,CAAA;AAAA,EACnB;AACA,EAAA,MAAM,IAAA,GAAO,cAAA,CAAe,MAAA,EAAQ,OAAO,CAAA;AAC3C,EAAA,MAAM,MAAA,GAAS,aAAa,MAAM,CAAA;AAClC,EAAA,OAAO,mBAAA,CAAoB,MAAA,EAAQ,OAAO,CAAA,GACtC,oBAAA,CAAqB,IAAA,EAAM,MAAA,EAAQ,IAAI,CAAA,GACvC,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAC,CAAA;AACxB;AAEA,SAAS,mBAAmB,OAAA,EAAiC;AAC3D,EAAA,MAAM,EAAE,WAAA,EAAa,KAAA,EAAM,GAAI,QAAQ,OAAA,CAAQ,OAAA;AAC/C,EAAA,OAAO,WAAA,IAAe,KAAA,CAAM,GAAA,CAAI,SAAA,CAAU,mBAAmB,CAAA;AAC/D;AAGO,SAAS,SAAA,CAAU,QAAsB,OAAA,EAAgC;AAC9E,EAAA,IAAI,kBAAA,CAAmB,OAAO,CAAA,EAAG;AAC/B,IAAA,OAAO,cAAA,CAAe,QAAQ,OAAO,CAAA;AAAA,EACvC;AACA,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,MAAA,EAAQ,OAAO,CAAA;AACrC,EAAA,MAAM,MAAA,GAAS,aAAa,MAAM,CAAA;AAClC,EAAA,IAAI,mBAAA,CAAoB,MAAA,EAAQ,OAAO,CAAA,EAAG;AACxC,IAAA,OAAO,eAAA,CAAgB,MAAA,EAAQ,IAAA,EAAM,MAAM,CAAA;AAAA,EAC7C;AAEA,EAAA,MAAM,IAAA,GAAO,KAAK,IAAA,KAAS,OAAA,IAAW,KAAK,IAAA,KAAS,OAAA,GAAU,IAAA,GAAO,OAAA,CAAQ,IAAI,CAAA;AACjF,EAAA,OAAO,QAAQ,OAAA,CAAQ,OAAA,CAAQ,SAAA,GAAY,UAAA,CAAW,IAAI,CAAA,GAAI,IAAA;AAChE;;"}