openapi-typesafe 0.0.0 → 1.0.0-rc.1

package/dist/domain/openapi/discriminated-union.cjs

@@ -0,0 +1,68 @@
+'use strict';
+
+const jsonPointer = require('./json-pointer.cjs');
+
+const UNION_KEYWORDS = ["oneOf", "anyOf"];
+const COMPOSITION_KEYWORDS = ["allOf", ...UNION_KEYWORDS];
+function isSchemaObject(value) {
+  return typeof value === "object" && value !== null && !Array.isArray(value);
+}
+function keywordItems(schema, keywords) {
+  const record = schema;
+  return keywords.flatMap((keyword) => {
+    const items = record[keyword];
+    return Array.isArray(items) ? items : [];
+  });
+}
+function unionMembers(schema) {
+  return isSchemaObject(schema) ? keywordItems(schema, UNION_KEYWORDS) : [];
+}
+function unionAt(ref, resolve) {
+  const schema = resolve(ref);
+  return isSchemaObject(schema) && unionMembers(schema).length > 0 ? schema : void 0;
+}
+function reaches(schema, search) {
+  if (!isSchemaObject(schema)) {
+    return false;
+  }
+  const ref = schema.$ref;
+  if (typeof ref === "string") {
+    if (ref === search.target) {
+      return true;
+    }
+    if (search.visited.has(ref)) {
+      return false;
+    }
+    search.visited.add(ref);
+    return reaches(search.resolve(ref), search);
+  }
+  return keywordItems(schema, COMPOSITION_KEYWORDS).some((item) => reaches(item, search));
+}
+function unionReaches(union, target, resolve) {
+  const search = { target, resolve, visited: /* @__PURE__ */ new Set() };
+  return unionMembers(union).some((member) => reaches(member, search));
+}
+const COMPONENT_SCHEMAS = "#/components/schemas/";
+function mappingRef(target) {
+  if (typeof target !== "string") {
+    return void 0;
+  }
+  return target.startsWith("#") ? target : `${COMPONENT_SCHEMAS}${jsonPointer.escapePointerSegment(target)}`;
+}
+function unionMaps(union, target) {
+  const mapping = union.discriminator?.mapping;
+  if (!isSchemaObject(mapping)) {
+    return false;
+  }
+  return Object.values(mapping).some((value) => mappingRef(value) === target);
+}
+function isUnionMember(union, target, resolve) {
+  return unionMaps(union, target) || unionReaches(union, target, resolve);
+}
+
+exports.isUnionMember = isUnionMember;
+exports.unionAt = unionAt;
+exports.unionMaps = unionMaps;
+exports.unionMembers = unionMembers;
+exports.unionReaches = unionReaches;
+//# sourceMappingURL=discriminated-union.cjs.map

package/dist/domain/openapi/discriminated-union.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"discriminated-union.cjs","sources":["../../../src/domain/openapi/discriminated-union.ts"],"sourcesContent":["import { escapePointerSegment } from \"./json-pointer.js\";\nimport type { Schema, SchemaObject } from \"./schema-object.js\";\n\n/**\n * A discriminator owner is either a parent that its members `allOf` (an object with the\n * discriminator property) or a union (`oneOf` / `anyOf` of the members). The generated type of a\n * union is a TypeScript union, so it cannot be used like a parent: `Omit<Union, \"kind\">` keeps\n * only the keys that every member has, and a member that intersects the union it belongs to\n * refers to itself (TS2502, upstream #1665).\n */\n\n/** Resolves a `$ref` of the document; `undefined` when it points nowhere. */\nexport type ResolveSchemaRef = (ref: string) => unknown;\n\nconst UNION_KEYWORDS = [\"oneOf\", \"anyOf\"] as const;\nconst COMPOSITION_KEYWORDS = [\"allOf\", ...UNION_KEYWORDS] as const;\n\nfunction isSchemaObject(value: unknown): value is SchemaObject {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\nfunction keywordItems(schema: SchemaObject, keywords: readonly string[]): readonly Schema[] {\n  const record = schema as Readonly<Record<string, unknown>>;\n  return keywords.flatMap((keyword) => {\n    const items = record[keyword];\n    return Array.isArray(items) ? (items as readonly Schema[]) : [];\n  });\n}\n\n/** The `oneOf` and `anyOf` members of a schema; empty when it is not a union. */\nexport function unionMembers(schema: unknown): readonly Schema[] {\n  return isSchemaObject(schema) ? keywordItems(schema, UNION_KEYWORDS) : [];\n}\n\n/** The schema at `ref` when it is a union (has `oneOf` or `anyOf` members), else undefined. */\nexport function unionAt(ref: string, resolve: ResolveSchemaRef): SchemaObject | undefined {\n  const schema = resolve(ref);\n  return isSchemaObject(schema) && unionMembers(schema).length > 0 ? schema : undefined;\n}\n\n/** What one search for a `$ref` has seen, so that a `$ref` cycle ends. */\ninterface Search {\n  readonly target: string;\n  readonly resolve: ResolveSchemaRef;\n  readonly visited: Set<string>;\n}\n\nfunction reaches(schema: Schema, search: Search): boolean {\n  if (!isSchemaObject(schema)) {\n    return false;\n  }\n  const ref = (schema as { readonly $ref?: unknown }).$ref;\n  if (typeof ref === \"string\") {\n    if (ref === search.target) {\n      return true;\n    }\n    if (search.visited.has(ref)) {\n      return false;\n    }\n    search.visited.add(ref);\n    return reaches(search.resolve(ref) as Schema, search);\n  }\n  return keywordItems(schema, COMPOSITION_KEYWORDS).some((item) => reaches(item, search));\n}\n\n/**\n * Whether the type of `union` contains the schema at `target` without an object in between: one\n * of its members is a `$ref` to it, or `allOf` / `oneOf` / `anyOf` such a `$ref`, at any depth.\n * Such a reference is resolved at once by TypeScript, unlike one in a property or an array.\n */\nexport function unionReaches(\n  union: SchemaObject,\n  target: string,\n  resolve: ResolveSchemaRef,\n): boolean {\n  const search = { target, resolve, visited: new Set<string>() };\n  return unionMembers(union).some((member) => reaches(member, search));\n}\n\nconst COMPONENT_SCHEMAS = \"#/components/schemas/\";\n\n/** A mapping value as a `$ref`: a bare name is a component schema's name. */\nfunction mappingRef(target: unknown): string | undefined {\n  if (typeof target !== \"string\") {\n    return undefined;\n  }\n  return target.startsWith(\"#\") ? target : `${COMPONENT_SCHEMAS}${escapePointerSegment(target)}`;\n}\n\n/** Whether the discriminator `mapping` of `union` names the schema at `target`. */\nexport function unionMaps(union: SchemaObject, target: string): boolean {\n  const mapping = (union.discriminator as { readonly mapping?: unknown } | undefined)?.mapping;\n  if (!isSchemaObject(mapping)) {\n    return false;\n  }\n  return Object.values(mapping).some((value) => mappingRef(value) === target);\n}\n\n/**\n * Whether the schema at `target` is a member of `union`: the union's type contains it, or the\n * discriminator `mapping` names it, which gives it a value of the union as a member does.\n */\nexport function isUnionMember(\n  union: SchemaObject,\n  target: string,\n  resolve: ResolveSchemaRef,\n): boolean {\n  return unionMaps(union, target) || unionReaches(union, target, resolve);\n}\n"],"names":["escapePointerSegment"],"mappings":";;;;AAcA,MAAM,cAAA,GAAiB,CAAC,OAAA,EAAS,OAAO,CAAA;AACxC,MAAM,oBAAA,GAAuB,CAAC,OAAA,EAAS,GAAG,cAAc,CAAA;AAExD,SAAS,eAAe,KAAA,EAAuC;AAC7D,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,KAAU,QAAQ,CAAC,KAAA,CAAM,QAAQ,KAAK,CAAA;AAC5E;AAEA,SAAS,YAAA,CAAa,QAAsB,QAAA,EAAgD;AAC1F,EAAA,MAAM,MAAA,GAAS,MAAA;AACf,EAAA,OAAO,QAAA,CAAS,OAAA,CAAQ,CAAC,OAAA,KAAY;AACnC,IAAA,MAAM,KAAA,GAAQ,OAAO,OAAO,CAAA;AAC5B,IAAA,OAAO,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,GAAK,QAA8B,EAAC;AAAA,EAChE,CAAC,CAAA;AACH;AAGO,SAAS,aAAa,MAAA,EAAoC;AAC/D,EAAA,OAAO,eAAe,MAAM,CAAA,GAAI,aAAa,MAAA,EAAQ,cAAc,IAAI,EAAC;AAC1E;AAGO,SAAS,OAAA,CAAQ,KAAa,OAAA,EAAqD;AACxF,EAAA,MAAM,MAAA,GAAS,QAAQ,GAAG,CAAA;AAC1B,EAAA,OAAO,cAAA,CAAe,MAAM,CAAA,IAAK,YAAA,CAAa,MAAM,CAAA,CAAE,MAAA,GAAS,IAAI,MAAA,GAAS,MAAA;AAC9E;AASA,SAAS,OAAA,CAAQ,QAAgB,MAAA,EAAyB;AACxD,EAAA,IAAI,CAAC,cAAA,CAAe,MAAM,CAAA,EAAG;AAC3B,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,MAAO,MAAA,CAAuC,IAAA;AACpD,EAAA,IAAI,OAAO,QAAQ,QAAA,EAAU;AAC3B,IAAA,IAAI,GAAA,KAAQ,OAAO,MAAA,EAAQ;AACzB,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,MAAA,CAAO,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA,EAAG;AAC3B,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,MAAA,CAAO,OAAA,CAAQ,IAAI,GAAG,CAAA;AACtB,IAAA,OAAO,OAAA,CAAQ,MAAA,CAAO,OAAA,CAAQ,GAAG,GAAa,MAAM,CAAA;AAAA,EACtD;AACA,EAAA,OAAO,YAAA,CAAa,MAAA,EAAQ,oBAAoB,CAAA,CAAE,IAAA,CAAK,CAAC,IAAA,KAAS,OAAA,CAAQ,IAAA,EAAM,MAAM,CAAC,CAAA;AACxF;AAOO,SAAS,YAAA,CACd,KAAA,EACA,MAAA,EACA,OAAA,EACS;AACT,EAAA,MAAM,SAAS,EAAE,MAAA,EAAQ,SAAS,OAAA,kBAAS,IAAI,KAAY,EAAE;AAC7D,EAAA,OAAO,YAAA,CAAa,KAAK,CAAA,CAAE,IAAA,CAAK,CAAC,MAAA,KAAW,OAAA,CAAQ,MAAA,EAAQ,MAAM,CAAC,CAAA;AACrE;AAEA,MAAM,iBAAA,GAAoB,uBAAA;AAG1B,SAAS,WAAW,MAAA,EAAqC;AACvD,EAAA,IAAI,OAAO,WAAW,QAAA,EAAU;AAC9B,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,MAAA,CAAO,UAAA,CAAW,GAAG,CAAA,GAAI,MAAA,GAAS,GAAG,iBAAiB,CAAA,EAAGA,gCAAA,CAAqB,MAAM,CAAC,CAAA,CAAA;AAC9F;AAGO,SAAS,SAAA,CAAU,OAAqB,MAAA,EAAyB;AACtE,EAAA,MAAM,OAAA,GAAW,MAAM,aAAA,EAA8D,OAAA;AACrF,EAAA,IAAI,CAAC,cAAA,CAAe,OAAO,CAAA,EAAG;AAC5B,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,OAAO,MAAA,CAAO,MAAA,CAAO,OAAO,CAAA,CAAE,IAAA,CAAK,CAAC,KAAA,KAAU,UAAA,CAAW,KAAK,CAAA,KAAM,MAAM,CAAA;AAC5E;AAMO,SAAS,aAAA,CACd,KAAA,EACA,MAAA,EACA,OAAA,EACS;AACT,EAAA,OAAO,UAAU,KAAA,EAAO,MAAM,KAAK,YAAA,CAAa,KAAA,EAAO,QAAQ,OAAO,CAAA;AACxE;;;;;;"}

package/dist/domain/openapi/discriminated-union.mjs

