@kubb/kit 5.15.4 → 5.16.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/README.md CHANGED
@@ -74,7 +74,7 @@ export const pluginExample = defineExtension({
74
74
 
75
75
  `ast` and `factory` are the node builders a generator calls to construct the file, schema, and operation nodes it returns. `Diagnostics` is the structured error a plugin throws to report a problem with a location and a fix suggestion, and `memoryStorage` and `fsStorage` are the built-in storage backends, useful in tests and custom configs.
76
76
 
77
- `macroDiscriminatorEnum`, `macroEnumName`, `macroRenameSchema`, and `macroSimplifyUnion` are the built-in macro presets, ready to pass to `ast.applyMacros` or a plugin's `setMacros`. Build a custom macro with `ast.defineMacro` instead.
77
+ `macroDedupeUnion`, `macroDiscriminatorEnum`, `macroEnumName`, and `macroRenameSchema` are the built-in macro presets, ready to pass to `ast.applyMacros` or a plugin's `setMacros`. Build a custom macro with `ast.defineMacro` instead.
78
78
 
79
79
  `childName`, `enumPropName`, `extractRefName`, `isStringType`, `mergeAdjacentObjectsLazy`, `syncSchemaRef`, and `containsCircularRef` are schema-name and schema-graph helpers a generator or macro calls while shaping output, complementing the ref and graph helpers (`resolveRefName`, `findCircularSchemas`, `collectUsedSchemaNames`) that stay on `ast`.
80
80
 
package/dist/index.cjs CHANGED
@@ -76,6 +76,55 @@ var Url = class {
76
76
  return `\`${prefix ?? ""}${result}\``;
77
77
  }
78
78
  };
79
+ // src/macros/macroDedupeUnion.ts
80
+ /**
81
+ * Drops members that repeat an earlier one, ignoring the source `pointer` so equal schemas from
82
+ * different places in the spec still match.
83
+ */
84
+ function dedupeMembers(members) {
85
+ const seen = /* @__PURE__ */ new Set();
86
+ const keys = /* @__PURE__ */ new WeakMap();
87
+ function key(value) {
88
+ if (value === null || typeof value !== "object") return JSON.stringify(value) ?? "undefined";
89
+ if (value instanceof Date) return key(value.toJSON());
90
+ const cached = keys.get(value);
91
+ if (cached) return cached;
92
+ const node = value;
93
+ const skipsSchema = node.kind === _kubb_ast.ast.nodeKinds.schema && node.type === _kubb_ast.ast.schemaTypes.ref && typeof node.ref === "string";
94
+ const entries = Array.isArray(value) ? value.map(key) : Object.entries(value).filter(([name, child]) => name !== "pointer" && child !== void 0 && !(skipsSchema && name === "schema")).map(([name, child]) => [name, key(child)]);
95
+ const result = (0, node_crypto.hash)("sha256", JSON.stringify([Array.isArray(value), entries]));
96
+ keys.set(value, result);
97
+ return result;
98
+ }
99
+ return members.filter((member) => {
100
+ const memberKey = key(member);
101
+ if (seen.has(memberKey)) return false;
102
+ seen.add(memberKey);
103
+ return true;
104
+ });
105
+ }
106
+ /**
107
+ * Removes union members that repeat an earlier one. Enum members next to a broader scalar, such as
108
+ * `anyOf: [string, enum]`, are kept so the known values survive in the generated code.
109
+ *
110
+ * @example
111
+ * ```ts
112
+ * const next = applyMacros(unionSchema, [macroDedupeUnion], { depth: 'shallow' })
113
+ * ```
114
+ */
115
+ const macroDedupeUnion = _kubb_ast.ast.defineMacro({
116
+ name: "dedupe-union",
117
+ schema(node) {
118
+ const unionNode = _kubb_ast.ast.narrowSchema(node, _kubb_ast.ast.schemaTypes.union);
119
+ if (!unionNode?.members?.length) return void 0;
120
+ const deduped = dedupeMembers(unionNode.members);
121
+ if (deduped.length === unionNode.members.length) return void 0;
122
+ return {
123
+ ...unionNode,
124
+ members: deduped
125
+ };
126
+ }
127
+ });
79
128
  // src/macros/macroDiscriminatorEnum.ts
80
129
  /**
81
130
  * Picks the enum primitive from the type of the first value.
@@ -250,79 +299,6 @@ function macroEnumName({ parentName, propName, enumSuffix }) {
250
299
  }
251
300
  });
252
301
  }
253
- // src/macros/macroSimplifyUnion.ts
254
- const SCALAR_PRIMITIVE_TYPES = /* @__PURE__ */ new Set([
255
- _kubb_ast.ast.schemaTypes.string,
256
- _kubb_ast.ast.schemaTypes.number,
257
- _kubb_ast.ast.schemaTypes.integer,
258
- _kubb_ast.ast.schemaTypes.bigint,
259
- _kubb_ast.ast.schemaTypes.boolean
260
- ]);
261
- /**
262
- * Drops members that repeat an earlier one, ignoring the source `pointer` so equal schemas from
263
- * different places in the spec still match.
264
- */
265
- function dedupeMembers(members) {
266
- const seen = /* @__PURE__ */ new Set();
267
- const keys = /* @__PURE__ */ new WeakMap();
268
- function key(value) {
269
- if (value === null || typeof value !== "object") return JSON.stringify(value) ?? "undefined";
270
- if (value instanceof Date) return key(value.toJSON());
271
- const cached = keys.get(value);
272
- if (cached) return cached;
273
- const node = value;
274
- const skipsSchema = node.kind === _kubb_ast.ast.nodeKinds.schema && node.type === _kubb_ast.ast.schemaTypes.ref && typeof node.ref === "string";
275
- const entries = Array.isArray(value) ? value.map(key) : Object.entries(value).filter(([name, child]) => name !== "pointer" && child !== void 0 && !(skipsSchema && name === "schema")).map(([name, child]) => [name, key(child)]);
276
- const result = (0, node_crypto.hash)("sha256", JSON.stringify([Array.isArray(value), entries]));
277
- keys.set(value, result);
278
- return result;
279
- }
280
- return members.filter((member) => {
281
- const memberKey = key(member);
282
- if (seen.has(memberKey)) return false;
283
- seen.add(memberKey);
284
- return true;
285
- });
286
- }
287
- /**
288
- * Filters union members, dropping enum members that a broader scalar primitive already covers.
289
- */
290
- function simplifyUnionMembers(members) {
291
- const scalarPrimitives = new Set(members.filter((member) => SCALAR_PRIMITIVE_TYPES.has(member.type)).map((m) => m.type));
292
- if (!scalarPrimitives.size) return members;
293
- return members.filter((member) => {
294
- const enumNode = _kubb_ast.ast.narrowSchema(member, _kubb_ast.ast.schemaTypes.enum);
295
- if (!enumNode) return true;
296
- const primitive = enumNode.primitive;
297
- if (!primitive) return true;
298
- if ((enumNode.namedEnumValues?.length ?? enumNode.enumValues?.length ?? 0) <= 1) return true;
299
- if (scalarPrimitives.has(primitive)) return false;
300
- if ((primitive === _kubb_ast.ast.schemaTypes.integer || primitive === _kubb_ast.ast.schemaTypes.number) && (scalarPrimitives.has(_kubb_ast.ast.schemaTypes.integer) || scalarPrimitives.has(_kubb_ast.ast.schemaTypes.number))) return false;
301
- return true;
302
- });
303
- }
304
- /**
305
- * Removes union members that repeat an earlier one, and members a broader scalar primitive already
306
- * covers, such as a multi-value string enum sitting next to a plain `string`. Single-value enums are kept.
307
- *
308
- * @example
309
- * ```ts
310
- * const next = applyMacros(unionSchema, [macroSimplifyUnion], { depth: 'shallow' })
311
- * ```
312
- */
313
- const macroSimplifyUnion = _kubb_ast.ast.defineMacro({
314
- name: "simplify-union",
315
- schema(node) {
316
- const unionNode = _kubb_ast.ast.narrowSchema(node, _kubb_ast.ast.schemaTypes.union);
317
- if (!unionNode?.members?.length) return void 0;
318
- const simplified = simplifyUnionMembers(dedupeMembers(unionNode.members));
319
- if (simplified.length === unionNode.members.length) return void 0;
320
- return {
321
- ...unionNode,
322
- members: simplified
323
- };
324
- }
325
- });
326
302
  // src/utils/mergeAdjacentSchemas.ts
327
303
  /**
328
304
  * Merges a run of adjacent anonymous object members into one. Named or non-object members break the
@@ -494,9 +470,9 @@ Object.defineProperty(exports, "kubbContext", {
494
470
  return _kubb_core.kubbContext;
495
471
  }
496
472
  });
473
+ exports.macroDedupeUnion = macroDedupeUnion;
497
474
  exports.macroDiscriminatorEnum = macroDiscriminatorEnum;
498
475
  exports.macroEnumName = macroEnumName;
499
- exports.macroSimplifyUnion = macroSimplifyUnion;
500
476
  Object.defineProperty(exports, "manifestProblems", {
501
477
  enumerable: true,
502
478
  get: function() {
@@ -1 +1 @@
1
- {"version":3,"file":"index.cjs","names":["ast","pascalCase","ast","pascalCase","ast","ast","hash","ast","ast"],"sources":["../src/Url.ts","../src/macros/macroDiscriminatorEnum.ts","../../../internals/utils/src/casing.ts","../src/utils/refs.ts","../src/macros/macroEnumName.ts","../src/macros/macroSimplifyUnion.ts","../src/utils/mergeAdjacentSchemas.ts","../src/utils/schemaGraph.ts"],"sourcesContent":["/**\n * Sanitizes a parameter name so it is safe to use as a `path-to-regexp` capture name, without\n * routing through {@link camelCase} (which keeps a leading `$` since it is a valid JS identifier\n * character). Runs of disallowed characters are treated as word boundaries; a boundary at the\n * very start of the name (e.g. the `$` in `$id`) still capitalizes the word that follows it.\n */\nfunction transformPathParam(raw: string): string {\n // `path-to-regexp` (used by MSW/Express) only accepts `[A-Za-z0-9_]` in a parameter name. It stops\n // reading at the first other character (a hyphen, a dot, a `$`, ...), which misparses the route or\n // throws \"Missing parameter name\".\n if (/^[A-Za-z0-9_]+$/.test(raw)) {\n return raw\n }\n\n const startsWithSafeChar = /^[A-Za-z_]/.test(raw)\n const words = raw.split(/[^A-Za-z0-9]+/).filter(Boolean)\n\n return words\n .map((word, i) => {\n const capitalize = !startsWithSafeChar || i > 0\n return capitalize ? word.charAt(0).toUpperCase() + word.slice(1) : word.charAt(0).toLowerCase() + word.slice(1)\n })\n .join('')\n}\n\n/**\n * Renders how a grouped `path` object's member is accessed: dot access for an identifier (reserved\n * words are valid property names), bracket access with the raw name otherwise.\n */\nfunction groupedAccessor(name: string): string {\n return /^[a-zA-Z_$][a-zA-Z0-9_$]*$/.test(name) ? `.${name}` : `[${JSON.stringify(name)}]`\n}\n\n/**\n * Static helpers for OpenAPI/Swagger paths: template syntax conversion, parameter extraction, and URL composition.\n */\nexport class Url {\n /**\n * Converts an OpenAPI/Swagger path to Express-style colon syntax.\n *\n * Distinct parameter names that normalize to the same identifier (e.g. `{group-id}` and\n * `{group.id}` both becoming `groupId`) are deduplicated with an incrementing suffix so\n * `path-to-regexp` never sees two identically named captures.\n *\n * @example\n * Url.toPath('/pet/{petId}') // '/pet/:petId'\n *\n * @example\n * Url.toPath('/point/{point-id}') // '/point/:pointId'\n *\n * @example\n * Url.toPath('/groups/{group-id}/{group.id}.json') // '/groups/:groupId/:groupId2.json'\n */\n static toPath(path: string): string {\n const seen = new Map<string, number>()\n\n return path.replace(/\\{([^}]+)\\}/g, (_match, param: string) => {\n const base = transformPathParam(param)\n const count = (seen.get(base) ?? 0) + 1\n seen.set(base, count)\n\n return count === 1 ? `:${base}` : `:${base}${count}`\n })\n }\n\n /**\n * Converts an OpenAPI/Swagger path to a template literal that reads each parameter off a\n * grouped `path` request option, e.g. `/pet/{petId}` becomes `` `/pet/${path.petId}` ``.\n * Parameter names are kept exactly as they appear in the OpenAPI path; a name falls back to\n * bracket access (`` path['pet-id'] ``) only when it isn't a valid JS identifier.\n * `prefix` is prepended inside the literal. Shared by generators that pass a grouped `path` object.\n *\n * @example\n * Url.toGroupedTemplateString('/pet/{petId}') // '`/pet/${path.petId}`'\n *\n * @example\n * Url.toGroupedTemplateString('/user/{monetary-account-id}') // '`/user/${path[\"monetary-account-id\"]}`'\n */\n static toGroupedTemplateString(path: string, { prefix }: { prefix?: string | null } = {}): string {\n const parts = path.split(/\\{([^}]+)\\}/)\n const result = parts.map((part, i) => (i % 2 === 0 ? part : `\\${path${groupedAccessor(part)}}`)).join('')\n\n return `\\`${prefix ?? ''}${result}\\``\n }\n}\n","import { ast } from '@kubb/ast'\n\ntype Props = {\n propertyName: string\n values: Array<string | number | boolean>\n enumName?: string\n}\n\n/**\n * Picks the enum primitive from the type of the first value.\n */\nexport function enumPrimitive(values: Props['values']): 'string' | 'number' | 'boolean' {\n return typeof values[0] === 'number' ? 'number' : typeof values[0] === 'boolean' ? 'boolean' : 'string'\n}\n\n/**\n * Builds a macro that replaces a discriminator property's schema with an enum of the given\n * values. The enum is a string, number or boolean enum, following the first value. Object schemas\n * that lack the property are returned unchanged.\n *\n * @example\n * ```ts\n * const macro = macroDiscriminatorEnum({ propertyName: 'type', values: ['dog', 'cat'] })\n * const next = applyMacros(objectSchema, [macro], { depth: 'shallow' })\n * ```\n */\nexport function macroDiscriminatorEnum({ propertyName, values, enumName }: Props) {\n return ast.defineMacro({\n name: 'discriminator-enum',\n schema(node) {\n const objectNode = ast.narrowSchema(node, 'object')\n if (!objectNode?.properties?.length) return undefined\n if (!objectNode.properties.some((prop) => prop.name === propertyName)) return undefined\n\n return ast.factory.createSchema({\n ...objectNode,\n properties: objectNode.properties.map((prop) => {\n if (prop.name !== propertyName) return prop\n\n return ast.factory.createProperty({\n ...prop,\n schema: ast.factory.createSchema({\n type: 'enum',\n primitive: enumPrimitive(values),\n enumValues: values,\n name: enumName,\n readOnly: prop.schema.readOnly,\n writeOnly: prop.schema.writeOnly,\n }),\n })\n }),\n })\n },\n })\n}\n","type Options = {\n /**\n * Text prepended before casing is applied.\n */\n prefix?: string\n /**\n * Text appended before casing is applied.\n */\n suffix?: string\n}\n\n/**\n * Shared implementation for camelCase and PascalCase conversion.\n * Splits on common word boundaries (spaces, hyphens, underscores, dots, slashes, colons)\n * and capitalizes each word according to `pascal`.\n *\n * When `pascal` is `true` the first word is also capitalized (PascalCase), otherwise only subsequent words are.\n */\nfunction convert(text: string, pascal: boolean): string {\n return text\n .trim()\n .replace(/([a-z\\d])([A-Z])/g, '$1 $2')\n .replace(/([A-Z]+)([A-Z][a-z])/g, '$1 $2')\n .replace(/(\\d)([a-z])/g, '$1 $2')\n .split(/[\\s\\-_./\\\\:]+/)\n .filter(Boolean)\n .map((word, i) => {\n if (word.length > 1 && word === word.toUpperCase()) return word\n const head = i === 0 && !pascal ? word.charAt(0).toLowerCase() : word.charAt(0).toUpperCase()\n return head + word.slice(1)\n })\n .join('')\n .replace(/[^a-zA-Z0-9]/g, '')\n}\n\n// Plugins case the same names on every visit. Clearing at the limit bounds a long-running host.\nconst cache = new Map<string, string>()\nconst cacheLimit = 100_000\n\nfunction toCamelOrPascal(text: string, pascal: boolean): string {\n const key = `${pascal ? 'P' : 'c'}${text}`\n const cached = cache.get(key)\n if (cached !== undefined) return cached\n\n const result = convert(text, pascal)\n if (cache.size >= cacheLimit) cache.clear()\n cache.set(key, result)\n return result\n}\n\n/**\n * Converts `text` to camelCase.\n *\n * @example Word boundaries\n * `camelCase('hello-world') // 'helloWorld'`\n *\n * @example With a prefix\n * `camelCase('tag', { prefix: 'create' }) // 'createTag'`\n */\nexport function camelCase(text: string, { prefix = '', suffix = '' }: Options = {}): string {\n return toCamelOrPascal(`${prefix} ${text} ${suffix}`, false)\n}\n\n/**\n * Converts `text` to PascalCase.\n *\n * @example Word boundaries\n * `pascalCase('hello-world') // 'HelloWorld'`\n *\n * @example With a suffix\n * `pascalCase('tag', { suffix: 'schema' }) // 'TagSchema'`\n */\nexport function pascalCase(text: string, { prefix = '', suffix = '' }: Options = {}): string {\n return toCamelOrPascal(`${prefix} ${text} ${suffix}`, true)\n}\n","import { ast } from '@kubb/ast'\nimport type { SchemaNode, SchemaType } from '@kubb/ast'\nimport { pascalCase } from '@internals/utils'\n\nconst plainStringTypes = new Set<SchemaType>(['string', 'uuid', 'email', 'url', 'datetime'] as const)\n\n/** Returns the last path segment of a reference string, for example `'Pet'` for `#/components/schemas/Pet`. */\nexport const extractRefName = ast.refName\n\n/**\n * Builds a PascalCase child schema name by joining a parent name and property name.\n * Returns `null` when there is no parent to nest under.\n *\n * @example Nested under a parent\n * `childName('Order', 'shipping_address') // 'OrderShippingAddress'`\n *\n * @example No parent\n * `childName(undefined, 'params') // null`\n */\nexport function childName(parentName: string | null | undefined, propName: string): string | null {\n return parentName ? pascalCase([parentName, propName].join(' ')) : null\n}\n\n/**\n * Builds a PascalCase enum name from the parent name, property name, and a suffix, skipping any\n * empty parts.\n *\n * @example\n * `enumPropName('Order', 'status', 'enum') // 'OrderStatusEnum'`\n */\nexport function enumPropName(parentName: string | null | undefined, propName: string, enumSuffix: string): string {\n return pascalCase([parentName, propName, enumSuffix].filter(Boolean).join(' '))\n}\n\n/**\n * Applies `ast.mergeRefWithSchema()` to a resolved ref and rebuilds the result through\n * `ast.factory.createSchema()`. Non-ref nodes and unresolved refs are returned unchanged.\n *\n * @example\n * ```ts\n * const ref = ast.factory.createSchema({ type: 'ref', ref: '#/components/schemas/Pet', description: 'A cute pet' })\n * const merged = syncSchemaRef(ref) // merges with resolved Pet schema\n * ```\n */\nexport function syncSchemaRef(node: SchemaNode): SchemaNode {\n const ref = ast.narrowSchema(node, 'ref')\n\n if (!ref?.schema) return node\n\n return ast.factory.createSchema(ast.mergeRefWithSchema(ref))\n}\n\n/**\n * Returns `true` when a schema emits as a plain `string` type.\n *\n * Covers `string`, `uuid`, `email`, `url`, and `datetime` types. For `date` and `time`\n * types, returns `true` only when `representation` is `'string'` rather than `'date'`.\n */\nexport function isStringType(node: SchemaNode): boolean {\n if (plainStringTypes.has(node.type)) {\n return true\n }\n\n const temporal = ast.narrowSchema(node, 'date') ?? ast.narrowSchema(node, 'time')\n if (temporal) {\n return temporal.representation !== 'date'\n }\n\n return false\n}\n","import { ast } from '@kubb/ast'\nimport { enumPropName } from '../utils/refs.ts'\n\ntype Props = {\n parentName: string | null | undefined\n propName: string\n enumSuffix: string\n}\n\n/**\n * Builds a macro that names an inline enum schema from its parent and property name. Boolean enums\n * are left anonymous. Non-enum nodes are returned unchanged.\n *\n * @example\n * ```ts\n * const macro = macroEnumName({ parentName: 'Pet', propName: 'status', enumSuffix: 'enum' })\n * const named = applyMacros(propSchema, [macro], { depth: 'shallow' })\n * ```\n */\nexport function macroEnumName({ parentName, propName, enumSuffix }: Props) {\n return ast.defineMacro({\n name: 'enum-name',\n schema(node) {\n const enumNode = ast.narrowSchema(node, 'enum')\n\n if (enumNode?.primitive === 'boolean') return { ...node, name: null }\n if (enumNode) return { ...node, name: enumPropName(parentName, propName, enumSuffix) }\n\n return undefined\n },\n })\n}\n","import { hash } from 'node:crypto'\nimport { ast } from '@kubb/ast'\nimport type { SchemaNode } from '@kubb/ast'\n\nconst SCALAR_PRIMITIVE_TYPES = new Set<string>([\n ast.schemaTypes.string,\n ast.schemaTypes.number,\n ast.schemaTypes.integer,\n ast.schemaTypes.bigint,\n ast.schemaTypes.boolean,\n])\n\n/**\n * Drops members that repeat an earlier one, ignoring the source `pointer` so equal schemas from\n * different places in the spec still match.\n */\nfunction dedupeMembers(members: Array<SchemaNode>): Array<SchemaNode> {\n const seen = new Set<string>()\n const keys = new WeakMap<object, string>()\n\n function key(value: unknown): string {\n if (value === null || typeof value !== 'object') return JSON.stringify(value) ?? 'undefined'\n if (value instanceof Date) return key(value.toJSON())\n const cached = keys.get(value)\n if (cached) return cached\n\n // A ref node's `ref` pointer already identifies its target, so hashing its resolved `schema` as\n // well only walks the same component graph again for every union that references it. The `kind`\n // check keeps plain data under `default` or `examples` hashed in full.\n const node = value as Partial<SchemaNode>\n const skipsSchema = node.kind === ast.nodeKinds.schema && node.type === ast.schemaTypes.ref && typeof node.ref === 'string'\n // Hash each shared subtree once instead of expanding resolved refs into a giant string.\n const entries = Array.isArray(value)\n ? value.map(key)\n : Object.entries(value)\n .filter(([name, child]) => name !== 'pointer' && child !== undefined && !(skipsSchema && name === 'schema'))\n .map(([name, child]) => [name, key(child)])\n const result = hash('sha256', JSON.stringify([Array.isArray(value), entries]))\n keys.set(value, result)\n return result\n }\n\n return members.filter((member) => {\n const memberKey = key(member)\n if (seen.has(memberKey)) return false\n seen.add(memberKey)\n\n return true\n })\n}\n\n/**\n * Filters union members, dropping enum members that a broader scalar primitive already covers.\n */\nfunction simplifyUnionMembers(members: Array<SchemaNode>): Array<SchemaNode> {\n const scalarPrimitives = new Set<string>(members.filter((member) => SCALAR_PRIMITIVE_TYPES.has(member.type)).map((m) => m.type))\n if (!scalarPrimitives.size) return members\n\n return members.filter((member) => {\n const enumNode = ast.narrowSchema(member, ast.schemaTypes.enum)\n if (!enumNode) return true\n\n const primitive = enumNode.primitive\n if (!primitive) return true\n\n const enumValueCount = enumNode.namedEnumValues?.length ?? enumNode.enumValues?.length ?? 0\n if (enumValueCount <= 1) return true\n\n if (scalarPrimitives.has(primitive)) return false\n if (\n (primitive === ast.schemaTypes.integer || primitive === ast.schemaTypes.number) &&\n (scalarPrimitives.has(ast.schemaTypes.integer) || scalarPrimitives.has(ast.schemaTypes.number))\n )\n return false\n\n return true\n })\n}\n\n/**\n * Removes union members that repeat an earlier one, and members a broader scalar primitive already\n * covers, such as a multi-value string enum sitting next to a plain `string`. Single-value enums are kept.\n *\n * @example\n * ```ts\n * const next = applyMacros(unionSchema, [macroSimplifyUnion], { depth: 'shallow' })\n * ```\n */\nexport const macroSimplifyUnion = ast.defineMacro({\n name: 'simplify-union',\n schema(node) {\n const unionNode = ast.narrowSchema(node, ast.schemaTypes.union)\n if (!unionNode?.members?.length) return undefined\n\n const simplified = simplifyUnionMembers(dedupeMembers(unionNode.members))\n if (simplified.length === unionNode.members.length) return undefined\n\n return { ...unionNode, members: simplified }\n },\n})\n","import { ast } from '@kubb/ast'\nimport type { SchemaNode } from '@kubb/ast'\n\n/**\n * Merges a run of adjacent anonymous object members into one. Named or non-object members break the\n * run and pass through unchanged. The merge follows member order, so callers control which members\n * combine by where they place them in the sequence.\n *\n * @example\n * ```ts\n * const merged = [...mergeAdjacentObjectsLazy([objectA, objectB])]\n * ```\n */\nexport function* mergeAdjacentObjectsLazy(members: Iterable<SchemaNode>): Generator<SchemaNode, void, undefined> {\n let acc: SchemaNode | undefined\n\n for (const member of members) {\n const objectMember = ast.narrowSchema(member, 'object')\n if (objectMember && !objectMember.name && acc !== undefined) {\n const accObject = ast.narrowSchema(acc, 'object')\n if (accObject && !accObject.name) {\n acc = ast.factory.createSchema({\n ...accObject,\n properties: [...(accObject.properties ?? []), ...(objectMember.properties ?? [])],\n })\n continue\n }\n }\n if (acc !== undefined) yield acc\n acc = member\n }\n\n if (acc !== undefined) yield acc\n}\n","import { ast } from '@kubb/ast'\nimport type { SchemaNode } from '@kubb/ast'\n\n/**\n * Returns `true` when a schema, or anything nested inside it, references a circular schema.\n *\n * Pass `excludeName` to skip refs to a specific schema, which helps when self-references are handled\n * on their own. Pair it with `ast.findCircularSchemas()` to decide where lazy wrappers go.\n *\n * @note Reads the memoized `ast.collectSchemaRefs()` set, so a schema is scanned once across plugins.\n */\nexport function containsCircularRef(\n node: SchemaNode | undefined,\n { circularSchemas, excludeName }: { circularSchemas: ReadonlySet<string>; excludeName?: string },\n): boolean {\n if (!node || circularSchemas.size === 0) return false\n\n for (const name of ast.collectSchemaRefs(node)) {\n if (name !== excludeName && circularSchemas.has(name)) return true\n }\n\n return false\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAMA,SAAS,mBAAmB,KAAqB;CAI/C,IAAI,kBAAkB,KAAK,GAAG,GAC5B,OAAO;CAGT,MAAM,qBAAqB,aAAa,KAAK,GAAG;CAGhD,OAFc,IAAI,MAAM,eAAe,CAAC,CAAC,OAAO,OAErC,CAAC,CACT,KAAK,MAAM,MAAM;EAEhB,OADmB,CAAC,sBAAsB,IAAI,IAC1B,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KAAK,MAAM,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KAAK,MAAM,CAAC;CAChH,CAAC,CAAC,CACD,KAAK,EAAE;AACZ;;;;;AAMA,SAAS,gBAAgB,MAAsB;CAC7C,OAAO,6BAA6B,KAAK,IAAI,IAAI,IAAI,SAAS,IAAI,KAAK,UAAU,IAAI,EAAE;AACzF;;;;AAKA,IAAa,MAAb,MAAiB;;;;;;;;;;;;;;;;;CAiBf,OAAO,OAAO,MAAsB;EAClC,MAAM,uBAAO,IAAI,IAAoB;EAErC,OAAO,KAAK,QAAQ,iBAAiB,QAAQ,UAAkB;GAC7D,MAAM,OAAO,mBAAmB,KAAK;GACrC,MAAM,SAAS,KAAK,IAAI,IAAI,KAAK,KAAK;GACtC,KAAK,IAAI,MAAM,KAAK;GAEpB,OAAO,UAAU,IAAI,IAAI,SAAS,IAAI,OAAO;EAC/C,CAAC;CACH;;;;;;;;;;;;;;CAeA,OAAO,wBAAwB,MAAc,EAAE,WAAuC,CAAC,GAAW;EAEhG,MAAM,SADQ,KAAK,MAAM,aACN,CAAC,CAAC,KAAK,MAAM,MAAO,IAAI,MAAM,IAAI,OAAO,UAAU,gBAAgB,IAAI,EAAE,EAAG,CAAC,CAAC,KAAK,EAAE;EAExG,OAAO,KAAK,UAAU,KAAK,OAAO;CACpC;AACF;;;;;ACzEA,SAAgB,cAAc,QAA0D;CACtF,OAAO,OAAO,OAAO,OAAO,WAAW,WAAW,OAAO,OAAO,OAAO,YAAY,YAAY;AACjG;;;;;;;;;;;;AAaA,SAAgB,uBAAuB,EAAE,cAAc,QAAQ,YAAmB;CAChF,OAAOA,UAAAA,IAAI,YAAY;EACrB,MAAM;EACN,OAAO,MAAM;GACX,MAAM,aAAaA,UAAAA,IAAI,aAAa,MAAM,QAAQ;GAClD,IAAI,CAAC,YAAY,YAAY,QAAQ,OAAO,KAAA;GAC5C,IAAI,CAAC,WAAW,WAAW,MAAM,SAAS,KAAK,SAAS,YAAY,GAAG,OAAO,KAAA;GAE9E,OAAOA,UAAAA,IAAI,QAAQ,aAAa;IAC9B,GAAG;IACH,YAAY,WAAW,WAAW,KAAK,SAAS;KAC9C,IAAI,KAAK,SAAS,cAAc,OAAO;KAEvC,OAAOA,UAAAA,IAAI,QAAQ,eAAe;MAChC,GAAG;MACH,QAAQA,UAAAA,IAAI,QAAQ,aAAa;OAC/B,MAAM;OACN,WAAW,cAAc,MAAM;OAC/B,YAAY;OACZ,MAAM;OACN,UAAU,KAAK,OAAO;OACtB,WAAW,KAAK,OAAO;MACzB,CAAC;KACH,CAAC;IACH,CAAC;GACH,CAAC;EACH;CACF,CAAC;AACH;;;;;;;;;ACpCA,SAAS,QAAQ,MAAc,QAAyB;CACtD,OAAO,KACJ,KAAK,CAAC,CACN,QAAQ,qBAAqB,OAAO,CAAC,CACrC,QAAQ,yBAAyB,OAAO,CAAC,CACzC,QAAQ,gBAAgB,OAAO,CAAC,CAChC,MAAM,eAAe,CAAC,CACtB,OAAO,OAAO,CAAC,CACf,KAAK,MAAM,MAAM;EAChB,IAAI,KAAK,SAAS,KAAK,SAAS,KAAK,YAAY,GAAG,OAAO;EAE3D,QADa,MAAM,KAAK,CAAC,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,KAC9E,KAAK,MAAM,CAAC;CAC5B,CAAC,CAAC,CACD,KAAK,EAAE,CAAC,CACR,QAAQ,iBAAiB,EAAE;AAChC;AAGA,MAAM,wBAAQ,IAAI,IAAoB;AACtC,MAAM,aAAa;AAEnB,SAAS,gBAAgB,MAAc,QAAyB;CAC9D,MAAM,MAAM,GAAG,SAAS,MAAM,MAAM;CACpC,MAAM,SAAS,MAAM,IAAI,GAAG;CAC5B,IAAI,WAAW,KAAA,GAAW,OAAO;CAEjC,MAAM,SAAS,QAAQ,MAAM,MAAM;CACnC,IAAI,MAAM,QAAQ,YAAY,MAAM,MAAM;CAC1C,MAAM,IAAI,KAAK,MAAM;CACrB,OAAO;AACT;;;;;;;;;;AAwBA,SAAgBC,aAAW,MAAc,EAAE,SAAS,IAAI,SAAS,OAAgB,CAAC,GAAW;CAC3F,OAAO,gBAAgB,GAAG,OAAO,GAAG,KAAK,GAAG,UAAU,IAAI;AAC5D;;;ACtEA,MAAM,mCAAmB,IAAI,IAAgB;CAAC;CAAU;CAAQ;CAAS;CAAO;AAAU,CAAU;;AAGpG,MAAa,iBAAiBC,UAAAA,IAAI;;;;;;;;;;;AAYlC,SAAgB,UAAU,YAAuC,UAAiC;CAChG,OAAO,aAAaC,aAAW,CAAC,YAAY,QAAQ,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI;AACrE;;;;;;;;AASA,SAAgB,aAAa,YAAuC,UAAkB,YAA4B;CAChH,OAAOA,aAAW;EAAC;EAAY;EAAU;CAAU,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC;AAChF;;;;;;;;;;;AAYA,SAAgB,cAAc,MAA8B;CAC1D,MAAM,MAAMD,UAAAA,IAAI,aAAa,MAAM,KAAK;CAExC,IAAI,CAAC,KAAK,QAAQ,OAAO;CAEzB,OAAOA,UAAAA,IAAI,QAAQ,aAAaA,UAAAA,IAAI,mBAAmB,GAAG,CAAC;AAC7D;;;;;;;AAQA,SAAgB,aAAa,MAA2B;CACtD,IAAI,iBAAiB,IAAI,KAAK,IAAI,GAChC,OAAO;CAGT,MAAM,WAAWA,UAAAA,IAAI,aAAa,MAAM,MAAM,KAAKA,UAAAA,IAAI,aAAa,MAAM,MAAM;CAChF,IAAI,UACF,OAAO,SAAS,mBAAmB;CAGrC,OAAO;AACT;;;;;;;;;;;;AClDA,SAAgB,cAAc,EAAE,YAAY,UAAU,cAAqB;CACzE,OAAOE,UAAAA,IAAI,YAAY;EACrB,MAAM;EACN,OAAO,MAAM;GACX,MAAM,WAAWA,UAAAA,IAAI,aAAa,MAAM,MAAM;GAE9C,IAAI,UAAU,cAAc,WAAW,OAAO;IAAE,GAAG;IAAM,MAAM;GAAK;GACpE,IAAI,UAAU,OAAO;IAAE,GAAG;IAAM,MAAM,aAAa,YAAY,UAAU,UAAU;GAAE;EAGvF;CACF,CAAC;AACH;;AC3BA,MAAM,yCAAyB,IAAI,IAAY;CAC7CC,UAAAA,IAAI,YAAY;CAChBA,UAAAA,IAAI,YAAY;CAChBA,UAAAA,IAAI,YAAY;CAChBA,UAAAA,IAAI,YAAY;CAChBA,UAAAA,IAAI,YAAY;AAClB,CAAC;;;;;AAMD,SAAS,cAAc,SAA+C;CACpE,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,uBAAO,IAAI,QAAwB;CAEzC,SAAS,IAAI,OAAwB;EACnC,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU,OAAO,KAAK,UAAU,KAAK,KAAK;EACjF,IAAI,iBAAiB,MAAM,OAAO,IAAI,MAAM,OAAO,CAAC;EACpD,MAAM,SAAS,KAAK,IAAI,KAAK;EAC7B,IAAI,QAAQ,OAAO;EAKnB,MAAM,OAAO;EACb,MAAM,cAAc,KAAK,SAASA,UAAAA,IAAI,UAAU,UAAU,KAAK,SAASA,UAAAA,IAAI,YAAY,OAAO,OAAO,KAAK,QAAQ;EAEnH,MAAM,UAAU,MAAM,QAAQ,KAAK,IAC/B,MAAM,IAAI,GAAG,IACb,OAAO,QAAQ,KAAK,CAAC,CAClB,QAAQ,CAAC,MAAM,WAAW,SAAS,aAAa,UAAU,KAAA,KAAa,EAAE,eAAe,SAAS,SAAS,CAAC,CAC3G,KAAK,CAAC,MAAM,WAAW,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC;EAChD,MAAM,UAAA,GAASC,YAAAA,KAAAA,CAAK,UAAU,KAAK,UAAU,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,CAAC,CAAC;EAC7E,KAAK,IAAI,OAAO,MAAM;EACtB,OAAO;CACT;CAEA,OAAO,QAAQ,QAAQ,WAAW;EAChC,MAAM,YAAY,IAAI,MAAM;EAC5B,IAAI,KAAK,IAAI,SAAS,GAAG,OAAO;EAChC,KAAK,IAAI,SAAS;EAElB,OAAO;CACT,CAAC;AACH;;;;AAKA,SAAS,qBAAqB,SAA+C;CAC3E,MAAM,mBAAmB,IAAI,IAAY,QAAQ,QAAQ,WAAW,uBAAuB,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,IAAI,CAAC;CAC/H,IAAI,CAAC,iBAAiB,MAAM,OAAO;CAEnC,OAAO,QAAQ,QAAQ,WAAW;EAChC,MAAM,WAAWD,UAAAA,IAAI,aAAa,QAAQA,UAAAA,IAAI,YAAY,IAAI;EAC9D,IAAI,CAAC,UAAU,OAAO;EAEtB,MAAM,YAAY,SAAS;EAC3B,IAAI,CAAC,WAAW,OAAO;EAGvB,KADuB,SAAS,iBAAiB,UAAU,SAAS,YAAY,UAAU,MACpE,GAAG,OAAO;EAEhC,IAAI,iBAAiB,IAAI,SAAS,GAAG,OAAO;EAC5C,KACG,cAAcA,UAAAA,IAAI,YAAY,WAAW,cAAcA,UAAAA,IAAI,YAAY,YACvE,iBAAiB,IAAIA,UAAAA,IAAI,YAAY,OAAO,KAAK,iBAAiB,IAAIA,UAAAA,IAAI,YAAY,MAAM,IAE7F,OAAO;EAET,OAAO;CACT,CAAC;AACH;;;;;;;;;;AAWA,MAAa,qBAAqBA,UAAAA,IAAI,YAAY;CAChD,MAAM;CACN,OAAO,MAAM;EACX,MAAM,YAAYA,UAAAA,IAAI,aAAa,MAAMA,UAAAA,IAAI,YAAY,KAAK;EAC9D,IAAI,CAAC,WAAW,SAAS,QAAQ,OAAO,KAAA;EAExC,MAAM,aAAa,qBAAqB,cAAc,UAAU,OAAO,CAAC;EACxE,IAAI,WAAW,WAAW,UAAU,QAAQ,QAAQ,OAAO,KAAA;EAE3D,OAAO;GAAE,GAAG;GAAW,SAAS;EAAW;CAC7C;AACF,CAAC;;;;;;;;;;;;ACtFD,UAAiB,yBAAyB,SAAuE;CAC/G,IAAI;CAEJ,KAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,eAAeE,UAAAA,IAAI,aAAa,QAAQ,QAAQ;EACtD,IAAI,gBAAgB,CAAC,aAAa,QAAQ,QAAQ,KAAA,GAAW;GAC3D,MAAM,YAAYA,UAAAA,IAAI,aAAa,KAAK,QAAQ;GAChD,IAAI,aAAa,CAAC,UAAU,MAAM;IAChC,MAAMA,UAAAA,IAAI,QAAQ,aAAa;KAC7B,GAAG;KACH,YAAY,CAAC,GAAI,UAAU,cAAc,CAAC,GAAI,GAAI,aAAa,cAAc,CAAC,CAAE;IAClF,CAAC;IACD;GACF;EACF;EACA,IAAI,QAAQ,KAAA,GAAW,MAAM;EAC7B,MAAM;CACR;CAEA,IAAI,QAAQ,KAAA,GAAW,MAAM;AAC/B;;;;;;;;;;ACtBA,SAAgB,oBACd,MACA,EAAE,iBAAiB,eACV;CACT,IAAI,CAAC,QAAQ,gBAAgB,SAAS,GAAG,OAAO;CAEhD,KAAK,MAAM,QAAQC,UAAAA,IAAI,kBAAkB,IAAI,GAC3C,IAAI,SAAS,eAAe,gBAAgB,IAAI,IAAI,GAAG,OAAO;CAGhE,OAAO;AACT"}
1
+ {"version":3,"file":"index.cjs","names":["ast","hash","ast","pascalCase","ast","pascalCase","ast","ast","ast"],"sources":["../src/Url.ts","../src/macros/macroDedupeUnion.ts","../src/macros/macroDiscriminatorEnum.ts","../../../internals/utils/src/casing.ts","../src/utils/refs.ts","../src/macros/macroEnumName.ts","../src/utils/mergeAdjacentSchemas.ts","../src/utils/schemaGraph.ts"],"sourcesContent":["/**\n * Sanitizes a parameter name so it is safe to use as a `path-to-regexp` capture name, without\n * routing through {@link camelCase} (which keeps a leading `$` since it is a valid JS identifier\n * character). Runs of disallowed characters are treated as word boundaries; a boundary at the\n * very start of the name (e.g. the `$` in `$id`) still capitalizes the word that follows it.\n */\nfunction transformPathParam(raw: string): string {\n // `path-to-regexp` (used by MSW/Express) only accepts `[A-Za-z0-9_]` in a parameter name. It stops\n // reading at the first other character (a hyphen, a dot, a `$`, ...), which misparses the route or\n // throws \"Missing parameter name\".\n if (/^[A-Za-z0-9_]+$/.test(raw)) {\n return raw\n }\n\n const startsWithSafeChar = /^[A-Za-z_]/.test(raw)\n const words = raw.split(/[^A-Za-z0-9]+/).filter(Boolean)\n\n return words\n .map((word, i) => {\n const capitalize = !startsWithSafeChar || i > 0\n return capitalize ? word.charAt(0).toUpperCase() + word.slice(1) : word.charAt(0).toLowerCase() + word.slice(1)\n })\n .join('')\n}\n\n/**\n * Renders how a grouped `path` object's member is accessed: dot access for an identifier (reserved\n * words are valid property names), bracket access with the raw name otherwise.\n */\nfunction groupedAccessor(name: string): string {\n return /^[a-zA-Z_$][a-zA-Z0-9_$]*$/.test(name) ? `.${name}` : `[${JSON.stringify(name)}]`\n}\n\n/**\n * Static helpers for OpenAPI/Swagger paths: template syntax conversion, parameter extraction, and URL composition.\n */\nexport class Url {\n /**\n * Converts an OpenAPI/Swagger path to Express-style colon syntax.\n *\n * Distinct parameter names that normalize to the same identifier (e.g. `{group-id}` and\n * `{group.id}` both becoming `groupId`) are deduplicated with an incrementing suffix so\n * `path-to-regexp` never sees two identically named captures.\n *\n * @example\n * Url.toPath('/pet/{petId}') // '/pet/:petId'\n *\n * @example\n * Url.toPath('/point/{point-id}') // '/point/:pointId'\n *\n * @example\n * Url.toPath('/groups/{group-id}/{group.id}.json') // '/groups/:groupId/:groupId2.json'\n */\n static toPath(path: string): string {\n const seen = new Map<string, number>()\n\n return path.replace(/\\{([^}]+)\\}/g, (_match, param: string) => {\n const base = transformPathParam(param)\n const count = (seen.get(base) ?? 0) + 1\n seen.set(base, count)\n\n return count === 1 ? `:${base}` : `:${base}${count}`\n })\n }\n\n /**\n * Converts an OpenAPI/Swagger path to a template literal that reads each parameter off a\n * grouped `path` request option, e.g. `/pet/{petId}` becomes `` `/pet/${path.petId}` ``.\n * Parameter names are kept exactly as they appear in the OpenAPI path; a name falls back to\n * bracket access (`` path['pet-id'] ``) only when it isn't a valid JS identifier.\n * `prefix` is prepended inside the literal. Shared by generators that pass a grouped `path` object.\n *\n * @example\n * Url.toGroupedTemplateString('/pet/{petId}') // '`/pet/${path.petId}`'\n *\n * @example\n * Url.toGroupedTemplateString('/user/{monetary-account-id}') // '`/user/${path[\"monetary-account-id\"]}`'\n */\n static toGroupedTemplateString(path: string, { prefix }: { prefix?: string | null } = {}): string {\n const parts = path.split(/\\{([^}]+)\\}/)\n const result = parts.map((part, i) => (i % 2 === 0 ? part : `\\${path${groupedAccessor(part)}}`)).join('')\n\n return `\\`${prefix ?? ''}${result}\\``\n }\n}\n","import { hash } from 'node:crypto'\nimport { ast } from '@kubb/ast'\nimport type { SchemaNode } from '@kubb/ast'\n\n/**\n * Drops members that repeat an earlier one, ignoring the source `pointer` so equal schemas from\n * different places in the spec still match.\n */\nfunction dedupeMembers(members: Array<SchemaNode>): Array<SchemaNode> {\n const seen = new Set<string>()\n const keys = new WeakMap<object, string>()\n\n function key(value: unknown): string {\n if (value === null || typeof value !== 'object') return JSON.stringify(value) ?? 'undefined'\n if (value instanceof Date) return key(value.toJSON())\n const cached = keys.get(value)\n if (cached) return cached\n\n // A ref node's `ref` pointer already identifies its target, so hashing its resolved `schema` as\n // well only walks the same component graph again for every union that references it. The `kind`\n // check keeps plain data under `default` or `examples` hashed in full.\n const node = value as Partial<SchemaNode>\n const skipsSchema = node.kind === ast.nodeKinds.schema && node.type === ast.schemaTypes.ref && typeof node.ref === 'string'\n // Hash each shared subtree once instead of expanding resolved refs into a giant string.\n const entries = Array.isArray(value)\n ? value.map(key)\n : Object.entries(value)\n .filter(([name, child]) => name !== 'pointer' && child !== undefined && !(skipsSchema && name === 'schema'))\n .map(([name, child]) => [name, key(child)])\n const result = hash('sha256', JSON.stringify([Array.isArray(value), entries]))\n keys.set(value, result)\n return result\n }\n\n return members.filter((member) => {\n const memberKey = key(member)\n if (seen.has(memberKey)) return false\n seen.add(memberKey)\n\n return true\n })\n}\n\n/**\n * Removes union members that repeat an earlier one. Enum members next to a broader scalar, such as\n * `anyOf: [string, enum]`, are kept so the known values survive in the generated code.\n *\n * @example\n * ```ts\n * const next = applyMacros(unionSchema, [macroDedupeUnion], { depth: 'shallow' })\n * ```\n */\nexport const macroDedupeUnion = ast.defineMacro({\n name: 'dedupe-union',\n schema(node) {\n const unionNode = ast.narrowSchema(node, ast.schemaTypes.union)\n if (!unionNode?.members?.length) return undefined\n\n const deduped = dedupeMembers(unionNode.members)\n if (deduped.length === unionNode.members.length) return undefined\n\n return { ...unionNode, members: deduped }\n },\n})\n","import { ast } from '@kubb/ast'\n\ntype Props = {\n propertyName: string\n values: Array<string | number | boolean>\n enumName?: string\n}\n\n/**\n * Picks the enum primitive from the type of the first value.\n */\nexport function enumPrimitive(values: Props['values']): 'string' | 'number' | 'boolean' {\n return typeof values[0] === 'number' ? 'number' : typeof values[0] === 'boolean' ? 'boolean' : 'string'\n}\n\n/**\n * Builds a macro that replaces a discriminator property's schema with an enum of the given\n * values. The enum is a string, number or boolean enum, following the first value. Object schemas\n * that lack the property are returned unchanged.\n *\n * @example\n * ```ts\n * const macro = macroDiscriminatorEnum({ propertyName: 'type', values: ['dog', 'cat'] })\n * const next = applyMacros(objectSchema, [macro], { depth: 'shallow' })\n * ```\n */\nexport function macroDiscriminatorEnum({ propertyName, values, enumName }: Props) {\n return ast.defineMacro({\n name: 'discriminator-enum',\n schema(node) {\n const objectNode = ast.narrowSchema(node, 'object')\n if (!objectNode?.properties?.length) return undefined\n if (!objectNode.properties.some((prop) => prop.name === propertyName)) return undefined\n\n return ast.factory.createSchema({\n ...objectNode,\n properties: objectNode.properties.map((prop) => {\n if (prop.name !== propertyName) return prop\n\n return ast.factory.createProperty({\n ...prop,\n schema: ast.factory.createSchema({\n type: 'enum',\n primitive: enumPrimitive(values),\n enumValues: values,\n name: enumName,\n readOnly: prop.schema.readOnly,\n writeOnly: prop.schema.writeOnly,\n }),\n })\n }),\n })\n },\n })\n}\n","type Options = {\n /**\n * Text prepended before casing is applied.\n */\n prefix?: string\n /**\n * Text appended before casing is applied.\n */\n suffix?: string\n}\n\n/**\n * Shared implementation for camelCase and PascalCase conversion.\n * Splits on common word boundaries (spaces, hyphens, underscores, dots, slashes, colons)\n * and capitalizes each word according to `pascal`.\n *\n * When `pascal` is `true` the first word is also capitalized (PascalCase), otherwise only subsequent words are.\n */\nfunction convert(text: string, pascal: boolean): string {\n return text\n .trim()\n .replace(/([a-z\\d])([A-Z])/g, '$1 $2')\n .replace(/([A-Z]+)([A-Z][a-z])/g, '$1 $2')\n .replace(/(\\d)([a-z])/g, '$1 $2')\n .split(/[\\s\\-_./\\\\:]+/)\n .filter(Boolean)\n .map((word, i) => {\n if (word.length > 1 && word === word.toUpperCase()) return word\n const head = i === 0 && !pascal ? word.charAt(0).toLowerCase() : word.charAt(0).toUpperCase()\n return head + word.slice(1)\n })\n .join('')\n .replace(/[^a-zA-Z0-9]/g, '')\n}\n\n// Plugins case the same names on every visit. Clearing at the limit bounds a long-running host.\nconst cache = new Map<string, string>()\nconst cacheLimit = 100_000\n\nfunction toCamelOrPascal(text: string, pascal: boolean): string {\n const key = `${pascal ? 'P' : 'c'}${text}`\n const cached = cache.get(key)\n if (cached !== undefined) return cached\n\n const result = convert(text, pascal)\n if (cache.size >= cacheLimit) cache.clear()\n cache.set(key, result)\n return result\n}\n\n/**\n * Converts `text` to camelCase.\n *\n * @example Word boundaries\n * `camelCase('hello-world') // 'helloWorld'`\n *\n * @example With a prefix\n * `camelCase('tag', { prefix: 'create' }) // 'createTag'`\n */\nexport function camelCase(text: string, { prefix = '', suffix = '' }: Options = {}): string {\n return toCamelOrPascal(`${prefix} ${text} ${suffix}`, false)\n}\n\n/**\n * Converts `text` to PascalCase.\n *\n * @example Word boundaries\n * `pascalCase('hello-world') // 'HelloWorld'`\n *\n * @example With a suffix\n * `pascalCase('tag', { suffix: 'schema' }) // 'TagSchema'`\n */\nexport function pascalCase(text: string, { prefix = '', suffix = '' }: Options = {}): string {\n return toCamelOrPascal(`${prefix} ${text} ${suffix}`, true)\n}\n","import { ast } from '@kubb/ast'\nimport type { SchemaNode, SchemaType } from '@kubb/ast'\nimport { pascalCase } from '@internals/utils'\n\nconst plainStringTypes = new Set<SchemaType>(['string', 'uuid', 'email', 'url', 'datetime'] as const)\n\n/** Returns the last path segment of a reference string, for example `'Pet'` for `#/components/schemas/Pet`. */\nexport const extractRefName = ast.refName\n\n/**\n * Builds a PascalCase child schema name by joining a parent name and property name.\n * Returns `null` when there is no parent to nest under.\n *\n * @example Nested under a parent\n * `childName('Order', 'shipping_address') // 'OrderShippingAddress'`\n *\n * @example No parent\n * `childName(undefined, 'params') // null`\n */\nexport function childName(parentName: string | null | undefined, propName: string): string | null {\n return parentName ? pascalCase([parentName, propName].join(' ')) : null\n}\n\n/**\n * Builds a PascalCase enum name from the parent name, property name, and a suffix, skipping any\n * empty parts.\n *\n * @example\n * `enumPropName('Order', 'status', 'enum') // 'OrderStatusEnum'`\n */\nexport function enumPropName(parentName: string | null | undefined, propName: string, enumSuffix: string): string {\n return pascalCase([parentName, propName, enumSuffix].filter(Boolean).join(' '))\n}\n\n/**\n * Applies `ast.mergeRefWithSchema()` to a resolved ref and rebuilds the result through\n * `ast.factory.createSchema()`. Non-ref nodes and unresolved refs are returned unchanged.\n *\n * @example\n * ```ts\n * const ref = ast.factory.createSchema({ type: 'ref', ref: '#/components/schemas/Pet', description: 'A cute pet' })\n * const merged = syncSchemaRef(ref) // merges with resolved Pet schema\n * ```\n */\nexport function syncSchemaRef(node: SchemaNode): SchemaNode {\n const ref = ast.narrowSchema(node, 'ref')\n\n if (!ref?.schema) return node\n\n return ast.factory.createSchema(ast.mergeRefWithSchema(ref))\n}\n\n/**\n * Returns `true` when a schema emits as a plain `string` type.\n *\n * Covers `string`, `uuid`, `email`, `url`, and `datetime` types. For `date` and `time`\n * types, returns `true` only when `representation` is `'string'` rather than `'date'`.\n */\nexport function isStringType(node: SchemaNode): boolean {\n if (plainStringTypes.has(node.type)) {\n return true\n }\n\n const temporal = ast.narrowSchema(node, 'date') ?? ast.narrowSchema(node, 'time')\n if (temporal) {\n return temporal.representation !== 'date'\n }\n\n return false\n}\n","import { ast } from '@kubb/ast'\nimport { enumPropName } from '../utils/refs.ts'\n\ntype Props = {\n parentName: string | null | undefined\n propName: string\n enumSuffix: string\n}\n\n/**\n * Builds a macro that names an inline enum schema from its parent and property name. Boolean enums\n * are left anonymous. Non-enum nodes are returned unchanged.\n *\n * @example\n * ```ts\n * const macro = macroEnumName({ parentName: 'Pet', propName: 'status', enumSuffix: 'enum' })\n * const named = applyMacros(propSchema, [macro], { depth: 'shallow' })\n * ```\n */\nexport function macroEnumName({ parentName, propName, enumSuffix }: Props) {\n return ast.defineMacro({\n name: 'enum-name',\n schema(node) {\n const enumNode = ast.narrowSchema(node, 'enum')\n\n if (enumNode?.primitive === 'boolean') return { ...node, name: null }\n if (enumNode) return { ...node, name: enumPropName(parentName, propName, enumSuffix) }\n\n return undefined\n },\n })\n}\n","import { ast } from '@kubb/ast'\nimport type { SchemaNode } from '@kubb/ast'\n\n/**\n * Merges a run of adjacent anonymous object members into one. Named or non-object members break the\n * run and pass through unchanged. The merge follows member order, so callers control which members\n * combine by where they place them in the sequence.\n *\n * @example\n * ```ts\n * const merged = [...mergeAdjacentObjectsLazy([objectA, objectB])]\n * ```\n */\nexport function* mergeAdjacentObjectsLazy(members: Iterable<SchemaNode>): Generator<SchemaNode, void, undefined> {\n let acc: SchemaNode | undefined\n\n for (const member of members) {\n const objectMember = ast.narrowSchema(member, 'object')\n if (objectMember && !objectMember.name && acc !== undefined) {\n const accObject = ast.narrowSchema(acc, 'object')\n if (accObject && !accObject.name) {\n acc = ast.factory.createSchema({\n ...accObject,\n properties: [...(accObject.properties ?? []), ...(objectMember.properties ?? [])],\n })\n continue\n }\n }\n if (acc !== undefined) yield acc\n acc = member\n }\n\n if (acc !== undefined) yield acc\n}\n","import { ast } from '@kubb/ast'\nimport type { SchemaNode } from '@kubb/ast'\n\n/**\n * Returns `true` when a schema, or anything nested inside it, references a circular schema.\n *\n * Pass `excludeName` to skip refs to a specific schema, which helps when self-references are handled\n * on their own. Pair it with `ast.findCircularSchemas()` to decide where lazy wrappers go.\n *\n * @note Reads the memoized `ast.collectSchemaRefs()` set, so a schema is scanned once across plugins.\n */\nexport function containsCircularRef(\n node: SchemaNode | undefined,\n { circularSchemas, excludeName }: { circularSchemas: ReadonlySet<string>; excludeName?: string },\n): boolean {\n if (!node || circularSchemas.size === 0) return false\n\n for (const name of ast.collectSchemaRefs(node)) {\n if (name !== excludeName && circularSchemas.has(name)) return true\n }\n\n return false\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAMA,SAAS,mBAAmB,KAAqB;CAI/C,IAAI,kBAAkB,KAAK,GAAG,GAC5B,OAAO;CAGT,MAAM,qBAAqB,aAAa,KAAK,GAAG;CAGhD,OAFc,IAAI,MAAM,eAAe,CAAC,CAAC,OAAO,OAErC,CAAC,CACT,KAAK,MAAM,MAAM;EAEhB,OADmB,CAAC,sBAAsB,IAAI,IAC1B,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KAAK,MAAM,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KAAK,MAAM,CAAC;CAChH,CAAC,CAAC,CACD,KAAK,EAAE;AACZ;;;;;AAMA,SAAS,gBAAgB,MAAsB;CAC7C,OAAO,6BAA6B,KAAK,IAAI,IAAI,IAAI,SAAS,IAAI,KAAK,UAAU,IAAI,EAAE;AACzF;;;;AAKA,IAAa,MAAb,MAAiB;;;;;;;;;;;;;;;;;CAiBf,OAAO,OAAO,MAAsB;EAClC,MAAM,uBAAO,IAAI,IAAoB;EAErC,OAAO,KAAK,QAAQ,iBAAiB,QAAQ,UAAkB;GAC7D,MAAM,OAAO,mBAAmB,KAAK;GACrC,MAAM,SAAS,KAAK,IAAI,IAAI,KAAK,KAAK;GACtC,KAAK,IAAI,MAAM,KAAK;GAEpB,OAAO,UAAU,IAAI,IAAI,SAAS,IAAI,OAAO;EAC/C,CAAC;CACH;;;;;;;;;;;;;;CAeA,OAAO,wBAAwB,MAAc,EAAE,WAAuC,CAAC,GAAW;EAEhG,MAAM,SADQ,KAAK,MAAM,aACN,CAAC,CAAC,KAAK,MAAM,MAAO,IAAI,MAAM,IAAI,OAAO,UAAU,gBAAgB,IAAI,EAAE,EAAG,CAAC,CAAC,KAAK,EAAE;EAExG,OAAO,KAAK,UAAU,KAAK,OAAO;CACpC;AACF;;;;;;AC5EA,SAAS,cAAc,SAA+C;CACpE,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,uBAAO,IAAI,QAAwB;CAEzC,SAAS,IAAI,OAAwB;EACnC,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU,OAAO,KAAK,UAAU,KAAK,KAAK;EACjF,IAAI,iBAAiB,MAAM,OAAO,IAAI,MAAM,OAAO,CAAC;EACpD,MAAM,SAAS,KAAK,IAAI,KAAK;EAC7B,IAAI,QAAQ,OAAO;EAKnB,MAAM,OAAO;EACb,MAAM,cAAc,KAAK,SAASA,UAAAA,IAAI,UAAU,UAAU,KAAK,SAASA,UAAAA,IAAI,YAAY,OAAO,OAAO,KAAK,QAAQ;EAEnH,MAAM,UAAU,MAAM,QAAQ,KAAK,IAC/B,MAAM,IAAI,GAAG,IACb,OAAO,QAAQ,KAAK,CAAC,CAClB,QAAQ,CAAC,MAAM,WAAW,SAAS,aAAa,UAAU,KAAA,KAAa,EAAE,eAAe,SAAS,SAAS,CAAC,CAC3G,KAAK,CAAC,MAAM,WAAW,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC;EAChD,MAAM,UAAA,GAASC,YAAAA,KAAAA,CAAK,UAAU,KAAK,UAAU,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,CAAC,CAAC;EAC7E,KAAK,IAAI,OAAO,MAAM;EACtB,OAAO;CACT;CAEA,OAAO,QAAQ,QAAQ,WAAW;EAChC,MAAM,YAAY,IAAI,MAAM;EAC5B,IAAI,KAAK,IAAI,SAAS,GAAG,OAAO;EAChC,KAAK,IAAI,SAAS;EAElB,OAAO;CACT,CAAC;AACH;;;;;;;;;;AAWA,MAAa,mBAAmBD,UAAAA,IAAI,YAAY;CAC9C,MAAM;CACN,OAAO,MAAM;EACX,MAAM,YAAYA,UAAAA,IAAI,aAAa,MAAMA,UAAAA,IAAI,YAAY,KAAK;EAC9D,IAAI,CAAC,WAAW,SAAS,QAAQ,OAAO,KAAA;EAExC,MAAM,UAAU,cAAc,UAAU,OAAO;EAC/C,IAAI,QAAQ,WAAW,UAAU,QAAQ,QAAQ,OAAO,KAAA;EAExD,OAAO;GAAE,GAAG;GAAW,SAAS;EAAQ;CAC1C;AACF,CAAC;;;;;ACpDD,SAAgB,cAAc,QAA0D;CACtF,OAAO,OAAO,OAAO,OAAO,WAAW,WAAW,OAAO,OAAO,OAAO,YAAY,YAAY;AACjG;;;;;;;;;;;;AAaA,SAAgB,uBAAuB,EAAE,cAAc,QAAQ,YAAmB;CAChF,OAAOE,UAAAA,IAAI,YAAY;EACrB,MAAM;EACN,OAAO,MAAM;GACX,MAAM,aAAaA,UAAAA,IAAI,aAAa,MAAM,QAAQ;GAClD,IAAI,CAAC,YAAY,YAAY,QAAQ,OAAO,KAAA;GAC5C,IAAI,CAAC,WAAW,WAAW,MAAM,SAAS,KAAK,SAAS,YAAY,GAAG,OAAO,KAAA;GAE9E,OAAOA,UAAAA,IAAI,QAAQ,aAAa;IAC9B,GAAG;IACH,YAAY,WAAW,WAAW,KAAK,SAAS;KAC9C,IAAI,KAAK,SAAS,cAAc,OAAO;KAEvC,OAAOA,UAAAA,IAAI,QAAQ,eAAe;MAChC,GAAG;MACH,QAAQA,UAAAA,IAAI,QAAQ,aAAa;OAC/B,MAAM;OACN,WAAW,cAAc,MAAM;OAC/B,YAAY;OACZ,MAAM;OACN,UAAU,KAAK,OAAO;OACtB,WAAW,KAAK,OAAO;MACzB,CAAC;KACH,CAAC;IACH,CAAC;GACH,CAAC;EACH;CACF,CAAC;AACH;;;;;;;;;ACpCA,SAAS,QAAQ,MAAc,QAAyB;CACtD,OAAO,KACJ,KAAK,CAAC,CACN,QAAQ,qBAAqB,OAAO,CAAC,CACrC,QAAQ,yBAAyB,OAAO,CAAC,CACzC,QAAQ,gBAAgB,OAAO,CAAC,CAChC,MAAM,eAAe,CAAC,CACtB,OAAO,OAAO,CAAC,CACf,KAAK,MAAM,MAAM;EAChB,IAAI,KAAK,SAAS,KAAK,SAAS,KAAK,YAAY,GAAG,OAAO;EAE3D,QADa,MAAM,KAAK,CAAC,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,KAC9E,KAAK,MAAM,CAAC;CAC5B,CAAC,CAAC,CACD,KAAK,EAAE,CAAC,CACR,QAAQ,iBAAiB,EAAE;AAChC;AAGA,MAAM,wBAAQ,IAAI,IAAoB;AACtC,MAAM,aAAa;AAEnB,SAAS,gBAAgB,MAAc,QAAyB;CAC9D,MAAM,MAAM,GAAG,SAAS,MAAM,MAAM;CACpC,MAAM,SAAS,MAAM,IAAI,GAAG;CAC5B,IAAI,WAAW,KAAA,GAAW,OAAO;CAEjC,MAAM,SAAS,QAAQ,MAAM,MAAM;CACnC,IAAI,MAAM,QAAQ,YAAY,MAAM,MAAM;CAC1C,MAAM,IAAI,KAAK,MAAM;CACrB,OAAO;AACT;;;;;;;;;;AAwBA,SAAgBC,aAAW,MAAc,EAAE,SAAS,IAAI,SAAS,OAAgB,CAAC,GAAW;CAC3F,OAAO,gBAAgB,GAAG,OAAO,GAAG,KAAK,GAAG,UAAU,IAAI;AAC5D;;;ACtEA,MAAM,mCAAmB,IAAI,IAAgB;CAAC;CAAU;CAAQ;CAAS;CAAO;AAAU,CAAU;;AAGpG,MAAa,iBAAiBC,UAAAA,IAAI;;;;;;;;;;;AAYlC,SAAgB,UAAU,YAAuC,UAAiC;CAChG,OAAO,aAAaC,aAAW,CAAC,YAAY,QAAQ,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI;AACrE;;;;;;;;AASA,SAAgB,aAAa,YAAuC,UAAkB,YAA4B;CAChH,OAAOA,aAAW;EAAC;EAAY;EAAU;CAAU,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC;AAChF;;;;;;;;;;;AAYA,SAAgB,cAAc,MAA8B;CAC1D,MAAM,MAAMD,UAAAA,IAAI,aAAa,MAAM,KAAK;CAExC,IAAI,CAAC,KAAK,QAAQ,OAAO;CAEzB,OAAOA,UAAAA,IAAI,QAAQ,aAAaA,UAAAA,IAAI,mBAAmB,GAAG,CAAC;AAC7D;;;;;;;AAQA,SAAgB,aAAa,MAA2B;CACtD,IAAI,iBAAiB,IAAI,KAAK,IAAI,GAChC,OAAO;CAGT,MAAM,WAAWA,UAAAA,IAAI,aAAa,MAAM,MAAM,KAAKA,UAAAA,IAAI,aAAa,MAAM,MAAM;CAChF,IAAI,UACF,OAAO,SAAS,mBAAmB;CAGrC,OAAO;AACT;;;;;;;;;;;;AClDA,SAAgB,cAAc,EAAE,YAAY,UAAU,cAAqB;CACzE,OAAOE,UAAAA,IAAI,YAAY;EACrB,MAAM;EACN,OAAO,MAAM;GACX,MAAM,WAAWA,UAAAA,IAAI,aAAa,MAAM,MAAM;GAE9C,IAAI,UAAU,cAAc,WAAW,OAAO;IAAE,GAAG;IAAM,MAAM;GAAK;GACpE,IAAI,UAAU,OAAO;IAAE,GAAG;IAAM,MAAM,aAAa,YAAY,UAAU,UAAU;GAAE;EAGvF;CACF,CAAC;AACH;;;;;;;;;;;;AClBA,UAAiB,yBAAyB,SAAuE;CAC/G,IAAI;CAEJ,KAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,eAAeC,UAAAA,IAAI,aAAa,QAAQ,QAAQ;EACtD,IAAI,gBAAgB,CAAC,aAAa,QAAQ,QAAQ,KAAA,GAAW;GAC3D,MAAM,YAAYA,UAAAA,IAAI,aAAa,KAAK,QAAQ;GAChD,IAAI,aAAa,CAAC,UAAU,MAAM;IAChC,MAAMA,UAAAA,IAAI,QAAQ,aAAa;KAC7B,GAAG;KACH,YAAY,CAAC,GAAI,UAAU,cAAc,CAAC,GAAI,GAAI,aAAa,cAAc,CAAC,CAAE;IAClF,CAAC;IACD;GACF;EACF;EACA,IAAI,QAAQ,KAAA,GAAW,MAAM;EAC7B,MAAM;CACR;CAEA,IAAI,QAAQ,KAAA,GAAW,MAAM;AAC/B;;;;;;;;;;ACtBA,SAAgB,oBACd,MACA,EAAE,iBAAiB,eACV;CACT,IAAI,CAAC,QAAQ,gBAAgB,SAAS,GAAG,OAAO;CAEhD,KAAK,MAAM,QAAQC,UAAAA,IAAI,kBAAkB,IAAI,GAC3C,IAAI,SAAS,eAAe,gBAAgB,IAAI,IAAI,GAAG,OAAO;CAGhE,OAAO;AACT"}
package/dist/index.d.cts CHANGED
@@ -38,6 +38,16 @@ export declare class Url {
38
38
  prefix?: string | null;
39
39
  }): string;
40
40
  }
41
+ /**
42
+ * Removes union members that repeat an earlier one. Enum members next to a broader scalar, such as
43
+ * `anyOf: [string, enum]`, are kept so the known values survive in the generated code.
44
+ *
45
+ * @example
46
+ * ```ts
47
+ * const next = applyMacros(unionSchema, [macroDedupeUnion], { depth: 'shallow' })
48
+ * ```
49
+ */
50
+ export declare const macroDedupeUnion: ast$1.Macro;
41
51
  type Props$1 = {
42
52
  propertyName: string;
43
53
  values: Array<string | number | boolean>;
@@ -75,16 +85,6 @@ type Props = {
75
85
  * ```
76
86
  */
77
87
  export declare function macroEnumName({ parentName, propName, enumSuffix }: Props): ast$1.Macro;
78
- /**
79
- * Removes union members that repeat an earlier one, and members a broader scalar primitive already
80
- * covers, such as a multi-value string enum sitting next to a plain `string`. Single-value enums are kept.
81
- *
82
- * @example
83
- * ```ts
84
- * const next = applyMacros(unionSchema, [macroSimplifyUnion], { depth: 'shallow' })
85
- * ```
86
- */
87
- export declare const macroSimplifyUnion: ast$1.Macro;
88
88
  /**
89
89
  * Merges a run of adjacent anonymous object members into one. Named or non-object members break the
90
90
  * run and pass through unchanged. The merge follows member order, so callers control which members
package/dist/index.d.ts CHANGED
@@ -38,6 +38,16 @@ export declare class Url {
38
38
  prefix?: string | null;
39
39
  }): string;
40
40
  }
41
+ /**
42
+ * Removes union members that repeat an earlier one. Enum members next to a broader scalar, such as
43
+ * `anyOf: [string, enum]`, are kept so the known values survive in the generated code.
44
+ *
45
+ * @example
46
+ * ```ts
47
+ * const next = applyMacros(unionSchema, [macroDedupeUnion], { depth: 'shallow' })
48
+ * ```
49
+ */
50
+ export declare const macroDedupeUnion: ast$1.Macro;
41
51
  type Props$1 = {
42
52
  propertyName: string;
43
53
  values: Array<string | number | boolean>;
@@ -75,16 +85,6 @@ type Props = {
75
85
  * ```
76
86
  */
77
87
  export declare function macroEnumName({ parentName, propName, enumSuffix }: Props): ast$1.Macro;
78
- /**
79
- * Removes union members that repeat an earlier one, and members a broader scalar primitive already
80
- * covers, such as a multi-value string enum sitting next to a plain `string`. Single-value enums are kept.
81
- *
82
- * @example
83
- * ```ts
84
- * const next = applyMacros(unionSchema, [macroSimplifyUnion], { depth: 'shallow' })
85
- * ```
86
- */
87
- export declare const macroSimplifyUnion: ast$1.Macro;
88
88
  /**
89
89
  * Merges a run of adjacent anonymous object members into one. Named or non-object members break the
90
90
  * run and pass through unchanged. The merge follows member order, so callers control which members
package/dist/index.js CHANGED
@@ -75,6 +75,55 @@ var Url = class {
75
75
  return `\`${prefix ?? ""}${result}\``;
76
76
  }
77
77
  };
78
+ // src/macros/macroDedupeUnion.ts
79
+ /**
80
+ * Drops members that repeat an earlier one, ignoring the source `pointer` so equal schemas from
81
+ * different places in the spec still match.
82
+ */
83
+ function dedupeMembers(members) {
84
+ const seen = /* @__PURE__ */ new Set();
85
+ const keys = /* @__PURE__ */ new WeakMap();
86
+ function key(value) {
87
+ if (value === null || typeof value !== "object") return JSON.stringify(value) ?? "undefined";
88
+ if (value instanceof Date) return key(value.toJSON());
89
+ const cached = keys.get(value);
90
+ if (cached) return cached;
91
+ const node = value;
92
+ const skipsSchema = node.kind === ast$1.nodeKinds.schema && node.type === ast$1.schemaTypes.ref && typeof node.ref === "string";
93
+ const entries = Array.isArray(value) ? value.map(key) : Object.entries(value).filter(([name, child]) => name !== "pointer" && child !== void 0 && !(skipsSchema && name === "schema")).map(([name, child]) => [name, key(child)]);
94
+ const result = hash("sha256", JSON.stringify([Array.isArray(value), entries]));
95
+ keys.set(value, result);
96
+ return result;
97
+ }
98
+ return members.filter((member) => {
99
+ const memberKey = key(member);
100
+ if (seen.has(memberKey)) return false;
101
+ seen.add(memberKey);
102
+ return true;
103
+ });
104
+ }
105
+ /**
106
+ * Removes union members that repeat an earlier one. Enum members next to a broader scalar, such as
107
+ * `anyOf: [string, enum]`, are kept so the known values survive in the generated code.
108
+ *
109
+ * @example
110
+ * ```ts
111
+ * const next = applyMacros(unionSchema, [macroDedupeUnion], { depth: 'shallow' })
112
+ * ```
113
+ */
114
+ const macroDedupeUnion = ast$1.defineMacro({
115
+ name: "dedupe-union",
116
+ schema(node) {
117
+ const unionNode = ast$1.narrowSchema(node, ast$1.schemaTypes.union);
118
+ if (!unionNode?.members?.length) return void 0;
119
+ const deduped = dedupeMembers(unionNode.members);
120
+ if (deduped.length === unionNode.members.length) return void 0;
121
+ return {
122
+ ...unionNode,
123
+ members: deduped
124
+ };
125
+ }
126
+ });
78
127
  // src/macros/macroDiscriminatorEnum.ts
79
128
  /**
80
129
  * Picks the enum primitive from the type of the first value.
@@ -249,79 +298,6 @@ function macroEnumName({ parentName, propName, enumSuffix }) {
249
298
  }
250
299
  });
251
300
  }
252
- // src/macros/macroSimplifyUnion.ts
253
- const SCALAR_PRIMITIVE_TYPES = /* @__PURE__ */ new Set([
254
- ast$1.schemaTypes.string,
255
- ast$1.schemaTypes.number,
256
- ast$1.schemaTypes.integer,
257
- ast$1.schemaTypes.bigint,
258
- ast$1.schemaTypes.boolean
259
- ]);
260
- /**
261
- * Drops members that repeat an earlier one, ignoring the source `pointer` so equal schemas from
262
- * different places in the spec still match.
263
- */
264
- function dedupeMembers(members) {
265
- const seen = /* @__PURE__ */ new Set();
266
- const keys = /* @__PURE__ */ new WeakMap();
267
- function key(value) {
268
- if (value === null || typeof value !== "object") return JSON.stringify(value) ?? "undefined";
269
- if (value instanceof Date) return key(value.toJSON());
270
- const cached = keys.get(value);
271
- if (cached) return cached;
272
- const node = value;
273
- const skipsSchema = node.kind === ast$1.nodeKinds.schema && node.type === ast$1.schemaTypes.ref && typeof node.ref === "string";
274
- const entries = Array.isArray(value) ? value.map(key) : Object.entries(value).filter(([name, child]) => name !== "pointer" && child !== void 0 && !(skipsSchema && name === "schema")).map(([name, child]) => [name, key(child)]);
275
- const result = hash("sha256", JSON.stringify([Array.isArray(value), entries]));
276
- keys.set(value, result);
277
- return result;
278
- }
279
- return members.filter((member) => {
280
- const memberKey = key(member);
281
- if (seen.has(memberKey)) return false;
282
- seen.add(memberKey);
283
- return true;
284
- });
285
- }
286
- /**
287
- * Filters union members, dropping enum members that a broader scalar primitive already covers.
288
- */
289
- function simplifyUnionMembers(members) {
290
- const scalarPrimitives = new Set(members.filter((member) => SCALAR_PRIMITIVE_TYPES.has(member.type)).map((m) => m.type));
291
- if (!scalarPrimitives.size) return members;
292
- return members.filter((member) => {
293
- const enumNode = ast$1.narrowSchema(member, ast$1.schemaTypes.enum);
294
- if (!enumNode) return true;
295
- const primitive = enumNode.primitive;
296
- if (!primitive) return true;
297
- if ((enumNode.namedEnumValues?.length ?? enumNode.enumValues?.length ?? 0) <= 1) return true;
298
- if (scalarPrimitives.has(primitive)) return false;
299
- if ((primitive === ast$1.schemaTypes.integer || primitive === ast$1.schemaTypes.number) && (scalarPrimitives.has(ast$1.schemaTypes.integer) || scalarPrimitives.has(ast$1.schemaTypes.number))) return false;
300
- return true;
301
- });
302
- }
303
- /**
304
- * Removes union members that repeat an earlier one, and members a broader scalar primitive already
305
- * covers, such as a multi-value string enum sitting next to a plain `string`. Single-value enums are kept.
306
- *
307
- * @example
308
- * ```ts
309
- * const next = applyMacros(unionSchema, [macroSimplifyUnion], { depth: 'shallow' })
310
- * ```
311
- */
312
- const macroSimplifyUnion = ast$1.defineMacro({
313
- name: "simplify-union",
314
- schema(node) {
315
- const unionNode = ast$1.narrowSchema(node, ast$1.schemaTypes.union);
316
- if (!unionNode?.members?.length) return void 0;
317
- const simplified = simplifyUnionMembers(dedupeMembers(unionNode.members));
318
- if (simplified.length === unionNode.members.length) return void 0;
319
- return {
320
- ...unionNode,
321
- members: simplified
322
- };
323
- }
324
- });
325
301
  // src/utils/mergeAdjacentSchemas.ts
326
302
  /**
327
303
  * Merges a run of adjacent anonymous object members into one. Named or non-object members break the
@@ -366,6 +342,6 @@ function containsCircularRef(node, { circularSchemas, excludeName }) {
366
342
  for (const name of ast$1.collectSchemaRefs(node)) if (name !== excludeName && circularSchemas.has(name)) return true;
367
343
  return false;
368
344
  }
369
- export { Diagnostics, Hookable, Resolver, Url, addGenerator, addMacro, assertPluginOption, ast, camelCase, childName, containsCircularRef, createAdapter, createRenderer, createResolver, createStorage, defineExtension, defineGenerator, defineParser, definePlugin, enumPrimitive, enumPropName, extractRefName, fsStorage, injectFile, isExtensionManifest, isStringType, kubbContext, macroDiscriminatorEnum, macroEnumName, macroSimplifyUnion, manifestProblems, memo, memoryStorage, mergeAdjacentObjectsLazy, pascalCase, requirePlugin, setMacros, setOptions, setResolver, syncSchemaRef, tryUseKubb, useConfig, useKubb, useOptions };
345
+ export { Diagnostics, Hookable, Resolver, Url, addGenerator, addMacro, assertPluginOption, ast, camelCase, childName, containsCircularRef, createAdapter, createRenderer, createResolver, createStorage, defineExtension, defineGenerator, defineParser, definePlugin, enumPrimitive, enumPropName, extractRefName, fsStorage, injectFile, isExtensionManifest, isStringType, kubbContext, macroDedupeUnion, macroDiscriminatorEnum, macroEnumName, manifestProblems, memo, memoryStorage, mergeAdjacentObjectsLazy, pascalCase, requirePlugin, setMacros, setOptions, setResolver, syncSchemaRef, tryUseKubb, useConfig, useKubb, useOptions };
370
346
 
371
347
  //# sourceMappingURL=index.js.map
package/dist/index.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"index.js","names":["ast","pascalCase","ast","pascalCase","ast","ast","ast","ast"],"sources":["../src/Url.ts","../src/macros/macroDiscriminatorEnum.ts","../../../internals/utils/src/casing.ts","../src/utils/refs.ts","../src/macros/macroEnumName.ts","../src/macros/macroSimplifyUnion.ts","../src/utils/mergeAdjacentSchemas.ts","../src/utils/schemaGraph.ts"],"sourcesContent":["/**\n * Sanitizes a parameter name so it is safe to use as a `path-to-regexp` capture name, without\n * routing through {@link camelCase} (which keeps a leading `$` since it is a valid JS identifier\n * character). Runs of disallowed characters are treated as word boundaries; a boundary at the\n * very start of the name (e.g. the `$` in `$id`) still capitalizes the word that follows it.\n */\nfunction transformPathParam(raw: string): string {\n // `path-to-regexp` (used by MSW/Express) only accepts `[A-Za-z0-9_]` in a parameter name. It stops\n // reading at the first other character (a hyphen, a dot, a `$`, ...), which misparses the route or\n // throws \"Missing parameter name\".\n if (/^[A-Za-z0-9_]+$/.test(raw)) {\n return raw\n }\n\n const startsWithSafeChar = /^[A-Za-z_]/.test(raw)\n const words = raw.split(/[^A-Za-z0-9]+/).filter(Boolean)\n\n return words\n .map((word, i) => {\n const capitalize = !startsWithSafeChar || i > 0\n return capitalize ? word.charAt(0).toUpperCase() + word.slice(1) : word.charAt(0).toLowerCase() + word.slice(1)\n })\n .join('')\n}\n\n/**\n * Renders how a grouped `path` object's member is accessed: dot access for an identifier (reserved\n * words are valid property names), bracket access with the raw name otherwise.\n */\nfunction groupedAccessor(name: string): string {\n return /^[a-zA-Z_$][a-zA-Z0-9_$]*$/.test(name) ? `.${name}` : `[${JSON.stringify(name)}]`\n}\n\n/**\n * Static helpers for OpenAPI/Swagger paths: template syntax conversion, parameter extraction, and URL composition.\n */\nexport class Url {\n /**\n * Converts an OpenAPI/Swagger path to Express-style colon syntax.\n *\n * Distinct parameter names that normalize to the same identifier (e.g. `{group-id}` and\n * `{group.id}` both becoming `groupId`) are deduplicated with an incrementing suffix so\n * `path-to-regexp` never sees two identically named captures.\n *\n * @example\n * Url.toPath('/pet/{petId}') // '/pet/:petId'\n *\n * @example\n * Url.toPath('/point/{point-id}') // '/point/:pointId'\n *\n * @example\n * Url.toPath('/groups/{group-id}/{group.id}.json') // '/groups/:groupId/:groupId2.json'\n */\n static toPath(path: string): string {\n const seen = new Map<string, number>()\n\n return path.replace(/\\{([^}]+)\\}/g, (_match, param: string) => {\n const base = transformPathParam(param)\n const count = (seen.get(base) ?? 0) + 1\n seen.set(base, count)\n\n return count === 1 ? `:${base}` : `:${base}${count}`\n })\n }\n\n /**\n * Converts an OpenAPI/Swagger path to a template literal that reads each parameter off a\n * grouped `path` request option, e.g. `/pet/{petId}` becomes `` `/pet/${path.petId}` ``.\n * Parameter names are kept exactly as they appear in the OpenAPI path; a name falls back to\n * bracket access (`` path['pet-id'] ``) only when it isn't a valid JS identifier.\n * `prefix` is prepended inside the literal. Shared by generators that pass a grouped `path` object.\n *\n * @example\n * Url.toGroupedTemplateString('/pet/{petId}') // '`/pet/${path.petId}`'\n *\n * @example\n * Url.toGroupedTemplateString('/user/{monetary-account-id}') // '`/user/${path[\"monetary-account-id\"]}`'\n */\n static toGroupedTemplateString(path: string, { prefix }: { prefix?: string | null } = {}): string {\n const parts = path.split(/\\{([^}]+)\\}/)\n const result = parts.map((part, i) => (i % 2 === 0 ? part : `\\${path${groupedAccessor(part)}}`)).join('')\n\n return `\\`${prefix ?? ''}${result}\\``\n }\n}\n","import { ast } from '@kubb/ast'\n\ntype Props = {\n propertyName: string\n values: Array<string | number | boolean>\n enumName?: string\n}\n\n/**\n * Picks the enum primitive from the type of the first value.\n */\nexport function enumPrimitive(values: Props['values']): 'string' | 'number' | 'boolean' {\n return typeof values[0] === 'number' ? 'number' : typeof values[0] === 'boolean' ? 'boolean' : 'string'\n}\n\n/**\n * Builds a macro that replaces a discriminator property's schema with an enum of the given\n * values. The enum is a string, number or boolean enum, following the first value. Object schemas\n * that lack the property are returned unchanged.\n *\n * @example\n * ```ts\n * const macro = macroDiscriminatorEnum({ propertyName: 'type', values: ['dog', 'cat'] })\n * const next = applyMacros(objectSchema, [macro], { depth: 'shallow' })\n * ```\n */\nexport function macroDiscriminatorEnum({ propertyName, values, enumName }: Props) {\n return ast.defineMacro({\n name: 'discriminator-enum',\n schema(node) {\n const objectNode = ast.narrowSchema(node, 'object')\n if (!objectNode?.properties?.length) return undefined\n if (!objectNode.properties.some((prop) => prop.name === propertyName)) return undefined\n\n return ast.factory.createSchema({\n ...objectNode,\n properties: objectNode.properties.map((prop) => {\n if (prop.name !== propertyName) return prop\n\n return ast.factory.createProperty({\n ...prop,\n schema: ast.factory.createSchema({\n type: 'enum',\n primitive: enumPrimitive(values),\n enumValues: values,\n name: enumName,\n readOnly: prop.schema.readOnly,\n writeOnly: prop.schema.writeOnly,\n }),\n })\n }),\n })\n },\n })\n}\n","type Options = {\n /**\n * Text prepended before casing is applied.\n */\n prefix?: string\n /**\n * Text appended before casing is applied.\n */\n suffix?: string\n}\n\n/**\n * Shared implementation for camelCase and PascalCase conversion.\n * Splits on common word boundaries (spaces, hyphens, underscores, dots, slashes, colons)\n * and capitalizes each word according to `pascal`.\n *\n * When `pascal` is `true` the first word is also capitalized (PascalCase), otherwise only subsequent words are.\n */\nfunction convert(text: string, pascal: boolean): string {\n return text\n .trim()\n .replace(/([a-z\\d])([A-Z])/g, '$1 $2')\n .replace(/([A-Z]+)([A-Z][a-z])/g, '$1 $2')\n .replace(/(\\d)([a-z])/g, '$1 $2')\n .split(/[\\s\\-_./\\\\:]+/)\n .filter(Boolean)\n .map((word, i) => {\n if (word.length > 1 && word === word.toUpperCase()) return word\n const head = i === 0 && !pascal ? word.charAt(0).toLowerCase() : word.charAt(0).toUpperCase()\n return head + word.slice(1)\n })\n .join('')\n .replace(/[^a-zA-Z0-9]/g, '')\n}\n\n// Plugins case the same names on every visit. Clearing at the limit bounds a long-running host.\nconst cache = new Map<string, string>()\nconst cacheLimit = 100_000\n\nfunction toCamelOrPascal(text: string, pascal: boolean): string {\n const key = `${pascal ? 'P' : 'c'}${text}`\n const cached = cache.get(key)\n if (cached !== undefined) return cached\n\n const result = convert(text, pascal)\n if (cache.size >= cacheLimit) cache.clear()\n cache.set(key, result)\n return result\n}\n\n/**\n * Converts `text` to camelCase.\n *\n * @example Word boundaries\n * `camelCase('hello-world') // 'helloWorld'`\n *\n * @example With a prefix\n * `camelCase('tag', { prefix: 'create' }) // 'createTag'`\n */\nexport function camelCase(text: string, { prefix = '', suffix = '' }: Options = {}): string {\n return toCamelOrPascal(`${prefix} ${text} ${suffix}`, false)\n}\n\n/**\n * Converts `text` to PascalCase.\n *\n * @example Word boundaries\n * `pascalCase('hello-world') // 'HelloWorld'`\n *\n * @example With a suffix\n * `pascalCase('tag', { suffix: 'schema' }) // 'TagSchema'`\n */\nexport function pascalCase(text: string, { prefix = '', suffix = '' }: Options = {}): string {\n return toCamelOrPascal(`${prefix} ${text} ${suffix}`, true)\n}\n","import { ast } from '@kubb/ast'\nimport type { SchemaNode, SchemaType } from '@kubb/ast'\nimport { pascalCase } from '@internals/utils'\n\nconst plainStringTypes = new Set<SchemaType>(['string', 'uuid', 'email', 'url', 'datetime'] as const)\n\n/** Returns the last path segment of a reference string, for example `'Pet'` for `#/components/schemas/Pet`. */\nexport const extractRefName = ast.refName\n\n/**\n * Builds a PascalCase child schema name by joining a parent name and property name.\n * Returns `null` when there is no parent to nest under.\n *\n * @example Nested under a parent\n * `childName('Order', 'shipping_address') // 'OrderShippingAddress'`\n *\n * @example No parent\n * `childName(undefined, 'params') // null`\n */\nexport function childName(parentName: string | null | undefined, propName: string): string | null {\n return parentName ? pascalCase([parentName, propName].join(' ')) : null\n}\n\n/**\n * Builds a PascalCase enum name from the parent name, property name, and a suffix, skipping any\n * empty parts.\n *\n * @example\n * `enumPropName('Order', 'status', 'enum') // 'OrderStatusEnum'`\n */\nexport function enumPropName(parentName: string | null | undefined, propName: string, enumSuffix: string): string {\n return pascalCase([parentName, propName, enumSuffix].filter(Boolean).join(' '))\n}\n\n/**\n * Applies `ast.mergeRefWithSchema()` to a resolved ref and rebuilds the result through\n * `ast.factory.createSchema()`. Non-ref nodes and unresolved refs are returned unchanged.\n *\n * @example\n * ```ts\n * const ref = ast.factory.createSchema({ type: 'ref', ref: '#/components/schemas/Pet', description: 'A cute pet' })\n * const merged = syncSchemaRef(ref) // merges with resolved Pet schema\n * ```\n */\nexport function syncSchemaRef(node: SchemaNode): SchemaNode {\n const ref = ast.narrowSchema(node, 'ref')\n\n if (!ref?.schema) return node\n\n return ast.factory.createSchema(ast.mergeRefWithSchema(ref))\n}\n\n/**\n * Returns `true` when a schema emits as a plain `string` type.\n *\n * Covers `string`, `uuid`, `email`, `url`, and `datetime` types. For `date` and `time`\n * types, returns `true` only when `representation` is `'string'` rather than `'date'`.\n */\nexport function isStringType(node: SchemaNode): boolean {\n if (plainStringTypes.has(node.type)) {\n return true\n }\n\n const temporal = ast.narrowSchema(node, 'date') ?? ast.narrowSchema(node, 'time')\n if (temporal) {\n return temporal.representation !== 'date'\n }\n\n return false\n}\n","import { ast } from '@kubb/ast'\nimport { enumPropName } from '../utils/refs.ts'\n\ntype Props = {\n parentName: string | null | undefined\n propName: string\n enumSuffix: string\n}\n\n/**\n * Builds a macro that names an inline enum schema from its parent and property name. Boolean enums\n * are left anonymous. Non-enum nodes are returned unchanged.\n *\n * @example\n * ```ts\n * const macro = macroEnumName({ parentName: 'Pet', propName: 'status', enumSuffix: 'enum' })\n * const named = applyMacros(propSchema, [macro], { depth: 'shallow' })\n * ```\n */\nexport function macroEnumName({ parentName, propName, enumSuffix }: Props) {\n return ast.defineMacro({\n name: 'enum-name',\n schema(node) {\n const enumNode = ast.narrowSchema(node, 'enum')\n\n if (enumNode?.primitive === 'boolean') return { ...node, name: null }\n if (enumNode) return { ...node, name: enumPropName(parentName, propName, enumSuffix) }\n\n return undefined\n },\n })\n}\n","import { hash } from 'node:crypto'\nimport { ast } from '@kubb/ast'\nimport type { SchemaNode } from '@kubb/ast'\n\nconst SCALAR_PRIMITIVE_TYPES = new Set<string>([\n ast.schemaTypes.string,\n ast.schemaTypes.number,\n ast.schemaTypes.integer,\n ast.schemaTypes.bigint,\n ast.schemaTypes.boolean,\n])\n\n/**\n * Drops members that repeat an earlier one, ignoring the source `pointer` so equal schemas from\n * different places in the spec still match.\n */\nfunction dedupeMembers(members: Array<SchemaNode>): Array<SchemaNode> {\n const seen = new Set<string>()\n const keys = new WeakMap<object, string>()\n\n function key(value: unknown): string {\n if (value === null || typeof value !== 'object') return JSON.stringify(value) ?? 'undefined'\n if (value instanceof Date) return key(value.toJSON())\n const cached = keys.get(value)\n if (cached) return cached\n\n // A ref node's `ref` pointer already identifies its target, so hashing its resolved `schema` as\n // well only walks the same component graph again for every union that references it. The `kind`\n // check keeps plain data under `default` or `examples` hashed in full.\n const node = value as Partial<SchemaNode>\n const skipsSchema = node.kind === ast.nodeKinds.schema && node.type === ast.schemaTypes.ref && typeof node.ref === 'string'\n // Hash each shared subtree once instead of expanding resolved refs into a giant string.\n const entries = Array.isArray(value)\n ? value.map(key)\n : Object.entries(value)\n .filter(([name, child]) => name !== 'pointer' && child !== undefined && !(skipsSchema && name === 'schema'))\n .map(([name, child]) => [name, key(child)])\n const result = hash('sha256', JSON.stringify([Array.isArray(value), entries]))\n keys.set(value, result)\n return result\n }\n\n return members.filter((member) => {\n const memberKey = key(member)\n if (seen.has(memberKey)) return false\n seen.add(memberKey)\n\n return true\n })\n}\n\n/**\n * Filters union members, dropping enum members that a broader scalar primitive already covers.\n */\nfunction simplifyUnionMembers(members: Array<SchemaNode>): Array<SchemaNode> {\n const scalarPrimitives = new Set<string>(members.filter((member) => SCALAR_PRIMITIVE_TYPES.has(member.type)).map((m) => m.type))\n if (!scalarPrimitives.size) return members\n\n return members.filter((member) => {\n const enumNode = ast.narrowSchema(member, ast.schemaTypes.enum)\n if (!enumNode) return true\n\n const primitive = enumNode.primitive\n if (!primitive) return true\n\n const enumValueCount = enumNode.namedEnumValues?.length ?? enumNode.enumValues?.length ?? 0\n if (enumValueCount <= 1) return true\n\n if (scalarPrimitives.has(primitive)) return false\n if (\n (primitive === ast.schemaTypes.integer || primitive === ast.schemaTypes.number) &&\n (scalarPrimitives.has(ast.schemaTypes.integer) || scalarPrimitives.has(ast.schemaTypes.number))\n )\n return false\n\n return true\n })\n}\n\n/**\n * Removes union members that repeat an earlier one, and members a broader scalar primitive already\n * covers, such as a multi-value string enum sitting next to a plain `string`. Single-value enums are kept.\n *\n * @example\n * ```ts\n * const next = applyMacros(unionSchema, [macroSimplifyUnion], { depth: 'shallow' })\n * ```\n */\nexport const macroSimplifyUnion = ast.defineMacro({\n name: 'simplify-union',\n schema(node) {\n const unionNode = ast.narrowSchema(node, ast.schemaTypes.union)\n if (!unionNode?.members?.length) return undefined\n\n const simplified = simplifyUnionMembers(dedupeMembers(unionNode.members))\n if (simplified.length === unionNode.members.length) return undefined\n\n return { ...unionNode, members: simplified }\n },\n})\n","import { ast } from '@kubb/ast'\nimport type { SchemaNode } from '@kubb/ast'\n\n/**\n * Merges a run of adjacent anonymous object members into one. Named or non-object members break the\n * run and pass through unchanged. The merge follows member order, so callers control which members\n * combine by where they place them in the sequence.\n *\n * @example\n * ```ts\n * const merged = [...mergeAdjacentObjectsLazy([objectA, objectB])]\n * ```\n */\nexport function* mergeAdjacentObjectsLazy(members: Iterable<SchemaNode>): Generator<SchemaNode, void, undefined> {\n let acc: SchemaNode | undefined\n\n for (const member of members) {\n const objectMember = ast.narrowSchema(member, 'object')\n if (objectMember && !objectMember.name && acc !== undefined) {\n const accObject = ast.narrowSchema(acc, 'object')\n if (accObject && !accObject.name) {\n acc = ast.factory.createSchema({\n ...accObject,\n properties: [...(accObject.properties ?? []), ...(objectMember.properties ?? [])],\n })\n continue\n }\n }\n if (acc !== undefined) yield acc\n acc = member\n }\n\n if (acc !== undefined) yield acc\n}\n","import { ast } from '@kubb/ast'\nimport type { SchemaNode } from '@kubb/ast'\n\n/**\n * Returns `true` when a schema, or anything nested inside it, references a circular schema.\n *\n * Pass `excludeName` to skip refs to a specific schema, which helps when self-references are handled\n * on their own. Pair it with `ast.findCircularSchemas()` to decide where lazy wrappers go.\n *\n * @note Reads the memoized `ast.collectSchemaRefs()` set, so a schema is scanned once across plugins.\n */\nexport function containsCircularRef(\n node: SchemaNode | undefined,\n { circularSchemas, excludeName }: { circularSchemas: ReadonlySet<string>; excludeName?: string },\n): boolean {\n if (!node || circularSchemas.size === 0) return false\n\n for (const name of ast.collectSchemaRefs(node)) {\n if (name !== excludeName && circularSchemas.has(name)) return true\n }\n\n return false\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAMA,SAAS,mBAAmB,KAAqB;CAI/C,IAAI,kBAAkB,KAAK,GAAG,GAC5B,OAAO;CAGT,MAAM,qBAAqB,aAAa,KAAK,GAAG;CAGhD,OAFc,IAAI,MAAM,eAAe,CAAC,CAAC,OAAO,OAErC,CAAC,CACT,KAAK,MAAM,MAAM;EAEhB,OADmB,CAAC,sBAAsB,IAAI,IAC1B,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KAAK,MAAM,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KAAK,MAAM,CAAC;CAChH,CAAC,CAAC,CACD,KAAK,EAAE;AACZ;;;;;AAMA,SAAS,gBAAgB,MAAsB;CAC7C,OAAO,6BAA6B,KAAK,IAAI,IAAI,IAAI,SAAS,IAAI,KAAK,UAAU,IAAI,EAAE;AACzF;;;;AAKA,IAAa,MAAb,MAAiB;;;;;;;;;;;;;;;;;CAiBf,OAAO,OAAO,MAAsB;EAClC,MAAM,uBAAO,IAAI,IAAoB;EAErC,OAAO,KAAK,QAAQ,iBAAiB,QAAQ,UAAkB;GAC7D,MAAM,OAAO,mBAAmB,KAAK;GACrC,MAAM,SAAS,KAAK,IAAI,IAAI,KAAK,KAAK;GACtC,KAAK,IAAI,MAAM,KAAK;GAEpB,OAAO,UAAU,IAAI,IAAI,SAAS,IAAI,OAAO;EAC/C,CAAC;CACH;;;;;;;;;;;;;;CAeA,OAAO,wBAAwB,MAAc,EAAE,WAAuC,CAAC,GAAW;EAEhG,MAAM,SADQ,KAAK,MAAM,aACN,CAAC,CAAC,KAAK,MAAM,MAAO,IAAI,MAAM,IAAI,OAAO,UAAU,gBAAgB,IAAI,EAAE,EAAG,CAAC,CAAC,KAAK,EAAE;EAExG,OAAO,KAAK,UAAU,KAAK,OAAO;CACpC;AACF;;;;;ACzEA,SAAgB,cAAc,QAA0D;CACtF,OAAO,OAAO,OAAO,OAAO,WAAW,WAAW,OAAO,OAAO,OAAO,YAAY,YAAY;AACjG;;;;;;;;;;;;AAaA,SAAgB,uBAAuB,EAAE,cAAc,QAAQ,YAAmB;CAChF,OAAOA,MAAI,YAAY;EACrB,MAAM;EACN,OAAO,MAAM;GACX,MAAM,aAAaA,MAAI,aAAa,MAAM,QAAQ;GAClD,IAAI,CAAC,YAAY,YAAY,QAAQ,OAAO,KAAA;GAC5C,IAAI,CAAC,WAAW,WAAW,MAAM,SAAS,KAAK,SAAS,YAAY,GAAG,OAAO,KAAA;GAE9E,OAAOA,MAAI,QAAQ,aAAa;IAC9B,GAAG;IACH,YAAY,WAAW,WAAW,KAAK,SAAS;KAC9C,IAAI,KAAK,SAAS,cAAc,OAAO;KAEvC,OAAOA,MAAI,QAAQ,eAAe;MAChC,GAAG;MACH,QAAQA,MAAI,QAAQ,aAAa;OAC/B,MAAM;OACN,WAAW,cAAc,MAAM;OAC/B,YAAY;OACZ,MAAM;OACN,UAAU,KAAK,OAAO;OACtB,WAAW,KAAK,OAAO;MACzB,CAAC;KACH,CAAC;IACH,CAAC;GACH,CAAC;EACH;CACF,CAAC;AACH;;;;;;;;;ACpCA,SAAS,QAAQ,MAAc,QAAyB;CACtD,OAAO,KACJ,KAAK,CAAC,CACN,QAAQ,qBAAqB,OAAO,CAAC,CACrC,QAAQ,yBAAyB,OAAO,CAAC,CACzC,QAAQ,gBAAgB,OAAO,CAAC,CAChC,MAAM,eAAe,CAAC,CACtB,OAAO,OAAO,CAAC,CACf,KAAK,MAAM,MAAM;EAChB,IAAI,KAAK,SAAS,KAAK,SAAS,KAAK,YAAY,GAAG,OAAO;EAE3D,QADa,MAAM,KAAK,CAAC,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,KAC9E,KAAK,MAAM,CAAC;CAC5B,CAAC,CAAC,CACD,KAAK,EAAE,CAAC,CACR,QAAQ,iBAAiB,EAAE;AAChC;AAGA,MAAM,wBAAQ,IAAI,IAAoB;AACtC,MAAM,aAAa;AAEnB,SAAS,gBAAgB,MAAc,QAAyB;CAC9D,MAAM,MAAM,GAAG,SAAS,MAAM,MAAM;CACpC,MAAM,SAAS,MAAM,IAAI,GAAG;CAC5B,IAAI,WAAW,KAAA,GAAW,OAAO;CAEjC,MAAM,SAAS,QAAQ,MAAM,MAAM;CACnC,IAAI,MAAM,QAAQ,YAAY,MAAM,MAAM;CAC1C,MAAM,IAAI,KAAK,MAAM;CACrB,OAAO;AACT;;;;;;;;;;AAwBA,SAAgBC,aAAW,MAAc,EAAE,SAAS,IAAI,SAAS,OAAgB,CAAC,GAAW;CAC3F,OAAO,gBAAgB,GAAG,OAAO,GAAG,KAAK,GAAG,UAAU,IAAI;AAC5D;;;ACtEA,MAAM,mCAAmB,IAAI,IAAgB;CAAC;CAAU;CAAQ;CAAS;CAAO;AAAU,CAAU;;AAGpG,MAAa,iBAAiBC,MAAI;;;;;;;;;;;AAYlC,SAAgB,UAAU,YAAuC,UAAiC;CAChG,OAAO,aAAaC,aAAW,CAAC,YAAY,QAAQ,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI;AACrE;;;;;;;;AASA,SAAgB,aAAa,YAAuC,UAAkB,YAA4B;CAChH,OAAOA,aAAW;EAAC;EAAY;EAAU;CAAU,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC;AAChF;;;;;;;;;;;AAYA,SAAgB,cAAc,MAA8B;CAC1D,MAAM,MAAMD,MAAI,aAAa,MAAM,KAAK;CAExC,IAAI,CAAC,KAAK,QAAQ,OAAO;CAEzB,OAAOA,MAAI,QAAQ,aAAaA,MAAI,mBAAmB,GAAG,CAAC;AAC7D;;;;;;;AAQA,SAAgB,aAAa,MAA2B;CACtD,IAAI,iBAAiB,IAAI,KAAK,IAAI,GAChC,OAAO;CAGT,MAAM,WAAWA,MAAI,aAAa,MAAM,MAAM,KAAKA,MAAI,aAAa,MAAM,MAAM;CAChF,IAAI,UACF,OAAO,SAAS,mBAAmB;CAGrC,OAAO;AACT;;;;;;;;;;;;AClDA,SAAgB,cAAc,EAAE,YAAY,UAAU,cAAqB;CACzE,OAAOE,MAAI,YAAY;EACrB,MAAM;EACN,OAAO,MAAM;GACX,MAAM,WAAWA,MAAI,aAAa,MAAM,MAAM;GAE9C,IAAI,UAAU,cAAc,WAAW,OAAO;IAAE,GAAG;IAAM,MAAM;GAAK;GACpE,IAAI,UAAU,OAAO;IAAE,GAAG;IAAM,MAAM,aAAa,YAAY,UAAU,UAAU;GAAE;EAGvF;CACF,CAAC;AACH;;AC3BA,MAAM,yCAAyB,IAAI,IAAY;CAC7CC,MAAI,YAAY;CAChBA,MAAI,YAAY;CAChBA,MAAI,YAAY;CAChBA,MAAI,YAAY;CAChBA,MAAI,YAAY;AAClB,CAAC;;;;;AAMD,SAAS,cAAc,SAA+C;CACpE,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,uBAAO,IAAI,QAAwB;CAEzC,SAAS,IAAI,OAAwB;EACnC,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU,OAAO,KAAK,UAAU,KAAK,KAAK;EACjF,IAAI,iBAAiB,MAAM,OAAO,IAAI,MAAM,OAAO,CAAC;EACpD,MAAM,SAAS,KAAK,IAAI,KAAK;EAC7B,IAAI,QAAQ,OAAO;EAKnB,MAAM,OAAO;EACb,MAAM,cAAc,KAAK,SAASA,MAAI,UAAU,UAAU,KAAK,SAASA,MAAI,YAAY,OAAO,OAAO,KAAK,QAAQ;EAEnH,MAAM,UAAU,MAAM,QAAQ,KAAK,IAC/B,MAAM,IAAI,GAAG,IACb,OAAO,QAAQ,KAAK,CAAC,CAClB,QAAQ,CAAC,MAAM,WAAW,SAAS,aAAa,UAAU,KAAA,KAAa,EAAE,eAAe,SAAS,SAAS,CAAC,CAC3G,KAAK,CAAC,MAAM,WAAW,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC;EAChD,MAAM,SAAS,KAAK,UAAU,KAAK,UAAU,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,CAAC,CAAC;EAC7E,KAAK,IAAI,OAAO,MAAM;EACtB,OAAO;CACT;CAEA,OAAO,QAAQ,QAAQ,WAAW;EAChC,MAAM,YAAY,IAAI,MAAM;EAC5B,IAAI,KAAK,IAAI,SAAS,GAAG,OAAO;EAChC,KAAK,IAAI,SAAS;EAElB,OAAO;CACT,CAAC;AACH;;;;AAKA,SAAS,qBAAqB,SAA+C;CAC3E,MAAM,mBAAmB,IAAI,IAAY,QAAQ,QAAQ,WAAW,uBAAuB,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,IAAI,CAAC;CAC/H,IAAI,CAAC,iBAAiB,MAAM,OAAO;CAEnC,OAAO,QAAQ,QAAQ,WAAW;EAChC,MAAM,WAAWA,MAAI,aAAa,QAAQA,MAAI,YAAY,IAAI;EAC9D,IAAI,CAAC,UAAU,OAAO;EAEtB,MAAM,YAAY,SAAS;EAC3B,IAAI,CAAC,WAAW,OAAO;EAGvB,KADuB,SAAS,iBAAiB,UAAU,SAAS,YAAY,UAAU,MACpE,GAAG,OAAO;EAEhC,IAAI,iBAAiB,IAAI,SAAS,GAAG,OAAO;EAC5C,KACG,cAAcA,MAAI,YAAY,WAAW,cAAcA,MAAI,YAAY,YACvE,iBAAiB,IAAIA,MAAI,YAAY,OAAO,KAAK,iBAAiB,IAAIA,MAAI,YAAY,MAAM,IAE7F,OAAO;EAET,OAAO;CACT,CAAC;AACH;;;;;;;;;;AAWA,MAAa,qBAAqBA,MAAI,YAAY;CAChD,MAAM;CACN,OAAO,MAAM;EACX,MAAM,YAAYA,MAAI,aAAa,MAAMA,MAAI,YAAY,KAAK;EAC9D,IAAI,CAAC,WAAW,SAAS,QAAQ,OAAO,KAAA;EAExC,MAAM,aAAa,qBAAqB,cAAc,UAAU,OAAO,CAAC;EACxE,IAAI,WAAW,WAAW,UAAU,QAAQ,QAAQ,OAAO,KAAA;EAE3D,OAAO;GAAE,GAAG;GAAW,SAAS;EAAW;CAC7C;AACF,CAAC;;;;;;;;;;;;ACtFD,UAAiB,yBAAyB,SAAuE;CAC/G,IAAI;CAEJ,KAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,eAAeC,MAAI,aAAa,QAAQ,QAAQ;EACtD,IAAI,gBAAgB,CAAC,aAAa,QAAQ,QAAQ,KAAA,GAAW;GAC3D,MAAM,YAAYA,MAAI,aAAa,KAAK,QAAQ;GAChD,IAAI,aAAa,CAAC,UAAU,MAAM;IAChC,MAAMA,MAAI,QAAQ,aAAa;KAC7B,GAAG;KACH,YAAY,CAAC,GAAI,UAAU,cAAc,CAAC,GAAI,GAAI,aAAa,cAAc,CAAC,CAAE;IAClF,CAAC;IACD;GACF;EACF;EACA,IAAI,QAAQ,KAAA,GAAW,MAAM;EAC7B,MAAM;CACR;CAEA,IAAI,QAAQ,KAAA,GAAW,MAAM;AAC/B;;;;;;;;;;ACtBA,SAAgB,oBACd,MACA,EAAE,iBAAiB,eACV;CACT,IAAI,CAAC,QAAQ,gBAAgB,SAAS,GAAG,OAAO;CAEhD,KAAK,MAAM,QAAQC,MAAI,kBAAkB,IAAI,GAC3C,IAAI,SAAS,eAAe,gBAAgB,IAAI,IAAI,GAAG,OAAO;CAGhE,OAAO;AACT"}
1
+ {"version":3,"file":"index.js","names":["ast","ast","pascalCase","ast","pascalCase","ast","ast","ast"],"sources":["../src/Url.ts","../src/macros/macroDedupeUnion.ts","../src/macros/macroDiscriminatorEnum.ts","../../../internals/utils/src/casing.ts","../src/utils/refs.ts","../src/macros/macroEnumName.ts","../src/utils/mergeAdjacentSchemas.ts","../src/utils/schemaGraph.ts"],"sourcesContent":["/**\n * Sanitizes a parameter name so it is safe to use as a `path-to-regexp` capture name, without\n * routing through {@link camelCase} (which keeps a leading `$` since it is a valid JS identifier\n * character). Runs of disallowed characters are treated as word boundaries; a boundary at the\n * very start of the name (e.g. the `$` in `$id`) still capitalizes the word that follows it.\n */\nfunction transformPathParam(raw: string): string {\n // `path-to-regexp` (used by MSW/Express) only accepts `[A-Za-z0-9_]` in a parameter name. It stops\n // reading at the first other character (a hyphen, a dot, a `$`, ...), which misparses the route or\n // throws \"Missing parameter name\".\n if (/^[A-Za-z0-9_]+$/.test(raw)) {\n return raw\n }\n\n const startsWithSafeChar = /^[A-Za-z_]/.test(raw)\n const words = raw.split(/[^A-Za-z0-9]+/).filter(Boolean)\n\n return words\n .map((word, i) => {\n const capitalize = !startsWithSafeChar || i > 0\n return capitalize ? word.charAt(0).toUpperCase() + word.slice(1) : word.charAt(0).toLowerCase() + word.slice(1)\n })\n .join('')\n}\n\n/**\n * Renders how a grouped `path` object's member is accessed: dot access for an identifier (reserved\n * words are valid property names), bracket access with the raw name otherwise.\n */\nfunction groupedAccessor(name: string): string {\n return /^[a-zA-Z_$][a-zA-Z0-9_$]*$/.test(name) ? `.${name}` : `[${JSON.stringify(name)}]`\n}\n\n/**\n * Static helpers for OpenAPI/Swagger paths: template syntax conversion, parameter extraction, and URL composition.\n */\nexport class Url {\n /**\n * Converts an OpenAPI/Swagger path to Express-style colon syntax.\n *\n * Distinct parameter names that normalize to the same identifier (e.g. `{group-id}` and\n * `{group.id}` both becoming `groupId`) are deduplicated with an incrementing suffix so\n * `path-to-regexp` never sees two identically named captures.\n *\n * @example\n * Url.toPath('/pet/{petId}') // '/pet/:petId'\n *\n * @example\n * Url.toPath('/point/{point-id}') // '/point/:pointId'\n *\n * @example\n * Url.toPath('/groups/{group-id}/{group.id}.json') // '/groups/:groupId/:groupId2.json'\n */\n static toPath(path: string): string {\n const seen = new Map<string, number>()\n\n return path.replace(/\\{([^}]+)\\}/g, (_match, param: string) => {\n const base = transformPathParam(param)\n const count = (seen.get(base) ?? 0) + 1\n seen.set(base, count)\n\n return count === 1 ? `:${base}` : `:${base}${count}`\n })\n }\n\n /**\n * Converts an OpenAPI/Swagger path to a template literal that reads each parameter off a\n * grouped `path` request option, e.g. `/pet/{petId}` becomes `` `/pet/${path.petId}` ``.\n * Parameter names are kept exactly as they appear in the OpenAPI path; a name falls back to\n * bracket access (`` path['pet-id'] ``) only when it isn't a valid JS identifier.\n * `prefix` is prepended inside the literal. Shared by generators that pass a grouped `path` object.\n *\n * @example\n * Url.toGroupedTemplateString('/pet/{petId}') // '`/pet/${path.petId}`'\n *\n * @example\n * Url.toGroupedTemplateString('/user/{monetary-account-id}') // '`/user/${path[\"monetary-account-id\"]}`'\n */\n static toGroupedTemplateString(path: string, { prefix }: { prefix?: string | null } = {}): string {\n const parts = path.split(/\\{([^}]+)\\}/)\n const result = parts.map((part, i) => (i % 2 === 0 ? part : `\\${path${groupedAccessor(part)}}`)).join('')\n\n return `\\`${prefix ?? ''}${result}\\``\n }\n}\n","import { hash } from 'node:crypto'\nimport { ast } from '@kubb/ast'\nimport type { SchemaNode } from '@kubb/ast'\n\n/**\n * Drops members that repeat an earlier one, ignoring the source `pointer` so equal schemas from\n * different places in the spec still match.\n */\nfunction dedupeMembers(members: Array<SchemaNode>): Array<SchemaNode> {\n const seen = new Set<string>()\n const keys = new WeakMap<object, string>()\n\n function key(value: unknown): string {\n if (value === null || typeof value !== 'object') return JSON.stringify(value) ?? 'undefined'\n if (value instanceof Date) return key(value.toJSON())\n const cached = keys.get(value)\n if (cached) return cached\n\n // A ref node's `ref` pointer already identifies its target, so hashing its resolved `schema` as\n // well only walks the same component graph again for every union that references it. The `kind`\n // check keeps plain data under `default` or `examples` hashed in full.\n const node = value as Partial<SchemaNode>\n const skipsSchema = node.kind === ast.nodeKinds.schema && node.type === ast.schemaTypes.ref && typeof node.ref === 'string'\n // Hash each shared subtree once instead of expanding resolved refs into a giant string.\n const entries = Array.isArray(value)\n ? value.map(key)\n : Object.entries(value)\n .filter(([name, child]) => name !== 'pointer' && child !== undefined && !(skipsSchema && name === 'schema'))\n .map(([name, child]) => [name, key(child)])\n const result = hash('sha256', JSON.stringify([Array.isArray(value), entries]))\n keys.set(value, result)\n return result\n }\n\n return members.filter((member) => {\n const memberKey = key(member)\n if (seen.has(memberKey)) return false\n seen.add(memberKey)\n\n return true\n })\n}\n\n/**\n * Removes union members that repeat an earlier one. Enum members next to a broader scalar, such as\n * `anyOf: [string, enum]`, are kept so the known values survive in the generated code.\n *\n * @example\n * ```ts\n * const next = applyMacros(unionSchema, [macroDedupeUnion], { depth: 'shallow' })\n * ```\n */\nexport const macroDedupeUnion = ast.defineMacro({\n name: 'dedupe-union',\n schema(node) {\n const unionNode = ast.narrowSchema(node, ast.schemaTypes.union)\n if (!unionNode?.members?.length) return undefined\n\n const deduped = dedupeMembers(unionNode.members)\n if (deduped.length === unionNode.members.length) return undefined\n\n return { ...unionNode, members: deduped }\n },\n})\n","import { ast } from '@kubb/ast'\n\ntype Props = {\n propertyName: string\n values: Array<string | number | boolean>\n enumName?: string\n}\n\n/**\n * Picks the enum primitive from the type of the first value.\n */\nexport function enumPrimitive(values: Props['values']): 'string' | 'number' | 'boolean' {\n return typeof values[0] === 'number' ? 'number' : typeof values[0] === 'boolean' ? 'boolean' : 'string'\n}\n\n/**\n * Builds a macro that replaces a discriminator property's schema with an enum of the given\n * values. The enum is a string, number or boolean enum, following the first value. Object schemas\n * that lack the property are returned unchanged.\n *\n * @example\n * ```ts\n * const macro = macroDiscriminatorEnum({ propertyName: 'type', values: ['dog', 'cat'] })\n * const next = applyMacros(objectSchema, [macro], { depth: 'shallow' })\n * ```\n */\nexport function macroDiscriminatorEnum({ propertyName, values, enumName }: Props) {\n return ast.defineMacro({\n name: 'discriminator-enum',\n schema(node) {\n const objectNode = ast.narrowSchema(node, 'object')\n if (!objectNode?.properties?.length) return undefined\n if (!objectNode.properties.some((prop) => prop.name === propertyName)) return undefined\n\n return ast.factory.createSchema({\n ...objectNode,\n properties: objectNode.properties.map((prop) => {\n if (prop.name !== propertyName) return prop\n\n return ast.factory.createProperty({\n ...prop,\n schema: ast.factory.createSchema({\n type: 'enum',\n primitive: enumPrimitive(values),\n enumValues: values,\n name: enumName,\n readOnly: prop.schema.readOnly,\n writeOnly: prop.schema.writeOnly,\n }),\n })\n }),\n })\n },\n })\n}\n","type Options = {\n /**\n * Text prepended before casing is applied.\n */\n prefix?: string\n /**\n * Text appended before casing is applied.\n */\n suffix?: string\n}\n\n/**\n * Shared implementation for camelCase and PascalCase conversion.\n * Splits on common word boundaries (spaces, hyphens, underscores, dots, slashes, colons)\n * and capitalizes each word according to `pascal`.\n *\n * When `pascal` is `true` the first word is also capitalized (PascalCase), otherwise only subsequent words are.\n */\nfunction convert(text: string, pascal: boolean): string {\n return text\n .trim()\n .replace(/([a-z\\d])([A-Z])/g, '$1 $2')\n .replace(/([A-Z]+)([A-Z][a-z])/g, '$1 $2')\n .replace(/(\\d)([a-z])/g, '$1 $2')\n .split(/[\\s\\-_./\\\\:]+/)\n .filter(Boolean)\n .map((word, i) => {\n if (word.length > 1 && word === word.toUpperCase()) return word\n const head = i === 0 && !pascal ? word.charAt(0).toLowerCase() : word.charAt(0).toUpperCase()\n return head + word.slice(1)\n })\n .join('')\n .replace(/[^a-zA-Z0-9]/g, '')\n}\n\n// Plugins case the same names on every visit. Clearing at the limit bounds a long-running host.\nconst cache = new Map<string, string>()\nconst cacheLimit = 100_000\n\nfunction toCamelOrPascal(text: string, pascal: boolean): string {\n const key = `${pascal ? 'P' : 'c'}${text}`\n const cached = cache.get(key)\n if (cached !== undefined) return cached\n\n const result = convert(text, pascal)\n if (cache.size >= cacheLimit) cache.clear()\n cache.set(key, result)\n return result\n}\n\n/**\n * Converts `text` to camelCase.\n *\n * @example Word boundaries\n * `camelCase('hello-world') // 'helloWorld'`\n *\n * @example With a prefix\n * `camelCase('tag', { prefix: 'create' }) // 'createTag'`\n */\nexport function camelCase(text: string, { prefix = '', suffix = '' }: Options = {}): string {\n return toCamelOrPascal(`${prefix} ${text} ${suffix}`, false)\n}\n\n/**\n * Converts `text` to PascalCase.\n *\n * @example Word boundaries\n * `pascalCase('hello-world') // 'HelloWorld'`\n *\n * @example With a suffix\n * `pascalCase('tag', { suffix: 'schema' }) // 'TagSchema'`\n */\nexport function pascalCase(text: string, { prefix = '', suffix = '' }: Options = {}): string {\n return toCamelOrPascal(`${prefix} ${text} ${suffix}`, true)\n}\n","import { ast } from '@kubb/ast'\nimport type { SchemaNode, SchemaType } from '@kubb/ast'\nimport { pascalCase } from '@internals/utils'\n\nconst plainStringTypes = new Set<SchemaType>(['string', 'uuid', 'email', 'url', 'datetime'] as const)\n\n/** Returns the last path segment of a reference string, for example `'Pet'` for `#/components/schemas/Pet`. */\nexport const extractRefName = ast.refName\n\n/**\n * Builds a PascalCase child schema name by joining a parent name and property name.\n * Returns `null` when there is no parent to nest under.\n *\n * @example Nested under a parent\n * `childName('Order', 'shipping_address') // 'OrderShippingAddress'`\n *\n * @example No parent\n * `childName(undefined, 'params') // null`\n */\nexport function childName(parentName: string | null | undefined, propName: string): string | null {\n return parentName ? pascalCase([parentName, propName].join(' ')) : null\n}\n\n/**\n * Builds a PascalCase enum name from the parent name, property name, and a suffix, skipping any\n * empty parts.\n *\n * @example\n * `enumPropName('Order', 'status', 'enum') // 'OrderStatusEnum'`\n */\nexport function enumPropName(parentName: string | null | undefined, propName: string, enumSuffix: string): string {\n return pascalCase([parentName, propName, enumSuffix].filter(Boolean).join(' '))\n}\n\n/**\n * Applies `ast.mergeRefWithSchema()` to a resolved ref and rebuilds the result through\n * `ast.factory.createSchema()`. Non-ref nodes and unresolved refs are returned unchanged.\n *\n * @example\n * ```ts\n * const ref = ast.factory.createSchema({ type: 'ref', ref: '#/components/schemas/Pet', description: 'A cute pet' })\n * const merged = syncSchemaRef(ref) // merges with resolved Pet schema\n * ```\n */\nexport function syncSchemaRef(node: SchemaNode): SchemaNode {\n const ref = ast.narrowSchema(node, 'ref')\n\n if (!ref?.schema) return node\n\n return ast.factory.createSchema(ast.mergeRefWithSchema(ref))\n}\n\n/**\n * Returns `true` when a schema emits as a plain `string` type.\n *\n * Covers `string`, `uuid`, `email`, `url`, and `datetime` types. For `date` and `time`\n * types, returns `true` only when `representation` is `'string'` rather than `'date'`.\n */\nexport function isStringType(node: SchemaNode): boolean {\n if (plainStringTypes.has(node.type)) {\n return true\n }\n\n const temporal = ast.narrowSchema(node, 'date') ?? ast.narrowSchema(node, 'time')\n if (temporal) {\n return temporal.representation !== 'date'\n }\n\n return false\n}\n","import { ast } from '@kubb/ast'\nimport { enumPropName } from '../utils/refs.ts'\n\ntype Props = {\n parentName: string | null | undefined\n propName: string\n enumSuffix: string\n}\n\n/**\n * Builds a macro that names an inline enum schema from its parent and property name. Boolean enums\n * are left anonymous. Non-enum nodes are returned unchanged.\n *\n * @example\n * ```ts\n * const macro = macroEnumName({ parentName: 'Pet', propName: 'status', enumSuffix: 'enum' })\n * const named = applyMacros(propSchema, [macro], { depth: 'shallow' })\n * ```\n */\nexport function macroEnumName({ parentName, propName, enumSuffix }: Props) {\n return ast.defineMacro({\n name: 'enum-name',\n schema(node) {\n const enumNode = ast.narrowSchema(node, 'enum')\n\n if (enumNode?.primitive === 'boolean') return { ...node, name: null }\n if (enumNode) return { ...node, name: enumPropName(parentName, propName, enumSuffix) }\n\n return undefined\n },\n })\n}\n","import { ast } from '@kubb/ast'\nimport type { SchemaNode } from '@kubb/ast'\n\n/**\n * Merges a run of adjacent anonymous object members into one. Named or non-object members break the\n * run and pass through unchanged. The merge follows member order, so callers control which members\n * combine by where they place them in the sequence.\n *\n * @example\n * ```ts\n * const merged = [...mergeAdjacentObjectsLazy([objectA, objectB])]\n * ```\n */\nexport function* mergeAdjacentObjectsLazy(members: Iterable<SchemaNode>): Generator<SchemaNode, void, undefined> {\n let acc: SchemaNode | undefined\n\n for (const member of members) {\n const objectMember = ast.narrowSchema(member, 'object')\n if (objectMember && !objectMember.name && acc !== undefined) {\n const accObject = ast.narrowSchema(acc, 'object')\n if (accObject && !accObject.name) {\n acc = ast.factory.createSchema({\n ...accObject,\n properties: [...(accObject.properties ?? []), ...(objectMember.properties ?? [])],\n })\n continue\n }\n }\n if (acc !== undefined) yield acc\n acc = member\n }\n\n if (acc !== undefined) yield acc\n}\n","import { ast } from '@kubb/ast'\nimport type { SchemaNode } from '@kubb/ast'\n\n/**\n * Returns `true` when a schema, or anything nested inside it, references a circular schema.\n *\n * Pass `excludeName` to skip refs to a specific schema, which helps when self-references are handled\n * on their own. Pair it with `ast.findCircularSchemas()` to decide where lazy wrappers go.\n *\n * @note Reads the memoized `ast.collectSchemaRefs()` set, so a schema is scanned once across plugins.\n */\nexport function containsCircularRef(\n node: SchemaNode | undefined,\n { circularSchemas, excludeName }: { circularSchemas: ReadonlySet<string>; excludeName?: string },\n): boolean {\n if (!node || circularSchemas.size === 0) return false\n\n for (const name of ast.collectSchemaRefs(node)) {\n if (name !== excludeName && circularSchemas.has(name)) return true\n }\n\n return false\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAMA,SAAS,mBAAmB,KAAqB;CAI/C,IAAI,kBAAkB,KAAK,GAAG,GAC5B,OAAO;CAGT,MAAM,qBAAqB,aAAa,KAAK,GAAG;CAGhD,OAFc,IAAI,MAAM,eAAe,CAAC,CAAC,OAAO,OAErC,CAAC,CACT,KAAK,MAAM,MAAM;EAEhB,OADmB,CAAC,sBAAsB,IAAI,IAC1B,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KAAK,MAAM,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KAAK,MAAM,CAAC;CAChH,CAAC,CAAC,CACD,KAAK,EAAE;AACZ;;;;;AAMA,SAAS,gBAAgB,MAAsB;CAC7C,OAAO,6BAA6B,KAAK,IAAI,IAAI,IAAI,SAAS,IAAI,KAAK,UAAU,IAAI,EAAE;AACzF;;;;AAKA,IAAa,MAAb,MAAiB;;;;;;;;;;;;;;;;;CAiBf,OAAO,OAAO,MAAsB;EAClC,MAAM,uBAAO,IAAI,IAAoB;EAErC,OAAO,KAAK,QAAQ,iBAAiB,QAAQ,UAAkB;GAC7D,MAAM,OAAO,mBAAmB,KAAK;GACrC,MAAM,SAAS,KAAK,IAAI,IAAI,KAAK,KAAK;GACtC,KAAK,IAAI,MAAM,KAAK;GAEpB,OAAO,UAAU,IAAI,IAAI,SAAS,IAAI,OAAO;EAC/C,CAAC;CACH;;;;;;;;;;;;;;CAeA,OAAO,wBAAwB,MAAc,EAAE,WAAuC,CAAC,GAAW;EAEhG,MAAM,SADQ,KAAK,MAAM,aACN,CAAC,CAAC,KAAK,MAAM,MAAO,IAAI,MAAM,IAAI,OAAO,UAAU,gBAAgB,IAAI,EAAE,EAAG,CAAC,CAAC,KAAK,EAAE;EAExG,OAAO,KAAK,UAAU,KAAK,OAAO;CACpC;AACF;;;;;;AC5EA,SAAS,cAAc,SAA+C;CACpE,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,uBAAO,IAAI,QAAwB;CAEzC,SAAS,IAAI,OAAwB;EACnC,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU,OAAO,KAAK,UAAU,KAAK,KAAK;EACjF,IAAI,iBAAiB,MAAM,OAAO,IAAI,MAAM,OAAO,CAAC;EACpD,MAAM,SAAS,KAAK,IAAI,KAAK;EAC7B,IAAI,QAAQ,OAAO;EAKnB,MAAM,OAAO;EACb,MAAM,cAAc,KAAK,SAASA,MAAI,UAAU,UAAU,KAAK,SAASA,MAAI,YAAY,OAAO,OAAO,KAAK,QAAQ;EAEnH,MAAM,UAAU,MAAM,QAAQ,KAAK,IAC/B,MAAM,IAAI,GAAG,IACb,OAAO,QAAQ,KAAK,CAAC,CAClB,QAAQ,CAAC,MAAM,WAAW,SAAS,aAAa,UAAU,KAAA,KAAa,EAAE,eAAe,SAAS,SAAS,CAAC,CAC3G,KAAK,CAAC,MAAM,WAAW,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC;EAChD,MAAM,SAAS,KAAK,UAAU,KAAK,UAAU,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,CAAC,CAAC;EAC7E,KAAK,IAAI,OAAO,MAAM;EACtB,OAAO;CACT;CAEA,OAAO,QAAQ,QAAQ,WAAW;EAChC,MAAM,YAAY,IAAI,MAAM;EAC5B,IAAI,KAAK,IAAI,SAAS,GAAG,OAAO;EAChC,KAAK,IAAI,SAAS;EAElB,OAAO;CACT,CAAC;AACH;;;;;;;;;;AAWA,MAAa,mBAAmBA,MAAI,YAAY;CAC9C,MAAM;CACN,OAAO,MAAM;EACX,MAAM,YAAYA,MAAI,aAAa,MAAMA,MAAI,YAAY,KAAK;EAC9D,IAAI,CAAC,WAAW,SAAS,QAAQ,OAAO,KAAA;EAExC,MAAM,UAAU,cAAc,UAAU,OAAO;EAC/C,IAAI,QAAQ,WAAW,UAAU,QAAQ,QAAQ,OAAO,KAAA;EAExD,OAAO;GAAE,GAAG;GAAW,SAAS;EAAQ;CAC1C;AACF,CAAC;;;;;ACpDD,SAAgB,cAAc,QAA0D;CACtF,OAAO,OAAO,OAAO,OAAO,WAAW,WAAW,OAAO,OAAO,OAAO,YAAY,YAAY;AACjG;;;;;;;;;;;;AAaA,SAAgB,uBAAuB,EAAE,cAAc,QAAQ,YAAmB;CAChF,OAAOC,MAAI,YAAY;EACrB,MAAM;EACN,OAAO,MAAM;GACX,MAAM,aAAaA,MAAI,aAAa,MAAM,QAAQ;GAClD,IAAI,CAAC,YAAY,YAAY,QAAQ,OAAO,KAAA;GAC5C,IAAI,CAAC,WAAW,WAAW,MAAM,SAAS,KAAK,SAAS,YAAY,GAAG,OAAO,KAAA;GAE9E,OAAOA,MAAI,QAAQ,aAAa;IAC9B,GAAG;IACH,YAAY,WAAW,WAAW,KAAK,SAAS;KAC9C,IAAI,KAAK,SAAS,cAAc,OAAO;KAEvC,OAAOA,MAAI,QAAQ,eAAe;MAChC,GAAG;MACH,QAAQA,MAAI,QAAQ,aAAa;OAC/B,MAAM;OACN,WAAW,cAAc,MAAM;OAC/B,YAAY;OACZ,MAAM;OACN,UAAU,KAAK,OAAO;OACtB,WAAW,KAAK,OAAO;MACzB,CAAC;KACH,CAAC;IACH,CAAC;GACH,CAAC;EACH;CACF,CAAC;AACH;;;;;;;;;ACpCA,SAAS,QAAQ,MAAc,QAAyB;CACtD,OAAO,KACJ,KAAK,CAAC,CACN,QAAQ,qBAAqB,OAAO,CAAC,CACrC,QAAQ,yBAAyB,OAAO,CAAC,CACzC,QAAQ,gBAAgB,OAAO,CAAC,CAChC,MAAM,eAAe,CAAC,CACtB,OAAO,OAAO,CAAC,CACf,KAAK,MAAM,MAAM;EAChB,IAAI,KAAK,SAAS,KAAK,SAAS,KAAK,YAAY,GAAG,OAAO;EAE3D,QADa,MAAM,KAAK,CAAC,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,KAC9E,KAAK,MAAM,CAAC;CAC5B,CAAC,CAAC,CACD,KAAK,EAAE,CAAC,CACR,QAAQ,iBAAiB,EAAE;AAChC;AAGA,MAAM,wBAAQ,IAAI,IAAoB;AACtC,MAAM,aAAa;AAEnB,SAAS,gBAAgB,MAAc,QAAyB;CAC9D,MAAM,MAAM,GAAG,SAAS,MAAM,MAAM;CACpC,MAAM,SAAS,MAAM,IAAI,GAAG;CAC5B,IAAI,WAAW,KAAA,GAAW,OAAO;CAEjC,MAAM,SAAS,QAAQ,MAAM,MAAM;CACnC,IAAI,MAAM,QAAQ,YAAY,MAAM,MAAM;CAC1C,MAAM,IAAI,KAAK,MAAM;CACrB,OAAO;AACT;;;;;;;;;;AAwBA,SAAgBC,aAAW,MAAc,EAAE,SAAS,IAAI,SAAS,OAAgB,CAAC,GAAW;CAC3F,OAAO,gBAAgB,GAAG,OAAO,GAAG,KAAK,GAAG,UAAU,IAAI;AAC5D;;;ACtEA,MAAM,mCAAmB,IAAI,IAAgB;CAAC;CAAU;CAAQ;CAAS;CAAO;AAAU,CAAU;;AAGpG,MAAa,iBAAiBC,MAAI;;;;;;;;;;;AAYlC,SAAgB,UAAU,YAAuC,UAAiC;CAChG,OAAO,aAAaC,aAAW,CAAC,YAAY,QAAQ,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI;AACrE;;;;;;;;AASA,SAAgB,aAAa,YAAuC,UAAkB,YAA4B;CAChH,OAAOA,aAAW;EAAC;EAAY;EAAU;CAAU,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC;AAChF;;;;;;;;;;;AAYA,SAAgB,cAAc,MAA8B;CAC1D,MAAM,MAAMD,MAAI,aAAa,MAAM,KAAK;CAExC,IAAI,CAAC,KAAK,QAAQ,OAAO;CAEzB,OAAOA,MAAI,QAAQ,aAAaA,MAAI,mBAAmB,GAAG,CAAC;AAC7D;;;;;;;AAQA,SAAgB,aAAa,MAA2B;CACtD,IAAI,iBAAiB,IAAI,KAAK,IAAI,GAChC,OAAO;CAGT,MAAM,WAAWA,MAAI,aAAa,MAAM,MAAM,KAAKA,MAAI,aAAa,MAAM,MAAM;CAChF,IAAI,UACF,OAAO,SAAS,mBAAmB;CAGrC,OAAO;AACT;;;;;;;;;;;;AClDA,SAAgB,cAAc,EAAE,YAAY,UAAU,cAAqB;CACzE,OAAOE,MAAI,YAAY;EACrB,MAAM;EACN,OAAO,MAAM;GACX,MAAM,WAAWA,MAAI,aAAa,MAAM,MAAM;GAE9C,IAAI,UAAU,cAAc,WAAW,OAAO;IAAE,GAAG;IAAM,MAAM;GAAK;GACpE,IAAI,UAAU,OAAO;IAAE,GAAG;IAAM,MAAM,aAAa,YAAY,UAAU,UAAU;GAAE;EAGvF;CACF,CAAC;AACH;;;;;;;;;;;;AClBA,UAAiB,yBAAyB,SAAuE;CAC/G,IAAI;CAEJ,KAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,eAAeC,MAAI,aAAa,QAAQ,QAAQ;EACtD,IAAI,gBAAgB,CAAC,aAAa,QAAQ,QAAQ,KAAA,GAAW;GAC3D,MAAM,YAAYA,MAAI,aAAa,KAAK,QAAQ;GAChD,IAAI,aAAa,CAAC,UAAU,MAAM;IAChC,MAAMA,MAAI,QAAQ,aAAa;KAC7B,GAAG;KACH,YAAY,CAAC,GAAI,UAAU,cAAc,CAAC,GAAI,GAAI,aAAa,cAAc,CAAC,CAAE;IAClF,CAAC;IACD;GACF;EACF;EACA,IAAI,QAAQ,KAAA,GAAW,MAAM;EAC7B,MAAM;CACR;CAEA,IAAI,QAAQ,KAAA,GAAW,MAAM;AAC/B;;;;;;;;;;ACtBA,SAAgB,oBACd,MACA,EAAE,iBAAiB,eACV;CACT,IAAI,CAAC,QAAQ,gBAAgB,SAAS,GAAG,OAAO;CAEhD,KAAK,MAAM,QAAQC,MAAI,kBAAkB,IAAI,GAC3C,IAAI,SAAS,eAAe,gBAAgB,IAAI,IAAI,GAAG,OAAO;CAGhE,OAAO;AACT"}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@kubb/kit",
3
- "version": "5.15.4",
3
+ "version": "5.16.0",
4
4
  "description": "Authoring toolkit for Kubb plugins, generators, adapters, resolvers, and renderers.",
5
5
  "keywords": [
6
6
  "codegen",
@@ -63,8 +63,8 @@
63
63
  "registry": "https://registry.npmjs.org/"
64
64
  },
65
65
  "dependencies": {
66
- "@kubb/ast": "^5.15.4",
67
- "@kubb/core": "^5.15.4"
66
+ "@kubb/ast": "^5.16.0",
67
+ "@kubb/core": "^5.16.0"
68
68
  },
69
69
  "devDependencies": {
70
70
  "@internals/utils": "0.0.1"