openapi-typesafe 1.0.0-rc.3 → 1.0.0-rc.4

package/dist/domain/ir/newer-identifier-ranges.mjs

@@ -1,18 +1,48 @@
 const NEWER_IDENTIFIER_START = [
-  "\\u{88F}",
-  "\\u{C5C}",
-  "\\u{CDC}",
+  "\\u{870}-\\u{887}",
+  "\\u{889}-\\u{88F}",
+  "\\u{8B5}",
+  "\\u{8BE}-\\u{8C9}",
+  "\\u{C5C}-\\u{C5D}",
+  "\\u{CDC}-\\u{CDD}",
+  "\\u{D04}",
+  "\\u{170D}",
+  "\\u{171F}",
+  "\\u{1B4C}",
   "\\u{1C89}-\\u{1C8A}",
-  "\\u{A7CB}-\\u{A7CF}",
-  "\\u{A7D2}",
-  "\\u{A7D4}",
-  "\\u{A7DA}-\\u{A7DC}",
-  "\\u{A7F1}",
+  "\\u{2C2F}",
+  "\\u{2C5F}",
+  "\\u{31BB}-\\u{31BF}",
+  "\\u{4DB6}-\\u{4DBF}",
+  "\\u{9FF0}-\\u{9FFF}",
+  "\\u{A7C0}-\\u{A7C1}",
+  "\\u{A7C7}-\\u{A7DC}",
+  "\\u{A7F1}-\\u{A7F6}",
+  "\\u{AB68}-\\u{AB69}",
+  "\\u{10570}-\\u{1057A}",
+  "\\u{1057C}-\\u{1058A}",
+  "\\u{1058C}-\\u{10592}",
+  "\\u{10594}-\\u{10595}",
+  "\\u{10597}-\\u{105A1}",
+  "\\u{105A3}-\\u{105B1}",
+  "\\u{105B3}-\\u{105B9}",
+  "\\u{105BB}-\\u{105BC}",
   "\\u{105C0}-\\u{105F3}",
+  "\\u{10780}-\\u{10785}",
+  "\\u{10787}-\\u{107B0}",
+  "\\u{107B2}-\\u{107BA}",
   "\\u{10940}-\\u{10959}",
   "\\u{10D4A}-\\u{10D65}",
   "\\u{10D6F}-\\u{10D85}",
+  "\\u{10E80}-\\u{10EA9}",
+  "\\u{10EB0}-\\u{10EB1}",
   "\\u{10EC2}-\\u{10EC7}",
+  "\\u{10F70}-\\u{10F81}",
+  "\\u{10FB0}-\\u{10FC4}",
+  "\\u{11071}-\\u{11072}",
+  "\\u{11075}",
+  "\\u{11147}",
+  "\\u{1123F}-\\u{11240}",
   "\\u{11380}-\\u{11389}",
   "\\u{1138B}",
   "\\u{1138E}",
@@ -20,18 +50,47 @@ const NEWER_IDENTIFIER_START = [
   "\\u{113B7}",
   "\\u{113D1}",
   "\\u{113D3}",
+  "\\u{11460}-\\u{11461}",
+  "\\u{11740}-\\u{11746}",
+  "\\u{11900}-\\u{11906}",
+  "\\u{11909}",
+  "\\u{1190C}-\\u{11913}",
+  "\\u{11915}-\\u{11916}",
+  "\\u{11918}-\\u{1192F}",
+  "\\u{1193F}",
+  "\\u{11941}",
+  "\\u{11AB0}-\\u{11ABF}",
   "\\u{11BC0}-\\u{11BE0}",
   "\\u{11DB0}-\\u{11DDB}",
+  "\\u{11F02}",
+  "\\u{11F04}-\\u{11F10}",
+  "\\u{11F12}-\\u{11F33}",
+  "\\u{11FB0}",
+  "\\u{12F90}-\\u{12FF0}",
+  "\\u{1342F}",
+  "\\u{13441}-\\u{13446}",
   "\\u{13460}-\\u{143FA}",
   "\\u{16100}-\\u{1611D}",
+  "\\u{16A70}-\\u{16ABE}",
   "\\u{16D40}-\\u{16D6C}",
   "\\u{16EA0}-\\u{16EB8}",
   "\\u{16EBB}-\\u{16ED3}",
   "\\u{16FF2}-\\u{16FF6}",
   "\\u{187F8}-\\u{187FF}",
-  "\\u{18CFF}",
-  "\\u{18D09}-\\u{18D1E}",
+  "\\u{18AF3}-\\u{18CD5}",
+  "\\u{18CFF}-\\u{18D1E}",
   "\\u{18D80}-\\u{18DF2}",
+  "\\u{1AFF0}-\\u{1AFF3}",
+  "\\u{1AFF5}-\\u{1AFFB}",
+  "\\u{1AFFD}-\\u{1AFFE}",
+  "\\u{1B11F}-\\u{1B122}",
+  "\\u{1B132}",
+  "\\u{1B155}",
+  "\\u{1DF00}-\\u{1DF1E}",
+  "\\u{1DF25}-\\u{1DF2A}",
+  "\\u{1E030}-\\u{1E06D}",
+  "\\u{1E290}-\\u{1E2AD}",
+  "\\u{1E4D0}-\\u{1E4EB}",
   "\\u{1E5D0}-\\u{1E5ED}",
   "\\u{1E5F0}",
   "\\u{1E6C0}-\\u{1E6DE}",
@@ -40,30 +99,81 @@ const NEWER_IDENTIFIER_START = [
   "\\u{1E6E7}-\\u{1E6ED}",
   "\\u{1E6F0}-\\u{1E6F4}",
   "\\u{1E6FE}-\\u{1E6FF}",
-  "\\u{2B73A}-\\u{2B73F}",
+  "\\u{1E7E0}-\\u{1E7E6}",
+  "\\u{1E7E8}-\\u{1E7EB}",
+  "\\u{1E7ED}-\\u{1E7EE}",
+  "\\u{1E7F0}-\\u{1E7FE}",
+  "\\u{2A6D7}-\\u{2A6DF}",
+  "\\u{2B735}-\\u{2B73F}",
   "\\u{2CEA2}-\\u{2CEAD}",
-  "\\u{323B0}-\\u{33479}"
+  "\\u{2EBF0}-\\u{2EE5D}",
+  "\\u{30000}-\\u{3134A}",
+  "\\u{31350}-\\u{33479}"
 ];
 const NEWER_IDENTIFIER_PART = [
-  "\\u{88F}",
-  "\\u{897}",
-  "\\u{C5C}",
-  "\\u{CDC}",
-  "\\u{1ACF}-\\u{1ADD}",
+  "\\u{870}-\\u{887}",
+  "\\u{889}-\\u{88F}",
+  "\\u{897}-\\u{89F}",
+  "\\u{8B5}",
+  "\\u{8BE}-\\u{8D2}",
+  "\\u{B55}",
+  "\\u{C3C}",
+  "\\u{C5C}-\\u{C5D}",
+  "\\u{CDC}-\\u{CDD}",
+  "\\u{CF3}",
+  "\\u{D04}",
+  "\\u{D81}",
+  "\\u{ECE}",
+  "\\u{170D}",
+  "\\u{1715}",
+  "\\u{171F}",
+  "\\u{180F}",
+  "\\u{1ABF}-\\u{1ADD}",
   "\\u{1AE0}-\\u{1AEB}",
+  "\\u{1B4C}",
   "\\u{1C89}-\\u{1C8A}",
-  "\\u{A7CB}-\\u{A7CF}",
-  "\\u{A7D2}",
-  "\\u{A7D4}",
-  "\\u{A7DA}-\\u{A7DC}",
-  "\\u{A7F1}",
+  "\\u{1DFA}",
+  "\\u{200C}-\\u{200D}",
+  "\\u{2C2F}",
+  "\\u{2C5F}",
+  "\\u{30FB}",
+  "\\u{31BB}-\\u{31BF}",
+  "\\u{4DB6}-\\u{4DBF}",
+  "\\u{9FF0}-\\u{9FFF}",
+  "\\u{A7C0}-\\u{A7C1}",
+  "\\u{A7C7}-\\u{A7DC}",
+  "\\u{A7F1}-\\u{A7F6}",
+  "\\u{A82C}",
+  "\\u{AB68}-\\u{AB69}",
+  "\\u{FF65}",
+  "\\u{10570}-\\u{1057A}",
+  "\\u{1057C}-\\u{1058A}",
+  "\\u{1058C}-\\u{10592}",
+  "\\u{10594}-\\u{10595}",
+  "\\u{10597}-\\u{105A1}",
+  "\\u{105A3}-\\u{105B1}",
+  "\\u{105B3}-\\u{105B9}",
+  "\\u{105BB}-\\u{105BC}",
   "\\u{105C0}-\\u{105F3}",
+  "\\u{10780}-\\u{10785}",
+  "\\u{10787}-\\u{107B0}",
+  "\\u{107B2}-\\u{107BA}",
   "\\u{10940}-\\u{10959}",
   "\\u{10D40}-\\u{10D65}",
   "\\u{10D69}-\\u{10D6D}",
   "\\u{10D6F}-\\u{10D85}",
+  "\\u{10E80}-\\u{10EA9}",
+  "\\u{10EAB}-\\u{10EAC}",
+  "\\u{10EB0}-\\u{10EB1}",
   "\\u{10EC2}-\\u{10EC7}",
-  "\\u{10EFA}-\\u{10EFC}",
+  "\\u{10EFA}-\\u{10EFF}",
+  "\\u{10F70}-\\u{10F85}",
+  "\\u{10FB0}-\\u{10FC4}",
+  "\\u{11070}-\\u{11075}",
+  "\\u{110C2}",
+  "\\u{11147}",
+  "\\u{111CE}-\\u{111CF}",
+  "\\u{1123F}-\\u{11241}",
   "\\u{11380}-\\u{11389}",
   "\\u{1138B}",
   "\\u{1138E}",
@@ -74,32 +184,75 @@ const NEWER_IDENTIFIER_PART = [
   "\\u{113C7}-\\u{113CA}",
   "\\u{113CC}-\\u{113D3}",
   "\\u{113E1}-\\u{113E2}",
+  "\\u{11460}-\\u{11461}",
   "\\u{116D0}-\\u{116E3}",
+  "\\u{11740}-\\u{11746}",
+  "\\u{11900}-\\u{11906}",
+  "\\u{11909}",
+  "\\u{1190C}-\\u{11913}",
+  "\\u{11915}-\\u{11916}",
+  "\\u{11918}-\\u{11935}",
+  "\\u{11937}-\\u{11938}",
+  "\\u{1193B}-\\u{11943}",
+  "\\u{11950}-\\u{11959}",
+  "\\u{11AB0}-\\u{11ABF}",
   "\\u{11B60}-\\u{11B67}",
   "\\u{11BC0}-\\u{11BE0}",
   "\\u{11BF0}-\\u{11BF9}",
   "\\u{11DB0}-\\u{11DDB}",
   "\\u{11DE0}-\\u{11DE9}",
-  "\\u{11F5A}",
+  "\\u{11F00}-\\u{11F10}",
+  "\\u{11F12}-\\u{11F3A}",
+  "\\u{11F3E}-\\u{11F42}",
+  "\\u{11F50}-\\u{11F5A}",
+  "\\u{11FB0}",
+  "\\u{12F90}-\\u{12FF0}",
+  "\\u{1342F}",
+  "\\u{13440}-\\u{13455}",
   "\\u{13460}-\\u{143FA}",
   "\\u{16100}-\\u{16139}",
+  "\\u{16A70}-\\u{16ABE}",
+  "\\u{16AC0}-\\u{16AC9}",
   "\\u{16D40}-\\u{16D6C}",
   "\\u{16D70}-\\u{16D79}",
   "\\u{16EA0}-\\u{16EB8}",
   "\\u{16EBB}-\\u{16ED3}",
-  "\\u{16FF2}-\\u{16FF6}",
+  "\\u{16FE4}",
+  "\\u{16FF0}-\\u{16FF6}",
   "\\u{187F8}-\\u{187FF}",
-  "\\u{18CFF}",
-  "\\u{18D09}-\\u{18D1E}",
+  "\\u{18AF3}-\\u{18CD5}",
+  "\\u{18CFF}-\\u{18D1E}",
   "\\u{18D80}-\\u{18DF2}",
+  "\\u{1AFF0}-\\u{1AFF3}",
+  "\\u{1AFF5}-\\u{1AFFB}",
+  "\\u{1AFFD}-\\u{1AFFE}",
+  "\\u{1B11F}-\\u{1B122}",
+  "\\u{1B132}",
+  "\\u{1B155}",
   "\\u{1CCF0}-\\u{1CCF9}",
+  "\\u{1CF00}-\\u{1CF2D}",
+  "\\u{1CF30}-\\u{1CF46}",
+  "\\u{1DF00}-\\u{1DF1E}",
+  "\\u{1DF25}-\\u{1DF2A}",
+  "\\u{1E030}-\\u{1E06D}",
+  "\\u{1E08F}",
+  "\\u{1E290}-\\u{1E2AE}",
+  "\\u{1E4D0}-\\u{1E4F9}",
   "\\u{1E5D0}-\\u{1E5FA}",
   "\\u{1E6C0}-\\u{1E6DE}",
   "\\u{1E6E0}-\\u{1E6F5}",
   "\\u{1E6FE}-\\u{1E6FF}",
-  "\\u{2B73A}-\\u{2B73F}",
+  "\\u{1E7E0}-\\u{1E7E6}",
+  "\\u{1E7E8}-\\u{1E7EB}",
+  "\\u{1E7ED}-\\u{1E7EE}",
+  "\\u{1E7F0}-\\u{1E7FE}",
+  "\\u{1FBF0}-\\u{1FBF9}",
+  "\\u{2A6D7}-\\u{2A6DF}",
+  "\\u{2B735}-\\u{2B73F}",
   "\\u{2CEA2}-\\u{2CEAD}",
-  "\\u{323B0}-\\u{33479}"
+  "\\u{2EBF0}-\\u{2EE5D}",
+  "\\u{30000}-\\u{3134A}",
+  "\\u{31350}-\\u{33479}"
 ];
 
 export { NEWER_IDENTIFIER_PART, NEWER_IDENTIFIER_START };

package/dist/domain/ir/newer-identifier-ranges.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"newer-identifier-ranges.mjs","sources":["../../../src/domain/ir/newer-identifier-ranges.ts"],"sourcesContent":["// Generated by scripts/identifier-ranges.ts (Node.js 26.0.0, Unicode\n// 17.0, TypeScript 5.9.3). Do not edit.\n\n/** `ID_Start` code points that TypeScript's scanner does not accept, as regex class items. */\nexport const NEWER_IDENTIFIER_START: readonly string[] = [\n  \"\\\\u{88F}\",\n  \"\\\\u{C5C}\",\n  \"\\\\u{CDC}\",\n  \"\\\\u{1C89}-\\\\u{1C8A}\",\n  \"\\\\u{A7CB}-\\\\u{A7CF}\",\n  \"\\\\u{A7D2}\",\n  \"\\\\u{A7D4}\",\n  \"\\\\u{A7DA}-\\\\u{A7DC}\",\n  \"\\\\u{A7F1}\",\n  \"\\\\u{105C0}-\\\\u{105F3}\",\n  \"\\\\u{10940}-\\\\u{10959}\",\n  \"\\\\u{10D4A}-\\\\u{10D65}\",\n  \"\\\\u{10D6F}-\\\\u{10D85}\",\n  \"\\\\u{10EC2}-\\\\u{10EC7}\",\n  \"\\\\u{11380}-\\\\u{11389}\",\n  \"\\\\u{1138B}\",\n  \"\\\\u{1138E}\",\n  \"\\\\u{11390}-\\\\u{113B5}\",\n  \"\\\\u{113B7}\",\n  \"\\\\u{113D1}\",\n  \"\\\\u{113D3}\",\n  \"\\\\u{11BC0}-\\\\u{11BE0}\",\n  \"\\\\u{11DB0}-\\\\u{11DDB}\",\n  \"\\\\u{13460}-\\\\u{143FA}\",\n  \"\\\\u{16100}-\\\\u{1611D}\",\n  \"\\\\u{16D40}-\\\\u{16D6C}\",\n  \"\\\\u{16EA0}-\\\\u{16EB8}\",\n  \"\\\\u{16EBB}-\\\\u{16ED3}\",\n  \"\\\\u{16FF2}-\\\\u{16FF6}\",\n  \"\\\\u{187F8}-\\\\u{187FF}\",\n  \"\\\\u{18CFF}\",\n  \"\\\\u{18D09}-\\\\u{18D1E}\",\n  \"\\\\u{18D80}-\\\\u{18DF2}\",\n  \"\\\\u{1E5D0}-\\\\u{1E5ED}\",\n  \"\\\\u{1E5F0}\",\n  \"\\\\u{1E6C0}-\\\\u{1E6DE}\",\n  \"\\\\u{1E6E0}-\\\\u{1E6E2}\",\n  \"\\\\u{1E6E4}-\\\\u{1E6E5}\",\n  \"\\\\u{1E6E7}-\\\\u{1E6ED}\",\n  \"\\\\u{1E6F0}-\\\\u{1E6F4}\",\n  \"\\\\u{1E6FE}-\\\\u{1E6FF}\",\n  \"\\\\u{2B73A}-\\\\u{2B73F}\",\n  \"\\\\u{2CEA2}-\\\\u{2CEAD}\",\n  \"\\\\u{323B0}-\\\\u{33479}\",\n];\n\n/** `ID_Continue` code points that TypeScript's scanner does not accept, as regex class items. */\nexport const NEWER_IDENTIFIER_PART: readonly string[] = [\n  \"\\\\u{88F}\",\n  \"\\\\u{897}\",\n  \"\\\\u{C5C}\",\n  \"\\\\u{CDC}\",\n  \"\\\\u{1ACF}-\\\\u{1ADD}\",\n  \"\\\\u{1AE0}-\\\\u{1AEB}\",\n  \"\\\\u{1C89}-\\\\u{1C8A}\",\n  \"\\\\u{A7CB}-\\\\u{A7CF}\",\n  \"\\\\u{A7D2}\",\n  \"\\\\u{A7D4}\",\n  \"\\\\u{A7DA}-\\\\u{A7DC}\",\n  \"\\\\u{A7F1}\",\n  \"\\\\u{105C0}-\\\\u{105F3}\",\n  \"\\\\u{10940}-\\\\u{10959}\",\n  \"\\\\u{10D40}-\\\\u{10D65}\",\n  \"\\\\u{10D69}-\\\\u{10D6D}\",\n  \"\\\\u{10D6F}-\\\\u{10D85}\",\n  \"\\\\u{10EC2}-\\\\u{10EC7}\",\n  \"\\\\u{10EFA}-\\\\u{10EFC}\",\n  \"\\\\u{11380}-\\\\u{11389}\",\n  \"\\\\u{1138B}\",\n  \"\\\\u{1138E}\",\n  \"\\\\u{11390}-\\\\u{113B5}\",\n  \"\\\\u{113B7}-\\\\u{113C0}\",\n  \"\\\\u{113C2}\",\n  \"\\\\u{113C5}\",\n  \"\\\\u{113C7}-\\\\u{113CA}\",\n  \"\\\\u{113CC}-\\\\u{113D3}\",\n  \"\\\\u{113E1}-\\\\u{113E2}\",\n  \"\\\\u{116D0}-\\\\u{116E3}\",\n  \"\\\\u{11B60}-\\\\u{11B67}\",\n  \"\\\\u{11BC0}-\\\\u{11BE0}\",\n  \"\\\\u{11BF0}-\\\\u{11BF9}\",\n  \"\\\\u{11DB0}-\\\\u{11DDB}\",\n  \"\\\\u{11DE0}-\\\\u{11DE9}\",\n  \"\\\\u{11F5A}\",\n  \"\\\\u{13460}-\\\\u{143FA}\",\n  \"\\\\u{16100}-\\\\u{16139}\",\n  \"\\\\u{16D40}-\\\\u{16D6C}\",\n  \"\\\\u{16D70}-\\\\u{16D79}\",\n  \"\\\\u{16EA0}-\\\\u{16EB8}\",\n  \"\\\\u{16EBB}-\\\\u{16ED3}\",\n  \"\\\\u{16FF2}-\\\\u{16FF6}\",\n  \"\\\\u{187F8}-\\\\u{187FF}\",\n  \"\\\\u{18CFF}\",\n  \"\\\\u{18D09}-\\\\u{18D1E}\",\n  \"\\\\u{18D80}-\\\\u{18DF2}\",\n  \"\\\\u{1CCF0}-\\\\u{1CCF9}\",\n  \"\\\\u{1E5D0}-\\\\u{1E5FA}\",\n  \"\\\\u{1E6C0}-\\\\u{1E6DE}\",\n  \"\\\\u{1E6E0}-\\\\u{1E6F5}\",\n  \"\\\\u{1E6FE}-\\\\u{1E6FF}\",\n  \"\\\\u{2B73A}-\\\\u{2B73F}\",\n  \"\\\\u{2CEA2}-\\\\u{2CEAD}\",\n  \"\\\\u{323B0}-\\\\u{33479}\",\n];\n"],"names":[],"mappings":"AAIO,MAAM,sBAAA,GAA4C;AAAA,EACvD,UAAA;AAAA,EACA,UAAA;AAAA,EACA,UAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,WAAA;AAAA,EACA,WAAA;AAAA,EACA,qBAAA;AAAA,EACA,WAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA;AACF;AAGO,MAAM,qBAAA,GAA2C;AAAA,EACtD,UAAA;AAAA,EACA,UAAA;AAAA,EACA,UAAA;AAAA,EACA,UAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,WAAA;AAAA,EACA,WAAA;AAAA,EACA,qBAAA;AAAA,EACA,WAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA;AACF;;"}
+{"version":3,"file":"newer-identifier-ranges.mjs","sources":["../../../src/domain/ir/newer-identifier-ranges.ts"],"sourcesContent":["// Generated by scripts/identifier-ranges.ts (Node.js 26.0.0, Unicode\n// 17.0, TypeScript 5.4.5). Do not edit.\n\n/** `ID_Start` code points that TypeScript's scanner does not accept, as regex class items. */\nexport const NEWER_IDENTIFIER_START: readonly string[] = [\n  \"\\\\u{870}-\\\\u{887}\",\n  \"\\\\u{889}-\\\\u{88F}\",\n  \"\\\\u{8B5}\",\n  \"\\\\u{8BE}-\\\\u{8C9}\",\n  \"\\\\u{C5C}-\\\\u{C5D}\",\n  \"\\\\u{CDC}-\\\\u{CDD}\",\n  \"\\\\u{D04}\",\n  \"\\\\u{170D}\",\n  \"\\\\u{171F}\",\n  \"\\\\u{1B4C}\",\n  \"\\\\u{1C89}-\\\\u{1C8A}\",\n  \"\\\\u{2C2F}\",\n  \"\\\\u{2C5F}\",\n  \"\\\\u{31BB}-\\\\u{31BF}\",\n  \"\\\\u{4DB6}-\\\\u{4DBF}\",\n  \"\\\\u{9FF0}-\\\\u{9FFF}\",\n  \"\\\\u{A7C0}-\\\\u{A7C1}\",\n  \"\\\\u{A7C7}-\\\\u{A7DC}\",\n  \"\\\\u{A7F1}-\\\\u{A7F6}\",\n  \"\\\\u{AB68}-\\\\u{AB69}\",\n  \"\\\\u{10570}-\\\\u{1057A}\",\n  \"\\\\u{1057C}-\\\\u{1058A}\",\n  \"\\\\u{1058C}-\\\\u{10592}\",\n  \"\\\\u{10594}-\\\\u{10595}\",\n  \"\\\\u{10597}-\\\\u{105A1}\",\n  \"\\\\u{105A3}-\\\\u{105B1}\",\n  \"\\\\u{105B3}-\\\\u{105B9}\",\n  \"\\\\u{105BB}-\\\\u{105BC}\",\n  \"\\\\u{105C0}-\\\\u{105F3}\",\n  \"\\\\u{10780}-\\\\u{10785}\",\n  \"\\\\u{10787}-\\\\u{107B0}\",\n  \"\\\\u{107B2}-\\\\u{107BA}\",\n  \"\\\\u{10940}-\\\\u{10959}\",\n  \"\\\\u{10D4A}-\\\\u{10D65}\",\n  \"\\\\u{10D6F}-\\\\u{10D85}\",\n  \"\\\\u{10E80}-\\\\u{10EA9}\",\n  \"\\\\u{10EB0}-\\\\u{10EB1}\",\n  \"\\\\u{10EC2}-\\\\u{10EC7}\",\n  \"\\\\u{10F70}-\\\\u{10F81}\",\n  \"\\\\u{10FB0}-\\\\u{10FC4}\",\n  \"\\\\u{11071}-\\\\u{11072}\",\n  \"\\\\u{11075}\",\n  \"\\\\u{11147}\",\n  \"\\\\u{1123F}-\\\\u{11240}\",\n  \"\\\\u{11380}-\\\\u{11389}\",\n  \"\\\\u{1138B}\",\n  \"\\\\u{1138E}\",\n  \"\\\\u{11390}-\\\\u{113B5}\",\n  \"\\\\u{113B7}\",\n  \"\\\\u{113D1}\",\n  \"\\\\u{113D3}\",\n  \"\\\\u{11460}-\\\\u{11461}\",\n  \"\\\\u{11740}-\\\\u{11746}\",\n  \"\\\\u{11900}-\\\\u{11906}\",\n  \"\\\\u{11909}\",\n  \"\\\\u{1190C}-\\\\u{11913}\",\n  \"\\\\u{11915}-\\\\u{11916}\",\n  \"\\\\u{11918}-\\\\u{1192F}\",\n  \"\\\\u{1193F}\",\n  \"\\\\u{11941}\",\n  \"\\\\u{11AB0}-\\\\u{11ABF}\",\n  \"\\\\u{11BC0}-\\\\u{11BE0}\",\n  \"\\\\u{11DB0}-\\\\u{11DDB}\",\n  \"\\\\u{11F02}\",\n  \"\\\\u{11F04}-\\\\u{11F10}\",\n  \"\\\\u{11F12}-\\\\u{11F33}\",\n  \"\\\\u{11FB0}\",\n  \"\\\\u{12F90}-\\\\u{12FF0}\",\n  \"\\\\u{1342F}\",\n  \"\\\\u{13441}-\\\\u{13446}\",\n  \"\\\\u{13460}-\\\\u{143FA}\",\n  \"\\\\u{16100}-\\\\u{1611D}\",\n  \"\\\\u{16A70}-\\\\u{16ABE}\",\n  \"\\\\u{16D40}-\\\\u{16D6C}\",\n  \"\\\\u{16EA0}-\\\\u{16EB8}\",\n  \"\\\\u{16EBB}-\\\\u{16ED3}\",\n  \"\\\\u{16FF2}-\\\\u{16FF6}\",\n  \"\\\\u{187F8}-\\\\u{187FF}\",\n  \"\\\\u{18AF3}-\\\\u{18CD5}\",\n  \"\\\\u{18CFF}-\\\\u{18D1E}\",\n  \"\\\\u{18D80}-\\\\u{18DF2}\",\n  \"\\\\u{1AFF0}-\\\\u{1AFF3}\",\n  \"\\\\u{1AFF5}-\\\\u{1AFFB}\",\n  \"\\\\u{1AFFD}-\\\\u{1AFFE}\",\n  \"\\\\u{1B11F}-\\\\u{1B122}\",\n  \"\\\\u{1B132}\",\n  \"\\\\u{1B155}\",\n  \"\\\\u{1DF00}-\\\\u{1DF1E}\",\n  \"\\\\u{1DF25}-\\\\u{1DF2A}\",\n  \"\\\\u{1E030}-\\\\u{1E06D}\",\n  \"\\\\u{1E290}-\\\\u{1E2AD}\",\n  \"\\\\u{1E4D0}-\\\\u{1E4EB}\",\n  \"\\\\u{1E5D0}-\\\\u{1E5ED}\",\n  \"\\\\u{1E5F0}\",\n  \"\\\\u{1E6C0}-\\\\u{1E6DE}\",\n  \"\\\\u{1E6E0}-\\\\u{1E6E2}\",\n  \"\\\\u{1E6E4}-\\\\u{1E6E5}\",\n  \"\\\\u{1E6E7}-\\\\u{1E6ED}\",\n  \"\\\\u{1E6F0}-\\\\u{1E6F4}\",\n  \"\\\\u{1E6FE}-\\\\u{1E6FF}\",\n  \"\\\\u{1E7E0}-\\\\u{1E7E6}\",\n  \"\\\\u{1E7E8}-\\\\u{1E7EB}\",\n  \"\\\\u{1E7ED}-\\\\u{1E7EE}\",\n  \"\\\\u{1E7F0}-\\\\u{1E7FE}\",\n  \"\\\\u{2A6D7}-\\\\u{2A6DF}\",\n  \"\\\\u{2B735}-\\\\u{2B73F}\",\n  \"\\\\u{2CEA2}-\\\\u{2CEAD}\",\n  \"\\\\u{2EBF0}-\\\\u{2EE5D}\",\n  \"\\\\u{30000}-\\\\u{3134A}\",\n  \"\\\\u{31350}-\\\\u{33479}\",\n];\n\n/** `ID_Continue` code points that TypeScript's scanner does not accept, as regex class items. */\nexport const NEWER_IDENTIFIER_PART: readonly string[] = [\n  \"\\\\u{870}-\\\\u{887}\",\n  \"\\\\u{889}-\\\\u{88F}\",\n  \"\\\\u{897}-\\\\u{89F}\",\n  \"\\\\u{8B5}\",\n  \"\\\\u{8BE}-\\\\u{8D2}\",\n  \"\\\\u{B55}\",\n  \"\\\\u{C3C}\",\n  \"\\\\u{C5C}-\\\\u{C5D}\",\n  \"\\\\u{CDC}-\\\\u{CDD}\",\n  \"\\\\u{CF3}\",\n  \"\\\\u{D04}\",\n  \"\\\\u{D81}\",\n  \"\\\\u{ECE}\",\n  \"\\\\u{170D}\",\n  \"\\\\u{1715}\",\n  \"\\\\u{171F}\",\n  \"\\\\u{180F}\",\n  \"\\\\u{1ABF}-\\\\u{1ADD}\",\n  \"\\\\u{1AE0}-\\\\u{1AEB}\",\n  \"\\\\u{1B4C}\",\n  \"\\\\u{1C89}-\\\\u{1C8A}\",\n  \"\\\\u{1DFA}\",\n  \"\\\\u{200C}-\\\\u{200D}\",\n  \"\\\\u{2C2F}\",\n  \"\\\\u{2C5F}\",\n  \"\\\\u{30FB}\",\n  \"\\\\u{31BB}-\\\\u{31BF}\",\n  \"\\\\u{4DB6}-\\\\u{4DBF}\",\n  \"\\\\u{9FF0}-\\\\u{9FFF}\",\n  \"\\\\u{A7C0}-\\\\u{A7C1}\",\n  \"\\\\u{A7C7}-\\\\u{A7DC}\",\n  \"\\\\u{A7F1}-\\\\u{A7F6}\",\n  \"\\\\u{A82C}\",\n  \"\\\\u{AB68}-\\\\u{AB69}\",\n  \"\\\\u{FF65}\",\n  \"\\\\u{10570}-\\\\u{1057A}\",\n  \"\\\\u{1057C}-\\\\u{1058A}\",\n  \"\\\\u{1058C}-\\\\u{10592}\",\n  \"\\\\u{10594}-\\\\u{10595}\",\n  \"\\\\u{10597}-\\\\u{105A1}\",\n  \"\\\\u{105A3}-\\\\u{105B1}\",\n  \"\\\\u{105B3}-\\\\u{105B9}\",\n  \"\\\\u{105BB}-\\\\u{105BC}\",\n  \"\\\\u{105C0}-\\\\u{105F3}\",\n  \"\\\\u{10780}-\\\\u{10785}\",\n  \"\\\\u{10787}-\\\\u{107B0}\",\n  \"\\\\u{107B2}-\\\\u{107BA}\",\n  \"\\\\u{10940}-\\\\u{10959}\",\n  \"\\\\u{10D40}-\\\\u{10D65}\",\n  \"\\\\u{10D69}-\\\\u{10D6D}\",\n  \"\\\\u{10D6F}-\\\\u{10D85}\",\n  \"\\\\u{10E80}-\\\\u{10EA9}\",\n  \"\\\\u{10EAB}-\\\\u{10EAC}\",\n  \"\\\\u{10EB0}-\\\\u{10EB1}\",\n  \"\\\\u{10EC2}-\\\\u{10EC7}\",\n  \"\\\\u{10EFA}-\\\\u{10EFF}\",\n  \"\\\\u{10F70}-\\\\u{10F85}\",\n  \"\\\\u{10FB0}-\\\\u{10FC4}\",\n  \"\\\\u{11070}-\\\\u{11075}\",\n  \"\\\\u{110C2}\",\n  \"\\\\u{11147}\",\n  \"\\\\u{111CE}-\\\\u{111CF}\",\n  \"\\\\u{1123F}-\\\\u{11241}\",\n  \"\\\\u{11380}-\\\\u{11389}\",\n  \"\\\\u{1138B}\",\n  \"\\\\u{1138E}\",\n  \"\\\\u{11390}-\\\\u{113B5}\",\n  \"\\\\u{113B7}-\\\\u{113C0}\",\n  \"\\\\u{113C2}\",\n  \"\\\\u{113C5}\",\n  \"\\\\u{113C7}-\\\\u{113CA}\",\n  \"\\\\u{113CC}-\\\\u{113D3}\",\n  \"\\\\u{113E1}-\\\\u{113E2}\",\n  \"\\\\u{11460}-\\\\u{11461}\",\n  \"\\\\u{116D0}-\\\\u{116E3}\",\n  \"\\\\u{11740}-\\\\u{11746}\",\n  \"\\\\u{11900}-\\\\u{11906}\",\n  \"\\\\u{11909}\",\n  \"\\\\u{1190C}-\\\\u{11913}\",\n  \"\\\\u{11915}-\\\\u{11916}\",\n  \"\\\\u{11918}-\\\\u{11935}\",\n  \"\\\\u{11937}-\\\\u{11938}\",\n  \"\\\\u{1193B}-\\\\u{11943}\",\n  \"\\\\u{11950}-\\\\u{11959}\",\n  \"\\\\u{11AB0}-\\\\u{11ABF}\",\n  \"\\\\u{11B60}-\\\\u{11B67}\",\n  \"\\\\u{11BC0}-\\\\u{11BE0}\",\n  \"\\\\u{11BF0}-\\\\u{11BF9}\",\n  \"\\\\u{11DB0}-\\\\u{11DDB}\",\n  \"\\\\u{11DE0}-\\\\u{11DE9}\",\n  \"\\\\u{11F00}-\\\\u{11F10}\",\n  \"\\\\u{11F12}-\\\\u{11F3A}\",\n  \"\\\\u{11F3E}-\\\\u{11F42}\",\n  \"\\\\u{11F50}-\\\\u{11F5A}\",\n  \"\\\\u{11FB0}\",\n  \"\\\\u{12F90}-\\\\u{12FF0}\",\n  \"\\\\u{1342F}\",\n  \"\\\\u{13440}-\\\\u{13455}\",\n  \"\\\\u{13460}-\\\\u{143FA}\",\n  \"\\\\u{16100}-\\\\u{16139}\",\n  \"\\\\u{16A70}-\\\\u{16ABE}\",\n  \"\\\\u{16AC0}-\\\\u{16AC9}\",\n  \"\\\\u{16D40}-\\\\u{16D6C}\",\n  \"\\\\u{16D70}-\\\\u{16D79}\",\n  \"\\\\u{16EA0}-\\\\u{16EB8}\",\n  \"\\\\u{16EBB}-\\\\u{16ED3}\",\n  \"\\\\u{16FE4}\",\n  \"\\\\u{16FF0}-\\\\u{16FF6}\",\n  \"\\\\u{187F8}-\\\\u{187FF}\",\n  \"\\\\u{18AF3}-\\\\u{18CD5}\",\n  \"\\\\u{18CFF}-\\\\u{18D1E}\",\n  \"\\\\u{18D80}-\\\\u{18DF2}\",\n  \"\\\\u{1AFF0}-\\\\u{1AFF3}\",\n  \"\\\\u{1AFF5}-\\\\u{1AFFB}\",\n  \"\\\\u{1AFFD}-\\\\u{1AFFE}\",\n  \"\\\\u{1B11F}-\\\\u{1B122}\",\n  \"\\\\u{1B132}\",\n  \"\\\\u{1B155}\",\n  \"\\\\u{1CCF0}-\\\\u{1CCF9}\",\n  \"\\\\u{1CF00}-\\\\u{1CF2D}\",\n  \"\\\\u{1CF30}-\\\\u{1CF46}\",\n  \"\\\\u{1DF00}-\\\\u{1DF1E}\",\n  \"\\\\u{1DF25}-\\\\u{1DF2A}\",\n  \"\\\\u{1E030}-\\\\u{1E06D}\",\n  \"\\\\u{1E08F}\",\n  \"\\\\u{1E290}-\\\\u{1E2AE}\",\n  \"\\\\u{1E4D0}-\\\\u{1E4F9}\",\n  \"\\\\u{1E5D0}-\\\\u{1E5FA}\",\n  \"\\\\u{1E6C0}-\\\\u{1E6DE}\",\n  \"\\\\u{1E6E0}-\\\\u{1E6F5}\",\n  \"\\\\u{1E6FE}-\\\\u{1E6FF}\",\n  \"\\\\u{1E7E0}-\\\\u{1E7E6}\",\n  \"\\\\u{1E7E8}-\\\\u{1E7EB}\",\n  \"\\\\u{1E7ED}-\\\\u{1E7EE}\",\n  \"\\\\u{1E7F0}-\\\\u{1E7FE}\",\n  \"\\\\u{1FBF0}-\\\\u{1FBF9}\",\n  \"\\\\u{2A6D7}-\\\\u{2A6DF}\",\n  \"\\\\u{2B735}-\\\\u{2B73F}\",\n  \"\\\\u{2CEA2}-\\\\u{2CEAD}\",\n  \"\\\\u{2EBF0}-\\\\u{2EE5D}\",\n  \"\\\\u{30000}-\\\\u{3134A}\",\n  \"\\\\u{31350}-\\\\u{33479}\",\n];\n"],"names":[],"mappings":"AAIO,MAAM,sBAAA,GAA4C;AAAA,EACvD,mBAAA;AAAA,EACA,mBAAA;AAAA,EACA,UAAA;AAAA,EACA,mBAAA;AAAA,EACA,mBAAA;AAAA,EACA,mBAAA;AAAA,EACA,UAAA;AAAA,EACA,WAAA;AAAA,EACA,WAAA;AAAA,EACA,WAAA;AAAA,EACA,qBAAA;AAAA,EACA,WAAA;AAAA,EACA,WAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA;AACF;AAGO,MAAM,qBAAA,GAA2C;AAAA,EACtD,mBAAA;AAAA,EACA,mBAAA;AAAA,EACA,mBAAA;AAAA,EACA,UAAA;AAAA,EACA,mBAAA;AAAA,EACA,UAAA;AAAA,EACA,UAAA;AAAA,EACA,mBAAA;AAAA,EACA,mBAAA;AAAA,EACA,UAAA;AAAA,EACA,UAAA;AAAA,EACA,UAAA;AAAA,EACA,UAAA;AAAA,EACA,WAAA;AAAA,EACA,WAAA;AAAA,EACA,WAAA;AAAA,EACA,WAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,WAAA;AAAA,EACA,qBAAA;AAAA,EACA,WAAA;AAAA,EACA,qBAAA;AAAA,EACA,WAAA;AAAA,EACA,WAAA;AAAA,EACA,WAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,WAAA;AAAA,EACA,qBAAA;AAAA,EACA,WAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,YAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA,uBAAA;AAAA,EACA;AACF;;"}

package/dist/domain/openapi/alias-expansion.cjs

@@ -27,7 +27,9 @@ function countNodes(root) {
     entered.add(node);
     const pending = isFirstVisit ? childrenOf(node).filter((child) => isContainer(child) && !entered.has(child)) : [];
     if (pending.length > 0) {
-      stack.push(...pending);
+      for (const child of pending) {
+        stack.push(child);
+      }
       continue;
     }
     stack.pop();

package/dist/domain/openapi/alias-expansion.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"alias-expansion.cjs","sources":["../../../src/domain/openapi/alias-expansion.ts"],"sourcesContent":["/**\n * YAML aliases (`*name`) make the parsed document share objects. A \"billion laughs\" document,\n * where each level refers to the previous one ten times, parses into a few hundred objects that\n * every walk over the document (Redocly's resolver, the generator) visits as 10^9 nodes: the run\n * took minutes and ended with \"RangeError: Set maximum size exceeded\" (pre-beta test plan 10.2).\n * A document is refused when its aliases expand it far beyond what it stores.\n */\n\n/** Expansion below this many nodes is allowed whatever the ratio: large real documents pass. */\nexport const ALIAS_EXPANSION_MIN_NODES = 1_000_000;\n/** Real documents reuse anchors a few times; a bomb multiplies its size by orders of magnitude. */\nexport const ALIAS_EXPANSION_MAX_RATIO = 100;\n\nexport interface NodeCounts {\n  /** Nodes of the document as written: each object once, with its entries. */\n  readonly stored: number;\n  /** Nodes a walk visits when it follows every shared object again. */\n  readonly expanded: number;\n}\n\nfunction childrenOf(node: object): unknown[] {\n  return Array.isArray(node) ? node : Object.values(node);\n}\n\nfunction isContainer(value: unknown): value is object {\n  return typeof value === \"object\" && value !== null;\n}\n\n/** The expanded size of `node`, whose container children are all sized (or in a cycle). */\nfunction sizeOf(node: object, sizes: ReadonlyMap<object, number>): number {\n  return childrenOf(node).reduce<number>(\n    (total, child) => total + (isContainer(child) ? (sizes.get(child) ?? 1) : 1),\n    1,\n  );\n}\n\n/**\n * Count stored and expanded nodes without recursion (documents can be thousands of levels deep)\n * and without expanding: each shared object is sized once. A cycle counts its back edge once.\n */\nexport function countNodes(root: unknown): NodeCounts {\n  if (!isContainer(root)) {\n    return { stored: 1, expanded: 1 };\n  }\n  const sizes = new Map<object, number>();\n  const entered = new Set<object>();\n  const stack: object[] = [root];\n  while (stack.length > 0) {\n    const node = stack[stack.length - 1] as object;\n    const isFirstVisit = !entered.has(node);\n    entered.add(node);\n    const pending = isFirstVisit\n      ? childrenOf(node).filter((child) => isContainer(child) && !entered.has(child))\n      : [];\n    if (pending.length > 0) {\n      stack.push(...(pending as object[]));\n      continue;\n    }\n    stack.pop();\n    sizes.set(node, sizeOf(node, sizes));\n  }\n  let stored = 0;\n  for (const node of sizes.keys()) {\n    stored += 1 + childrenOf(node).filter((child) => !isContainer(child)).length;\n  }\n  return { stored, expanded: sizes.get(root) ?? 1 };\n}\n\n/** Whether the aliases of a parsed document expand it beyond the limits above. */\nexport function isAliasExpansionExcessive({ stored, expanded }: NodeCounts): boolean {\n  return expanded > Math.max(ALIAS_EXPANSION_MIN_NODES, stored * ALIAS_EXPANSION_MAX_RATIO);\n}\n"],"names":[],"mappings":";;AASO,MAAM,yBAAA,GAA4B;AAElC,MAAM,yBAAA,GAA4B;AASzC,SAAS,WAAW,IAAA,EAAyB;AAC3C,EAAA,OAAO,MAAM,OAAA,CAAQ,IAAI,IAAI,IAAA,GAAO,MAAA,CAAO,OAAO,IAAI,CAAA;AACxD;AAEA,SAAS,YAAY,KAAA,EAAiC;AACpD,EAAA,OAAO,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA;AAChD;AAGA,SAAS,MAAA,CAAO,MAAc,KAAA,EAA4C;AACxE,EAAA,OAAO,UAAA,CAAW,IAAI,CAAA,CAAE,MAAA;AAAA,IACtB,CAAC,KAAA,EAAO,KAAA,KAAU,KAAA,IAAS,WAAA,CAAY,KAAK,CAAA,GAAK,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA,IAAK,CAAA,GAAK,CAAA,CAAA;AAAA,IAC1E;AAAA,GACF;AACF;AAMO,SAAS,WAAW,IAAA,EAA2B;AACpD,EAAA,IAAI,CAAC,WAAA,CAAY,IAAI,CAAA,EAAG;AACtB,IAAA,OAAO,EAAE,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,CAAA,EAAE;AAAA,EAClC;AACA,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,KAAA,GAAkB,CAAC,IAAI,CAAA;AAC7B,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA;AACnC,IAAA,MAAM,YAAA,GAAe,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA;AACtC,IAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAChB,IAAA,MAAM,UAAU,YAAA,GACZ,UAAA,CAAW,IAAI,CAAA,CAAE,OAAO,CAAC,KAAA,KAAU,WAAA,CAAY,KAAK,KAAK,CAAC,OAAA,CAAQ,IAAI,KAAK,CAAC,IAC5E,EAAC;AACL,IAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,MAAA,KAAA,CAAM,IAAA,CAAK,GAAI,OAAoB,CAAA;AACnC,MAAA;AAAA,IACF;AACA,IAAA,KAAA,CAAM,GAAA,EAAI;AACV,IAAA,KAAA,CAAM,GAAA,CAAI,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,KAAK,CAAC,CAAA;AAAA,EACrC;AACA,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,IAAA,EAAK,EAAG;AAC/B,IAAA,MAAA,IAAU,CAAA,GAAI,UAAA,CAAW,IAAI,CAAA,CAAE,MAAA,CAAO,CAAC,KAAA,KAAU,CAAC,WAAA,CAAY,KAAK,CAAC,CAAA,CAAE,MAAA;AAAA,EACxE;AACA,EAAA,OAAO,EAAE,MAAA,EAAQ,QAAA,EAAU,MAAM,GAAA,CAAI,IAAI,KAAK,CAAA,EAAE;AAClD;AAGO,SAAS,yBAAA,CAA0B,EAAE,MAAA,EAAQ,QAAA,EAAS,EAAwB;AACnF,EAAA,OAAO,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,yBAAA,EAA2B,SAAS,yBAAyB,CAAA;AAC1F;;;;;"}
+{"version":3,"file":"alias-expansion.cjs","sources":["../../../src/domain/openapi/alias-expansion.ts"],"sourcesContent":["/**\n * YAML aliases (`*name`) make the parsed document share objects. A \"billion laughs\" document,\n * where each level refers to the previous one ten times, parses into a few hundred objects that\n * every walk over the document (Redocly's resolver, the generator) visits as 10^9 nodes: the run\n * took minutes and ended with \"RangeError: Set maximum size exceeded\" (pre-beta test plan 10.2).\n * A document is refused when its aliases expand it far beyond what it stores.\n */\n\n/** Expansion below this many nodes is allowed whatever the ratio: large real documents pass. */\nexport const ALIAS_EXPANSION_MIN_NODES = 1_000_000;\n/** Real documents reuse anchors a few times; a bomb multiplies its size by orders of magnitude. */\nexport const ALIAS_EXPANSION_MAX_RATIO = 100;\n\nexport interface NodeCounts {\n  /** Nodes of the document as written: each object once, with its entries. */\n  readonly stored: number;\n  /** Nodes a walk visits when it follows every shared object again. */\n  readonly expanded: number;\n}\n\nfunction childrenOf(node: object): unknown[] {\n  return Array.isArray(node) ? node : Object.values(node);\n}\n\nfunction isContainer(value: unknown): value is object {\n  return typeof value === \"object\" && value !== null;\n}\n\n/** The expanded size of `node`, whose container children are all sized (or in a cycle). */\nfunction sizeOf(node: object, sizes: ReadonlyMap<object, number>): number {\n  return childrenOf(node).reduce<number>(\n    (total, child) => total + (isContainer(child) ? (sizes.get(child) ?? 1) : 1),\n    1,\n  );\n}\n\n/**\n * Count stored and expanded nodes without recursion (documents can be thousands of levels deep)\n * and without expanding: each shared object is sized once. A cycle counts its back edge once.\n */\nexport function countNodes(root: unknown): NodeCounts {\n  if (!isContainer(root)) {\n    return { stored: 1, expanded: 1 };\n  }\n  const sizes = new Map<object, number>();\n  const entered = new Set<object>();\n  const stack: object[] = [root];\n  while (stack.length > 0) {\n    const node = stack[stack.length - 1] as object;\n    const isFirstVisit = !entered.has(node);\n    entered.add(node);\n    const pending = isFirstVisit\n      ? childrenOf(node).filter((child) => isContainer(child) && !entered.has(child))\n      : [];\n    if (pending.length > 0) {\n      // One push per child: spreading an array of millions of children overflows the stack.\n      for (const child of pending as object[]) {\n        stack.push(child);\n      }\n      continue;\n    }\n    stack.pop();\n    sizes.set(node, sizeOf(node, sizes));\n  }\n  let stored = 0;\n  for (const node of sizes.keys()) {\n    stored += 1 + childrenOf(node).filter((child) => !isContainer(child)).length;\n  }\n  return { stored, expanded: sizes.get(root) ?? 1 };\n}\n\n/** Whether the aliases of a parsed document expand it beyond the limits above. */\nexport function isAliasExpansionExcessive({ stored, expanded }: NodeCounts): boolean {\n  return expanded > Math.max(ALIAS_EXPANSION_MIN_NODES, stored * ALIAS_EXPANSION_MAX_RATIO);\n}\n"],"names":[],"mappings":";;AASO,MAAM,yBAAA,GAA4B;AAElC,MAAM,yBAAA,GAA4B;AASzC,SAAS,WAAW,IAAA,EAAyB;AAC3C,EAAA,OAAO,MAAM,OAAA,CAAQ,IAAI,IAAI,IAAA,GAAO,MAAA,CAAO,OAAO,IAAI,CAAA;AACxD;AAEA,SAAS,YAAY,KAAA,EAAiC;AACpD,EAAA,OAAO,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA;AAChD;AAGA,SAAS,MAAA,CAAO,MAAc,KAAA,EAA4C;AACxE,EAAA,OAAO,UAAA,CAAW,IAAI,CAAA,CAAE,MAAA;AAAA,IACtB,CAAC,KAAA,EAAO,KAAA,KAAU,KAAA,IAAS,WAAA,CAAY,KAAK,CAAA,GAAK,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA,IAAK,CAAA,GAAK,CAAA,CAAA;AAAA,IAC1E;AAAA,GACF;AACF;AAMO,SAAS,WAAW,IAAA,EAA2B;AACpD,EAAA,IAAI,CAAC,WAAA,CAAY,IAAI,CAAA,EAAG;AACtB,IAAA,OAAO,EAAE,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,CAAA,EAAE;AAAA,EAClC;AACA,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,KAAA,GAAkB,CAAC,IAAI,CAAA;AAC7B,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA;AACnC,IAAA,MAAM,YAAA,GAAe,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA;AACtC,IAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAChB,IAAA,MAAM,UAAU,YAAA,GACZ,UAAA,CAAW,IAAI,CAAA,CAAE,OAAO,CAAC,KAAA,KAAU,WAAA,CAAY,KAAK,KAAK,CAAC,OAAA,CAAQ,IAAI,KAAK,CAAC,IAC5E,EAAC;AACL,IAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AAEtB,MAAA,KAAA,MAAW,SAAS,OAAA,EAAqB;AACvC,QAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAAA,MAClB;AACA,MAAA;AAAA,IACF;AACA,IAAA,KAAA,CAAM,GAAA,EAAI;AACV,IAAA,KAAA,CAAM,GAAA,CAAI,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,KAAK,CAAC,CAAA;AAAA,EACrC;AACA,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,IAAA,EAAK,EAAG;AAC/B,IAAA,MAAA,IAAU,CAAA,GAAI,UAAA,CAAW,IAAI,CAAA,CAAE,MAAA,CAAO,CAAC,KAAA,KAAU,CAAC,WAAA,CAAY,KAAK,CAAC,CAAA,CAAE,MAAA;AAAA,EACxE;AACA,EAAA,OAAO,EAAE,MAAA,EAAQ,QAAA,EAAU,MAAM,GAAA,CAAI,IAAI,KAAK,CAAA,EAAE;AAClD;AAGO,SAAS,yBAAA,CAA0B,EAAE,MAAA,EAAQ,QAAA,EAAS,EAAwB;AACnF,EAAA,OAAO,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,yBAAA,EAA2B,SAAS,yBAAyB,CAAA;AAC1F;;;;;"}

package/dist/domain/openapi/alias-expansion.mjs

@@ -25,7 +25,9 @@ function countNodes(root) {
     entered.add(node);
     const pending = isFirstVisit ? childrenOf(node).filter((child) => isContainer(child) && !entered.has(child)) : [];
     if (pending.length > 0) {
-      stack.push(...pending);
+      for (const child of pending) {
+        stack.push(child);
+      }
       continue;
     }
     stack.pop();

package/dist/domain/openapi/alias-expansion.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"alias-expansion.mjs","sources":["../../../src/domain/openapi/alias-expansion.ts"],"sourcesContent":["/**\n * YAML aliases (`*name`) make the parsed document share objects. A \"billion laughs\" document,\n * where each level refers to the previous one ten times, parses into a few hundred objects that\n * every walk over the document (Redocly's resolver, the generator) visits as 10^9 nodes: the run\n * took minutes and ended with \"RangeError: Set maximum size exceeded\" (pre-beta test plan 10.2).\n * A document is refused when its aliases expand it far beyond what it stores.\n */\n\n/** Expansion below this many nodes is allowed whatever the ratio: large real documents pass. */\nexport const ALIAS_EXPANSION_MIN_NODES = 1_000_000;\n/** Real documents reuse anchors a few times; a bomb multiplies its size by orders of magnitude. */\nexport const ALIAS_EXPANSION_MAX_RATIO = 100;\n\nexport interface NodeCounts {\n  /** Nodes of the document as written: each object once, with its entries. */\n  readonly stored: number;\n  /** Nodes a walk visits when it follows every shared object again. */\n  readonly expanded: number;\n}\n\nfunction childrenOf(node: object): unknown[] {\n  return Array.isArray(node) ? node : Object.values(node);\n}\n\nfunction isContainer(value: unknown): value is object {\n  return typeof value === \"object\" && value !== null;\n}\n\n/** The expanded size of `node`, whose container children are all sized (or in a cycle). */\nfunction sizeOf(node: object, sizes: ReadonlyMap<object, number>): number {\n  return childrenOf(node).reduce<number>(\n    (total, child) => total + (isContainer(child) ? (sizes.get(child) ?? 1) : 1),\n    1,\n  );\n}\n\n/**\n * Count stored and expanded nodes without recursion (documents can be thousands of levels deep)\n * and without expanding: each shared object is sized once. A cycle counts its back edge once.\n */\nexport function countNodes(root: unknown): NodeCounts {\n  if (!isContainer(root)) {\n    return { stored: 1, expanded: 1 };\n  }\n  const sizes = new Map<object, number>();\n  const entered = new Set<object>();\n  const stack: object[] = [root];\n  while (stack.length > 0) {\n    const node = stack[stack.length - 1] as object;\n    const isFirstVisit = !entered.has(node);\n    entered.add(node);\n    const pending = isFirstVisit\n      ? childrenOf(node).filter((child) => isContainer(child) && !entered.has(child))\n      : [];\n    if (pending.length > 0) {\n      stack.push(...(pending as object[]));\n      continue;\n    }\n    stack.pop();\n    sizes.set(node, sizeOf(node, sizes));\n  }\n  let stored = 0;\n  for (const node of sizes.keys()) {\n    stored += 1 + childrenOf(node).filter((child) => !isContainer(child)).length;\n  }\n  return { stored, expanded: sizes.get(root) ?? 1 };\n}\n\n/** Whether the aliases of a parsed document expand it beyond the limits above. */\nexport function isAliasExpansionExcessive({ stored, expanded }: NodeCounts): boolean {\n  return expanded > Math.max(ALIAS_EXPANSION_MIN_NODES, stored * ALIAS_EXPANSION_MAX_RATIO);\n}\n"],"names":[],"mappings":"AASO,MAAM,yBAAA,GAA4B;AAElC,MAAM,yBAAA,GAA4B;AASzC,SAAS,WAAW,IAAA,EAAyB;AAC3C,EAAA,OAAO,MAAM,OAAA,CAAQ,IAAI,IAAI,IAAA,GAAO,MAAA,CAAO,OAAO,IAAI,CAAA;AACxD;AAEA,SAAS,YAAY,KAAA,EAAiC;AACpD,EAAA,OAAO,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA;AAChD;AAGA,SAAS,MAAA,CAAO,MAAc,KAAA,EAA4C;AACxE,EAAA,OAAO,UAAA,CAAW,IAAI,CAAA,CAAE,MAAA;AAAA,IACtB,CAAC,KAAA,EAAO,KAAA,KAAU,KAAA,IAAS,WAAA,CAAY,KAAK,CAAA,GAAK,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA,IAAK,CAAA,GAAK,CAAA,CAAA;AAAA,IAC1E;AAAA,GACF;AACF;AAMO,SAAS,WAAW,IAAA,EAA2B;AACpD,EAAA,IAAI,CAAC,WAAA,CAAY,IAAI,CAAA,EAAG;AACtB,IAAA,OAAO,EAAE,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,CAAA,EAAE;AAAA,EAClC;AACA,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,KAAA,GAAkB,CAAC,IAAI,CAAA;AAC7B,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA;AACnC,IAAA,MAAM,YAAA,GAAe,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA;AACtC,IAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAChB,IAAA,MAAM,UAAU,YAAA,GACZ,UAAA,CAAW,IAAI,CAAA,CAAE,OAAO,CAAC,KAAA,KAAU,WAAA,CAAY,KAAK,KAAK,CAAC,OAAA,CAAQ,IAAI,KAAK,CAAC,IAC5E,EAAC;AACL,IAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtB,MAAA,KAAA,CAAM,IAAA,CAAK,GAAI,OAAoB,CAAA;AACnC,MAAA;AAAA,IACF;AACA,IAAA,KAAA,CAAM,GAAA,EAAI;AACV,IAAA,KAAA,CAAM,GAAA,CAAI,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,KAAK,CAAC,CAAA;AAAA,EACrC;AACA,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,IAAA,EAAK,EAAG;AAC/B,IAAA,MAAA,IAAU,CAAA,GAAI,UAAA,CAAW,IAAI,CAAA,CAAE,MAAA,CAAO,CAAC,KAAA,KAAU,CAAC,WAAA,CAAY,KAAK,CAAC,CAAA,CAAE,MAAA;AAAA,EACxE;AACA,EAAA,OAAO,EAAE,MAAA,EAAQ,QAAA,EAAU,MAAM,GAAA,CAAI,IAAI,KAAK,CAAA,EAAE;AAClD;AAGO,SAAS,yBAAA,CAA0B,EAAE,MAAA,EAAQ,QAAA,EAAS,EAAwB;AACnF,EAAA,OAAO,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,yBAAA,EAA2B,SAAS,yBAAyB,CAAA;AAC1F;;"}
+{"version":3,"file":"alias-expansion.mjs","sources":["../../../src/domain/openapi/alias-expansion.ts"],"sourcesContent":["/**\n * YAML aliases (`*name`) make the parsed document share objects. A \"billion laughs\" document,\n * where each level refers to the previous one ten times, parses into a few hundred objects that\n * every walk over the document (Redocly's resolver, the generator) visits as 10^9 nodes: the run\n * took minutes and ended with \"RangeError: Set maximum size exceeded\" (pre-beta test plan 10.2).\n * A document is refused when its aliases expand it far beyond what it stores.\n */\n\n/** Expansion below this many nodes is allowed whatever the ratio: large real documents pass. */\nexport const ALIAS_EXPANSION_MIN_NODES = 1_000_000;\n/** Real documents reuse anchors a few times; a bomb multiplies its size by orders of magnitude. */\nexport const ALIAS_EXPANSION_MAX_RATIO = 100;\n\nexport interface NodeCounts {\n  /** Nodes of the document as written: each object once, with its entries. */\n  readonly stored: number;\n  /** Nodes a walk visits when it follows every shared object again. */\n  readonly expanded: number;\n}\n\nfunction childrenOf(node: object): unknown[] {\n  return Array.isArray(node) ? node : Object.values(node);\n}\n\nfunction isContainer(value: unknown): value is object {\n  return typeof value === \"object\" && value !== null;\n}\n\n/** The expanded size of `node`, whose container children are all sized (or in a cycle). */\nfunction sizeOf(node: object, sizes: ReadonlyMap<object, number>): number {\n  return childrenOf(node).reduce<number>(\n    (total, child) => total + (isContainer(child) ? (sizes.get(child) ?? 1) : 1),\n    1,\n  );\n}\n\n/**\n * Count stored and expanded nodes without recursion (documents can be thousands of levels deep)\n * and without expanding: each shared object is sized once. A cycle counts its back edge once.\n */\nexport function countNodes(root: unknown): NodeCounts {\n  if (!isContainer(root)) {\n    return { stored: 1, expanded: 1 };\n  }\n  const sizes = new Map<object, number>();\n  const entered = new Set<object>();\n  const stack: object[] = [root];\n  while (stack.length > 0) {\n    const node = stack[stack.length - 1] as object;\n    const isFirstVisit = !entered.has(node);\n    entered.add(node);\n    const pending = isFirstVisit\n      ? childrenOf(node).filter((child) => isContainer(child) && !entered.has(child))\n      : [];\n    if (pending.length > 0) {\n      // One push per child: spreading an array of millions of children overflows the stack.\n      for (const child of pending as object[]) {\n        stack.push(child);\n      }\n      continue;\n    }\n    stack.pop();\n    sizes.set(node, sizeOf(node, sizes));\n  }\n  let stored = 0;\n  for (const node of sizes.keys()) {\n    stored += 1 + childrenOf(node).filter((child) => !isContainer(child)).length;\n  }\n  return { stored, expanded: sizes.get(root) ?? 1 };\n}\n\n/** Whether the aliases of a parsed document expand it beyond the limits above. */\nexport function isAliasExpansionExcessive({ stored, expanded }: NodeCounts): boolean {\n  return expanded > Math.max(ALIAS_EXPANSION_MIN_NODES, stored * ALIAS_EXPANSION_MAX_RATIO);\n}\n"],"names":[],"mappings":"AASO,MAAM,yBAAA,GAA4B;AAElC,MAAM,yBAAA,GAA4B;AASzC,SAAS,WAAW,IAAA,EAAyB;AAC3C,EAAA,OAAO,MAAM,OAAA,CAAQ,IAAI,IAAI,IAAA,GAAO,MAAA,CAAO,OAAO,IAAI,CAAA;AACxD;AAEA,SAAS,YAAY,KAAA,EAAiC;AACpD,EAAA,OAAO,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA;AAChD;AAGA,SAAS,MAAA,CAAO,MAAc,KAAA,EAA4C;AACxE,EAAA,OAAO,UAAA,CAAW,IAAI,CAAA,CAAE,MAAA;AAAA,IACtB,CAAC,KAAA,EAAO,KAAA,KAAU,KAAA,IAAS,WAAA,CAAY,KAAK,CAAA,GAAK,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA,IAAK,CAAA,GAAK,CAAA,CAAA;AAAA,IAC1E;AAAA,GACF;AACF;AAMO,SAAS,WAAW,IAAA,EAA2B;AACpD,EAAA,IAAI,CAAC,WAAA,CAAY,IAAI,CAAA,EAAG;AACtB,IAAA,OAAO,EAAE,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,CAAA,EAAE;AAAA,EAClC;AACA,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,KAAA,GAAkB,CAAC,IAAI,CAAA;AAC7B,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA;AACnC,IAAA,MAAM,YAAA,GAAe,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA;AACtC,IAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAChB,IAAA,MAAM,UAAU,YAAA,GACZ,UAAA,CAAW,IAAI,CAAA,CAAE,OAAO,CAAC,KAAA,KAAU,WAAA,CAAY,KAAK,KAAK,CAAC,OAAA,CAAQ,IAAI,KAAK,CAAC,IAC5E,EAAC;AACL,IAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AAEtB,MAAA,KAAA,MAAW,SAAS,OAAA,EAAqB;AACvC,QAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAAA,MAClB;AACA,MAAA;AAAA,IACF;AACA,IAAA,KAAA,CAAM,GAAA,EAAI;AACV,IAAA,KAAA,CAAM,GAAA,CAAI,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,KAAK,CAAC,CAAA;AAAA,EACrC;AACA,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,IAAA,EAAK,EAAG;AAC/B,IAAA,MAAA,IAAU,CAAA,GAAI,UAAA,CAAW,IAAI,CAAA,CAAE,MAAA,CAAO,CAAC,KAAA,KAAU,CAAC,WAAA,CAAY,KAAK,CAAC,CAAA,CAAE,MAAA;AAAA,EACxE;AACA,EAAA,OAAO,EAAE,MAAA,EAAQ,QAAA,EAAU,MAAM,GAAA,CAAI,IAAI,KAAK,CAAA,EAAE;AAClD;AAGO,SAAS,yBAAA,CAA0B,EAAE,MAAA,EAAQ,QAAA,EAAS,EAAwB;AACnF,EAAA,OAAO,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,yBAAA,EAA2B,SAAS,yBAAyB,CAAA;AAC1F;;"}

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

@@ -27,7 +27,7 @@ function reaches(schema, search) {
   }
   const ref = schema.$ref;
   if (typeof ref === "string") {
-    if (ref === search.target) {
+    if (jsonPointer.canonicalRef(ref) === jsonPointer.canonicalRef(search.target)) {
       return true;
     }
     if (search.visited.has(ref)) {
@@ -47,14 +47,14 @@ function mappingRef(target) {
   if (typeof target !== "string") {
     return void 0;
   }
-  return target.startsWith("#") ? target : `${COMPONENT_SCHEMAS}${jsonPointer.escapePointerSegment(target)}`;
+  return target.startsWith("#") ? jsonPointer.canonicalRef(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);
+  return Object.values(mapping).some((value) => mappingRef(value) === jsonPointer.canonicalRef(target));
 }
 function isUnionMember(union, target, resolve) {
   return unionMaps(union, target) || unionReaches(union, target, resolve);

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

@@ -1 +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;;;;;;"}
+{"version":3,"file":"discriminated-union.cjs","sources":["../../../src/domain/openapi/discriminated-union.ts"],"sourcesContent":["import { canonicalRef, 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 (canonicalRef(ref) === canonicalRef(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(\"#\")\n    ? canonicalRef(target)\n    : `${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) === canonicalRef(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":["canonicalRef","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,IAAIA,yBAAa,GAAG,CAAA,KAAMA,wBAAA,CAAa,MAAA,CAAO,MAAM,CAAA,EAAG;AACrD,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,GACxBA,wBAAA,CAAa,MAAM,CAAA,GACnB,CAAA,EAAG,iBAAiB,CAAA,EAAGC,gCAAA,CAAqB,MAAM,CAAC,CAAA,CAAA;AACzD;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,KAAMD,wBAAA,CAAa,MAAM,CAAC,CAAA;AAC1F;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

@@ -1,4 +1,4 @@
-import { escapePointerSegment } from './json-pointer.mjs';
+import { canonicalRef, escapePointerSegment } from './json-pointer.mjs';
 
 const UNION_KEYWORDS = ["oneOf", "anyOf"];
 const COMPOSITION_KEYWORDS = ["allOf", ...UNION_KEYWORDS];
@@ -25,7 +25,7 @@ function reaches(schema, search) {
   }
   const ref = schema.$ref;
   if (typeof ref === "string") {
-    if (ref === search.target) {
+    if (canonicalRef(ref) === canonicalRef(search.target)) {
       return true;
     }
     if (search.visited.has(ref)) {
@@ -45,14 +45,14 @@ function mappingRef(target) {
   if (typeof target !== "string") {
     return void 0;
   }
-  return target.startsWith("#") ? target : `${COMPONENT_SCHEMAS}${escapePointerSegment(target)}`;
+  return target.startsWith("#") ? canonicalRef(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);
+  return Object.values(mapping).some((value) => mappingRef(value) === canonicalRef(target));
 }
 function isUnionMember(union, target, resolve) {
   return unionMaps(union, target) || unionReaches(union, target, resolve);

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

@@ -1 +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;;"}
+{"version":3,"file":"discriminated-union.mjs","sources":["../../../src/domain/openapi/discriminated-union.ts"],"sourcesContent":["import { canonicalRef, 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 (canonicalRef(ref) === canonicalRef(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(\"#\")\n    ? canonicalRef(target)\n    : `${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) === canonicalRef(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,aAAa,GAAG,CAAA,KAAM,YAAA,CAAa,MAAA,CAAO,MAAM,CAAA,EAAG;AACrD,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,GACxB,YAAA,CAAa,MAAM,CAAA,GACnB,CAAA,EAAG,iBAAiB,CAAA,EAAG,oBAAA,CAAqB,MAAM,CAAC,CAAA,CAAA;AACzD;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,YAAA,CAAa,MAAM,CAAC,CAAA;AAC1F;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

@@ -1,5 +1,6 @@
 'use strict';
 
+const appendAll = require('../append-all.cjs');
 const admittedValues = require('./admitted-values.cjs');
 const discriminatedUnion = require('./discriminated-union.cjs');
 const jsonPointer = require('./json-pointer.cjs');
@@ -14,7 +15,7 @@ function refsOf(list) {
   );
 }
 function mappingTarget(target) {
-  return target.startsWith("#") ? target : `${COMPONENT_SCHEMAS}${jsonPointer.escapePointerSegment(target)}`;
+  return target.startsWith("#") ? jsonPointer.canonicalRef(target) : `${COMPONENT_SCHEMAS}${jsonPointer.escapePointerSegment(target)}`;
 }
 function ownerAt(node, pointer) {
   const discriminator = node.discriminator;
@@ -31,7 +32,7 @@ function pointerOf(visit) {
   for (let current = visit; current?.key != null; current = current.parent) {
     segments.unshift(current.key);
   }
-  return jsonPointer.createRef(segments);
+  return jsonPointer.appendPointer(jsonPointer.ROOT_POINTER, segments);
 }
 function childrenOf(visit) {
   const { node } = visit;
@@ -46,7 +47,7 @@ function ownersIn(document) {
     if (owner !== null) {
       found.push(owner);
     }
-    stack.push(...childrenOf(visit).reverse());
+    appendAll.appendAll(stack, childrenOf(visit).reverse());
   }
   return found;
 }
@@ -99,14 +100,17 @@ 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);
+    const key = jsonPointer.canonicalRef(member.ref);
+    if (!members.has(key)) {
+      members.set(key, 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 values = Object.entries(owner.mapping).filter(
+    ([, target]) => typeof target === "string" && mappingTarget(target) === jsonPointer.canonicalRef(member)
+  ).map(([key]) => key);
   const name = jsonPointer.parseRefPointer(member).pop() ?? "";
   return values.length > 0 ? { values, isImplicit: false } : { values: [name], isImplicit: true };
 }