@@ -0,0 +1,62 @@
+import { escapePointerSegment } from './json-pointer.mjs';
+
+const UNION_KEYWORDS = ["oneOf", "anyOf"];
+const COMPOSITION_KEYWORDS = ["allOf", ...UNION_KEYWORDS];
+function isSchemaObject(value) {
+  return typeof value === "object" && value !== null && !Array.isArray(value);
+}
+function keywordItems(schema, keywords) {
+  const record = schema;
+  return keywords.flatMap((keyword) => {
+    const items = record[keyword];
+    return Array.isArray(items) ? items : [];
+  });
+}
+function unionMembers(schema) {
+  return isSchemaObject(schema) ? keywordItems(schema, UNION_KEYWORDS) : [];
+}
+function unionAt(ref, resolve) {
+  const schema = resolve(ref);
+  return isSchemaObject(schema) && unionMembers(schema).length > 0 ? schema : void 0;
+}
+function reaches(schema, search) {
+  if (!isSchemaObject(schema)) {
+    return false;
+  }
+  const ref = schema.$ref;
+  if (typeof ref === "string") {
+    if (ref === search.target) {
+      return true;
+    }
+    if (search.visited.has(ref)) {
+      return false;
+    }
+    search.visited.add(ref);
+    return reaches(search.resolve(ref), search);
+  }
+  return keywordItems(schema, COMPOSITION_KEYWORDS).some((item) => reaches(item, search));
+}
+function unionReaches(union, target, resolve) {
+  const search = { target, resolve, visited: /* @__PURE__ */ new Set() };
+  return unionMembers(union).some((member) => reaches(member, search));
+}
+const COMPONENT_SCHEMAS = "#/components/schemas/";
+function mappingRef(target) {
+  if (typeof target !== "string") {
+    return void 0;
+  }
+  return target.startsWith("#") ? target : `${COMPONENT_SCHEMAS}${escapePointerSegment(target)}`;
+}
+function unionMaps(union, target) {
+  const mapping = union.discriminator?.mapping;
+  if (!isSchemaObject(mapping)) {
+    return false;
+  }
+  return Object.values(mapping).some((value) => mappingRef(value) === target);
+}
+function isUnionMember(union, target, resolve) {
+  return unionMaps(union, target) || unionReaches(union, target, resolve);
+}
+
+export { isUnionMember, unionAt, unionMaps, unionMembers, unionReaches };
+//# sourceMappingURL=discriminated-union.mjs.map

package/dist/domain/openapi/discriminated-union.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"discriminated-union.mjs","sources":["../../../src/domain/openapi/discriminated-union.ts"],"sourcesContent":["import { escapePointerSegment } from \"./json-pointer.js\";\nimport type { Schema, SchemaObject } from \"./schema-object.js\";\n\n/**\n * A discriminator owner is either a parent that its members `allOf` (an object with the\n * discriminator property) or a union (`oneOf` / `anyOf` of the members). The generated type of a\n * union is a TypeScript union, so it cannot be used like a parent: `Omit<Union, \"kind\">` keeps\n * only the keys that every member has, and a member that intersects the union it belongs to\n * refers to itself (TS2502, upstream #1665).\n */\n\n/** Resolves a `$ref` of the document; `undefined` when it points nowhere. */\nexport type ResolveSchemaRef = (ref: string) => unknown;\n\nconst UNION_KEYWORDS = [\"oneOf\", \"anyOf\"] as const;\nconst COMPOSITION_KEYWORDS = [\"allOf\", ...UNION_KEYWORDS] as const;\n\nfunction isSchemaObject(value: unknown): value is SchemaObject {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\nfunction keywordItems(schema: SchemaObject, keywords: readonly string[]): readonly Schema[] {\n  const record = schema as Readonly<Record<string, unknown>>;\n  return keywords.flatMap((keyword) => {\n    const items = record[keyword];\n    return Array.isArray(items) ? (items as readonly Schema[]) : [];\n  });\n}\n\n/** The `oneOf` and `anyOf` members of a schema; empty when it is not a union. */\nexport function unionMembers(schema: unknown): readonly Schema[] {\n  return isSchemaObject(schema) ? keywordItems(schema, UNION_KEYWORDS) : [];\n}\n\n/** The schema at `ref` when it is a union (has `oneOf` or `anyOf` members), else undefined. */\nexport function unionAt(ref: string, resolve: ResolveSchemaRef): SchemaObject | undefined {\n  const schema = resolve(ref);\n  return isSchemaObject(schema) && unionMembers(schema).length > 0 ? schema : undefined;\n}\n\n/** What one search for a `$ref` has seen, so that a `$ref` cycle ends. */\ninterface Search {\n  readonly target: string;\n  readonly resolve: ResolveSchemaRef;\n  readonly visited: Set<string>;\n}\n\nfunction reaches(schema: Schema, search: Search): boolean {\n  if (!isSchemaObject(schema)) {\n    return false;\n  }\n  const ref = (schema as { readonly $ref?: unknown }).$ref;\n  if (typeof ref === \"string\") {\n    if (ref === search.target) {\n      return true;\n    }\n    if (search.visited.has(ref)) {\n      return false;\n    }\n    search.visited.add(ref);\n    return reaches(search.resolve(ref) as Schema, search);\n  }\n  return keywordItems(schema, COMPOSITION_KEYWORDS).some((item) => reaches(item, search));\n}\n\n/**\n * Whether the type of `union` contains the schema at `target` without an object in between: one\n * of its members is a `$ref` to it, or `allOf` / `oneOf` / `anyOf` such a `$ref`, at any depth.\n * Such a reference is resolved at once by TypeScript, unlike one in a property or an array.\n */\nexport function unionReaches(\n  union: SchemaObject,\n  target: string,\n  resolve: ResolveSchemaRef,\n): boolean {\n  const search = { target, resolve, visited: new Set<string>() };\n  return unionMembers(union).some((member) => reaches(member, search));\n}\n\nconst COMPONENT_SCHEMAS = \"#/components/schemas/\";\n\n/** A mapping value as a `$ref`: a bare name is a component schema's name. */\nfunction mappingRef(target: unknown): string | undefined {\n  if (typeof target !== \"string\") {\n    return undefined;\n  }\n  return target.startsWith(\"#\") ? target : `${COMPONENT_SCHEMAS}${escapePointerSegment(target)}`;\n}\n\n/** Whether the discriminator `mapping` of `union` names the schema at `target`. */\nexport function unionMaps(union: SchemaObject, target: string): boolean {\n  const mapping = (union.discriminator as { readonly mapping?: unknown } | undefined)?.mapping;\n  if (!isSchemaObject(mapping)) {\n    return false;\n  }\n  return Object.values(mapping).some((value) => mappingRef(value) === target);\n}\n\n/**\n * Whether the schema at `target` is a member of `union`: the union's type contains it, or the\n * discriminator `mapping` names it, which gives it a value of the union as a member does.\n */\nexport function isUnionMember(\n  union: SchemaObject,\n  target: string,\n  resolve: ResolveSchemaRef,\n): boolean {\n  return unionMaps(union, target) || unionReaches(union, target, resolve);\n}\n"],"names":[],"mappings":";;AAcA,MAAM,cAAA,GAAiB,CAAC,OAAA,EAAS,OAAO,CAAA;AACxC,MAAM,oBAAA,GAAuB,CAAC,OAAA,EAAS,GAAG,cAAc,CAAA;AAExD,SAAS,eAAe,KAAA,EAAuC;AAC7D,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,KAAU,QAAQ,CAAC,KAAA,CAAM,QAAQ,KAAK,CAAA;AAC5E;AAEA,SAAS,YAAA,CAAa,QAAsB,QAAA,EAAgD;AAC1F,EAAA,MAAM,MAAA,GAAS,MAAA;AACf,EAAA,OAAO,QAAA,CAAS,OAAA,CAAQ,CAAC,OAAA,KAAY;AACnC,IAAA,MAAM,KAAA,GAAQ,OAAO,OAAO,CAAA;AAC5B,IAAA,OAAO,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,GAAK,QAA8B,EAAC;AAAA,EAChE,CAAC,CAAA;AACH;AAGO,SAAS,aAAa,MAAA,EAAoC;AAC/D,EAAA,OAAO,eAAe,MAAM,CAAA,GAAI,aAAa,MAAA,EAAQ,cAAc,IAAI,EAAC;AAC1E;AAGO,SAAS,OAAA,CAAQ,KAAa,OAAA,EAAqD;AACxF,EAAA,MAAM,MAAA,GAAS,QAAQ,GAAG,CAAA;AAC1B,EAAA,OAAO,cAAA,CAAe,MAAM,CAAA,IAAK,YAAA,CAAa,MAAM,CAAA,CAAE,MAAA,GAAS,IAAI,MAAA,GAAS,MAAA;AAC9E;AASA,SAAS,OAAA,CAAQ,QAAgB,MAAA,EAAyB;AACxD,EAAA,IAAI,CAAC,cAAA,CAAe,MAAM,CAAA,EAAG;AAC3B,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,MAAO,MAAA,CAAuC,IAAA;AACpD,EAAA,IAAI,OAAO,QAAQ,QAAA,EAAU;AAC3B,IAAA,IAAI,GAAA,KAAQ,OAAO,MAAA,EAAQ;AACzB,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IAAI,MAAA,CAAO,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA,EAAG;AAC3B,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,MAAA,CAAO,OAAA,CAAQ,IAAI,GAAG,CAAA;AACtB,IAAA,OAAO,OAAA,CAAQ,MAAA,CAAO,OAAA,CAAQ,GAAG,GAAa,MAAM,CAAA;AAAA,EACtD;AACA,EAAA,OAAO,YAAA,CAAa,MAAA,EAAQ,oBAAoB,CAAA,CAAE,IAAA,CAAK,CAAC,IAAA,KAAS,OAAA,CAAQ,IAAA,EAAM,MAAM,CAAC,CAAA;AACxF;AAOO,SAAS,YAAA,CACd,KAAA,EACA,MAAA,EACA,OAAA,EACS;AACT,EAAA,MAAM,SAAS,EAAE,MAAA,EAAQ,SAAS,OAAA,kBAAS,IAAI,KAAY,EAAE;AAC7D,EAAA,OAAO,YAAA,CAAa,KAAK,CAAA,CAAE,IAAA,CAAK,CAAC,MAAA,KAAW,OAAA,CAAQ,MAAA,EAAQ,MAAM,CAAC,CAAA;AACrE;AAEA,MAAM,iBAAA,GAAoB,uBAAA;AAG1B,SAAS,WAAW,MAAA,EAAqC;AACvD,EAAA,IAAI,OAAO,WAAW,QAAA,EAAU;AAC9B,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,MAAA,CAAO,UAAA,CAAW,GAAG,CAAA,GAAI,MAAA,GAAS,GAAG,iBAAiB,CAAA,EAAG,oBAAA,CAAqB,MAAM,CAAC,CAAA,CAAA;AAC9F;AAGO,SAAS,SAAA,CAAU,OAAqB,MAAA,EAAyB;AACtE,EAAA,MAAM,OAAA,GAAW,MAAM,aAAA,EAA8D,OAAA;AACrF,EAAA,IAAI,CAAC,cAAA,CAAe,OAAO,CAAA,EAAG;AAC5B,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,OAAO,MAAA,CAAO,MAAA,CAAO,OAAO,CAAA,CAAE,IAAA,CAAK,CAAC,KAAA,KAAU,UAAA,CAAW,KAAK,CAAA,KAAM,MAAM,CAAA;AAC5E;AAMO,SAAS,aAAA,CACd,KAAA,EACA,MAAA,EACA,OAAA,EACS;AACT,EAAA,OAAO,UAAU,KAAA,EAAO,MAAM,KAAK,YAAA,CAAa,KAAA,EAAO,QAAQ,OAAO,CAAA;AACxE;;"}

package/dist/domain/openapi/discriminator-conflicts.cjs

@@ -0,0 +1,143 @@
+'use strict';
+
+const admittedValues = require('./admitted-values.cjs');
+const discriminatedUnion = require('./discriminated-union.cjs');
+const jsonPointer = require('./json-pointer.cjs');
+
+const COMPONENT_SCHEMAS = "#/components/schemas/";
+function isObject(value) {
+  return typeof value === "object" && value !== null && !Array.isArray(value);
+}
+function refsOf(list) {
+  return (Array.isArray(list) ? list : []).flatMap(
+    (item) => isObject(item) && typeof item.$ref === "string" ? [item.$ref] : []
+  );
+}
+function mappingTarget(target) {
+  return target.startsWith("#") ? target : `${COMPONENT_SCHEMAS}${jsonPointer.escapePointerSegment(target)}`;
+}
+function ownerAt(node, pointer) {
+  const discriminator = node.discriminator;
+  if (!isObject(discriminator) || typeof discriminator.propertyName !== "string") {
+    return null;
+  }
+  const mapping = isObject(discriminator.mapping) ? discriminator.mapping : {};
+  const mapped = Object.values(mapping).filter((t) => typeof t === "string").map(mappingTarget);
+  const memberRefs = [...refsOf(node.oneOf), ...refsOf(node.anyOf), ...mapped];
+  return { pointer: pointer(), propertyName: discriminator.propertyName, mapping, memberRefs };
+}
+function pointerOf(visit) {
+  const segments = [];
+  for (let current = visit; current?.key != null; current = current.parent) {
+    segments.unshift(current.key);
+  }
+  return jsonPointer.createRef(segments);
+}
+function childrenOf(visit) {
+  const { node } = visit;
+  const entries = Array.isArray(node) ? node.map((item, index) => [String(index), item]) : isObject(node) ? Object.entries(node) : [];
+  return entries.map(([key, child]) => ({ node: child, key, parent: visit }));
+}
+function ownersIn(document) {
+  const found = [];
+  const stack = [{ node: document, key: null, parent: null }];
+  for (let visit = stack.pop(); visit !== void 0; visit = stack.pop()) {
+    const owner = isObject(visit.node) ? ownerAt(visit.node, () => pointerOf(visit)) : null;
+    if (owner !== null) {
+      found.push(owner);
+    }
+    stack.push(...childrenOf(visit).reverse());
+  }
+  return found;
+}
+function inheritingChildren(owner, search) {
+  const children = search.children.get(owner.pointer) ?? [];
+  const resolve = (ref) => admittedValues.resolveLocalRef(search.document, ref);
+  const union = search.isUnionReused ? discriminatedUnion.unionAt(owner.pointer, resolve) : void 0;
+  return union === void 0 ? children : children.filter((child) => discriminatedUnion.isUnionMember(union, child.ref, resolve));
+}
+function allOfChildren(document) {
+  const schemas = admittedValues.resolveLocalRef(document, "#/components/schemas");
+  const children = /* @__PURE__ */ new Map();
+  for (const [name, schema] of Object.entries(isObject(schemas) ? schemas : {})) {
+    if (!isObject(schema)) {
+      continue;
+    }
+    const child = { ref: `${COMPONENT_SCHEMAS}${jsonPointer.escapePointerSegment(name)}`, schema };
+    for (const parent of new Set(refsOf(schema.allOf))) {
+      const siblings = children.get(parent) ?? [];
+      siblings.push(child);
+      children.set(parent, siblings);
+    }
+  }
+  return children;
+}
+function ownsProperty(schema, propertyName) {
+  const discriminator = schema.discriminator;
+  return isObject(discriminator) && discriminator.propertyName === propertyName;
+}
+function inheritingMembers(owner, search) {
+  const found = [];
+  const visited = /* @__PURE__ */ new Set([owner.pointer]);
+  const parents = [{ ref: owner.pointer, skipped: /* @__PURE__ */ new Set([owner.pointer]) }];
+  for (let parent = parents.shift(); parent !== void 0; parent = parents.shift()) {
+    const children = parent.ref === owner.pointer ? inheritingChildren(owner, search) : search.children.get(parent.ref) ?? [];
+    for (const child of children) {
+      if (visited.has(child.ref)) {
+        continue;
+      }
+      visited.add(child.ref);
+      found.push({ ref: child.ref, skipped: parent.skipped });
+      if (!ownsProperty(child.schema, owner.propertyName)) {
+        parents.push({ ref: child.ref, skipped: /* @__PURE__ */ new Set([...parent.skipped, child.ref]) });
+      }
+    }
+  }
+  return found;
+}
+function membersOf(owner, search) {
+  const listed = owner.memberRefs.map((ref) => ({ ref, skipped: /* @__PURE__ */ new Set([owner.pointer]) }));
+  const members = /* @__PURE__ */ new Map();
+  for (const member of [...listed, ...inheritingMembers(owner, search)]) {
+    if (!members.has(member.ref)) {
+      members.set(member.ref, member);
+    }
+  }
+  return [...members.values()];
+}
+function memberValues(owner, member) {
+  const values = Object.entries(owner.mapping).filter(([, target]) => typeof target === "string" && mappingTarget(target) === member).map(([key]) => key);
+  const name = jsonPointer.parseRefPointer(member).pop() ?? "";
+  return values.length > 0 ? { values, isImplicit: false } : { values: [name], isImplicit: true };
+}
+function conflictOf(owner, { ref: member, skipped }, document) {
+  const allowed = admittedValues.admittedPropertyValues(
+    admittedValues.resolveLocalRef(document, member),
+    owner.propertyName,
+    document,
+    skipped
+  );
+  const { values, isImplicit } = memberValues(owner, member);
+  if (allowed === null || values.some((value) => allowed.has(value))) {
+    return null;
+  }
+  const { pointer, propertyName } = owner;
+  return { member, owner: pointer, propertyName, values, allowed: [...allowed], isImplicit };
+}
+function findDiscriminatorValueConflicts(document, options = { isUnionReused: false }) {
+  const conflicts = /* @__PURE__ */ new Map();
+  const search = { ...options, document, children: allOfChildren(document) };
+  for (const owner of ownersIn(document)) {
+    for (const member of membersOf(owner, search)) {
+      const conflict = conflictOf(owner, member, document);
+      const key = JSON.stringify([member.ref, conflict?.propertyName, conflict?.values]);
+      if (conflict !== null && !conflicts.has(key)) {
+        conflicts.set(key, conflict);
+      }
+    }
+  }
+  return [...conflicts.values()];
+}
+
+exports.findDiscriminatorValueConflicts = findDiscriminatorValueConflicts;
+//# sourceMappingURL=discriminator-conflicts.cjs.map

package/dist/domain/openapi/discriminator-conflicts.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"discriminator-conflicts.cjs","sources":["../../../src/domain/openapi/discriminator-conflicts.ts"],"sourcesContent":["import { admittedPropertyValues, resolveLocalRef } from \"./admitted-values.js\";\nimport { isUnionMember, unionAt } from \"./discriminated-union.js\";\nimport { createRef, escapePointerSegment, parseRefPointer } from \"./json-pointer.js\";\n\n/**\n * Discriminator members whose discriminator value their own property does not allow. By the\n * Discriminator Object rule, a member that no `mapping` entry names has its schema name as the\n * value, so with a property `enum` (or `const`) that does not list it no value of the member\n * matches, and where the generator adds the value to the member the property type is `never`.\n * Each one gets a warning (CODING_PRINCIPLES §8.7).\n */\n\nexport interface DiscriminatorValueConflict {\n  /** The member schema, such as `#/components/schemas/EpisodeObject`. */\n  readonly member: string;\n  /** The schema that has the Discriminator Object. */\n  readonly owner: string;\n  readonly propertyName: string;\n  /** The values the discriminator gives the member: its mapping keys, or its name. */\n  readonly values: readonly string[];\n  /** The values the member's property allows. */\n  readonly allowed: readonly (string | number | boolean | null)[];\n  /** Whether no mapping entry names the member, so its value is its schema name. */\n  readonly isImplicit: boolean;\n}\n\ntype JsonObject = Readonly<Record<string, unknown>>;\n\nconst COMPONENT_SCHEMAS = \"#/components/schemas/\";\n\nfunction isObject(value: unknown): value is JsonObject {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\ninterface Owner {\n  readonly pointer: string;\n  readonly propertyName: string;\n  readonly mapping: Readonly<Record<string, string>>;\n  readonly memberRefs: readonly string[];\n}\n\nfunction refsOf(list: unknown): string[] {\n  return (Array.isArray(list) ? list : []).flatMap((item) =>\n    isObject(item) && typeof item.$ref === \"string\" ? [item.$ref] : [],\n  );\n}\n\nfunction mappingTarget(target: string): string {\n  return target.startsWith(\"#\") ? target : `${COMPONENT_SCHEMAS}${escapePointerSegment(target)}`;\n}\n\nfunction ownerAt(node: JsonObject, pointer: () => string): Owner | null {\n  const discriminator = node.discriminator;\n  if (!isObject(discriminator) || typeof discriminator.propertyName !== \"string\") {\n    return null;\n  }\n  const mapping = isObject(discriminator.mapping)\n    ? (discriminator.mapping as Readonly<Record<string, string>>)\n    : {};\n  const mapped = Object.values(mapping)\n    .filter((t) => typeof t === \"string\")\n    .map(mappingTarget);\n  const memberRefs = [...refsOf(node.oneOf), ...refsOf(node.anyOf), ...mapped];\n  return { pointer: pointer(), propertyName: discriminator.propertyName, mapping, memberRefs };\n}\n\n/** A node of the document walk; the pointer is built only for the nodes that need it. */\ninterface Visit {\n  readonly node: unknown;\n  readonly key: string | null;\n  readonly parent: Visit | null;\n}\n\nfunction pointerOf(visit: Visit): string {\n  const segments: string[] = [];\n  for (let current: Visit | null = visit; current?.key != null; current = current.parent) {\n    segments.unshift(current.key);\n  }\n  return createRef(segments);\n}\n\nfunction childrenOf(visit: Visit): Visit[] {\n  const { node } = visit;\n  const entries: [string, unknown][] = Array.isArray(node)\n    ? node.map((item, index) => [String(index), item])\n    : isObject(node)\n      ? Object.entries(node)\n      : [];\n  return entries.map(([key, child]) => ({ node: child, key, parent: visit }));\n}\n\n/**\n * Every Discriminator Object of the document, depth first, with its pointer. The walk keeps its\n * own stack, so a document nested past the call stack fails in the transform, as it did before.\n */\nfunction ownersIn(document: unknown): Owner[] {\n  const found: Owner[] = [];\n  const stack: Visit[] = [{ node: document, key: null, parent: null }];\n  for (let visit = stack.pop(); visit !== undefined; visit = stack.pop()) {\n    const owner = isObject(visit.node) ? ownerAt(visit.node, () => pointerOf(visit)) : null;\n    if (owner !== null) {\n      found.push(owner);\n    }\n    stack.push(...childrenOf(visit).reverse());\n  }\n  return found;\n}\n\n/** A member and the `$ref`s whose properties its type leaves out (`Omit` of its parents). */\ninterface Member {\n  readonly ref: string;\n  readonly skipped: ReadonlySet<string>;\n}\n\ninterface Child {\n  readonly ref: string;\n  readonly schema: JsonObject;\n}\n\n/** How the run types an `allOf` of a discriminated union. */\nexport interface ConflictOptions {\n  /**\n   * `allof-discriminated-union`: a schema that `allOf`s a union which does not contain it reuses\n   * the union and gets no value, so neither it nor the schemas below it are members.\n   */\n  readonly isUnionReused: boolean;\n}\n\n/** What the search for conflicts reads: the document and its `allOf` children by parent. */\ninterface ConflictSearch extends ConflictOptions {\n  readonly document: unknown;\n  readonly children: ReadonlyMap<string, readonly Child[]>;\n}\n\n/** The `allOf` children of the owner that inherit its discriminator. */\nfunction inheritingChildren(owner: Owner, search: ConflictSearch): readonly Child[] {\n  const children = search.children.get(owner.pointer) ?? [];\n  const resolve = (ref: string) => resolveLocalRef(search.document, ref);\n  const union = search.isUnionReused ? unionAt(owner.pointer, resolve) : undefined;\n  return union === undefined\n    ? children\n    : children.filter((child) => isUnionMember(union, child.ref, resolve));\n}\n\n/** The component schemas whose `allOf` holds a `$ref`, by that `$ref`, in document order. */\nfunction allOfChildren(document: unknown): Map<string, Child[]> {\n  const schemas = resolveLocalRef(document, \"#/components/schemas\");\n  const children = new Map<string, Child[]>();\n  for (const [name, schema] of Object.entries(isObject(schemas) ? schemas : {})) {\n    if (!isObject(schema)) {\n      continue;\n    }\n    const child = { ref: `${COMPONENT_SCHEMAS}${escapePointerSegment(name)}`, schema };\n    for (const parent of new Set(refsOf(schema.allOf))) {\n      const siblings = children.get(parent) ?? [];\n      siblings.push(child);\n      children.set(parent, siblings);\n    }\n  }\n  return children;\n}\n\n/** Whether a schema defines a discriminator of the property itself: it is the owner below. */\nfunction ownsProperty(schema: JsonObject, propertyName: string): boolean {\n  const discriminator = schema.discriminator;\n  return isObject(discriminator) && discriminator.propertyName === propertyName;\n}\n\n/**\n * Component schemas that inherit the owner through `allOf`, also through a chain\n * (`Lion: { allOf: [Cat] }`, `Cat: { allOf: [Pet] }`). Each parent on the way is left out of the\n * member's values, as its type omits the property. A schema with its own discriminator of the\n * property is a member, but the schemas below it are its own members.\n */\nfunction inheritingMembers(owner: Owner, search: ConflictSearch): Member[] {\n  const found: Member[] = [];\n  const visited = new Set([owner.pointer]);\n  const parents: Member[] = [{ ref: owner.pointer, skipped: new Set([owner.pointer]) }];\n  for (let parent = parents.shift(); parent !== undefined; parent = parents.shift()) {\n    const children =\n      parent.ref === owner.pointer\n        ? inheritingChildren(owner, search)\n        : (search.children.get(parent.ref) ?? []);\n    for (const child of children) {\n      if (visited.has(child.ref)) {\n        continue;\n      }\n      visited.add(child.ref);\n      found.push({ ref: child.ref, skipped: parent.skipped });\n      if (!ownsProperty(child.schema, owner.propertyName)) {\n        parents.push({ ref: child.ref, skipped: new Set([...parent.skipped, child.ref]) });\n      }\n    }\n  }\n  return found;\n}\n\n/** The members of an owner, each once: the listed and mapped ones, then the inheriting ones. */\nfunction membersOf(owner: Owner, search: ConflictSearch): Member[] {\n  const listed = owner.memberRefs.map((ref) => ({ ref, skipped: new Set([owner.pointer]) }));\n  const members = new Map<string, Member>();\n  for (const member of [...listed, ...inheritingMembers(owner, search)]) {\n    if (!members.has(member.ref)) {\n      members.set(member.ref, member);\n    }\n  }\n  return [...members.values()];\n}\n\nfunction memberValues(owner: Owner, member: string): { values: string[]; isImplicit: boolean } {\n  const values = Object.entries(owner.mapping)\n    .filter(([, target]) => typeof target === \"string\" && mappingTarget(target) === member)\n    .map(([key]) => key);\n  const name = parseRefPointer(member).pop() ?? \"\";\n  return values.length > 0 ? { values, isImplicit: false } : { values: [name], isImplicit: true };\n}\n\nfunction conflictOf(owner: Owner, { ref: member, skipped }: Member, document: unknown) {\n  // The owner's own property is left out of an inheriting member's type (`Omit`).\n  const allowed = admittedPropertyValues(\n    resolveLocalRef(document, member),\n    owner.propertyName,\n    document,\n    skipped,\n  );\n  const { values, isImplicit } = memberValues(owner, member);\n  if (allowed === null || values.some((value) => allowed.has(value))) {\n    return null;\n  }\n  const { pointer, propertyName } = owner;\n  return { member, owner: pointer, propertyName, values, allowed: [...allowed], isImplicit };\n}\n\n/** The conflicts of the document, one per member and value list, in document order. */\nexport function findDiscriminatorValueConflicts(\n  document: unknown,\n  options: ConflictOptions = { isUnionReused: false },\n): readonly DiscriminatorValueConflict[] {\n  const conflicts = new Map<string, DiscriminatorValueConflict>();\n  const search = { ...options, document, children: allOfChildren(document) };\n  for (const owner of ownersIn(document)) {\n    for (const member of membersOf(owner, search)) {\n      const conflict = conflictOf(owner, member, document);\n      const key = JSON.stringify([member.ref, conflict?.propertyName, conflict?.values]);\n      if (conflict !== null && !conflicts.has(key)) {\n        conflicts.set(key, conflict);\n      }\n    }\n  }\n  return [...conflicts.values()];\n}\n"],"names":["escapePointerSegment","createRef","resolveLocalRef","unionAt","isUnionMember","parseRefPointer","admittedPropertyValues"],"mappings":";;;;;;AA4BA,MAAM,iBAAA,GAAoB,uBAAA;AAE1B,SAAS,SAAS,KAAA,EAAqC;AACrD,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,KAAU,QAAQ,CAAC,KAAA,CAAM,QAAQ,KAAK,CAAA;AAC5E;AASA,SAAS,OAAO,IAAA,EAAyB;AACvC,EAAA,OAAA,CAAQ,MAAM,OAAA,CAAQ,IAAI,CAAA,GAAI,IAAA,GAAO,EAAC,EAAG,OAAA;AAAA,IAAQ,CAAC,IAAA,KAChD,QAAA,CAAS,IAAI,CAAA,IAAK,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,GAAW,CAAC,IAAA,CAAK,IAAI,IAAI;AAAC,GACnE;AACF;AAEA,SAAS,cAAc,MAAA,EAAwB;AAC7C,EAAA,OAAO,MAAA,CAAO,UAAA,CAAW,GAAG,CAAA,GAAI,MAAA,GAAS,GAAG,iBAAiB,CAAA,EAAGA,gCAAA,CAAqB,MAAM,CAAC,CAAA,CAAA;AAC9F;AAEA,SAAS,OAAA,CAAQ,MAAkB,OAAA,EAAqC;AACtE,EAAA,MAAM,gBAAgB,IAAA,CAAK,aAAA;AAC3B,EAAA,IAAI,CAAC,QAAA,CAAS,aAAa,KAAK,OAAO,aAAA,CAAc,iBAAiB,QAAA,EAAU;AAC9E,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,UAAU,QAAA,CAAS,aAAA,CAAc,OAAO,CAAA,GACzC,aAAA,CAAc,UACf,EAAC;AACL,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,MAAA,CAAO,OAAO,CAAA,CACjC,MAAA,CAAO,CAAC,CAAA,KAAM,OAAO,CAAA,KAAM,QAAQ,CAAA,CACnC,IAAI,aAAa,CAAA;AACpB,EAAA,MAAM,UAAA,GAAa,CAAC,GAAG,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,EAAG,GAAG,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,EAAG,GAAG,MAAM,CAAA;AAC3E,EAAA,OAAO,EAAE,SAAS,OAAA,EAAQ,EAAG,cAAc,aAAA,CAAc,YAAA,EAAc,SAAS,UAAA,EAAW;AAC7F;AASA,SAAS,UAAU,KAAA,EAAsB;AACvC,EAAA,MAAM,WAAqB,EAAC;AAC5B,EAAA,KAAA,IAAS,UAAwB,KAAA,EAAO,OAAA,EAAS,OAAO,IAAA,EAAM,OAAA,GAAU,QAAQ,MAAA,EAAQ;AACtF,IAAA,QAAA,CAAS,OAAA,CAAQ,QAAQ,GAAG,CAAA;AAAA,EAC9B;AACA,EAAA,OAAOC,sBAAU,QAAQ,CAAA;AAC3B;AAEA,SAAS,WAAW,KAAA,EAAuB;AACzC,EAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,EAAA,MAAM,OAAA,GAA+B,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,GACnD,KAAK,GAAA,CAAI,CAAC,IAAA,EAAM,KAAA,KAAU,CAAC,MAAA,CAAO,KAAK,CAAA,EAAG,IAAI,CAAC,CAAA,GAC/C,QAAA,CAAS,IAAI,IACX,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,GACnB,EAAC;AACP,EAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,GAAA,EAAK,KAAK,CAAA,MAAO,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,MAAA,EAAQ,OAAM,CAAE,CAAA;AAC5E;AAMA,SAAS,SAAS,QAAA,EAA4B;AAC5C,EAAA,MAAM,QAAiB,EAAC;AACxB,EAAA,MAAM,KAAA,GAAiB,CAAC,EAAE,IAAA,EAAM,UAAU,GAAA,EAAK,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,CAAA;AACnE,EAAA,KAAA,IAAS,KAAA,GAAQ,MAAM,GAAA,EAAI,EAAG,UAAU,MAAA,EAAW,KAAA,GAAQ,KAAA,CAAM,GAAA,EAAI,EAAG;AACtE,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,CAAM,IAAI,CAAA,GAAI,OAAA,CAAQ,KAAA,CAAM,IAAA,EAAM,MAAM,SAAA,CAAU,KAAK,CAAC,CAAA,GAAI,IAAA;AACnF,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAAA,IAClB;AACA,IAAA,KAAA,CAAM,KAAK,GAAG,UAAA,CAAW,KAAK,CAAA,CAAE,SAAS,CAAA;AAAA,EAC3C;AACA,EAAA,OAAO,KAAA;AACT;AA6BA,SAAS,kBAAA,CAAmB,OAAc,MAAA,EAA0C;AAClF,EAAA,MAAM,WAAW,MAAA,CAAO,QAAA,CAAS,IAAI,KAAA,CAAM,OAAO,KAAK,EAAC;AACxD,EAAA,MAAM,UAAU,CAAC,GAAA,KAAgBC,8BAAA,CAAgB,MAAA,CAAO,UAAU,GAAG,CAAA;AACrE,EAAA,MAAM,QAAQ,MAAA,CAAO,aAAA,GAAgBC,2BAAQ,KAAA,CAAM,OAAA,EAAS,OAAO,CAAA,GAAI,MAAA;AACvE,EAAA,OAAO,KAAA,KAAU,MAAA,GACb,QAAA,GACA,QAAA,CAAS,MAAA,CAAO,CAAC,KAAA,KAAUC,gCAAA,CAAc,KAAA,EAAO,KAAA,CAAM,GAAA,EAAK,OAAO,CAAC,CAAA;AACzE;AAGA,SAAS,cAAc,QAAA,EAAyC;AAC9D,EAAA,MAAM,OAAA,GAAUF,8BAAA,CAAgB,QAAA,EAAU,sBAAsB,CAAA;AAChE,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAqB;AAC1C,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,MAAM,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,QAAA,CAAS,OAAO,CAAA,GAAI,OAAA,GAAU,EAAE,CAAA,EAAG;AAC7E,IAAA,IAAI,CAAC,QAAA,CAAS,MAAM,CAAA,EAAG;AACrB,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAA,GAAQ,EAAE,GAAA,EAAK,CAAA,EAAG,iBAAiB,GAAGF,gCAAA,CAAqB,IAAI,CAAC,CAAA,CAAA,EAAI,MAAA,EAAO;AACjF,IAAA,KAAA,MAAW,UAAU,IAAI,GAAA,CAAI,OAAO,MAAA,CAAO,KAAK,CAAC,CAAA,EAAG;AAClD,MAAA,MAAM,QAAA,GAAW,QAAA,CAAS,GAAA,CAAI,MAAM,KAAK,EAAC;AAC1C,MAAA,QAAA,CAAS,KAAK,KAAK,CAAA;AACnB,MAAA,QAAA,CAAS,GAAA,CAAI,QAAQ,QAAQ,CAAA;AAAA,IAC/B;AAAA,EACF;AACA,EAAA,OAAO,QAAA;AACT;AAGA,SAAS,YAAA,CAAa,QAAoB,YAAA,EAA+B;AACvE,EAAA,MAAM,gBAAgB,MAAA,CAAO,aAAA;AAC7B,EAAA,OAAO,QAAA,CAAS,aAAa,CAAA,IAAK,aAAA,CAAc,YAAA,KAAiB,YAAA;AACnE;AAQA,SAAS,iBAAA,CAAkB,OAAc,MAAA,EAAkC;AACzE,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,MAAM,0BAAU,IAAI,GAAA,CAAI,CAAC,KAAA,CAAM,OAAO,CAAC,CAAA;AACvC,EAAA,MAAM,OAAA,GAAoB,CAAC,EAAE,GAAA,EAAK,MAAM,OAAA,EAAS,OAAA,kBAAS,IAAI,GAAA,CAAI,CAAC,KAAA,CAAM,OAAO,CAAC,GAAG,CAAA;AACpF,EAAA,KAAA,IAAS,MAAA,GAAS,QAAQ,KAAA,EAAM,EAAG,WAAW,MAAA,EAAW,MAAA,GAAS,OAAA,CAAQ,KAAA,EAAM,EAAG;AACjF,IAAA,MAAM,QAAA,GACJ,MAAA,CAAO,GAAA,KAAQ,KAAA,CAAM,UACjB,kBAAA,CAAmB,KAAA,EAAO,MAAM,CAAA,GAC/B,OAAO,QAAA,CAAS,GAAA,CAAI,MAAA,CAAO,GAAG,KAAK,EAAC;AAC3C,IAAA,KAAA,MAAW,SAAS,QAAA,EAAU;AAC5B,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,KAAA,CAAM,GAAG,CAAA,EAAG;AAC1B,QAAA;AAAA,MACF;AACA,MAAA,OAAA,CAAQ,GAAA,CAAI,MAAM,GAAG,CAAA;AACrB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,GAAA,EAAK,KAAA,CAAM,KAAK,OAAA,EAAS,MAAA,CAAO,SAAS,CAAA;AACtD,MAAA,IAAI,CAAC,YAAA,CAAa,KAAA,CAAM,MAAA,EAAQ,KAAA,CAAM,YAAY,CAAA,EAAG;AACnD,QAAA,OAAA,CAAQ,KAAK,EAAE,GAAA,EAAK,KAAA,CAAM,GAAA,EAAK,yBAAS,IAAI,GAAA,CAAI,CAAC,GAAG,OAAO,OAAA,EAAS,KAAA,CAAM,GAAG,CAAC,GAAG,CAAA;AAAA,MACnF;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,SAAA,CAAU,OAAc,MAAA,EAAkC;AACjE,EAAA,MAAM,SAAS,KAAA,CAAM,UAAA,CAAW,GAAA,CAAI,CAAC,SAAS,EAAE,GAAA,EAAK,OAAA,kBAAS,IAAI,IAAI,CAAC,KAAA,CAAM,OAAO,CAAC,GAAE,CAAE,CAAA;AACzF,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAoB;AACxC,EAAA,KAAA,MAAW,MAAA,IAAU,CAAC,GAAG,MAAA,EAAQ,GAAG,iBAAA,CAAkB,KAAA,EAAO,MAAM,CAAC,CAAA,EAAG;AACrE,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,GAAG,CAAA,EAAG;AAC5B,MAAA,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,GAAA,EAAK,MAAM,CAAA;AAAA,IAChC;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,OAAA,CAAQ,MAAA,EAAQ,CAAA;AAC7B;AAEA,SAAS,YAAA,CAAa,OAAc,MAAA,EAA2D;AAC7F,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,OAAA,CAAQ,KAAA,CAAM,OAAO,EACxC,MAAA,CAAO,CAAC,GAAG,MAAM,CAAA,KAAM,OAAO,MAAA,KAAW,QAAA,IAAY,aAAA,CAAc,MAAM,CAAA,KAAM,MAAM,CAAA,CACrF,GAAA,CAAI,CAAC,CAAC,GAAG,CAAA,KAAM,GAAG,CAAA;AACrB,EAAA,MAAM,IAAA,GAAOK,2BAAA,CAAgB,MAAM,CAAA,CAAE,KAAI,IAAK,EAAA;AAC9C,EAAA,OAAO,MAAA,CAAO,MAAA,GAAS,CAAA,GAAI,EAAE,QAAQ,UAAA,EAAY,KAAA,EAAM,GAAI,EAAE,MAAA,EAAQ,CAAC,IAAI,CAAA,EAAG,YAAY,IAAA,EAAK;AAChG;AAEA,SAAS,WAAW,KAAA,EAAc,EAAE,KAAK,MAAA,EAAQ,OAAA,IAAmB,QAAA,EAAmB;AAErF,EAAA,MAAM,OAAA,GAAUC,qCAAA;AAAA,IACdJ,8BAAA,CAAgB,UAAU,MAAM,CAAA;AAAA,IAChC,KAAA,CAAM,YAAA;AAAA,IACN,QAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,EAAE,MAAA,EAAQ,UAAA,EAAW,GAAI,YAAA,CAAa,OAAO,MAAM,CAAA;AACzD,EAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,MAAA,CAAO,IAAA,CAAK,CAAC,UAAU,OAAA,CAAQ,GAAA,CAAI,KAAK,CAAC,CAAA,EAAG;AAClE,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,EAAE,OAAA,EAAS,YAAA,EAAa,GAAI,KAAA;AAClC,EAAA,OAAO,EAAE,MAAA,EAAQ,KAAA,EAAO,OAAA,EAAS,YAAA,EAAc,MAAA,EAAQ,OAAA,EAAS,CAAC,GAAG,OAAO,CAAA,EAAG,UAAA,EAAW;AAC3F;AAGO,SAAS,gCACd,QAAA,EACA,OAAA,GAA2B,EAAE,aAAA,EAAe,OAAM,EACX;AACvC,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAwC;AAC9D,EAAA,MAAM,MAAA,GAAS,EAAE,GAAG,OAAA,EAAS,UAAU,QAAA,EAAU,aAAA,CAAc,QAAQ,CAAA,EAAE;AACzE,EAAA,KAAA,MAAW,KAAA,IAAS,QAAA,CAAS,QAAQ,CAAA,EAAG;AACtC,IAAA,KAAA,MAAW,MAAA,IAAU,SAAA,CAAU,KAAA,EAAO,MAAM,CAAA,EAAG;AAC7C,MAAA,MAAM,QAAA,GAAW,UAAA,CAAW,KAAA,EAAO,MAAA,EAAQ,QAAQ,CAAA;AACnD,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,SAAA,CAAU,CAAC,MAAA,CAAO,KAAK,QAAA,EAAU,YAAA,EAAc,QAAA,EAAU,MAAM,CAAC,CAAA;AACjF,MAAA,IAAI,aAAa,IAAA,IAAQ,CAAC,SAAA,CAAU,GAAA,CAAI,GAAG,CAAA,EAAG;AAC5C,QAAA,SAAA,CAAU,GAAA,CAAI,KAAK,QAAQ,CAAA;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,SAAA,CAAU,MAAA,EAAQ,CAAA;AAC/B;;"}

package/dist/domain/openapi/discriminator-conflicts.mjs

@@ -0,0 +1,141 @@
+import { resolveLocalRef, admittedPropertyValues } from './admitted-values.mjs';
+import { unionAt, isUnionMember } from './discriminated-union.mjs';
+import { escapePointerSegment, parseRefPointer, createRef } from './json-pointer.mjs';
+
+const COMPONENT_SCHEMAS = "#/components/schemas/";
+function isObject(value) {
+  return typeof value === "object" && value !== null && !Array.isArray(value);
+}
+function refsOf(list) {
+  return (Array.isArray(list) ? list : []).flatMap(
+    (item) => isObject(item) && typeof item.$ref === "string" ? [item.$ref] : []
+  );
+}
+function mappingTarget(target) {
+  return target.startsWith("#") ? target : `${COMPONENT_SCHEMAS}${escapePointerSegment(target)}`;
+}
+function ownerAt(node, pointer) {
+  const discriminator = node.discriminator;
+  if (!isObject(discriminator) || typeof discriminator.propertyName !== "string") {
+    return null;
+  }
+  const mapping = isObject(discriminator.mapping) ? discriminator.mapping : {};
+  const mapped = Object.values(mapping).filter((t) => typeof t === "string").map(mappingTarget);
+  const memberRefs = [...refsOf(node.oneOf), ...refsOf(node.anyOf), ...mapped];
+  return { pointer: pointer(), propertyName: discriminator.propertyName, mapping, memberRefs };
+}
+function pointerOf(visit) {
+  const segments = [];
+  for (let current = visit; current?.key != null; current = current.parent) {
+    segments.unshift(current.key);
+  }
+  return createRef(segments);
+}
+function childrenOf(visit) {
+  const { node } = visit;
+  const entries = Array.isArray(node) ? node.map((item, index) => [String(index), item]) : isObject(node) ? Object.entries(node) : [];
+  return entries.map(([key, child]) => ({ node: child, key, parent: visit }));
+}
+function ownersIn(document) {
+  const found = [];
+  const stack = [{ node: document, key: null, parent: null }];
+  for (let visit = stack.pop(); visit !== void 0; visit = stack.pop()) {
+    const owner = isObject(visit.node) ? ownerAt(visit.node, () => pointerOf(visit)) : null;
+    if (owner !== null) {
+      found.push(owner);
+    }
+    stack.push(...childrenOf(visit).reverse());
+  }
+  return found;
+}
+function inheritingChildren(owner, search) {
+  const children = search.children.get(owner.pointer) ?? [];
+  const resolve = (ref) => resolveLocalRef(search.document, ref);
+  const union = search.isUnionReused ? unionAt(owner.pointer, resolve) : void 0;
+  return union === void 0 ? children : children.filter((child) => isUnionMember(union, child.ref, resolve));
+}
+function allOfChildren(document) {
+  const schemas = resolveLocalRef(document, "#/components/schemas");
+  const children = /* @__PURE__ */ new Map();
+  for (const [name, schema] of Object.entries(isObject(schemas) ? schemas : {})) {
+    if (!isObject(schema)) {
+      continue;
+    }
+    const child = { ref: `${COMPONENT_SCHEMAS}${escapePointerSegment(name)}`, schema };
+    for (const parent of new Set(refsOf(schema.allOf))) {
+      const siblings = children.get(parent) ?? [];
+      siblings.push(child);
+      children.set(parent, siblings);
+    }
+  }
+  return children;
+}
+function ownsProperty(schema, propertyName) {
+  const discriminator = schema.discriminator;
+  return isObject(discriminator) && discriminator.propertyName === propertyName;
+}
+function inheritingMembers(owner, search) {
+  const found = [];
+  const visited = /* @__PURE__ */ new Set([owner.pointer]);
+  const parents = [{ ref: owner.pointer, skipped: /* @__PURE__ */ new Set([owner.pointer]) }];
+  for (let parent = parents.shift(); parent !== void 0; parent = parents.shift()) {
+    const children = parent.ref === owner.pointer ? inheritingChildren(owner, search) : search.children.get(parent.ref) ?? [];
+    for (const child of children) {
+      if (visited.has(child.ref)) {
+        continue;
+      }
+      visited.add(child.ref);
+      found.push({ ref: child.ref, skipped: parent.skipped });
+      if (!ownsProperty(child.schema, owner.propertyName)) {
+        parents.push({ ref: child.ref, skipped: /* @__PURE__ */ new Set([...parent.skipped, child.ref]) });
+      }
+    }
+  }
+  return found;
+}
+function membersOf(owner, search) {
+  const listed = owner.memberRefs.map((ref) => ({ ref, skipped: /* @__PURE__ */ new Set([owner.pointer]) }));
+  const members = /* @__PURE__ */ new Map();
+  for (const member of [...listed, ...inheritingMembers(owner, search)]) {
+    if (!members.has(member.ref)) {
+      members.set(member.ref, member);
+    }
+  }
+  return [...members.values()];
+}
+function memberValues(owner, member) {
+  const values = Object.entries(owner.mapping).filter(([, target]) => typeof target === "string" && mappingTarget(target) === member).map(([key]) => key);
+  const name = parseRefPointer(member).pop() ?? "";
+  return values.length > 0 ? { values, isImplicit: false } : { values: [name], isImplicit: true };
+}
+function conflictOf(owner, { ref: member, skipped }, document) {
+  const allowed = admittedPropertyValues(
+    resolveLocalRef(document, member),
+    owner.propertyName,
+    document,
+    skipped
+  );
+  const { values, isImplicit } = memberValues(owner, member);
+  if (allowed === null || values.some((value) => allowed.has(value))) {
+    return null;
+  }
+  const { pointer, propertyName } = owner;
+  return { member, owner: pointer, propertyName, values, allowed: [...allowed], isImplicit };
+}
+function findDiscriminatorValueConflicts(document, options = { isUnionReused: false }) {
+  const conflicts = /* @__PURE__ */ new Map();
+  const search = { ...options, document, children: allOfChildren(document) };
+  for (const owner of ownersIn(document)) {
+    for (const member of membersOf(owner, search)) {
+      const conflict = conflictOf(owner, member, document);
+      const key = JSON.stringify([member.ref, conflict?.propertyName, conflict?.values]);
+      if (conflict !== null && !conflicts.has(key)) {
+        conflicts.set(key, conflict);
+      }
+    }
+  }
+  return [...conflicts.values()];
+}
+
+export { findDiscriminatorValueConflicts };
+//# sourceMappingURL=discriminator-conflicts.mjs.map

package/dist/domain/openapi/discriminator-conflicts.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"discriminator-conflicts.mjs","sources":["../../../src/domain/openapi/discriminator-conflicts.ts"],"sourcesContent":["import { admittedPropertyValues, resolveLocalRef } from \"./admitted-values.js\";\nimport { isUnionMember, unionAt } from \"./discriminated-union.js\";\nimport { createRef, escapePointerSegment, parseRefPointer } from \"./json-pointer.js\";\n\n/**\n * Discriminator members whose discriminator value their own property does not allow. By the\n * Discriminator Object rule, a member that no `mapping` entry names has its schema name as the\n * value, so with a property `enum` (or `const`) that does not list it no value of the member\n * matches, and where the generator adds the value to the member the property type is `never`.\n * Each one gets a warning (CODING_PRINCIPLES §8.7).\n */\n\nexport interface DiscriminatorValueConflict {\n  /** The member schema, such as `#/components/schemas/EpisodeObject`. */\n  readonly member: string;\n  /** The schema that has the Discriminator Object. */\n  readonly owner: string;\n  readonly propertyName: string;\n  /** The values the discriminator gives the member: its mapping keys, or its name. */\n  readonly values: readonly string[];\n  /** The values the member's property allows. */\n  readonly allowed: readonly (string | number | boolean | null)[];\n  /** Whether no mapping entry names the member, so its value is its schema name. */\n  readonly isImplicit: boolean;\n}\n\ntype JsonObject = Readonly<Record<string, unknown>>;\n\nconst COMPONENT_SCHEMAS = \"#/components/schemas/\";\n\nfunction isObject(value: unknown): value is JsonObject {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\ninterface Owner {\n  readonly pointer: string;\n  readonly propertyName: string;\n  readonly mapping: Readonly<Record<string, string>>;\n  readonly memberRefs: readonly string[];\n}\n\nfunction refsOf(list: unknown): string[] {\n  return (Array.isArray(list) ? list : []).flatMap((item) =>\n    isObject(item) && typeof item.$ref === \"string\" ? [item.$ref] : [],\n  );\n}\n\nfunction mappingTarget(target: string): string {\n  return target.startsWith(\"#\") ? target : `${COMPONENT_SCHEMAS}${escapePointerSegment(target)}`;\n}\n\nfunction ownerAt(node: JsonObject, pointer: () => string): Owner | null {\n  const discriminator = node.discriminator;\n  if (!isObject(discriminator) || typeof discriminator.propertyName !== \"string\") {\n    return null;\n  }\n  const mapping = isObject(discriminator.mapping)\n    ? (discriminator.mapping as Readonly<Record<string, string>>)\n    : {};\n  const mapped = Object.values(mapping)\n    .filter((t) => typeof t === \"string\")\n    .map(mappingTarget);\n  const memberRefs = [...refsOf(node.oneOf), ...refsOf(node.anyOf), ...mapped];\n  return { pointer: pointer(), propertyName: discriminator.propertyName, mapping, memberRefs };\n}\n\n/** A node of the document walk; the pointer is built only for the nodes that need it. */\ninterface Visit {\n  readonly node: unknown;\n  readonly key: string | null;\n  readonly parent: Visit | null;\n}\n\nfunction pointerOf(visit: Visit): string {\n  const segments: string[] = [];\n  for (let current: Visit | null = visit; current?.key != null; current = current.parent) {\n    segments.unshift(current.key);\n  }\n  return createRef(segments);\n}\n\nfunction childrenOf(visit: Visit): Visit[] {\n  const { node } = visit;\n  const entries: [string, unknown][] = Array.isArray(node)\n    ? node.map((item, index) => [String(index), item])\n    : isObject(node)\n      ? Object.entries(node)\n      : [];\n  return entries.map(([key, child]) => ({ node: child, key, parent: visit }));\n}\n\n/**\n * Every Discriminator Object of the document, depth first, with its pointer. The walk keeps its\n * own stack, so a document nested past the call stack fails in the transform, as it did before.\n */\nfunction ownersIn(document: unknown): Owner[] {\n  const found: Owner[] = [];\n  const stack: Visit[] = [{ node: document, key: null, parent: null }];\n  for (let visit = stack.pop(); visit !== undefined; visit = stack.pop()) {\n    const owner = isObject(visit.node) ? ownerAt(visit.node, () => pointerOf(visit)) : null;\n    if (owner !== null) {\n      found.push(owner);\n    }\n    stack.push(...childrenOf(visit).reverse());\n  }\n  return found;\n}\n\n/** A member and the `$ref`s whose properties its type leaves out (`Omit` of its parents). */\ninterface Member {\n  readonly ref: string;\n  readonly skipped: ReadonlySet<string>;\n}\n\ninterface Child {\n  readonly ref: string;\n  readonly schema: JsonObject;\n}\n\n/** How the run types an `allOf` of a discriminated union. */\nexport interface ConflictOptions {\n  /**\n   * `allof-discriminated-union`: a schema that `allOf`s a union which does not contain it reuses\n   * the union and gets no value, so neither it nor the schemas below it are members.\n   */\n  readonly isUnionReused: boolean;\n}\n\n/** What the search for conflicts reads: the document and its `allOf` children by parent. */\ninterface ConflictSearch extends ConflictOptions {\n  readonly document: unknown;\n  readonly children: ReadonlyMap<string, readonly Child[]>;\n}\n\n/** The `allOf` children of the owner that inherit its discriminator. */\nfunction inheritingChildren(owner: Owner, search: ConflictSearch): readonly Child[] {\n  const children = search.children.get(owner.pointer) ?? [];\n  const resolve = (ref: string) => resolveLocalRef(search.document, ref);\n  const union = search.isUnionReused ? unionAt(owner.pointer, resolve) : undefined;\n  return union === undefined\n    ? children\n    : children.filter((child) => isUnionMember(union, child.ref, resolve));\n}\n\n/** The component schemas whose `allOf` holds a `$ref`, by that `$ref`, in document order. */\nfunction allOfChildren(document: unknown): Map<string, Child[]> {\n  const schemas = resolveLocalRef(document, \"#/components/schemas\");\n  const children = new Map<string, Child[]>();\n  for (const [name, schema] of Object.entries(isObject(schemas) ? schemas : {})) {\n    if (!isObject(schema)) {\n      continue;\n    }\n    const child = { ref: `${COMPONENT_SCHEMAS}${escapePointerSegment(name)}`, schema };\n    for (const parent of new Set(refsOf(schema.allOf))) {\n      const siblings = children.get(parent) ?? [];\n      siblings.push(child);\n      children.set(parent, siblings);\n    }\n  }\n  return children;\n}\n\n/** Whether a schema defines a discriminator of the property itself: it is the owner below. */\nfunction ownsProperty(schema: JsonObject, propertyName: string): boolean {\n  const discriminator = schema.discriminator;\n  return isObject(discriminator) && discriminator.propertyName === propertyName;\n}\n\n/**\n * Component schemas that inherit the owner through `allOf`, also through a chain\n * (`Lion: { allOf: [Cat] }`, `Cat: { allOf: [Pet] }`). Each parent on the way is left out of the\n * member's values, as its type omits the property. A schema with its own discriminator of the\n * property is a member, but the schemas below it are its own members.\n */\nfunction inheritingMembers(owner: Owner, search: ConflictSearch): Member[] {\n  const found: Member[] = [];\n  const visited = new Set([owner.pointer]);\n  const parents: Member[] = [{ ref: owner.pointer, skipped: new Set([owner.pointer]) }];\n  for (let parent = parents.shift(); parent !== undefined; parent = parents.shift()) {\n    const children =\n      parent.ref === owner.pointer\n        ? inheritingChildren(owner, search)\n        : (search.children.get(parent.ref) ?? []);\n    for (const child of children) {\n      if (visited.has(child.ref)) {\n        continue;\n      }\n      visited.add(child.ref);\n      found.push({ ref: child.ref, skipped: parent.skipped });\n      if (!ownsProperty(child.schema, owner.propertyName)) {\n        parents.push({ ref: child.ref, skipped: new Set([...parent.skipped, child.ref]) });\n      }\n    }\n  }\n  return found;\n}\n\n/** The members of an owner, each once: the listed and mapped ones, then the inheriting ones. */\nfunction membersOf(owner: Owner, search: ConflictSearch): Member[] {\n  const listed = owner.memberRefs.map((ref) => ({ ref, skipped: new Set([owner.pointer]) }));\n  const members = new Map<string, Member>();\n  for (const member of [...listed, ...inheritingMembers(owner, search)]) {\n    if (!members.has(member.ref)) {\n      members.set(member.ref, member);\n    }\n  }\n  return [...members.values()];\n}\n\nfunction memberValues(owner: Owner, member: string): { values: string[]; isImplicit: boolean } {\n  const values = Object.entries(owner.mapping)\n    .filter(([, target]) => typeof target === \"string\" && mappingTarget(target) === member)\n    .map(([key]) => key);\n  const name = parseRefPointer(member).pop() ?? \"\";\n  return values.length > 0 ? { values, isImplicit: false } : { values: [name], isImplicit: true };\n}\n\nfunction conflictOf(owner: Owner, { ref: member, skipped }: Member, document: unknown) {\n  // The owner's own property is left out of an inheriting member's type (`Omit`).\n  const allowed = admittedPropertyValues(\n    resolveLocalRef(document, member),\n    owner.propertyName,\n    document,\n    skipped,\n  );\n  const { values, isImplicit } = memberValues(owner, member);\n  if (allowed === null || values.some((value) => allowed.has(value))) {\n    return null;\n  }\n  const { pointer, propertyName } = owner;\n  return { member, owner: pointer, propertyName, values, allowed: [...allowed], isImplicit };\n}\n\n/** The conflicts of the document, one per member and value list, in document order. */\nexport function findDiscriminatorValueConflicts(\n  document: unknown,\n  options: ConflictOptions = { isUnionReused: false },\n): readonly DiscriminatorValueConflict[] {\n  const conflicts = new Map<string, DiscriminatorValueConflict>();\n  const search = { ...options, document, children: allOfChildren(document) };\n  for (const owner of ownersIn(document)) {\n    for (const member of membersOf(owner, search)) {\n      const conflict = conflictOf(owner, member, document);\n      const key = JSON.stringify([member.ref, conflict?.propertyName, conflict?.values]);\n      if (conflict !== null && !conflicts.has(key)) {\n        conflicts.set(key, conflict);\n      }\n    }\n  }\n  return [...conflicts.values()];\n}\n"],"names":[],"mappings":";;;;AA4BA,MAAM,iBAAA,GAAoB,uBAAA;AAE1B,SAAS,SAAS,KAAA,EAAqC;AACrD,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,KAAU,QAAQ,CAAC,KAAA,CAAM,QAAQ,KAAK,CAAA;AAC5E;AASA,SAAS,OAAO,IAAA,EAAyB;AACvC,EAAA,OAAA,CAAQ,MAAM,OAAA,CAAQ,IAAI,CAAA,GAAI,IAAA,GAAO,EAAC,EAAG,OAAA;AAAA,IAAQ,CAAC,IAAA,KAChD,QAAA,CAAS,IAAI,CAAA,IAAK,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,GAAW,CAAC,IAAA,CAAK,IAAI,IAAI;AAAC,GACnE;AACF;AAEA,SAAS,cAAc,MAAA,EAAwB;AAC7C,EAAA,OAAO,MAAA,CAAO,UAAA,CAAW,GAAG,CAAA,GAAI,MAAA,GAAS,GAAG,iBAAiB,CAAA,EAAG,oBAAA,CAAqB,MAAM,CAAC,CAAA,CAAA;AAC9F;AAEA,SAAS,OAAA,CAAQ,MAAkB,OAAA,EAAqC;AACtE,EAAA,MAAM,gBAAgB,IAAA,CAAK,aAAA;AAC3B,EAAA,IAAI,CAAC,QAAA,CAAS,aAAa,KAAK,OAAO,aAAA,CAAc,iBAAiB,QAAA,EAAU;AAC9E,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,UAAU,QAAA,CAAS,aAAA,CAAc,OAAO,CAAA,GACzC,aAAA,CAAc,UACf,EAAC;AACL,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,MAAA,CAAO,OAAO,CAAA,CACjC,MAAA,CAAO,CAAC,CAAA,KAAM,OAAO,CAAA,KAAM,QAAQ,CAAA,CACnC,IAAI,aAAa,CAAA;AACpB,EAAA,MAAM,UAAA,GAAa,CAAC,GAAG,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,EAAG,GAAG,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,EAAG,GAAG,MAAM,CAAA;AAC3E,EAAA,OAAO,EAAE,SAAS,OAAA,EAAQ,EAAG,cAAc,aAAA,CAAc,YAAA,EAAc,SAAS,UAAA,EAAW;AAC7F;AASA,SAAS,UAAU,KAAA,EAAsB;AACvC,EAAA,MAAM,WAAqB,EAAC;AAC5B,EAAA,KAAA,IAAS,UAAwB,KAAA,EAAO,OAAA,EAAS,OAAO,IAAA,EAAM,OAAA,GAAU,QAAQ,MAAA,EAAQ;AACtF,IAAA,QAAA,CAAS,OAAA,CAAQ,QAAQ,GAAG,CAAA;AAAA,EAC9B;AACA,EAAA,OAAO,UAAU,QAAQ,CAAA;AAC3B;AAEA,SAAS,WAAW,KAAA,EAAuB;AACzC,EAAA,MAAM,EAAE,MAAK,GAAI,KAAA;AACjB,EAAA,MAAM,OAAA,GAA+B,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,GACnD,KAAK,GAAA,CAAI,CAAC,IAAA,EAAM,KAAA,KAAU,CAAC,MAAA,CAAO,KAAK,CAAA,EAAG,IAAI,CAAC,CAAA,GAC/C,QAAA,CAAS,IAAI,IACX,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,GACnB,EAAC;AACP,EAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,GAAA,EAAK,KAAK,CAAA,MAAO,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,MAAA,EAAQ,OAAM,CAAE,CAAA;AAC5E;AAMA,SAAS,SAAS,QAAA,EAA4B;AAC5C,EAAA,MAAM,QAAiB,EAAC;AACxB,EAAA,MAAM,KAAA,GAAiB,CAAC,EAAE,IAAA,EAAM,UAAU,GAAA,EAAK,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,CAAA;AACnE,EAAA,KAAA,IAAS,KAAA,GAAQ,MAAM,GAAA,EAAI,EAAG,UAAU,MAAA,EAAW,KAAA,GAAQ,KAAA,CAAM,GAAA,EAAI,EAAG;AACtE,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,CAAM,IAAI,CAAA,GAAI,OAAA,CAAQ,KAAA,CAAM,IAAA,EAAM,MAAM,SAAA,CAAU,KAAK,CAAC,CAAA,GAAI,IAAA;AACnF,IAAA,IAAI,UAAU,IAAA,EAAM;AAClB,MAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAAA,IAClB;AACA,IAAA,KAAA,CAAM,KAAK,GAAG,UAAA,CAAW,KAAK,CAAA,CAAE,SAAS,CAAA;AAAA,EAC3C;AACA,EAAA,OAAO,KAAA;AACT;AA6BA,SAAS,kBAAA,CAAmB,OAAc,MAAA,EAA0C;AAClF,EAAA,MAAM,WAAW,MAAA,CAAO,QAAA,CAAS,IAAI,KAAA,CAAM,OAAO,KAAK,EAAC;AACxD,EAAA,MAAM,UAAU,CAAC,GAAA,KAAgB,eAAA,CAAgB,MAAA,CAAO,UAAU,GAAG,CAAA;AACrE,EAAA,MAAM,QAAQ,MAAA,CAAO,aAAA,GAAgB,QAAQ,KAAA,CAAM,OAAA,EAAS,OAAO,CAAA,GAAI,MAAA;AACvE,EAAA,OAAO,KAAA,KAAU,MAAA,GACb,QAAA,GACA,QAAA,CAAS,MAAA,CAAO,CAAC,KAAA,KAAU,aAAA,CAAc,KAAA,EAAO,KAAA,CAAM,GAAA,EAAK,OAAO,CAAC,CAAA;AACzE;AAGA,SAAS,cAAc,QAAA,EAAyC;AAC9D,EAAA,MAAM,OAAA,GAAU,eAAA,CAAgB,QAAA,EAAU,sBAAsB,CAAA;AAChE,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAqB;AAC1C,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,MAAM,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,QAAA,CAAS,OAAO,CAAA,GAAI,OAAA,GAAU,EAAE,CAAA,EAAG;AAC7E,IAAA,IAAI,CAAC,QAAA,CAAS,MAAM,CAAA,EAAG;AACrB,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAA,GAAQ,EAAE,GAAA,EAAK,CAAA,EAAG,iBAAiB,GAAG,oBAAA,CAAqB,IAAI,CAAC,CAAA,CAAA,EAAI,MAAA,EAAO;AACjF,IAAA,KAAA,MAAW,UAAU,IAAI,GAAA,CAAI,OAAO,MAAA,CAAO,KAAK,CAAC,CAAA,EAAG;AAClD,MAAA,MAAM,QAAA,GAAW,QAAA,CAAS,GAAA,CAAI,MAAM,KAAK,EAAC;AAC1C,MAAA,QAAA,CAAS,KAAK,KAAK,CAAA;AACnB,MAAA,QAAA,CAAS,GAAA,CAAI,QAAQ,QAAQ,CAAA;AAAA,IAC/B;AAAA,EACF;AACA,EAAA,OAAO,QAAA;AACT;AAGA,SAAS,YAAA,CAAa,QAAoB,YAAA,EAA+B;AACvE,EAAA,MAAM,gBAAgB,MAAA,CAAO,aAAA;AAC7B,EAAA,OAAO,QAAA,CAAS,aAAa,CAAA,IAAK,aAAA,CAAc,YAAA,KAAiB,YAAA;AACnE;AAQA,SAAS,iBAAA,CAAkB,OAAc,MAAA,EAAkC;AACzE,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,MAAM,0BAAU,IAAI,GAAA,CAAI,CAAC,KAAA,CAAM,OAAO,CAAC,CAAA;AACvC,EAAA,MAAM,OAAA,GAAoB,CAAC,EAAE,GAAA,EAAK,MAAM,OAAA,EAAS,OAAA,kBAAS,IAAI,GAAA,CAAI,CAAC,KAAA,CAAM,OAAO,CAAC,GAAG,CAAA;AACpF,EAAA,KAAA,IAAS,MAAA,GAAS,QAAQ,KAAA,EAAM,EAAG,WAAW,MAAA,EAAW,MAAA,GAAS,OAAA,CAAQ,KAAA,EAAM,EAAG;AACjF,IAAA,MAAM,QAAA,GACJ,MAAA,CAAO,GAAA,KAAQ,KAAA,CAAM,UACjB,kBAAA,CAAmB,KAAA,EAAO,MAAM,CAAA,GAC/B,OAAO,QAAA,CAAS,GAAA,CAAI,MAAA,CAAO,GAAG,KAAK,EAAC;AAC3C,IAAA,KAAA,MAAW,SAAS,QAAA,EAAU;AAC5B,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,KAAA,CAAM,GAAG,CAAA,EAAG;AAC1B,QAAA;AAAA,MACF;AACA,MAAA,OAAA,CAAQ,GAAA,CAAI,MAAM,GAAG,CAAA;AACrB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,GAAA,EAAK,KAAA,CAAM,KAAK,OAAA,EAAS,MAAA,CAAO,SAAS,CAAA;AACtD,MAAA,IAAI,CAAC,YAAA,CAAa,KAAA,CAAM,MAAA,EAAQ,KAAA,CAAM,YAAY,CAAA,EAAG;AACnD,QAAA,OAAA,CAAQ,KAAK,EAAE,GAAA,EAAK,KAAA,CAAM,GAAA,EAAK,yBAAS,IAAI,GAAA,CAAI,CAAC,GAAG,OAAO,OAAA,EAAS,KAAA,CAAM,GAAG,CAAC,GAAG,CAAA;AAAA,MACnF;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,SAAA,CAAU,OAAc,MAAA,EAAkC;AACjE,EAAA,MAAM,SAAS,KAAA,CAAM,UAAA,CAAW,GAAA,CAAI,CAAC,SAAS,EAAE,GAAA,EAAK,OAAA,kBAAS,IAAI,IAAI,CAAC,KAAA,CAAM,OAAO,CAAC,GAAE,CAAE,CAAA;AACzF,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAoB;AACxC,EAAA,KAAA,MAAW,MAAA,IAAU,CAAC,GAAG,MAAA,EAAQ,GAAG,iBAAA,CAAkB,KAAA,EAAO,MAAM,CAAC,CAAA,EAAG;AACrE,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,GAAG,CAAA,EAAG;AAC5B,MAAA,OAAA,CAAQ,GAAA,CAAI,MAAA,CAAO,GAAA,EAAK,MAAM,CAAA;AAAA,IAChC;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,OAAA,CAAQ,MAAA,EAAQ,CAAA;AAC7B;AAEA,SAAS,YAAA,CAAa,OAAc,MAAA,EAA2D;AAC7F,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,OAAA,CAAQ,KAAA,CAAM,OAAO,EACxC,MAAA,CAAO,CAAC,GAAG,MAAM,CAAA,KAAM,OAAO,MAAA,KAAW,QAAA,IAAY,aAAA,CAAc,MAAM,CAAA,KAAM,MAAM,CAAA,CACrF,GAAA,CAAI,CAAC,CAAC,GAAG,CAAA,KAAM,GAAG,CAAA;AACrB,EAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,MAAM,CAAA,CAAE,KAAI,IAAK,EAAA;AAC9C,EAAA,OAAO,MAAA,CAAO,MAAA,GAAS,CAAA,GAAI,EAAE,QAAQ,UAAA,EAAY,KAAA,EAAM,GAAI,EAAE,MAAA,EAAQ,CAAC,IAAI,CAAA,EAAG,YAAY,IAAA,EAAK;AAChG;AAEA,SAAS,WAAW,KAAA,EAAc,EAAE,KAAK,MAAA,EAAQ,OAAA,IAAmB,QAAA,EAAmB;AAErF,EAAA,MAAM,OAAA,GAAU,sBAAA;AAAA,IACd,eAAA,CAAgB,UAAU,MAAM,CAAA;AAAA,IAChC,KAAA,CAAM,YAAA;AAAA,IACN,QAAA;AAAA,IACA;AAAA,GACF;AACA,EAAA,MAAM,EAAE,MAAA,EAAQ,UAAA,EAAW,GAAI,YAAA,CAAa,OAAO,MAAM,CAAA;AACzD,EAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,MAAA,CAAO,IAAA,CAAK,CAAC,UAAU,OAAA,CAAQ,GAAA,CAAI,KAAK,CAAC,CAAA,EAAG;AAClE,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,EAAE,OAAA,EAAS,YAAA,EAAa,GAAI,KAAA;AAClC,EAAA,OAAO,EAAE,MAAA,EAAQ,KAAA,EAAO,OAAA,EAAS,YAAA,EAAc,MAAA,EAAQ,OAAA,EAAS,CAAC,GAAG,OAAO,CAAA,EAAG,UAAA,EAAW;AAC3F;AAGO,SAAS,gCACd,QAAA,EACA,OAAA,GAA2B,EAAE,aAAA,EAAe,OAAM,EACX;AACvC,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAwC;AAC9D,EAAA,MAAM,MAAA,GAAS,EAAE,GAAG,OAAA,EAAS,UAAU,QAAA,EAAU,aAAA,CAAc,QAAQ,CAAA,EAAE;AACzE,EAAA,KAAA,MAAW,KAAA,IAAS,QAAA,CAAS,QAAQ,CAAA,EAAG;AACtC,IAAA,KAAA,MAAW,MAAA,IAAU,SAAA,CAAU,KAAA,EAAO,MAAM,CAAA,EAAG;AAC7C,MAAA,MAAM,QAAA,GAAW,UAAA,CAAW,KAAA,EAAO,MAAA,EAAQ,QAAQ,CAAA;AACnD,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,SAAA,CAAU,CAAC,MAAA,CAAO,KAAK,QAAA,EAAU,YAAA,EAAc,QAAA,EAAU,MAAM,CAAC,CAAA;AACjF,MAAA,IAAI,aAAa,IAAA,IAAQ,CAAC,SAAA,CAAU,GAAA,CAAI,GAAG,CAAA,EAAG;AAC5C,QAAA,SAAA,CAAU,GAAA,CAAI,KAAK,QAAQ,CAAA;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,SAAA,CAAU,MAAA,EAAQ,CAAA;AAC/B;;"}

package/dist/domain/openapi/json-pointer.cjs

@@ -0,0 +1,31 @@
+'use strict';
+
+function parseRefPointer(ref) {
+  const [, pointer = ""] = ref.split("#/");
+  return pointer.split("/").map(unescapePointerSegment).filter((segment) => segment.length > 0);
+}
+function unescapePointerSegment(segment) {
+  return decodeURIComponent(segment.replaceAll("~1", "/").replaceAll("~0", "~"));
+}
+function escapePointerSegment(segment) {
+  return segment.replaceAll("~", "~0").replaceAll("/", "~1").replaceAll("%", "%25");
+}
+function createRef(parts) {
+  let ref = "#";
+  for (const part of parts) {
+    if (part === void 0 || part === null || part === "") {
+      continue;
+    }
+    const text = String(part);
+    const segments = parseRefPointer(text);
+    for (const segment of segments.length > 0 ? segments : [text]) {
+      ref += `/${escapePointerSegment(segment)}`;
+    }
+  }
+  return ref;
+}
+
+exports.createRef = createRef;
+exports.escapePointerSegment = escapePointerSegment;
+exports.parseRefPointer = parseRefPointer;
+//# sourceMappingURL=json-pointer.cjs.map

package/dist/domain/openapi/json-pointer.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"json-pointer.cjs","sources":["../../../src/domain/openapi/json-pointer.ts"],"sourcesContent":["/**\n * The JSON Pointer of a `$ref` as path segments, with the semantics of Redocly's `parseRef`, which\n * the original generator used: the part after the first `#/`, split at `/`, each segment unescaped\n * (`~1` → `/`, `~0` → `~`, then percent-decoding), and empty segments dropped.\n *\n * Throws URIError for a malformed percent escape, as the original does.\n */\nexport function parseRefPointer(ref: string): string[] {\n  const [, pointer = \"\"] = ref.split(\"#/\");\n  return pointer\n    .split(\"/\")\n    .map(unescapePointerSegment)\n    .filter((segment) => segment.length > 0);\n}\n\nfunction unescapePointerSegment(segment: string): string {\n  return decodeURIComponent(segment.replaceAll(\"~1\", \"/\").replaceAll(\"~0\", \"~\"));\n}\n\n/**\n * Escape one segment for a JSON Pointer in a `$ref` fragment: `~` → `~0`, `/` → `~1`, and `%` →\n * `%25`, because reading a pointer back percent-decodes it. The original did not escape `%`, so a\n * name like `50%` threw URIError and `a%2Fb` read back as `a/b` (upstream #2251, #2828).\n */\nexport function escapePointerSegment(segment: string): string {\n  return segment.replaceAll(\"~\", \"~0\").replaceAll(\"/\", \"~1\").replaceAll(\"%\", \"%25\");\n}\n\n/**\n * Join parts into a local `$ref` (the original `createRef`). Empty parts are skipped. A part that\n * is itself a `$ref` contributes its segments; any other part is one segment.\n */\nexport function createRef(parts: readonly (string | number | null | undefined)[]): string {\n  let ref = \"#\";\n  for (const part of parts) {\n    if (part === undefined || part === null || part === \"\") {\n      continue;\n    }\n    const text = String(part);\n    const segments = parseRefPointer(text);\n    for (const segment of segments.length > 0 ? segments : [text]) {\n      ref += `/${escapePointerSegment(segment)}`;\n    }\n  }\n  return ref;\n}\n"],"names":[],"mappings":";;AAOO,SAAS,gBAAgB,GAAA,EAAuB;AACrD,EAAA,MAAM,GAAG,OAAA,GAAU,EAAE,CAAA,GAAI,GAAA,CAAI,MAAM,IAAI,CAAA;AACvC,EAAA,OAAO,OAAA,CACJ,KAAA,CAAM,GAAG,CAAA,CACT,GAAA,CAAI,sBAAsB,CAAA,CAC1B,MAAA,CAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,MAAA,GAAS,CAAC,CAAA;AAC3C;AAEA,SAAS,uBAAuB,OAAA,EAAyB;AACvD,EAAA,OAAO,kBAAA,CAAmB,QAAQ,UAAA,CAAW,IAAA,EAAM,GAAG,CAAA,CAAE,UAAA,CAAW,IAAA,EAAM,GAAG,CAAC,CAAA;AAC/E;AAOO,SAAS,qBAAqB,OAAA,EAAyB;AAC5D,EAAA,OAAO,OAAA,CAAQ,UAAA,CAAW,GAAA,EAAK,IAAI,CAAA,CAAE,UAAA,CAAW,GAAA,EAAK,IAAI,CAAA,CAAE,UAAA,CAAW,GAAA,EAAK,KAAK,CAAA;AAClF;AAMO,SAAS,UAAU,KAAA,EAAgE;AACxF,EAAA,IAAI,GAAA,GAAM,GAAA;AACV,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,KAAS,IAAA,IAAQ,SAAS,EAAA,EAAI;AACtD,MAAA;AAAA,IACF;AACA,IAAA,MAAM,IAAA,GAAO,OAAO,IAAI,CAAA;AACxB,IAAA,MAAM,QAAA,GAAW,gBAAgB,IAAI,CAAA;AACrC,IAAA,KAAA,MAAW,WAAW,QAAA,CAAS,MAAA,GAAS,IAAI,QAAA,GAAW,CAAC,IAAI,CAAA,EAAG;AAC7D,MAAA,GAAA,IAAO,CAAA,CAAA,EAAI,oBAAA,CAAqB,OAAO,CAAC,CAAA,CAAA;AAAA,IAC1C;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;;;;"}

package/dist/domain/openapi/json-pointer.mjs

@@ -0,0 +1,27 @@
+function parseRefPointer(ref) {
+  const [, pointer = ""] = ref.split("#/");
+  return pointer.split("/").map(unescapePointerSegment).filter((segment) => segment.length > 0);
+}
+function unescapePointerSegment(segment) {
+  return decodeURIComponent(segment.replaceAll("~1", "/").replaceAll("~0", "~"));
+}
+function escapePointerSegment(segment) {
+  return segment.replaceAll("~", "~0").replaceAll("/", "~1").replaceAll("%", "%25");
+}
+function createRef(parts) {
+  let ref = "#";
+  for (const part of parts) {
+    if (part === void 0 || part === null || part === "") {
+      continue;
+    }
+    const text = String(part);
+    const segments = parseRefPointer(text);
+    for (const segment of segments.length > 0 ? segments : [text]) {
+      ref += `/${escapePointerSegment(segment)}`;
+    }
+  }
+  return ref;
+}
+
+export { createRef, escapePointerSegment, parseRefPointer };
+//# sourceMappingURL=json-pointer.mjs.map

package/dist/domain/openapi/json-pointer.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"json-pointer.mjs","sources":["../../../src/domain/openapi/json-pointer.ts"],"sourcesContent":["/**\n * The JSON Pointer of a `$ref` as path segments, with the semantics of Redocly's `parseRef`, which\n * the original generator used: the part after the first `#/`, split at `/`, each segment unescaped\n * (`~1` → `/`, `~0` → `~`, then percent-decoding), and empty segments dropped.\n *\n * Throws URIError for a malformed percent escape, as the original does.\n */\nexport function parseRefPointer(ref: string): string[] {\n  const [, pointer = \"\"] = ref.split(\"#/\");\n  return pointer\n    .split(\"/\")\n    .map(unescapePointerSegment)\n    .filter((segment) => segment.length > 0);\n}\n\nfunction unescapePointerSegment(segment: string): string {\n  return decodeURIComponent(segment.replaceAll(\"~1\", \"/\").replaceAll(\"~0\", \"~\"));\n}\n\n/**\n * Escape one segment for a JSON Pointer in a `$ref` fragment: `~` → `~0`, `/` → `~1`, and `%` →\n * `%25`, because reading a pointer back percent-decodes it. The original did not escape `%`, so a\n * name like `50%` threw URIError and `a%2Fb` read back as `a/b` (upstream #2251, #2828).\n */\nexport function escapePointerSegment(segment: string): string {\n  return segment.replaceAll(\"~\", \"~0\").replaceAll(\"/\", \"~1\").replaceAll(\"%\", \"%25\");\n}\n\n/**\n * Join parts into a local `$ref` (the original `createRef`). Empty parts are skipped. A part that\n * is itself a `$ref` contributes its segments; any other part is one segment.\n */\nexport function createRef(parts: readonly (string | number | null | undefined)[]): string {\n  let ref = \"#\";\n  for (const part of parts) {\n    if (part === undefined || part === null || part === \"\") {\n      continue;\n    }\n    const text = String(part);\n    const segments = parseRefPointer(text);\n    for (const segment of segments.length > 0 ? segments : [text]) {\n      ref += `/${escapePointerSegment(segment)}`;\n    }\n  }\n  return ref;\n}\n"],"names":[],"mappings":"AAOO,SAAS,gBAAgB,GAAA,EAAuB;AACrD,EAAA,MAAM,GAAG,OAAA,GAAU,EAAE,CAAA,GAAI,GAAA,CAAI,MAAM,IAAI,CAAA;AACvC,EAAA,OAAO,OAAA,CACJ,KAAA,CAAM,GAAG,CAAA,CACT,GAAA,CAAI,sBAAsB,CAAA,CAC1B,MAAA,CAAO,CAAC,OAAA,KAAY,OAAA,CAAQ,MAAA,GAAS,CAAC,CAAA;AAC3C;AAEA,SAAS,uBAAuB,OAAA,EAAyB;AACvD,EAAA,OAAO,kBAAA,CAAmB,QAAQ,UAAA,CAAW,IAAA,EAAM,GAAG,CAAA,CAAE,UAAA,CAAW,IAAA,EAAM,GAAG,CAAC,CAAA;AAC/E;AAOO,SAAS,qBAAqB,OAAA,EAAyB;AAC5D,EAAA,OAAO,OAAA,CAAQ,UAAA,CAAW,GAAA,EAAK,IAAI,CAAA,CAAE,UAAA,CAAW,GAAA,EAAK,IAAI,CAAA,CAAE,UAAA,CAAW,GAAA,EAAK,KAAK,CAAA;AAClF;AAMO,SAAS,UAAU,KAAA,EAAgE;AACxF,EAAA,IAAI,GAAA,GAAM,GAAA;AACV,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,KAAS,IAAA,IAAQ,SAAS,EAAA,EAAI;AACtD,MAAA;AAAA,IACF;AACA,IAAA,MAAM,IAAA,GAAO,OAAO,IAAI,CAAA;AACxB,IAAA,MAAM,QAAA,GAAW,gBAAgB,IAAI,CAAA;AACrC,IAAA,KAAA,MAAW,WAAW,QAAA,CAAS,MAAA,GAAS,IAAI,QAAA,GAAW,CAAC,IAAI,CAAA,EAAG;AAC7D,MAAA,GAAA,IAAO,CAAA,CAAA,EAAI,oBAAA,CAAqB,OAAO,CAAC,CAAA,CAAA;AAAA,IAC1C;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;;"}

package/dist/domain/openapi/media-type-object.cjs

@@ -0,0 +1,14 @@
+'use strict';
+
+const jsonPointer = require('./json-pointer.cjs');
+
+const COMPONENTS_SEGMENT = "components";
+const MEDIA_TYPES_COMPONENT_KIND = "mediaTypes";
+function isMediaTypeComponentRef(ref) {
+  const [root, kind] = jsonPointer.parseRefPointer(ref);
+  return ref.startsWith("#/") && root === COMPONENTS_SEGMENT && kind === MEDIA_TYPES_COMPONENT_KIND;
+}
+
+exports.MEDIA_TYPES_COMPONENT_KIND = MEDIA_TYPES_COMPONENT_KIND;
+exports.isMediaTypeComponentRef = isMediaTypeComponentRef;
+//# sourceMappingURL=media-type-object.cjs.map

package/dist/domain/openapi/media-type-object.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"media-type-object.cjs","sources":["../../../src/domain/openapi/media-type-object.ts"],"sourcesContent":["import { parseRefPointer } from \"./json-pointer.js\";\nimport type { ReferenceSchema, Schema } from \"./schema-object.js\";\n\n/** The parts of a Media Type Object the generator reads (OpenAPI 3.2 §4.8.14). */\nexport interface MediaTypeObject {\n  /** The complete content. */\n  readonly schema?: Schema;\n  /** Each item of a sequential media type such as `application/jsonl` (OpenAPI 3.2). */\n  readonly itemSchema?: Schema;\n}\n\n/** A `content` map: media type name to a Media Type Object or a `$ref` to one. */\nexport type ContentMap = Readonly<Record<string, MediaTypeObject | ReferenceSchema>>;\n\nconst COMPONENTS_SEGMENT = \"components\";\n/** The OpenAPI 3.2 component map of reusable Media Type Objects. */\nexport const MEDIA_TYPES_COMPONENT_KIND = \"mediaTypes\";\n\n/**\n * Whether a `content` entry's `$ref` points into `components.mediaTypes` (OpenAPI 3.2). Other\n * `$ref`s in `content` keep the output they had before 3.2 (ADR-020).\n */\nexport function isMediaTypeComponentRef(ref: string): boolean {\n  const [root, kind] = parseRefPointer(ref);\n  return ref.startsWith(\"#/\") && root === COMPONENTS_SEGMENT && kind === MEDIA_TYPES_COMPONENT_KIND;\n}\n"],"names":["parseRefPointer"],"mappings":";;;;AAcA,MAAM,kBAAA,GAAqB,YAAA;AAEpB,MAAM,0BAAA,GAA6B;AAMnC,SAAS,wBAAwB,GAAA,EAAsB;AAC5D,EAAA,MAAM,CAAC,IAAA,EAAM,IAAI,CAAA,GAAIA,4BAAgB,GAAG,CAAA;AACxC,EAAA,OAAO,IAAI,UAAA,CAAW,IAAI,CAAA,IAAK,IAAA,KAAS,sBAAsB,IAAA,KAAS,0BAAA;AACzE;;;"}

package/dist/domain/openapi/media-type-object.mjs

@@ -0,0 +1,11 @@
+import { parseRefPointer } from './json-pointer.mjs';
+
+const COMPONENTS_SEGMENT = "components";
+const MEDIA_TYPES_COMPONENT_KIND = "mediaTypes";
+function isMediaTypeComponentRef(ref) {
+  const [root, kind] = parseRefPointer(ref);
+  return ref.startsWith("#/") && root === COMPONENTS_SEGMENT && kind === MEDIA_TYPES_COMPONENT_KIND;
+}
+
+export { MEDIA_TYPES_COMPONENT_KIND, isMediaTypeComponentRef };
+//# sourceMappingURL=media-type-object.mjs.map