npm - fast-xml-validator - Versions diffs - 1.1.1 → 1.2.0 - Mend

fast-xml-validator 1.1.1 → 1.2.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (7) hide show

package/lib/fxv.min.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"./lib/fxv.min.js","mappings":"CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,iBAAZC,QACdA,QAAa,IAAID,IAEjBD,EAAU,IAAIC,GACf,CATD,CASGK,KAAM,I,mBCRT,IAAIC,EAAsB,CCA1BA,EAAwB,CAACL,EAASM,KACjC,IAAI,IAAIC,KAAOD,EACXD,EAAoBG,EAAEF,EAAYC,KAASF,EAAoBG,EAAER,EAASO,IAC5EE,OAAOC,eAAeV,EAASO,EAAK,CAAEI,YAAY,EAAMC,IAAKN,EAAWC,MCJ3EF,EAAwB,CAACQ,EAAKC,IAAUL,OAAOM,UAAUC,eAAeC,KAAKJ,EAAKC,GCClFT,EAAyBL,IACH,oBAAXkB,QAA0BA,OAAOC,aAC1CV,OAAOC,eAAeV,EAASkB,OAAOC,YAAa,CAAEC,MAAO,WAE7DX,OAAOC,eAAeV,EAAS,aAAc,CAAEoB,OAAO,M,0ECwBvD,MAAMC,EACJ,+CAoCIC,EACJ,8CAYIC,EACJD,sBAeIE,EAAeA,CAACC,EAAWC,EAAMC,EAAQ,MAC7C,MAEMC,EAAY,IAFFH,EAAUI,QAAQ,IAAK,QACxBH,EAAKG,QAAQ,IAAK,QAGjC,MAAO,CACLC,KAAM,IAAIC,OAAO,KAAKN,MAAcC,OAAWC,GAC/CK,OAAQ,IAAID,OAAO,IAAIH,KAAcD,GACrCM,MAAO,IAAIF,OAAO,IAAIH,QAAgBA,OAAgBD,GACtDO,QAAS,IAAIH,OAAO,KAAKL,OAAWC,GACpCQ,SAAU,IAAIJ,OAAO,KAAKL,cAAiBA,SAAaC,KAItDS,EAAYZ,EAAaH,EAnE7BA,sBAoEIgB,EAAYb,EAAaF,EAAiBC,EAAY,KAEtDe,EAAaA,CAACC,EAAa,QAChB,QAAfA,EAAuBF,EAAYD,EAWxBN,EAAOA,CAACU,GAAOD,aAAa,OAAU,CAAC,IAClDD,EAAWC,GAAYT,KAAKW,KAAKD,GC3HnC,IAAME,EAAiB,CACnBC,eAAgBC,IAChBC,cAAeD,KAGEE,EAAgB,WACjC,SAAAA,EAAYC,EAASR,QAAU,IAAVA,IAAAA,EAAa,OAC9BnC,KAAK2C,QAAUtC,OAAOuC,OAAO,CAAC,EAAGN,EAAgBK,GACjD3C,KAAK6C,uBAAyBF,EAC9B3C,KAAKmC,WAAaA,CACtB,CAAC,IAAAW,EAAAJ,EAAA/B,UAwOA,OAxOA,EAEDoC,gBAAA,SAAgBC,EAASC,GACrB,GACuB,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,GAEZ,MAAM,IAAIC,MAAM,kCAGpBD,GAAK,EAML,IALA,IAAIE,EAAqB,EACrBC,GAAU,EACVC,GAAU,EACVC,EAAc,EAEXL,EAAID,EAAQO,OAAQN,IACvB,GAAmB,MAAfD,EAAQC,IAAeI,EAuBpB,GAAmB,MAAfL,EAAQC,IASf,GARII,EACuB,MAAnBL,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,KACtCI,GAAU,EACVF,KAGJA,IAEuB,IAAvBA,EAA0B,UACR,MAAfH,EAAQC,KACfG,GAAU,OAlCsB,CAChC,GAAIA,GAAWI,EAAOR,EAAS,UAAWC,GAAI,CAC1CA,GAAK,EAEL,IAAAQ,EADmBzD,KAAK0D,mBAAmBV,EAASC,EAAI,EAAGK,GAA1DA,EAAWG,EAAA,GAAER,EAACQ,EAAA,EAEnB,MAAO,GAAIL,GAAWI,EAAOR,EAAS,WAAYC,GAC9CA,GAAK,EACLA,EAAIjD,KAAK2D,oBAAoBX,EAASC,EAAI,OAEvC,IAAIG,GAAWI,EAAOR,EAAS,WAAYC,GAAI,CAClDA,GAAK,EACLA,EAAIjD,KAAK4D,oBAAoBZ,EAASC,EAAI,GAC1C,QACJ,CAAO,GAAIG,GAAWI,EAAOR,EAAS,YAAaC,GAC/CA,GAAK,EACLA,EAAIjD,KAAK6D,qBAAqBb,EAASC,EAAI,OAExC,KAAIO,EAAOR,EAAS,MAAOC,GAG9B,MAAM,IAAIC,MAAM,mBAFhBG,GAAU,CAGd,EACAF,GACJ,CAeJ,GAA2B,IAAvBA,EACA,MAAM,IAAID,MAAM,oBAGpB,OAAOD,CACX,EAAC,EAEDS,mBAAA,SAAmBV,EAASC,EAAGK,GAK3B,IADA,IAAMQ,EAHNb,EAAIc,EAAef,EAASC,GAIrBA,EAAID,EAAQO,SAAW,KAAKlB,KAAKW,EAAQC,KAAsB,MAAfD,EAAQC,IAA6B,MAAfD,EAAQC,IACjFA,IAEJ,IAeIe,EAfEC,EAAajB,EAAQkB,UAAUJ,EAAWb,GAMhD,GALAkB,EAAaF,EAAYjE,KAAKmC,YAE9Bc,EAAIc,EAAef,EAASC,IAGvBjD,KAAK6C,sBAAuB,CAC7B,GAAkD,WAA9CG,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cAC5B,MAAM,IAAIlB,MAAM,uCACb,GAAmB,MAAfF,EAAQC,GACf,MAAM,IAAIC,MAAM,uCAExB,CAGgB,IAAAmB,EACGC,EAAgBtB,EAASC,EAAG,UAA9CA,EAACoB,EAAA,GAAEL,EAAWK,EAAA,GAEf,IAAAE,EAA0CvE,KAAK2C,QAAvCF,EAAa8B,EAAb9B,cAAeF,EAAcgC,EAAdhC,eAEvB,GAAIyB,EAAYT,OAASd,EACrB,MAAM,IAAIS,MAAM,WACDe,EAAU,WAAWD,EAAYT,OAAM,mCAAmCd,EAAa,KAK1G,IAAkC,IAA9BuB,EAAYQ,QAAQ,QACpBlB,EACkBf,EACd,MAAM,IAAIW,MAAM,iBACKI,EAAW,8BAA8Bf,EAAc,KAKpF,MAAO,CAACe,EAAaL,EAAI,EAC7B,EAAC,EAEDY,qBAAA,SAAqBb,EAASC,GAK1B,IADA,IAAMa,EAHNb,EAAIc,EAAef,EAASC,GAIrBA,EAAID,EAAQO,SAAW,KAAKlB,KAAKW,EAAQC,KAAKA,IACrD,IAAMwB,EAAezB,EAAQkB,UAAUJ,EAAWb,IACjDjD,KAAK6C,uBAAyBsB,EAAaM,EAAczE,KAAKmC,YAE/Dc,EAAIc,EAAef,EAASC,GAE5B,IAAMyB,EAAiB1B,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cACnD,IAAKpE,KAAK6C,uBAA4C,WAAnB6B,GAAkD,WAAnBA,EAC9D,MAAM,IAAIxB,MAAM,qCAAqCwB,EAAc,KAevE,OAZAzB,EAAIc,EAAef,EADnBC,GAAKyB,EAAenB,QAGG,WAAnBmB,EAGmB,MAAf1B,EADJC,EAAIc,EAAef,EADlBC,EAAKqB,EAAgBtB,EAASC,EAAG,oBAAhC,MAEuC,MAAfD,EAAQC,KAC7BA,EAAKqB,EAAgBtB,EAASC,EAAG,oBAAhC,IAEoB,WAAnByB,IACNzB,EAAKqB,EAAgBtB,EAASC,EAAG,oBAAhC,MAGGA,CACb,EAAC,EAEDU,oBAAA,SAAoBX,EAASC,GAKzB,IADA,IAAMa,EAHNb,EAAIc,EAAef,EAASC,GAIrBA,EAAID,EAAQO,SAAW,KAAKlB,KAAKW,EAAQC,KAAKA,IACrD,IAAM0B,EAAc3B,EAAQkB,UAAUJ,EAAWb,GACjD,IAAKjD,KAAK6C,wBAA0B+B,EAAUD,EAAa,CAAExC,WAAYnC,KAAKmC,aAC1E,MAAM,IAAIe,MAAM,0BAA0ByB,EAAW,KAMzD,GAAmB,MAAf3B,EAHJC,EAAIc,EAAef,EAASC,KAGFO,EAAOR,EAAS,OAAQC,GAC9CA,GAAK,OACF,GAAmB,MAAfD,EAAQC,IAAcO,EAAOR,EAAS,KAAMC,GACnDA,GAAK,OACF,GAAmB,MAAfD,EAAQC,GAAY,CAE3B,IADAA,IACOA,EAAID,EAAQO,QAAyB,MAAfP,EAAQC,IAAYA,IACjD,GAAmB,MAAfD,EAAQC,GAAY,MAAM,IAAIC,MAAM,6BAC5C,MAAO,IAAKlD,KAAK6C,sBACb,MAAM,IAAIK,MAAM,sCAAsCF,EAAQC,GAAE,KAGpE,OAAOA,CACX,EAAC,EAEDW,oBAAA,SAAoBZ,EAASC,GAKzB,IADA,IAAM4B,EAHN5B,EAAIc,EAAef,EAASC,GAIrBA,EAAID,EAAQO,SAAW,KAAKlB,KAAKW,EAAQC,KAAKA,IAErDkB,EADoBnB,EAAQkB,UAAUW,EAAe5B,GAC3BjD,KAAKmC,YAM/B,IADA,IAAM2C,EAHN7B,EAAIc,EAAef,EAASC,GAIrBA,EAAID,EAAQO,SAAW,KAAKlB,KAAKW,EAAQC,KAAKA,IAOrD,GALAkB,EADsBnB,EAAQkB,UAAUY,EAAe7B,GAC3BjD,KAAKmC,YAEjCc,EAAIc,EAAef,EAASC,GAGsB,aAA9CD,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cAA8B,CAG1D,GAAmB,MAAfpB,EADJC,EAAIc,EAAef,EADnBC,GAAK,IAEmB,MAAM,IAAIC,MAAM,yBAAwBF,EAAQC,GAAE,KAE1E,IADAA,IACOA,EAAID,EAAQO,QAAyB,MAAfP,EAAQC,IAAY,CAE7C,IADA,IAAM8B,EAAgB9B,EACfA,EAAID,EAAQO,QAAyB,MAAfP,EAAQC,IAA6B,MAAfD,EAAQC,IAAYA,IAEvEkB,EADiBnB,EAAQkB,UAAUa,EAAe9B,GAAG+B,OAC9BhF,KAAKmC,YACT,MAAfa,EAAQC,KAERA,EAAIc,EAAef,IADnBC,GAGR,CACA,GAAmB,MAAfD,EAAQC,GAAY,MAAM,IAAIC,MAAM,kCACxCD,GACJ,KAAO,CAEH,IADA,IAAMgC,EAAYhC,EACXA,EAAID,EAAQO,SAAW,KAAKlB,KAAKW,EAAQC,KAAKA,IACrD,IAAMiC,EAAgBlC,EAAQkB,UAAUe,EAAWhC,GAEnD,IAAKjD,KAAK6C,wBADS,CAAC,QAAS,KAAM,QAAS,SAAU,SAAU,WAAY,UAAW,YACxCsC,SAASD,EAAcd,eAClE,MAAM,IAAIlB,MAAM,4BAA4BgC,EAAa,IAEjE,CAaA,OAXAjC,EAAIc,EAAef,EAASC,GAGsB,cAA9CD,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cAC5BnB,GAAK,EACgD,aAA9CD,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cACnCnB,GAAK,EAEJA,EAAKqB,EAAgBtB,EAASC,EAAG,yBAAhC,GAGCA,CACX,EAACP,CAAA,CA7OgC,GAkPrC,SAASqB,EAAeqB,EAAMC,GAC1B,KAAOA,EAAQD,EAAK7B,QAAU,KAAKlB,KAAK+C,EAAKC,KAASA,IACtD,OAAOA,CACX,CAEA,SAAS7B,EAAO4B,EAAME,EAAKrC,GACvB,IAAK,IAAIsC,EAAI,EAAGA,EAAID,EAAI/B,OAAQgC,IAC5B,GAAID,EAAIC,KAAOH,EAAKnC,EAAIsC,EAAI,GAAI,OAAO,EAE3C,OAAO,CACX,CAEA,SAASpB,EAAazC,EAAMS,GACxB,QADkC,IAAVA,IAAAA,EAAa,QAChCyC,EAAUlD,EAAM,CAAES,WAAAA,IAAe,MAAM,IAAIe,MAAM,wBAAwBxB,EAAI,IACtF,CAKA,SAAS4C,EAAgBtB,EAASC,EAAGuC,GACjC,IAAMnE,EAAY2B,EAAQC,GAC1B,GAAkB,MAAd5B,GAAmC,MAAdA,EACrB,MAAM,IAAI6B,MAAM,8BAA8BsC,EAAI,YAAYnE,EAAS,KAI3E,IADA,IAAMoE,IADNxC,EAEOA,EAAID,EAAQO,QAAUP,EAAQC,KAAO5B,GAAW4B,IACvD,GAAID,EAAQC,KAAO5B,EAAW,MAAM,IAAI6B,MAAM,gBAAgBsC,EAAI,UAClE,IAAMxE,EAAQgC,EAAQkB,UAAUuB,EAAOxC,GACvC,MAAO,GAAGA,EAAGjC,EACjB,C,4lCCvRqB0E,EAAe,SAAAC,GAClC,SAAAD,EAAYE,EAASC,EAAMC,EAAMC,GAAM,IAADC,EAMc,OALlDA,EAAAL,EAAA9E,KAAA,KAAM+E,IAAQ,MACTlE,KAAOsE,EAAKC,YAAYvE,KAC7BsE,EAAKH,KAAOA,EACZG,EAAKF,KAAOA,EACZE,EAAKD,IAAMA,EACY,MAAvB7C,MAAMgD,mBAANhD,MAAMgD,kBAAiBF,EAASA,EAAKC,aAAaD,CACpD,C,QAAC,O,EAAAL,G,EAAAD,G,sEAAAA,CAAA,CARiC,CAQjCS,EAR0CjD,QCOvCZ,EAAiB,CACrB8D,wBAAwB,EACxBC,aAAc,GAEdC,QAAS,CACP/D,eAAgBC,IAChBC,cAAeD,MAkNnB,SAAS+D,EAAajF,GACpB,MAAgB,MAATA,GAAyB,OAATA,GAA0B,OAATA,GAA0B,OAATA,CAC3D,CAEA,SAASkF,EAAOxD,EAASC,EAAGd,QAAU,IAAVA,IAAAA,EAAa,OAKvC,IAJA,IAAMsE,EAAUxD,EACVa,EAAYb,EACdyD,GAAgB,EAEbzD,EAAID,EAAQO,OAAQN,IAAK,CAC9B,IAAM0D,EAAK3D,EAAQC,GAEnB,IAAKyD,IAAyB,MAAPC,GAAqB,MAAPA,GAAa,CAEhD,IAAMC,EAAS5D,EAAQ6D,OAAO/C,EAAWb,EAAIa,GAC7C4C,GAAgB,EAEa,QAAzBE,EAAOE,cACTC,EACE,aACA,6DACAC,EAAyBhE,EAASyD,EAAU,IAEpCQ,EAAQL,EAAQ,CAAEzE,WAAAA,KAE5B4E,EACE,aAAa,kCACqBH,EAAM,6BACxCI,EAAyBhE,EAASyD,EAAU,GAGlD,CAEA,GAAW,MAAPE,GAAiC,MAAnB3D,EAAQC,EAAI,GAE5B,QADAA,CAGJ,CAGA8D,EACE,aACA,kDACAC,EAAyBhE,EAASyD,EAAU,GAEhD,CASA,SAASS,EAAoBlE,EAASC,EAAGkE,GACvC,GAAInE,EAAQO,OAASN,EAAI,GAAwB,MAAnBD,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,GAAY,CAE9E,IAAKA,GAAK,EAAGA,EAAID,EAAQO,OAAQN,IAC/B,GAAmB,MAAfD,EAAQC,IAAiC,MAAnBD,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,GAAY,CAC1EA,GAAK,EACL,KACF,CAEF,GAAmB,MAAfD,EAAQC,GACV,MAAM,IAAIC,MAAM,uCAEpB,MAAO,GACLF,EAAQO,OAASN,EAAI,GACF,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,GAIZA,EAAIkE,EAAiBpE,gBAAgBC,EAASC,EAAI,OAC7C,MACLD,EAAQO,OAASN,EAAI,GACF,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IAeZ,MAAM,IAAIC,MAAM,yCAZhB,IAAKD,GAAK,EAAGA,EAAID,EAAQO,OAAQN,IAC/B,GAAmB,MAAfD,EAAQC,IAAiC,MAAnBD,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,GAAY,CAC1EA,GAAK,EACL,KACF,CAEF,GAAmB,MAAfD,EAAQC,GACV,MAAM,IAAIC,MAAM,0CAMpB,CAEA,OAAOD,CACT,CAEA,IAAMmE,EAAc,IACdC,EAAc,IAOpB,SAASC,EAAiBtE,EAASC,GAIjC,IAHA,IAAIsE,EAAU,GACVlG,EAAY,GACZmG,GAAY,EACTvE,EAAID,EAAQO,OAAQN,IAAK,CAC9B,GAAID,EAAQC,KAAOmE,GAAepE,EAAQC,KAAOoE,EAC7B,KAAdhG,EACFA,EAAY2B,EAAQC,GACX5B,IAAc2B,EAAQC,KAG/B5B,EAAY,SAET,GAAmB,MAAf2B,EAAQC,IACC,KAAd5B,EAAkB,CACpBmG,GAAY,EACZ,KACF,CAEFD,GAAWvE,EAAQC,EACrB,CACA,MAAkB,KAAd5B,GAGG,CAAEL,MAAOuG,EAASlC,MAAOpC,EAAGuE,UAAAA,EACrC,CAEA,IAAMC,EAAoB,IAAI9F,OAAO,0DAA2D,KAEhG,SAAS+F,EAAwBH,EAAS5E,EAASR,GAIjD,IAHA,IAAMwF,EC/WD,SAAuBC,EAAQC,GAGpC,IAFA,IAAMF,EAAU,GACZG,EAAQD,EAAME,KAAKH,GAChBE,GAAO,CACZ,IAAME,EAAa,GACnBA,EAAWC,WAAaJ,EAAMK,UAAYJ,EAAM,GAAGvE,OAEnD,IADA,IAAM4E,EAAML,EAAMvE,OACT8B,EAAQ,EAAGA,EAAQ8C,EAAK9C,IAC/B2C,EAAWI,KAAKN,EAAMzC,IAExBsC,EAAQS,KAAKJ,GACbF,EAAQD,EAAME,KAAKH,EACrB,CACA,OAAOD,CACT,CDiWkBU,CAAcd,EAASE,GACjCa,EAAY,CAAC,EAEVrF,EAAI,EAAGA,EAAI0E,EAAQpE,OAAQN,IAAK,CACvC,GAA6B,IAAzB0E,EAAQ1E,GAAG,GAAGM,OAChB,MAAO,CAAEgF,IAAK,CAAE1C,KAAM,cAAe2C,IAAK,cAAgBb,EAAQ1E,GAAG,GAAK,8BAA+B6C,KAAM2C,EAAqBd,EAAQ1E,MACvI,QAAsByF,IAAlBf,EAAQ1E,GAAG,SAAsCyF,IAAlBf,EAAQ1E,GAAG,GACnD,MAAO,CAAEsF,IAAK,CAAE1C,KAAM,cAAe2C,IAAK,cAAgBb,EAAQ1E,GAAG,GAAK,sBAAuB6C,KAAM2C,EAAqBd,EAAQ1E,MAC/H,QAAsByF,IAAlBf,EAAQ1E,GAAG,KAAqBN,EAAQyD,uBACjD,MAAO,CAAEmC,IAAK,CAAE1C,KAAM,cAAe2C,IAAK,sBAAwBb,EAAQ1E,GAAG,GAAK,oBAAqB6C,KAAM2C,EAAqBd,EAAQ1E,MAG5I,IAAM0F,EAAWhB,EAAQ1E,GAAG,GAI5B,IAAK2F,EAAcD,EAAUxG,GAC3B,MAAO,CAAEoG,IAAK,CAAE1C,KAAM,cAAe2C,IAAK,cAAgBG,EAAW,wBAAyB7C,KAAM2C,EAAqBd,EAAQ1E,MAInI,GAAI0F,EAASE,WAAW,WAA+B,KAAlBlB,EAAQ1E,GAAG,IAA4B,QAAfd,EAC3D,MAAO,CACLoG,IAAK,CACH1C,KAAM,cACN2C,IAAI,sCAAuCG,EAAQ,8CACnD7C,KAAM2C,EAAqBd,EAAQ1E,MAKzC,GAAK5C,OAAOM,UAAUC,eAAeC,KAAKyH,EAAWK,GAGnD,MAAO,CAAEJ,IAAK,CAAE1C,KAAM,cAAe2C,IAAK,cAAgBG,EAAW,iBAAkB7C,KAAM2C,EAAqBd,EAAQ1E,MAF1HqF,EAAUK,GAAY,CAI1B,CAEA,OAAO,CACT,CAeA,SAASG,EAAkB9F,EAASC,GAElC,GAAmB,MAAfD,IADJC,GACwB,OAAQ,EAChC,GAAmB,MAAfD,EAAQC,GAEV,OAlBJ,SAAiCD,EAASC,GACxC,IAAI8F,EAAK,KAKT,IAJmB,MAAf/F,EAAQC,KACVA,IACA8F,EAAK,cAEA9F,EAAID,EAAQO,OAAQN,IAAK,CAC9B,GAAmB,MAAfD,EAAQC,GAAY,OAAOA,EAC/B,IAAKD,EAAQC,GAAG6E,MAAMiB,GAAK,KAC7B,CACA,OAAQ,CACV,CAOWC,CAAwBhG,IAD/BC,GAIF,IADA,IAAIgG,EAAQ,EACLhG,EAAID,EAAQO,OAAQN,IAAKgG,IAC9B,KAAIjG,EAAQC,GAAG6E,MAAM,OAASmB,EAAQ,IAAtC,CACA,GAAmB,MAAfjG,EAAQC,GAAY,MACxB,OAAQ,CAF0C,CAIpD,OAAOA,CACT,CAEA,SAAS8D,EAAWlB,EAAMD,EAASsD,GACjC,MAAM,IAAIxD,EAAgBE,EAASC,EAAMqD,EAAWpD,MAAQoD,EAAYA,EAAWnD,IACrF,CAUA,SAAS6C,EAAcxG,EAAKD,GAC1B,YADoC,IAAVA,IAAAA,EAAa,OHvTpBN,EAACO,GAAOD,aAAa,OAAU,CAAC,IACnDD,EAAWC,GAAYN,MAAMQ,KAAKD,GGuT3BP,CAAMO,EAAK,CAAED,WAAAA,GACtB,CAEA,SAAS6E,EAAyBhE,EAASqC,GACzC,IAAM8D,EAAQnG,EAAQkB,UAAU,EAAGmB,GAAO+D,MAAM,SAChD,MAAO,CACLtD,KAAMqD,EAAM5F,OACZwC,IAAKoD,EAAMA,EAAM5F,OAAS,GAAGA,OAAS,EAE1C,CAEA,SAASkF,EAAqBX,GAC5B,OAAOA,EAAMG,WAAaH,EAAM,GAAGvE,MACrC,CE/cA,MAAM8F,EAAgB,gLAGhBC,EAAY,IAAI3H,OAAO,KADG0H,EAAgB,KAD/BA,EAEY,mDAEtB,SAAShB,EAAcT,EAAQC,GACpC,MAAMF,EAAU,GAChB,IAAIG,EAAQD,EAAME,KAAKH,GACvB,KAAOE,GAAO,CACZ,MAAME,EAAa,GACnBA,EAAWC,WAAaJ,EAAMK,UAAYJ,EAAM,GAAGvE,OACnD,MAAM4E,EAAML,EAAMvE,OAClB,IAAK,IAAI8B,EAAQ,EAAGA,EAAQ8C,EAAK9C,IAC/B2C,EAAWI,KAAKN,EAAMzC,IAExBsC,EAAQS,KAAKJ,GACbF,EAAQD,EAAME,KAAKH,EACrB,CACA,OAAOD,CACT,CAEO,MAAM4B,EAAS,SAAU3B,GAE9B,QAAQ,MADM0B,EAAUvB,KAAKH,GAE/B,EAqBa4B,EAA2B,CAItC,iBACA,WACA,UACA,mBACA,mBACA,mBACA,oBAGWC,EAAqB,CAAC,YAAa,cAAe,aCzDzDC,EAA8BhI,GAC9B8H,EAAyBrE,SAASzD,GAC7B,KAAOA,EAETA,EAIIY,EAAiB,CAC5BqH,eAAe,EACfC,oBAAqB,KACrBC,qBAAqB,EACrBC,aAAc,QACdC,kBAAkB,EAClBC,gBAAgB,EAChB5D,wBAAwB,EAExB6D,eAAe,EACfC,qBAAqB,EACrBC,YAAY,EACZC,eAAe,EACfC,mBAAoB,CAClBC,KAAK,EACLC,cAAc,EACdC,WAAW,GAEbC,kBAAmB,SAAUC,EAASC,GACpC,OAAOA,CACT,EACAC,wBAAyB,SAAUjC,EAAUgC,GAC3C,OAAOA,CACT,EACAE,UAAW,GACXC,sBAAsB,EACtBC,QAASA,KAAM,EACfC,iBAAiB,EACjB3E,aAAc,GACd4E,iBAAiB,EACjBC,cAAc,EACdC,cAAe,KACfC,mBAAmB,EACnBC,cAAc,EACdC,kBAAkB,EAClBC,wBAAwB,EACxBC,UAAW,SAAUd,EAASe,EAAOC,GACnC,OAAOhB,CACT,EAEAiB,iBAAiB,EACjBC,cAAe,IACfC,qBAAqB,EACrBJ,OAAO,EACPK,oBAAqBpC,GAUvB,SAASqC,EAAqBC,EAAcC,GAC1C,GAA4B,iBAAjBD,EACT,OAGF,MAAME,EAAaF,EAAalF,cAChC,GAAI0C,EAAyB2C,KAAKC,GAAaF,IAAeE,EAAUtF,eACtE,MAAM,IAAI5D,MACR,sBAAsB+I,OAAgBD,4EAI1C,GAAIvC,EAAmB0C,KAAKC,GAAaF,IAAeE,EAAUtF,eAChE,MAAM,IAAI5D,MACR,sBAAsB+I,OAAgBD,2EAG5C,CAOA,SAASK,EAAyBrL,EAAOkK,GAEvC,MAAqB,kBAAVlK,EACF,CACLsL,QAAStL,EACTyB,cAAe,IACf8J,kBAAmB,IACnBC,mBAAoBhK,IACpBiK,kBAAmB,IACnBlK,eAAgB,IAChBmK,YAAa,KACbC,UAAW,KACXC,UAAW,OAKM,iBAAV5L,GAAgC,OAAVA,EACxB,CACLsL,SAA2B,IAAlBtL,EAAMsL,QACf7J,cAAeoK,KAAKC,IAAI,EAAG9L,EAAMyB,eAAiB,KAClD8J,kBAAmBM,KAAKC,IAAI,EAAG9L,EAAMuL,mBAAqB,KAC1DC,mBAAoBK,KAAKC,IAAI,EAAG9L,EAAMwL,oBAAsBhK,KAC5DiK,kBAAmBI,KAAKC,IAAI,EAAG9L,EAAMyL,mBAAqB,KAC1DlK,eAAgBsK,KAAKC,IAAI,EAAG9L,EAAMuB,gBAAkB,KACpDmK,YAAa1L,EAAM0L,aAAe,KAClCC,UAAW3L,EAAM2L,WAAa,KAC9BC,UAAW5L,EAAM4L,WAAa,OAK3BP,GAAyB,EAClC,CAEO,MAAMU,EAAe,SAAUpK,GACpC,MAAMqK,EAAQ3M,OAAOuC,OAAO,CAAC,EAAGN,EAAgBK,GAG1CsK,EAAsB,CAC1B,CAAEjM,MAAOgM,EAAMpD,oBAAqBlI,KAAM,uBAC1C,CAAEV,MAAOgM,EAAMnD,oBAAqBnI,KAAM,uBAC1C,CAAEV,MAAOgM,EAAMlD,aAAcpI,KAAM,gBACnC,CAAEV,MAAOgM,EAAM5C,cAAe1I,KAAM,iBACpC,CAAEV,MAAOgM,EAAMhC,gBAAiBtJ,KAAM,oBAGxC,IAAK,MAAM,MAAEV,EAAK,KAAEU,KAAUuL,EACxBjM,GACF+K,EAAqB/K,EAAOU,GAuBhC,OAnBkC,OAA9BsL,EAAMlB,sBACRkB,EAAMlB,oBAAsBpC,GAI9BsD,EAAM/B,gBAAkBoB,EAAyBW,EAAM/B,gBAAiB+B,EAAM9B,cAC9E8B,EAAME,gBAAkB,IAAIC,IAAIH,EAAM3G,cAElC2G,EAAMnC,WAAauC,MAAMrC,QAAQiC,EAAMnC,aACzCmC,EAAMnC,UAAYmC,EAAMnC,UAAUwC,IAAIC,GAChB,iBAATA,GAAqBA,EAAKzE,WAAW,MAGvC,KAAOyE,EAAKpJ,UAAU,GAExBoJ,IAIJN,CACT,EChKA,IAAIO,EAGFA,EADoB,mBAAXzM,OACS,gBAEAA,OAAO,qBAGZ,MAAM0M,EACnBvH,WAAAA,CAAYwH,GACVzN,KAAKyN,QAAUA,EACfzN,KAAK0N,MAAQ,GACb1N,KAAK,MAAQK,OAAOsN,OAAO,KAC7B,CACAC,GAAAA,CAAIzN,EAAKwK,GAEK,cAARxK,IAAqBA,EAAM,cAC/BH,KAAK0N,MAAMtF,KAAK,CAAE,CAACjI,GAAMwK,GAC3B,CACAkD,QAAAA,CAASP,EAAMrF,GACQ,cAAjBqF,EAAKG,UAAyBH,EAAKG,QAAU,cAC7CH,EAAK,OAASjN,OAAOyN,KAAKR,EAAK,OAAO/J,OAAS,EACjDvD,KAAK0N,MAAMtF,KAAK,CAAE,CAACkF,EAAKG,SAAUH,EAAKI,MAAO,KAAQJ,EAAK,QAE3DtN,KAAK0N,MAAMtF,KAAK,CAAE,CAACkF,EAAKG,SAAUH,EAAKI,aAGtBhF,IAAfT,IAGFjI,KAAK0N,MAAM1N,KAAK0N,MAAMnK,OAAS,GAAGgK,GAAmB,CAAEtF,cAE3D,CAEA,wBAAO8F,GACL,OAAOR,CACT,ECpCa,MAAMS,EACjB/H,WAAAA,CAAYtD,GACR3C,KAAK6C,uBAAyBF,EAC9B3C,KAAK2C,QAAUA,CACnB,CAEAsL,WAAAA,CAAYjL,EAASC,GACjB,MAAMiL,EAAW7N,OAAOsN,OAAO,MAC/B,IAAIrK,EAAc,EAElB,GAAuB,MAAnBN,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,GAgEZ,MAAM,IAAIC,MAAM,kCAhEQ,CACxBD,GAAQ,EACR,IAAIE,EAAqB,EACrBC,GAAU,EAAOC,GAAU,EAC3B8K,EAAM,GACV,KAAOlL,EAAID,EAAQO,OAAQN,IACvB,GAAmB,MAAfD,EAAQC,IAAeI,EAoCpB,GAAmB,MAAfL,EAAQC,IASf,GARII,EACuB,MAAnBL,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,KACtCI,GAAU,EACVF,KAGJA,IAEuB,IAAvBA,EACA,UAEkB,MAAfH,EAAQC,GACfG,GAAU,EAEV+K,GAAOnL,EAAQC,OAnDiB,CAChC,GAAIG,GAAWI,EAAOR,EAAS,UAAWC,GAAI,CAE1C,IAAIgB,EAAY0G,EAEhB,GAHA1H,GAAK,GAEJgB,EAAY0G,EAAK1H,GAAKjD,KAAKoO,cAAcpL,EAASC,EAAI,EAAGjD,KAAK6C,wBACrC,IAAtB8H,EAAInG,QAAQ,KAAa,CACzB,IAA6B,IAAzBxE,KAAK2C,QAAQ2J,SACkB,MAA/BtM,KAAK2C,QAAQJ,gBACbe,GAAetD,KAAK2C,QAAQJ,eAC5B,MAAM,IAAIW,MACN,iBAAiBI,EAAc,+BAA+BtD,KAAK2C,QAAQJ,mBAKnF2L,EAASjK,GAAc0G,EACvBrH,GACJ,CACJ,MACK,GAAIF,GAAWI,EAAOR,EAAS,WAAYC,GAAI,CAChDA,GAAK,EACL,MAAM,MAAEoC,GAAUrF,KAAKqO,eAAerL,EAASC,EAAI,GACnDA,EAAIoC,CACR,MAAO,GAAIjC,GAAWI,EAAOR,EAAS,WAAYC,GAC9CA,GAAK,OAGF,GAAIG,GAAWI,EAAOR,EAAS,YAAaC,GAAI,CACnDA,GAAK,EACL,MAAM,MAAEoC,GAAUrF,KAAKsO,gBAAgBtL,EAASC,EAAI,EAAGjD,KAAK6C,uBAC5DI,EAAIoC,CACR,KAAO,KAAI7B,EAAOR,EAAS,MAAOC,GAC7B,MAAM,IAAIC,MAAM,mBADiBG,GAAU,CACT,CAEvCF,IACAgL,EAAM,EACV,CAkBJ,GAA2B,IAAvBhL,EACA,MAAM,IAAID,MAAM,mBAExB,CAGA,MAAO,CAAEgL,WAAUjL,IACvB,CACAmL,aAAAA,CAAcpL,EAASC,GAcnB,MAAMgF,EAHNhF,EAAIc,EAAef,EAASC,GAI5B,KAAOA,EAAID,EAAQO,SAAW,KAAKlB,KAAKW,EAAQC,KAAsB,MAAfD,EAAQC,IAA6B,MAAfD,EAAQC,IACjFA,IAEJ,IAAIgB,EAAajB,EAAQkB,UAAU+D,EAAYhF,GAQ/C,GANAsL,EAAmBtK,GAGnBhB,EAAIc,EAAef,EAASC,IAGvBjD,KAAK6C,sBAAuB,CAC7B,GAAkD,WAA9CG,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cAC5B,MAAM,IAAIlB,MAAM,uCACb,GAAmB,MAAfF,EAAQC,GACf,MAAM,IAAIC,MAAM,uCAExB,CAGA,IAAIc,EAAc,GAIlB,IAHCf,EAAGe,GAAehE,KAAKwO,kBAAkBxL,EAASC,EAAG,WAGzB,IAAzBjD,KAAK2C,QAAQ2J,SACiB,MAA9BtM,KAAK2C,QAAQF,eACbuB,EAAYT,OAASvD,KAAK2C,QAAQF,cAClC,MAAM,IAAIS,MACN,WAAWe,YAAqBD,EAAYT,yCAAyCvD,KAAK2C,QAAQF,kBAK1G,MAAO,CAACwB,EAAYD,IADpBf,EAEJ,CAEAqL,eAAAA,CAAgBtL,EAASC,GAMrB,MAAMgF,EAJNhF,EAAIc,EAAef,EAASC,GAK5B,KAAOA,EAAID,EAAQO,SAAW,KAAKlB,KAAKW,EAAQC,KAC5CA,IAEJ,IAAIwB,EAAezB,EAAQkB,UAAU+D,EAAYhF,IAEhDjD,KAAK6C,uBAAyB0L,EAAmB9J,GAGlDxB,EAAIc,EAAef,EAASC,GAG5B,MAAMyB,EAAiB1B,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cACnD,IAAKpE,KAAK6C,uBAA4C,WAAnB6B,GAAkD,WAAnBA,EAC9D,MAAM,IAAIxB,MAAM,qCAAqCwB,MAEzDzB,GAAKyB,EAAenB,OAGpBN,EAAIc,EAAef,EAASC,GAG5B,IAAIwL,EAAmB,KACnBC,EAAmB,KAEvB,GAAuB,WAAnBhK,GACCzB,EAAGwL,GAAoBzO,KAAKwO,kBAAkBxL,EAASC,EAAG,oBAMxC,MAAfD,EAHJC,EAAIc,EAAef,EAASC,KAGa,MAAfD,EAAQC,MAC7BA,EAAGyL,GAAoB1O,KAAKwO,kBAAkBxL,EAASC,EAAG,0BAE5D,GAAuB,WAAnByB,KAENzB,EAAGyL,GAAoB1O,KAAKwO,kBAAkBxL,EAASC,EAAG,qBAEtDjD,KAAK6C,wBAA0B6L,GAChC,MAAM,IAAIxL,MAAM,2DAIxB,MAAO,CAAEuB,eAAcgK,mBAAkBC,mBAAkBrJ,QAASpC,EACxE,CAEAuL,iBAAAA,CAAkBxL,EAASC,EAAGuC,GAC1B,IAAImJ,EAAgB,GACpB,MAAMtN,EAAY2B,EAAQC,GAC1B,GAAkB,MAAd5B,GAAmC,MAAdA,EACrB,MAAM,IAAI6B,MAAM,kCAAkC7B,MAItD,MAAM4G,IAFNhF,EAGA,KAAOA,EAAID,EAAQO,QAAUP,EAAQC,KAAO5B,GACxC4B,IAIJ,GAFA0L,EAAgB3L,EAAQkB,UAAU+D,EAAYhF,GAE1CD,EAAQC,KAAO5B,EACf,MAAM,IAAI6B,MAAM,gBAAgBsC,WAGpC,MAAO,GADPvC,EACW0L,EACf,CAEAN,cAAAA,CAAerL,EAASC,GAWpB,MAAMgF,EAHNhF,EAAIc,EAAef,EAASC,GAI5B,KAAOA,EAAID,EAAQO,SAAW,KAAKlB,KAAKW,EAAQC,KAC5CA,IAEJ,IAAI0B,EAAc3B,EAAQkB,UAAU+D,EAAYhF,GAGhD,IAAKjD,KAAK6C,wBAA0B0G,EAAO5E,GACvC,MAAM,IAAIzB,MAAM,0BAA0ByB,MAK9C,IAAIiK,EAAe,GAEnB,GAAmB,MAAf5L,EAHJC,EAAIc,EAAef,EAASC,KAGFO,EAAOR,EAAS,OAAQC,GAAIA,GAAK,OACtD,GAAmB,MAAfD,EAAQC,IAAcO,EAAOR,EAAS,KAAMC,GAAIA,GAAK,OACzD,GAAmB,MAAfD,EAAQC,GAAY,CAIzB,MAAMgF,IAHNhF,EAIA,KAAOA,EAAID,EAAQO,QAAyB,MAAfP,EAAQC,IACjCA,IAIJ,GAFA2L,EAAe5L,EAAQkB,UAAU+D,EAAYhF,GAE1B,MAAfD,EAAQC,GACR,MAAM,IAAIC,MAAM,6BAGxB,MAAO,IAAKlD,KAAK6C,sBACb,MAAM,IAAIK,MAAM,sCAAsCF,EAAQC,OAGlE,MAAO,CACH0B,cACAiK,aAAcA,EAAa5J,OAC3BK,MAAOpC,EAEf,CAEA4L,cAAAA,CAAe7L,EAASC,GAKpB,IAAIgF,EAHJhF,EAAIc,EAAef,EAASC,GAI5B,KAAOA,EAAID,EAAQO,SAAW,KAAKlB,KAAKW,EAAQC,KAC5CA,IAEJ,IAAI0B,EAAc3B,EAAQkB,UAAU+D,EAAYhF,GAUhD,IAPAsL,EAAmB5J,GAMnBsD,EAHAhF,EAAIc,EAAef,EAASC,GAIrBA,EAAID,EAAQO,SAAW,KAAKlB,KAAKW,EAAQC,KAC5CA,IAEJ,IAAI6L,EAAgB9L,EAAQkB,UAAU+D,EAAYhF,GAGlD,IAAKsL,EAAmBO,GACpB,MAAM,IAAI5L,MAAM,4BAA4B4L,MAIhD7L,EAAIc,EAAef,EAASC,GAG5B,IAAIiC,EAAgB,GACpB,GAAkD,aAA9ClC,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cAA8B,CAQ1D,GAPAc,EAAgB,WAOG,MAAflC,EAHJC,EAAIc,EAAef,EAHnBC,GAAK,IAOD,MAAM,IAAIC,MAAM,wBAAwBF,EAAQC,OAEpDA,IAGA,IAAI8L,EAAmB,GACvB,KAAO9L,EAAID,EAAQO,QAAyB,MAAfP,EAAQC,IAAY,CAG7C,MAAMgF,EAAahF,EACnB,KAAOA,EAAID,EAAQO,QAAyB,MAAfP,EAAQC,IAA6B,MAAfD,EAAQC,IACvDA,IAEJ,IAAI+L,EAAWhM,EAAQkB,UAAU+D,EAAYhF,GAI7C,GADA+L,EAAWA,EAAShK,QACfuJ,EAAmBS,GACpB,MAAM,IAAI9L,MAAM,2BAA2B8L,MAG/CD,EAAiB3G,KAAK4G,GAGH,MAAfhM,EAAQC,KACRA,IACAA,EAAIc,EAAef,EAASC,GAEpC,CAEA,GAAmB,MAAfD,EAAQC,GACR,MAAM,IAAIC,MAAM,kCAEpBD,IAGAiC,GAAiB,KAAO6J,EAAiBE,KAAK,KAAO,GACzD,KAAO,CAEH,MAAMhH,EAAahF,EACnB,KAAOA,EAAID,EAAQO,SAAW,KAAKlB,KAAKW,EAAQC,KAC5CA,IAEJiC,GAAiBlC,EAAQkB,UAAU+D,EAAYhF,GAG/C,MAAMiM,EAAa,CAAC,QAAS,KAAM,QAAS,SAAU,SAAU,WAAY,UAAW,YACvF,IAAKlP,KAAK6C,wBAA0BqM,EAAW/J,SAASD,EAAcd,eAClE,MAAM,IAAIlB,MAAM,4BAA4BgC,KAEpD,CAGAjC,EAAIc,EAAef,EAASC,GAG5B,IAAIkM,EAAe,GAWnB,MAVkD,cAA9CnM,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,eAC5B+K,EAAe,YACflM,GAAK,GACgD,aAA9CD,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,eACnC+K,EAAe,WACflM,GAAK,IAEJA,EAAGkM,GAAgBnP,KAAKwO,kBAAkBxL,EAASC,EAAG,WAGpD,CACH0B,cACAmK,gBACA5J,gBACAiK,eACA9J,MAAOpC,EAEf,EAKJ,MAAMc,EAAiBA,CAACqB,EAAMC,KAC1B,KAAOA,EAAQD,EAAK7B,QAAU,KAAKlB,KAAK+C,EAAKC,KACzCA,IAEJ,OAAOA,GAKX,SAAS7B,EAAO4B,EAAME,EAAKrC,GACvB,IAAK,IAAIsC,EAAI,EAAGA,EAAID,EAAI/B,OAAQgC,IAC5B,GAAID,EAAIC,KAAOH,EAAKnC,EAAIsC,EAAI,GAAI,OAAO,EAE3C,OAAO,CACX,CAEA,SAASgJ,EAAmB7M,GACxB,GAAI6H,EAAO7H,GACP,OAAOA,EAEP,MAAM,IAAIwB,MAAM,uBAAuBxB,IAC/C,CCtZA,MAAM0N,EAAW,wBACXC,EAAW,qCAKXC,GAAW,CACbhF,KAAK,EAELC,cAAc,EACdgF,aAAc,IACd/E,WAAW,EAEXgF,SAAU,YAuEd,MAAMC,GAAgB,0CC/Df,MAAMC,GAIXzJ,WAAAA,CAAY0J,GACV3P,KAAK4P,SAAWD,CAClB,CAMA,aAAIE,GACF,OAAO7P,KAAK4P,SAASC,SACvB,CAMAC,aAAAA,GACE,MAAMC,EAAO/P,KAAK4P,SAASG,KAC3B,OAAOA,EAAKxM,OAAS,EAAIwM,EAAKA,EAAKxM,OAAS,GAAGyM,SAAMtH,CACvD,CAMAuH,mBAAAA,GACE,MAAMF,EAAO/P,KAAK4P,SAASG,KAC3B,OAAOA,EAAKxM,OAAS,EAAIwM,EAAKA,EAAKxM,OAAS,GAAG2M,eAAYxH,CAC7D,CAOAyH,YAAAA,CAAaxH,GACX,MAAMoH,EAAO/P,KAAK4P,SAASG,KAC3B,GAAoB,IAAhBA,EAAKxM,OACT,OAAOwM,EAAKA,EAAKxM,OAAS,GAAG6M,SAASzH,EACxC,CAOA0H,OAAAA,CAAQ1H,GACN,MAAMoH,EAAO/P,KAAK4P,SAASG,KAC3B,GAAoB,IAAhBA,EAAKxM,OAAc,OAAO,EAC9B,MAAM+M,EAAUP,EAAKA,EAAKxM,OAAS,GACnC,YAA0BmF,IAAnB4H,EAAQF,QAAwBzH,KAAY2H,EAAQF,MAC7D,CAMAG,WAAAA,GACE,MAAMR,EAAO/P,KAAK4P,SAASG,KAC3B,OAAoB,IAAhBA,EAAKxM,QAAsB,EACxBwM,EAAKA,EAAKxM,OAAS,GAAGiN,UAAY,CAC3C,CAMAC,UAAAA,GACE,MAAMV,EAAO/P,KAAK4P,SAASG,KAC3B,OAAoB,IAAhBA,EAAKxM,QAAsB,EACxBwM,EAAKA,EAAKxM,OAAS,GAAGmN,SAAW,CAC1C,CAOAC,QAAAA,GACE,OAAO3Q,KAAKuQ,aACd,CAMAK,QAAAA,GACE,OAAO5Q,KAAK4P,SAASG,KAAKxM,MAC5B,CAQAsN,QAAAA,CAAShB,EAAWiB,GAAmB,GACrC,OAAO9Q,KAAK4P,SAASiB,SAAShB,EAAWiB,EAC3C,CAMAC,OAAAA,GACE,OAAO/Q,KAAK4P,SAASG,KAAK1C,IAAI2D,GAAKA,EAAEhB,IACvC,CAOArI,OAAAA,CAAQsJ,GACN,OAAOjR,KAAK4P,SAASjI,QAAQsJ,EAC/B,CAOAC,UAAAA,CAAWC,GACT,OAAOA,EAAQD,WAAWlR,KAAK4P,SACjC,EAsBa,MAAMwB,GAMnBnL,WAAAA,CAAYtD,EAAU,CAAC,GACrB3C,KAAK6P,UAAYlN,EAAQkN,WAAa,IACtC7P,KAAK+P,KAAO,GACZ/P,KAAKqR,cAAgB,GAIrBrR,KAAKsR,iBAAmB,KACxBtR,KAAKuR,MAAQ,IAAI7B,GAAY1P,KAC/B,CAQAoI,IAAAA,CAAKsC,EAAS8G,EAAa,KAAMtB,EAAY,MAC3ClQ,KAAKsR,iBAAmB,KAGpBtR,KAAK+P,KAAKxM,OAAS,IACrBvD,KAAK+P,KAAK/P,KAAK+P,KAAKxM,OAAS,GAAG6M,YAAS1H,GAI3C,MAAM+I,EAAezR,KAAK+P,KAAKxM,OAC1BvD,KAAKqR,cAAcI,KACtBzR,KAAKqR,cAAcI,GAAgB,IAAIC,KAGzC,MAAMC,EAAW3R,KAAKqR,cAAcI,GAG9BG,EAAa1B,EAAY,GAAGA,KAAaxF,IAAYA,EAGrDgG,EAAUiB,EAASnR,IAAIoR,IAAe,EAG5C,IAAIpB,EAAW,EACf,IAAK,MAAMvH,KAAS0I,EAASvB,SAC3BI,GAAYvH,EAId0I,EAASE,IAAID,EAAYlB,EAAU,GAGnC,MAAMpD,EAAO,CACX0C,IAAKtF,EACL8F,SAAUA,EACVE,QAASA,GAGPR,UACF5C,EAAK4C,UAAYA,GAGfsB,UACFlE,EAAK8C,OAASoB,GAGhBxR,KAAK+P,KAAK3H,KAAKkF,EACjB,CAMAwE,GAAAA,GACE,GAAyB,IAArB9R,KAAK+P,KAAKxM,OAAc,OAC5BvD,KAAKsR,iBAAmB,KAExB,MAAMhE,EAAOtN,KAAK+P,KAAK+B,MAMvB,OAJI9R,KAAKqR,cAAc9N,OAASvD,KAAK+P,KAAKxM,OAAS,IACjDvD,KAAKqR,cAAc9N,OAASvD,KAAK+P,KAAKxM,OAAS,GAG1C+J,CACT,CAOAyE,aAAAA,CAAcP,GACZ,GAAIxR,KAAK+P,KAAKxM,OAAS,EAAG,CACxB,MAAM+M,EAAUtQ,KAAK+P,KAAK/P,KAAK+P,KAAKxM,OAAS,GACzCiO,UACFlB,EAAQF,OAASoB,EAErB,CACF,CAMA1B,aAAAA,GACE,OAAO9P,KAAK+P,KAAKxM,OAAS,EAAIvD,KAAK+P,KAAK/P,KAAK+P,KAAKxM,OAAS,GAAGyM,SAAMtH,CACtE,CAMAuH,mBAAAA,GACE,OAAOjQ,KAAK+P,KAAKxM,OAAS,EAAIvD,KAAK+P,KAAK/P,KAAK+P,KAAKxM,OAAS,GAAG2M,eAAYxH,CAC5E,CAOAyH,YAAAA,CAAaxH,GACX,GAAyB,IAArB3I,KAAK+P,KAAKxM,OACd,OAAOvD,KAAK+P,KAAK/P,KAAK+P,KAAKxM,OAAS,GAAG6M,SAASzH,EAClD,CAOA0H,OAAAA,CAAQ1H,GACN,GAAyB,IAArB3I,KAAK+P,KAAKxM,OAAc,OAAO,EACnC,MAAM+M,EAAUtQ,KAAK+P,KAAK/P,KAAK+P,KAAKxM,OAAS,GAC7C,YAA0BmF,IAAnB4H,EAAQF,QAAwBzH,KAAY2H,EAAQF,MAC7D,CAMAG,WAAAA,GACE,OAAyB,IAArBvQ,KAAK+P,KAAKxM,QAAsB,EAC7BvD,KAAK+P,KAAK/P,KAAK+P,KAAKxM,OAAS,GAAGiN,UAAY,CACrD,CAMAC,UAAAA,GACE,OAAyB,IAArBzQ,KAAK+P,KAAKxM,QAAsB,EAC7BvD,KAAK+P,KAAK/P,KAAK+P,KAAKxM,OAAS,GAAGmN,SAAW,CACpD,CAOAC,QAAAA,GACE,OAAO3Q,KAAKuQ,aACd,CAMAK,QAAAA,GACE,OAAO5Q,KAAK+P,KAAKxM,MACnB,CAQAsN,QAAAA,CAAShB,EAAWiB,GAAmB,GACrC,MAAMkB,EAAMnC,GAAa7P,KAAK6P,UAG9B,GAFmBmC,IAAQhS,KAAK6P,YAAkC,IAArBiB,EAE9B,CACb,GAA8B,OAA1B9Q,KAAKsR,iBACP,OAAOtR,KAAKsR,iBAEd,MAAMW,EAASjS,KAAK+P,KAAK1C,IAAI2D,GAC1BA,EAAEd,UAAa,GAAGc,EAAEd,aAAac,EAAEhB,MAAQgB,EAAEhB,KAC9Cf,KAAK+C,GAEP,OADAhS,KAAKsR,iBAAmBW,EACjBA,CACT,CAEA,OAAOjS,KAAK+P,KAAK1C,IAAI2D,GAClBF,GAAoBE,EAAEd,UAAa,GAAGc,EAAEd,aAAac,EAAEhB,MAAQgB,EAAEhB,KAClEf,KAAK+C,EACT,CAMAjB,OAAAA,GACE,OAAO/Q,KAAK+P,KAAK1C,IAAI2D,GAAKA,EAAEhB,IAC9B,CAKAkC,KAAAA,GACElS,KAAKsR,iBAAmB,KACxBtR,KAAK+P,KAAO,GACZ/P,KAAKqR,cAAgB,EACvB,CAOA1J,OAAAA,CAAQsJ,GACN,MAAMkB,EAAWlB,EAAWkB,SAE5B,OAAwB,IAApBA,EAAS5O,SAIT0N,EAAWmB,kBACNpS,KAAKqS,uBAAuBF,GAG9BnS,KAAKsS,aAAaH,GAC3B,CAKAG,YAAAA,CAAaH,GACX,GAAInS,KAAK+P,KAAKxM,SAAW4O,EAAS5O,OAChC,OAAO,EAGT,IAAK,IAAIN,EAAI,EAAGA,EAAIkP,EAAS5O,OAAQN,IACnC,IAAKjD,KAAKuS,cAAcJ,EAASlP,GAAIjD,KAAK+P,KAAK9M,GAAIA,IAAMjD,KAAK+P,KAAKxM,OAAS,GAC1E,OAAO,EAIX,OAAO,CACT,CAKA8O,sBAAAA,CAAuBF,GACrB,IAAIK,EAAUxS,KAAK+P,KAAKxM,OAAS,EAC7BkP,EAASN,EAAS5O,OAAS,EAE/B,KAAOkP,GAAU,GAAKD,GAAW,GAAG,CAClC,MAAME,EAAUP,EAASM,GAEzB,GAAqB,kBAAjBC,EAAQlN,KAA0B,CAGpC,GAFAiN,IAEIA,EAAS,EACX,OAAO,EAGT,MAAME,EAAUR,EAASM,GACzB,IAAIG,GAAQ,EAEZ,IAAK,IAAI3P,EAAIuP,EAASvP,GAAK,EAAGA,IAC5B,GAAIjD,KAAKuS,cAAcI,EAAS3S,KAAK+P,KAAK9M,GAAIA,IAAMjD,KAAK+P,KAAKxM,OAAS,GAAI,CACzEiP,EAAUvP,EAAI,EACdwP,IACAG,GAAQ,EACR,KACF,CAGF,IAAKA,EACH,OAAO,CAEX,KAAO,CACL,IAAK5S,KAAKuS,cAAcG,EAAS1S,KAAK+P,KAAKyC,GAAUA,IAAYxS,KAAK+P,KAAKxM,OAAS,GAClF,OAAO,EAETiP,IACAC,GACF,CACF,CAEA,OAAOA,EAAS,CAClB,CAKAF,aAAAA,CAAcG,EAASpF,EAAMuF,GAC3B,GAAoB,MAAhBH,EAAQ1C,KAAe0C,EAAQ1C,MAAQ1C,EAAK0C,IAC9C,OAAO,EAGT,QAA0BtH,IAAtBgK,EAAQxC,WACgB,MAAtBwC,EAAQxC,WAAqBwC,EAAQxC,YAAc5C,EAAK4C,UAC1D,OAAO,EAIX,QAAyBxH,IAArBgK,EAAQ/J,SAAwB,CAClC,IAAKkK,EACH,OAAO,EAGT,IAAKvF,EAAK8C,UAAYsC,EAAQ/J,YAAY2E,EAAK8C,QAC7C,OAAO,EAGT,QAA0B1H,IAAtBgK,EAAQI,WACNC,OAAOzF,EAAK8C,OAAOsC,EAAQ/J,aAAeoK,OAAOL,EAAQI,WAC3D,OAAO,CAGb,CAEA,QAAyBpK,IAArBgK,EAAQlC,SAAwB,CAClC,IAAKqC,EACH,OAAO,EAGT,MAAMnC,EAAUpD,EAAKoD,SAAW,EAEhC,GAAyB,UAArBgC,EAAQlC,UAAoC,IAAZE,EAClC,OAAO,EACF,GAAyB,QAArBgC,EAAQlC,UAAsBE,EAAU,GAAM,EACvD,OAAO,EACF,GAAyB,SAArBgC,EAAQlC,UAAuBE,EAAU,GAAM,EACxD,OAAO,EACF,GAAyB,QAArBgC,EAAQlC,UAAsBE,IAAYgC,EAAQM,cAC3D,OAAO,CAEX,CAEA,OAAO,CACT,CAOA9B,UAAAA,CAAWC,GACT,OAAOA,EAAQD,WAAWlR,KAC5B,CAMAiT,QAAAA,GACE,MAAO,CACLlD,KAAM/P,KAAK+P,KAAK1C,IAAIC,IAAQ,IAAMA,KAClC+D,cAAerR,KAAKqR,cAAchE,IAAIA,GAAO,IAAIqE,IAAIrE,IAEzD,CAMA6F,OAAAA,CAAQD,GACNjT,KAAKsR,iBAAmB,KACxBtR,KAAK+P,KAAOkD,EAASlD,KAAK1C,IAAIC,IAAQ,IAAMA,KAC5CtN,KAAKqR,cAAgB4B,EAAS5B,cAAchE,IAAIA,GAAO,IAAIqE,IAAIrE,GACjE,CAkBA8F,QAAAA,GACE,OAAOnT,KAAKuR,KACd,EC9iBa,MAAM6B,GAOnBnN,WAAAA,CAAYoN,EAAS1Q,EAAU,CAAC,EAAGyC,GACjCpF,KAAKqT,QAAUA,EACfrT,KAAK6P,UAAYlN,EAAQkN,WAAa,IACtC7P,KAAKmS,SAAWnS,KAAKsT,OAAOD,GAC5BrT,KAAKoF,KAAOA,EAEZpF,KAAKuT,iBAAmBvT,KAAKmS,SAAShG,KAAKqH,GAAoB,kBAAbA,EAAIhO,MACtDxF,KAAKyT,uBAAyBzT,KAAKmS,SAAShG,KAAKqH,QAAwB9K,IAAjB8K,EAAI7K,UAC5D3I,KAAK0T,qBAAuB1T,KAAKmS,SAAShG,KAAKqH,QAAwB9K,IAAjB8K,EAAIhD,SAC5D,CAQA8C,MAAAA,CAAOD,GACL,MAAMlB,EAAW,GAGjB,IAAIlP,EAAI,EACJ0Q,EAAc,GAElB,KAAO1Q,EAAIoQ,EAAQ9P,QACb8P,EAAQpQ,KAAOjD,KAAK6P,UAElB5M,EAAI,EAAIoQ,EAAQ9P,QAAU8P,EAAQpQ,EAAI,KAAOjD,KAAK6P,WAEhD8D,EAAY3O,SACdmN,EAAS/J,KAAKpI,KAAK4T,cAAcD,EAAY3O,SAC7C2O,EAAc,IAGhBxB,EAAS/J,KAAK,CAAE5C,KAAM,kBACtBvC,GAAK,IAGD0Q,EAAY3O,QACdmN,EAAS/J,KAAKpI,KAAK4T,cAAcD,EAAY3O,SAE/C2O,EAAc,GACd1Q,MAGF0Q,GAAeN,EAAQpQ,GACvBA,KASJ,OAJI0Q,EAAY3O,QACdmN,EAAS/J,KAAKpI,KAAK4T,cAAcD,EAAY3O,SAGxCmN,CACT,CAQAyB,aAAAA,CAAcC,GACZ,MAAMnB,EAAU,CAAElN,KAAM,OAwBxB,IAAIsO,EAAiB,KACjBC,EAAkBF,EAEtB,MAAMG,EAAeH,EAAK/L,MAAM,8BAChC,GAAIkM,IACFD,EAAkBC,EAAa,GAAKA,EAAa,GAC7CA,EAAa,IAAI,CACnB,MAAMC,EAAUD,EAAa,GAAGE,MAAM,GAAI,GACtCD,IACFH,EAAiBG,EAErB,CAIF,IAAI/D,EAcAF,EAbAmE,EAAiBJ,EAErB,GAAIA,EAAgB5O,SAAS,MAAO,CAClC,MAAMiP,EAAUL,EAAgBvP,QAAQ,MAIxC,GAHA0L,EAAY6D,EAAgB7P,UAAU,EAAGkQ,GAASpP,OAClDmP,EAAiBJ,EAAgB7P,UAAUkQ,EAAU,GAAGpP,QAEnDkL,EACH,MAAM,IAAIhN,MAAM,iCAAiC2Q,IAErD,CAIA,IAAIQ,EAAgB,KAEpB,GAAIF,EAAehP,SAAS,KAAM,CAChC,MAAMmP,EAAaH,EAAeI,YAAY,KACxCC,EAAUL,EAAejQ,UAAU,EAAGoQ,GAAYtP,OAClDyP,EAAUN,EAAejQ,UAAUoQ,EAAa,GAAGtP,OAG/B,CAAC,QAAS,OAAQ,MAAO,QAAQG,SAASsP,IAClE,eAAepS,KAAKoS,IAGpBzE,EAAMwE,EACNH,EAAgBI,GAGhBzE,EAAMmE,CAEV,MACEnE,EAAMmE,EAGR,IAAKnE,EACH,MAAM,IAAI9M,MAAM,4BAA4B2Q,KAS9C,GANAnB,EAAQ1C,IAAMA,EACVE,IACFwC,EAAQxC,UAAYA,GAIlB4D,EACF,GAAIA,EAAe3O,SAAS,KAAM,CAChC,MAAMuP,EAAUZ,EAAetP,QAAQ,KACvCkO,EAAQ/J,SAAWmL,EAAe5P,UAAU,EAAGwQ,GAAS1P,OACxD0N,EAAQI,UAAYgB,EAAe5P,UAAUwQ,EAAU,GAAG1P,MAC5D,MACE0N,EAAQ/J,SAAWmL,EAAe9O,OAKtC,GAAIqP,EAAe,CACjB,MAAMM,EAAWN,EAAcvM,MAAM,kBACjC6M,GACFjC,EAAQlC,SAAW,MACnBkC,EAAQM,cAAgB4B,SAASD,EAAS,GAAI,KAE9CjC,EAAQlC,SAAW6D,CAEvB,CAEA,OAAO3B,CACT,CAMA,UAAInP,GACF,OAAOvD,KAAKmS,SAAS5O,MACvB,CAMA6O,eAAAA,GACE,OAAOpS,KAAKuT,gBACd,CAMAsB,qBAAAA,GACE,OAAO7U,KAAKyT,sBACd,CAMAqB,mBAAAA,GACE,OAAO9U,KAAK0T,oBACd,CAMA7C,QAAAA,GACE,OAAO7Q,KAAKqT,OACd,EC7Ma,MAAM0B,GACnB9O,WAAAA,GAEEjG,KAAKgV,eAAiB,IAAItD,IAG1B1R,KAAKiV,iBAAmB,IAAIvD,IAG5B1R,KAAKkV,eAAiB,GAGtBlV,KAAKmV,UAAY,IAAIhI,IAGrBnN,KAAKoV,SAAU,CACjB,CAcAxH,GAAAA,CAAIqD,GACF,GAAIjR,KAAKoV,QACP,MAAM,IAAIC,UACR,gFAKJ,GAAIrV,KAAKmV,UAAUG,IAAIrE,EAAWoC,SAAU,OAAOrT,KAGnD,GAFAA,KAAKmV,UAAUvH,IAAIqD,EAAWoC,SAE1BpC,EAAWmB,kBAEb,OADApS,KAAKkV,eAAe9M,KAAK6I,GAClBjR,KAGT,MAAMuV,EAAQtE,EAAW1N,OACnBiS,EAAUvE,EAAWkB,SAASlB,EAAWkB,SAAS5O,OAAS,GAC3DyM,EAAMwF,GAASxF,IAErB,GAAKA,GAAe,MAARA,EAIL,CAEL,MAAM7P,EAAM,GAAGoV,KAASvF,IACnBhQ,KAAKgV,eAAeM,IAAInV,IAAMH,KAAKgV,eAAenD,IAAI1R,EAAK,IAChEH,KAAKgV,eAAexU,IAAIL,GAAKiI,KAAK6I,EACpC,MAPOjR,KAAKiV,iBAAiBK,IAAIC,IAAQvV,KAAKiV,iBAAiBpD,IAAI0D,EAAO,IACxEvV,KAAKiV,iBAAiBzU,IAAI+U,GAAOnN,KAAK6I,GAQxC,OAAOjR,IACT,CAcAyV,MAAAA,CAAOC,GACL,IAAK,MAAMC,KAAQD,EAAa1V,KAAK4N,IAAI+H,GACzC,OAAO3V,IACT,CAQAsV,GAAAA,CAAIrE,GACF,OAAOjR,KAAKmV,UAAUG,IAAIrE,EAAWoC,QACvC,CAMA,QAAIuC,GACF,OAAO5V,KAAKmV,UAAUS,IACxB,CASAC,IAAAA,GAEE,OADA7V,KAAKoV,SAAU,EACRpV,IACT,CAMA,YAAI8V,GACF,OAAO9V,KAAKoV,OACd,CAkBAlE,UAAAA,CAAWvB,GACT,OAAmC,OAA5B3P,KAAK+V,UAAUpG,EACxB,CAkBAoG,SAAAA,CAAUpG,GACR,MAAM4F,EAAQ5F,EAAQiB,WAIhBoF,EAAW,GAAGT,KAHR5F,EAAQG,kBAIdmG,EAAcjW,KAAKgV,eAAexU,IAAIwV,GAC5C,GAAIC,EACF,IAAK,IAAIhT,EAAI,EAAGA,EAAIgT,EAAY1S,OAAQN,IACtC,GAAI0M,EAAQhI,QAAQsO,EAAYhT,IAAK,OAAOgT,EAAYhT,GAK5D,MAAMiT,EAAiBlW,KAAKiV,iBAAiBzU,IAAI+U,GACjD,GAAIW,EACF,IAAK,IAAIjT,EAAI,EAAGA,EAAIiT,EAAe3S,OAAQN,IACzC,GAAI0M,EAAQhI,QAAQuO,EAAejT,IAAK,OAAOiT,EAAejT,GAKlE,IAAK,IAAIA,EAAI,EAAGA,EAAIjD,KAAKkV,eAAe3R,OAAQN,IAC9C,GAAI0M,EAAQhI,QAAQ3H,KAAKkV,eAAejS,IAAK,OAAOjD,KAAKkV,eAAejS,GAG1E,OAAO,IACT,ECtMK,MAw+BMkT,GAAW,CACtBC,KAAM,IACNC,MAAO,IACPC,OAAQ,IACRC,IAAK,IACLC,KAAM,IACNC,OAAQ,IACRD,KAAM,IACNE,KAAM,IACNC,IAAK,IACLC,GAAI,IACJC,KAAM,KACNC,KAAM,IACNC,IAAK,IACLC,IAAK,IACLC,KAAM,IACNC,MAAO,KAuHIC,GAAM,CACjBC,IAAK,IACLC,KAAM,IACNC,GAAI,IACJC,GAAI,IACJC,KAAM,KAEKC,GAAc,CACzBC,KAAM,IACNC,KAAM,IACNC,IAAK,IACLC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,OAAQ,IACRC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,KAAM,IACNC,KAAM,IACNC,KAAM,IACNC,IAAK,IACLC,OAAQ,IACRC,OAAQ,IACRC,OAAQ,KCxoCJC,GAAgB,IAAI3L,IAAI,0BAQ9B,SAASoB,GAAmB7M,GAC1B,GAAgB,MAAZA,EAAK,GACP,MAAM,IAAIwB,MAAM,2DAA2DxB,MAE7E,IAAK,MAAMiF,KAAMjF,EACf,GAAIoX,GAAcxD,IAAI3O,GACpB,MAAM,IAAIzD,MAAM,uCAAuCyD,uBAAwBjF,MAGnF,OAAOA,CACT,CAaA,SAASqX,MAAmBC,GAC1B,MAAMC,EAAM5Y,OAAOsN,OAAO,MAC1B,IAAK,MAAMN,KAAO2L,EAChB,GAAK3L,EACL,IAAK,MAAMlN,KAAOE,OAAOyN,KAAKT,GAAM,CAClC,MAAM6L,EAAM7L,EAAIlN,GAChB,GAAmB,iBAAR+Y,EACTD,EAAI9Y,GAAO+Y,OACN,GAAIA,GAAsB,iBAARA,QAAgCxQ,IAAZwQ,EAAIvO,IAAmB,CAElE,MAAMA,EAAMuO,EAAIvO,IACG,iBAARA,IACTsO,EAAI9Y,GAAOwK,EAGf,CACF,CAEF,OAAOsO,CACT,CAMA,MAAME,GAAsB,WACtBC,GAAkB,OAClBC,GAAiB,MAuBjBC,GAAYjZ,OAAOkZ,OAAO,CAAEC,MAAO,EAAGC,MAAO,EAAGC,OAAQ,EAAGC,MAAO,IAIlEC,GAAmB,IAAIzM,IAAI,CAAC,EAAM,GAAM,KAgD/B,MAAM0M,GA4BnB5T,WAAAA,CAAYtD,EAAU,CAAC,GA9FzB,IAAyBuW,EA+FrBlZ,KAAK8Z,OAASnX,EAAQoX,OAAS,CAAC,EAChC/Z,KAAKga,oBAAsBha,KAAK8Z,OAAOtN,oBAAsB,EAC7DxM,KAAKia,mBAAqBja,KAAK8Z,OAAOrN,mBAAqB,EAC3DzM,KAAKka,WAA0C,mBAAtBvX,EAAQwX,UAA2BxX,EAAQwX,UAAYC,GAAKA,EACrFpa,KAAKqa,aAnGgBnB,EAmGclZ,KAAK8Z,OAAOQ,eAAiBnB,KAlGtDD,IAAQC,GAChBD,IAAQG,GAAuB,IAAIlM,IAAI,CAACkM,KACxCH,IAAQE,GAAwB,IAAIjM,IAAI,CAACiM,KACzChM,MAAMrC,QAAQmO,GAAa,IAAI/L,IAAI+L,GAChC,IAAI/L,IAAI,CAACgM,KAJgC,IAAIhM,IAAI,CAACgM,KAmGvDnZ,KAAKua,gBAAkB5X,EAAQ6X,iBAAkB,EAEjDxa,KAAKya,SAAW1B,GAAgB2B,GAAsB/X,EAAQgY,eAAiB,MAK/E3a,KAAK4a,aAAeva,OAAOsN,OAAO,MAIlC3N,KAAK6a,UAAYxa,OAAOsN,OAAO,MAG/B3N,KAAK8a,iBAAmB,EACxB9a,KAAK+a,gBAAkB,EAIvB/a,KAAKgb,WAAa,IAAI7N,IAAIxK,EAAQ+W,QAAUtM,MAAMrC,QAAQpI,EAAQ+W,QAAU/W,EAAQ+W,OAAS,IAE7F1Z,KAAKib,UAAY,IAAI9N,IAAIxK,EAAQ8W,OAASrM,MAAMrC,QAAQpI,EAAQ8W,OAAS9W,EAAQ8W,MAAQ,IAGzF,MAAMyB,EAnGV,SAAwBC,GACtB,IAAKA,EACH,MAAO,CAAEhZ,WAAY,EAAKiZ,QAAS9B,GAAUE,MAAO6B,UAAW/B,GAAUI,QAE3E,MAAMvX,EAAgC,MAAnBgZ,EAAIhZ,WAAqB,IAAM,EAC5CiZ,EAAU9B,GAAU6B,EAAIG,QAAUhC,GAAUE,MAC5C6B,EAAY/B,GAAU6B,EAAII,UAAYjC,GAAUI,OAGtD,MAAO,CAAEvX,aAAYiZ,UAASC,UADVxO,KAAKC,IAAIuO,EAAW/B,GAAUI,QAEpD,CAyFmB8B,CAAe7Y,EAAQwY,KACtCnb,KAAKyb,eAAiBP,EAAO/Y,WAC7BnC,KAAK0b,YAAcR,EAAOE,QAC1Bpb,KAAK2b,cAAgBT,EAAOG,SAC9B,CAWAO,mBAAAA,CAAoBvO,GAClB,GAAIA,EACF,IAAK,MAAMlN,KAAOE,OAAOyN,KAAKT,GAC5BkB,GAAmBpO,GAGvBH,KAAK4a,aAAe7B,GAAgB1L,EACtC,CAOAwO,iBAAAA,CAAkB1b,EAAKa,GACrBuN,GAAmBpO,GACE,iBAAVa,IAA8C,IAAxBA,EAAMwD,QAAQ,OAC7CxE,KAAK4a,aAAaza,GAAOa,EAE7B,CAWA8a,gBAAAA,CAAiBzO,GACfrN,KAAK8a,iBAAmB,EACxB9a,KAAK+a,gBAAkB,EACvB/a,KAAK6a,UAAY9B,GAAgB1L,EACnC,CAWA6E,KAAAA,GAIE,OAHAlS,KAAK6a,UAAYxa,OAAOsN,OAAO,MAC/B3N,KAAK8a,iBAAmB,EACxB9a,KAAK+a,gBAAkB,EAChB/a,IACT,CAWA+b,aAAAA,CAAcC,GACZhc,KAAKyb,eAA6B,MAAZO,EAAkB,IAAM,CAChD,CAYAC,MAAAA,CAAO7Z,GACL,GAAmB,iBAARA,GAAmC,IAAfA,EAAImB,OAAc,OAAOnB,EAIxD,MAAM8Z,EAAW9Z,EACX+Z,EAAS,GACThU,EAAM/F,EAAImB,OAChB,IAAI6Y,EAAO,EACPnZ,EAAI,EAER,MAAMoZ,EAAkBrc,KAAKga,oBAAsB,EAC7CsC,EAActc,KAAKia,mBAAqB,EACxCsC,EAAcF,GAAmBC,EAEvC,KAAOrZ,EAAIkF,GAAK,CAEd,GAA0B,KAAtB/F,EAAIoa,WAAWvZ,GAAqB,CAAEA,IAAK,QAAU,CAKzD,IAAIsC,EAAItC,EAAI,EACZ,KAAOsC,EAAI4C,GAA6B,KAAtB/F,EAAIoa,WAAWjX,IAAwBA,EAAItC,GAAM,IAAIsC,IAEvE,GAAIA,GAAK4C,GAA6B,KAAtB/F,EAAIoa,WAAWjX,GAAW,CAExCtC,IACA,QACF,CAGA,MAAMwZ,EAAQra,EAAI8R,MAAMjR,EAAI,EAAGsC,GAC/B,GAAqB,IAAjBkX,EAAMlZ,OAAc,CAAEN,IAAK,QAAU,CAEzC,IAAIyZ,EACAC,EAEJ,GAAI3c,KAAKgb,WAAW1F,IAAImH,GAEtBC,EAAc,QAGDhU,IAATiU,IACFA,EAAOxD,QAEJ,IAAInZ,KAAKib,UAAU3F,IAAImH,GAAQ,CAEpCxZ,IACA,QACF,CAAO,GAA4B,KAAxBwZ,EAAMD,WAAW,GAAqB,CAI/C,MAAMI,EAAY5c,KAAK6c,YAAYJ,GACnC,QAAkB/T,IAAdkU,EAAyB,CAE3B3Z,IACA,QACF,CACAyZ,EAAcE,EACdD,EAAOvD,EACT,KAAO,CAEL,MAAM0D,EAAW9c,KAAK+c,aAAaN,GACnCC,EAAcI,GAAU9b,MACxB2b,EAAOG,GAAUH,IACnB,EAEA,QAAoBjU,IAAhBgU,GAaJ,GANIzZ,EAAImZ,GAAMD,EAAO/T,KAAKhG,EAAI8R,MAAMkI,EAAMnZ,IAC1CkZ,EAAO/T,KAAKsU,GACZN,EAAO7W,EAAI,EACXtC,EAAImZ,EAGAG,GAAevc,KAAKgd,YAAYL,GAAO,CACzC,GAAIN,IACFrc,KAAK8a,mBACD9a,KAAK8a,iBAAmB9a,KAAKga,qBAC/B,MAAM,IAAI9W,MAER,2DAAGlD,KAAK8a,sBAAsB9a,KAAKga,uBAIzC,GAAIsC,EAAa,CAEf,MAAMW,EAAQP,EAAYnZ,QAAUkZ,EAAMlZ,OAAS,GACnD,GAAI0Z,EAAQ,IACVjd,KAAK+a,iBAAmBkC,EACpBjd,KAAK+a,gBAAkB/a,KAAKia,oBAC9B,MAAM,IAAI/W,MAER,4DAAGlD,KAAK+a,qBAAqB/a,KAAKia,qBAI1C,CACF,OAlCEhX,GAmCJ,CAGImZ,EAAOjU,GAAKgU,EAAO/T,KAAKhG,EAAI8R,MAAMkI,IAGtC,MAAMnK,EAA2B,IAAlBkK,EAAO5Y,OAAenB,EAAM+Z,EAAOlN,KAAK,IAEvD,OAAOjP,KAAKka,WAAWjI,EAAQiK,EACjC,CAYAc,WAAAA,CAAYL,GACV,QAAI3c,KAAKqa,YAAY/E,IAAI+D,KAClBrZ,KAAKqa,YAAY/E,IAAIqH,EAC9B,CAcAI,YAAAA,CAAarb,GAGX,OAAIA,KAAQ1B,KAAK6a,UAAkB,CAAE7Z,MAAOhB,KAAK6a,UAAUnZ,GAAOib,KAAMxD,IACpEzX,KAAQ1B,KAAK4a,aAAqB,CAAE5Z,MAAOhB,KAAK4a,aAAalZ,GAAOib,KAAMxD,IAC1EzX,KAAQ1B,KAAKya,SAAiB,CAAEzZ,MAAOhB,KAAKya,SAAS/Y,GAAOib,KAAMvD,SAAtE,CAEF,CAeA8D,YAAAA,CAAaC,GAEX,OAAW,IAAPA,EAAiBnd,KAAK2b,cAGtBwB,GAAM,OAAUA,GAAM,OAGE,IAAxBnd,KAAKyb,gBACH0B,GAAM,GAAQA,GAAM,KAASvD,GAAiBtE,IAAI6H,GAJf7D,GAAUI,QAO3C,CACV,CAcA0D,eAAAA,CAAgBC,EAAQZ,EAAOU,GAC7B,OAAQE,GACN,KAAK/D,GAAUE,MAAO,OAAOzG,OAAOuK,cAAcH,GAClD,KAAK7D,GAAUI,OAAQ,MAAO,GAC9B,KAAKJ,GAAUG,MAAO,OACtB,KAAKH,GAAUK,MACb,MAAM,IAAIzW,MAER,2DAAIuZ,SAAaU,EAAGtM,SAAS,IAAIzM,cAAcmZ,SAAS,EAAG,SAE/D,QAAS,OAAOxK,OAAOuK,cAAcH,GAEzC,CAkBAN,WAAAA,CAAYJ,GAEV,MAAMe,EAASf,EAAMD,WAAW,GAChC,IAAIW,EAQJ,GANEA,EADa,MAAXK,GAAqC,KAAXA,EACvB5I,SAAS6H,EAAMvI,MAAM,GAAI,IAEzBU,SAAS6H,EAAMvI,MAAM,GAAI,IAI5BuJ,OAAOC,MAAMP,IAAOA,EAAK,GAAKA,EAAK,QAAU,OAGjD,MAAMQ,EAAU3d,KAAKkd,aAAaC,GAGlC,IAAKnd,KAAKua,iBAAmBoD,EAAUrE,GAAUI,OAAQ,OAGzD,MAAMkE,GAAyB,IAAbD,EACd3d,KAAK0b,YACL7O,KAAKC,IAAI9M,KAAK0b,YAAaiC,GAG/B,OAAO3d,KAAKod,gBAAgBQ,EAAWnB,EAAOU,EAChD,EClgBF,SAASU,GAAqBC,EAAenb,GAC3C,IAAKmb,EAAe,MAAO,CAAC,EAG5B,MAAMpS,EAAQ/I,EAAQkH,oBAClBiU,EAAcnb,EAAQkH,qBACtBiU,EAEJ,IAAKpS,EAAO,MAAO,CAAC,EAEpB,MAAMqS,EAAW,CAAC,EAClB,IAAK,MAAM5d,KAAOuL,EAEZvL,EAAI0I,WAAWlG,EAAQiH,qBAEzBmU,EADgB5d,EAAI+D,UAAUvB,EAAQiH,oBAAoBrG,SACtCmI,EAAMvL,GAG1B4d,EAAS5d,GAAOuL,EAAMvL,GAG1B,OAAO4d,CACT,CAOA,SAASC,GAAiBC,GACxB,IAAKA,GAAoC,iBAAfA,EAAyB,OAEnD,MAAM3J,EAAa2J,EAAWzZ,QAAQ,KACtC,IAAoB,IAAhB8P,GAAqBA,EAAa,EAAG,CACvC,MAAM4J,EAAKD,EAAW/Z,UAAU,EAAGoQ,GAEnC,GAAW,UAAP4J,EACF,OAAOA,CAEX,CAEF,CAEe,MAAMC,GACnBlY,WAAAA,CAAYtD,GCvEC,IAA+BoH,EDwE1C/J,KAAK2C,QAAUA,EACf3C,KAAKoe,YAAc,KACnBpe,KAAKqe,cAAgB,GACrBre,KAAKse,SAAWA,GAChBte,KAAKue,cAAgBA,GACrBve,KAAKwe,iBAAmBA,GACxBxe,KAAKye,mBAAqBA,GAC1Bze,KAAK0e,aAAeA,GACpB1e,KAAK2e,qBAAuBA,GAC5B3e,KAAK4e,iBAAmBA,GACxB5e,KAAK6e,oBAAsBA,GAC3B7e,KAAK6N,SAAWA,GAChB7N,KAAK8e,mBCnF2B,mBADU/U,EDoFM/J,KAAK2C,QAAQoH,kBClFlDA,EAEPqD,MAAMrC,QAAQhB,GACNpB,IACJ,IAAK,MAAM0K,KAAWtJ,EAAkB,CACpC,GAAuB,iBAAZsJ,GAAwB1K,IAAa0K,EAC5C,OAAO,EAEX,GAAIA,aAAmB1R,QAAU0R,EAAQhR,KAAKsG,GAC1C,OAAO,CAEf,GAGD,KAAM,EDqEb3I,KAAK+e,qBAAuB,EAC5B/e,KAAKgf,sBAAwB,EAC7B,IAAIrE,EAAgB,IAAKxD,IACrBnX,KAAK2C,QAAQwI,cACfnL,KAAKmL,cAAgBnL,KAAK2C,QAAQwI,eAEO,iBAA9BnL,KAAK2C,QAAQuI,aAA2ByP,EAAgB3a,KAAK2C,QAAQuI,cACzC,IAA9BlL,KAAK2C,QAAQuI,eAAuByP,EAAgB,IAAKlD,MAAgBtB,KAClFnW,KAAKmL,cAAgB,IAAI0O,GAAc,CACrCc,cAAeA,EACfH,eAAgBxa,KAAK2C,QAAQuI,aAC7B6O,MAAO,CACLvN,mBAAoBxM,KAAK2C,QAAQsI,gBAAgBuB,mBACjDC,kBAAmBzM,KAAK2C,QAAQsI,gBAAgBwB,kBAChD6N,cAAeta,KAAK2C,QAAQsI,gBAAgB2B,cAOlD5M,KAAK2P,QAAU,IAAIyB,GAInBpR,KAAKif,gBAAkBjf,KAAK2P,QAAQwD,WAGpCnT,KAAKkf,uBAAwB,EAG7Blf,KAAKmf,uBAAyB,IAAIpK,GAClC,MAAMqK,EAAgBpf,KAAK2C,QAAQkI,UACnC,GAAIuU,GAAiBA,EAAc7b,OAAS,EAAG,CAC7C,IAAK,IAAIN,EAAI,EAAGA,EAAImc,EAAc7b,OAAQN,IAAK,CAC7C,MAAMoc,EAAcD,EAAcnc,GACP,iBAAhBoc,EAETrf,KAAKmf,uBAAuBvR,IAAI,IAAIwF,GAAWiM,IACtCA,aAAuBjM,IAEhCpT,KAAKmf,uBAAuBvR,IAAIyR,EAEpC,CACArf,KAAKmf,uBAAuBtJ,MAC9B,CACF,EAcF,SAAS0I,GAAc5T,EAAKD,EAASe,EAAO6T,EAAUC,EAAeC,EAAYC,GAC/E,MAAM9c,EAAU3C,KAAK2C,QACrB,QAAY+F,IAARiC,IACEhI,EAAQwH,aAAemV,IACzB3U,EAAMA,EAAI3F,QAER2F,EAAIpH,OAAS,GAAG,CACbkc,IAAgB9U,EAAM3K,KAAK2e,qBAAqBhU,EAAKD,EAASe,IAGnE,MAAMiU,EAAiB/c,EAAQ8I,MAAQA,EAAMoF,WAAapF,EACpDkU,EAAShd,EAAQ8H,kBAAkBC,EAASC,EAAK+U,EAAgBH,EAAeC,GACtF,OAAIG,QAEKhV,SACSgV,UAAkBhV,GAAOgV,IAAWhV,EAE7CgV,EACEhd,EAAQwH,YAGEQ,EAAI3F,SACJ2F,EAHZiV,GAAWjV,EAAKhI,EAAQsH,cAAetH,EAAQ0H,oBAM7CM,CAGb,CAEJ,CAEA,SAAS6T,GAAiB/Q,GACxB,GAAIzN,KAAK2C,QAAQqH,eAAgB,CAC/B,MAAM6V,EAAOpS,EAAQrE,MAAM,KACrB0W,EAA+B,MAAtBrS,EAAQsS,OAAO,GAAa,IAAM,GACjD,GAAgB,UAAZF,EAAK,GACP,MAAO,GAEW,IAAhBA,EAAKtc,SACPkK,EAAUqS,EAASD,EAAK,GAE5B,CACA,OAAOpS,CACT,CAIA,MAAMuS,GAAY,IAAIre,OAAO,+CAAgD,MAE7E,SAAS8c,GAAmBlX,EAASkE,EAAOf,EAASuV,GAAQ,GAC3D,MAAMtd,EAAU3C,KAAK2C,QACrB,IAAc,IAAVsd,IAAgD,IAA7Btd,EAAQoH,kBAAgD,iBAAZxC,EAAuB,CAIxF,MAAMI,EAAUU,EAAcd,EAASyY,IACjC7X,EAAMR,EAAQpE,OACdmI,EAAQ,CAAC,EAITwU,EAAgB,IAAI9S,MAAMjF,GAChC,IAAIgY,GAAc,EAClB,MAAMC,EAAqB,CAAC,EAE5B,IAAK,IAAInd,EAAI,EAAGA,EAAIkF,EAAKlF,IAAK,CAC5B,MAAM0F,EAAW3I,KAAKwe,iBAAiB7W,EAAQ1E,GAAG,IAC5Cod,EAAS1Y,EAAQ1E,GAAG,GAE1B,GAAI0F,EAASpF,aAAqBmF,IAAX2X,EAAsB,CAC3C,IAAI1V,EAAM0V,EACN1d,EAAQwH,aAAYQ,EAAMA,EAAI3F,QAClC2F,EAAM3K,KAAK2e,qBAAqBhU,EAAKD,EAAS1K,KAAKif,iBACnDiB,EAAcjd,GAAK0H,EAEnByV,EAAmBzX,GAAYgC,EAC/BwV,GAAc,CAChB,CACF,CAGIA,GAAgC,iBAAV1U,GAAsBA,EAAMsG,eACpDtG,EAAMsG,cAAcqO,GAItB,MAAME,EAAW3d,EAAQ8I,MAAQA,EAAMoF,WAAa7Q,KAAKif,gBAGzD,IAAIsB,GAAW,EACf,IAAK,IAAItd,EAAI,EAAGA,EAAIkF,EAAKlF,IAAK,CAC5B,MAAM0F,EAAW3I,KAAKwe,iBAAiB7W,EAAQ1E,GAAG,IAElD,GAAIjD,KAAK8e,mBAAmBnW,EAAU2X,GAAW,SAEjD,IAAIE,EAAQ7d,EAAQiH,oBAAsBjB,EAE1C,GAAIA,EAASpF,OAMX,GALIZ,EAAQ4I,yBACViV,EAAQ7d,EAAQ4I,uBAAuBiV,IAEzCA,EAAQC,GAAaD,EAAO7d,QAEN+F,IAAlBf,EAAQ1E,GAAG,GAAkB,CAE/B,MAAMod,EAASH,EAAcjd,GAEvByd,EAAS/d,EAAQiI,wBAAwBjC,EAAU0X,EAAQC,GAE/D5U,EAAM8U,GADJE,QACaL,SACCK,UAAkBL,GAAUK,IAAWL,EACxCK,EAEAd,GAAWS,EAAQ1d,EAAQuH,oBAAqBvH,EAAQ0H,oBAEzEkW,GAAW,CACb,MAAW5d,EAAQyD,yBACjBsF,EAAM8U,IAAS,EACfD,GAAW,EAGjB,CAEA,IAAKA,EAAU,OAEf,GAAI5d,EAAQkH,oBAAqB,CAC/B,MAAM8W,EAAiB,CAAC,EAExB,OADAA,EAAehe,EAAQkH,qBAAuB6B,EACvCiV,CACT,CACA,OAAOjV,CACT,CACF,CACA,MAAM4S,GAAW,SAAUtb,GACzBA,EAAUA,EAAQvB,QAAQ,SAAU,MACpC,MAAMmf,EAAS,IAAIC,EAAQ,QAC3B,IAAIzC,EAAcwC,EACdE,EAAW,GAGf9gB,KAAK2P,QAAQuC,QACblS,KAAKmL,cAAc+G,QAGnBlS,KAAK+e,qBAAuB,EAC5B/e,KAAKgf,sBAAwB,EAC7B,MAAMrc,EAAU3C,KAAK2C,QACfoe,EAAgB,IAAI/S,EAAcrL,EAAQsI,iBAC1C+V,EAAShe,EAAQO,OACvB,IAAK,IAAIN,EAAI,EAAGA,EAAI+d,EAAQ/d,IAE1B,GAAW,MADAD,EAAQC,GACH,CAGd,MAAMge,EAAKje,EAAQwZ,WAAWvZ,EAAI,GAClC,GAAW,KAAPge,EAAW,CACb,MAAMC,EAAaC,GAAiBne,EAAS,IAAKC,EAAG,8BACrD,IAAIyH,EAAU1H,EAAQkB,UAAUjB,EAAI,EAAGie,GAAYlc,OAEnD,GAAIrC,EAAQqH,eAAgB,CAC1B,MAAMsK,EAAa5J,EAAQlG,QAAQ,MACf,IAAhB8P,IACF5J,EAAUA,EAAQ7D,OAAOyN,EAAa,GAE1C,CAEA5J,EAAUY,GAAiB3I,EAAQ2I,iBAAkBZ,EAAS,GAAI/H,GAAS+H,QAEvE0T,IACF0C,EAAW9gB,KAAK6e,oBAAoBiC,EAAU1C,EAAape,KAAKif,kBAIlE,MAAMmC,EAAcphB,KAAK2P,QAAQG,gBACjC,GAAIpF,GAAW/H,EAAQuK,gBAAgBoI,IAAI5K,GACzC,MAAM,IAAIxH,MAAM,kDAAkDwH,MAEhE0W,GAAeze,EAAQuK,gBAAgBoI,IAAI8L,KAE7CphB,KAAK2P,QAAQmC,MACb9R,KAAKqe,cAAcvM,OAGrB9R,KAAK2P,QAAQmC,MACb9R,KAAKkf,uBAAwB,EAE7Bd,EAAcpe,KAAKqe,cAAcvM,MACjCgP,EAAW,GACX7d,EAAIie,CACN,MAAO,GAAW,KAAPD,EAAW,CAEpB,IAAII,EAAUC,GAAWte,EAASC,GAAG,EAAO,MAC5C,IAAKoe,EAAS,MAAM,IAAIne,MAAM,yBAE9B4d,EAAW9gB,KAAK6e,oBAAoBiC,EAAU1C,EAAape,KAAKif,iBAChE,MAAMsC,EAAUvhB,KAAKye,mBAAmB4C,EAAQG,OAAQxhB,KAAK2P,QAAS0R,EAAQ3W,SAAS,GACvF,GAAI6W,EAAS,CACX,MAAME,EAAMF,EAAQvhB,KAAK2C,QAAQiH,oBAAsB,WACvD5J,KAAKmL,cAAc4Q,cAAc0B,OAAOgE,IAAQ,EAClD,CACA,GAAK9e,EAAQyI,mBAAyC,SAApBiW,EAAQ3W,SAAuB/H,EAAQ0I,kBAElE,CAEL,MAAMqW,EAAY,IAAIb,EAAQQ,EAAQ3W,SACtCgX,EAAU9T,IAAIjL,EAAQmH,aAAc,IAEhCuX,EAAQ3W,UAAY2W,EAAQG,QAAUH,EAAQM,iBAA+C,IAA7Bhf,EAAQoH,mBAC1E2X,EAAU,MAAQH,GAEpBvhB,KAAK6N,SAASuQ,EAAasD,EAAW1hB,KAAKif,gBAAiBhc,EAC9D,CAGAA,EAAIoe,EAAQH,WAAa,CAC3B,MAAO,GAAW,KAAPD,GACwB,KAA9Bje,EAAQwZ,WAAWvZ,EAAI,IACO,KAA9BD,EAAQwZ,WAAWvZ,EAAI,GAAW,CACrC,MAAM2e,EAAWT,GAAiBne,EAAS,SAAOC,EAAI,EAAG,0BACzD,GAAIN,EAAQqI,gBAAiB,CAC3B,MAAM3H,EAAUL,EAAQkB,UAAUjB,EAAI,EAAG2e,EAAW,GAEpDd,EAAW9gB,KAAK6e,oBAAoBiC,EAAU1C,EAAape,KAAKif,iBAEhEb,EAAYxQ,IAAIjL,EAAQqI,gBAAiB,CAAC,CAAE,CAACrI,EAAQmH,cAAezG,IACtE,CACAJ,EAAI2e,CACN,MAAO,GAAW,KAAPX,GACwB,KAA9Bje,EAAQwZ,WAAWvZ,EAAI,GAAW,CACrC,MAAMgP,EAAS8O,EAAc9S,YAAYjL,EAASC,GAClDjD,KAAKmL,cAAc2Q,iBAAiB7J,EAAO/D,UAC3CjL,EAAIgP,EAAOhP,CACb,MAAO,GAAW,KAAPge,GACwB,KAA9Bje,EAAQwZ,WAAWvZ,EAAI,GAAW,CACrC,MAAMie,EAAaC,GAAiBne,EAAS,MAAOC,EAAG,wBAA0B,EAC3Eue,EAASxe,EAAQkB,UAAUjB,EAAI,EAAGie,GAExCJ,EAAW9gB,KAAK6e,oBAAoBiC,EAAU1C,EAAape,KAAKif,iBAEhE,IAAItU,EAAM3K,KAAKue,cAAciD,EAAQpD,EAAY3Q,QAASzN,KAAKif,iBAAiB,GAAM,GAAO,GAAM,GACxFvW,MAAPiC,IAAkBA,EAAM,IAGxBhI,EAAQyH,cACVgU,EAAYxQ,IAAIjL,EAAQyH,cAAe,CAAC,CAAE,CAACzH,EAAQmH,cAAe0X,KAElEpD,EAAYxQ,IAAIjL,EAAQmH,aAAca,GAGxC1H,EAAIie,EAAa,CACnB,KAAO,CACL,IAAIjP,EAASqP,GAAWte,EAASC,EAAGN,EAAQqH,gBAG5C,IAAKiI,EAAQ,CAEX,MAAM4P,EAAU7e,EAAQkB,UAAU2I,KAAKC,IAAI,EAAG7J,EAAI,IAAK4J,KAAKiV,IAAId,EAAQ/d,EAAI,KAC5E,MAAM,IAAIC,MAAM,6CAA6CD,gBAAgB4e,KAC/E,CAEA,IAAInX,EAAUuH,EAAOvH,QACrB,MAAMuT,EAAahM,EAAOgM,WAC1B,IAAIuD,EAASvP,EAAOuP,OAChBG,EAAiB1P,EAAO0P,eACxBT,EAAajP,EAAOiP,WAIxB,KAFGxW,UAAS8W,UAAWlW,GAAiB3I,EAAQ2I,iBAAkBZ,EAAS8W,EAAQ7e,IAE/EA,EAAQkJ,sBACTnB,IAAY/H,EAAQqI,iBAChBN,IAAY/H,EAAQyH,eACpBM,IAAY/H,EAAQmH,cACpBY,IAAY/H,EAAQkH,qBAEzB,MAAM,IAAI3G,MAAM,qBAAqBwH,KAInC0T,GAAe0C,GACW,SAAxB1C,EAAY3Q,UAEdqT,EAAW9gB,KAAK6e,oBAAoBiC,EAAU1C,EAAape,KAAKif,iBAAiB,IAKrF,MAAM8C,EAAU3D,EACZ2D,GAAWpf,EAAQuK,gBAAgBoI,IAAIyM,EAAQtU,WACjD2Q,EAAcpe,KAAKqe,cAAcvM,MACjC9R,KAAK2P,QAAQmC,OAKf,IAAIkQ,GAAgB,EAChBR,EAAOje,OAAS,GAAKie,EAAOjN,YAAY,OAASiN,EAAOje,OAAS,IACnEye,GAAgB,EACoB,MAAhCtX,EAAQA,EAAQnH,OAAS,IAC3BmH,EAAUA,EAAQ7D,OAAO,EAAG6D,EAAQnH,OAAS,GAC7Cie,EAAS9W,GAET8W,EAASA,EAAO3a,OAAO,EAAG2a,EAAOje,OAAS,GAI5Coe,EAAkBjX,IAAY8W,GAIhC,IAEItR,EAFA4N,EAAgB,KAChBC,EAAW,CAAC,EAIhB7N,EAAY8N,GAAiBC,GAGzBvT,IAAYkW,EAAOnT,SACrBzN,KAAK2P,QAAQvH,KAAKsC,EAAS,CAAC,EAAGwF,GAI7BxF,IAAY8W,GAAUG,IAGxB7D,EAAgB9d,KAAKye,mBAAmB+C,EAAQxhB,KAAK2P,QAASjF,GAE1DoT,IAGFC,EAAWF,GAAqBC,EAAenb,KAK/C+H,IAAYkW,EAAOnT,UACrBzN,KAAKkf,sBAAwBlf,KAAK0e,gBAGpC,MAAMzW,EAAahF,EACnB,GAAIjD,KAAKkf,sBAAuB,CAC9B,IAAI+C,EAAa,GAGjB,GAAID,EACF/e,EAAIgP,EAAOiP,gBAGR,GAAIve,EAAQuK,gBAAgBoI,IAAI5K,GACnCzH,EAAIgP,EAAOiP,eAGR,CAEH,MAAMjP,EAASjS,KAAK4e,iBAAiB5b,EAASib,EAAYiD,EAAa,GACvE,IAAKjP,EAAQ,MAAM,IAAI/O,MAAM,qBAAqB+a,KAClDhb,EAAIgP,EAAOhP,EACXgf,EAAahQ,EAAOgQ,UACtB,CAEA,MAAMP,EAAY,IAAIb,EAAQnW,GAE1BoT,IACF4D,EAAU,MAAQ5D,GAIpB4D,EAAU9T,IAAIjL,EAAQmH,aAAcmY,GAEpCjiB,KAAK2P,QAAQmC,MACb9R,KAAKkf,uBAAwB,EAE7Blf,KAAK6N,SAASuQ,EAAasD,EAAW1hB,KAAKif,gBAAiBhX,EAC9D,KAAO,CAEL,GAAI+Z,EAAe,GACdtX,UAAS8W,UAAWlW,GAAiB3I,EAAQ2I,iBAAkBZ,EAAS8W,EAAQ7e,IAEnF,MAAM+e,EAAY,IAAIb,EAAQnW,GAC1BoT,IACF4D,EAAU,MAAQ5D,GAEpB9d,KAAK6N,SAASuQ,EAAasD,EAAW1hB,KAAKif,gBAAiBhX,GAC5DjI,KAAK2P,QAAQmC,MACb9R,KAAKkf,uBAAwB,CAC/B,KACK,IAAIvc,EAAQuK,gBAAgBoI,IAAI5K,GAAU,CAC7C,MAAMgX,EAAY,IAAIb,EAAQnW,GAC1BoT,IACF4D,EAAU,MAAQ5D,GAEpB9d,KAAK6N,SAASuQ,EAAasD,EAAW1hB,KAAKif,gBAAiBhX,GAC5DjI,KAAK2P,QAAQmC,MACb9R,KAAKkf,uBAAwB,EAC7Bjc,EAAIgP,EAAOiP,WAEX,QACF,CAEK,CACH,MAAMQ,EAAY,IAAIb,EAAQnW,GAC9B,GAAI1K,KAAKqe,cAAc9a,OAASZ,EAAQiJ,cACtC,MAAM,IAAI1I,MAAM,gCAElBlD,KAAKqe,cAAcjW,KAAKgW,GAEpBN,IACF4D,EAAU,MAAQ5D,GAEpB9d,KAAK6N,SAASuQ,EAAasD,EAAW1hB,KAAKif,gBAAiBhX,GAC5DmW,EAAcsD,CAChB,EACAZ,EAAW,GACX7d,EAAIie,CACN,CACF,CACF,MACEJ,GAAY9d,EAAQC,GAGxB,OAAO2d,EAAOlT,KAChB,EAEA,SAASG,GAASuQ,EAAasD,EAAW/R,EAAS1H,GAE5CjI,KAAK2C,QAAQgJ,kBAAiB1D,OAAaS,GAGhD,MAAMgX,EAAiB1f,KAAK2C,QAAQ8I,MAAQkE,EAAQkB,WAAalB,EAC3DsC,EAASjS,KAAK2C,QAAQ6I,UAAUkW,EAAUjU,QAASiS,EAAgBgC,EAAU,QACpE,IAAXzP,IAEyB,iBAAXA,GAChByP,EAAUjU,QAAUwE,EACpBmM,EAAYvQ,SAAS6T,EAAWzZ,IAEhCmW,EAAYvQ,SAAS6T,EAAWzZ,GAEpC,CAOA,SAAS0W,GAAqBhU,EAAKD,EAASe,GAC1C,MAAMyW,EAAeliB,KAAK2C,QAAQsI,gBAElC,IAAKiX,IAAiBA,EAAa5V,QACjC,OAAO3B,EAIT,GAAIuX,EAAaxV,YAAa,CAC5B,MAAMgT,EAAiB1f,KAAK2C,QAAQ8I,MAAQA,EAAMoF,WAAapF,EAK/D,KAJgB2B,MAAMrC,QAAQmX,EAAaxV,aACvCwV,EAAaxV,YAAYvH,SAASuF,GAClCwX,EAAaxV,YAAYhC,EAASgV,IAGpC,OAAO/U,CAEX,CAGA,GAAIuX,EAAavV,UAAW,CAC1B,MAAM+S,EAAiB1f,KAAK2C,QAAQ8I,MAAQA,EAAMoF,WAAapF,EAC/D,IAAKyW,EAAavV,UAAUjC,EAASgV,GACnC,OAAO/U,CAEX,CAEA,OAAO3K,KAAKmL,cAAc8Q,OAAOtR,EACnC,CAGA,SAASkU,GAAoBiC,EAAUqB,EAAYxS,EAAS6P,GAe1D,OAdIsB,SACiBpY,IAAf8W,IAA0BA,EAAyC,IAA5B2C,EAAWzU,MAAMnK,aAS3CmF,KAPjBoY,EAAW9gB,KAAKue,cAAcuC,EAC5BqB,EAAW1U,QACXkC,GACA,IACAwS,EAAW,OAAiD,IAAzC9hB,OAAOyN,KAAKqU,EAAW,OAAO5e,OACjDic,KAEyC,KAAbsB,GAC5BqB,EAAWvU,IAAI5N,KAAK2C,QAAQmH,aAAcgX,GAC5CA,EAAW,IAENA,CACT,CAMA,SAASpC,KACP,OAAyC,IAArC1e,KAAKmf,uBAAuBvJ,MAEzB5V,KAAK2P,QAAQuB,WAAWlR,KAAKmf,uBACtC,CAuCA,SAASgC,GAAiBne,EAASZ,EAAKa,EAAGmf,GACzC,MAAMC,EAAerf,EAAQwB,QAAQpC,EAAKa,GAC1C,IAAsB,IAAlBof,EACF,MAAM,IAAInf,MAAMkf,GAEhB,OAAOC,EAAejgB,EAAImB,OAAS,CAEvC,CAEA,SAAS+e,GAAgBtf,EAAS1B,EAAM2B,EAAGmf,GACzC,MAAMC,EAAerf,EAAQwB,QAAQlD,EAAM2B,GAC3C,IAAsB,IAAlBof,EAAqB,MAAM,IAAInf,MAAMkf,GACzC,OAAOC,CACT,CAEA,SAASf,GAAWte,EAASC,EAAG+G,EAAgBuY,EAAc,KAC5D,MAAMtQ,EA/CR,SAAgCjP,EAASC,EAAGsf,EAAc,KACxD,IAAIC,EAAe,EACnB,MAAMC,EAAQ,GACRta,EAAMnF,EAAQO,OACdmf,EAAaH,EAAY/F,WAAW,GACpCmG,EAAaJ,EAAYhf,OAAS,EAAIgf,EAAY/F,WAAW,IAAM,EAEzE,IAAK,IAAInX,EAAQpC,EAAGoC,EAAQ8C,EAAK9C,IAAS,CACxC,MAAMQ,EAAO7C,EAAQwZ,WAAWnX,GAEhC,GAAImd,EACE3c,IAAS2c,IAAcA,EAAe,QACrC,GAAa,KAAT3c,GAAwB,KAATA,EACxB2c,EAAe3c,OACV,GAAIA,IAAS6c,EAAY,CAC9B,IAAoB,IAAhBC,EAKF,MAAO,CAAEvd,KAAM2N,OAAO6P,gBAAgBH,GAAQpd,SAJ9C,GAAIrC,EAAQwZ,WAAWnX,EAAQ,KAAOsd,EACpC,MAAO,CAAEvd,KAAM2N,OAAO6P,gBAAgBH,GAAQpd,QAKpD,MAAO,GAAa,IAATQ,EAAY,CACrB4c,EAAMra,KAAK,IACX,QACF,CAEAqa,EAAMra,KAAKvC,EACb,CACF,CAkBiBgd,CAAuB7f,EAASC,EAAI,EAAGsf,GACtD,IAAKtQ,EAAQ,OACb,IAAIuP,EAASvP,EAAO7M,KACpB,MAAM8b,EAAajP,EAAO5M,MACpByd,EAAiBtB,EAAOuB,OAAO,MACrC,IAAIrY,EAAU8W,EACVG,GAAiB,GACG,IAApBmB,IACFpY,EAAU8W,EAAOtd,UAAU,EAAG4e,GAC9BtB,EAASA,EAAOtd,UAAU4e,EAAiB,GAAGE,aAGhD,MAAM/E,EAAavT,EACnB,GAAIV,EAAgB,CAClB,MAAMsK,EAAa5J,EAAQlG,QAAQ,MACf,IAAhB8P,IACF5J,EAAUA,EAAQ7D,OAAOyN,EAAa,GACtCqN,EAAiBjX,IAAYuH,EAAO7M,KAAKyB,OAAOyN,EAAa,GAEjE,CAEA,MAAO,CACL5J,QAASA,EACT8W,OAAQA,EACRN,WAAYA,EACZS,eAAgBA,EAChB1D,WAAYA,EAEhB,CAOA,SAASW,GAAiB5b,EAAS0H,EAASzH,GAC1C,MAAMgF,EAAahF,EAEnB,IAAIggB,EAAe,EAEnB,MAAMC,EAASlgB,EAAQO,OACvB,KAAON,EAAIigB,EAAQjgB,IACjB,GAAmB,MAAfD,EAAQC,GAAY,CACtB,MAAMge,EAAKje,EAAQwZ,WAAWvZ,EAAI,GAClC,GAAW,KAAPge,EAAW,CACb,MAAMC,EAAaoB,GAAgBtf,EAAS,IAAKC,EAAG,GAAGyH,mBAEvD,GADmB1H,EAAQkB,UAAUjB,EAAI,EAAGie,GAAYlc,SACnC0F,IACnBuY,IACqB,IAAjBA,GACF,MAAO,CACLhB,WAAYjf,EAAQkB,UAAU+D,EAAYhF,GAC1CA,EAAGie,GAITje,EAAIie,CACN,MAAO,GAAW,KAAPD,EAEThe,EADmBke,GAAiBne,EAAS,KAAMC,EAAI,EAAG,gCAErD,GAAW,KAAPge,GACwB,KAA9Bje,EAAQwZ,WAAWvZ,EAAI,IACO,KAA9BD,EAAQwZ,WAAWvZ,EAAI,GAE1BA,EADmBke,GAAiBne,EAAS,SAAOC,EAAI,EAAG,gCAEtD,GAAW,KAAPge,GACwB,KAA9Bje,EAAQwZ,WAAWvZ,EAAI,GAE1BA,EADmBke,GAAiBne,EAAS,MAAOC,EAAG,2BAA6B,MAE/E,CACL,MAAMoe,EAAUC,GAAWte,EAASC,EAAG,KAEnCoe,KACkBA,GAAWA,EAAQ3W,WACnBA,GAAyD,MAA9C2W,EAAQG,OAAOH,EAAQG,OAAOje,OAAS,IACpE0f,IAEFhgB,EAAIoe,EAAQH,WAEhB,CACF,CAEJ,CAEA,SAAStB,GAAWjV,EAAKwY,EAAaxgB,GACpC,GAAIwgB,GAA8B,iBAARxY,EAAkB,CAE1C,MAAMgV,EAAShV,EAAI3F,OACnB,MAAe,SAAX2a,GACgB,UAAXA,GNxwBE,SAAkBvd,EAAKO,EAAU,CAAC,GAE7C,GADAA,EAAUtC,OAAOuC,OAAO,CAAC,EAAG0M,GAAU3M,IACjCP,GAAsB,iBAARA,EAAkB,OAAOA,EAE5C,IAAIghB,EAAahhB,EAAI4C,OAErB,GAA0B,IAAtBoe,EAAW7f,OAAc,OAAOnB,EAC/B,QAAyBsG,IAArB/F,EAAQ0gB,UAA0B1gB,EAAQ0gB,SAAShhB,KAAK+gB,GAAa,OAAOhhB,EAChF,GAAmB,MAAfghB,EAAoB,OAAO,EAC/B,GAAIzgB,EAAQ2H,KAAO8E,EAAS/M,KAAK+gB,GAClC,OAyGR,SAAmBE,GAEf,GAAI1O,SAAU,OAAOA,SAAS0O,EA3GG,IA4G5B,GAAI7F,OAAO7I,SAAU,OAAO6I,OAAO7I,SAAS0O,EA5GhB,IA6G5B,GAAIC,QAAUA,OAAO3O,SAAU,OAAO2O,OAAO3O,SAAS0O,EA7G1B,IA8G5B,MAAM,IAAIpgB,MAAM,+DACzB,CA/GesgB,CAAUJ,GAGd,GAAKK,SAASL,GAEd,IAAIA,EAAWje,SAAS,MAAQie,EAAWje,SAAS,KACvD,OAqDR,SAA0B/C,EAAKghB,EAAYzgB,GACvC,IAAKA,EAAQ6H,UAAW,OAAOpI,EAC/B,MAAM4M,EAAWoU,EAAWtb,MAAM2H,IAClC,GAAIT,EAAU,CACV,IAAI0U,EAAO1U,EAAS,IAAM,GAC1B,MAAM2U,GAAsC,IAA9B3U,EAAS,GAAGxK,QAAQ,KAAc,IAAM,IAChD+F,EAAeyE,EAAS,GACxB4U,EAA0BF,EAC5BthB,EAAImI,EAAahH,OAAS,KAAOogB,EAC/BvhB,EAAImI,EAAahH,UAAYogB,EAEnC,OAAIpZ,EAAahH,OAAS,GAAKqgB,EAAgCxhB,GAC9B,IAAxBmI,EAAahH,SACdyL,EAAS,GAAGnG,WAAW,IAAI8a,MAAY3U,EAAS,GAAG,KAAO2U,IAEvDpZ,EAAahH,OAAS,EAEzBZ,EAAQ4H,eAAiBqZ,GACzBR,GAAcpU,EAAS,IAAM,IAAMA,EAAS,GACrCyO,OAAO2F,IACJhhB,EANPqb,OAAO2F,EAWtB,CACI,OAAOhhB,CAEf,CAjFeyhB,CAAiBzhB,EAAKghB,EAAYzgB,GAGtC,CAEH,MAAMmF,EAAQuH,EAAStH,KAAKqb,GAE5B,GAAItb,EAAO,CACP,MAAM4b,EAAO5b,EAAM,IAAM,GACnByC,EAAezC,EAAM,GAC3B,IAAIgc,GA8EGR,EA9E2Bxb,EAAM,MA+ET,IAAzBwb,EAAO9e,QAAQ,MAEV,OADf8e,EAASA,EAAO7hB,QAAQ,MAAO,KACX6hB,EAAS,IACN,MAAdA,EAAO,GAAYA,EAAS,IAAMA,EACJ,MAA9BA,EAAOA,EAAO/f,OAAS,KAAY+f,EAASA,EAAOpf,UAAU,EAAGof,EAAO/f,OAAS,IAClF+f,GAEJA,EArFC,MAAMS,EAAgCL,EACD,MAAjCthB,EAAImI,EAAahH,OAAS,GACK,MAA7BnB,EAAImI,EAAahH,QAGvB,IAAKZ,EAAQ4H,eACLA,EAAahH,OAAS,GACM,IAAxBgH,EAAahH,SAAiBwgB,GAEtC,OAAO3hB,EAEN,CACD,MAAM4hB,EAAMvG,OAAO2F,GACba,EAAYlR,OAAOiR,GAEzB,GAAY,IAARA,EAAW,OAAOA,EACtB,IAAkC,IAA9BC,EAAUlB,OAAO,QACjB,OAAIpgB,EAAQ6H,UAAkBwZ,EAClB5hB,EACT,IAAiC,IAA7BghB,EAAW5e,QAAQ,KAC1B,MAAkB,MAAdyf,GACKA,IAAcH,GACdG,IAAc,GAAGP,IAAOI,IAFHE,EAGlB5hB,EAGhB,IAAI4O,EAAIzG,EAAeuZ,EAAoBV,EAC3C,OAAI7Y,EAEQyG,IAAMiT,GAAeP,EAAO1S,IAAMiT,EAAaD,EAAM5hB,EAGrD4O,IAAMiT,GAAejT,IAAM0S,EAAOO,EAAaD,EAAM5hB,CAErE,CACJ,CACI,OAAOA,CAEf,EAuCJ,IAAmBkhB,EA1FX,OAoHR,SAAwBlhB,EAAK4hB,EAAKrhB,GAC9B,MAAMuhB,EAAaF,IAAQxhB,IAE3B,OAAQG,EAAQ6M,SAAS1I,eACrB,IAAK,OACD,OAAO,KACX,IAAK,WACD,OAAOkd,EACX,IAAK,SACD,OAAOE,EAAa,WAAa,YAErC,QACI,OAAO9hB,EAEnB,CAlIe+hB,CAAe/hB,EAAKqb,OAAO2F,GAAazgB,EAoDvD,CMusBgByhB,CAASzZ,EAAKhI,EAC5B,CACE,YV9vBkB,IU8vBNgI,EACHA,EAEA,EAGb,CAYA,SAASW,GAAiB+Y,EAAI3Z,EAAS8W,EAAQ7e,GAC7C,GAAI0hB,EAAI,CACN,MAAMC,EAAaD,EAAG3Z,GAClB8W,IAAW9W,IACb8W,EAAS8C,GAEX5Z,EAAU4Z,CACZ,CAEA,MAAO,CAAE5Z,QADTA,EAAU+V,GAAa/V,EAAS/H,GACd6e,SACpB,CAIA,SAASf,GAAa/e,EAAMiB,GAC1B,GAAI8G,EAAmBtE,SAASzD,GAC9B,MAAM,IAAIwB,MAAM,6BAA6BxB,4EACxC,OAAI8H,EAAyBrE,SAASzD,GACpCiB,EAAQmJ,oBAAoBpK,GAE9BA,CACT,CE7zBA,MAAM6L,GAAkBC,EAAQO,oBAQhC,SAASwW,GAAqB7Y,EAAOoU,GACnC,IAAKpU,GAA0B,iBAAVA,EAAoB,MAAO,CAAC,EACjD,IAAKoU,EAAQ,OAAOpU,EAEpB,MAAMqS,EAAW,CAAC,EAClB,IAAK,MAAM5d,KAAOuL,EACZvL,EAAI0I,WAAWiX,GAEjB/B,EADgB5d,EAAI+D,UAAU4b,EAAOvc,SACjBmI,EAAMvL,GAG1B4d,EAAS5d,GAAOuL,EAAMvL,GAG1B,OAAO4d,CACT,CASe,SAASyG,GAASlX,EAAM3K,EAASgN,EAASsP,GACvD,OAAOwF,GAASnX,EAAM3K,EAASgN,EAASsP,EAC1C,CAQA,SAASwF,GAASC,EAAK/hB,EAASgN,EAASsP,GACvC,IAAI0F,EACJ,MAAMC,EAAgB,CAAC,EACvB,IAAK,IAAI3hB,EAAI,EAAGA,EAAIyhB,EAAInhB,OAAQN,IAAK,CACnC,MAAM4hB,EAASH,EAAIzhB,GACb6hB,EAAWC,GAASF,GAG1B,QAAiBnc,IAAboc,GAA0BA,IAAaniB,EAAQmH,aAAc,CAC/D,MAAMiU,EAAWwG,GACfM,EAAO,OAAS,CAAC,EACjBliB,EAAQiH,qBAEV+F,EAAQvH,KAAK0c,EAAU/G,EACzB,CAEA,GAAI+G,IAAaniB,EAAQmH,kBACVpB,IAATic,EAAoBA,EAAOE,EAAOC,GACjCH,GAAQ,GAAKE,EAAOC,OACpB,SAAiBpc,IAAboc,EACT,SACK,GAAID,EAAOC,GAAW,CAE3B,IAAIna,EAAM8Z,GAASI,EAAOC,GAAWniB,EAASgN,EAASsP,GACvD,MAAM+F,EAASC,GAAUta,EAAKhI,GAgB9B,GAdIkiB,EAAO,MACTK,GAAiBva,EAAKka,EAAO,MAAO5F,EAAiBtc,GAChB,IAA5BtC,OAAOyN,KAAKnD,GAAKpH,aAA8CmF,IAA9BiC,EAAIhI,EAAQmH,eAAgCnH,EAAQmI,qBAEzD,IAA5BzK,OAAOyN,KAAKnD,GAAKpH,SACtBZ,EAAQmI,qBAAsBH,EAAIhI,EAAQmH,cAAgB,GACzDa,EAAM,IAHXA,EAAMA,EAAIhI,EAAQmH,mBAMYpB,IAA5Bmc,EAAOtX,KAAiD,iBAAR5C,GAA4B,OAARA,IACtEA,EAAI4C,IAAmBsX,EAAOtX,UAIA7E,IAA5Bkc,EAAcE,IAA2BzkB,OAAOM,UAAUC,eAAeC,KAAK+jB,EAAeE,GAC1F1X,MAAMrC,QAAQ6Z,EAAcE,MAC/BF,EAAcE,GAAY,CAACF,EAAcE,KAE3CF,EAAcE,GAAU1c,KAAKuC,OACxB,CAKL,MAAM+U,EAAiB/c,EAAQ8I,MAAQwT,EAAgBpO,WAAaoO,EAChEtc,EAAQoI,QAAQ+Z,EAAUpF,EAAgBsF,GAC5CJ,EAAcE,GAAY,CAACna,GAE3Bia,EAAcE,GAAYna,CAE9B,MAGiBjC,IAAboc,GAA0BA,IAAaniB,EAAQmH,cACjD6F,EAAQmC,KAEZ,EAEF,CAOA,MALoB,iBAAT6S,EACLA,EAAKphB,OAAS,IAAGqhB,EAAcjiB,EAAQmH,cAAgB6a,QACzCjc,IAATic,IAAoBC,EAAcjiB,EAAQmH,cAAgB6a,GAG9DC,CACT,CAEA,SAASG,GAAStkB,GAChB,MAAMqN,EAAOzN,OAAOyN,KAAKrN,GACzB,IAAK,IAAIwC,EAAI,EAAGA,EAAI6K,EAAKvK,OAAQN,IAAK,CACpC,MAAM9C,EAAM2N,EAAK7K,GACjB,GAAY,OAAR9C,EAAc,OAAOA,CAC3B,CACF,CAEA,SAAS+kB,GAAiBzkB,EAAK0kB,EAASlG,EAAiBtc,GACvD,GAAIwiB,EAAS,CACX,MAAMrX,EAAOzN,OAAOyN,KAAKqX,GACnBhd,EAAM2F,EAAKvK,OACjB,IAAK,IAAIN,EAAI,EAAGA,EAAIkF,EAAKlF,IAAK,CAC5B,MAAMmiB,EAAWtX,EAAK7K,GAGhBoiB,EAAcD,EAASvc,WAAWlG,EAAQiH,qBAC5Cwb,EAASlhB,UAAUvB,EAAQiH,oBAAoBrG,QAC/C6hB,EAIE1F,EAAiB/c,EAAQ8I,MAC3BwT,EAAgBpO,WAAa,IAAMwU,EACnCpG,EAEAtc,EAAQoI,QAAQqa,EAAU1F,GAAgB,GAAM,GAClDjf,EAAI2kB,GAAY,CAACD,EAAQC,IAEzB3kB,EAAI2kB,GAAYD,EAAQC,EAE5B,CACF,CACF,CAEA,SAASH,GAAUxkB,EAAKkC,GACtB,MAAM,aAAEmH,GAAiBnH,EACnB2iB,EAAYjlB,OAAOyN,KAAKrN,GAAK8C,OAEnC,OAAkB,IAAd+hB,KAKY,IAAdA,IACC7kB,EAAIqJ,IAA8C,kBAAtBrJ,EAAIqJ,IAAqD,IAAtBrJ,EAAIqJ,GAMxE,CCxKA,MAAMxH,GAAiB,CACrB8D,wBAAwB,EACxBC,aAAc,IAIT,SAASkf,GAASviB,EAASL,GAChCA,EAAUtC,OAAOuC,OAAO,CAAC,EAAGN,GAAgBK,GAK5C,MAAMkd,EAAO,GACb,IAAI2F,GAAW,EAGXC,GAAc,EAEC,WAAfziB,EAAQ,KAEVA,EAAUA,EAAQ6D,OAAO,IAG3B,IAAK,IAAI5D,EAAI,EAAGA,EAAID,EAAQO,OAAQN,IAElC,GAAmB,MAAfD,EAAQC,IAAiC,MAAnBD,EAAQC,EAAI,IAGpC,GAFAA,GAAK,EACLA,EAAIuD,GAAOxD,EAASC,GAChBA,EAAEsF,IAAK,OAAOtF,MACb,IAAmB,MAAfD,EAAQC,GA0IZ,CACL,GAAIsD,GAAavD,EAAQC,IACvB,SAEF,OAAOyiB,GAAe,cAAe,SAAW1iB,EAAQC,GAAK,qBAAsB+D,GAAyBhE,EAASC,GACvH,CA/I+B,CAG7B,IAAI0iB,EAAc1iB,EAGlB,GAFAA,IAEmB,MAAfD,EAAQC,GAAY,CACtBA,EAAIiE,GAAoBlE,EAASC,GACjC,QACF,CAAO,CACL,IAAI2iB,GAAa,EACE,MAAf5iB,EAAQC,KAEV2iB,GAAa,EACb3iB,KAGF,IAAIyH,EAAU,GACd,KAAOzH,EAAID,EAAQO,QACF,MAAfP,EAAQC,IACO,MAAfD,EAAQC,IACO,OAAfD,EAAQC,IACO,OAAfD,EAAQC,IACO,OAAfD,EAAQC,GAAaA,IAErByH,GAAW1H,EAAQC,GAWrB,GATAyH,EAAUA,EAAQ1F,OAGkB,MAAhC0F,EAAQA,EAAQnH,OAAS,KAE3BmH,EAAUA,EAAQxG,UAAU,EAAGwG,EAAQnH,OAAS,GAEhDN,MAEG4iB,GAAgBnb,GAAU,CAC7B,IAAIlC,EAMJ,OAJEA,EAD4B,IAA1BkC,EAAQ1F,OAAOzB,OACX,2BAEA,QAAUmH,EAAU,wBAErBgb,GAAe,aAAcld,EAAKxB,GAAyBhE,EAASC,GAC7E,CAEA,MAAMgP,EAAS3K,GAAiBtE,EAASC,GACzC,IAAe,IAAXgP,EACF,OAAOyT,GAAe,cAAe,mBAAqBhb,EAAU,qBAAsB1D,GAAyBhE,EAASC,IAE9H,IAAIsE,EAAU0K,EAAOjR,MAGrB,GAFAiC,EAAIgP,EAAO5M,MAEyB,MAAhCkC,EAAQA,EAAQhE,OAAS,GAAY,CAEvC,MAAMuiB,EAAe7iB,EAAIsE,EAAQhE,OACjCgE,EAAUA,EAAQrD,UAAU,EAAGqD,EAAQhE,OAAS,GAChD,MAAMwiB,EAAUre,GAAwBH,EAAS5E,GACjD,IAAgB,IAAZojB,EAOF,OAAOL,GAAeK,EAAQxd,IAAI1C,KAAMkgB,EAAQxd,IAAIC,IAAKxB,GAAyBhE,EAAS8iB,EAAeC,EAAQxd,IAAIzC,OANtH0f,GAAW,CAQf,MAAO,GAAII,EAAY,CACrB,IAAK3T,EAAOzK,UACV,OAAOke,GAAe,aAAc,gBAAkBhb,EAAU,iCAAkC1D,GAAyBhE,EAASC,IAC/H,GAAIsE,EAAQvC,OAAOzB,OAAS,EACjC,OAAOmiB,GAAe,aAAc,gBAAkBhb,EAAU,+CAAgD1D,GAAyBhE,EAAS2iB,IAC7I,GAAoB,IAAhB9F,EAAKtc,OACd,OAAOmiB,GAAe,aAAc,gBAAkBhb,EAAU,yBAA0B1D,GAAyBhE,EAAS2iB,IACvH,CACL,MAAMK,EAAMnG,EAAK/N,MACjB,GAAIpH,IAAYsb,EAAItb,QAAS,CAC3B,IAAIub,EAAUjf,GAAyBhE,EAASgjB,EAAIL,aACpD,OAAOD,GAAe,aACpB,yBAA2BM,EAAItb,QAAU,qBAAuBub,EAAQngB,KAAO,SAAWmgB,EAAQlgB,IAAM,6BAA+B2E,EAAU,KACjJ1D,GAAyBhE,EAAS2iB,GACtC,CAGmB,GAAf9F,EAAKtc,SACPkiB,GAAc,EAElB,CACF,KAAO,CACL,MAAMM,EAAUre,GAAwBH,EAAS5E,GACjD,IAAgB,IAAZojB,EAIF,OAAOL,GAAeK,EAAQxd,IAAI1C,KAAMkgB,EAAQxd,IAAIC,IAAKxB,GAAyBhE,EAASC,EAAIsE,EAAQhE,OAASwiB,EAAQxd,IAAIzC,OAI9H,IAAoB,IAAhB2f,EACF,OAAOC,GAAe,aAAc,sCAAuC1e,GAAyBhE,EAASC,KACzD,IAA3CN,EAAQ0D,aAAa7B,QAAQkG,IAGtCmV,EAAKzX,KAAK,CAAEsC,UAASib,gBAEvBH,GAAW,CACb,CAIA,IAAKviB,IAAKA,EAAID,EAAQO,OAAQN,IAC5B,GAAmB,MAAfD,EAAQC,GAAY,CACtB,GAAuB,MAAnBD,EAAQC,EAAI,GAAY,CAE1BA,IACAA,EAAIiE,GAAoBlE,EAASC,GACjC,QACF,CAAO,GAAuB,MAAnBD,EAAQC,EAAI,GAIrB,MAFA,GADAA,EAAIuD,GAAOxD,IAAWC,GAClBA,EAAEsF,IAAK,OAAOtF,CAItB,MAAO,GAAmB,MAAfD,EAAQC,GAAY,CAC7B,MAAMijB,EAAWpd,GAAkB9F,EAASC,GAC5C,IAAiB,GAAbijB,EACF,OAAOR,GAAe,cAAe,4BAA6B1e,GAAyBhE,EAASC,IACtGA,EAAIijB,CACN,MACE,IAAoB,IAAhBT,IAAyBlf,GAAavD,EAAQC,IAChD,OAAOyiB,GAAe,aAAc,wBAAyB1e,GAAyBhE,EAASC,IAIlF,MAAfD,EAAQC,IACVA,GAEJ,CACF,CAKA,CAGF,OAAKuiB,EAEqB,GAAf3F,EAAKtc,OACPmiB,GAAe,aAAc,iBAAmB7F,EAAK,GAAGnV,QAAU,KAAM1D,GAAyBhE,EAAS6c,EAAK,GAAG8F,gBAChH9F,EAAKtc,OAAS,IAChBmiB,GAAe,aAAc,YAClCS,KAAKC,UAAUvG,EAAKxS,IAAIgZ,GAAKA,EAAE3b,SAAU,KAAM,GAAGjJ,QAAQ,SAAU,IACpE,WAAY,CAAEqE,KAAM,EAAGC,IAAK,IANvB2f,GAAe,aAAc,sBAAuB,EAU/D,CAEA,SAASnf,GAAajF,GACpB,MAAgB,MAATA,GAAyB,OAATA,GAA0B,OAATA,GAA0B,OAATA,CAC3D,CAMA,SAASkF,GAAOxD,EAASC,GACvB,MAAMwC,EAAQxC,EACd,KAAOA,EAAID,EAAQO,OAAQN,IACzB,GAAkB,KAAdD,EAAQC,IAA2B,KAAdD,EAAQC,GAAW,CAE1C,MAAMwK,EAAUzK,EAAQ6D,OAAOpB,EAAOxC,EAAIwC,GAC1C,GAAIxC,EAAI,GAAiB,QAAZwK,EACX,OAAOiY,GAAe,aAAc,6DAA8D1e,GAAyBhE,EAASC,IAC/H,GAAkB,KAAdD,EAAQC,IAA+B,KAAlBD,EAAQC,EAAI,GAAW,CAErDA,IACA,KACF,CACE,QAEJ,CAEF,OAAOA,CACT,CAEA,SAASiE,GAAoBlE,EAASC,GACpC,GAAID,EAAQO,OAASN,EAAI,GAAwB,MAAnBD,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,IAElE,IAAKA,GAAK,EAAGA,EAAID,EAAQO,OAAQN,IAC/B,GAAmB,MAAfD,EAAQC,IAAiC,MAAnBD,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,GAAY,CAC1EA,GAAK,EACL,KACF,OAEG,GACLD,EAAQO,OAASN,EAAI,GACF,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,GACZ,CACA,IAAIE,EAAqB,EACzB,IAAKF,GAAK,EAAGA,EAAID,EAAQO,OAAQN,IAC/B,GAAmB,MAAfD,EAAQC,GACVE,SACK,GAAmB,MAAfH,EAAQC,KACjBE,IAC2B,IAAvBA,GACF,KAIR,MAAO,GACLH,EAAQO,OAASN,EAAI,GACF,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,GAEZ,IAAKA,GAAK,EAAGA,EAAID,EAAQO,OAAQN,IAC/B,GAAmB,MAAfD,EAAQC,IAAiC,MAAnBD,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,GAAY,CAC1EA,GAAK,EACL,KACF,CAIJ,OAAOA,CACT,CAEA,MAAMmE,GAAc,IACdC,GAAc,IAOpB,SAASC,GAAiBtE,EAASC,GACjC,IAAIsE,EAAU,GACVlG,EAAY,GACZmG,GAAY,EAChB,KAAOvE,EAAID,EAAQO,OAAQN,IAAK,CAC9B,GAAID,EAAQC,KAAOmE,IAAepE,EAAQC,KAAOoE,GAC7B,KAAdhG,EACFA,EAAY2B,EAAQC,GACX5B,IAAc2B,EAAQC,KAG/B5B,EAAY,SAET,GAAmB,MAAf2B,EAAQC,IACC,KAAd5B,EAAkB,CACpBmG,GAAY,EACZ,KACF,CAEFD,GAAWvE,EAAQC,EACrB,CACA,MAAkB,KAAd5B,GAIG,CACLL,MAAOuG,EACPlC,MAAOpC,EACPuE,UAAWA,EAEf,CAKA,MAAMC,GAAoB,IAAI9F,OAAO,0DAA2D,KAIhG,SAAS+F,GAAwBH,EAAS5E,GAKxC,MAAMgF,EAAUU,EAAcd,EAASE,IACjCa,EAAY,CAAC,EAEnB,IAAK,IAAIrF,EAAI,EAAGA,EAAI0E,EAAQpE,OAAQN,IAAK,CACvC,GAA6B,IAAzB0E,EAAQ1E,GAAG,GAAGM,OAEhB,OAAOmiB,GAAe,cAAe,cAAgB/d,EAAQ1E,GAAG,GAAK,8BAA+BwF,GAAqBd,EAAQ1E,KAC5H,QAAsByF,IAAlBf,EAAQ1E,GAAG,SAAsCyF,IAAlBf,EAAQ1E,GAAG,GACnD,OAAOyiB,GAAe,cAAe,cAAgB/d,EAAQ1E,GAAG,GAAK,sBAAuBwF,GAAqBd,EAAQ1E,KACpH,QAAsByF,IAAlBf,EAAQ1E,GAAG,KAAqBN,EAAQyD,uBAEjD,OAAOsf,GAAe,cAAe,sBAAwB/d,EAAQ1E,GAAG,GAAK,oBAAqBwF,GAAqBd,EAAQ1E,KAKjI,MAAM0F,EAAWhB,EAAQ1E,GAAG,GAC5B,IAAKqjB,GAAiB3d,GACpB,OAAO+c,GAAe,cAAe,cAAgB/c,EAAW,wBAAyBF,GAAqBd,EAAQ1E,KAExH,GAAK5C,OAAOM,UAAUC,eAAeC,KAAKyH,EAAWK,GAInD,OAAO+c,GAAe,cAAe,cAAgB/c,EAAW,iBAAkBF,GAAqBd,EAAQ1E,KAF/GqF,EAAUK,GAAY,CAI1B,CAEA,OAAO,CACT,CAiBA,SAASG,GAAkB9F,EAASC,GAGlC,GAAmB,MAAfD,IADJC,GAEE,OAAQ,EACV,GAAmB,MAAfD,EAAQC,GAEV,OAtBJ,SAAiCD,EAASC,GACxC,IAAI8F,EAAK,KAKT,IAJmB,MAAf/F,EAAQC,KACVA,IACA8F,EAAK,cAEA9F,EAAID,EAAQO,OAAQN,IAAK,CAC9B,GAAmB,MAAfD,EAAQC,GACV,OAAOA,EACT,IAAKD,EAAQC,GAAG6E,MAAMiB,GACpB,KACJ,CACA,OAAQ,CACV,CASWC,CAAwBhG,IAD/BC,GAGF,IAAIgG,EAAQ,EACZ,KAAOhG,EAAID,EAAQO,OAAQN,IAAKgG,IAC9B,KAAIjG,EAAQC,GAAG6E,MAAM,OAASmB,EAAQ,IAAtC,CAEA,GAAmB,MAAfjG,EAAQC,GACV,MACF,OAAQ,CAHE,CAKZ,OAAOA,CACT,CAEA,SAASyiB,GAAe7f,EAAMD,EAASsD,GACrC,MAAO,CACLX,IAAK,CACH1C,KAAMA,EACN2C,IAAK5C,EACLE,KAAMoD,EAAWpD,MAAQoD,EACzBnD,IAAKmD,EAAWnD,KAGtB,CAEA,SAASugB,GAAiB3d,GACxB,OAAOY,EAAOZ,EAChB,CAIA,SAASkd,GAAgBpY,GACvB,OAAOlE,EAAOkE,EAChB,CAGA,SAASzG,GAAyBhE,EAASqC,GACzC,MAAM8D,EAAQnG,EAAQkB,UAAU,EAAGmB,GAAO+D,MAAM,SAChD,MAAO,CACLtD,KAAMqD,EAAM5F,OAGZwC,IAAKoD,EAAMA,EAAM5F,OAAS,GAAGA,OAAS,EAE1C,CAGA,SAASkF,GAAqBX,GAC5B,OAAOA,EAAMG,WAAaH,EAAM,GAAGvE,MACrC,CClae,MAAMgjB,GAEjBtgB,WAAAA,CAAYtD,GACR3C,KAAKwmB,iBAAmB,CAAC,EACzBxmB,KAAK2C,QAAUoK,EAAapK,EAEhC,CAMA8jB,KAAAA,CAAMzjB,EAAS0jB,GACX,GAAuB,iBAAZ1jB,GAAwBA,EAAQ6N,SACvC7N,EAAUA,EAAQ6N,gBACf,GAAuB,iBAAZ7N,EACd,MAAM,IAAIE,MAAM,mDAGpB,GAAIwjB,EAAkB,EACO,IAArBA,IAA2BA,EAAmB,CAAC,GAEnD,MAAMzU,EAASsT,GAASviB,EAAS0jB,GACjC,IAAe,IAAXzU,EACA,MAAM/O,MAAM,GAAG+O,EAAO1J,IAAIC,OAAOyJ,EAAO1J,IAAIzC,QAAQmM,EAAO1J,IAAIxC,MAEvE,CACA,MAAM4gB,EAAmB,IAAIxI,GAAiBne,KAAK2C,SACnDgkB,EAAiBxb,cAAcyQ,oBAAoB5b,KAAKwmB,kBACxD,MAAMI,EAAgBD,EAAiBrI,SAAStb,GAChD,OAAIhD,KAAK2C,QAAQgH,oBAAmCjB,IAAlBke,EAAoCA,EAC1DpC,GAASoC,EAAe5mB,KAAK2C,QAASgkB,EAAiBhX,QAASgX,EAAiB1H,gBACjG,CAOA4H,SAAAA,CAAU1mB,EAAKa,GACX,IAA4B,IAAxBA,EAAMwD,QAAQ,KACd,MAAM,IAAItB,MAAM,+BACb,IAA0B,IAAtB/C,EAAIqE,QAAQ,OAAqC,IAAtBrE,EAAIqE,QAAQ,KAC9C,MAAM,IAAItB,MAAM,wEACb,GAAc,MAAVlC,EACP,MAAM,IAAIkC,MAAM,6CAEhBlD,KAAKwmB,iBAAiBrmB,GAAOa,CAErC,CAYA,wBAAO+M,GACH,OAAOP,EAAQO,mBACnB,EC/DJ,MAAM+Y,GAAe,CACnBvB,SAAUA,ICPC3d,GAAS,CAClBmf,UAASA,CAACC,EAAUC,IACTA,EAAO1jB,QAAUyjB,EAE5BE,UAASA,CAACF,EAAUC,IACTA,EAAO1jB,QAAUyjB,EAE5BzjB,OAAMA,CAACyjB,EAAUC,IACNA,EAAO1jB,SAAWyjB,EAE7B3T,QAAOA,CAAC2T,EAAUC,EAAQE,EAAW,KACnB,IAAIxlB,OAAOqlB,EAAUG,GACtB9kB,KAAK4kB,GAEtBG,MAAKA,CAACJ,EAAUC,IACLD,IAAaC,EAExBI,GAAEA,CAACL,EAAUC,IACFD,EAAS5d,MAAM,KAAK5E,QAAQyiB,IAAW,GAIzCjD,GAAM,CACflC,IAAGA,CAACkF,EAAUC,IACHxJ,OAAOwJ,IAAWD,EAE7Bla,IAAGA,CAACka,EAAUC,IACHxJ,OAAOwJ,IAAWD,GAIpBM,GAAO,CAChBC,UAASA,CAACP,EAAUC,IACTA,GAAUD,EAErBQ,UAASA,CAACR,EAAUC,IACTA,GAAUD,GAIZS,GAmBN3F,CAACkF,EAAUC,IACHS,KAAKjB,MAAMQ,IAAWS,KAAKjB,MAAMO,GApBnCS,GAuBN3a,CAACka,EAAUC,IACHS,KAAKjB,MAAMQ,IAAWS,KAAKjB,MAAMO,GC7D1CW,GAAe,CAAC,kBAAmB,UAAW,kBAAmB,UAAW,UAE3E,MAAMC,GAKT3hB,WAAAA,CAAYtD,EAASklB,EAAYC,GAC7B9nB,KAAK2C,QAAUA,EACf3C,KAAK+nB,SAAW,GAChB/nB,KAAK6nB,WAAaA,EAIlB7nB,KAAKgoB,cAAgB,IAAItW,IAIzB1R,KAAKioB,cAAgBH,GAAgB,IAAIpW,GAC7C,CAQAwW,QAAAA,CAASC,EAAKhoB,EAAKioB,EAAOrY,GACtB,GAAI3C,MAAMrC,QAAQod,GAAM,CACpB,QAAczf,IAAV0f,QAA2C1f,IAApB0f,EAAM,gBACM1f,IAA/B0f,EAAM,UAAUC,WAUhB,OATAroB,KAAKsoB,gBAAgBF,EAAM,UAAWD,EAAI5kB,OAAQwM,QAClDoY,EAAII,QAAQ,CAAC5d,EAAKtF,KACd,MAAMmjB,EAAYzY,EAAO,IAAM1K,EAAQ,IACnChF,OAAOyN,KAAKsa,GAAO7kB,OAAS,EAC5BvD,KAAKyoB,wBAAwBN,EAAI9iB,GAAQ+iB,EAAOI,GAEhDxoB,KAAKkoB,SAASC,EAAI9iB,GAAQlF,EAAKioB,EAAOI,KAMtDxoB,KAAK+nB,SAAS3f,KAAK,CACfvC,KAAM,sBACNkK,KAAMA,EAAKlJ,OAAO,IAE1B,KAA0B,iBAARshB,EACdnoB,KAAKyoB,wBAAwBN,EAAKC,EAAOrY,IAEpB,iBAAVqY,GAAsBA,EAAM,UACnCpoB,KAAK0oB,iBAAiBP,EAAKhoB,EAAKioB,EAAOrY,GAChC/P,KAAK2oB,UAAUP,IACtBpoB,KAAK4oB,wBAAwBR,EAAOrY,GAExC/P,KAAK6oB,sBAAsBV,EAAKC,EAAOrY,GAE/C,CAEA8Y,qBAAAA,CAAsBV,EAAKC,EAAOrY,GAC9B,GACIqY,EAAM,WACNA,EAAM,UAAUU,SACoC,mBAA7C9oB,KAAK6nB,WAAWO,EAAM,UAAUU,SACzC,CACE,IAAIC,EAAM/oB,KAAK6nB,WAAWO,EAAM,UAAUU,SAASX,EAAKpY,EAAKlJ,OAAO,IACjD,iBAARkiB,GACP/oB,KAAK+nB,SAAS3f,KAAK2gB,EAE3B,CACJ,CAOAN,uBAAAA,CAAwBN,EAAKC,EAAOrY,GAChC,MAGMiZ,EC/EP,SAAqB5jB,EAAMgjB,GAC9B,MAAMa,EAAQ,CACV7jB,KAAM,GACNgjB,MAAO,GACPc,OAAQ,IAGZ,IAAK,IAAIjmB,EAAI,EAAGA,EAAImC,EAAK7B,OAAQN,KACG,IAA5BmlB,EAAM5jB,QAAQY,EAAKnC,IAAYgmB,EAAM7jB,KAAKgD,KAAKhD,EAAKnC,IACnDgmB,EAAMC,OAAO9gB,KAAKhD,EAAKnC,IAGhC,IAAK,IAAIA,EAAI,EAAGA,EAAImlB,EAAM7kB,OAAQN,KACE,IAA5BmC,EAAKZ,QAAQ4jB,EAAMnlB,KAA2B,MAAbmlB,EAAMnlB,IAAYgmB,EAAMb,MAAMhgB,KAAKggB,EAAMnlB,IAElF,OAAOgmB,CACX,CD+DqBE,CAHA9oB,OAAOyN,KAAKqa,GACP9nB,OAAOyN,KAAKsa,IAG9BpoB,KAAKopB,qBAAqBJ,EAAMjZ,GAChC/P,KAAKqpB,qBAAqBL,EAAMZ,EAAOrY,GAEvC/P,KAAK6oB,sBAAsBV,EAAKC,EAAOrY,GAIvC,MAAMuZ,EAAgBtpB,KAAKupB,oBAAoBpB,EAAKC,EAAOY,EAAKE,QAEhEF,EAAKE,OAAOX,QAASpoB,IACjB,MAAMqpB,EAAUzZ,EAAO,IAAM5P,EAC7BH,KAAKkoB,SAASC,EAAIhoB,GAAMA,EAAKioB,EAAMjoB,GAAMqpB,KAI7CxpB,KAAKypB,0BAA0BtB,EAAKC,EAAOY,EAAKE,OAAQnZ,GACxD/P,KAAK0pB,4BAA4BvB,EAAKC,EAAOY,EAAKE,OAAQnZ,EAAMuZ,GAChEtpB,KAAK2pB,4BAA4BxB,EAAKC,EAAOY,EAAKE,OAAQnZ,EAC9D,CAmBA0Z,yBAAAA,CAA0BtB,EAAKC,EAAOwB,EAAY7Z,GAE9C,MAAM8Z,EAAW9Z,EAAKlJ,OAAO,GACvBijB,EAAQ9pB,KAAKioB,cAAcznB,IAAIqpB,GAEhCC,GAELF,EAAWrB,QAASpoB,IAChB,MAAM4pB,EAAa3B,EAAMjoB,GACzB,IAAK4pB,IAAeA,EAAW,UAAW,OAC1C,MAAM3P,EAAI2P,EAAW,UAEfC,EAASF,EAAMtlB,QAAQrE,GAC7B,IAAgB,IAAZ6pB,EAAJ,CAEA,GAAI5P,EAAE6P,MAAO,CACT,MAAMC,EAAS9P,EAAE6P,MAEjB,QAAoBvhB,IAAhByf,EAAI+B,GAAuB,OAC/B,MAAMC,EAASL,EAAMtlB,QAAQ0lB,GAC7B,IAAgB,IAAZC,EAAe,OACfH,GAAUG,GACVnqB,KAAK+nB,SAAS3f,KAAK,CACfvC,KAAM,QACNkK,MAAOA,EAAO,IAAM5P,GAAK0G,OAAO,GAChCogB,OAAQ9mB,EACR6mB,SAAUkD,GAGtB,CAEA,GAAI9P,EAAEgQ,OAAQ,CACV,MAAMF,EAAS9P,EAAEgQ,OAEjB,QAAoB1hB,IAAhByf,EAAI+B,GAAuB,OAC/B,MAAMC,EAASL,EAAMtlB,QAAQ0lB,GAC7B,IAAgB,IAAZC,EAAe,OACfH,GAAUG,GACVnqB,KAAK+nB,SAAS3f,KAAK,CACfvC,KAAM,SACNkK,MAAOA,EAAO,IAAM5P,GAAK0G,OAAO,GAChCogB,OAAQ9mB,EACR6mB,SAAUkD,GAGtB,CAhCyB,GAkCjC,CA4BAP,2BAAAA,CAA4BxB,EAAKC,EAAOwB,EAAY7Z,GAChD,MAAMsa,EAAmB,CAAC,SAAU,YAAa,WAAY,YAE7DT,EAAWrB,QAASpoB,IAChB,MAAM4pB,EAAa3B,EAAMjoB,GACzB,IAAK4pB,IAAeA,EAAW,UAAW,OAC1C,MAAM3P,EAAI2P,EAAW,UAGrB,IAAKM,EAAiBle,KAAMme,QAAqB5hB,IAAZ0R,EAAEkQ,IAAsB,OAE7D,MAAMC,EAAYpC,EAAIhoB,GAGtB,GAAIoqB,QAA+C,OACnD,GAAyB,iBAAdA,EAAwB,OAEnC,MAAMC,EAAYpQ,EAAE5U,MAAQ,SAE5B6kB,EAAiB9B,QAAS+B,IACtB,QAAgB5hB,IAAZ0R,EAAEkQ,GAAqB,OAE3B,MAAMJ,EAAS9P,EAAEkQ,GACXG,EAAStC,EAAI+B,GAGnB,GAAIO,QAAyC,OAC7C,GAAsB,iBAAXA,EAAqB,OAGhC,MAAMC,EAAM1qB,KAAK2qB,mBAAmB5X,OAAOwX,GAAYxX,OAAO0X,GAASD,GAGvE,GAAY,OAARE,EAAc,OAElB,IAAIE,GAAW,EACF,WAATN,GAAgC,IAARI,IAAWE,GAAW,GACrC,cAATN,GAAgC,IAARI,IAAWE,GAAW,GACrC,aAATN,GAAwBI,GAAO,IAAIE,GAAW,GACrC,aAATN,GAAwBI,GAAO,IAAIE,GAAW,GAE9CA,GACA5qB,KAAK+nB,SAAS3f,KAAK,CACfvC,KAAMykB,EACNva,MAAOA,EAAO,IAAM5P,GAAK0G,OAAO,GAChCogB,OAAQlU,OAAOwX,GACfvD,SAAUkD,OAK9B,CAWAS,kBAAAA,CAAmBE,EAAGC,EAAGN,GACrB,GAAkB,SAAdA,EAAsB,CACtB,MAAMO,EAAKrD,KAAKjB,MAAMoE,GAChBG,EAAKtD,KAAKjB,MAAMqE,GACtB,OAAIpN,MAAMqN,IAAOrN,MAAMsN,GAAY,KAC5BD,EAAKC,CAChB,CACA,IAAyC,IAArCrD,GAAanjB,QAAQgmB,GAAmB,CACxC,MAAMS,EAAKxN,OAAOoN,GACZK,EAAKzN,OAAOqN,GAClB,OAAIpN,MAAMuN,IAAOvN,MAAMwN,GAAY,KAC5BD,EAAKC,CAChB,CAEA,OAAIL,EAAIC,GAAW,EACfD,EAAIC,EAAU,EACX,CACX,CAYAvB,mBAAAA,CAAoBpB,EAAKC,EAAOwB,GAC5B,MAAMvc,EAAM,IAAIqE,IAShB,OARAkY,EAAWrB,QAASpoB,IAChB,MAAMwK,EAAMwd,EAAIhoB,GACZiN,MAAMrC,QAAQJ,GACd0C,EAAIwE,IAAI1R,EAAKwK,EAAI0C,IAAI0F,SACdpI,SAAoD,iBAARA,GACnD0C,EAAIwE,IAAI1R,EAAK,CAAC4S,OAAOpI,OAGtB0C,CACX,CAUAqc,2BAAAA,CAA4BvB,EAAKC,EAAOwB,EAAY7Z,EAAMuZ,GAKtDM,EAAWrB,QAASpoB,IAChB,MAAM4pB,EAAa3B,EAAMjoB,GACzB,IAAK4pB,IAAeA,EAAW,UAAW,OAC1C,MAAMoB,EAASpB,EAAW,UAAUoB,OACpC,IAAKA,EAAQ,OAEb,MAAMC,EAAO9B,EAAc9oB,IAAIL,IAAQ,GACxB,WAAXgrB,GACAC,EAAK7C,QAAQ,CAAC8C,EAAGC,KACb,MAAMC,EAAYne,MAAMrC,QAAQod,EAAIhoB,KAC7B4P,EAAO,IAAM5P,EAAM,IAAMmrB,EAAM,KAAKzkB,OAAO,IAC3CkJ,EAAO,IAAM5P,GAAK0G,OAAO,GAChC7G,KAAKwrB,oBAAoBrrB,EAAKkrB,EAAGE,MAKjD,CASAE,wBAAAA,CAAyBC,EAAOC,EAAUC,GACtC,MAAMC,EAAO,IAAIna,IACjBga,EAAMnD,QAAQ,CAACuD,EAAMR,KACjB,MAAM3gB,EAAMmhB,EAAKH,GACjB,GAAIhhB,SAAoD,iBAARA,EAAkB,OAClE,MAAMohB,EAAShZ,OAAOpI,GAClBkhB,EAAKvW,IAAIyW,GACT/rB,KAAK+nB,SAAS3f,KAAK,CACfvC,KAAM,SACNkK,MAAO6b,EAAW,IAAMN,EAAM,KAAOK,GAAU9kB,OAAO,GACtD7F,MAAO+qB,IAGXF,EAAKha,IAAIka,EAAQT,IAG7B,CAQAE,mBAAAA,CAAoBQ,EAAWhrB,EAAOuqB,GAC7BvrB,KAAKgoB,cAAc1S,IAAI0W,IACxBhsB,KAAKgoB,cAAcnW,IAAIma,EAAW,IAAI7e,KAE1C,MAAM0e,EAAO7rB,KAAKgoB,cAAcxnB,IAAIwrB,GAChCH,EAAKvW,IAAItU,GACThB,KAAK+nB,SAAS3f,KAAK,CACfvC,KAAM,SACNkK,KAAMwb,EACNvqB,UAGJ6qB,EAAKje,IAAI5M,EAEjB,CAWA0nB,gBAAAA,CAAiB/d,EAAKxK,EAAKioB,EAAOrY,IACK,IAA/BqY,EAAM,UAAUC,YAChBroB,KAAKsoB,gBAAgBF,EAAM,UAAW,EAAGrY,GAE7C,MAAMkc,EAAU7D,EAAM,UAAU5iB,KAG1B0mB,EAAgBlsB,KAAKmsB,aAAa/D,GAExC,GAAgB,QAAZ6D,IAAuBA,GAAWjsB,KAAK2oB,UAAUP,GAC9B,iBAARzd,GAAoBA,EAAIpH,OAAS,GACxCvD,KAAK+nB,SAAS3f,KAAK,CACfvC,KAAM,4BACNkK,KAAMA,EAAKlJ,OAAO,GAClB7F,MAAO2J,IAGf3K,KAAK4oB,wBAAwBR,EAAOrY,QACjC,GAAgB,SAAZkc,EACPjsB,KAAKosB,aAAazhB,EAAKshB,EAASlc,GAChC/P,KAAKqsB,iBAAiBjE,EAAOzd,EAAKoF,QAC/B,GAAgB,YAAZkc,EACPjsB,KAAKssB,gBAAgB3hB,EAAKshB,EAASlc,QAChC,IAAuC,IAAnC4X,GAAanjB,QAAQynB,GACvBjsB,KAAKusB,WAAWN,EAASthB,GAG1B3K,KAAKwsB,YAAYN,EAAc,UAAW,MAAOzO,OAAO9S,GAAMoF,GAF9D/P,KAAKysB,mBAAmBR,EAASlc,EAAMpF,OAIxC,IAAgB,WAAZshB,GAAyBA,EAGhC,MAAM,IAAI/oB,MAAM,kCAAoC+oB,GAFpDjsB,KAAKwsB,YAAYN,EAAc,UAAW,SAAUvhB,EAAKoF,EAG7D,CACJ,CAOAoc,YAAAA,CAAa/D,GACT,IAAKA,EAAM,YAAcA,EAAM,UAAUsE,MAAO,OAAOtE,EACvD,MAAMuE,ECnZP,SAAoBD,GACvB,GAAqB,iBAAVA,EAAoB,OAAO,KACtC,MAAME,EAAQF,EAAMtjB,MAAM,MAC1B,GAAqB,IAAjBwjB,EAAMrpB,OAAc,OAAO,KAC/B,MAAMue,EAAMrE,OAAOmP,EAAM,IACnB9f,EAAM2Q,OAAOmP,EAAM,IACzB,OAAIlP,MAAMoE,IAAQpE,MAAM5Q,GAAa,KAC9B,CAAEgV,MAAKhV,MAClB,CD2YuB+f,CAAWzE,EAAM,UAAUsE,OAC1C,OAAKC,EAEE,IACAvE,EACH,SAAU,IACHA,EAAM,UACTtG,SAA6BpZ,IAAxB0f,EAAM,UAAUtG,IAAoBsG,EAAM,UAAUtG,IAAM/O,OAAO4Z,EAAO7K,KAC7EhV,SAA6BpE,IAAxB0f,EAAM,UAAUtb,IAAoBsb,EAAM,UAAUtb,IAAMiG,OAAO4Z,EAAO7f,OAPjEsb,CAUxB,CAUAiE,gBAAAA,CAAiBjE,EAAOzd,EAAKoF,GACzB,GAAI2N,MAAMgK,KAAKjB,MAAM9b,IAAO,OAC5B,MAAMyP,EAAIgO,EAAM,UAEhB,IAAItG,EAAM1H,EAAE0H,IACRhV,EAAMsN,EAAEtN,IAGZ,GAAIsN,EAAEsS,SAAW5K,IAAQhV,GAAM,CAC3B,MAAM6f,ECjaX,SAAwBD,GAC3B,GAAqB,iBAAVA,EAAoB,OAAO,KACtC,MAAME,EAAQF,EAAMtjB,MAAM,MAC1B,GAAqB,IAAjBwjB,EAAMrpB,OAAc,OAAO,KAC/B,MAAOue,EAAKhV,GAAO8f,EACnB,OAAIlP,MAAMgK,KAAKjB,MAAM3E,KAASpE,MAAMgK,KAAKjB,MAAM3Z,IAAc,KACtD,CAAEgV,MAAKhV,MAClB,CD0Z2BggB,CAAe1S,EAAEsS,OAC5BC,IACK7K,IAAKA,EAAM6K,EAAO7K,KAClBhV,IAAKA,EAAM6f,EAAO7f,KAE/B,MAEYpE,IAARoZ,GAAsBiL,GAAqBjL,EAAKnX,IAChD3K,KAAKgtB,qBAAqB,MAAOjd,EAAMpF,EAAKmX,QAEpCpZ,IAARoE,GAAsBigB,GAAqBjgB,EAAKnC,IAChD3K,KAAKgtB,qBAAqB,MAAOjd,EAAMpF,EAAKmC,EAEpD,CAMA8b,uBAAAA,CAAwBR,EAAOoB,GAC3B,MAAM1b,EAAOzN,OAAOyN,KAAKsa,GACzB,IAAK,IAAInlB,EAAI,EAAGA,EAAI6K,EAAKvK,OAAQN,IAAK,CAClC,GAAgB,WAAZ6K,EAAK7K,GAAiB,SAC1B,MACMgqB,EADQ7E,EAAMta,EAAK7K,IACG,UACxBgqB,IACIA,EAAc1F,WAAa0F,EAAc1F,UAAY,QAKnB7e,IAA3BukB,EAAcC,UAAqD,UAA3BD,EAAcC,WAJ7DltB,KAAK+nB,SAAS3f,KAAK,CACfvC,KAAM,UACNkK,MAAOyZ,EAAU,IAAM1b,EAAK7K,IAAI4D,OAAO,IASvD,CACJ,CAMA8hB,SAAAA,CAAU3Y,GACN,GAAmB,iBAARA,EAAkB,OAAO,EACpC,MAAMlC,EAAOzN,OAAOyN,KAAKkC,GACzB,OAAIA,EAAI,UACgB,IAAhBlC,EAAKvK,aAAT,EACuB,IAAhBuK,EAAKvK,MAKpB,CAEAypB,oBAAAA,CAAqBG,EAAM3D,EAASvC,EAAQD,GACxChnB,KAAK+nB,SAAS3f,KAAK,CACfvC,KAAMsnB,EACNpd,KAAMyZ,EAAQ3iB,OAAO,GACrBogB,SACAD,YAER,CAEAsB,eAAAA,CAAgBF,EAAOnB,EAAQuC,GAC3B,CAAC,YAAa,aAAajB,QAAS4E,IAChC,QAAoBzkB,IAAhB0f,EAAM+E,GAAqB,CAC3B,MAAMnG,EAAWvJ,OAAO2K,EAAM+E,IACzBJ,GAAiBI,GAAMnG,EAAUC,IAClCjnB,KAAKgtB,qBAAqBG,EAAM3D,EAASvC,EAAQD,EAEzD,GAER,CAEAoG,YAAAA,CAAahF,EAAOnB,EAAQuC,GACxB,CAAC,MAAO,OAAOjB,QAAS4E,IACpB,QAAoBzkB,IAAhB0f,EAAM+E,GAAqB,CAC3B,MAAMnG,EAAWvJ,OAAO2K,EAAM+E,IACzBJ,GAAgBI,GAAMnG,EAAUC,IACjCjnB,KAAKgtB,qBAAqBG,EAAM3D,EAASvC,EAAQD,EAEzD,GAER,CAEAqG,WAAAA,CAAYjF,EAAOnB,EAAQuC,GACvB,CAAC,YAAa,YAAa,UAAUjB,QAAS4E,IAC1C,QAAoBzkB,IAAhB0f,EAAM+E,GAAqB,CAC3B,MAAMnG,EAAWvJ,OAAO2K,EAAM+E,IACzBJ,GAAmBI,GAAMnG,EAAUC,IACpCjnB,KAAKgtB,qBAAqBG,EAAM3D,EAASvC,EAAQD,EAEzD,IAEJ,CAAC,QAAS,MAAMuB,QAAS4E,IACrB,QAAoBzkB,IAAhB0f,EAAM+E,GAAqB,CAC3B,MAAMnG,EAAWoB,EAAM+E,GAClBJ,GAAmBI,GAAMnG,EAAUC,IACpCjnB,KAAKgtB,qBAAqBG,EAAM3D,EAASvC,EAAQD,EAEzD,IAEJ,CAAC,UAAW,YAAa,aAAc,cAAcuB,QAAS4E,IAC1D,QAAoBzkB,IAAhB0f,EAAM+E,GAAqB,CAC3B,IAAIhG,EAAW,GACXgG,EAAK5pB,OAAS,IAAG4jB,EAAWgG,EAAKjpB,UAAU,IAC/C,MAAM8iB,EAAWoB,EAAM+E,GAClBJ,GAA4B,QAAE/F,EAAUC,EAAQE,IACjDnnB,KAAKgtB,qBAAqB,UAAWxD,EAASvC,EAAQD,EAE9D,GAER,CAEAwF,WAAAA,CAAYpE,EAAO6D,EAAShF,EAAQuC,GAChB,WAAZyC,EAAsBjsB,KAAKqtB,YAAYjF,EAAOnB,EAAQuC,GACrC,QAAZyC,GAAmBjsB,KAAKotB,aAAahF,EAAOnB,EAAQuC,EACjE,CAEA8C,eAAAA,CAAgBrF,EAAQgF,EAASzC,IACiB,IAA1CxpB,KAAK2C,QAAQ2qB,QAAQ9oB,QAAQyiB,IAC7BjnB,KAAKysB,mBAAmBR,EAASzC,EAASvC,EAElD,CAEAsF,UAAAA,CAAWN,EAASthB,GAChB,GAAK+S,MAAM/S,GAUP,OAAO,EAVM,CACb,MAAMqZ,EAAMvG,OAAO9S,GACnB,GACiB,oBAAZshB,GAAiCjI,EAAM,GAC3B,oBAAZiI,GAAiCjI,EAAM,GAC3B,YAAZiI,IA+GjB,SAAejrB,GACX,MAAMusB,EAAIC,WAAWxsB,GACrB,OAAY,EAAJusB,KAAWA,CACvB,CAlH2CE,CAAM9iB,GAEjC,OAAO,CAEf,CAGA,OAAO,CACX,CAEAyhB,YAAAA,CAAazhB,EAAKshB,EAASzC,GACvB,MAAM/B,EAAOC,KAAKjB,MAAM9b,GACpB+S,MAAM+J,IAAOznB,KAAKysB,mBAAmBR,EAASzC,EAAS7e,EAC/D,CAEA8hB,kBAAAA,CAAmBR,EAASzC,EAAS7e,GACjC3K,KAAK+nB,SAAS3f,KAAK,CACfvC,KAAM,SAAWomB,EACjBlc,KAAMyZ,EAAQ3iB,OAAO,GACrB7F,MAAO2J,GAEf,CAOA0e,oBAAAA,CAAqBL,EAAMZ,EAAOrY,GAC1BiZ,EAAKZ,OACLY,EAAKZ,MAAMG,QAASmF,IAChB,MAAMC,EAAYvF,EAAMsF,GAAS,UAC7BC,IAAqC,UAAvBA,EAAUT,UAAwBS,EAAUpG,UAAY,IACtEvnB,KAAK+nB,SAAS3f,KAAK,CACfvC,KAAM,UACNkK,MAAOA,EAAO,IAAM2d,GAAS7mB,OAAO,MAKxD,CAMAuiB,oBAAAA,CAAqBJ,EAAMjZ,GACnBiZ,EAAK5jB,OAASpF,KAAK2C,QAAQirB,cAC3B5E,EAAK5jB,KAAKmjB,QAASvY,IACfhQ,KAAK+nB,SAAS3f,KAAK,CACfvC,KAAM,UACNkK,MAAOA,EAAO,IAAMC,GAAKnJ,OAAO,MAIhD,EAMJ,MAAMgnB,GAAoBjG,GAAUjnB,UAAUunB,SAE9CN,GAAUjnB,UAAUunB,SAAW,SAAkBC,EAAKhoB,EAAKioB,EAAOrY,GAC9D,GACI3C,MAAMrC,QAAQod,SACJzf,IAAV0f,QACoB1f,IAApB0f,EAAM,gBACyB1f,IAA/B0f,EAAM,UAAUC,WAmBhB,OAhBAroB,KAAKsoB,gBAAgBF,EAAM,UAAWD,EAAI5kB,OAAQwM,GAClDoY,EAAII,QAAQ,CAAC5d,EAAKtF,KACd,MAAMmjB,EAAYzY,EAAO,IAAM1K,EAAQ,IACvC,GAAIhF,OAAOyN,KAAKsa,GAAO7kB,OAAS,EAC5BvD,KAAKyoB,wBAAwBN,EAAI9iB,GAAQ+iB,EAAOI,OAC7C,CAEH,MAAMsF,EAAc1F,EACpByF,GAAkBhtB,KAAKb,KAAMmoB,EAAI9iB,GAAQlF,EAAK2tB,EAAatF,EAC/D,SAIAL,EAAI5kB,OAAS,GAAuB,iBAAX4kB,EAAI,IAC7BnoB,KAAK+tB,sBAAsB5F,EAAKC,EAAOrY,IAM/C8d,GAAkBhtB,KAAKb,KAAMmoB,EAAKhoB,EAAKioB,EAAOrY,EAClD,EASA6X,GAAUjnB,UAAUotB,sBAAwB,SAAUrC,EAAOtD,EAAOrY,GAC9C1P,OAAOyN,KAAKsa,GAAO4F,OAAQC,GAAY,WAANA,GACzC1F,QAASoD,IACf,MAAM5B,EAAa3B,EAAMuD,GACpB5B,GAAeA,EAAW,WACK,SAAhCA,EAAW,UAAUoB,QACzBnrB,KAAKyrB,yBAAyBC,EAAOC,EAAU5b,IAEvD,EE9rBA,MAAMzN,GAAiB,CACnBsrB,cAAc,EACdN,QAAS,CAAC,OAAQ,UAuEtB,SAASY,GAAgBC,GACrB,IAAKA,EAAS,MAAM,IAAIjrB,MAAM,cACzB,GAAuB,iBAAZirB,EAAsB,MAAM,IAAIjrB,MAAM,sBACtD,MAAM+O,EAAS6U,GAAavB,SAAS4I,EAAS,CAC1C/nB,wBAAwB,IAE5B,IAAe,IAAX6L,EACA,MAAM,IAAI/O,MAAM+O,EAAO1J,IAAIC,IAAM,IAAMyJ,EAAO1J,IAAIzC,KAE1D,CAEA,SA/EO,MAKHG,WAAAA,CAAYmiB,EAAOzlB,GACfurB,GAAgB9F,GAChB,MAAMgG,EAAa,IAAI7H,GAAU,CAC7Bxc,kBAAkB,EAClBF,oBAAqB,SACrBD,oBAAqB,GACrBxD,wBAAwB,IAE5BpG,KAAKooB,MAAQgG,EAAW3H,MAAM2B,GAC9BpoB,KAAK2C,QAAUtC,OAAOuC,OAAO,CAAC,EAAGN,GAAgBK,GACjD3C,KAAK6nB,WAAa,CAAC,EAEnB7nB,KAAKoF,KAAO,IAChB,CAOAipB,QAAAA,CAAS3sB,EAAM2iB,GACXrkB,KAAK6nB,WAAWnmB,GAAQ2iB,CAC5B,CAOAkB,QAAAA,CAAS4I,GACLD,GAAgBC,GAMhB,MAAMrG,EAAe,IAAIpW,IAmBnBkP,EAPS,IAAI2F,GAAU,CACzBxc,kBAAkB,EAClBF,oBAAqB,KACrBD,oBAAqB,GACrBK,eAAe,EACfQ,kBAhBsBA,CAACC,EAAS4jB,EAAU7iB,KAE1C,MAAM8iB,EAAU9iB,EAAM8I,YAAY,KAC5Bia,GAA0B,IAAbD,EAAiB,GAAK9iB,EAAMvH,UAAU,EAAGqqB,GACvDzG,EAAaxS,IAAIkZ,IAAa1G,EAAajW,IAAI2c,EAAY,IAChE,MAAM7c,EAAWmW,EAAatnB,IAAIguB,GAGlC,OADI7c,EAASA,EAASpO,OAAS,KAAOmH,GAASiH,EAASvJ,KAAKsC,GACtD4jB,KAUW7H,MAAM0H,GAC5BnuB,KAAKoF,KAAOwb,EACZ,MAAM6N,EAAY,IAAI7G,GAAU5nB,KAAK2C,QAAS3C,KAAK6nB,WAAYC,GAE/D,OADA2G,EAAUvG,SAAStH,EAAQ,GAAI5gB,KAAKooB,MAAO,IACpCqG,EAAU1G,QACrB,GCtEwD,IAEtD2G,GAAe,oBAAAA,IAAA,CAGlB,OAHkBA,EACZnJ,SAAP,SAAgBviB,EAASL,GACvB,OtBUG,SAAkBK,EAASL,GAChCA,EAAUtC,OAAOuC,OAAO,CAAC,EAAGN,EAAgBK,GAE5C,IAAMkd,EAAO,GACT2F,GAAW,EAGXC,GAAc,EAEC,WAAfziB,EAAQ,KAEVA,EAAUA,EAAQ6D,OAAO,IAG3B,IAAI1E,EAAa,MACjB,GAAIa,EAAQ6F,WAAW,SAAU,CAC/B,IAAM8lB,EA+bV,SAA6B3rB,GAC3B,IAAM4rB,EAAQ5rB,EAAQwB,QAAQ,OACf,IAAXoqB,GACF7nB,EAAW,aAAc,2CAA4C,CAAEjB,KAAM,EAAGC,IAAK,IAcvF,IAXA,IASI+B,EATE+mB,EAAW7rB,EAAQkB,UAAU,EAAG0qB,GAChCE,EAAMF,EAAQ,EAGdG,EAAU,CAAC,UAAW,WAAY,cAClCC,EAAS,4CAEXhT,EAAU,MACViT,GAAkB,EAGqB,QAAnCnnB,EAAQknB,EAAOjnB,KAAK8mB,KAAqB,CAC/C,IAAMlmB,EAAWb,EAAM,GACjBgL,OAAyBpK,IAAbZ,EAAM,GAAmBA,EAAM,GAAKA,EAAM,GACtDonB,EAAUpnB,EAAMzC,MAGhB8pB,EAAaJ,EAAQvqB,QAAQmE,IACf,IAAhBwmB,GACFpoB,EAAW,aACT,+CAAiD4B,EAAW,6CAC5D,CAAE7C,KAAM,EAAGC,IAAK,EAAImpB,IAIpBC,GAAcF,GAChBloB,EAAW,aACT,8BAAgC4B,EAAW,oEAC3C,CAAE7C,KAAM,EAAGC,IAAK,EAAImpB,IAExBD,EAAiBE,EAEA,YAAbxmB,GACgB,QAAdmK,GAAqC,QAAdA,GACzB/L,EAAW,aACT,4BAA8B+L,EAAY,8CAC1C,CAAEhN,KAAM,EAAGC,IAAK,EAAImpB,IAExBlT,EAAUlJ,GACY,eAAbnK,GACS,QAAdmK,GAAqC,OAAdA,GACzB/L,EAAW,aACT,+BAAiC+L,EAAY,uCAC7C,CAAEhN,KAAM,EAAGC,IAAK,EAAImpB,GAI5B,CAGA,IAAME,EAAWP,EAASptB,QAAQ,sCAAuC,IAAIuD,OAO7E,OANIoqB,EAAS7rB,OAAS,GACpBwD,EAAW,aACT,8CAAgDqoB,EAAW,KAC3D,CAAEtpB,KAAM,EAAGC,IAAK,IAGb,CAAEiW,QAAAA,EAAS8S,IAAAA,EACpB,CA/fuBO,CAAoBrsB,GACvC,GAAI2rB,EAAWpmB,IAAK,OAAOomB,EAC3BxsB,EAAawsB,EAAW3S,QACxBhZ,EAAUA,EAAQkB,UAAUyqB,EAAWG,IACzC,CAIA,IAFA,IAAM3nB,EAAmB,IAAIzE,EAAiBC,EAAQ2D,QAASnE,GAEtDc,EAAI,EAAGA,EAAID,EAAQO,OAAQN,IAClC,GAAmB,MAAfD,EAAQC,IAAiC,MAAnBD,EAAQC,EAAI,IAGpC,IADAA,EAAIuD,EAAOxD,EADXC,GAAK,EACkBd,IACjBoG,IAAK,OAAOtF,OACb,GAAmB,MAAfD,EAAQC,GAAY,CAG7B,IAAI0iB,EAAc1iB,EAGlB,GAAmB,MAAfD,IAFJC,GAEwB,CACtB,IACEA,EAAIiE,EAAoBlE,EAASC,EAAGkE,EACtC,CAAE,MAAOoB,GACPxB,EAAW,aAAcwB,EAAI3C,QAASoB,EAAyBhE,EAASC,EAAI,GAC9E,CACA,QACF,CACE,IAAI2iB,GAAa,EACE,MAAf5iB,EAAQC,KACV2iB,GAAa,EACb3iB,KAIF,IADA,IAAIyH,EAAU,GAEZzH,EAAID,EAAQO,QACG,MAAfP,EAAQC,IACO,MAAfD,EAAQC,IACO,OAAfD,EAAQC,IACO,OAAfD,EAAQC,IACO,OAAfD,EAAQC,GACRA,IAEAyH,GAAW1H,EAAQC,GAIe,OAFpCyH,EAAUA,EAAQ1F,QAEN0F,EAAQnH,OAAS,KAE3BmH,EAAUA,EAAQxG,UAAU,EAAGwG,EAAQnH,OAAS,GAChDN,KAKG2F,EAAc8B,IAOjB3D,EAAW,aALmB,IAA1B2D,EAAQ1F,OAAOzB,OACX,2BAEA,QAAUmH,EAAU,wBAEE1D,EAAyBhE,EAAS2iB,IAGlE,IAAM1T,EAAS3K,EAAiBtE,EAASC,IAC1B,IAAXgP,GACFlL,EAAW,cAAe,mBAAqB2D,EAAU,qBAAsB1D,EAAyBhE,EAASC,IAEnH,IAAIsE,EAAU0K,EAAOjR,MAGrB,GAFAiC,EAAIgP,EAAO5M,MAEyB,MAAhCkC,EAAQA,EAAQhE,OAAS,GAAY,CAEvC,IAAMuiB,EAAe7iB,EAAIsE,EAAQhE,OAE3BwiB,EAAUre,EADhBH,EAAUA,EAAQrD,UAAU,EAAGqD,EAAQhE,OAAS,GACCZ,EAASR,IAC1C,IAAZ4jB,IACkB,IAAhBN,GACF1e,EAAW,aAAc,sCAAuCC,EAAyBhE,EAAS2iB,IAEpGH,GAAW,EAES,IAAhB3F,EAAKtc,SACPkiB,GAAc,IAMhB1e,EAAWgf,EAAQxd,IAAI1C,KAAMkgB,EAAQxd,IAAIC,IAAKxB,EAAyBhE,EAAS8iB,EAAeC,EAAQxd,IAAIzC,MAE/G,MAAO,GAAI8f,EACT,GAAK3T,EAAOzK,UAEL,GAAID,EAAQvC,OAAOzB,OAAS,EACjCwD,EAAW,aAAc,gBAAkB2D,EAAU,+CAAgD1D,EAAyBhE,EAAS2iB,SAClI,GAAoB,IAAhB9F,EAAKtc,OACdwD,EAAW,aAAc,gBAAkB2D,EAAU,yBAA0B1D,EAAyBhE,EAAS2iB,QAC5G,CACL,IAAMK,EAAMnG,EAAK/N,MACjB,GAAIpH,IAAYsb,EAAItb,QAAS,CAC3B,IAAIub,EAAUjf,EAAyBhE,EAASgjB,EAAIL,aACpD5e,EACE,aACA,yBAA2Bif,EAAItb,QAAU,qBAAuBub,EAAQngB,KAAO,SAAWmgB,EAAQlgB,IAAM,6BAA+B2E,EAAU,KACjJ1D,EAAyBhE,EAAS2iB,GAEtC,CAGoB,IAAhB9F,EAAKtc,SACPkiB,GAAc,EAElB,MApBE1e,EAAW,aAAc,gBAAkB2D,EAAU,iCAAkC1D,EAAyBhE,EAASC,QAqBtH,CACL,IAAM8iB,EAAUre,EAAwBH,EAAS5E,EAASR,IAC1C,IAAZ4jB,GACFhf,EAAWgf,EAAQxd,IAAI1C,KAAMkgB,EAAQxd,IAAIC,IAAKxB,EAAyBhE,EAASC,EAAIsE,EAAQhE,OAASwiB,EAAQxd,IAAIzC,QAG/F,IAAhB2f,EACF1e,EAAW,aAAc,sCAAuCC,EAAyBhE,EAASC,KAC9C,IAA3CN,EAAQ0D,aAAa7B,QAAQkG,IAGtCmV,EAAKzX,KAAK,CAAEsC,QAAAA,EAASib,YAAAA,IAEvBH,GAAW,CACb,CAIA,IAAKviB,IAAKA,EAAID,EAAQO,OAAQN,IAC5B,GAAmB,MAAfD,EAAQC,GAAY,CACtB,GAAuB,MAAnBD,EAAQC,EAAI,GAAY,CAE1BA,IACA,IACEA,EAAIiE,EAAoBlE,EAASC,EAAGkE,EACtC,CAAE,MAAOoB,GACPxB,EAAW,iBAAkBwB,EAAI3C,QAASoB,EAAyBhE,EAASC,EAAI,GAClF,CACA,QACF,CAAO,GAAuB,MAAnBD,EAAQC,EAAI,GAKrB,MAFA,IADAA,EAAIuD,EAAOxD,EADXC,GAAK,EACkBd,IACjBoG,IAAK,OAAOtF,CAItB,MAAO,GAAmB,MAAfD,EAAQC,GAAY,CAC7B,IAAMijB,EAAWpd,EAAkB9F,EAASC,IAC1B,IAAdijB,GACFnf,EAAW,cAAe,4BAA6BC,EAAyBhE,EAASC,IAC3FA,EAAIijB,CACN,MACsB,IAAhBT,GAAyBlf,EAAavD,EAAQC,KAChD8D,EAAW,aAAc,wBAAyBC,EAAyBhE,EAASC,IAIvE,MAAfD,EAAQC,IACVA,GAGN,KAAO,CACL,GAAIsD,EAAavD,EAAQC,IACvB,SAEEwiB,GACF1e,EAAW,aAAc,2BAA6B/D,EAAQC,GAAK,qBAAsB+D,EAAyBhE,EAASC,IAE7H8D,EAAW,cAAe,SAAW/D,EAAQC,GAAK,qBAAsB+D,EAAyBhE,EAASC,GAC5G,CAaF,OAVKuiB,EAEsB,IAAhB3F,EAAKtc,OACdwD,EAAW,aAAc,iBAAmB8Y,EAAK,GAAGnV,QAAU,KAAM1D,EAAyBhE,EAAS6c,EAAK,GAAG8F,cACrG9F,EAAKtc,OAAS,GACvBwD,EAAW,aAAc,YACvBof,KAAKC,UAAUvG,EAAKxS,IAAI,SAAAgZ,GAAC,OAAIA,EAAE3b,OAAO,IAAGjJ,QAAQ,SAAU,IAC3D,WAAY,CAAEqE,KAAM,EAAGC,IAAK,IAN9BgB,EAAW,aAAc,sBAAuB,CAAEjB,KAAM,EAAGC,IAAK,KAS3D,CACT,CsBtNWupB,CAAetsB,EAASL,EACjC,EAAC+rB,CAAA,CAHkB,G","sources":["webpack://fxp/webpack/universalModuleDefinition","webpack://fxp/webpack/bootstrap","webpack://fxp/webpack/runtime/define property getters","webpack://fxp/webpack/runtime/hasOwnProperty shorthand","webpack://fxp/webpack/runtime/make namespace object","webpack://fxp/./node_modules/xml-naming/src/index.js","webpack://fxp/./src/DocTypeValidator.js","webpack://fxp/./src/ValidationError.js","webpack://fxp/./src/validator.js","webpack://fxp/./src/util.js","webpack://fxp/./node_modules/fast-xml-parser/src/util.js","webpack://fxp/./node_modules/fast-xml-parser/src/xmlparser/OptionsBuilder.js","webpack://fxp/./node_modules/fast-xml-parser/src/xmlparser/xmlNode.js","webpack://fxp/./node_modules/fast-xml-parser/src/xmlparser/DocTypeReader.js","webpack://fxp/./node_modules/strnum/strnum.js","webpack://fxp/./node_modules/path-expression-matcher/src/Matcher.js","webpack://fxp/./node_modules/path-expression-matcher/src/Expression.js","webpack://fxp/./node_modules/path-expression-matcher/src/ExpressionSet.js","webpack://fxp/./node_modules/@nodable/entities/src/entities.js","webpack://fxp/./node_modules/@nodable/entities/src/EntityDecoder.js","webpack://fxp/./node_modules/fast-xml-parser/src/xmlparser/OrderedObjParser.js","webpack://fxp/./node_modules/fast-xml-parser/src/ignoreAttributes.js","webpack://fxp/./node_modules/fast-xml-parser/src/xmlparser/node2json.js","webpack://fxp/./node_modules/fast-xml-parser/src/validator.js","webpack://fxp/./node_modules/fast-xml-parser/src/xmlparser/XMLParser.js","webpack://fxp/./node_modules/fast-xml-parser/src/fxp.js","webpack://fxp/./node_modules/detailed-xml-validator/src/validations.js","webpack://fxp/./node_modules/detailed-xml-validator/src/Traverser.js","webpack://fxp/./node_modules/detailed-xml-validator/src/util.js","webpack://fxp/./node_modules/detailed-xml-validator/src/validator.js","webpack://fxp/./src/fxv.js"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"fxp\"] = factory();\n\telse\n\t\troot[\"fxp\"] = factory();\n})(this, () => {\nreturn ","// The require scope\nvar __webpack_require__ = {};\n\n","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","/*\n xml-naming\n * Validates XML Name productions as defined in the XML 1.0 and 1.1 specifications.\n * Covers: Name, NCName, QName, NMToken, NMTokens\n \n XML 1.0 spec: https://www.w3.org/TR/xml/#NT-Name\n * XML 1.1 spec: https://www.w3.org/TR/xml11/#NT-NameStartChar\n * XML NS spec: https://www.w3.org/TR/xml-names/#NT-NCName\n /\n\n// ---------------------------------------------------------------------------\n// Character class strings — XML 1.0\n//\n// NameStartChar ::= \":\" \| [A-Z] \| \"_\" \| [a-z]\n// \| [#xC0-#xD6] \| [#xD8-#xF6] \| [#xF8-#x2FF]\n// \| [#x370-#x37D] \| [#x37F-#x1FFF] <- split to exclude #x0487\n// \| [#x200C-#x200D]\n// \| [#x2070-#x218F] \| [#x2C00-#x2FEF]\n// \| [#x3001-#xD7FF] \| [#xF900-#xFDCF] \| [#xFDF0-#xFFFD]\n//\n// NameChar ::= NameStartChar \| \"-\" \| \".\" \| [0-9]\n// \| #xB7 \| [#x0300-#x036F] \| [#x203F-#x2040]\n//\n// Note: \\u0487 (Combining Cyrillic Millions Sign) was added in Unicode 4.0,\n// after XML 1.0 was defined against Unicode 2.0. It falls inside the range\n// \\u037F-\\u1FFF but must be excluded. We split that range into\n// \\u037F-\\u0486 and \\u0488-\\u1FFF to exclude it explicitly.\n// ---------------------------------------------------------------------------\n\nconst nameStartChar10 =\n ':A-Za-z_' +\n '\\u00C0-\\u00D6\\u00D8-\\u00F6\\u00F8-\\u02FF' +\n '\\u0370-\\u037D' +\n '\\u037F-\\u0486\\u0488-\\u1FFF' + // split to exclude \\u0487\n '\\u200C-\\u200D' +\n '\\u2070-\\u218F' +\n '\\u2C00-\\u2FEF' +\n '\\u3001-\\uD7FF' +\n '\\uF900-\\uFDCF' +\n '\\uFDF0-\\uFFFD';\n\nconst nameChar10 =\n nameStartChar10 +\n '\\\\-\\\\.\\\\d' +\n '\\u00B7' +\n '\\u0300-\\u036F' +\n '\\u203F-\\u2040';\n\n// ---------------------------------------------------------------------------\n// Character class strings — XML 1.1\n//\n// Differences from XML 1.0:\n//\n// NameStartChar:\n// 1.0 has split ranges: \\u00C0-\\u00D6, \\u00D8-\\u00F6, \\u00F8-\\u02FF\n// 1.1 merges them into: \\u00C0-\\u02FF\n// (\\u00D7 x and \\u00F7 / are division symbols, excluded in both versions)\n//\n// 1.0 tops out at \\uFFFD (BMP only)\n// 1.1 adds \\u{10000}-\\u{EFFFF} (supplementary planes)\n// These require the /u flag on the RegExp — see buildRegexes below.\n//\n// NameChar:\n// 1.1 adds \\u0487 (Combining Cyrillic Millions Sign, added in Unicode 4.0)\n// ---------------------------------------------------------------------------\n\nconst nameStartChar11 =\n ':A-Za-z_' +\n '\\u00C0-\\u02FF' + // merged — 1.0 had three split ranges here\n '\\u0370-\\u037D' +\n '\\u037F-\\u0486\\u0488-\\u1FFF' + // split to exclude \\u0487 (combining mark, never a NameStartChar)\n '\\u200C-\\u200D' +\n '\\u2070-\\u218F' +\n '\\u2C00-\\u2FEF' +\n '\\u3001-\\uD7FF' +\n '\\uF900-\\uFDCF' +\n '\\uFDF0-\\uFFFD' +\n '\\u{10000}-\\u{EFFFF}'; // supplementary planes — REQUIRES /u flag on RegExp\n\nconst nameChar11 =\n nameStartChar11 +\n '\\\\-\\\\.\\\\d' +\n '\\u00B7' +\n '\\u0300-\\u036F' +\n '\\u0487' + // Combining Cyrillic Millions Sign — valid in 1.1, not 1.0\n '\\u203F-\\u2040';\n\n// ---------------------------------------------------------------------------\n// Regex builders\n//\n// XML 1.0 regexes: no flags — BMP only, standard JS regex behaviour.\n// XML 1.1 regexes: /u flag — required for \\u{10000}-\\u{EFFFF} to match actual\n// supplementary code points rather than lone surrogates (which are illegal XML).\n// ---------------------------------------------------------------------------\n\nconst buildRegexes = (startChar, char, flags = '') => {\n const ncStart = startChar.replace(':', '');\n const ncChar = char.replace(':', '');\n const ncNamePat = `[${ncStart}][${ncChar}]`;\n\n return {\n name: new RegExp(`^[${startChar}][${char}]$`, flags),\n ncName: new RegExp(`^${ncNamePat}$`, flags),\n qName: new RegExp(`^${ncNamePat}(?::${ncNamePat})?$`, flags),\n nmToken: new RegExp(`^[${char}]+$`, flags),\n nmTokens: new RegExp(`^[${char}]+(?:\\\\s+[${char}]+)$`, flags),\n };\n};\n\nconst regexes10 = buildRegexes(nameStartChar10, nameChar10); // no /u — BMP only\nconst regexes11 = buildRegexes(nameStartChar11, nameChar11, 'u'); // /u — enables \\u{10000}-\\u{EFFFF}\n\nconst getRegexes = (xmlVersion = '1.0') =>\n xmlVersion === '1.1' ? regexes11 : regexes10;\n\n// ---------------------------------------------------------------------------\n// Boolean validators\n// ---------------------------------------------------------------------------\n\n/*\n Returns true if the string is a valid XML Name.\n * Colons are allowed anywhere (Name production).\n * Used for: DOCTYPE entity names, notation names, DTD element declarations.\n /\nexport const name = (str, { xmlVersion = '1.0' } = {}) =>\n getRegexes(xmlVersion).name.test(str);\n\n/\n Returns true if the string is a valid NCName (Non-Colonized Name).\n * Colons are not permitted.\n * Used for: namespace prefixes, local names, SVG id attributes.\n /\nexport const ncName = (str, { xmlVersion = '1.0' } = {}) =>\n getRegexes(xmlVersion).ncName.test(str);\n\n/\n Returns true if the string is a valid QName (Qualified Name).\n * Allows exactly one colon as a prefix separator: prefix:localName.\n * Used for: element and attribute names in namespace-aware XML/SVG.\n /\nexport const qName = (str, { xmlVersion = '1.0' } = {}) =>\n getRegexes(xmlVersion).qName.test(str);\n\n/\n Returns true if the string is a valid NMToken.\n * Like Name but no restriction on the first character.\n * Used for: DTD NMTOKEN attribute values.\n /\nexport const nmToken = (str, { xmlVersion = '1.0' } = {}) =>\n getRegexes(xmlVersion).nmToken.test(str);\n\n/\n Returns true if the string is a valid NMTokens value.\n * A whitespace-separated list of NMToken values.\n * Used for: DTD NMTOKENS attribute values.\n /\nexport const nmTokens = (str, { xmlVersion = '1.0' } = {}) =>\n getRegexes(xmlVersion).nmTokens.test(str);\n\n// ---------------------------------------------------------------------------\n// Diagnostic validator\n// ---------------------------------------------------------------------------\n\nconst PRODUCTIONS = ['name', 'ncName', 'qName', 'nmToken', 'nmTokens'];\n\n/\n Validates a string against a named production and returns a detailed result.\n \n @param {string} str\n * @param {'name'\|'ncName'\|'qName'\|'nmToken'\|'nmTokens'} production\n * @param {{ xmlVersion?: '1.0'\|'1.1' }} [opts]\n * @returns {{ valid: boolean, production: string, input: string, reason?: string, position?: number }}\n /\nexport const validate = (str, production, { xmlVersion = '1.0' } = {}) => {\n if (!PRODUCTIONS.includes(production)) {\n throw new TypeError(\n `Unknown production \"${production}\". Must be one of: ${PRODUCTIONS.join(', ')}`\n );\n }\n\n const validators = { name, ncName, qName, nmToken, nmTokens };\n const isValid = validators[production](str, { xmlVersion });\n\n if (isValid) return { valid: true, production, input: str };\n\n let reason = 'Does not match the production rules';\n let position;\n\n if (str.length === 0) {\n reason = 'Input is empty';\n } else if (production === 'ncName' && str.includes(':')) {\n position = str.indexOf(':');\n reason = 'Colon is not allowed in NCName';\n } else if (production === 'qName' && str.startsWith(':')) {\n reason = 'QName cannot start with a colon';\n position = 0;\n } else if (production === 'qName' && str.endsWith(':')) {\n reason = 'QName cannot end with a colon';\n position = str.length - 1;\n } else if (production === 'qName' && (str.match(/:/g) \|\| []).length > 1) {\n reason = 'QName can have at most one colon';\n position = str.lastIndexOf(':');\n } else if (\n ['name', 'ncName', 'qName'].includes(production) &&\n !/^[:A-Za-z_\\u00C0-\\uFFFD]/.test(str[0])\n ) {\n reason = `First character \"${str[0]}\" is not a valid NameStartChar`;\n position = 0;\n } else {\n for (let i = 0; i < str.length; i++) {\n if (!/[\\w\\-\\\\.:\\u00B7\\u00C0-\\uFFFD]/.test(str[i])) {\n reason = `Character \"${str[i]}\" at position ${i} is not a valid NameChar`;\n position = i;\n break;\n }\n }\n }\n\n return { valid: false, production, input: str, reason, position };\n};\n\n// ---------------------------------------------------------------------------\n// Batch validator\n// ---------------------------------------------------------------------------\n\n/\n Validates an array of strings against a named production.\n \n @param {string[]} strings\n * @param {'name'\|'ncName'\|'qName'\|'nmToken'\|'nmTokens'} production\n * @param {{ xmlVersion?: '1.0'\|'1.1' }} [opts]\n * @returns {Array<{ valid: boolean, production: string, input: string, reason?: string, position?: number }>}\n /\nexport const validateAll = (strings, production, opts = {}) =>\n strings.map(str => validate(str, production, opts));\n\n// ---------------------------------------------------------------------------\n// Sanitizer\n// ---------------------------------------------------------------------------\n\n/\n Transforms an invalid string into the nearest valid XML name for the given production.\n \n @param {string} str\n * @param {'name'\|'ncName'\|'qName'\|'nmToken'\|'nmTokens'} production\n * @param {{ replacement?: string }} [opts]\n * @returns {string}\n /\nexport const sanitize = (str, production = 'name', { replacement = '_' } = {}) => {\n if (!str) return replacement;\n\n let result = str;\n\n // Strip colons for NCName\n if (production === 'ncName') {\n result = result.replace(/:/g, '');\n }\n\n // Replace illegal characters\n result = result.replace(/[^\\w\\-\\.:\\u00B7\\u00C0-\\uFFFD]/g, replacement);\n\n // Fix invalid start character for Name / NCName / QName\n if (production !== 'nmToken' && production !== 'nmTokens') {\n if (/^[\\-\\.\\d]/.test(result)) {\n result = replacement + result;\n }\n }\n\n return result \|\| replacement;\n};","import { name as isXmlName } from 'xml-naming';\n\nconst defaultOptions = {\n maxEntityCount: Infinity,\n maxEntitySize: Infinity,\n};\n\nexport default class DocTypeValidator {\n constructor(options, xmlVersion = '1.0') {\n this.options = Object.assign({}, defaultOptions, options);\n this.suppressValidationErr = !options;\n this.xmlVersion = xmlVersion;\n }\n\n validateDocType(xmlData, i) {\n if (\n xmlData[i + 3] !== 'O' \|\|\n xmlData[i + 4] !== 'C' \|\|\n xmlData[i + 5] !== 'T' \|\|\n xmlData[i + 6] !== 'Y' \|\|\n xmlData[i + 7] !== 'P' \|\|\n xmlData[i + 8] !== 'E'\n ) {\n throw new Error(`Invalid Tag instead of DOCTYPE`);\n }\n\n i += 9;\n let angleBracketsCount = 1;\n let hasBody = false;\n let comment = false;\n let entityCount = 0;\n\n for (; i < xmlData.length; i++) {\n if (xmlData[i] === '<' && !comment) {\n if (hasBody && hasSeq(xmlData, '!ENTITY', i)) {\n i += 7;\n [entityCount, i] = this._validateEntityExp(xmlData, i + 1, entityCount);\n // continue;\n } else if (hasBody && hasSeq(xmlData, '!ELEMENT', i)) {\n i += 8;\n i = this._validateElementExp(xmlData, i + 1);\n // continue;\n } else if (hasBody && hasSeq(xmlData, '!ATTLIST', i)) {\n i += 8;\n i = this._validateAttlistExp(xmlData, i + 1);\n continue;\n } else if (hasBody && hasSeq(xmlData, '!NOTATION', i)) {\n i += 9;\n i = this._validateNotationExp(xmlData, i + 1);\n // continue;\n } else if (hasSeq(xmlData, '!--', i)) {\n comment = true;\n } else {\n throw new Error(`Invalid DOCTYPE`);\n }\n angleBracketsCount++;\n } else if (xmlData[i] === '>') {\n if (comment) {\n if (xmlData[i - 1] === '-' && xmlData[i - 2] === '-') {\n comment = false;\n angleBracketsCount--;\n }\n } else {\n angleBracketsCount--;\n }\n if (angleBracketsCount === 0) break;\n } else if (xmlData[i] === '[') {\n hasBody = true;\n }\n }\n\n if (angleBracketsCount !== 0) {\n throw new Error(`Unclosed DOCTYPE`);\n }\n\n return i;\n }\n\n _validateEntityExp(xmlData, i, entityCount) {\n i = skipWhitespace(xmlData, i);\n\n // Read and validate entity name\n const nameStart = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i]) && xmlData[i] !== '\"' && xmlData[i] !== \"'\") {\n i++;\n }\n const entityName = xmlData.substring(nameStart, i);\n validateName(entityName, this.xmlVersion);\n\n i = skipWhitespace(xmlData, i);\n\n // Check for unsupported constructs\n if (!this.suppressValidationErr) {\n if (xmlData.substring(i, i + 6).toUpperCase() === 'SYSTEM') {\n throw new Error('External entities are not supported');\n } else if (xmlData[i] === '%') {\n throw new Error('Parameter entities are not supported');\n }\n }\n\n // Read and validate the entity value (validates quoting + size limit)\n let entityValue;\n [i, entityValue] = readQuotedValue(xmlData, i, 'entity');\n\n const { maxEntitySize, maxEntityCount } = this.options;\n\n if (entityValue.length > maxEntitySize) {\n throw new Error(\n `Entity \"${entityName}\" size (${entityValue.length}) exceeds maximum allowed size (${maxEntitySize})`\n );\n }\n\n // Only count non-parameter entities (parameter entities contain '&')\n if (entityValue.indexOf('&') === -1) {\n entityCount++;\n if (entityCount > maxEntityCount) {\n throw new Error(\n `Entity count (${entityCount}) exceeds maximum allowed (${maxEntityCount})`\n );\n }\n }\n\n return [entityCount, i - 1];\n }\n\n _validateNotationExp(xmlData, i) {\n i = skipWhitespace(xmlData, i);\n\n // Read and validate notation name\n const nameStart = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) i++;\n const notationName = xmlData.substring(nameStart, i);\n !this.suppressValidationErr && validateName(notationName, this.xmlVersion);\n\n i = skipWhitespace(xmlData, i);\n\n const identifierType = xmlData.substring(i, i + 6).toUpperCase();\n if (!this.suppressValidationErr && identifierType !== 'SYSTEM' && identifierType !== 'PUBLIC') {\n throw new Error(`Expected SYSTEM or PUBLIC, found \"${identifierType}\"`);\n }\n i += identifierType.length;\n i = skipWhitespace(xmlData, i);\n\n if (identifierType === 'PUBLIC') {\n [i] = readQuotedValue(xmlData, i, 'publicIdentifier');\n i = skipWhitespace(xmlData, i);\n if (xmlData[i] === '\"' \|\| xmlData[i] === \"'\") {\n [i] = readQuotedValue(xmlData, i, 'systemIdentifier');\n }\n } else if (identifierType === 'SYSTEM') {\n [i] = readQuotedValue(xmlData, i, 'systemIdentifier');\n }\n\n return --i;\n }\n\n _validateElementExp(xmlData, i) {\n i = skipWhitespace(xmlData, i);\n\n // Read and validate element name\n const nameStart = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) i++;\n const elementName = xmlData.substring(nameStart, i);\n if (!this.suppressValidationErr && !isXmlName(elementName, { xmlVersion: this.xmlVersion })) {\n throw new Error(`Invalid element name: \"${elementName}\"`);\n }\n\n i = skipWhitespace(xmlData, i);\n\n // Validate content model keyword or group\n if (xmlData[i] === 'E' && hasSeq(xmlData, 'MPTY', i)) {\n i += 4;\n } else if (xmlData[i] === 'A' && hasSeq(xmlData, 'NY', i)) {\n i += 2;\n } else if (xmlData[i] === '(') {\n i++;\n while (i < xmlData.length && xmlData[i] !== ')') i++;\n if (xmlData[i] !== ')') throw new Error('Unterminated content model');\n } else if (!this.suppressValidationErr) {\n throw new Error(`Invalid Element Expression, found \"${xmlData[i]}\"`);\n }\n\n return i;\n }\n\n _validateAttlistExp(xmlData, i) {\n i = skipWhitespace(xmlData, i);\n\n // Read element name\n const elemNameStart = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) i++;\n const elementName = xmlData.substring(elemNameStart, i);\n validateName(elementName, this.xmlVersion);\n\n i = skipWhitespace(xmlData, i);\n\n // Read attribute name\n const attrNameStart = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) i++;\n const attributeName = xmlData.substring(attrNameStart, i);\n validateName(attributeName, this.xmlVersion);\n\n i = skipWhitespace(xmlData, i);\n\n // Read attribute type\n if (xmlData.substring(i, i + 8).toUpperCase() === 'NOTATION') {\n i += 8;\n i = skipWhitespace(xmlData, i);\n if (xmlData[i] !== '(') throw new Error(`Expected '(', found \"${xmlData[i]}\"`);\n i++;\n while (i < xmlData.length && xmlData[i] !== ')') {\n const notationStart = i;\n while (i < xmlData.length && xmlData[i] !== '\|' && xmlData[i] !== ')') i++;\n const notation = xmlData.substring(notationStart, i).trim();\n validateName(notation, this.xmlVersion);\n if (xmlData[i] === '\|') {\n i++;\n i = skipWhitespace(xmlData, i);\n }\n }\n if (xmlData[i] !== ')') throw new Error('Unterminated list of notations');\n i++;\n } else {\n const typeStart = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) i++;\n const attributeType = xmlData.substring(typeStart, i);\n const validTypes = ['CDATA', 'ID', 'IDREF', 'IDREFS', 'ENTITY', 'ENTITIES', 'NMTOKEN', 'NMTOKENS'];\n if (!this.suppressValidationErr && !validTypes.includes(attributeType.toUpperCase())) {\n throw new Error(`Invalid attribute type: \"${attributeType}\"`);\n }\n }\n\n i = skipWhitespace(xmlData, i);\n\n // Read default value declaration\n if (xmlData.substring(i, i + 9).toUpperCase() === '#REQUIRED') {\n i += 9;\n } else if (xmlData.substring(i, i + 8).toUpperCase() === '#IMPLIED') {\n i += 8;\n } else {\n [i] = readQuotedValue(xmlData, i, 'ATTLIST default value');\n }\n\n return i;\n }\n}\n\n// ─── Helpers ────────────────────────────────────────────────────────────────\n\nfunction skipWhitespace(data, index) {\n while (index < data.length && /\\s/.test(data[index])) index++;\n return index;\n}\n\nfunction hasSeq(data, seq, i) {\n for (let j = 0; j < seq.length; j++) {\n if (seq[j] !== data[i + j + 1]) return false;\n }\n return true;\n}\n\nfunction validateName(name, xmlVersion = '1.0') {\n if (!isXmlName(name, { xmlVersion })) throw new Error(`Invalid entity name \"${name}\"`);\n}\n\n/\n Read a single- or double-quoted string and return [nextIndex, value].\n /\nfunction readQuotedValue(xmlData, i, type) {\n const startChar = xmlData[i];\n if (startChar !== '\"' && startChar !== \"'\") {\n throw new Error(`Expected quoted string for ${type}, found \"${startChar}\"`);\n }\n i++;\n const start = i;\n while (i < xmlData.length && xmlData[i] !== startChar) i++;\n if (xmlData[i] !== startChar) throw new Error(`Unterminated ${type} value`);\n const value = xmlData.substring(start, i);\n return [++i, value];\n}","export default class ValidationError extends Error {\n constructor(message, code, line, col) {\n super(message);\n this.name = this.constructor.name;\n this.code = code;\n this.line = line;\n this.col = col;\n Error.captureStackTrace?.(this, this.constructor);\n }\n}","'use strict';\n\nimport { getAllMatches } from './util.js';\nimport { name as xmlName, qName } from 'xml-naming';\nimport DocTypeValidator from './DocTypeValidator.js';\nimport ValidationError from './ValidationError.js';\n\nconst defaultOptions = {\n allowBooleanAttributes: false,\n unpairedTags: [],\n // DOCTYPE entity limits — Infinity means no limit by default\n docType: {\n maxEntityCount: Infinity,\n maxEntitySize: Infinity,\n },\n};\n\nexport function validate(xmlData, options) {\n options = Object.assign({}, defaultOptions, options);\n\n const tags = [];\n let tagFound = false;\n\n //indicates that the root tag has been closed (aka. depth 0 has been reached)\n let reachedRoot = false;\n\n if (xmlData[0] === '\\ufeff') {\n // check for byte order mark (BOM)\n xmlData = xmlData.substr(1);\n }\n\n let xmlVersion = '1.0'; // default per spec\n if (xmlData.startsWith('<?xml')) {\n const declResult = parseXmlDeclaration(xmlData);\n if (declResult.err) return declResult;\n xmlVersion = declResult.version;\n xmlData = xmlData.substring(declResult.end);\n }\n\n const docTypeValidator = new DocTypeValidator(options.docType, xmlVersion);\n\n for (let i = 0; i < xmlData.length; i++) {\n if (xmlData[i] === '<' && xmlData[i + 1] === '?') {\n i += 2;\n i = readPI(xmlData, i, xmlVersion);\n if (i.err) return i;\n } else if (xmlData[i] === '<') {\n //starting of tag\n //read until you reach to '>' avoiding any '>' in attribute value\n let tagStartPos = i;\n i++;\n\n if (xmlData[i] === '!') {\n try {\n i = readCommentAndCDATA(xmlData, i, docTypeValidator);\n } catch (err) {\n throwError(\"InvalidTag\", err.message, getLineNumberForPosition(xmlData, i - 1));\n }\n continue;\n } else {\n let closingTag = false;\n if (xmlData[i] === '/') {\n closingTag = true;\n i++;\n }\n\n let tagName = '';\n for (;\n i < xmlData.length &&\n xmlData[i] !== '>' &&\n xmlData[i] !== ' ' &&\n xmlData[i] !== '\\t' &&\n xmlData[i] !== '\\n' &&\n xmlData[i] !== '\\r';\n i++\n ) {\n tagName += xmlData[i];\n }\n tagName = tagName.trim();\n\n if (tagName[tagName.length - 1] === '/') {\n //self closing tag without attributes\n tagName = tagName.substring(0, tagName.length - 1);\n i--;\n }\n\n // use validateQName so namespaced tags (e.g. <ns:tag>) are\n // accepted and malformed ones (e.g. <:tag>, <ns:>, <a:b:c>) are rejected.\n if (!validateQName(tagName)) {\n let msg;\n if (tagName.trim().length === 0) {\n msg = \"Invalid space after '<'.\";\n } else {\n msg = \"Tag '\" + tagName + \"' is an invalid name.\";\n }\n throwError('InvalidTag', msg, getLineNumberForPosition(xmlData, tagStartPos));\n }\n\n const result = readAttributeStr(xmlData, i);\n if (result === false) {\n throwError('InvalidAttr', \"Attributes for '\" + tagName + \"' have open quote.\", getLineNumberForPosition(xmlData, i));\n }\n let attrStr = result.value;\n i = result.index;\n\n if (attrStr[attrStr.length - 1] === '/') {\n //self closing tag\n const attrStrStart = i - attrStr.length;\n attrStr = attrStr.substring(0, attrStr.length - 1);\n const isValid = validateAttributeString(attrStr, options, xmlVersion);\n if (isValid === true) {\n if (reachedRoot === true) {\n throwError('InvalidXml', 'Multiple possible root nodes found.', getLineNumberForPosition(xmlData, tagStartPos));\n }\n tagFound = true;\n //if no open tags remain on the stack, this self-closing tag is the root\n if (tags.length === 0) {\n reachedRoot = true;\n }\n } else {\n //the result from the nested function returns the position of the error within the attribute\n //in order to get the 'true' error line, we need to calculate the position where the attribute begins (i - attrStr.length) and then add the position within the attribute\n //this gives us the absolute index in the entire xml, which we can use to find the line at last\n throwError(isValid.err.code, isValid.err.msg, getLineNumberForPosition(xmlData, attrStrStart + isValid.err.line));\n }\n } else if (closingTag) {\n if (!result.tagClosed) {\n throwError('InvalidTag', \"Closing tag '\" + tagName + \"' doesn't have proper closing.\", getLineNumberForPosition(xmlData, i));\n } else if (attrStr.trim().length > 0) {\n throwError('InvalidTag', \"Closing tag '\" + tagName + \"' can't have attributes or invalid starting.\", getLineNumberForPosition(xmlData, tagStartPos));\n } else if (tags.length === 0) {\n throwError('InvalidTag', \"Closing tag '\" + tagName + \"' has not been opened.\", getLineNumberForPosition(xmlData, tagStartPos));\n } else {\n const otg = tags.pop();\n if (tagName !== otg.tagName) {\n let openPos = getLineNumberForPosition(xmlData, otg.tagStartPos);\n throwError(\n 'InvalidTag',\n \"Expected closing tag '\" + otg.tagName + \"' (opened in line \" + openPos.line + \", col \" + openPos.col + \") instead of closing tag '\" + tagName + \"'.\",\n getLineNumberForPosition(xmlData, tagStartPos)\n );\n }\n\n //when there are no more tags, we reached the root level.\n if (tags.length === 0) {\n reachedRoot = true;\n }\n }\n } else {\n const isValid = validateAttributeString(attrStr, options, xmlVersion);\n if (isValid !== true) {\n throwError(isValid.err.code, isValid.err.msg, getLineNumberForPosition(xmlData, i - attrStr.length + isValid.err.line));\n }\n\n if (reachedRoot === true) {\n throwError('InvalidXml', 'Multiple possible root nodes found.', getLineNumberForPosition(xmlData, i));\n } else if (options.unpairedTags.indexOf(tagName) !== -1) {\n // don't push into stack\n } else {\n tags.push({ tagName, tagStartPos });\n }\n tagFound = true;\n }\n\n //skip tag text value\n //It may include comments and CDATA value\n for (i++; i < xmlData.length; i++) {\n if (xmlData[i] === '<') {\n if (xmlData[i + 1] === '!') {\n //comment or CADATA\n i++;\n try {\n i = readCommentAndCDATA(xmlData, i, docTypeValidator);\n } catch (err) {\n throwError(\"InvalidDocType\", err.message, getLineNumberForPosition(xmlData, i - 1));\n }\n continue;\n } else if (xmlData[i + 1] === '?') {\n i += 2;\n i = readPI(xmlData, i, xmlVersion);\n if (i.err) return i;\n } else {\n break;\n }\n } else if (xmlData[i] === '&') {\n const afterAmp = validateAmpersand(xmlData, i);\n if (afterAmp === -1)\n throwError('InvalidChar', \"char '&' is not expected.\", getLineNumberForPosition(xmlData, i));\n i = afterAmp;\n } else {\n if (reachedRoot === true && !isWhiteSpace(xmlData[i])) {\n throwError('InvalidXml', 'Extra text at the end', getLineNumberForPosition(xmlData, i));\n }\n }\n } //end of reading tag text value\n if (xmlData[i] === '<') {\n i--;\n }\n }\n } else {\n if (isWhiteSpace(xmlData[i])) {\n continue;\n }\n if (reachedRoot) {\n throwError('InvalidXml', \"Extra text at the end: '\" + xmlData[i] + \"' is not expected.\", getLineNumberForPosition(xmlData, i));\n }\n throwError('InvalidChar', \"char '\" + xmlData[i] + \"' is not expected.\", getLineNumberForPosition(xmlData, i));\n }\n }\n\n if (!tagFound) {\n throwError('InvalidXml', 'Start tag expected.', { line: 1, col: 1 });\n } else if (tags.length === 1) {\n throwError('InvalidTag', \"Unclosed tag '\" + tags[0].tagName + \"'.\", getLineNumberForPosition(xmlData, tags[0].tagStartPos));\n } else if (tags.length > 0) {\n throwError('InvalidXml', \"Invalid '\" +\n JSON.stringify(tags.map(t => t.tagName)).replace(/\\r?\\n/g, '') +\n \"' found.\", { line: 1, col: 1 });\n }\n\n return true;\n}\n\nfunction isWhiteSpace(char) {\n return char === ' ' \|\| char === '\\t' \|\| char === '\\n' \|\| char === '\\r';\n}\n\nfunction readPI(xmlData, i, xmlVersion = '1.0') {\n const piStart = i; // points just after '<?'\n const nameStart = i;\n let nameValidated = false;\n\n for (; i < xmlData.length; i++) {\n const ch = xmlData[i];\n\n if (!nameValidated && (ch === ' ' \|\| ch === '?')) {\n // First delimiter — extract and validate the PI target name once\n const piName = xmlData.substr(nameStart, i - nameStart);\n nameValidated = true;\n\n if (piName.toLowerCase() === 'xml') {\n throwError(\n 'InvalidXml',\n 'XML declaration allowed only at the start of the document.',\n getLineNumberForPosition(xmlData, piStart - 2) // point at '<'\n );\n } else if (!xmlName(piName, { xmlVersion })) {\n // PI target must be a valid XML Name (XML 1.0 §2.6)\n throwError(\n 'InvalidXml',\n `Processing instruction target \"${piName}\" is not a valid XML Name.`,\n getLineNumberForPosition(xmlData, piStart - 2)\n );\n }\n }\n\n if (ch === '?' && xmlData[i + 1] === '>') {\n i++;\n return i;\n }\n }\n\n // reached EOF without closing '?>'\n throwError(\n 'InvalidXml',\n 'Processing instruction is not closed with \"?>\".',\n getLineNumberForPosition(xmlData, piStart - 2) // point at '<'\n );\n}\n\n/\n Handles comments, CDATA sections, and DOCTYPE declarations.\n * DOCTYPE validation is delegated to DocTypeValidator.\n * @param {string} xmlData\n * @param {number} i — points at the '!' character\n * @param {DocTypeValidator} docTypeValidator\n /\nfunction readCommentAndCDATA(xmlData, i, docTypeValidator) {\n if (xmlData.length > i + 2 && xmlData[i + 1] === '-' && xmlData[i + 2] === '-') {\n // Comment: <!-- ... -->\n for (i += 3; i < xmlData.length; i++) {\n if (xmlData[i] === '-' && xmlData[i + 1] === '-' && xmlData[i + 2] === '>') {\n i += 2;\n break;\n }\n }\n if (xmlData[i] !== '>') {\n throw new Error('Comment is not closed with \"-->\".');\n }\n } else if (\n xmlData.length > i + 7 &&\n xmlData[i + 1] === 'D' &&\n xmlData[i + 2] === 'O' &&\n xmlData[i + 3] === 'C' &&\n xmlData[i + 4] === 'T' &&\n xmlData[i + 5] === 'Y' &&\n xmlData[i + 6] === 'P' &&\n xmlData[i + 7] === 'E'\n ) {\n // DOCTYPE: delegate fully to DocTypeValidator\n // i currently points at '!', so the '<' is at i - 1\n i = docTypeValidator.validateDocType(xmlData, i - 1);\n } else if (\n xmlData.length > i + 8 &&\n xmlData[i + 1] === '[' &&\n xmlData[i + 2] === 'C' &&\n xmlData[i + 3] === 'D' &&\n xmlData[i + 4] === 'A' &&\n xmlData[i + 5] === 'T' &&\n xmlData[i + 6] === 'A' &&\n xmlData[i + 7] === '['\n ) {\n // CDATA: <![CDATA[ ... ]]>\n for (i += 8; i < xmlData.length; i++) {\n if (xmlData[i] === ']' && xmlData[i + 1] === ']' && xmlData[i + 2] === '>') {\n i += 2;\n break;\n }\n }\n if (xmlData[i] !== '>') {\n throw new Error('CDATA section is not closed with \"]]>\".');\n }\n } else {\n //Reject unrecognised <! constructs (e.g. <!ELEMENT, <!ATTLIST\n // appearing outside a DOCTYPE, or simply malformed \"<!xyz\").\n throw new Error(\"Invalid construct starting with '<!'.\");\n }\n\n return i;\n}\n\nconst doubleQuote = '\"';\nconst singleQuote = \"'\";\n\n/\n Keep reading xmlData until '<' is found outside the attribute value.\n * @param {string} xmlData\n * @param {number} i\n /\nfunction readAttributeStr(xmlData, i) {\n let attrStr = '';\n let startChar = '';\n let tagClosed = false;\n for (; i < xmlData.length; i++) {\n if (xmlData[i] === doubleQuote \|\| xmlData[i] === singleQuote) {\n if (startChar === '') {\n startChar = xmlData[i];\n } else if (startChar !== xmlData[i]) {\n // opposite quote inside value — allowed\n } else {\n startChar = '';\n }\n } else if (xmlData[i] === '>') {\n if (startChar === '') {\n tagClosed = true;\n break;\n }\n }\n attrStr += xmlData[i];\n }\n if (startChar !== '') {\n return false;\n }\n return { value: attrStr, index: i, tagClosed };\n}\n\nconst validAttrStrRegxp = new RegExp('(\\\\s)([^\\\\s=]+)(\\\\s=)?(\\\\s([\\'\"])(([\\\\s\\\\S])?)\\\\5)?', 'g');\n\nfunction validateAttributeString(attrStr, options, xmlVersion) {\n const matches = getAllMatches(attrStr, validAttrStrRegxp);\n const attrNames = {};\n\n for (let i = 0; i < matches.length; i++) {\n if (matches[i][1].length === 0) {\n return { err: { code: 'InvalidAttr', msg: \"Attribute '\" + matches[i][2] + \"' has no space in starting.\", line: getPositionFromMatch(matches[i]) } };\n } else if (matches[i][3] !== undefined && matches[i][4] === undefined) {\n return { err: { code: 'InvalidAttr', msg: \"Attribute '\" + matches[i][2] + \"' is without value.\", line: getPositionFromMatch(matches[i]) } };\n } else if (matches[i][3] === undefined && !options.allowBooleanAttributes) {\n return { err: { code: 'InvalidAttr', msg: \"boolean attribute '\" + matches[i][2] + \"' is not allowed.\", line: getPositionFromMatch(matches[i]) } };\n }\n\n const attrName = matches[i][2];\n\n //validate attribute names as QNames so namespaced attributes\n // (e.g. xml:lang, xmlns:xsi) are accepted and malformed ones are rejected.\n if (!validateQName(attrName, xmlVersion)) {\n return { err: { code: 'InvalidAttr', msg: \"Attribute '\" + attrName + \"' is an invalid name.\", line: getPositionFromMatch(matches[i]) } };\n }\n\n // xmlns=\"\" (undeclaring the prefixed namespace) is valid in XML 1.1\n if (attrName.startsWith('xmlns:') && matches[i][6] === '' && xmlVersion === '1.0') {\n return {\n err: {\n code: 'InvalidAttr',\n msg: `Undeclaring the prefixed namespace ${attrName}=\"\" is only permitted in XML 1.1 documents.`,\n line: getPositionFromMatch(matches[i])\n }\n };\n }\n\n if (!Object.prototype.hasOwnProperty.call(attrNames, attrName)) {\n attrNames[attrName] = 1;\n } else {\n return { err: { code: 'InvalidAttr', msg: \"Attribute '\" + attrName + \"' is repeated.\", line: getPositionFromMatch(matches[i]) } };\n }\n }\n\n return true;\n}\n\nfunction validateNumberAmpersand(xmlData, i) {\n let re = /\\d/;\n if (xmlData[i] === 'x') {\n i++;\n re = /[\\da-fA-F]/;\n }\n for (; i < xmlData.length; i++) {\n if (xmlData[i] === ';') return i;\n if (!xmlData[i].match(re)) break;\n }\n return -1;\n}\n\nfunction validateAmpersand(xmlData, i) {\n i++;\n if (xmlData[i] === ';') return -1;\n if (xmlData[i] === '#') {\n i++;\n return validateNumberAmpersand(xmlData, i);\n }\n let count = 0;\n for (; i < xmlData.length; i++, count++) {\n if (xmlData[i].match(/\\w/) && count < 20) continue;\n if (xmlData[i] === ';') break;\n return -1;\n }\n return i;\n}\n\nfunction throwError(code, message, lineNumber) {\n throw new ValidationError(message, code, lineNumber.line \|\| lineNumber, lineNumber.col);\n}\n\n/\n Validate an XML QName (Namespaces in XML 1.0 §2.3).\n * Delegates to xml-naming's qName production, which enforces:\n * - Non-empty input.\n * - At most one colon (used as prefix separator).\n * - Neither prefix nor local part may be empty (:foo, ns:, : all rejected).\n * - Both parts must satisfy NCName character rules.\n /\nfunction validateQName(str, xmlVersion = '1.0') {\n return qName(str, { xmlVersion });\n}\n\nfunction getLineNumberForPosition(xmlData, index) {\n const lines = xmlData.substring(0, index).split(/\\r?\\n/);\n return {\n line: lines.length,\n col: lines[lines.length - 1].length + 1,\n };\n}\n\nfunction getPositionFromMatch(match) {\n return match.startIndex + match[1].length;\n}\n\n/\n Parses and validates the XML declaration: <?xml version=\"...\" encoding=\"...\" standalone=\"...\"?>\n \n Rules (XML 1.0 §2.8 / XML 1.1 §2.8):\n * - Attributes must appear in fixed order: version, encoding, standalone\n * - No other attributes are allowed\n * - version is optional (defaults to '1.0'); if present must be '1.0' or '1.1'\n * - encoding and standalone are optional\n * - All values must be quoted (single or double)\n \n @param {string} xmlData — full XML string starting with '<?xml'\n * @returns {{ version: string, end: number } \| { err: true }}\n /\nfunction parseXmlDeclaration(xmlData) {\n const piEnd = xmlData.indexOf('?>');\n if (piEnd === -1) {\n throwError('InvalidXml', 'XML declaration is not closed with \"?>\".', { line: 1, col: 1 });\n }\n\n const declBody = xmlData.substring(5, piEnd); // content between '<?xml' and '?>' — keep leading whitespace for regex\n const end = piEnd + 2;\n\n // Allowed attributes in required order\n const ALLOWED = ['version', 'encoding', 'standalone'];\n const attrRe = /\\s+([\\w]+)\\s=\\s(?:\"([^\"])\"\|'([^'])')/g;\n\n let version = '1.0';\n let lastAllowedIdx = -1;\n let match;\n\n while ((match = attrRe.exec(declBody)) !== null) {\n const attrName = match[1];\n const attrValue = match[2] !== undefined ? match[2] : match[3];\n const attrPos = match.index;\n\n // Must be a known attribute\n const allowedIdx = ALLOWED.indexOf(attrName);\n if (allowedIdx === -1) {\n throwError('InvalidXml',\n 'XML declaration contains unknown attribute \"' + attrName + '\". Allowed: version, encoding, standalone.',\n { line: 1, col: 6 + attrPos });\n }\n\n // Must appear in fixed order: version, encoding, standalone\n if (allowedIdx <= lastAllowedIdx) {\n throwError('InvalidXml',\n 'XML declaration attribute \"' + attrName + '\" is out of order. Required order: version, encoding, standalone.',\n { line: 1, col: 6 + attrPos });\n }\n lastAllowedIdx = allowedIdx;\n\n if (attrName === 'version') {\n if (attrValue !== '1.0' && attrValue !== '1.1') {\n throwError('InvalidXml',\n 'XML declaration version \"' + attrValue + '\" is not supported. Must be \"1.0\" or \"1.1\".',\n { line: 1, col: 6 + attrPos });\n }\n version = attrValue;\n } else if (attrName === 'standalone') {\n if (attrValue !== 'yes' && attrValue !== 'no') {\n throwError('InvalidXml',\n 'XML declaration standalone \"' + attrValue + '\" is invalid. Must be \"yes\" or \"no\".',\n { line: 1, col: 6 + attrPos });\n }\n }\n // encoding: value format validation is out of scope\n }\n\n // Check for leftover unrecognised content (e.g. unquoted tokens or junk)\n const leftover = declBody.replace(/\\s+[\\w]+\\s=\\s(?:\"[^\"]\"\|'[^']')/g, '').trim();\n if (leftover.length > 0) {\n throwError('InvalidXml',\n 'XML declaration contains invalid content: \"' + leftover + '\".',\n { line: 1, col: 1 });\n }\n\n return { version, end };\n}\n","'use strict';\n\nexport function getAllMatches(string, regex) {\n const matches = [];\n let match = regex.exec(string);\n while (match) {\n const allmatches = [];\n allmatches.startIndex = regex.lastIndex - match[0].length;\n const len = match.length;\n for (let index = 0; index < len; index++) {\n allmatches.push(match[index]);\n }\n matches.push(allmatches);\n match = regex.exec(string);\n }\n return matches;\n}\n\nexport function isExist(v) {\n return typeof v !== 'undefined';\n}\n\nexport function isEmptyObject(obj) {\n return Object.keys(obj).length === 0;\n}\n\nexport function getValue(v) {\n if (exports.isExist(v)) {\n return v;\n } else {\n return '';\n }\n}\n\n/\n Dangerous property names that could lead to prototype pollution or security issues\n /\nexport const DANGEROUS_PROPERTY_NAMES = [\n // '__proto__',\n // 'constructor',\n // 'prototype',\n 'hasOwnProperty',\n 'toString',\n 'valueOf',\n '__defineGetter__',\n '__defineSetter__',\n '__lookupGetter__',\n '__lookupSetter__'\n];\n\nexport const criticalProperties = [\"__proto__\", \"constructor\", \"prototype\"];","'use strict';\n\nconst nameStartChar = ':A-Za-z_\\\\u00C0-\\\\u00D6\\\\u00D8-\\\\u00F6\\\\u00F8-\\\\u02FF\\\\u0370-\\\\u037D\\\\u037F-\\\\u1FFF\\\\u200C-\\\\u200D\\\\u2070-\\\\u218F\\\\u2C00-\\\\u2FEF\\\\u3001-\\\\uD7FF\\\\uF900-\\\\uFDCF\\\\uFDF0-\\\\uFFFD';\nconst nameChar = nameStartChar + '\\\\-.\\\\d\\\\u00B7\\\\u0300-\\\\u036F\\\\u203F-\\\\u2040';\nexport const nameRegexp = '[' + nameStartChar + '][' + nameChar + ']';\nconst regexName = new RegExp('^' + nameRegexp + '$');\n\nexport function getAllMatches(string, regex) {\n const matches = [];\n let match = regex.exec(string);\n while (match) {\n const allmatches = [];\n allmatches.startIndex = regex.lastIndex - match[0].length;\n const len = match.length;\n for (let index = 0; index < len; index++) {\n allmatches.push(match[index]);\n }\n matches.push(allmatches);\n match = regex.exec(string);\n }\n return matches;\n}\n\nexport const isName = function (string) {\n const match = regexName.exec(string);\n return !(match === null \|\| typeof match === 'undefined');\n}\n\nexport function isExist(v) {\n return typeof v !== 'undefined';\n}\n\nexport function isEmptyObject(obj) {\n return Object.keys(obj).length === 0;\n}\n\nexport function getValue(v) {\n if (exports.isExist(v)) {\n return v;\n } else {\n return '';\n }\n}\n\n/*\n Dangerous property names that could lead to prototype pollution or security issues\n /\nexport const DANGEROUS_PROPERTY_NAMES = [\n // '__proto__',\n // 'constructor',\n // 'prototype',\n 'hasOwnProperty',\n 'toString',\n 'valueOf',\n '__defineGetter__',\n '__defineSetter__',\n '__lookupGetter__',\n '__lookupSetter__'\n];\n\nexport const criticalProperties = [\"__proto__\", \"constructor\", \"prototype\"];","import { DANGEROUS_PROPERTY_NAMES, criticalProperties } from \"../util.js\";\nimport { COMMON_HTML, CURRENCY } from '@nodable/entities';\n\nconst defaultOnDangerousProperty = (name) => {\n if (DANGEROUS_PROPERTY_NAMES.includes(name)) {\n return \"__\" + name;\n }\n return name;\n};\n\n\nexport const defaultOptions = {\n preserveOrder: false,\n attributeNamePrefix: '@_',\n attributesGroupName: false,\n textNodeName: '#text',\n ignoreAttributes: true,\n removeNSPrefix: false, // remove NS from tag name or attribute name if true\n allowBooleanAttributes: false, //a tag can have attributes without any value\n //ignoreRootElement : false,\n parseTagValue: true,\n parseAttributeValue: false,\n trimValues: true, //Trim string values of tag and attributes\n cdataPropName: false,\n numberParseOptions: {\n hex: true,\n leadingZeros: true,\n eNotation: true\n },\n tagValueProcessor: function (tagName, val) {\n return val;\n },\n attributeValueProcessor: function (attrName, val) {\n return val;\n },\n stopNodes: [], //nested tags will not be parsed even for errors\n alwaysCreateTextNode: false,\n isArray: () => false,\n commentPropName: false,\n unpairedTags: [],\n processEntities: true,\n htmlEntities: false,\n entityDecoder: null,\n ignoreDeclaration: false,\n ignorePiTags: false,\n transformTagName: false,\n transformAttributeName: false,\n updateTag: function (tagName, jPath, attrs) {\n return tagName\n },\n // skipEmptyListItem: false\n captureMetaData: false,\n maxNestedTags: 100,\n strictReservedNames: true,\n jPath: true, // if true, pass jPath string to callbacks; if false, pass matcher instance\n onDangerousProperty: defaultOnDangerousProperty\n};\n\n\n/\n Validates that a property name is safe to use\n * @param {string} propertyName - The property name to validate\n * @param {string} optionName - The option field name (for error message)\n * @throws {Error} If property name is dangerous\n /\nfunction validatePropertyName(propertyName, optionName) {\n if (typeof propertyName !== 'string') {\n return; // Only validate string property names\n }\n\n const normalized = propertyName.toLowerCase();\n if (DANGEROUS_PROPERTY_NAMES.some(dangerous => normalized === dangerous.toLowerCase())) {\n throw new Error(\n `[SECURITY] Invalid ${optionName}: \"${propertyName}\" is a reserved JavaScript keyword that could cause prototype pollution`\n );\n }\n\n if (criticalProperties.some(dangerous => normalized === dangerous.toLowerCase())) {\n throw new Error(\n `[SECURITY] Invalid ${optionName}: \"${propertyName}\" is a reserved JavaScript keyword that could cause prototype pollution`\n );\n }\n}\n\n/\n Normalizes processEntities option for backward compatibility\n * @param {boolean\|object} value \n * @returns {object} Always returns normalized object\n /\nfunction normalizeProcessEntities(value, htmlEntities) {\n // Boolean backward compatibility\n if (typeof value === 'boolean') {\n return {\n enabled: value, // true or false\n maxEntitySize: 10000,\n maxExpansionDepth: 10000,\n maxTotalExpansions: Infinity,\n maxExpandedLength: 100000,\n maxEntityCount: 1000,\n allowedTags: null,\n tagFilter: null,\n appliesTo: \"all\",\n };\n }\n\n // Object config - merge with defaults\n if (typeof value === 'object' && value !== null) {\n return {\n enabled: value.enabled !== false,\n maxEntitySize: Math.max(1, value.maxEntitySize ?? 10000),\n maxExpansionDepth: Math.max(1, value.maxExpansionDepth ?? 10000),\n maxTotalExpansions: Math.max(1, value.maxTotalExpansions ?? Infinity),\n maxExpandedLength: Math.max(1, value.maxExpandedLength ?? 100000),\n maxEntityCount: Math.max(1, value.maxEntityCount ?? 1000),\n allowedTags: value.allowedTags ?? null,\n tagFilter: value.tagFilter ?? null,\n appliesTo: value.appliesTo ?? \"all\",\n };\n }\n\n // Default to enabled with limits\n return normalizeProcessEntities(true);\n}\n\nexport const buildOptions = function (options) {\n const built = Object.assign({}, defaultOptions, options);\n\n // Validate property names to prevent prototype pollution\n const propertyNameOptions = [\n { value: built.attributeNamePrefix, name: 'attributeNamePrefix' },\n { value: built.attributesGroupName, name: 'attributesGroupName' },\n { value: built.textNodeName, name: 'textNodeName' },\n { value: built.cdataPropName, name: 'cdataPropName' },\n { value: built.commentPropName, name: 'commentPropName' }\n ];\n\n for (const { value, name } of propertyNameOptions) {\n if (value) {\n validatePropertyName(value, name);\n }\n }\n\n if (built.onDangerousProperty === null) {\n built.onDangerousProperty = defaultOnDangerousProperty;\n }\n\n // Always normalize processEntities for backward compatibility and validation\n built.processEntities = normalizeProcessEntities(built.processEntities, built.htmlEntities);\n built.unpairedTagsSet = new Set(built.unpairedTags);\n // Convert old-style stopNodes for backward compatibility\n if (built.stopNodes && Array.isArray(built.stopNodes)) {\n built.stopNodes = built.stopNodes.map(node => {\n if (typeof node === 'string' && node.startsWith('.')) {\n // Old syntax: .tagname meant \"tagname anywhere\"\n // Convert to new syntax: ..tagname\n return '..' + node.substring(2);\n }\n return node;\n });\n }\n //console.debug(built.processEntities)\n return built;\n};","'use strict';\n\nlet METADATA_SYMBOL;\n\nif (typeof Symbol !== \"function\") {\n METADATA_SYMBOL = \"@@xmlMetadata\";\n} else {\n METADATA_SYMBOL = Symbol(\"XML Node Metadata\");\n}\n\nexport default class XmlNode {\n constructor(tagname) {\n this.tagname = tagname;\n this.child = []; //nested tags, text, cdata, comments in order\n this[\":@\"] = Object.create(null); //attributes map\n }\n add(key, val) {\n // this.child.push( {name : key, val: val, isCdata: isCdata });\n if (key === \"__proto__\") key = \"#__proto__\";\n this.child.push({ [key]: val });\n }\n addChild(node, startIndex) {\n if (node.tagname === \"__proto__\") node.tagname = \"#__proto__\";\n if (node[\":@\"] && Object.keys(node[\":@\"]).length > 0) {\n this.child.push({ [node.tagname]: node.child, [\":@\"]: node[\":@\"] });\n } else {\n this.child.push({ [node.tagname]: node.child });\n }\n // if requested, add the startIndex\n if (startIndex !== undefined) {\n // Note: for now we just overwrite the metadata. If we had more complex metadata,\n // we might need to do an object append here: metadata = { ...metadata, startIndex }\n this.child[this.child.length - 1][METADATA_SYMBOL] = { startIndex };\n }\n }\n /* symbol used for metadata /\n static getMetaDataSymbol() {\n return METADATA_SYMBOL;\n }\n}\n","import { isName } from '../util.js';\n\nexport default class DocTypeReader {\n constructor(options) {\n this.suppressValidationErr = !options;\n this.options = options;\n }\n\n readDocType(xmlData, i) {\n const entities = Object.create(null);\n let entityCount = 0;\n\n if (xmlData[i + 3] === 'O' &&\n xmlData[i + 4] === 'C' &&\n xmlData[i + 5] === 'T' &&\n xmlData[i + 6] === 'Y' &&\n xmlData[i + 7] === 'P' &&\n xmlData[i + 8] === 'E') {\n i = i + 9;\n let angleBracketsCount = 1;\n let hasBody = false, comment = false;\n let exp = \"\";\n for (; i < xmlData.length; i++) {\n if (xmlData[i] === '<' && !comment) { //Determine the tag type\n if (hasBody && hasSeq(xmlData, \"!ENTITY\", i)) {\n i += 7;\n let entityName, val;\n [entityName, val, i] = this.readEntityExp(xmlData, i + 1, this.suppressValidationErr);\n if (val.indexOf(\"&\") === -1) { //Parameter entities are not supported\n if (this.options.enabled !== false &&\n this.options.maxEntityCount != null &&\n entityCount >= this.options.maxEntityCount) {\n throw new Error(\n `Entity count (${entityCount + 1}) exceeds maximum allowed (${this.options.maxEntityCount})`\n );\n }\n //const escaped = entityName.replace(/[.\\-+:]/g, '\\\\.');\n //const escaped = entityName.replace(/[.+?^${}()\|[\\]\\\\]/g, '\\\\$&');\n entities[entityName] = val;\n entityCount++;\n }\n }\n else if (hasBody && hasSeq(xmlData, \"!ELEMENT\", i)) {\n i += 8;//Not supported\n const { index } = this.readElementExp(xmlData, i + 1);\n i = index;\n } else if (hasBody && hasSeq(xmlData, \"!ATTLIST\", i)) {\n i += 8;//Not supported\n // const {index} = this.readAttlistExp(xmlData,i+1);\n // i = index;\n } else if (hasBody && hasSeq(xmlData, \"!NOTATION\", i)) {\n i += 9;//Not supported\n const { index } = this.readNotationExp(xmlData, i + 1, this.suppressValidationErr);\n i = index;\n } else if (hasSeq(xmlData, \"!--\", i)) comment = true;\n else throw new Error(`Invalid DOCTYPE`);\n\n angleBracketsCount++;\n exp = \"\";\n } else if (xmlData[i] === '>') { //Read tag content\n if (comment) {\n if (xmlData[i - 1] === \"-\" && xmlData[i - 2] === \"-\") {\n comment = false;\n angleBracketsCount--;\n }\n } else {\n angleBracketsCount--;\n }\n if (angleBracketsCount === 0) {\n break;\n }\n } else if (xmlData[i] === '[') {\n hasBody = true;\n } else {\n exp += xmlData[i];\n }\n }\n if (angleBracketsCount !== 0) {\n throw new Error(`Unclosed DOCTYPE`);\n }\n } else {\n throw new Error(`Invalid Tag instead of DOCTYPE`);\n }\n return { entities, i };\n }\n readEntityExp(xmlData, i) {\n //External entities are not supported\n // <!ENTITY ext SYSTEM \"http://normal-website.com\" >\n\n //Parameter entities are not supported\n // <!ENTITY entityname \"&anotherElement;\">\n\n //Internal entities are supported\n // <!ENTITY entityname \"replacement text\">\n\n // Skip leading whitespace after <!ENTITY\n i = skipWhitespace(xmlData, i);\n\n // Read entity name\n const startIndex = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i]) && xmlData[i] !== '\"' && xmlData[i] !== \"'\") {\n i++;\n }\n let entityName = xmlData.substring(startIndex, i);\n\n validateEntityName(entityName);\n\n // Skip whitespace after entity name\n i = skipWhitespace(xmlData, i);\n\n // Check for unsupported constructs (external entities or parameter entities)\n if (!this.suppressValidationErr) {\n if (xmlData.substring(i, i + 6).toUpperCase() === \"SYSTEM\") {\n throw new Error(\"External entities are not supported\");\n } else if (xmlData[i] === \"%\") {\n throw new Error(\"Parameter entities are not supported\");\n }\n }\n\n // Read entity value (internal entity)\n let entityValue = \"\";\n [i, entityValue] = this.readIdentifierVal(xmlData, i, \"entity\");\n\n // Validate entity size\n if (this.options.enabled !== false &&\n this.options.maxEntitySize != null &&\n entityValue.length > this.options.maxEntitySize) {\n throw new Error(\n `Entity \"${entityName}\" size (${entityValue.length}) exceeds maximum allowed size (${this.options.maxEntitySize})`\n );\n }\n\n i--;\n return [entityName, entityValue, i];\n }\n\n readNotationExp(xmlData, i) {\n // Skip leading whitespace after <!NOTATION\n i = skipWhitespace(xmlData, i);\n\n // Read notation name\n\n const startIndex = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) {\n i++;\n }\n let notationName = xmlData.substring(startIndex, i);\n\n !this.suppressValidationErr && validateEntityName(notationName);\n\n // Skip whitespace after notation name\n i = skipWhitespace(xmlData, i);\n\n // Check identifier type (SYSTEM or PUBLIC)\n const identifierType = xmlData.substring(i, i + 6).toUpperCase();\n if (!this.suppressValidationErr && identifierType !== \"SYSTEM\" && identifierType !== \"PUBLIC\") {\n throw new Error(`Expected SYSTEM or PUBLIC, found \"${identifierType}\"`);\n }\n i += identifierType.length;\n\n // Skip whitespace after identifier type\n i = skipWhitespace(xmlData, i);\n\n // Read public identifier (if PUBLIC)\n let publicIdentifier = null;\n let systemIdentifier = null;\n\n if (identifierType === \"PUBLIC\") {\n [i, publicIdentifier] = this.readIdentifierVal(xmlData, i, \"publicIdentifier\");\n\n // Skip whitespace after public identifier\n i = skipWhitespace(xmlData, i);\n\n // Optionally read system identifier\n if (xmlData[i] === '\"' \|\| xmlData[i] === \"'\") {\n [i, systemIdentifier] = this.readIdentifierVal(xmlData, i, \"systemIdentifier\");\n }\n } else if (identifierType === \"SYSTEM\") {\n // Read system identifier (mandatory for SYSTEM)\n [i, systemIdentifier] = this.readIdentifierVal(xmlData, i, \"systemIdentifier\");\n\n if (!this.suppressValidationErr && !systemIdentifier) {\n throw new Error(\"Missing mandatory system identifier for SYSTEM notation\");\n }\n }\n\n return { notationName, publicIdentifier, systemIdentifier, index: --i };\n }\n\n readIdentifierVal(xmlData, i, type) {\n let identifierVal = \"\";\n const startChar = xmlData[i];\n if (startChar !== '\"' && startChar !== \"'\") {\n throw new Error(`Expected quoted string, found \"${startChar}\"`);\n }\n i++;\n\n const startIndex = i;\n while (i < xmlData.length && xmlData[i] !== startChar) {\n i++;\n }\n identifierVal = xmlData.substring(startIndex, i);\n\n if (xmlData[i] !== startChar) {\n throw new Error(`Unterminated ${type} value`);\n }\n i++;\n return [i, identifierVal];\n }\n\n readElementExp(xmlData, i) {\n // <!ELEMENT br EMPTY>\n // <!ELEMENT div ANY>\n // <!ELEMENT title (#PCDATA)>\n // <!ELEMENT book (title, author+)>\n // <!ELEMENT name (content-model)>\n\n // Skip leading whitespace after <!ELEMENT\n i = skipWhitespace(xmlData, i);\n\n // Read element name\n const startIndex = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) {\n i++;\n }\n let elementName = xmlData.substring(startIndex, i);\n\n // Validate element name\n if (!this.suppressValidationErr && !isName(elementName)) {\n throw new Error(`Invalid element name: \"${elementName}\"`);\n }\n\n // Skip whitespace after element name\n i = skipWhitespace(xmlData, i);\n let contentModel = \"\";\n // Expect '(' to start content model\n if (xmlData[i] === \"E\" && hasSeq(xmlData, \"MPTY\", i)) i += 4;\n else if (xmlData[i] === \"A\" && hasSeq(xmlData, \"NY\", i)) i += 2;\n else if (xmlData[i] === \"(\") {\n i++; // Move past '('\n\n // Read content model\n const startIndex = i;\n while (i < xmlData.length && xmlData[i] !== \")\") {\n i++;\n }\n contentModel = xmlData.substring(startIndex, i);\n\n if (xmlData[i] !== \")\") {\n throw new Error(\"Unterminated content model\");\n }\n\n } else if (!this.suppressValidationErr) {\n throw new Error(`Invalid Element Expression, found \"${xmlData[i]}\"`);\n }\n\n return {\n elementName,\n contentModel: contentModel.trim(),\n index: i\n };\n }\n\n readAttlistExp(xmlData, i) {\n // Skip leading whitespace after <!ATTLIST\n i = skipWhitespace(xmlData, i);\n\n // Read element name\n let startIndex = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) {\n i++;\n }\n let elementName = xmlData.substring(startIndex, i);\n\n // Validate element name\n validateEntityName(elementName)\n\n // Skip whitespace after element name\n i = skipWhitespace(xmlData, i);\n\n // Read attribute name\n startIndex = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) {\n i++;\n }\n let attributeName = xmlData.substring(startIndex, i);\n\n // Validate attribute name\n if (!validateEntityName(attributeName)) {\n throw new Error(`Invalid attribute name: \"${attributeName}\"`);\n }\n\n // Skip whitespace after attribute name\n i = skipWhitespace(xmlData, i);\n\n // Read attribute type\n let attributeType = \"\";\n if (xmlData.substring(i, i + 8).toUpperCase() === \"NOTATION\") {\n attributeType = \"NOTATION\";\n i += 8; // Move past \"NOTATION\"\n\n // Skip whitespace after \"NOTATION\"\n i = skipWhitespace(xmlData, i);\n\n // Expect '(' to start the list of notations\n if (xmlData[i] !== \"(\") {\n throw new Error(`Expected '(', found \"${xmlData[i]}\"`);\n }\n i++; // Move past '('\n\n // Read the list of allowed notations\n let allowedNotations = [];\n while (i < xmlData.length && xmlData[i] !== \")\") {\n\n\n const startIndex = i;\n while (i < xmlData.length && xmlData[i] !== \"\|\" && xmlData[i] !== \")\") {\n i++;\n }\n let notation = xmlData.substring(startIndex, i);\n\n // Validate notation name\n notation = notation.trim();\n if (!validateEntityName(notation)) {\n throw new Error(`Invalid notation name: \"${notation}\"`);\n }\n\n allowedNotations.push(notation);\n\n // Skip '\|' separator or exit loop\n if (xmlData[i] === \"\|\") {\n i++; // Move past '\|'\n i = skipWhitespace(xmlData, i); // Skip optional whitespace after '\|'\n }\n }\n\n if (xmlData[i] !== \")\") {\n throw new Error(\"Unterminated list of notations\");\n }\n i++; // Move past ')'\n\n // Store the allowed notations as part of the attribute type\n attributeType += \" (\" + allowedNotations.join(\"\|\") + \")\";\n } else {\n // Handle simple types (e.g., CDATA, ID, IDREF, etc.)\n const startIndex = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) {\n i++;\n }\n attributeType += xmlData.substring(startIndex, i);\n\n // Validate simple attribute type\n const validTypes = [\"CDATA\", \"ID\", \"IDREF\", \"IDREFS\", \"ENTITY\", \"ENTITIES\", \"NMTOKEN\", \"NMTOKENS\"];\n if (!this.suppressValidationErr && !validTypes.includes(attributeType.toUpperCase())) {\n throw new Error(`Invalid attribute type: \"${attributeType}\"`);\n }\n }\n\n // Skip whitespace after attribute type\n i = skipWhitespace(xmlData, i);\n\n // Read default value\n let defaultValue = \"\";\n if (xmlData.substring(i, i + 8).toUpperCase() === \"#REQUIRED\") {\n defaultValue = \"#REQUIRED\";\n i += 8;\n } else if (xmlData.substring(i, i + 7).toUpperCase() === \"#IMPLIED\") {\n defaultValue = \"#IMPLIED\";\n i += 7;\n } else {\n [i, defaultValue] = this.readIdentifierVal(xmlData, i, \"ATTLIST\");\n }\n\n return {\n elementName,\n attributeName,\n attributeType,\n defaultValue,\n index: i\n }\n }\n}\n\n\n\nconst skipWhitespace = (data, index) => {\n while (index < data.length && /\\s/.test(data[index])) {\n index++;\n }\n return index;\n};\n\n\n\nfunction hasSeq(data, seq, i) {\n for (let j = 0; j < seq.length; j++) {\n if (seq[j] !== data[i + j + 1]) return false;\n }\n return true;\n}\n\nfunction validateEntityName(name) {\n if (isName(name))\n return name;\n else\n throw new Error(`Invalid entity name ${name}`);\n}","const hexRegex = /^[-+]?0x[a-fA-F0-9]+$/;\nconst numRegex = /^([\\-\\+])?(0)([0-9](\\.[0-9])?)$/;\n// const octRegex = /^0x[a-z0-9]+/;\n// const binRegex = /0x[a-z0-9]+/;\n\n\nconst consider = {\n hex: true,\n // oct: false,\n leadingZeros: true,\n decimalPoint: \"\\.\",\n eNotation: true,\n //skipLike: /regex/,\n infinity: \"original\", // \"null\", \"infinity\" (Infinity type), \"string\" (\"Infinity\" (the string literal))\n};\n\nexport default function toNumber(str, options = {}) {\n options = Object.assign({}, consider, options);\n if (!str \|\| typeof str !== \"string\") return str;\n\n let trimmedStr = str.trim();\n\n if (trimmedStr.length === 0) return str;\n else if (options.skipLike !== undefined && options.skipLike.test(trimmedStr)) return str;\n else if (trimmedStr === \"0\") return 0;\n else if (options.hex && hexRegex.test(trimmedStr)) {\n return parse_int(trimmedStr, 16);\n // }else if (options.oct && octRegex.test(str)) {\n // return Number.parseInt(val, 8);\n } else if (!isFinite(trimmedStr)) { //Infinity\n return handleInfinity(str, Number(trimmedStr), options);\n } else if (trimmedStr.includes('e') \|\| trimmedStr.includes('E')) { //eNotation\n return resolveEnotation(str, trimmedStr, options);\n // }else if (options.parseBin && binRegex.test(str)) {\n // return Number.parseInt(val, 2);\n } else {\n //separate negative sign, leading zeros, and rest number\n const match = numRegex.exec(trimmedStr);\n // +00.123 => [ , '+', '00', '.123', ..\n if (match) {\n const sign = match[1] \|\| \"\";\n const leadingZeros = match[2];\n let numTrimmedByZeros = trimZeros(match[3]); //complete num without leading zeros\n const decimalAdjacentToLeadingZeros = sign ? // 0., -00., 000.\n str[leadingZeros.length + 1] === \".\"\n : str[leadingZeros.length] === \".\";\n\n //trim ending zeros for floating number\n if (!options.leadingZeros //leading zeros are not allowed\n && (leadingZeros.length > 1\n \|\| (leadingZeros.length === 1 && !decimalAdjacentToLeadingZeros))) {\n // 00, 00.3, +03.24, 03, 03.24\n return str;\n }\n else {//no leading zeros or leading zeros are allowed\n const num = Number(trimmedStr);\n const parsedStr = String(num);\n\n if (num === 0) return num;\n if (parsedStr.search(/[eE]/) !== -1) { //given number is long and parsed to eNotation\n if (options.eNotation) return num;\n else return str;\n } else if (trimmedStr.indexOf(\".\") !== -1) { //floating number\n if (parsedStr === \"0\") return num; //0.0\n else if (parsedStr === numTrimmedByZeros) return num; //0.456. 0.79000\n else if (parsedStr === `${sign}${numTrimmedByZeros}`) return num;\n else return str;\n }\n\n let n = leadingZeros ? numTrimmedByZeros : trimmedStr;\n if (leadingZeros) {\n // -009 => -9\n return (n === parsedStr) \|\| (sign + n === parsedStr) ? num : str\n } else {\n // +9\n return (n === parsedStr) \|\| (n === sign + parsedStr) ? num : str\n }\n }\n } else { //non-numeric string\n return str;\n }\n }\n}\n\nconst eNotationRegx = /^([-+])?(0)(\\d(\\.\\d)?[eE][-\\+]?\\d+)$/;\nfunction resolveEnotation(str, trimmedStr, options) {\n if (!options.eNotation) return str;\n const notation = trimmedStr.match(eNotationRegx);\n if (notation) {\n let sign = notation[1] \|\| \"\";\n const eChar = notation[3].indexOf(\"e\") === -1 ? \"E\" : \"e\";\n const leadingZeros = notation[2];\n const eAdjacentToLeadingZeros = sign ? // 0E.\n str[leadingZeros.length + 1] === eChar\n : str[leadingZeros.length] === eChar;\n\n if (leadingZeros.length > 1 && eAdjacentToLeadingZeros) return str;\n else if (leadingZeros.length === 1\n && (notation[3].startsWith(`.${eChar}`) \|\| notation[3][0] === eChar)) {\n return Number(trimmedStr);\n } else if (leadingZeros.length > 0) {\n // Has leading zeros — only accept if leadingZeros option allows it\n if (options.leadingZeros && !eAdjacentToLeadingZeros) {\n trimmedStr = (notation[1] \|\| \"\") + notation[3];\n return Number(trimmedStr);\n } else return str;\n } else {\n // No leading zeros — always valid e-notation, parse it\n return Number(trimmedStr);\n }\n } else {\n return str;\n }\n}\n\n/\n \n * @param {string} numStr without leading zeros\n * @returns \n /\nfunction trimZeros(numStr) {\n if (numStr && numStr.indexOf(\".\") !== -1) {//float\n numStr = numStr.replace(/0+$/, \"\"); //remove ending zeros\n if (numStr === \".\") numStr = \"0\";\n else if (numStr[0] === \".\") numStr = \"0\" + numStr;\n else if (numStr[numStr.length - 1] === \".\") numStr = numStr.substring(0, numStr.length - 1);\n return numStr;\n }\n return numStr;\n}\n\nfunction parse_int(numStr, base) {\n //polyfill\n if (parseInt) return parseInt(numStr, base);\n else if (Number.parseInt) return Number.parseInt(numStr, base);\n else if (window && window.parseInt) return window.parseInt(numStr, base);\n else throw new Error(\"parseInt, Number.parseInt, window.parseInt are not supported\")\n}\n\n/\n Handle infinite values based on user option\n * @param {string} str - original input string\n * @param {number} num - parsed number (Infinity or -Infinity)\n * @param {object} options - user options\n * @returns {string\|number\|null} based on infinity option\n /\nfunction handleInfinity(str, num, options) {\n const isPositive = num === Infinity;\n\n switch (options.infinity.toLowerCase()) {\n case \"null\":\n return null;\n case \"infinity\":\n return num; // Return Infinity or -Infinity\n case \"string\":\n return isPositive ? \"Infinity\" : \"-Infinity\";\n case \"original\":\n default:\n return str; // Return original string like \"1e1000\"\n }\n}","import ExpressionSet from \"./ExpressionSet.js\";\n\n/\n MatcherView - A lightweight read-only view over a Matcher's internal state.\n \n Created once by Matcher and reused across all callbacks. Holds a direct\n * reference to the parent Matcher so it always reflects current parser state\n * with zero copying or freezing overhead.\n \n Users receive this via {@link Matcher#readOnly} or directly from parser\n * callbacks. It exposes all query and matching methods but has no mutation\n * methods — misuse is caught at the TypeScript level rather than at runtime.\n \n @example\n * const matcher = new Matcher();\n * const view = matcher.readOnly();\n \n matcher.push(\"root\", {});\n * view.getCurrentTag(); // \"root\"\n * view.getDepth(); // 1\n /\nexport class MatcherView {\n /\n @param {Matcher} matcher - The parent Matcher instance to read from.\n /\n constructor(matcher) {\n this._matcher = matcher;\n }\n\n /\n Get the path separator used by the parent matcher.\n * @returns {string}\n /\n get separator() {\n return this._matcher.separator;\n }\n\n /\n Get current tag name.\n * @returns {string\|undefined}\n /\n getCurrentTag() {\n const path = this._matcher.path;\n return path.length > 0 ? path[path.length - 1].tag : undefined;\n }\n\n /\n Get current namespace.\n * @returns {string\|undefined}\n /\n getCurrentNamespace() {\n const path = this._matcher.path;\n return path.length > 0 ? path[path.length - 1].namespace : undefined;\n }\n\n /\n Get current node's attribute value.\n * @param {string} attrName\n * @returns {}\n /\n getAttrValue(attrName) {\n const path = this._matcher.path;\n if (path.length === 0) return undefined;\n return path[path.length - 1].values?.[attrName];\n }\n\n /*\n Check if current node has an attribute.\n * @param {string} attrName\n * @returns {boolean}\n /\n hasAttr(attrName) {\n const path = this._matcher.path;\n if (path.length === 0) return false;\n const current = path[path.length - 1];\n return current.values !== undefined && attrName in current.values;\n }\n\n /\n Get current node's sibling position (child index in parent).\n * @returns {number}\n /\n getPosition() {\n const path = this._matcher.path;\n if (path.length === 0) return -1;\n return path[path.length - 1].position ?? 0;\n }\n\n /\n Get current node's repeat counter (occurrence count of this tag name).\n * @returns {number}\n /\n getCounter() {\n const path = this._matcher.path;\n if (path.length === 0) return -1;\n return path[path.length - 1].counter ?? 0;\n }\n\n /\n Get current node's sibling index (alias for getPosition).\n * @returns {number}\n * @deprecated Use getPosition() or getCounter() instead\n /\n getIndex() {\n return this.getPosition();\n }\n\n /\n Get current path depth.\n * @returns {number}\n /\n getDepth() {\n return this._matcher.path.length;\n }\n\n /\n Get path as string.\n * @param {string} [separator] - Optional separator (uses default if not provided)\n * @param {boolean} [includeNamespace=true]\n * @returns {string}\n /\n toString(separator, includeNamespace = true) {\n return this._matcher.toString(separator, includeNamespace);\n }\n\n /\n Get path as array of tag names.\n * @returns {string[]}\n /\n toArray() {\n return this._matcher.path.map(n => n.tag);\n }\n\n /\n Match current path against an Expression.\n * @param {Expression} expression\n * @returns {boolean}\n /\n matches(expression) {\n return this._matcher.matches(expression);\n }\n\n /\n Match any expression in the given set against the current path.\n * @param {ExpressionSet} exprSet\n * @returns {boolean}\n /\n matchesAny(exprSet) {\n return exprSet.matchesAny(this._matcher);\n }\n}\n\n/\n Matcher - Tracks current path in XML/JSON tree and matches against Expressions.\n \n The matcher maintains a stack of nodes representing the current path from root to\n * current tag. It only stores attribute values for the current (top) node to minimize\n * memory usage. Sibling tracking is used to auto-calculate position and counter.\n \n Use {@link Matcher#readOnly} to obtain a {@link MatcherView} safe to pass to\n * user callbacks — it always reflects current state with no Proxy overhead.\n \n @example\n * const matcher = new Matcher();\n * matcher.push(\"root\", {});\n * matcher.push(\"users\", {});\n * matcher.push(\"user\", { id: \"123\", type: \"admin\" });\n \n const expr = new Expression(\"root.users.user\");\n * matcher.matches(expr); // true\n /\nexport default class Matcher {\n /\n Create a new Matcher.\n * @param {Object} [options={}]\n * @param {string} [options.separator='.'] - Default path separator\n /\n constructor(options = {}) {\n this.separator = options.separator \|\| '.';\n this.path = [];\n this.siblingStacks = [];\n // Each path node: { tag, values, position, counter, namespace? }\n // values only present for current (last) node\n // Each siblingStacks entry: Map<tagName, count> tracking occurrences at each level\n this._pathStringCache = null;\n this._view = new MatcherView(this);\n }\n\n /\n Push a new tag onto the path.\n * @param {string} tagName\n * @param {Object\|null} [attrValues=null]\n * @param {string\|null} [namespace=null]\n /\n push(tagName, attrValues = null, namespace = null) {\n this._pathStringCache = null;\n\n // Remove values from previous current node (now becoming ancestor)\n if (this.path.length > 0) {\n this.path[this.path.length - 1].values = undefined;\n }\n\n // Get or create sibling tracking for current level\n const currentLevel = this.path.length;\n if (!this.siblingStacks[currentLevel]) {\n this.siblingStacks[currentLevel] = new Map();\n }\n\n const siblings = this.siblingStacks[currentLevel];\n\n // Create a unique key for sibling tracking that includes namespace\n const siblingKey = namespace ? `${namespace}:${tagName}` : tagName;\n\n // Calculate counter (how many times this tag appeared at this level)\n const counter = siblings.get(siblingKey) \|\| 0;\n\n // Calculate position (total children at this level so far)\n let position = 0;\n for (const count of siblings.values()) {\n position += count;\n }\n\n // Update sibling count for this tag\n siblings.set(siblingKey, counter + 1);\n\n // Create new node\n const node = {\n tag: tagName,\n position: position,\n counter: counter\n };\n\n if (namespace !== null && namespace !== undefined) {\n node.namespace = namespace;\n }\n\n if (attrValues !== null && attrValues !== undefined) {\n node.values = attrValues;\n }\n\n this.path.push(node);\n }\n\n /\n Pop the last tag from the path.\n * @returns {Object\|undefined} The popped node\n /\n pop() {\n if (this.path.length === 0) return undefined;\n this._pathStringCache = null;\n\n const node = this.path.pop();\n\n if (this.siblingStacks.length > this.path.length + 1) {\n this.siblingStacks.length = this.path.length + 1;\n }\n\n return node;\n }\n\n /\n Update current node's attribute values.\n * Useful when attributes are parsed after push.\n * @param {Object} attrValues\n /\n updateCurrent(attrValues) {\n if (this.path.length > 0) {\n const current = this.path[this.path.length - 1];\n if (attrValues !== null && attrValues !== undefined) {\n current.values = attrValues;\n }\n }\n }\n\n /\n Get current tag name.\n * @returns {string\|undefined}\n /\n getCurrentTag() {\n return this.path.length > 0 ? this.path[this.path.length - 1].tag : undefined;\n }\n\n /\n Get current namespace.\n * @returns {string\|undefined}\n /\n getCurrentNamespace() {\n return this.path.length > 0 ? this.path[this.path.length - 1].namespace : undefined;\n }\n\n /\n Get current node's attribute value.\n * @param {string} attrName\n * @returns {}\n /\n getAttrValue(attrName) {\n if (this.path.length === 0) return undefined;\n return this.path[this.path.length - 1].values?.[attrName];\n }\n\n /*\n Check if current node has an attribute.\n * @param {string} attrName\n * @returns {boolean}\n /\n hasAttr(attrName) {\n if (this.path.length === 0) return false;\n const current = this.path[this.path.length - 1];\n return current.values !== undefined && attrName in current.values;\n }\n\n /\n Get current node's sibling position (child index in parent).\n * @returns {number}\n /\n getPosition() {\n if (this.path.length === 0) return -1;\n return this.path[this.path.length - 1].position ?? 0;\n }\n\n /\n Get current node's repeat counter (occurrence count of this tag name).\n * @returns {number}\n /\n getCounter() {\n if (this.path.length === 0) return -1;\n return this.path[this.path.length - 1].counter ?? 0;\n }\n\n /\n Get current node's sibling index (alias for getPosition).\n * @returns {number}\n * @deprecated Use getPosition() or getCounter() instead\n /\n getIndex() {\n return this.getPosition();\n }\n\n /\n Get current path depth.\n * @returns {number}\n /\n getDepth() {\n return this.path.length;\n }\n\n /\n Get path as string.\n * @param {string} [separator] - Optional separator (uses default if not provided)\n * @param {boolean} [includeNamespace=true]\n * @returns {string}\n /\n toString(separator, includeNamespace = true) {\n const sep = separator \|\| this.separator;\n const isDefault = (sep === this.separator && includeNamespace === true);\n\n if (isDefault) {\n if (this._pathStringCache !== null) {\n return this._pathStringCache;\n }\n const result = this.path.map(n =>\n (n.namespace) ? `${n.namespace}:${n.tag}` : n.tag\n ).join(sep);\n this._pathStringCache = result;\n return result;\n }\n\n return this.path.map(n =>\n (includeNamespace && n.namespace) ? `${n.namespace}:${n.tag}` : n.tag\n ).join(sep);\n }\n\n /\n Get path as array of tag names.\n * @returns {string[]}\n /\n toArray() {\n return this.path.map(n => n.tag);\n }\n\n /\n Reset the path to empty.\n /\n reset() {\n this._pathStringCache = null;\n this.path = [];\n this.siblingStacks = [];\n }\n\n /\n Match current path against an Expression.\n * @param {Expression} expression\n * @returns {boolean}\n /\n matches(expression) {\n const segments = expression.segments;\n\n if (segments.length === 0) {\n return false;\n }\n\n if (expression.hasDeepWildcard()) {\n return this._matchWithDeepWildcard(segments);\n }\n\n return this._matchSimple(segments);\n }\n\n /\n @private\n /\n _matchSimple(segments) {\n if (this.path.length !== segments.length) {\n return false;\n }\n\n for (let i = 0; i < segments.length; i++) {\n if (!this._matchSegment(segments[i], this.path[i], i === this.path.length - 1)) {\n return false;\n }\n }\n\n return true;\n }\n\n /\n @private\n /\n _matchWithDeepWildcard(segments) {\n let pathIdx = this.path.length - 1;\n let segIdx = segments.length - 1;\n\n while (segIdx >= 0 && pathIdx >= 0) {\n const segment = segments[segIdx];\n\n if (segment.type === 'deep-wildcard') {\n segIdx--;\n\n if (segIdx < 0) {\n return true;\n }\n\n const nextSeg = segments[segIdx];\n let found = false;\n\n for (let i = pathIdx; i >= 0; i--) {\n if (this._matchSegment(nextSeg, this.path[i], i === this.path.length - 1)) {\n pathIdx = i - 1;\n segIdx--;\n found = true;\n break;\n }\n }\n\n if (!found) {\n return false;\n }\n } else {\n if (!this._matchSegment(segment, this.path[pathIdx], pathIdx === this.path.length - 1)) {\n return false;\n }\n pathIdx--;\n segIdx--;\n }\n }\n\n return segIdx < 0;\n }\n\n /\n @private\n /\n _matchSegment(segment, node, isCurrentNode) {\n if (segment.tag !== '' && segment.tag !== node.tag) {\n return false;\n }\n\n if (segment.namespace !== undefined) {\n if (segment.namespace !== '' && segment.namespace !== node.namespace) {\n return false;\n }\n }\n\n if (segment.attrName !== undefined) {\n if (!isCurrentNode) {\n return false;\n }\n\n if (!node.values \|\| !(segment.attrName in node.values)) {\n return false;\n }\n\n if (segment.attrValue !== undefined) {\n if (String(node.values[segment.attrName]) !== String(segment.attrValue)) {\n return false;\n }\n }\n }\n\n if (segment.position !== undefined) {\n if (!isCurrentNode) {\n return false;\n }\n\n const counter = node.counter ?? 0;\n\n if (segment.position === 'first' && counter !== 0) {\n return false;\n } else if (segment.position === 'odd' && counter % 2 !== 1) {\n return false;\n } else if (segment.position === 'even' && counter % 2 !== 0) {\n return false;\n } else if (segment.position === 'nth' && counter !== segment.positionValue) {\n return false;\n }\n }\n\n return true;\n }\n\n /\n Match any expression in the given set against the current path.\n * @param {ExpressionSet} exprSet\n * @returns {boolean}\n /\n matchesAny(exprSet) {\n return exprSet.matchesAny(this);\n }\n\n /\n Create a snapshot of current state.\n * @returns {Object}\n /\n snapshot() {\n return {\n path: this.path.map(node => ({ ...node })),\n siblingStacks: this.siblingStacks.map(map => new Map(map))\n };\n }\n\n /\n Restore state from snapshot.\n * @param {Object} snapshot\n /\n restore(snapshot) {\n this._pathStringCache = null;\n this.path = snapshot.path.map(node => ({ ...node }));\n this.siblingStacks = snapshot.siblingStacks.map(map => new Map(map));\n }\n\n /\n Return the read-only {@link MatcherView} for this matcher.\n \n The same instance is returned on every call — no allocation occurs.\n * It always reflects the current parser state and is safe to pass to\n * user callbacks without risk of accidental mutation.\n \n @returns {MatcherView}\n \n @example\n * const view = matcher.readOnly();\n * // pass view to callbacks — it stays in sync automatically\n * view.matches(expr); // ✓\n * view.getCurrentTag(); // ✓\n * // view.push(...) // ✗ method does not exist — caught by TypeScript\n /\n readOnly() {\n return this._view;\n }\n}","/\n Expression - Parses and stores a tag pattern expression\n * \n * Patterns are parsed once and stored in an optimized structure for fast matching.\n * \n * @example\n * const expr = new Expression(\"root.users.user\");\n * const expr2 = new Expression(\"..user[id]:first\");\n * const expr3 = new Expression(\"root/users/user\", { separator: '/' });\n /\nexport default class Expression {\n /\n Create a new Expression\n * @param {string} pattern - Pattern string (e.g., \"root.users.user\", \"..user[id]\")\n * @param {Object} options - Configuration options\n * @param {string} options.separator - Path separator (default: '.')\n /\n constructor(pattern, options = {}, data) {\n this.pattern = pattern;\n this.separator = options.separator \|\| '.';\n this.segments = this._parse(pattern);\n this.data = data;\n // Cache expensive checks for performance (O(1) instead of O(n))\n this._hasDeepWildcard = this.segments.some(seg => seg.type === 'deep-wildcard');\n this._hasAttributeCondition = this.segments.some(seg => seg.attrName !== undefined);\n this._hasPositionSelector = this.segments.some(seg => seg.position !== undefined);\n }\n\n /\n Parse pattern string into segments\n * @private\n * @param {string} pattern - Pattern to parse\n * @returns {Array} Array of segment objects\n /\n _parse(pattern) {\n const segments = [];\n\n // Split by separator but handle \"..\" specially\n let i = 0;\n let currentPart = '';\n\n while (i < pattern.length) {\n if (pattern[i] === this.separator) {\n // Check if next char is also separator (deep wildcard)\n if (i + 1 < pattern.length && pattern[i + 1] === this.separator) {\n // Flush current part if any\n if (currentPart.trim()) {\n segments.push(this._parseSegment(currentPart.trim()));\n currentPart = '';\n }\n // Add deep wildcard\n segments.push({ type: 'deep-wildcard' });\n i += 2; // Skip both separators\n } else {\n // Regular separator\n if (currentPart.trim()) {\n segments.push(this._parseSegment(currentPart.trim()));\n }\n currentPart = '';\n i++;\n }\n } else {\n currentPart += pattern[i];\n i++;\n }\n }\n\n // Flush remaining part\n if (currentPart.trim()) {\n segments.push(this._parseSegment(currentPart.trim()));\n }\n\n return segments;\n }\n\n /\n Parse a single segment\n * @private\n * @param {string} part - Segment string (e.g., \"user\", \"ns::user\", \"user[id]\", \"ns::user:first\")\n * @returns {Object} Segment object\n /\n _parseSegment(part) {\n const segment = { type: 'tag' };\n\n // NEW NAMESPACE SYNTAX (v2.0):\n // ============================\n // Namespace uses DOUBLE colon (::)\n // Position uses SINGLE colon (:)\n // \n // Examples:\n // \"user\" → tag\n // \"user:first\" → tag + position\n // \"user[id]\" → tag + attribute\n // \"user[id]:first\" → tag + attribute + position\n // \"ns::user\" → namespace + tag\n // \"ns::user:first\" → namespace + tag + position\n // \"ns::user[id]\" → namespace + tag + attribute\n // \"ns::user[id]:first\" → namespace + tag + attribute + position\n // \"ns::first\" → namespace + tag named \"first\" (NO ambiguity!)\n //\n // This eliminates all ambiguity:\n // :: = namespace separator\n // : = position selector\n // [] = attributes\n\n // Step 1: Extract brackets [attr] or [attr=value]\n let bracketContent = null;\n let withoutBrackets = part;\n\n const bracketMatch = part.match(/^([^\\[]+)(\\[[^\\]]\\])(.)$/);\n if (bracketMatch) {\n withoutBrackets = bracketMatch[1] + bracketMatch[3];\n if (bracketMatch[2]) {\n const content = bracketMatch[2].slice(1, -1);\n if (content) {\n bracketContent = content;\n }\n }\n }\n\n // Step 2: Check for namespace (double colon ::)\n let namespace = undefined;\n let tagAndPosition = withoutBrackets;\n\n if (withoutBrackets.includes('::')) {\n const nsIndex = withoutBrackets.indexOf('::');\n namespace = withoutBrackets.substring(0, nsIndex).trim();\n tagAndPosition = withoutBrackets.substring(nsIndex + 2).trim(); // Skip ::\n\n if (!namespace) {\n throw new Error(`Invalid namespace in pattern: ${part}`);\n }\n }\n\n // Step 3: Parse tag and position (single colon :)\n let tag = undefined;\n let positionMatch = null;\n\n if (tagAndPosition.includes(':')) {\n const colonIndex = tagAndPosition.lastIndexOf(':'); // Use last colon for position\n const tagPart = tagAndPosition.substring(0, colonIndex).trim();\n const posPart = tagAndPosition.substring(colonIndex + 1).trim();\n\n // Verify position is a valid keyword\n const isPositionKeyword = ['first', 'last', 'odd', 'even'].includes(posPart) \|\|\n /^nth\$\\d+\$$/.test(posPart);\n\n if (isPositionKeyword) {\n tag = tagPart;\n positionMatch = posPart;\n } else {\n // Not a valid position keyword, treat whole thing as tag\n tag = tagAndPosition;\n }\n } else {\n tag = tagAndPosition;\n }\n\n if (!tag) {\n throw new Error(`Invalid segment pattern: ${part}`);\n }\n\n segment.tag = tag;\n if (namespace) {\n segment.namespace = namespace;\n }\n\n // Step 4: Parse attributes\n if (bracketContent) {\n if (bracketContent.includes('=')) {\n const eqIndex = bracketContent.indexOf('=');\n segment.attrName = bracketContent.substring(0, eqIndex).trim();\n segment.attrValue = bracketContent.substring(eqIndex + 1).trim();\n } else {\n segment.attrName = bracketContent.trim();\n }\n }\n\n // Step 5: Parse position selector\n if (positionMatch) {\n const nthMatch = positionMatch.match(/^nth\$(\\d+)\$$/);\n if (nthMatch) {\n segment.position = 'nth';\n segment.positionValue = parseInt(nthMatch[1], 10);\n } else {\n segment.position = positionMatch;\n }\n }\n\n return segment;\n }\n\n /\n Get the number of segments\n * @returns {number}\n /\n get length() {\n return this.segments.length;\n }\n\n /\n Check if expression contains deep wildcard\n * @returns {boolean}\n /\n hasDeepWildcard() {\n return this._hasDeepWildcard;\n }\n\n /\n Check if expression has attribute conditions\n * @returns {boolean}\n /\n hasAttributeCondition() {\n return this._hasAttributeCondition;\n }\n\n /\n Check if expression has position selectors\n * @returns {boolean}\n /\n hasPositionSelector() {\n return this._hasPositionSelector;\n }\n\n /\n Get string representation\n * @returns {string}\n /\n toString() {\n return this.pattern;\n }\n}","/\n ExpressionSet - An indexed collection of Expressions for efficient bulk matching\n \n Instead of iterating all expressions on every tag, ExpressionSet pre-indexes\n * them at insertion time by depth and terminal tag name. At match time, only\n * the relevant bucket is evaluated — typically reducing checks from O(E) to O(1)\n * lookup plus O(small bucket) matches.\n \n Three buckets are maintained:\n * - `_byDepthAndTag` — exact depth + exact tag name (tightest, used first)\n * - `_wildcardByDepth` — exact depth + wildcard tag `` (depth-matched only)\n - `_deepWildcards` — expressions containing `..` (cannot be depth-indexed)\n \n @example\n * import { Expression, ExpressionSet } from 'fast-xml-tagger';\n \n // Build once at config time\n * const stopNodes = new ExpressionSet();\n * stopNodes.add(new Expression('root.users.user'));\n * stopNodes.add(new Expression('root.config.setting'));\n * stopNodes.add(new Expression('..script'));\n \n // Query on every tag — hot path\n * if (stopNodes.matchesAny(matcher)) { ... }\n /\nexport default class ExpressionSet {\n constructor() {\n /* @type {Map<string, import('./Expression.js').default[]>} depth:tag → expressions /\n this._byDepthAndTag = new Map();\n\n /* @type {Map<number, import('./Expression.js').default[]>} depth → wildcard-tag expressions /\n this._wildcardByDepth = new Map();\n\n /* @type {import('./Expression.js').default[]} expressions containing deep wildcard (..) /\n this._deepWildcards = [];\n\n /* @type {Set<string>} pattern strings already added — used for deduplication /\n this._patterns = new Set();\n\n /* @type {boolean} whether the set is sealed against further additions /\n this._sealed = false;\n }\n\n /\n Add an Expression to the set.\n * Duplicate patterns (same pattern string) are silently ignored.\n \n @param {import('./Expression.js').default} expression - A pre-constructed Expression instance\n * @returns {this} for chaining\n * @throws {TypeError} if called after seal()\n \n @example\n * set.add(new Expression('root.users.user'));\n * set.add(new Expression('..script'));\n /\n add(expression) {\n if (this._sealed) {\n throw new TypeError(\n 'ExpressionSet is sealed. Create a new ExpressionSet to add more expressions.'\n );\n }\n\n // Deduplicate by pattern string\n if (this._patterns.has(expression.pattern)) return this;\n this._patterns.add(expression.pattern);\n\n if (expression.hasDeepWildcard()) {\n this._deepWildcards.push(expression);\n return this;\n }\n\n const depth = expression.length;\n const lastSeg = expression.segments[expression.segments.length - 1];\n const tag = lastSeg?.tag;\n\n if (!tag \|\| tag === '') {\n // Can index by depth but not by tag\n if (!this._wildcardByDepth.has(depth)) this._wildcardByDepth.set(depth, []);\n this._wildcardByDepth.get(depth).push(expression);\n } else {\n // Tightest bucket: depth + tag\n const key = `${depth}:${tag}`;\n if (!this._byDepthAndTag.has(key)) this._byDepthAndTag.set(key, []);\n this._byDepthAndTag.get(key).push(expression);\n }\n\n return this;\n }\n\n /*\n Add multiple expressions at once.\n \n @param {import('./Expression.js').default[]} expressions - Array of Expression instances\n * @returns {this} for chaining\n \n @example\n * set.addAll([\n * new Expression('root.users.user'),\n * new Expression('root.config.setting'),\n * ]);\n /\n addAll(expressions) {\n for (const expr of expressions) this.add(expr);\n return this;\n }\n\n /\n Check whether a pattern string is already present in the set.\n \n @param {import('./Expression.js').default} expression\n * @returns {boolean}\n /\n has(expression) {\n return this._patterns.has(expression.pattern);\n }\n\n /\n Number of expressions in the set.\n * @type {number}\n /\n get size() {\n return this._patterns.size;\n }\n\n /\n Seal the set against further modifications.\n * Useful to prevent accidental mutations after config is built.\n * Calling add() or addAll() on a sealed set throws a TypeError.\n \n @returns {this}\n /\n seal() {\n this._sealed = true;\n return this;\n }\n\n /\n Whether the set has been sealed.\n * @type {boolean}\n /\n get isSealed() {\n return this._sealed;\n }\n\n /\n Test whether the matcher's current path matches any expression in the set.\n \n Evaluation order (cheapest → most expensive):\n * 1. Exact depth + tag bucket — O(1) lookup, typically 0–2 expressions\n * 2. Depth-only wildcard bucket — O(1) lookup, rare\n * 3. Deep-wildcard list — always checked, but usually small\n \n @param {import('./Matcher.js').default} matcher - Matcher instance (or readOnly view)\n * @returns {boolean} true if any expression matches the current path\n \n @example\n * if (stopNodes.matchesAny(matcher)) {\n * // handle stop node\n * }\n /\n matchesAny(matcher) {\n return this.findMatch(matcher) !== null;\n }\n /\n Find and return the first Expression that matches the matcher's current path.\n \n Uses the same evaluation order as matchesAny (cheapest → most expensive):\n * 1. Exact depth + tag bucket\n * 2. Depth-only wildcard bucket\n * 3. Deep-wildcard list\n \n @param {import('./Matcher.js').default} matcher - Matcher instance (or readOnly view)\n * @returns {import('./Expression.js').default \| null} the first matching Expression, or null\n \n @example\n * const expr = stopNodes.findMatch(matcher);\n * if (expr) {\n * // access expr.config, expr.pattern, etc.\n * }\n /\n findMatch(matcher) {\n const depth = matcher.getDepth();\n const tag = matcher.getCurrentTag();\n\n // 1. Tightest bucket — most expressions live here\n const exactKey = `${depth}:${tag}`;\n const exactBucket = this._byDepthAndTag.get(exactKey);\n if (exactBucket) {\n for (let i = 0; i < exactBucket.length; i++) {\n if (matcher.matches(exactBucket[i])) return exactBucket[i];\n }\n }\n\n // 2. Depth-matched wildcard-tag expressions\n const wildcardBucket = this._wildcardByDepth.get(depth);\n if (wildcardBucket) {\n for (let i = 0; i < wildcardBucket.length; i++) {\n if (matcher.matches(wildcardBucket[i])) return wildcardBucket[i];\n }\n }\n\n // 3. Deep wildcards — cannot be pre-filtered by depth or tag\n for (let i = 0; i < this._deepWildcards.length; i++) {\n if (matcher.matches(this._deepWildcards[i])) return this._deepWildcards[i];\n }\n\n return null;\n }\n}\n","// ---------------------------------------------------------------------------\n// Complete HTML5 named entity reference\n// Organized by logical categories for easy maintenance and selective importing\n// ---------------------------------------------------------------------------\n\n/\n Basic Latin & Special Characters\n * @type {Record<string, string>}\n /\nexport const BASIC_LATIN = {\n amp: '&',\n AMP: '&',\n lt: '<',\n LT: '<',\n gt: '>',\n GT: '>',\n quot: '\"',\n QUOT: '\"',\n apos: \"'\",\n lsquo: '‘',\n rsquo: '’',\n ldquo: '“',\n rdquo: '”',\n lsquor: '‚',\n rsquor: '’',\n ldquor: '„',\n bdquo: '„',\n comma: ',',\n period: '.',\n colon: ':',\n semi: ';',\n excl: '!',\n quest: '?',\n num: '#',\n dollar: '$',\n percent: '%',\n amp: '&',\n ast: '',\n commat: '@',\n lowbar: '_',\n verbar: '\|',\n vert: '\|',\n sol: '/',\n bsol: '\\\\',\n lbrace: '{',\n rbrace: '}',\n lbrack: '[',\n rbrack: ']',\n lpar: '(',\n rpar: ')',\n nbsp: '\\u00a0',\n iexcl: '¡',\n cent: '¢',\n pound: '£',\n curren: '¤',\n yen: '¥',\n brvbar: '¦',\n sect: '§',\n uml: '¨',\n copy: '©',\n COPY: '©',\n ordf: 'ª',\n laquo: '«',\n not: '¬',\n shy: '\\u00ad',\n reg: '®',\n REG: '®',\n macr: '¯',\n deg: '°',\n plusmn: '±',\n sup2: '²',\n sup3: '³',\n acute: '´',\n micro: 'µ',\n para: '¶',\n middot: '·',\n cedil: '¸',\n sup1: '¹',\n ordm: 'º',\n raquo: '»',\n frac14: '¼',\n frac12: '½',\n half: '½',\n frac34: '¾',\n iquest: '¿',\n times: '×',\n div: '÷',\n divide: '÷',\n};\n\n/*\n Latin Extended & Accented Letters (A-Z)\n * @type {Record<string, string>}\n /\nexport const LATIN_ACCENTS = {\n Agrave: 'À',\n agrave: 'à',\n Aacute: 'Á',\n aacute: 'á',\n Acirc: 'Â',\n acirc: 'â',\n Atilde: 'Ã',\n atilde: 'ã',\n Auml: 'Ä',\n auml: 'ä',\n Aring: 'Å',\n aring: 'å',\n AElig: 'Æ',\n aelig: 'æ',\n Ccedil: 'Ç',\n ccedil: 'ç',\n Egrave: 'È',\n egrave: 'è',\n Eacute: 'É',\n eacute: 'é',\n Ecirc: 'Ê',\n ecirc: 'ê',\n Euml: 'Ë',\n euml: 'ë',\n Igrave: 'Ì',\n igrave: 'ì',\n Iacute: 'Í',\n iacute: 'í',\n Icirc: 'Î',\n icirc: 'î',\n Iuml: 'Ï',\n iuml: 'ï',\n ETH: 'Ð',\n eth: 'ð',\n Ntilde: 'Ñ',\n ntilde: 'ñ',\n Ograve: 'Ò',\n ograve: 'ò',\n Oacute: 'Ó',\n oacute: 'ó',\n Ocirc: 'Ô',\n ocirc: 'ô',\n Otilde: 'Õ',\n otilde: 'õ',\n Ouml: 'Ö',\n ouml: 'ö',\n Oslash: 'Ø',\n oslash: 'ø',\n Ugrave: 'Ù',\n ugrave: 'ù',\n Uacute: 'Ú',\n uacute: 'ú',\n Ucirc: 'Û',\n ucirc: 'û',\n Uuml: 'Ü',\n uuml: 'ü',\n Yacute: 'Ý',\n yacute: 'ý',\n THORN: 'Þ',\n thorn: 'þ',\n szlig: 'ß',\n yuml: 'ÿ',\n Yuml: 'Ÿ',\n};\n\n/\n Latin Extended (Letters with diacritics)\n * @type {Record<string, string>}\n /\nexport const LATIN_EXTENDED = {\n Amacr: 'Ā',\n amacr: 'ā',\n Abreve: 'Ă',\n abreve: 'ă',\n Aogon: 'Ą',\n aogon: 'ą',\n Cacute: 'Ć',\n cacute: 'ć',\n Ccirc: 'Ĉ',\n ccirc: 'ĉ',\n Cdot: 'Ċ',\n cdot: 'ċ',\n Ccaron: 'Č',\n ccaron: 'č',\n Dcaron: 'Ď',\n dcaron: 'ď',\n Dstrok: 'Đ',\n dstrok: 'đ',\n Emacr: 'Ē',\n emacr: 'ē',\n Ecaron: 'Ě',\n ecaron: 'ě',\n Edot: 'Ė',\n edot: 'ė',\n Eogon: 'Ę',\n eogon: 'ę',\n Gcirc: 'Ĝ',\n gcirc: 'ĝ',\n Gbreve: 'Ğ',\n gbreve: 'ğ',\n Gdot: 'Ġ',\n gdot: 'ġ',\n Gcedil: 'Ģ',\n Hcirc: 'Ĥ',\n hcirc: 'ĥ',\n Hstrok: 'Ħ',\n hstrok: 'ħ',\n Itilde: 'Ĩ',\n itilde: 'ĩ',\n Imacr: 'Ī',\n imacr: 'ī',\n Iogon: 'Į',\n iogon: 'į',\n Idot: 'İ',\n IJlig: 'Ĳ',\n ijlig: 'ĳ',\n Jcirc: 'Ĵ',\n jcirc: 'ĵ',\n Kcedil: 'Ķ',\n kcedil: 'ķ',\n kgreen: 'ĸ',\n Lacute: 'Ĺ',\n lacute: 'ĺ',\n Lcedil: 'Ļ',\n lcedil: 'ļ',\n Lcaron: 'Ľ',\n lcaron: 'ľ',\n Lmidot: 'Ŀ',\n lmidot: 'ŀ',\n Lstrok: 'Ł',\n lstrok: 'ł',\n Nacute: 'Ń',\n nacute: 'ń',\n Ncaron: 'Ň',\n ncaron: 'ň',\n Ncedil: 'Ņ',\n ncedil: 'ņ',\n ENG: 'Ŋ',\n eng: 'ŋ',\n Omacr: 'Ō',\n omacr: 'ō',\n Odblac: 'Ő',\n odblac: 'ő',\n OElig: 'Œ',\n oelig: 'œ',\n Racute: 'Ŕ',\n racute: 'ŕ',\n Rcaron: 'Ř',\n rcaron: 'ř',\n Rcedil: 'Ŗ',\n rcedil: 'ŗ',\n Sacute: 'Ś',\n sacute: 'ś',\n Scirc: 'Ŝ',\n scirc: 'ŝ',\n Scedil: 'Ş',\n scedil: 'ş',\n Scaron: 'Š',\n scaron: 'š',\n Tcedil: 'Ţ',\n tcedil: 'ţ',\n Tcaron: 'Ť',\n tcaron: 'ť',\n Tstrok: 'Ŧ',\n tstrok: 'ŧ',\n Utilde: 'Ũ',\n utilde: 'ũ',\n Umacr: 'Ū',\n umacr: 'ū',\n Ubreve: 'Ŭ',\n ubreve: 'ŭ',\n Uring: 'Ů',\n uring: 'ů',\n Udblac: 'Ű',\n udblac: 'ű',\n Uogon: 'Ų',\n uogon: 'ų',\n Wcirc: 'Ŵ',\n wcirc: 'ŵ',\n Ycirc: 'Ŷ',\n ycirc: 'ŷ',\n Zacute: 'Ź',\n zacute: 'ź',\n Zdot: 'Ż',\n zdot: 'ż',\n Zcaron: 'Ž',\n zcaron: 'ž',\n};\n\n/\n Greek Letters\n * @type {Record<string, string>}\n /\nexport const GREEK = {\n Alpha: 'Α',\n alpha: 'α',\n Beta: 'Β',\n beta: 'β',\n Gamma: 'Γ',\n gamma: 'γ',\n Delta: 'Δ',\n delta: 'δ',\n Epsilon: 'Ε',\n epsilon: 'ε',\n epsiv: 'ϵ',\n varepsilon: 'ϵ',\n Zeta: 'Ζ',\n zeta: 'ζ',\n Eta: 'Η',\n eta: 'η',\n Theta: 'Θ',\n theta: 'θ',\n thetasym: 'ϑ',\n vartheta: 'ϑ',\n Iota: 'Ι',\n iota: 'ι',\n Kappa: 'Κ',\n kappa: 'κ',\n kappav: 'ϰ',\n varkappa: 'ϰ',\n Lambda: 'Λ',\n lambda: 'λ',\n Mu: 'Μ',\n mu: 'μ',\n Nu: 'Ν',\n nu: 'ν',\n Xi: 'Ξ',\n xi: 'ξ',\n Omicron: 'Ο',\n omicron: 'ο',\n Pi: 'Π',\n pi: 'π',\n piv: 'ϖ',\n varpi: 'ϖ',\n Rho: 'Ρ',\n rho: 'ρ',\n rhov: 'ϱ',\n varrho: 'ϱ',\n Sigma: 'Σ',\n sigma: 'σ',\n sigmaf: 'ς',\n sigmav: 'ς',\n varsigma: 'ς',\n Tau: 'Τ',\n tau: 'τ',\n Upsilon: 'Υ',\n upsilon: 'υ',\n upsi: 'υ',\n Upsi: 'ϒ',\n upsih: 'ϒ',\n Phi: 'Φ',\n phi: 'φ',\n phiv: 'ϕ',\n varphi: 'ϕ',\n Chi: 'Χ',\n chi: 'χ',\n Psi: 'Ψ',\n psi: 'ψ',\n Omega: 'Ω',\n omega: 'ω',\n ohm: 'Ω',\n Gammad: 'Ϝ',\n gammad: 'ϝ',\n digamma: 'ϝ',\n};\n\n/\n Cyrillic Letters\n * @type {Record<string, string>}\n /\nexport const CYRILLIC = {\n Afr: '𝔄',\n afr: '𝔞',\n Acy: 'А',\n acy: 'а',\n Bcy: 'Б',\n bcy: 'б',\n Vcy: 'В',\n vcy: 'в',\n Gcy: 'Г',\n gcy: 'г',\n Dcy: 'Д',\n dcy: 'д',\n IEcy: 'Е',\n iecy: 'е',\n IOcy: 'Ё',\n iocy: 'ё',\n ZHcy: 'Ж',\n zhcy: 'ж',\n Zcy: 'З',\n zcy: 'з',\n Icy: 'И',\n icy: 'и',\n Jcy: 'Й',\n jcy: 'й',\n Kcy: 'К',\n kcy: 'к',\n Lcy: 'Л',\n lcy: 'л',\n Mcy: 'М',\n mcy: 'м',\n Ncy: 'Н',\n ncy: 'н',\n Ocy: 'О',\n ocy: 'о',\n Pcy: 'П',\n pcy: 'п',\n Rcy: 'Р',\n rcy: 'р',\n Scy: 'С',\n scy: 'с',\n Tcy: 'Т',\n tcy: 'т',\n Ucy: 'У',\n ucy: 'у',\n Fcy: 'Ф',\n fcy: 'ф',\n KHcy: 'Х',\n khcy: 'х',\n TScy: 'Ц',\n tscy: 'ц',\n CHcy: 'Ч',\n chcy: 'ч',\n SHcy: 'Ш',\n shcy: 'ш',\n SHCHcy: 'Щ',\n shchcy: 'щ',\n HARDcy: 'Ъ',\n hardcy: 'ъ',\n Ycy: 'Ы',\n ycy: 'ы',\n SOFTcy: 'Ь',\n softcy: 'ь',\n Ecy: 'Э',\n ecy: 'э',\n YUcy: 'Ю',\n yucy: 'ю',\n YAcy: 'Я',\n yacy: 'я',\n DJcy: 'Ђ',\n djcy: 'ђ',\n GJcy: 'Ѓ',\n gjcy: 'ѓ',\n Jukcy: 'Є',\n jukcy: 'є',\n DScy: 'Ѕ',\n dscy: 'ѕ',\n Iukcy: 'І',\n iukcy: 'і',\n YIcy: 'Ї',\n yicy: 'ї',\n Jsercy: 'Ј',\n jsercy: 'ј',\n LJcy: 'Љ',\n ljcy: 'љ',\n NJcy: 'Њ',\n njcy: 'њ',\n TSHcy: 'Ћ',\n tshcy: 'ћ',\n KJcy: 'Ќ',\n kjcy: 'ќ',\n Ubrcy: 'Ў',\n ubrcy: 'ў',\n DZcy: 'Џ',\n dzcy: 'џ',\n};\n\n/\n Mathematical Operators & Relations\n * @type {Record<string, string>}\n /\nexport const MATH = {\n plus: '+',\n minus: '−',\n mnplus: '∓',\n mp: '∓',\n pm: '±',\n times: '×',\n div: '÷',\n divide: '÷',\n sdot: '⋅',\n star: '☆',\n starf: '★',\n bigstar: '★',\n lowast: '∗',\n ast: '',\n midast: '',\n compfn: '∘',\n smallcircle: '∘',\n bullet: '•',\n bull: '•',\n nbsp: '\\u00a0',\n hellip: '…',\n mldr: '…',\n prime: '′',\n Prime: '″',\n tprime: '‴',\n bprime: '‵',\n backprime: '‵',\n minus: '−',\n minusd: '∸',\n dotminus: '∸',\n plusdo: '∔',\n dotplus: '∔',\n plusmn: '±',\n minusplus: '∓',\n mnplus: '∓',\n mp: '∓',\n setminus: '∖',\n smallsetminus: '∖',\n Backslash: '∖',\n setmn: '∖',\n ssetmn: '∖',\n lowbar: '_',\n verbar: '\|',\n vert: '\|',\n VerticalLine: '\|',\n colon: ':',\n Colon: '∷',\n Proportion: '∷',\n ratio: '∶',\n equals: '=',\n ne: '≠',\n nequiv: '≢',\n equiv: '≡',\n Congruent: '≡',\n sim: '∼',\n thicksim: '∼',\n thksim: '∼',\n sime: '≃',\n simeq: '≃',\n TildeEqual: '≃',\n asymp: '≈',\n approx: '≈',\n thickapprox: '≈',\n thkap: '≈',\n TildeTilde: '≈',\n ncong: '≇',\n cong: '≅',\n TildeFullEqual: '≅',\n asympeq: '≍',\n CupCap: '≍',\n bump: '≎',\n Bumpeq: '≎',\n HumpDownHump: '≎',\n bumpe: '≏',\n bumpeq: '≏',\n HumpEqual: '≏',\n dotminus: '∸',\n minusd: '∸',\n plusdo: '∔',\n dotplus: '∔',\n le: '≤',\n LessEqual: '≤',\n ge: '≥',\n GreaterEqual: '≥',\n lesseqgtr: '⋚',\n lesseqqgtr: '⪋',\n greater: '>',\n less: '<',\n};\n\n/\n Mathematical Operators (Advanced)\n * @type {Record<string, string>}\n /\nexport const MATH_ADVANCED = {\n alefsym: 'ℵ',\n aleph: 'ℵ',\n beth: 'ℶ',\n gimel: 'ℷ',\n daleth: 'ℸ',\n forall: '∀',\n ForAll: '∀',\n part: '∂',\n PartialD: '∂',\n exist: '∃',\n Exists: '∃',\n nexist: '∄',\n nexists: '∄',\n empty: '∅',\n emptyset: '∅',\n emptyv: '∅',\n varnothing: '∅',\n nabla: '∇',\n Del: '∇',\n isin: '∈',\n isinv: '∈',\n in: '∈',\n Element: '∈',\n notin: '∉',\n notinva: '∉',\n ni: '∋',\n niv: '∋',\n SuchThat: '∋',\n ReverseElement: '∋',\n notni: '∌',\n notniva: '∌',\n prod: '∏',\n Product: '∏',\n coprod: '∐',\n Coproduct: '∐',\n sum: '∑',\n Sum: '∑',\n minus: '−',\n mp: '∓',\n plusdo: '∔',\n dotplus: '∔',\n setminus: '∖',\n lowast: '∗',\n radic: '√',\n Sqrt: '√',\n prop: '∝',\n propto: '∝',\n Proportional: '∝',\n varpropto: '∝',\n infin: '∞',\n infintie: '⧝',\n ang: '∠',\n angle: '∠',\n angmsd: '∡',\n measuredangle: '∡',\n angsph: '∢',\n mid: '∣',\n VerticalBar: '∣',\n nmid: '∤',\n nsmid: '∤',\n npar: '∦',\n parallel: '∥',\n spar: '∥',\n nparallel: '∦',\n nspar: '∦',\n and: '∧',\n wedge: '∧',\n or: '∨',\n vee: '∨',\n cap: '∩',\n cup: '∪',\n int: '∫',\n Integral: '∫',\n conint: '∮',\n ContourIntegral: '∮',\n Conint: '∯',\n DoubleContourIntegral: '∯',\n Cconint: '∰',\n there4: '∴',\n therefore: '∴',\n Therefore: '∴',\n becaus: '∵',\n because: '∵',\n Because: '∵',\n ratio: '∶',\n Proportion: '∷',\n minusd: '∸',\n dotminus: '∸',\n mDDot: '∺',\n homtht: '∻',\n sim: '∼',\n bsimg: '∽',\n backsim: '∽',\n ac: '∾',\n mstpos: '∾',\n acd: '∿',\n VerticalTilde: '≀',\n wr: '≀',\n wreath: '≀',\n nsime: '≄',\n nsimeq: '≄',\n nsimeq: '≄',\n ncong: '≇',\n simne: '≆',\n ncongdot: '⩭̸',\n ngsim: '≵',\n nsim: '≁',\n napprox: '≉',\n nap: '≉',\n ngeq: '≱',\n nge: '≱',\n nleq: '≰',\n nle: '≰',\n ngtr: '≯',\n ngt: '≯',\n nless: '≮',\n nlt: '≮',\n nprec: '⊀',\n npr: '⊀',\n nsucc: '⊁',\n nsc: '⊁',\n};\n\n/\n Arrows\n * @type {Record<string, string>}\n /\nexport const ARROWS = {\n larr: '←',\n leftarrow: '←',\n LeftArrow: '←',\n uarr: '↑',\n uparrow: '↑',\n UpArrow: '↑',\n rarr: '→',\n rightarrow: '→',\n RightArrow: '→',\n darr: '↓',\n downarrow: '↓',\n DownArrow: '↓',\n harr: '↔',\n leftrightarrow: '↔',\n LeftRightArrow: '↔',\n varr: '↕',\n updownarrow: '↕',\n UpDownArrow: '↕',\n nwarr: '↖',\n nwarrow: '↖',\n UpperLeftArrow: '↖',\n nearr: '↗',\n nearrow: '↗',\n UpperRightArrow: '↗',\n searr: '↘',\n searrow: '↘',\n LowerRightArrow: '↘',\n swarr: '↙',\n swarrow: '↙',\n LowerLeftArrow: '↙',\n lArr: '⇐',\n Leftarrow: '⇐',\n uArr: '⇑',\n Uparrow: '⇑',\n rArr: '⇒',\n Rightarrow: '⇒',\n dArr: '⇓',\n Downarrow: '⇓',\n hArr: '⇔',\n Leftrightarrow: '⇔',\n iff: '⇔',\n vArr: '⇕',\n Updownarrow: '⇕',\n lAarr: '⇚',\n Lleftarrow: '⇚',\n rAarr: '⇛',\n Rrightarrow: '⇛',\n lrarr: '⇆',\n leftrightarrows: '⇆',\n rlarr: '⇄',\n rightleftarrows: '⇄',\n lrhar: '⇋',\n leftrightharpoons: '⇋',\n ReverseEquilibrium: '⇋',\n rlhar: '⇌',\n rightleftharpoons: '⇌',\n Equilibrium: '⇌',\n udarr: '⇅',\n UpArrowDownArrow: '⇅',\n duarr: '⇵',\n DownArrowUpArrow: '⇵',\n llarr: '⇇',\n leftleftarrows: '⇇',\n rrarr: '⇉',\n rightrightarrows: '⇉',\n ddarr: '⇊',\n downdownarrows: '⇊',\n har: '↽',\n lhard: '↽',\n leftharpoondown: '↽',\n lharu: '↼',\n leftharpoonup: '↼',\n rhard: '⇁',\n rightharpoondown: '⇁',\n rharu: '⇀',\n rightharpoonup: '⇀',\n lsh: '↰',\n Lsh: '↰',\n rsh: '↱',\n Rsh: '↱',\n ldsh: '↲',\n rdsh: '↳',\n hookleftarrow: '↩',\n hookrightarrow: '↪',\n mapstoleft: '↤',\n mapstoup: '↥',\n map: '↦',\n mapsto: '↦',\n mapstodown: '↧',\n crarr: '↵',\n nwarrow: '↖',\n nearrow: '↗',\n searrow: '↘',\n swarrow: '↙',\n nleftarrow: '↚',\n nleftrightarrow: '↮',\n nrightarrow: '↛',\n nrarr: '↛',\n larrtl: '↢',\n rarrtl: '↣',\n leftarrowtail: '↢',\n rightarrowtail: '↣',\n twoheadleftarrow: '↞',\n twoheadrightarrow: '↠',\n Larr: '↞',\n Rarr: '↠',\n larrhk: '↩',\n rarrhk: '↪',\n larrlp: '↫',\n looparrowleft: '↫',\n rarrlp: '↬',\n looparrowright: '↬',\n harrw: '↭',\n leftrightsquigarrow: '↭',\n nrarrw: '↝̸',\n rarrw: '↝',\n rightsquigarrow: '↝',\n larrbfs: '⤟',\n rarrbfs: '⤠',\n nvHarr: '⤄',\n nvlArr: '⤂',\n nvrArr: '⤃',\n larrfs: '⤝',\n rarrfs: '⤞',\n Map: '⤅',\n larrsim: '⥳',\n rarrsim: '⥴',\n harrcir: '⥈',\n Uarrocir: '⥉',\n lurdshar: '⥊',\n ldrdhar: '⥧',\n ldrushar: '⥋',\n rdldhar: '⥩',\n lrhard: '⥭',\n rlhar: '⇌',\n uharr: '↾',\n uharl: '↿',\n dharr: '⇂',\n dharl: '⇃',\n Uarr: '↟',\n Darr: '↡',\n zigrarr: '⇝',\n nwArr: '⇖',\n neArr: '⇗',\n seArr: '⇘',\n swArr: '⇙',\n nharr: '↮',\n nhArr: '⇎',\n nlarr: '↚',\n nlArr: '⇍',\n nrarr: '↛',\n nrArr: '⇏',\n larrb: '⇤',\n LeftArrowBar: '⇤',\n rarrb: '⇥',\n RightArrowBar: '⇥',\n};\n\n/\n Geometric Shapes\n * @type {Record<string, string>}\n /\nexport const SHAPES = {\n square: '□',\n Square: '□',\n squ: '□',\n squf: '▪',\n squarf: '▪',\n blacksquar: '▪',\n blacksquare: '▪',\n FilledVerySmallSquare: '▪',\n blk34: '▓',\n blk12: '▒',\n blk14: '░',\n block: '█',\n srect: '▭',\n rect: '▭',\n sdot: '⋅',\n sdotb: '⊡',\n dotsquare: '⊡',\n triangle: '▵',\n tri: '▵',\n trine: '▵',\n utri: '▵',\n triangledown: '▿',\n dtri: '▿',\n tridown: '▿',\n triangleleft: '◃',\n ltri: '◃',\n triangleright: '▹',\n rtri: '▹',\n blacktriangle: '▴',\n utrif: '▴',\n blacktriangledown: '▾',\n dtrif: '▾',\n blacktriangleleft: '◂',\n ltrif: '◂',\n blacktriangleright: '▸',\n rtrif: '▸',\n loz: '◊',\n lozenge: '◊',\n blacklozenge: '⧫',\n lozf: '⧫',\n bigcirc: '◯',\n xcirc: '◯',\n circ: 'ˆ',\n Circle: '○',\n cir: '○',\n o: '○',\n bullet: '•',\n bull: '•',\n hellip: '…',\n mldr: '…',\n nldr: '‥',\n boxh: '─',\n HorizontalLine: '─',\n boxv: '│',\n boxdr: '┌',\n boxdl: '┐',\n boxur: '└',\n boxul: '┘',\n boxvr: '├',\n boxvl: '┤',\n boxhd: '┬',\n boxhu: '┴',\n boxvh: '┼',\n boxH: '═',\n boxV: '║',\n boxdR: '╒',\n boxDr: '╓',\n boxDR: '╔',\n boxDl: '╕',\n boxdL: '╖',\n boxDL: '╗',\n boxuR: '╘',\n boxUr: '╙',\n boxUR: '╚',\n boxUl: '╜',\n boxuL: '╛',\n boxUL: '╝',\n boxvR: '╞',\n boxVr: '╟',\n boxVR: '╠',\n boxVl: '╢',\n boxvL: '╡',\n boxVL: '╣',\n boxHd: '╤',\n boxhD: '╥',\n boxHD: '╦',\n boxHu: '╧',\n boxhU: '╨',\n boxHU: '╩',\n boxvH: '╪',\n boxVh: '╫',\n boxVH: '╬',\n};\n\n/\n Punctuation & Diacritics\n * @type {Record<string, string>}\n /\nexport const PUNCTUATION = {\n excl: '!',\n iexcl: '¡',\n brvbar: '¦',\n sect: '§',\n uml: '¨',\n copy: '©',\n ordf: 'ª',\n laquo: '«',\n not: '¬',\n shy: '\\u00ad',\n reg: '®',\n macr: '¯',\n deg: '°',\n plusmn: '±',\n sup2: '²',\n sup3: '³',\n acute: '´',\n micro: 'µ',\n para: '¶',\n middot: '·',\n cedil: '¸',\n sup1: '¹',\n ordm: 'º',\n raquo: '»',\n frac14: '¼',\n frac12: '½',\n frac34: '¾',\n iquest: '¿',\n nbsp: '\\u00a0',\n comma: ',',\n period: '.',\n colon: ':',\n semi: ';',\n vert: '\|',\n Verbar: '‖',\n verbar: '\|',\n dblac: '˝',\n circ: 'ˆ',\n caron: 'ˇ',\n breve: '˘',\n dot: '˙',\n ring: '˚',\n ogon: '˛',\n tilde: '˜',\n DiacriticalGrave: '`',\n DiacriticalAcute: '´',\n DiacriticalTilde: '˜',\n DiacriticalDot: '˙',\n DiacriticalDoubleAcute: '˝',\n grave: '`',\n acute: '´',\n};\n\n/\n Currency Symbols\n * @type {Record<string, string>}\n /\nexport const CURRENCY = {\n cent: '¢',\n pound: '£',\n curren: '¤',\n yen: '¥',\n euro: '€',\n dollar: '$',\n euro: '€',\n fnof: 'ƒ',\n inr: '₹',\n af: '؋',\n birr: 'ብር',\n peso: '₱',\n rub: '₽',\n won: '₩',\n yuan: '¥',\n cedil: '¸',\n};\n\n/\n Fractions\n * @type {Record<string, string>}\n /\nexport const FRACTIONS = {\n frac12: '½',\n half: '½',\n frac13: '⅓',\n frac14: '¼',\n frac15: '⅕',\n frac16: '⅙',\n frac18: '⅛',\n frac23: '⅔',\n frac25: '⅖',\n frac34: '¾',\n frac35: '⅗',\n frac38: '⅜',\n frac45: '⅘',\n frac56: '⅚',\n frac58: '⅝',\n frac78: '⅞',\n frasl: '⁄',\n};\n\n/\n Miscellaneous Symbols\n * @type {Record<string, string>}\n /\nexport const MISC_SYMBOLS = {\n trade: '™',\n TRADE: '™',\n telrec: '⌕',\n target: '⌖',\n ulcorn: '⌜',\n ulcorner: '⌜',\n urcorn: '⌝',\n urcorner: '⌝',\n dlcorn: '⌞',\n llcorner: '⌞',\n drcorn: '⌟',\n lrcorner: '⌟',\n intercal: '⊺',\n intcal: '⊺',\n oplus: '⊕',\n CirclePlus: '⊕',\n ominus: '⊖',\n CircleMinus: '⊖',\n otimes: '⊗',\n CircleTimes: '⊗',\n osol: '⊘',\n odot: '⊙',\n CircleDot: '⊙',\n oast: '⊛',\n circledast: '⊛',\n odash: '⊝',\n circleddash: '⊝',\n ocirc: '⊚',\n circledcirc: '⊚',\n boxplus: '⊞',\n plusb: '⊞',\n boxminus: '⊟',\n minusb: '⊟',\n boxtimes: '⊠',\n timesb: '⊠',\n boxdot: '⊡',\n sdotb: '⊡',\n veebar: '⊻',\n vee: '∨',\n barvee: '⊽',\n and: '∧',\n wedge: '∧',\n Cap: '⋒',\n Cup: '⋓',\n Fork: '⋔',\n pitchfork: '⋔',\n epar: '⋕',\n ltlarr: '⥶',\n nvap: '≍⃒',\n nvsim: '∼⃒',\n nvge: '≥⃒',\n nvle: '≤⃒',\n nvlt: '<⃒',\n nvgt: '>⃒',\n nvltrie: '⊴⃒',\n nvrtrie: '⊵⃒',\n Vdash: '⊩',\n dashv: '⊣',\n vDash: '⊨',\n Vdash: '⊩',\n Vvdash: '⊪',\n nvdash: '⊬',\n nvDash: '⊭',\n nVdash: '⊮',\n nVDash: '⊯',\n};\n\n/\n All entities combined (if you need everything)\n * @type {Record<string, string>}\n /\nexport const ALL_ENTITIES = {\n ...BASIC_LATIN,\n ...LATIN_ACCENTS,\n ...LATIN_EXTENDED,\n ...GREEK,\n ...CYRILLIC,\n ...MATH,\n ...MATH_ADVANCED,\n ...ARROWS,\n ...SHAPES,\n ...PUNCTUATION,\n ...CURRENCY,\n ...FRACTIONS,\n ...MISC_SYMBOLS,\n};\n\nexport const XML = {\n amp: \"&\",\n apos: \"'\",\n gt: \">\",\n lt: \"<\",\n quot: \"\\\"\"\n}\nexport const COMMON_HTML = {\n nbsp: '\\u00a0',\n copy: '\\u00a9',\n reg: '\\u00ae',\n trade: '\\u2122',\n mdash: '\\u2014',\n ndash: '\\u2013',\n hellip: '\\u2026',\n laquo: '\\u00ab',\n raquo: '\\u00bb',\n lsquo: '\\u2018',\n rsquo: '\\u2019',\n ldquo: '\\u201c',\n rdquo: '\\u201d',\n bull: '\\u2022',\n para: '\\u00b6',\n sect: '\\u00a7',\n deg: '\\u00b0',\n frac12: '\\u00bd',\n frac14: '\\u00bc',\n frac34: '\\u00be',\n}\n// ---------------------------------------------------------------------------\n// Note: NUMERIC_ENTITIES (&#NNN; / &#xHH;) are handled by the scanner directly\n// via String.fromCodePoint() without any map lookup.\n// ---------------------------------------------------------------------------","// ---------------------------------------------------------------------------\n// Built-in named entity map (name → replacement string)\n// No regex, no {regex,val} objects — just flat key/value pairs.\n// ---------------------------------------------------------------------------\n\nimport { XML as DEFAULT_XML_ENTITIES } from \"./entities.js\"\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nconst SPECIAL_CHARS = new Set('!?\\\\\\\\/[]$%{}^&()<>\|+');\n\n/*\n Validate that an entity name contains no dangerous characters.\n * @param {string} name\n * @returns {string} the name, unchanged\n * @throws {Error} on invalid characters\n /\nfunction validateEntityName(name) {\n if (name[0] === '#') {\n throw new Error(`[EntityReplacer] Invalid character '#' in entity name: \"${name}\"`);\n }\n for (const ch of name) {\n if (SPECIAL_CHARS.has(ch)) {\n throw new Error(`[EntityReplacer] Invalid character '${ch}' in entity name: \"${name}\"`);\n }\n }\n return name;\n}\n\n/\n Merge one or more entity maps into a flat name→string map.\n * Accepts either:\n * - plain string values: { amp: '&' }\n * - legacy {regex,val} / {regx,val}: { lt: { regex: /.../, val: '<' } }\n \n Values containing '&' are skipped (recursive expansion risk).\n \n @param {...object} maps\n * @returns {Record<string, string>}\n /\nfunction mergeEntityMaps(...maps) {\n const out = Object.create(null);\n for (const map of maps) {\n if (!map) continue;\n for (const key of Object.keys(map)) {\n const raw = map[key];\n if (typeof raw === 'string') {\n out[key] = raw;\n } else if (raw && typeof raw === 'object' && raw.val !== undefined) {\n // Legacy {regex,val} or {regx,val} — extract the string val only\n const val = raw.val;\n if (typeof val === 'string') {\n out[key] = val;\n }\n // function vals are not supported in the scanner — skip\n }\n }\n }\n return out;\n}\n\n// ---------------------------------------------------------------------------\n// applyLimitsTo helpers\n// ---------------------------------------------------------------------------\n\nconst LIMIT_TIER_EXTERNAL = 'external'; // input/runtime + persistent external maps\nconst LIMIT_TIER_BASE = 'base'; // DEFAULT_XML_ENTITIES + namedEntities (system) maps\nconst LIMIT_TIER_ALL = 'all'; // every entity regardless of tier\n\n/\n Resolve `applyLimitsTo` option into a normalised Set of tier strings.\n * Accepted values: 'external' \| 'base' \| 'all' \| string[]\n * Default: 'external' (only untrusted injected entities are counted).\n * @param {string\|string[]\|undefined} raw\n * @returns {Set<string>}\n /\nfunction parseLimitTiers(raw) {\n if (!raw \|\| raw === LIMIT_TIER_EXTERNAL) return new Set([LIMIT_TIER_EXTERNAL]);\n if (raw === LIMIT_TIER_ALL) return new Set([LIMIT_TIER_ALL]);\n if (raw === LIMIT_TIER_BASE) return new Set([LIMIT_TIER_BASE]);\n if (Array.isArray(raw)) return new Set(raw);\n return new Set([LIMIT_TIER_EXTERNAL]); // safe default for unrecognised values\n}\n\n// ---------------------------------------------------------------------------\n// NCR (Numeric Character Reference) classification\n// ---------------------------------------------------------------------------\n\n// Severity order — higher number = stricter action.\n// Used to enforce minimum action levels for specific codepoint ranges.\nconst NCR_LEVEL = Object.freeze({ allow: 0, leave: 1, remove: 2, throw: 3 });\n\n// XML 1.0 §2.2: allowed chars are #x9 \| #xA \| #xD \| [#x20-#xD7FF] \| [#xE000-#xFFFD] \| [#x10000-#x10FFFF]\n// Restricted C0: U+0001–U+001F excluding U+0009, U+000A, U+000D\nconst XML10_ALLOWED_C0 = new Set([0x09, 0x0A, 0x0D]);\n\n/\n Parse the `ncr` constructor option into flat, hot-path-friendly fields.\n * @param {object\|undefined} ncr\n * @returns {{ xmlVersion: number, onLevel: number, nullLevel: number }}\n /\nfunction parseNCRConfig(ncr) {\n if (!ncr) {\n return { xmlVersion: 1.0, onLevel: NCR_LEVEL.allow, nullLevel: NCR_LEVEL.remove };\n }\n const xmlVersion = ncr.xmlVersion === 1.1 ? 1.1 : 1.0;\n const onLevel = NCR_LEVEL[ncr.onNCR] ?? NCR_LEVEL.allow;\n const nullLevel = NCR_LEVEL[ncr.nullNCR] ?? NCR_LEVEL.remove;\n // 'allow' is not meaningful for null — clamp to at least 'remove'\n const clampedNull = Math.max(nullLevel, NCR_LEVEL.remove);\n return { xmlVersion, onLevel, nullLevel: clampedNull };\n}\n\n// ---------------------------------------------------------------------------\n// EntityReplacer\n// ---------------------------------------------------------------------------\n\n/\n Single-pass, zero-regex entity replacer for XML/HTML content.\n \n Algorithm: scan the string once for '&', read to ';', resolve via map\n * or direct codepoint conversion, build output chunks, join once at the end.\n \n Entity lookup priority (highest → lowest):\n * 1. input / runtime (DOCTYPE entities for current document)\n * 2. persistent external (survive across documents)\n * 3. base named map (DEFAULT_XML_ENTITIES + user-supplied namedEntities)\n \n Both input and external resolve as the 'external' tier for limit purposes.\n * Base map entities resolve as the 'base' tier.\n \n Numeric / hex references (&#NNN; / &#xHH;) are resolved directly via\n * String.fromCodePoint() — no map needed. They count as 'base' tier.\n \n @example\n * const replacer = new EntityReplacer({ namedEntities: COMMON_HTML });\n * replacer.setExternalEntities({ brand: 'Acme' });\n \n const instance = replacer.reset();\n * instance.addInputEntities({ version: '1.0' });\n * instance.encode('&brand; v&version; <'); // 'Acme v1.0 <'\n /\nexport default class EntityDecoder {\n /\n @param {object} [options]\n * @param {object\|null} [options.namedEntities] — extra named entities merged into base map\n * @param {object} [options.limit] — security limits\n * @param {number} [options.limit.maxTotalExpansions=0] — 0 = unlimited\n * @param {number} [options.limit.maxExpandedLength=0] — 0 = unlimited\n * @param {'external'\|'base'\|'all'\|string[]} [options.limit.applyLimitsTo='external']\n * Which entity tiers count against the security limits:\n * - 'external' (default) — only input/runtime + persistent external entities\n * - 'base' — only DEFAULT_XML_ENTITIES + namedEntities\n * - 'all' — every entity regardless of tier\n * - string[] — explicit combination, e.g. ['external', 'base']\n * @param {((resolved: string, original: string) => string)\|null} [options.postCheck=null]\n * @param {string[]} [options.remove=[]] — entity names (e.g. ['nbsp', '#13']) to delete (replace with empty string)\n * @param {string[]} [options.leave=[]] — entity names to keep as literal (unchanged in output)\n * @param {object} [options.ncr] — Numeric Character Reference controls\n * @param {1.0\|1.1} [options.ncr.xmlVersion=1.0]\n * XML version governing which codepoint ranges are restricted:\n * - 1.0 — C0 controls U+0001–U+001F (except U+0009/000A/000D) are prohibited\n * - 1.1 — C0 controls are allowed when written as NCRs; C1 (U+007F–U+009F) decoded as-is\n * @param {'allow'\|'leave'\|'remove'\|'throw'} [options.ncr.onNCR='allow']\n * Base action for numeric references. Severity order: allow < leave < remove < throw.\n * For codepoint ranges that carry a minimum level (surrogates → remove, XML 1.0 C0 → remove),\n * the effective action is max(onNCR, rangeMinimum).\n * @param {'remove'\|'throw'} [options.ncr.nullNCR='remove']\n * Action for U+0000 (null). 'allow' and 'leave' are clamped to 'remove' since null is never safe.\n /\n constructor(options = {}) {\n this._limit = options.limit \|\| {};\n this._maxTotalExpansions = this._limit.maxTotalExpansions \|\| 0;\n this._maxExpandedLength = this._limit.maxExpandedLength \|\| 0;\n this._postCheck = typeof options.postCheck === 'function' ? options.postCheck : r => r;\n this._limitTiers = parseLimitTiers(this._limit.applyLimitsTo ?? LIMIT_TIER_EXTERNAL);\n this._numericAllowed = options.numericAllowed ?? true;\n // Base map: DEFAULT_XML_ENTITIES + user-supplied extras. Immutable after construction.\n this._baseMap = mergeEntityMaps(DEFAULT_XML_ENTITIES, options.namedEntities \|\| null);\n\n // Persistent external entities — survive across documents.\n // Stored as a separate map so reset() never touches them.\n /* @type {Record<string, string>} /\n this._externalMap = Object.create(null);\n\n // Input / runtime entities — current document only, wiped on reset().\n /* @type {Record<string, string>} /\n this._inputMap = Object.create(null);\n\n // Per-document counters\n this._totalExpansions = 0;\n this._expandedLength = 0;\n\n // --- New: remove / leave sets ---\n /* @type {Set<string>} /\n this._removeSet = new Set(options.remove && Array.isArray(options.remove) ? options.remove : []);\n /* @type {Set<string>} /\n this._leaveSet = new Set(options.leave && Array.isArray(options.leave) ? options.leave : []);\n\n // --- NCR config (parsed into flat fields for hot-path speed) ---\n const ncrCfg = parseNCRConfig(options.ncr);\n this._ncrXmlVersion = ncrCfg.xmlVersion;\n this._ncrOnLevel = ncrCfg.onLevel;\n this._ncrNullLevel = ncrCfg.nullLevel;\n }\n\n // -------------------------------------------------------------------------\n // Persistent external entity registration\n // -------------------------------------------------------------------------\n\n /\n Replace the full set of persistent external entities.\n * All keys are validated — throws on invalid characters.\n * @param {Record<string, string \| { regex?: RegExp, val: string }>} map\n /\n setExternalEntities(map) {\n if (map) {\n for (const key of Object.keys(map)) {\n validateEntityName(key);\n }\n }\n this._externalMap = mergeEntityMaps(map);\n }\n\n /\n Add a single persistent external entity.\n * @param {string} key\n * @param {string} value\n /\n addExternalEntity(key, value) {\n validateEntityName(key);\n if (typeof value === 'string' && value.indexOf('&') === -1) {\n this._externalMap[key] = value;\n }\n }\n\n // -------------------------------------------------------------------------\n // Input / runtime entity registration (per document)\n // -------------------------------------------------------------------------\n\n /\n Inject DOCTYPE entities for the current document.\n * Also resets per-document expansion counters.\n * @param {Record<string, string \| { regx?: RegExp, regex?: RegExp, val: string }>} map\n /\n addInputEntities(map) {\n this._totalExpansions = 0;\n this._expandedLength = 0;\n this._inputMap = mergeEntityMaps(map);\n }\n\n // -------------------------------------------------------------------------\n // Per-document reset\n // -------------------------------------------------------------------------\n\n /\n Wipe input/runtime entities and reset counters.\n * Call this before processing each new document.\n * @returns {this}\n /\n reset() {\n this._inputMap = Object.create(null);\n this._totalExpansions = 0;\n this._expandedLength = 0;\n return this;\n }\n\n // -------------------------------------------------------------------------\n // XML version (can be set after construction, e.g. once parser reads <?xml?>)\n // -------------------------------------------------------------------------\n\n /\n Update the XML version used for NCR classification.\n * Call this as soon as the document's `<?xml version=\"...\">` declaration is parsed.\n * @param {1.0\|1.1\|number} version\n /\n setXmlVersion(version) {\n this._ncrXmlVersion = version === 1.1 ? 1.1 : 1.0;\n }\n\n // -------------------------------------------------------------------------\n // Primary API\n // -------------------------------------------------------------------------\n\n /\n Replace all entity references in `str` in a single pass.\n \n @param {string} str\n * @returns {string}\n /\n decode(str) {\n if (typeof str !== 'string' \|\| str.length === 0) return str;\n //TODO: check if needed\n //if (str.indexOf('&') === -1) return str; // fast path — no entities at all\n\n const original = str;\n const chunks = [];\n const len = str.length;\n let last = 0; // start of next unprocessed literal chunk\n let i = 0;\n\n const limitExpansions = this._maxTotalExpansions > 0;\n const limitLength = this._maxExpandedLength > 0;\n const checkLimits = limitExpansions \|\| limitLength;\n\n while (i < len) {\n // Scan forward to next '&'\n if (str.charCodeAt(i) !== 38 / '&' /) { i++; continue; }\n\n // --- Found '&' at position i ---\n\n // Scan forward to ';'\n let j = i + 1;\n while (j < len && str.charCodeAt(j) !== 59 / ';' / && (j - i) <= 32) j++;\n\n if (j >= len \|\| str.charCodeAt(j) !== 59) {\n // No closing ';' within window — treat '&' as literal\n i++;\n continue;\n }\n\n // Raw token between '&' and ';' (exclusive)\n const token = str.slice(i + 1, j);\n if (token.length === 0) { i++; continue; }\n\n let replacement;\n let tier; // which limit tier this entity belongs to\n\n if (this._removeSet.has(token)) {\n // Remove entity: replace with empty string\n replacement = '';\n // If entity was unknown (replacement undefined), we still need a tier for limits.\n // Treat as external tier because it's user-directed removal of an unknown reference.\n if (tier === undefined) {\n tier = LIMIT_TIER_EXTERNAL;\n }\n } else if (this._leaveSet.has(token)) {\n // Do not replace — keep original &token; as literal\n i++;\n continue;\n } else if (token.charCodeAt(0) === 35 / '#' /) {\n // ---- Numeric / NCR reference ----\n // NCR classification always runs first — prohibited codepoints must be\n // caught regardless of numericAllowed.\n const ncrResult = this._resolveNCR(token);\n if (ncrResult === undefined) {\n // 'leave' action — keep original &token; as-is\n i++;\n continue;\n }\n replacement = ncrResult; // '' for remove, char string for allow\n tier = LIMIT_TIER_BASE;\n } else {\n // ---- Named reference ----\n const resolved = this._resolveName(token);\n replacement = resolved?.value;\n tier = resolved?.tier;\n }\n\n if (replacement === undefined) {\n // Unknown entity — leave as-is, advance past '&' only\n i++;\n continue;\n }\n\n // Flush literal chunk before this entity\n if (i > last) chunks.push(str.slice(last, i));\n chunks.push(replacement);\n last = j + 1; // skip past ';'\n i = last;\n\n // Apply expansion limits only if this tier is being tracked\n if (checkLimits && this._tierCounts(tier)) {\n if (limitExpansions) {\n this._totalExpansions++;\n if (this._totalExpansions > this._maxTotalExpansions) {\n throw new Error(\n `[EntityReplacer] Entity expansion count limit exceeded: ` +\n `${this._totalExpansions} > ${this._maxTotalExpansions}`\n );\n }\n }\n if (limitLength) {\n // delta: replacement.length minus the raw &token; length (token.length + 2 for '&' and ';')\n const delta = replacement.length - (token.length + 2);\n if (delta > 0) {\n this._expandedLength += delta;\n if (this._expandedLength > this._maxExpandedLength) {\n throw new Error(\n `[EntityReplacer] Expanded content length limit exceeded: ` +\n `${this._expandedLength} > ${this._maxExpandedLength}`\n );\n }\n }\n }\n }\n }\n\n // Flush trailing literal\n if (last < len) chunks.push(str.slice(last));\n\n // If nothing was replaced, chunks is empty — return original\n const result = chunks.length === 0 ? str : chunks.join('');\n\n return this._postCheck(result, original);\n }\n\n // -------------------------------------------------------------------------\n // Private: limit tier check\n // -------------------------------------------------------------------------\n\n /\n Returns true if a resolved entity of the given tier should count\n * against the expansion/length limits.\n * @param {string} tier — LIMIT_TIER_EXTERNAL \| LIMIT_TIER_BASE\n * @returns {boolean}\n /\n _tierCounts(tier) {\n if (this._limitTiers.has(LIMIT_TIER_ALL)) return true;\n return this._limitTiers.has(tier);\n }\n\n // -------------------------------------------------------------------------\n // Private: entity resolution\n // -------------------------------------------------------------------------\n\n /\n Resolve a named entity token (without & and ;).\n * Priority: inputMap > externalMap > baseMap\n * Returns the resolved value tagged with its limit tier.\n \n @param {string} name\n * @returns {{ value: string, tier: string }\|undefined}\n /\n _resolveName(name) {\n // input and external both count as 'external' tier for limit purposes —\n // they are injected at runtime and are the untrusted surface.\n if (name in this._inputMap) return { value: this._inputMap[name], tier: LIMIT_TIER_EXTERNAL };\n if (name in this._externalMap) return { value: this._externalMap[name], tier: LIMIT_TIER_EXTERNAL };\n if (name in this._baseMap) return { value: this._baseMap[name], tier: LIMIT_TIER_BASE };\n return undefined;\n }\n\n /\n Classify a codepoint and return the minimum action level that must be applied.\n * Returns -1 when no minimum is imposed (normal allow path).\n \n Ranges checked (in priority order):\n * 1. U+0000 — null, governed by nullNCR (always ≥ remove)\n * 2. U+D800–U+DFFF — surrogates, always prohibited (min: remove)\n * 3. U+0001–U+001F \\ {0x09,0x0A,0x0D} — XML 1.0 restricted C0 (min: remove)\n * (skipped in XML 1.1 — C0 controls are allowed when written as NCRs)\n \n @param {number} cp — codepoint\n * @returns {number} — minimum NCR_LEVEL value, or -1 for no restriction\n /\n _classifyNCR(cp) {\n // 1. Null\n if (cp === 0) return this._ncrNullLevel;\n\n // 2. Surrogates — always prohibited, minimum 'remove'\n if (cp >= 0xD800 && cp <= 0xDFFF) return NCR_LEVEL.remove;\n\n // 3. XML 1.0 restricted C0 controls\n if (this._ncrXmlVersion === 1.0) {\n if (cp >= 0x01 && cp <= 0x1F && !XML10_ALLOWED_C0.has(cp)) return NCR_LEVEL.remove;\n }\n\n return -1; // no restriction\n }\n\n /\n Execute a resolved NCR action.\n \n @param {number} action — NCR_LEVEL value\n * @param {string} token — raw token (e.g. '#38') for error messages\n * @param {number} cp — codepoint, used only for error messages\n * @returns {string\|undefined}\n * - decoded character string → 'allow'\n * - '' → 'remove'\n * - undefined → 'leave' (caller must skip past '&' only)\n * - throws Error → 'throw'\n /\n _applyNCRAction(action, token, cp) {\n switch (action) {\n case NCR_LEVEL.allow: return String.fromCodePoint(cp);\n case NCR_LEVEL.remove: return '';\n case NCR_LEVEL.leave: return undefined; // signal: keep literal\n case NCR_LEVEL.throw:\n throw new Error(\n `[EntityDecoder] Prohibited numeric character reference ` +\n `&${token}; (U+${cp.toString(16).toUpperCase().padStart(4, '0')})`\n );\n default: return String.fromCodePoint(cp);\n }\n }\n\n /\n Full NCR resolution pipeline for a numeric token.\n \n Steps:\n * 1. Parse the codepoint (decimal or hex).\n * 2. Validate the raw codepoint range (NaN, <0, >0x10FFFF).\n * 3. If numericAllowed is false and no minimum restriction applies → leave as-is.\n * 4. Classify the codepoint to find the minimum required action level.\n * 5. Resolve effective action = max(onNCR, minimum).\n * 6. Apply and return.\n \n @param {string} token — e.g. '#38', '#x26', '#X26'\n * @returns {string\|undefined}\n * - string (incl. '') — replacement ('' = remove)\n * - undefined — leave original &token; as-is\n /\n _resolveNCR(token) {\n // Step 1: parse codepoint\n const second = token.charCodeAt(1);\n let cp;\n if (second === 120 / x / \|\| second === 88 / X /) {\n cp = parseInt(token.slice(2), 16);\n } else {\n cp = parseInt(token.slice(1), 10);\n }\n\n // Step 2: out-of-range → leave as-is unconditionally\n if (Number.isNaN(cp) \|\| cp < 0 \|\| cp > 0x10FFFF) return undefined;\n\n // Step 3: classify to get minimum action level\n const minimum = this._classifyNCR(cp);\n\n // Step 4: if numericAllowed is false and no hard minimum → leave\n if (!this._numericAllowed && minimum < NCR_LEVEL.remove) return undefined;\n\n // Step 5: effective action = max(configured onNCR, range minimum)\n const effective = minimum === -1\n ? this._ncrOnLevel\n : Math.max(this._ncrOnLevel, minimum);\n\n // Step 6: apply\n return this._applyNCRAction(effective, token, cp);\n }\n}","'use strict';\n///@ts-check\n\nimport { getAllMatches, isExist, DANGEROUS_PROPERTY_NAMES, criticalProperties } from '../util.js';\nimport xmlNode from './xmlNode.js';\nimport DocTypeReader from './DocTypeReader.js';\nimport toNumber from \"strnum\";\nimport getIgnoreAttributesFn from \"../ignoreAttributes.js\";\nimport { Expression, Matcher } from 'path-expression-matcher';\nimport { ExpressionSet } from 'path-expression-matcher';\nimport { EntityDecoder, XML, CURRENCY, COMMON_HTML } from '@nodable/entities';\n\n// const regx =\n// '<((!\\\\[CDATA\\\\[([\\\\s\\\\S]?)(]]>))\|((NAME:)?(NAME))([^>])>\|((\\\\/)(NAME)\\\\s>))([^<])'\n// .replace(/NAME/g, util.nameRegexp);\n\n//const tagsRegx = new RegExp(\"<(\\\\/?[\\\\w:\\\\-\\._]+)([^>])>(\\\\s\"+cdataRegx+\")([^<]+)?\",\"g\");\n//const tagsRegx = new RegExp(\"<(\\\\/?)((\\\\w:)?([\\\\w:\\\\-\\._]+))([^>])>([^<])(\"+cdataRegx+\"([^<]))([^<]+)?\",\"g\");\n\n// Helper functions for attribute and namespace handling\n\n/\n Extract raw attributes (without prefix) from prefixed attribute map\n * @param {object} prefixedAttrs - Attributes with prefix from buildAttributesMap\n * @param {object} options - Parser options containing attributeNamePrefix\n * @returns {object} Raw attributes for matcher\n /\nfunction extractRawAttributes(prefixedAttrs, options) {\n if (!prefixedAttrs) return {};\n\n // Handle attributesGroupName option\n const attrs = options.attributesGroupName\n ? prefixedAttrs[options.attributesGroupName]\n : prefixedAttrs;\n\n if (!attrs) return {};\n\n const rawAttrs = {};\n for (const key in attrs) {\n // Remove the attribute prefix to get raw name\n if (key.startsWith(options.attributeNamePrefix)) {\n const rawName = key.substring(options.attributeNamePrefix.length);\n rawAttrs[rawName] = attrs[key];\n } else {\n // Attribute without prefix (shouldn't normally happen, but be safe)\n rawAttrs[key] = attrs[key];\n }\n }\n return rawAttrs;\n}\n\n/\n Extract namespace from raw tag name\n * @param {string} rawTagName - Tag name possibly with namespace (e.g., \"soap:Envelope\")\n * @returns {string\|undefined} Namespace or undefined\n /\nfunction extractNamespace(rawTagName) {\n if (!rawTagName \|\| typeof rawTagName !== 'string') return undefined;\n\n const colonIndex = rawTagName.indexOf(':');\n if (colonIndex !== -1 && colonIndex > 0) {\n const ns = rawTagName.substring(0, colonIndex);\n // Don't treat xmlns as a namespace\n if (ns !== 'xmlns') {\n return ns;\n }\n }\n return undefined;\n}\n\nexport default class OrderedObjParser {\n constructor(options) {\n this.options = options;\n this.currentNode = null;\n this.tagsNodeStack = [];\n this.parseXml = parseXml;\n this.parseTextData = parseTextData;\n this.resolveNameSpace = resolveNameSpace;\n this.buildAttributesMap = buildAttributesMap;\n this.isItStopNode = isItStopNode;\n this.replaceEntitiesValue = replaceEntitiesValue;\n this.readStopNodeData = readStopNodeData;\n this.saveTextToParentTag = saveTextToParentTag;\n this.addChild = addChild;\n this.ignoreAttributesFn = getIgnoreAttributesFn(this.options.ignoreAttributes)\n this.entityExpansionCount = 0;\n this.currentExpandedLength = 0;\n let namedEntities = { ...XML };\n if (this.options.entityDecoder) {\n this.entityDecoder = this.options.entityDecoder\n } else {\n if (typeof this.options.htmlEntities === \"object\") namedEntities = this.options.htmlEntities;\n else if (this.options.htmlEntities === true) namedEntities = { ...COMMON_HTML, ...CURRENCY };\n this.entityDecoder = new EntityDecoder({\n namedEntities: namedEntities,\n numericAllowed: this.options.htmlEntities,\n limit: {\n maxTotalExpansions: this.options.processEntities.maxTotalExpansions,\n maxExpandedLength: this.options.processEntities.maxExpandedLength,\n applyLimitsTo: this.options.processEntities.appliesTo,\n }\n //postCheck: resolved => resolved\n });\n }\n\n // Initialize path matcher for path-expression-matcher\n this.matcher = new Matcher();\n\n // Live read-only proxy of matcher — PEM creates and caches this internally.\n // All user callbacks receive this instead of the mutable matcher.\n this.readonlyMatcher = this.matcher.readOnly();\n\n // Flag to track if current node is a stop node (optimization)\n this.isCurrentNodeStopNode = false;\n\n // Pre-compile stopNodes expressions\n this.stopNodeExpressionsSet = new ExpressionSet();\n const stopNodesOpts = this.options.stopNodes;\n if (stopNodesOpts && stopNodesOpts.length > 0) {\n for (let i = 0; i < stopNodesOpts.length; i++) {\n const stopNodeExp = stopNodesOpts[i];\n if (typeof stopNodeExp === 'string') {\n // Convert string to Expression object\n this.stopNodeExpressionsSet.add(new Expression(stopNodeExp));\n } else if (stopNodeExp instanceof Expression) {\n // Already an Expression object\n this.stopNodeExpressionsSet.add(stopNodeExp);\n }\n }\n this.stopNodeExpressionsSet.seal();\n }\n }\n\n}\n\n\n/\n @param {string} val\n * @param {string} tagName\n * @param {string\|Matcher} jPath - jPath string or Matcher instance based on options.jPath\n * @param {boolean} dontTrim\n * @param {boolean} hasAttributes\n * @param {boolean} isLeafNode\n * @param {boolean} escapeEntities\n /\nfunction parseTextData(val, tagName, jPath, dontTrim, hasAttributes, isLeafNode, escapeEntities) {\n const options = this.options;\n if (val !== undefined) {\n if (options.trimValues && !dontTrim) {\n val = val.trim();\n }\n if (val.length > 0) {\n if (!escapeEntities) val = this.replaceEntitiesValue(val, tagName, jPath);\n\n // Pass jPath string or matcher based on options.jPath setting\n const jPathOrMatcher = options.jPath ? jPath.toString() : jPath;\n const newval = options.tagValueProcessor(tagName, val, jPathOrMatcher, hasAttributes, isLeafNode);\n if (newval === null \|\| newval === undefined) {\n //don't parse\n return val;\n } else if (typeof newval !== typeof val \|\| newval !== val) {\n //overwrite\n return newval;\n } else if (options.trimValues) {\n return parseValue(val, options.parseTagValue, options.numberParseOptions);\n } else {\n const trimmedVal = val.trim();\n if (trimmedVal === val) {\n return parseValue(val, options.parseTagValue, options.numberParseOptions);\n } else {\n return val;\n }\n }\n }\n }\n}\n\nfunction resolveNameSpace(tagname) {\n if (this.options.removeNSPrefix) {\n const tags = tagname.split(':');\n const prefix = tagname.charAt(0) === '/' ? '/' : '';\n if (tags[0] === 'xmlns') {\n return '';\n }\n if (tags.length === 2) {\n tagname = prefix + tags[1];\n }\n }\n return tagname;\n}\n\n//TODO: change regex to capture NS\n//const attrsRegx = new RegExp(\"([\\\\w\\\\-\\\\.\\\\:]+)\\\\s=\\\\s(['\\\"])((.\|\\n)?)\\\\2\",\"gm\");\nconst attrsRegx = new RegExp('([^\\\\s=]+)\\\\s(=\\\\s([\\'\"])([\\\\s\\\\S]?)\\\\3)?', 'gm');\n\nfunction buildAttributesMap(attrStr, jPath, tagName, force = false) {\n const options = this.options;\n if (force === true \|\| (options.ignoreAttributes !== true && typeof attrStr === 'string')) {\n // attrStr = attrStr.replace(/\\r?\\n/g, ' ');\n //attrStr = attrStr \|\| attrStr.trim();\n\n const matches = getAllMatches(attrStr, attrsRegx);\n const len = matches.length; //don't make it inline\n const attrs = {};\n\n // Pre-process values once: trim + entity replacement\n // Reused in both matcher update and second pass\n const processedVals = new Array(len);\n let hasRawAttrs = false;\n const rawAttrsForMatcher = {};\n\n for (let i = 0; i < len; i++) {\n const attrName = this.resolveNameSpace(matches[i][1]);\n const oldVal = matches[i][4];\n\n if (attrName.length && oldVal !== undefined) {\n let val = oldVal;\n if (options.trimValues) val = val.trim();\n val = this.replaceEntitiesValue(val, tagName, this.readonlyMatcher);\n processedVals[i] = val;\n\n rawAttrsForMatcher[attrName] = val;\n hasRawAttrs = true;\n }\n }\n\n // Update matcher ONCE before second pass, if applicable\n if (hasRawAttrs && typeof jPath === 'object' && jPath.updateCurrent) {\n jPath.updateCurrent(rawAttrsForMatcher);\n }\n\n // Hoist toString() once — path doesn't change during attribute processing\n const jPathStr = options.jPath ? jPath.toString() : this.readonlyMatcher;\n\n // Second pass: apply processors, build final attrs\n let hasAttrs = false;\n for (let i = 0; i < len; i++) {\n const attrName = this.resolveNameSpace(matches[i][1]);\n\n if (this.ignoreAttributesFn(attrName, jPathStr)) continue;\n\n let aName = options.attributeNamePrefix + attrName;\n\n if (attrName.length) {\n if (options.transformAttributeName) {\n aName = options.transformAttributeName(aName);\n }\n aName = sanitizeName(aName, options);\n\n if (matches[i][4] !== undefined) {\n // Reuse already-processed value — no double entity replacement\n const oldVal = processedVals[i];\n\n const newVal = options.attributeValueProcessor(attrName, oldVal, jPathStr);\n if (newVal === null \|\| newVal === undefined) {\n attrs[aName] = oldVal;\n } else if (typeof newVal !== typeof oldVal \|\| newVal !== oldVal) {\n attrs[aName] = newVal;\n } else {\n attrs[aName] = parseValue(oldVal, options.parseAttributeValue, options.numberParseOptions);\n }\n hasAttrs = true;\n } else if (options.allowBooleanAttributes) {\n attrs[aName] = true;\n hasAttrs = true;\n }\n }\n }\n\n if (!hasAttrs) return;\n\n if (options.attributesGroupName) {\n const attrCollection = {};\n attrCollection[options.attributesGroupName] = attrs;\n return attrCollection;\n }\n return attrs;\n }\n}\nconst parseXml = function (xmlData) {\n xmlData = xmlData.replace(/\\r\\n?/g, \"\\n\"); //TODO: remove this line\n const xmlObj = new xmlNode('!xml');\n let currentNode = xmlObj;\n let textData = \"\";\n\n // Reset matcher for new document\n this.matcher.reset();\n this.entityDecoder.reset();\n\n // Reset entity expansion counters for this document\n this.entityExpansionCount = 0;\n this.currentExpandedLength = 0;\n const options = this.options;\n const docTypeReader = new DocTypeReader(options.processEntities);\n const xmlLen = xmlData.length;\n for (let i = 0; i < xmlLen; i++) {//for each char in XML data\n const ch = xmlData[i];\n if (ch === '<') {\n // const nextIndex = i+1;\n // const _2ndChar = xmlData[nextIndex];\n const c1 = xmlData.charCodeAt(i + 1);\n if (c1 === 47) {//Closing Tag '/'\n const closeIndex = findClosingIndex(xmlData, \">\", i, \"Closing Tag is not closed.\")\n let tagName = xmlData.substring(i + 2, closeIndex).trim();\n\n if (options.removeNSPrefix) {\n const colonIndex = tagName.indexOf(\":\");\n if (colonIndex !== -1) {\n tagName = tagName.substr(colonIndex + 1);\n }\n }\n\n tagName = transformTagName(options.transformTagName, tagName, \"\", options).tagName;\n\n if (currentNode) {\n textData = this.saveTextToParentTag(textData, currentNode, this.readonlyMatcher);\n }\n\n //check if last tag of nested tag was unpaired tag\n const lastTagName = this.matcher.getCurrentTag();\n if (tagName && options.unpairedTagsSet.has(tagName)) {\n throw new Error(`Unpaired tag can not be used as closing tag: </${tagName}>`);\n }\n if (lastTagName && options.unpairedTagsSet.has(lastTagName)) {\n // Pop the unpaired tag\n this.matcher.pop();\n this.tagsNodeStack.pop();\n }\n // Pop the closing tag\n this.matcher.pop();\n this.isCurrentNodeStopNode = false; // Reset flag when closing tag\n\n currentNode = this.tagsNodeStack.pop();//avoid recursion, set the parent tag scope\n textData = \"\";\n i = closeIndex;\n } else if (c1 === 63) { //'?'\n\n let tagData = readTagExp(xmlData, i, false, \"?>\");\n if (!tagData) throw new Error(\"Pi Tag is not closed.\");\n\n textData = this.saveTextToParentTag(textData, currentNode, this.readonlyMatcher);\n const attsMap = this.buildAttributesMap(tagData.tagExp, this.matcher, tagData.tagName, true);\n if (attsMap) {\n const ver = attsMap[this.options.attributeNamePrefix + \"version\"];\n this.entityDecoder.setXmlVersion(Number(ver) \|\| 1.0);\n }\n if ((options.ignoreDeclaration && tagData.tagName === \"?xml\") \|\| options.ignorePiTags) {\n //do nothing\n } else {\n\n const childNode = new xmlNode(tagData.tagName);\n childNode.add(options.textNodeName, \"\");\n\n if (tagData.tagName !== tagData.tagExp && tagData.attrExpPresent && options.ignoreAttributes !== true) {\n childNode[\":@\"] = attsMap\n }\n this.addChild(currentNode, childNode, this.readonlyMatcher, i);\n }\n\n\n i = tagData.closeIndex + 1;\n } else if (c1 === 33\n && xmlData.charCodeAt(i + 2) === 45\n && xmlData.charCodeAt(i + 3) === 45) { //'!--'\n const endIndex = findClosingIndex(xmlData, \"-->\", i + 4, \"Comment is not closed.\")\n if (options.commentPropName) {\n const comment = xmlData.substring(i + 4, endIndex - 2);\n\n textData = this.saveTextToParentTag(textData, currentNode, this.readonlyMatcher);\n\n currentNode.add(options.commentPropName, [{ [options.textNodeName]: comment }]);\n }\n i = endIndex;\n } else if (c1 === 33\n && xmlData.charCodeAt(i + 2) === 68) { //'!D'\n const result = docTypeReader.readDocType(xmlData, i);\n this.entityDecoder.addInputEntities(result.entities);\n i = result.i;\n } else if (c1 === 33\n && xmlData.charCodeAt(i + 2) === 91) { // '!['\n const closeIndex = findClosingIndex(xmlData, \"]]>\", i, \"CDATA is not closed.\") - 2;\n const tagExp = xmlData.substring(i + 9, closeIndex);\n\n textData = this.saveTextToParentTag(textData, currentNode, this.readonlyMatcher);\n\n let val = this.parseTextData(tagExp, currentNode.tagname, this.readonlyMatcher, true, false, true, true);\n if (val == undefined) val = \"\";\n\n //cdata should be set even if it is 0 length string\n if (options.cdataPropName) {\n currentNode.add(options.cdataPropName, [{ [options.textNodeName]: tagExp }]);\n } else {\n currentNode.add(options.textNodeName, val);\n }\n\n i = closeIndex + 2;\n } else {//Opening tag\n let result = readTagExp(xmlData, i, options.removeNSPrefix);\n\n // Safety check: readTagExp can return undefined\n if (!result) {\n // Log context for debugging\n const context = xmlData.substring(Math.max(0, i - 50), Math.min(xmlLen, i + 50));\n throw new Error(`readTagExp returned undefined at position ${i}. Context: \"${context}\"`);\n }\n\n let tagName = result.tagName;\n const rawTagName = result.rawTagName;\n let tagExp = result.tagExp;\n let attrExpPresent = result.attrExpPresent;\n let closeIndex = result.closeIndex;\n\n ({ tagName, tagExp } = transformTagName(options.transformTagName, tagName, tagExp, options));\n\n if (options.strictReservedNames &&\n (tagName === options.commentPropName\n \|\| tagName === options.cdataPropName\n \|\| tagName === options.textNodeName\n \|\| tagName === options.attributesGroupName\n )) {\n throw new Error(`Invalid tag name: ${tagName}`);\n }\n\n //save text as child node\n if (currentNode && textData) {\n if (currentNode.tagname !== '!xml') {\n //when nested tag is found\n textData = this.saveTextToParentTag(textData, currentNode, this.readonlyMatcher, false);\n }\n }\n\n //check if last tag was unpaired tag\n const lastTag = currentNode;\n if (lastTag && options.unpairedTagsSet.has(lastTag.tagname)) {\n currentNode = this.tagsNodeStack.pop();\n this.matcher.pop();\n }\n\n // Clean up self-closing syntax BEFORE processing attributes\n // This is where tagExp gets the trailing / removed\n let isSelfClosing = false;\n if (tagExp.length > 0 && tagExp.lastIndexOf(\"/\") === tagExp.length - 1) {\n isSelfClosing = true;\n if (tagName[tagName.length - 1] === \"/\") {\n tagName = tagName.substr(0, tagName.length - 1);\n tagExp = tagName;\n } else {\n tagExp = tagExp.substr(0, tagExp.length - 1);\n }\n\n // Re-check attrExpPresent after cleaning\n attrExpPresent = (tagName !== tagExp);\n }\n\n // Now process attributes with CLEAN tagExp (no trailing /)\n let prefixedAttrs = null;\n let rawAttrs = {};\n let namespace = undefined;\n\n // Extract namespace from rawTagName\n namespace = extractNamespace(rawTagName);\n\n // Push tag to matcher FIRST (with empty attrs for now) so callbacks see correct path\n if (tagName !== xmlObj.tagname) {\n this.matcher.push(tagName, {}, namespace);\n }\n\n // Now build attributes - callbacks will see correct matcher state\n if (tagName !== tagExp && attrExpPresent) {\n // Build attributes (returns prefixed attributes for the tree)\n // Note: buildAttributesMap now internally updates the matcher with raw attributes\n prefixedAttrs = this.buildAttributesMap(tagExp, this.matcher, tagName);\n\n if (prefixedAttrs) {\n // Extract raw attributes (without prefix) for our use\n //TODO: seems a performance overhead\n rawAttrs = extractRawAttributes(prefixedAttrs, options);\n }\n }\n\n // Now check if this is a stop node (after attributes are set)\n if (tagName !== xmlObj.tagname) {\n this.isCurrentNodeStopNode = this.isItStopNode();\n }\n\n const startIndex = i;\n if (this.isCurrentNodeStopNode) {\n let tagContent = \"\";\n\n // For self-closing tags, content is empty\n if (isSelfClosing) {\n i = result.closeIndex;\n }\n //unpaired tag\n else if (options.unpairedTagsSet.has(tagName)) {\n i = result.closeIndex;\n }\n //normal tag\n else {\n //read until closing tag is found\n const result = this.readStopNodeData(xmlData, rawTagName, closeIndex + 1);\n if (!result) throw new Error(`Unexpected end of ${rawTagName}`);\n i = result.i;\n tagContent = result.tagContent;\n }\n\n const childNode = new xmlNode(tagName);\n\n if (prefixedAttrs) {\n childNode[\":@\"] = prefixedAttrs;\n }\n\n // For stop nodes, store raw content as-is without any processing\n childNode.add(options.textNodeName, tagContent);\n\n this.matcher.pop(); // Pop the stop node tag\n this.isCurrentNodeStopNode = false; // Reset flag\n\n this.addChild(currentNode, childNode, this.readonlyMatcher, startIndex);\n } else {\n //selfClosing tag\n if (isSelfClosing) {\n ({ tagName, tagExp } = transformTagName(options.transformTagName, tagName, tagExp, options));\n\n const childNode = new xmlNode(tagName);\n if (prefixedAttrs) {\n childNode[\":@\"] = prefixedAttrs;\n }\n this.addChild(currentNode, childNode, this.readonlyMatcher, startIndex);\n this.matcher.pop(); // Pop self-closing tag\n this.isCurrentNodeStopNode = false; // Reset flag\n }\n else if (options.unpairedTagsSet.has(tagName)) {//unpaired tag\n const childNode = new xmlNode(tagName);\n if (prefixedAttrs) {\n childNode[\":@\"] = prefixedAttrs;\n }\n this.addChild(currentNode, childNode, this.readonlyMatcher, startIndex);\n this.matcher.pop(); // Pop unpaired tag\n this.isCurrentNodeStopNode = false; // Reset flag\n i = result.closeIndex;\n // Continue to next iteration without changing currentNode\n continue;\n }\n //opening tag\n else {\n const childNode = new xmlNode(tagName);\n if (this.tagsNodeStack.length > options.maxNestedTags) {\n throw new Error(\"Maximum nested tags exceeded\");\n }\n this.tagsNodeStack.push(currentNode);\n\n if (prefixedAttrs) {\n childNode[\":@\"] = prefixedAttrs;\n }\n this.addChild(currentNode, childNode, this.readonlyMatcher, startIndex);\n currentNode = childNode;\n }\n textData = \"\";\n i = closeIndex;\n }\n }\n } else {\n textData += xmlData[i];\n }\n }\n return xmlObj.child;\n}\n\nfunction addChild(currentNode, childNode, matcher, startIndex) {\n // unset startIndex if not requested\n if (!this.options.captureMetaData) startIndex = undefined;\n\n // Pass jPath string or matcher based on options.jPath setting\n const jPathOrMatcher = this.options.jPath ? matcher.toString() : matcher;\n const result = this.options.updateTag(childNode.tagname, jPathOrMatcher, childNode[\":@\"])\n if (result === false) {\n //do nothing\n } else if (typeof result === \"string\") {\n childNode.tagname = result\n currentNode.addChild(childNode, startIndex);\n } else {\n currentNode.addChild(childNode, startIndex);\n }\n}\n\n/\n @param {object} val - Entity object with regex and val properties\n * @param {string} tagName - Tag name\n * @param {string\|Matcher} jPath - jPath string or Matcher instance based on options.jPath\n /\nfunction replaceEntitiesValue(val, tagName, jPath) {\n const entityConfig = this.options.processEntities;\n\n if (!entityConfig \|\| !entityConfig.enabled) {\n return val;\n }\n\n // Check if tag is allowed to contain entities\n if (entityConfig.allowedTags) {\n const jPathOrMatcher = this.options.jPath ? jPath.toString() : jPath;\n const allowed = Array.isArray(entityConfig.allowedTags)\n ? entityConfig.allowedTags.includes(tagName)\n : entityConfig.allowedTags(tagName, jPathOrMatcher);\n\n if (!allowed) {\n return val;\n }\n }\n\n // Apply custom tag filter if provided\n if (entityConfig.tagFilter) {\n const jPathOrMatcher = this.options.jPath ? jPath.toString() : jPath;\n if (!entityConfig.tagFilter(tagName, jPathOrMatcher)) {\n return val; // Skip based on custom filter\n }\n }\n\n return this.entityDecoder.decode(val);\n}\n\n\nfunction saveTextToParentTag(textData, parentNode, matcher, isLeafNode) {\n if (textData) { //store previously collected data as textNode\n if (isLeafNode === undefined) isLeafNode = parentNode.child.length === 0\n\n textData = this.parseTextData(textData,\n parentNode.tagname,\n matcher,\n false,\n parentNode[\":@\"] ? Object.keys(parentNode[\":@\"]).length !== 0 : false,\n isLeafNode);\n\n if (textData !== undefined && textData !== \"\")\n parentNode.add(this.options.textNodeName, textData);\n textData = \"\";\n }\n return textData;\n}\n\n/\n @param {Array<Expression>} stopNodeExpressions - Array of compiled Expression objects\n * @param {Matcher} matcher - Current path matcher\n /\nfunction isItStopNode() {\n if (this.stopNodeExpressionsSet.size === 0) return false;\n\n return this.matcher.matchesAny(this.stopNodeExpressionsSet);\n}\n\n/\n Returns the tag Expression and where it is ending handling single-double quotes situation\n * @param {string} xmlData \n * @param {number} i starting index\n * @returns \n /\nfunction tagExpWithClosingIndex(xmlData, i, closingChar = \">\") {\n let attrBoundary = 0;\n const chars = [];\n const len = xmlData.length;\n const closeCode0 = closingChar.charCodeAt(0);\n const closeCode1 = closingChar.length > 1 ? closingChar.charCodeAt(1) : -1;\n\n for (let index = i; index < len; index++) {\n const code = xmlData.charCodeAt(index);\n\n if (attrBoundary) {\n if (code === attrBoundary) attrBoundary = 0;\n } else if (code === 34 \|\| code === 39) { // \" or '\n attrBoundary = code;\n } else if (code === closeCode0) {\n if (closeCode1 !== -1) {\n if (xmlData.charCodeAt(index + 1) === closeCode1) {\n return { data: String.fromCharCode(...chars), index };\n }\n } else {\n return { data: String.fromCharCode(...chars), index };\n }\n } else if (code === 9) { // \\t\n chars.push(32); // space\n continue;\n }\n\n chars.push(code);\n }\n}\n\nfunction findClosingIndex(xmlData, str, i, errMsg) {\n const closingIndex = xmlData.indexOf(str, i);\n if (closingIndex === -1) {\n throw new Error(errMsg)\n } else {\n return closingIndex + str.length - 1;\n }\n}\n\nfunction findClosingChar(xmlData, char, i, errMsg) {\n const closingIndex = xmlData.indexOf(char, i);\n if (closingIndex === -1) throw new Error(errMsg);\n return closingIndex; // no offset needed\n}\n\nfunction readTagExp(xmlData, i, removeNSPrefix, closingChar = \">\") {\n const result = tagExpWithClosingIndex(xmlData, i + 1, closingChar);\n if (!result) return;\n let tagExp = result.data;\n const closeIndex = result.index;\n const separatorIndex = tagExp.search(/\\s/);\n let tagName = tagExp;\n let attrExpPresent = true;\n if (separatorIndex !== -1) {//separate tag name and attributes expression\n tagName = tagExp.substring(0, separatorIndex);\n tagExp = tagExp.substring(separatorIndex + 1).trimStart();\n }\n\n const rawTagName = tagName;\n if (removeNSPrefix) {\n const colonIndex = tagName.indexOf(\":\");\n if (colonIndex !== -1) {\n tagName = tagName.substr(colonIndex + 1);\n attrExpPresent = tagName !== result.data.substr(colonIndex + 1);\n }\n }\n\n return {\n tagName: tagName,\n tagExp: tagExp,\n closeIndex: closeIndex,\n attrExpPresent: attrExpPresent,\n rawTagName: rawTagName,\n }\n}\n/\n find paired tag for a stop node\n * @param {string} xmlData \n * @param {string} tagName \n * @param {number} i \n /\nfunction readStopNodeData(xmlData, tagName, i) {\n const startIndex = i;\n // Starting at 1 since we already have an open tag\n let openTagCount = 1;\n\n const xmllen = xmlData.length;\n for (; i < xmllen; i++) {\n if (xmlData[i] === \"<\") {\n const c1 = xmlData.charCodeAt(i + 1);\n if (c1 === 47) {//close tag '/'\n const closeIndex = findClosingChar(xmlData, \">\", i, `${tagName} is not closed`);\n let closeTagName = xmlData.substring(i + 2, closeIndex).trim();\n if (closeTagName === tagName) {\n openTagCount--;\n if (openTagCount === 0) {\n return {\n tagContent: xmlData.substring(startIndex, i),\n i: closeIndex\n }\n }\n }\n i = closeIndex;\n } else if (c1 === 63) { //?\n const closeIndex = findClosingIndex(xmlData, \"?>\", i + 1, \"StopNode is not closed.\")\n i = closeIndex;\n } else if (c1 === 33\n && xmlData.charCodeAt(i + 2) === 45\n && xmlData.charCodeAt(i + 3) === 45) { // '!--'\n const closeIndex = findClosingIndex(xmlData, \"-->\", i + 3, \"StopNode is not closed.\")\n i = closeIndex;\n } else if (c1 === 33\n && xmlData.charCodeAt(i + 2) === 91) { // '!['\n const closeIndex = findClosingIndex(xmlData, \"]]>\", i, \"StopNode is not closed.\") - 2;\n i = closeIndex;\n } else {\n const tagData = readTagExp(xmlData, i, '>')\n\n if (tagData) {\n const openTagName = tagData && tagData.tagName;\n if (openTagName === tagName && tagData.tagExp[tagData.tagExp.length - 1] !== \"/\") {\n openTagCount++;\n }\n i = tagData.closeIndex;\n }\n }\n }\n }//end for loop\n}\n\nfunction parseValue(val, shouldParse, options) {\n if (shouldParse && typeof val === 'string') {\n //console.log(options)\n const newval = val.trim();\n if (newval === 'true') return true;\n else if (newval === 'false') return false;\n else return toNumber(val, options);\n } else {\n if (isExist(val)) {\n return val;\n } else {\n return '';\n }\n }\n}\n\nfunction fromCodePoint(str, base, prefix) {\n const codePoint = Number.parseInt(str, base);\n\n if (codePoint >= 0 && codePoint <= 0x10FFFF) {\n return String.fromCodePoint(codePoint);\n } else {\n return prefix + str + \";\";\n }\n}\n\nfunction transformTagName(fn, tagName, tagExp, options) {\n if (fn) {\n const newTagName = fn(tagName);\n if (tagExp === tagName) {\n tagExp = newTagName\n }\n tagName = newTagName;\n }\n tagName = sanitizeName(tagName, options);\n return { tagName, tagExp };\n}\n\n\n\nfunction sanitizeName(name, options) {\n if (criticalProperties.includes(name)) {\n throw new Error(`[SECURITY] Invalid name: \"${name}\" is a reserved JavaScript keyword that could cause prototype pollution`);\n } else if (DANGEROUS_PROPERTY_NAMES.includes(name)) {\n return options.onDangerousProperty(name);\n }\n return name;\n}","export default function getIgnoreAttributesFn(ignoreAttributes) {\n if (typeof ignoreAttributes === 'function') {\n return ignoreAttributes\n }\n if (Array.isArray(ignoreAttributes)) {\n return (attrName) => {\n for (const pattern of ignoreAttributes) {\n if (typeof pattern === 'string' && attrName === pattern) {\n return true\n }\n if (pattern instanceof RegExp && pattern.test(attrName)) {\n return true\n }\n }\n }\n }\n return () => false\n}","'use strict';\n\nimport XmlNode from './xmlNode.js';\nimport { Matcher } from 'path-expression-matcher';\n\nconst METADATA_SYMBOL = XmlNode.getMetaDataSymbol();\n\n/\n Helper function to strip attribute prefix from attribute map\n * @param {object} attrs - Attributes with prefix (e.g., {\"@_class\": \"code\"})\n * @param {string} prefix - Attribute prefix to remove (e.g., \"@_\")\n * @returns {object} Attributes without prefix (e.g., {\"class\": \"code\"})\n /\nfunction stripAttributePrefix(attrs, prefix) {\n if (!attrs \|\| typeof attrs !== 'object') return {};\n if (!prefix) return attrs;\n\n const rawAttrs = {};\n for (const key in attrs) {\n if (key.startsWith(prefix)) {\n const rawName = key.substring(prefix.length);\n rawAttrs[rawName] = attrs[key];\n } else {\n // Attribute without prefix (shouldn't normally happen, but be safe)\n rawAttrs[key] = attrs[key];\n }\n }\n return rawAttrs;\n}\n\n/\n \n * @param {array} node \n * @param {any} options \n * @param {Matcher} matcher - Path matcher instance\n * @returns \n /\nexport default function prettify(node, options, matcher, readonlyMatcher) {\n return compress(node, options, matcher, readonlyMatcher);\n}\n\n/\n @param {array} arr \n * @param {object} options \n * @param {Matcher} matcher - Path matcher instance\n * @returns object\n /\nfunction compress(arr, options, matcher, readonlyMatcher) {\n let text;\n const compressedObj = {}; //This is intended to be a plain object\n for (let i = 0; i < arr.length; i++) {\n const tagObj = arr[i];\n const property = propName(tagObj);\n\n // Push current property to matcher WITH RAW ATTRIBUTES (no prefix)\n if (property !== undefined && property !== options.textNodeName) {\n const rawAttrs = stripAttributePrefix(\n tagObj[\":@\"] \|\| {},\n options.attributeNamePrefix\n );\n matcher.push(property, rawAttrs);\n }\n\n if (property === options.textNodeName) {\n if (text === undefined) text = tagObj[property];\n else text += \"\" + tagObj[property];\n } else if (property === undefined) {\n continue;\n } else if (tagObj[property]) {\n\n let val = compress(tagObj[property], options, matcher, readonlyMatcher);\n const isLeaf = isLeafTag(val, options);\n\n if (tagObj[\":@\"]) {\n assignAttributes(val, tagObj[\":@\"], readonlyMatcher, options);\n } else if (Object.keys(val).length === 1 && val[options.textNodeName] !== undefined && !options.alwaysCreateTextNode) {\n val = val[options.textNodeName];\n } else if (Object.keys(val).length === 0) {\n if (options.alwaysCreateTextNode) val[options.textNodeName] = \"\";\n else val = \"\";\n }\n\n if (tagObj[METADATA_SYMBOL] !== undefined && typeof val === \"object\" && val !== null) {\n val[METADATA_SYMBOL] = tagObj[METADATA_SYMBOL]; // copy over metadata\n }\n\n\n if (compressedObj[property] !== undefined && Object.prototype.hasOwnProperty.call(compressedObj, property)) {\n if (!Array.isArray(compressedObj[property])) {\n compressedObj[property] = [compressedObj[property]];\n }\n compressedObj[property].push(val);\n } else {\n //TODO: if a node is not an array, then check if it should be an array\n //also determine if it is a leaf node\n\n // Pass jPath string or readonlyMatcher based on options.jPath setting\n const jPathOrMatcher = options.jPath ? readonlyMatcher.toString() : readonlyMatcher;\n if (options.isArray(property, jPathOrMatcher, isLeaf)) {\n compressedObj[property] = [val];\n } else {\n compressedObj[property] = val;\n }\n }\n\n // Pop property from matcher after processing\n if (property !== undefined && property !== options.textNodeName) {\n matcher.pop();\n }\n }\n\n }\n // if(text && text.length > 0) compressedObj[options.textNodeName] = text;\n if (typeof text === \"string\") {\n if (text.length > 0) compressedObj[options.textNodeName] = text;\n } else if (text !== undefined) compressedObj[options.textNodeName] = text;\n\n\n return compressedObj;\n}\n\nfunction propName(obj) {\n const keys = Object.keys(obj);\n for (let i = 0; i < keys.length; i++) {\n const key = keys[i];\n if (key !== \":@\") return key;\n }\n}\n\nfunction assignAttributes(obj, attrMap, readonlyMatcher, options) {\n if (attrMap) {\n const keys = Object.keys(attrMap);\n const len = keys.length; //don't make it inline\n for (let i = 0; i < len; i++) {\n const atrrName = keys[i]; // This is the PREFIXED name (e.g., \"@_class\")\n\n // Strip prefix for matcher path (for isArray callback)\n const rawAttrName = atrrName.startsWith(options.attributeNamePrefix)\n ? atrrName.substring(options.attributeNamePrefix.length)\n : atrrName;\n\n // For attributes, we need to create a temporary path\n // Pass jPath string or matcher based on options.jPath setting\n const jPathOrMatcher = options.jPath\n ? readonlyMatcher.toString() + \".\" + rawAttrName\n : readonlyMatcher;\n\n if (options.isArray(atrrName, jPathOrMatcher, true, true)) {\n obj[atrrName] = [attrMap[atrrName]];\n } else {\n obj[atrrName] = attrMap[atrrName];\n }\n }\n }\n}\n\nfunction isLeafTag(obj, options) {\n const { textNodeName } = options;\n const propCount = Object.keys(obj).length;\n\n if (propCount === 0) {\n return true;\n }\n\n if (\n propCount === 1 &&\n (obj[textNodeName] \|\| typeof obj[textNodeName] === \"boolean\" \|\| obj[textNodeName] === 0)\n ) {\n return true;\n }\n\n return false;\n}","'use strict';\n\nimport { getAllMatches, isName } from './util.js';\n\nconst defaultOptions = {\n allowBooleanAttributes: false, //A tag can have attributes without any value\n unpairedTags: []\n};\n\n//const tagsPattern = new RegExp(\"<\\\\/?([\\\\w:\\\\-_\\.]+)\\\\s\\/?>\",\"g\");\nexport function validate(xmlData, options) {\n options = Object.assign({}, defaultOptions, options);\n\n //xmlData = xmlData.replace(/(\\r\\n\|\\n\|\\r)/gm,\"\");//make it single line\n //xmlData = xmlData.replace(/(^\\s<\\?xml.?\\?>)/g,\"\");//Remove XML starting tag\n //xmlData = xmlData.replace(/(<!DOCTYPE[\\s\\w\\\"\\.\\/\\-\\:]+(\\[.\\])\\s>)/g,\"\");//Remove DOCTYPE\n const tags = [];\n let tagFound = false;\n\n //indicates that the root tag has been closed (aka. depth 0 has been reached)\n let reachedRoot = false;\n\n if (xmlData[0] === '\\ufeff') {\n // check for byte order mark (BOM)\n xmlData = xmlData.substr(1);\n }\n\n for (let i = 0; i < xmlData.length; i++) {\n\n if (xmlData[i] === '<' && xmlData[i + 1] === '?') {\n i += 2;\n i = readPI(xmlData, i);\n if (i.err) return i;\n } else if (xmlData[i] === '<') {\n //starting of tag\n //read until you reach to '>' avoiding any '>' in attribute value\n let tagStartPos = i;\n i++;\n\n if (xmlData[i] === '!') {\n i = readCommentAndCDATA(xmlData, i);\n continue;\n } else {\n let closingTag = false;\n if (xmlData[i] === '/') {\n //closing tag\n closingTag = true;\n i++;\n }\n //read tagname\n let tagName = '';\n for (; i < xmlData.length &&\n xmlData[i] !== '>' &&\n xmlData[i] !== ' ' &&\n xmlData[i] !== '\\t' &&\n xmlData[i] !== '\\n' &&\n xmlData[i] !== '\\r'; i++\n ) {\n tagName += xmlData[i];\n }\n tagName = tagName.trim();\n //console.log(tagName);\n\n if (tagName[tagName.length - 1] === '/') {\n //self closing tag without attributes\n tagName = tagName.substring(0, tagName.length - 1);\n //continue;\n i--;\n }\n if (!validateTagName(tagName)) {\n let msg;\n if (tagName.trim().length === 0) {\n msg = \"Invalid space after '<'.\";\n } else {\n msg = \"Tag '\" + tagName + \"' is an invalid name.\";\n }\n return getErrorObject('InvalidTag', msg, getLineNumberForPosition(xmlData, i));\n }\n\n const result = readAttributeStr(xmlData, i);\n if (result === false) {\n return getErrorObject('InvalidAttr', \"Attributes for '\" + tagName + \"' have open quote.\", getLineNumberForPosition(xmlData, i));\n }\n let attrStr = result.value;\n i = result.index;\n\n if (attrStr[attrStr.length - 1] === '/') {\n //self closing tag\n const attrStrStart = i - attrStr.length;\n attrStr = attrStr.substring(0, attrStr.length - 1);\n const isValid = validateAttributeString(attrStr, options);\n if (isValid === true) {\n tagFound = true;\n //continue; //text may presents after self closing tag\n } else {\n //the result from the nested function returns the position of the error within the attribute\n //in order to get the 'true' error line, we need to calculate the position where the attribute begins (i - attrStr.length) and then add the position within the attribute\n //this gives us the absolute index in the entire xml, which we can use to find the line at last\n return getErrorObject(isValid.err.code, isValid.err.msg, getLineNumberForPosition(xmlData, attrStrStart + isValid.err.line));\n }\n } else if (closingTag) {\n if (!result.tagClosed) {\n return getErrorObject('InvalidTag', \"Closing tag '\" + tagName + \"' doesn't have proper closing.\", getLineNumberForPosition(xmlData, i));\n } else if (attrStr.trim().length > 0) {\n return getErrorObject('InvalidTag', \"Closing tag '\" + tagName + \"' can't have attributes or invalid starting.\", getLineNumberForPosition(xmlData, tagStartPos));\n } else if (tags.length === 0) {\n return getErrorObject('InvalidTag', \"Closing tag '\" + tagName + \"' has not been opened.\", getLineNumberForPosition(xmlData, tagStartPos));\n } else {\n const otg = tags.pop();\n if (tagName !== otg.tagName) {\n let openPos = getLineNumberForPosition(xmlData, otg.tagStartPos);\n return getErrorObject('InvalidTag',\n \"Expected closing tag '\" + otg.tagName + \"' (opened in line \" + openPos.line + \", col \" + openPos.col + \") instead of closing tag '\" + tagName + \"'.\",\n getLineNumberForPosition(xmlData, tagStartPos));\n }\n\n //when there are no more tags, we reached the root level.\n if (tags.length == 0) {\n reachedRoot = true;\n }\n }\n } else {\n const isValid = validateAttributeString(attrStr, options);\n if (isValid !== true) {\n //the result from the nested function returns the position of the error within the attribute\n //in order to get the 'true' error line, we need to calculate the position where the attribute begins (i - attrStr.length) and then add the position within the attribute\n //this gives us the absolute index in the entire xml, which we can use to find the line at last\n return getErrorObject(isValid.err.code, isValid.err.msg, getLineNumberForPosition(xmlData, i - attrStr.length + isValid.err.line));\n }\n\n //if the root level has been reached before ...\n if (reachedRoot === true) {\n return getErrorObject('InvalidXml', 'Multiple possible root nodes found.', getLineNumberForPosition(xmlData, i));\n } else if (options.unpairedTags.indexOf(tagName) !== -1) {\n //don't push into stack\n } else {\n tags.push({ tagName, tagStartPos });\n }\n tagFound = true;\n }\n\n //skip tag text value\n //It may include comments and CDATA value\n for (i++; i < xmlData.length; i++) {\n if (xmlData[i] === '<') {\n if (xmlData[i + 1] === '!') {\n //comment or CADATA\n i++;\n i = readCommentAndCDATA(xmlData, i);\n continue;\n } else if (xmlData[i + 1] === '?') {\n i = readPI(xmlData, ++i);\n if (i.err) return i;\n } else {\n break;\n }\n } else if (xmlData[i] === '&') {\n const afterAmp = validateAmpersand(xmlData, i);\n if (afterAmp == -1)\n return getErrorObject('InvalidChar', \"char '&' is not expected.\", getLineNumberForPosition(xmlData, i));\n i = afterAmp;\n } else {\n if (reachedRoot === true && !isWhiteSpace(xmlData[i])) {\n return getErrorObject('InvalidXml', \"Extra text at the end\", getLineNumberForPosition(xmlData, i));\n }\n }\n } //end of reading tag text value\n if (xmlData[i] === '<') {\n i--;\n }\n }\n } else {\n if (isWhiteSpace(xmlData[i])) {\n continue;\n }\n return getErrorObject('InvalidChar', \"char '\" + xmlData[i] + \"' is not expected.\", getLineNumberForPosition(xmlData, i));\n }\n }\n\n if (!tagFound) {\n return getErrorObject('InvalidXml', 'Start tag expected.', 1);\n } else if (tags.length == 1) {\n return getErrorObject('InvalidTag', \"Unclosed tag '\" + tags[0].tagName + \"'.\", getLineNumberForPosition(xmlData, tags[0].tagStartPos));\n } else if (tags.length > 0) {\n return getErrorObject('InvalidXml', \"Invalid '\" +\n JSON.stringify(tags.map(t => t.tagName), null, 4).replace(/\\r?\\n/g, '') +\n \"' found.\", { line: 1, col: 1 });\n }\n\n return true;\n};\n\nfunction isWhiteSpace(char) {\n return char === ' ' \|\| char === '\\t' \|\| char === '\\n' \|\| char === '\\r';\n}\n/\n Read Processing insstructions and skip\n * @param {} xmlData\n @param {} i\n /\nfunction readPI(xmlData, i) {\n const start = i;\n for (; i < xmlData.length; i++) {\n if (xmlData[i] == '?' \|\| xmlData[i] == ' ') {\n //tagname\n const tagname = xmlData.substr(start, i - start);\n if (i > 5 && tagname === 'xml') {\n return getErrorObject('InvalidXml', 'XML declaration allowed only at the start of the document.', getLineNumberForPosition(xmlData, i));\n } else if (xmlData[i] == '?' && xmlData[i + 1] == '>') {\n //check if valid attribut string\n i++;\n break;\n } else {\n continue;\n }\n }\n }\n return i;\n}\n\nfunction readCommentAndCDATA(xmlData, i) {\n if (xmlData.length > i + 5 && xmlData[i + 1] === '-' && xmlData[i + 2] === '-') {\n //comment\n for (i += 3; i < xmlData.length; i++) {\n if (xmlData[i] === '-' && xmlData[i + 1] === '-' && xmlData[i + 2] === '>') {\n i += 2;\n break;\n }\n }\n } else if (\n xmlData.length > i + 8 &&\n xmlData[i + 1] === 'D' &&\n xmlData[i + 2] === 'O' &&\n xmlData[i + 3] === 'C' &&\n xmlData[i + 4] === 'T' &&\n xmlData[i + 5] === 'Y' &&\n xmlData[i + 6] === 'P' &&\n xmlData[i + 7] === 'E'\n ) {\n let angleBracketsCount = 1;\n for (i += 8; i < xmlData.length; i++) {\n if (xmlData[i] === '<') {\n angleBracketsCount++;\n } else if (xmlData[i] === '>') {\n angleBracketsCount--;\n if (angleBracketsCount === 0) {\n break;\n }\n }\n }\n } else if (\n xmlData.length > i + 9 &&\n xmlData[i + 1] === '[' &&\n xmlData[i + 2] === 'C' &&\n xmlData[i + 3] === 'D' &&\n xmlData[i + 4] === 'A' &&\n xmlData[i + 5] === 'T' &&\n xmlData[i + 6] === 'A' &&\n xmlData[i + 7] === '['\n ) {\n for (i += 8; i < xmlData.length; i++) {\n if (xmlData[i] === ']' && xmlData[i + 1] === ']' && xmlData[i + 2] === '>') {\n i += 2;\n break;\n }\n }\n }\n\n return i;\n}\n\nconst doubleQuote = '\"';\nconst singleQuote = \"'\";\n\n/*\n Keep reading xmlData until '<' is found outside the attribute value.\n * @param {string} xmlData\n * @param {number} i\n /\nfunction readAttributeStr(xmlData, i) {\n let attrStr = '';\n let startChar = '';\n let tagClosed = false;\n for (; i < xmlData.length; i++) {\n if (xmlData[i] === doubleQuote \|\| xmlData[i] === singleQuote) {\n if (startChar === '') {\n startChar = xmlData[i];\n } else if (startChar !== xmlData[i]) {\n //if vaue is enclosed with double quote then single quotes are allowed inside the value and vice versa\n } else {\n startChar = '';\n }\n } else if (xmlData[i] === '>') {\n if (startChar === '') {\n tagClosed = true;\n break;\n }\n }\n attrStr += xmlData[i];\n }\n if (startChar !== '') {\n return false;\n }\n\n return {\n value: attrStr,\n index: i,\n tagClosed: tagClosed\n };\n}\n\n/\n Select all the attributes whether valid or invalid.\n /\nconst validAttrStrRegxp = new RegExp('(\\\\s)([^\\\\s=]+)(\\\\s=)?(\\\\s([\\'\"])(([\\\\s\\\\S])?)\\\\5)?', 'g');\n\n//attr, =\"sd\", a=\"amit's\", a=\"sd\"b=\"saf\", ab cd=\"\"\n\nfunction validateAttributeString(attrStr, options) {\n //console.log(\"start:\"+attrStr+\":end\");\n\n //if(attrStr.trim().length === 0) return true; //empty string\n\n const matches = getAllMatches(attrStr, validAttrStrRegxp);\n const attrNames = {};\n\n for (let i = 0; i < matches.length; i++) {\n if (matches[i][1].length === 0) {\n //nospace before attribute name: a=\"sd\"b=\"saf\"\n return getErrorObject('InvalidAttr', \"Attribute '\" + matches[i][2] + \"' has no space in starting.\", getPositionFromMatch(matches[i]))\n } else if (matches[i][3] !== undefined && matches[i][4] === undefined) {\n return getErrorObject('InvalidAttr', \"Attribute '\" + matches[i][2] + \"' is without value.\", getPositionFromMatch(matches[i]));\n } else if (matches[i][3] === undefined && !options.allowBooleanAttributes) {\n //independent attribute: ab\n return getErrorObject('InvalidAttr', \"boolean attribute '\" + matches[i][2] + \"' is not allowed.\", getPositionFromMatch(matches[i]));\n }\n / else if(matches[i][6] === undefined){//attribute without value: ab=\n return { err: { code:\"InvalidAttr\",msg:\"attribute \" + matches[i][2] + \" has no value assigned.\"}};\n } /\n const attrName = matches[i][2];\n if (!validateAttrName(attrName)) {\n return getErrorObject('InvalidAttr', \"Attribute '\" + attrName + \"' is an invalid name.\", getPositionFromMatch(matches[i]));\n }\n if (!Object.prototype.hasOwnProperty.call(attrNames, attrName)) {\n //check for duplicate attribute.\n attrNames[attrName] = 1;\n } else {\n return getErrorObject('InvalidAttr', \"Attribute '\" + attrName + \"' is repeated.\", getPositionFromMatch(matches[i]));\n }\n }\n\n return true;\n}\n\nfunction validateNumberAmpersand(xmlData, i) {\n let re = /\\d/;\n if (xmlData[i] === 'x') {\n i++;\n re = /[\\da-fA-F]/;\n }\n for (; i < xmlData.length; i++) {\n if (xmlData[i] === ';')\n return i;\n if (!xmlData[i].match(re))\n break;\n }\n return -1;\n}\n\nfunction validateAmpersand(xmlData, i) {\n // https://www.w3.org/TR/xml/#dt-charref\n i++;\n if (xmlData[i] === ';')\n return -1;\n if (xmlData[i] === '#') {\n i++;\n return validateNumberAmpersand(xmlData, i);\n }\n let count = 0;\n for (; i < xmlData.length; i++, count++) {\n if (xmlData[i].match(/\\w/) && count < 20)\n continue;\n if (xmlData[i] === ';')\n break;\n return -1;\n }\n return i;\n}\n\nfunction getErrorObject(code, message, lineNumber) {\n return {\n err: {\n code: code,\n msg: message,\n line: lineNumber.line \|\| lineNumber,\n col: lineNumber.col,\n },\n };\n}\n\nfunction validateAttrName(attrName) {\n return isName(attrName);\n}\n\n// const startsWithXML = /^xml/i;\n\nfunction validateTagName(tagname) {\n return isName(tagname) / && !tagname.match(startsWithXML) /;\n}\n\n//this function returns the line number for the character at the given index\nfunction getLineNumberForPosition(xmlData, index) {\n const lines = xmlData.substring(0, index).split(/\\r?\\n/);\n return {\n line: lines.length,\n\n // column number is last line's length + 1, because column numbering starts at 1:\n col: lines[lines.length - 1].length + 1\n };\n}\n\n//this function returns the position of the first character of match within attrStr\nfunction getPositionFromMatch(match) {\n return match.startIndex + match[1].length;\n}\n","import { buildOptions } from './OptionsBuilder.js';\nimport OrderedObjParser from './OrderedObjParser.js';\nimport prettify from './node2json.js';\nimport { validate } from \"../validator.js\";\nimport XmlNode from './xmlNode.js';\n\nexport default class XMLParser {\n\n constructor(options) {\n this.externalEntities = {};\n this.options = buildOptions(options);\n\n }\n /\n Parse XML dats to JS object \n * @param {string\|Uint8Array} xmlData \n * @param {boolean\|Object} validationOption \n /\n parse(xmlData, validationOption) {\n if (typeof xmlData !== \"string\" && xmlData.toString) {\n xmlData = xmlData.toString();\n } else if (typeof xmlData !== \"string\") {\n throw new Error(\"XML data is accepted in String or Bytes[] form.\")\n }\n\n if (validationOption) {\n if (validationOption === true) validationOption = {}; //validate with default options\n\n const result = validate(xmlData, validationOption);\n if (result !== true) {\n throw Error(`${result.err.msg}:${result.err.line}:${result.err.col}`)\n }\n }\n const orderedObjParser = new OrderedObjParser(this.options);\n orderedObjParser.entityDecoder.setExternalEntities(this.externalEntities);\n const orderedResult = orderedObjParser.parseXml(xmlData);\n if (this.options.preserveOrder \|\| orderedResult === undefined) return orderedResult;\n else return prettify(orderedResult, this.options, orderedObjParser.matcher, orderedObjParser.readonlyMatcher);\n }\n\n /\n Add Entity which is not by default supported by this library\n * @param {string} key \n * @param {string} value \n /\n addEntity(key, value) {\n if (value.indexOf(\"&\") !== -1) {\n throw new Error(\"Entity value can't have '&'\")\n } else if (key.indexOf(\"&\") !== -1 \|\| key.indexOf(\";\") !== -1) {\n throw new Error(\"An entity must be set without '&' and ';'. Eg. use '#xD' for ' '\")\n } else if (value === \"&\") {\n throw new Error(\"An entity with value '&' is not permitted\");\n } else {\n this.externalEntities[key] = value;\n }\n }\n\n /\n Returns a Symbol that can be used to access the metadata\n * property on a node.\n * \n * If Symbol is not available in the environment, an ordinary property is used\n * and the name of the property is here returned.\n * \n * The XMLMetaData property is only present when `captureMetaData`\n * is true in the options.\n /\n static getMetaDataSymbol() {\n return XmlNode.getMetaDataSymbol();\n }\n}","'use strict';\n\nimport { validate } from './validator.js';\nimport XMLParser from './xmlparser/XMLParser.js';\nimport XMLBuilder from './xmlbuilder/json2xml.js';\n\nconst XMLValidator = {\n validate: validate\n}\nexport {\n XMLParser,\n XMLValidator,\n XMLBuilder\n};","export const string = {\n minLength(expected, actual) {\n return actual.length >= expected;\n },\n maxLength(expected, actual) {\n return actual.length <= expected;\n },\n length(expected, actual) {\n return actual.length === expected;\n },\n pattern(expected, actual, modifier = \"\") {\n const regxp = new RegExp(expected, modifier);\n return regxp.test(actual);\n },\n fixed(expected, actual) {\n return expected === actual;\n },\n in(expected, actual) {\n return expected.split(\",\").indexOf(actual) > -1;\n },\n};\n\nexport const num = {\n min(expected, actual) {\n return Number(actual) >= expected;\n },\n max(expected, actual) {\n return Number(actual) <= expected;\n },\n};\n\nexport const list = {\n minOccurs(expected, actual) {\n return actual >= expected;\n },\n maxOccurs(expected, actual) {\n return actual <= expected;\n },\n};\n\nexport const date = {\n /\n Compare two date strings.\n * @param {string} a\n * @param {string} b\n * @returns {number}\n /\n compare(a, b) {\n return Date.parse(a) - Date.parse(b);\n },\n\n isBefore(actual, reference) {\n return Date.parse(actual) < Date.parse(reference);\n },\n\n isAfter(actual, reference) {\n return Date.parse(actual) > Date.parse(reference);\n },\n\n min(expected, actual) {\n return Date.parse(actual) >= Date.parse(expected);\n },\n\n max(expected, actual) {\n return Date.parse(actual) <= Date.parse(expected);\n },\n};\n","import as validations from \"./validations.js\";\nimport { breakInSets, parseRange, parseDateRange } from \"./util.js\";\n\nconst numericTypes = [\"positiveInteger\", \"integer\", \"positiveDecimal\", \"decimal\", \"number\"];\n\nexport class Traverser {\n /*\n @param {object} options\n * @param {object} validators\n /\n constructor(options, validators, siblingOrder) {\n this.options = options;\n this.failures = [];\n this.validators = validators;\n\n // uniqueness tracking: field path -> array of seen values (sibling-scoped)\n // global uniqueness tracking: field name -> array of seen values (document-scoped)\n this._globalUnique = new Map(); // Map<fieldName, Set<string>>\n\n // Side-channel sibling order map built during XML parsing.\n // Map<parentPath, string[]> where parentPath matches Traverser's dot-notation path.\n this._siblingOrder = siblingOrder \|\| new Map();\n }\n\n /\n @param {object\|string} ele\n * @param {string} key\n * @param {object\|string} rules\n * @param {string} path\n /\n traverse(ele, key, rules, path) {\n if (Array.isArray(ele)) {\n if (rules !== undefined && rules[\"@rules\"] !== undefined) {\n if (rules[\"@rules\"].repeatable !== undefined) {\n this.checkOccurences(rules[\"@rules\"], ele.length, path);\n ele.forEach((val, index) => {\n const arrayPath = path + \"[\" + index + \"]\";\n if (Object.keys(rules).length > 1) {\n this.callForCommonProperties(ele[index], rules, arrayPath);\n } else {\n this.traverse(ele[index], key, rules, arrayPath);\n }\n });\n return;\n }\n }\n this.failures.push({\n code: \"unexpected sequence\",\n path: path.substr(1),\n });\n } else if (typeof ele === \"object\") {\n this.callForCommonProperties(ele, rules, path);\n } else {\n if (typeof rules === \"object\" && rules[\"@rules\"]) {\n this.checkDataAndType(ele, key, rules, path);\n } else if (this.isMapType(rules)) {\n this.validateMandatoryFields(rules, path);\n }\n this.applyCustomValidators(ele, rules, path);\n }\n }\n\n applyCustomValidators(ele, rules, path) {\n if (\n rules[\"@rules\"] &&\n rules[\"@rules\"].checkBy &&\n typeof this.validators[rules[\"@rules\"].checkBy] === \"function\"\n ) {\n let res = this.validators[rules[\"@rules\"].checkBy](ele, path.substr(1));\n if (typeof res === \"object\") {\n this.failures.push(res);\n }\n }\n }\n\n /\n @param {object} ele\n * @param {object} rules\n * @param {string} path\n /\n callForCommonProperties(ele, rules, path) {\n const tags = Object.keys(ele);\n const rulesTags = Object.keys(rules);\n\n const sets = breakInSets(tags, rulesTags);\n this.checkUnknownSiblings(sets, path);\n this.checkMissingSiblings(sets, rules, path);\n\n this.applyCustomValidators(ele, rules, path);\n\n // Collect sibling values for uniqueness checks before traversing\n // Build a map of fieldName -> array of values for this sibling scope\n const siblingValues = this._buildSiblingValues(ele, rules, sets.common);\n\n sets.common.forEach((key) => {\n const newpath = path + \".\" + key;\n this.traverse(ele[key], key, rules[key], newpath);\n });\n\n // After traversing, run ordering, uniqueness, and relational checks for this sibling scope\n this._checkOrderingConstraints(ele, rules, sets.common, path);\n this._checkUniquenessConstraints(ele, rules, sets.common, path, siblingValues);\n this._checkRelationalConstraints(ele, rules, sets.common, path);\n }\n\n // ─── Ordering Constraints (before / after) ────────────────────────────────\n\n /\n For every field that has `before` or `after` in its rules, validate that\n * it appears positionally before or after the referenced sibling tag in the\n * original XML document order.\n \n Order is sourced from the side-channel `_siblingOrder` map built during\n * parsing — not from JS object key order, which is unreliable for integer keys.\n \n Works for any tag type, not just dates.\n \n @param {object} ele\n * @param {object} rules\n * @param {string[]} commonKeys\n * @param {string} path - current traversal path (e.g. \".event\" or \".order[0]\")\n /\n _checkOrderingConstraints(ele, rules, commonKeys, path) {\n // The siblingOrder map is keyed by the parent path without the leading dot.\n const orderKey = path.substr(1);\n const order = this._siblingOrder.get(orderKey);\n // If we have no order info for this path, skip — can happen for empty elements.\n if (!order) return;\n\n commonKeys.forEach((key) => {\n const fieldRules = rules[key];\n if (!fieldRules \|\| !fieldRules[\"@rules\"]) return;\n const r = fieldRules[\"@rules\"];\n\n const keyIdx = order.indexOf(key);\n if (keyIdx === -1) return; // tag not recorded — skip\n\n if (r.after) {\n const refKey = r.after;\n // Skip silently if referenced sibling is absent from data\n if (ele[refKey] === undefined) return;\n const refIdx = order.indexOf(refKey);\n if (refIdx === -1) return;\n if (keyIdx <= refIdx) {\n this.failures.push({\n code: \"after\",\n path: (path + \".\" + key).substr(1),\n actual: key,\n expected: refKey,\n });\n }\n }\n\n if (r.before) {\n const refKey = r.before;\n // Skip silently if referenced sibling is absent from data\n if (ele[refKey] === undefined) return;\n const refIdx = order.indexOf(refKey);\n if (refIdx === -1) return;\n if (keyIdx >= refIdx) {\n this.failures.push({\n code: \"before\",\n path: (path + \".\" + key).substr(1),\n actual: key,\n expected: refKey,\n });\n }\n }\n });\n }\n\n // ─── Relational Constraints (sameAs / notSameAs / lessThan / moreThan) ──────\n\n /\n Compare this field's value against another sibling field's value.\n \n Supported rule attributes:\n * sameAs=\"refField\" — values must be equal\n * notSameAs=\"refField\" — values must differ\n * lessThan=\"refField\" — this value must be strictly less than ref value\n * moreThan=\"refField\" — this value must be strictly greater than ref value\n \n Comparison is type-aware based on the field's declared `type`:\n * date types → Date.parse() comparison\n * numeric types → Number() comparison\n * all others → lexicographic string comparison\n \n Skips silently when:\n * - The referenced sibling is absent from data\n * - Either value is an object/map (not a primitive)\n * - The ref value cannot be coerced to the expected type\n \n @param {object} ele\n * @param {object} rules\n * @param {string[]} commonKeys\n * @param {string} path\n /\n _checkRelationalConstraints(ele, rules, commonKeys, path) {\n const RELATIONAL_RULES = [\"sameAs\", \"notSameAs\", \"lessThan\", \"moreThan\"];\n\n commonKeys.forEach((key) => {\n const fieldRules = rules[key];\n if (!fieldRules \|\| !fieldRules[\"@rules\"]) return;\n const r = fieldRules[\"@rules\"];\n\n // Check if any relational rule is present\n if (!RELATIONAL_RULES.some((attr) => r[attr] !== undefined)) return;\n\n const actualRaw = ele[key];\n\n // Skip maps and arrays — only primitives are comparable\n if (actualRaw === null \|\| actualRaw === undefined) return;\n if (typeof actualRaw === \"object\") return;\n\n const fieldType = r.type \|\| \"string\";\n\n RELATIONAL_RULES.forEach((attr) => {\n if (r[attr] === undefined) return;\n\n const refKey = r[attr];\n const refRaw = ele[refKey];\n\n // Skip silently if ref sibling is absent or is a map/array\n if (refRaw === undefined \|\| refRaw === null) return;\n if (typeof refRaw === \"object\") return;\n\n // Coerce both values and compare\n const cmp = this._relationalCompare(String(actualRaw), String(refRaw), fieldType);\n\n // cmp is null when coercion fails — skip silently\n if (cmp === null) return;\n\n let violated = false;\n if (attr === \"sameAs\" && cmp !== 0) violated = true;\n if (attr === \"notSameAs\" && cmp === 0) violated = true;\n if (attr === \"lessThan\" && cmp >= 0) violated = true;\n if (attr === \"moreThan\" && cmp <= 0) violated = true;\n\n if (violated) {\n this.failures.push({\n code: attr,\n path: (path + \".\" + key).substr(1),\n actual: String(actualRaw),\n expected: refKey,\n });\n }\n });\n });\n }\n\n /\n Compare two string-encoded values using the appropriate strategy for the field type.\n * Returns a negative number, zero, or positive number (like Array.sort comparator).\n * Returns null if coercion fails (caller should skip silently).\n * @param {string} a\n * @param {string} b\n * @param {string} fieldType\n * @returns {number\|null}\n /\n _relationalCompare(a, b, fieldType) {\n if (fieldType === \"date\") {\n const da = Date.parse(a);\n const db = Date.parse(b);\n if (isNaN(da) \|\| isNaN(db)) return null;\n return da - db;\n }\n if (numericTypes.indexOf(fieldType) !== -1) {\n const na = Number(a);\n const nb = Number(b);\n if (isNaN(na) \|\| isNaN(nb)) return null;\n return na - nb;\n }\n // string / no type — lexicographic\n if (a < b) return -1;\n if (a > b) return 1;\n return 0;\n }\n\n // ─── Uniqueness Constraints ───────────────────────────────────────────────\n\n /\n Build a map of fieldName -> array of values found in this sibling scope.\n * Works for both scalar values and array (repeatable) values.\n * @param {object} ele\n * @param {object} rules\n * @param {string[]} commonKeys\n * @returns {Map<string, string[]>}\n /\n _buildSiblingValues(ele, rules, commonKeys) {\n const map = new Map();\n commonKeys.forEach((key) => {\n const val = ele[key];\n if (Array.isArray(val)) {\n map.set(key, val.map(String));\n } else if (val !== undefined && val !== null && typeof val !== \"object\") {\n map.set(key, [String(val)]);\n }\n });\n return map;\n }\n\n /\n Check uniqueness constraints for fields in this sibling scope.\n * @param {object} ele\n * @param {object} rules\n * @param {string[]} commonKeys\n * @param {string} path\n * @param {Map<string, string[]>} siblingValues\n /\n _checkUniquenessConstraints(ele, rules, commonKeys, path, siblingValues) {\n // For repeatable items (array context), ele is a single item; sibling-scope\n // uniqueness is managed by the parent array traversal which collects all items.\n // We handle uniqueness at the collection level in `_checkUniqueInCollection`.\n // This method handles per-field unique=\"global\".\n commonKeys.forEach((key) => {\n const fieldRules = rules[key];\n if (!fieldRules \|\| !fieldRules[\"@rules\"]) return;\n const unique = fieldRules[\"@rules\"].unique;\n if (!unique) return;\n\n const vals = siblingValues.get(key) \|\| [];\n if (unique === \"global\") {\n vals.forEach((v, idx) => {\n const fieldPath = Array.isArray(ele[key])\n ? (path + \".\" + key + \"[\" + idx + \"]\").substr(1)\n : (path + \".\" + key).substr(1);\n this._assertGlobalUnique(key, v, fieldPath);\n });\n }\n // unique=\"true\" (sibling scope) is handled at the repeatable-collection level\n });\n }\n\n /\n Check uniqueness within a collection of repeatable items.\n * Called from _traverseRepeatableCollection when sibling-scoped uniqueness is needed.\n * @param {Array<object>} items\n * @param {string} fieldKey - field to check\n * @param {string} basePath - path prefix for error messages\n /\n _checkUniqueInCollection(items, fieldKey, basePath) {\n const seen = new Map(); // value -> first index\n items.forEach((item, idx) => {\n const val = item[fieldKey];\n if (val === undefined \|\| val === null \|\| typeof val === \"object\") return;\n const strVal = String(val);\n if (seen.has(strVal)) {\n this.failures.push({\n code: \"unique\",\n path: (basePath + \"[\" + idx + \"].\" + fieldKey).substr(1),\n value: strVal,\n });\n } else {\n seen.set(strVal, idx);\n }\n });\n }\n\n /\n Assert a value is unique globally (across the whole document).\n * @param {string} fieldName\n * @param {string} value\n * @param {string} fieldPath\n /\n _assertGlobalUnique(fieldName, value, fieldPath) {\n if (!this._globalUnique.has(fieldName)) {\n this._globalUnique.set(fieldName, new Set());\n }\n const seen = this._globalUnique.get(fieldName);\n if (seen.has(value)) {\n this.failures.push({\n code: \"unique\",\n path: fieldPath,\n value,\n });\n } else {\n seen.add(value);\n }\n }\n\n // ─── Data & Type ──────────────────────────────────────────────────────────\n\n /\n Check if the leaf node has correct type and passes validations.\n * @param {string} val\n * @param {string} key\n * @param {object} rules\n * @param {string} path\n /\n checkDataAndType(val, key, rules, path) {\n if (rules[\"@rules\"].repeatable === true) {\n this.checkOccurences(rules[\"@rules\"], 1, path);\n }\n const eleType = rules[\"@rules\"].type;\n\n // Expand range shorthand before numeric validation\n const expandedRules = this._expandRange(rules);\n\n if (eleType === \"map\" \|\| (!eleType && this.isMapType(rules))) {\n if (typeof val === \"string\" && val.length > 0) {\n this.failures.push({\n code: \"unexpected value in a map\",\n path: path.substr(1),\n value: val,\n });\n }\n this.validateMandatoryFields(rules, path);\n } else if (eleType === \"date\") {\n this.validateDate(val, eleType, path);\n this._checkDateBounds(rules, val, path);\n } else if (eleType === \"boolean\") {\n this.validateBoolean(val, eleType, path);\n } else if (numericTypes.indexOf(eleType) !== -1) {\n if (!this.isValidNum(eleType, val)) {\n this.setInvalidDataType(eleType, path, val);\n } else {\n this.assertValue(expandedRules[\"@rules\"], \"num\", Number(val), path);\n }\n } else if (eleType === \"string\" \|\| !eleType) {\n this.assertValue(expandedRules[\"@rules\"], \"string\", val, path);\n } else {\n throw new Error(\"Unsupported data type in Rules:\" + eleType);\n }\n }\n\n /\n Expand `range=\"min..max\"` shorthand into `min` and `max` on a cloned rules object.\n * @param {object} rules\n * @returns {object}\n /\n _expandRange(rules) {\n if (!rules[\"@rules\"] \|\| !rules[\"@rules\"].range) return rules;\n const parsed = parseRange(rules[\"@rules\"].range);\n if (!parsed) return rules;\n // Clone to avoid mutating the shared rules object\n return {\n ...rules,\n \"@rules\": {\n ...rules[\"@rules\"],\n min: rules[\"@rules\"].min !== undefined ? rules[\"@rules\"].min : String(parsed.min),\n max: rules[\"@rules\"].max !== undefined ? rules[\"@rules\"].max : String(parsed.max),\n },\n };\n }\n\n /\n Check `min`, `max`, and `range` bounds for a date field.\n * Only runs after the value has already passed `validateDate` (i.e. it is a valid date).\n * Explicit `min`/`max` take precedence over `range` shorthand.\n * @param {object} rules\n * @param {string} val\n * @param {string} path\n /\n _checkDateBounds(rules, val, path) {\n if (isNaN(Date.parse(val))) return; // invalid date — type check already reported it\n const r = rules[\"@rules\"];\n\n let min = r.min;\n let max = r.max;\n\n // Expand range shorthand only for the parts not already set explicitly\n if (r.range && (!min \|\| !max)) {\n const parsed = parseDateRange(r.range);\n if (parsed) {\n if (!min) min = parsed.min;\n if (!max) max = parsed.max;\n }\n }\n\n if (min !== undefined && !validations.date.min(min, val)) {\n this.setInvalidValueError(\"min\", path, val, min);\n }\n if (max !== undefined && !validations.date.max(max, val)) {\n this.setInvalidValueError(\"max\", path, val, max);\n }\n }\n\n /\n @param {object} rules\n * @param {string} newpath\n /\n validateMandatoryFields(rules, newpath) {\n const keys = Object.keys(rules);\n for (let i = 0; i < keys.length; i++) {\n if (keys[i] === \"@rules\") continue;\n const child = rules[keys[i]];\n const rulesForChild = child[\"@rules\"];\n if (rulesForChild) {\n if (rulesForChild.minOccurs && rulesForChild.minOccurs > 0) {\n this.failures.push({\n code: \"missing\",\n path: (newpath + \".\" + keys[i]).substr(1),\n });\n } else if (rulesForChild.nillable !== undefined && rulesForChild.nillable === \"false\") {\n this.failures.push({\n code: \"missing\",\n path: (newpath + \".\" + keys[i]).substr(1),\n });\n }\n }\n }\n }\n\n /\n @param {any} tag\n * @returns {boolean}\n /\n isMapType(tag) {\n if (typeof tag === \"string\") return false;\n const keys = Object.keys(tag);\n if (tag[\"@rules\"]) {\n if (keys.length === 1) return false;\n } else if (keys.length === 0) {\n return false;\n } else {\n return true;\n }\n }\n\n setInvalidValueError(rule, newpath, actual, expected) {\n this.failures.push({\n code: rule,\n path: newpath.substr(1),\n actual,\n expected,\n });\n }\n\n checkOccurences(rules, actual, newpath) {\n [\"minOccurs\", \"maxOccurs\"].forEach((rule) => {\n if (rules[rule] !== undefined) {\n const expected = Number(rules[rule]);\n if (!validations.list[rule](expected, actual)) {\n this.setInvalidValueError(rule, newpath, actual, expected);\n }\n }\n });\n }\n\n checkNumeric(rules, actual, newpath) {\n [\"min\", \"max\"].forEach((rule) => {\n if (rules[rule] !== undefined) {\n const expected = Number(rules[rule]);\n if (!validations.num[rule](expected, actual)) {\n this.setInvalidValueError(rule, newpath, actual, expected);\n }\n }\n });\n }\n\n checkString(rules, actual, newpath) {\n [\"minLength\", \"maxLength\", \"length\"].forEach((rule) => {\n if (rules[rule] !== undefined) {\n const expected = Number(rules[rule]);\n if (!validations.string[rule](expected, actual)) {\n this.setInvalidValueError(rule, newpath, actual, expected);\n }\n }\n });\n [\"fixed\", \"in\"].forEach((rule) => {\n if (rules[rule] !== undefined) {\n const expected = rules[rule];\n if (!validations.string[rule](expected, actual)) {\n this.setInvalidValueError(rule, newpath, actual, expected);\n }\n }\n });\n [\"pattern\", \"pattern_i\", \"pattern_im\", \"pattern_mi\"].forEach((rule) => {\n if (rules[rule] !== undefined) {\n let modifier = \"\";\n if (rule.length > 8) modifier = rule.substring(8);\n const expected = rules[rule];\n if (!validations.string[\"pattern\"](expected, actual, modifier)) {\n this.setInvalidValueError(\"pattern\", newpath, actual, expected);\n }\n }\n });\n }\n\n assertValue(rules, eleType, actual, newpath) {\n if (eleType === \"string\") this.checkString(rules, actual, newpath);\n else if (eleType === \"num\") this.checkNumeric(rules, actual, newpath);\n }\n\n validateBoolean(actual, eleType, newpath) {\n if (this.options.boolean.indexOf(actual) === -1) {\n this.setInvalidDataType(eleType, newpath, actual);\n }\n }\n\n isValidNum(eleType, val) {\n if (!isNaN(val)) {\n const num = Number(val);\n if (\n (eleType === \"positiveInteger\" && num < 0) \|\|\n (eleType === \"positiveDecimal\" && num < 0) \|\|\n (eleType === \"integer\" && !isInt(val))\n ) {\n return false;\n }\n } else {\n return false;\n }\n return true;\n }\n\n validateDate(val, eleType, newpath) {\n const date = Date.parse(val);\n if (isNaN(date)) this.setInvalidDataType(eleType, newpath, val);\n }\n\n setInvalidDataType(eleType, newpath, val) {\n this.failures.push({\n code: \"not a \" + eleType,\n path: newpath.substr(1),\n value: val,\n });\n }\n\n /\n @param {object} sets\n * @param {object} rules\n * @param {string} path\n /\n checkMissingSiblings(sets, rules, path) {\n if (sets.rules) {\n sets.rules.forEach((tagRule) => {\n const rulesNode = rules[tagRule][\"@rules\"];\n if (rulesNode && (rulesNode.nillable === \"false\" \|\| rulesNode.minOccurs > 0)) {\n this.failures.push({\n code: \"missing\",\n path: (path + \".\" + tagRule).substr(1),\n });\n }\n });\n }\n }\n\n /\n @param {object} sets\n * @param {string} path\n /\n checkUnknownSiblings(sets, path) {\n if (sets.data && !this.options.unknownAllow) {\n sets.data.forEach((tag) => {\n this.failures.push({\n code: \"unknown\",\n path: (path + \".\" + tag).substr(1),\n });\n });\n }\n }\n}\n\n// ─── Traverser subclass that adds repeatable-collection uniqueness ─────────────\n// We override the array-handling branch of traverse() to also run sibling uniqueness.\n\nconst _originalTraverse = Traverser.prototype.traverse;\n\nTraverser.prototype.traverse = function traverse(ele, key, rules, path) {\n if (\n Array.isArray(ele) &&\n rules !== undefined &&\n rules[\"@rules\"] !== undefined &&\n rules[\"@rules\"].repeatable !== undefined\n ) {\n // Run the original logic (occurrence checks + per-item traversal)\n this.checkOccurences(rules[\"@rules\"], ele.length, path);\n ele.forEach((val, index) => {\n const arrayPath = path + \"[\" + index + \"]\";\n if (Object.keys(rules).length > 1) {\n this.callForCommonProperties(ele[index], rules, arrayPath);\n } else {\n // Simple scalar repeatable\n const scalarRules = rules;\n _originalTraverse.call(this, ele[index], key, scalarRules, arrayPath);\n }\n });\n\n // After all items processed, check sibling-scoped uniqueness\n if (ele.length > 0 && typeof ele[0] === \"object\") {\n this._runSiblingUniqueness(ele, rules, path);\n }\n return;\n }\n\n // For everything else, delegate to the original implementation\n _originalTraverse.call(this, ele, key, rules, path);\n};\n\n/\n Scan child field rules of a repeatable element for `unique=\"true\"` and\n * validate all occurrences within the array scope.\n * @param {Array<object>} items\n * @param {object} rules - rules for the repeatable element\n * @param {string} path\n /\nTraverser.prototype._runSiblingUniqueness = function (items, rules, path) {\n const fieldKeys = Object.keys(rules).filter((k) => k !== \"@rules\");\n fieldKeys.forEach((fieldKey) => {\n const fieldRules = rules[fieldKey];\n if (!fieldRules \|\| !fieldRules[\"@rules\"]) return;\n if (fieldRules[\"@rules\"].unique !== \"true\") return;\n this._checkUniqueInCollection(items, fieldKey, path);\n });\n};\n\nfunction isInt(value) {\n const x = parseFloat(value);\n return (x \| 0) === x;\n}\n","/\n @param {string[]} data\n * @param {string[]} rules\n * @returns {{ data: string[], rules: string[], common: string[] }}\n /\nexport function breakInSets(data, rules) {\n const extra = {\n data: [],\n rules: [],\n common: [],\n };\n\n for (let i = 0; i < data.length; i++) {\n if (rules.indexOf(data[i]) === -1) extra.data.push(data[i]);\n else extra.common.push(data[i]);\n }\n\n for (let i = 0; i < rules.length; i++) {\n if (data.indexOf(rules[i]) === -1 && rules[i] !== \"@\") extra.rules.push(rules[i]);\n }\n return extra;\n}\n\n/\n Parse a range shorthand \"min..max\" string into { min, max } numbers.\n * Returns null if the string is not a valid range.\n * @param {string} range\n * @returns {{ min: number, max: number } \| null}\n /\nexport function parseRange(range) {\n if (typeof range !== \"string\") return null;\n const parts = range.split(\"..\");\n if (parts.length !== 2) return null;\n const min = Number(parts[0]);\n const max = Number(parts[1]);\n if (isNaN(min) \|\| isNaN(max)) return null;\n return { min, max };\n}\n\n/\n Parse a date range shorthand \"minDate..maxDate\" string into { min, max } date strings.\n * Returns null if either part is not a parseable date.\n * @param {string} range\n * @returns {{ min: string, max: string } \| null}\n /\nexport function parseDateRange(range) {\n if (typeof range !== \"string\") return null;\n const parts = range.split(\"..\");\n if (parts.length !== 2) return null;\n const [min, max] = parts;\n if (isNaN(Date.parse(min)) \|\| isNaN(Date.parse(max))) return null;\n return { min, max };\n}\n","import { XMLParser, XMLValidator } from \"fast-xml-parser\";\nimport { Traverser } from \"./Traverser.js\";\n\nconst defaultOptions = {\n unknownAllow: true,\n boolean: [\"true\", \"false\"],\n};\n\nexport class Validator {\n /\n @param {string} rules - XML string containing rule definitions\n * @param {object} [options]\n /\n constructor(rules, options) {\n validateXMLData(rules);\n const ruleParser = new XMLParser({\n ignoreAttributes: false,\n attributesGroupName: \"@rules\",\n attributeNamePrefix: \"\",\n allowBooleanAttributes: true,\n });\n this.rules = ruleParser.parse(rules);\n this.options = Object.assign({}, defaultOptions, options);\n this.validators = {};\n /* @type {object\|null} Parsed XML data after the last validate() call /\n this.data = null;\n }\n\n /\n Register a custom validator function.\n * @param {string} name\n * @param {(value: string, path: string) => object \| undefined} fn\n /\n register(name, fn) {\n this.validators[name] = fn;\n }\n\n /\n Validate XML data against the rules.\n * @param {string} xmldata\n * @returns {Array<object>} Array of failure objects (empty if valid)\n */\n validate(xmldata) {\n validateXMLData(xmldata);\n\n // Side-channel: record the insertion order of child tags per parent path.\n // Map<parentPath, string[]> — parentPath uses the same dot-notation as Traverser.\n // tagValueProcessor fires for every tag in document order, giving us reliable\n // positional information independent of JS object key ordering.\n const siblingOrder = new Map();\n const tagValueProcessor = (tagName, tagValue, jPath) => {\n // jPath is \"root.parent.child\" — parent path is everything before the last segment\n const lastDot = jPath.lastIndexOf(\".\");\n const parentPath = lastDot === -1 ? \"\" : jPath.substring(0, lastDot);\n if (!siblingOrder.has(parentPath)) siblingOrder.set(parentPath, []);\n const siblings = siblingOrder.get(parentPath);\n // Only push if not already recorded (FXP may fire multiple times for arrays)\n if (siblings[siblings.length - 1] !== tagName) siblings.push(tagName);\n return tagValue;\n };\n\n const parser = new XMLParser({\n ignoreAttributes: false,\n attributesGroupName: \":a\",\n attributeNamePrefix: \"\",\n parseTagValue: false,\n tagValueProcessor,\n });\n const xmlObj = parser.parse(xmldata);\n this.data = xmlObj;\n const traverser = new Traverser(this.options, this.validators, siblingOrder);\n traverser.traverse(xmlObj, \"\", this.rules, \"\");\n return traverser.failures;\n }\n}\n\nfunction validateXMLData(xmldata) {\n if (!xmldata) throw new Error(\"Empty data\");\n else if (typeof xmldata !== \"string\") throw new Error(\"Not a valid string\");\n const result = XMLValidator.validate(xmldata, {\n allowBooleanAttributes: true,\n });\n if (result !== true) {\n throw new Error(result.err.msg + \":\" + result.err.line);\n }\n}\n\nexport default Validator;\n","'use strict';\n\nimport { validate as validateSyntax } from './validator.js';\nimport BusinessRulesValidator from 'detailed-xml-validator';\n\nclass SyntaxValidator {\n static validate(xmlData, options) {\n return validateSyntax(xmlData, options);\n }\n}\n\nexport { SyntaxValidator, BusinessRulesValidator };"],"names":["root","factory","exports","module","define","amd","this","__webpack_require__","definition","key","o","Object","defineProperty","enumerable","get","obj","prop","prototype","hasOwnProperty","call","Symbol","toStringTag","value","nameStartChar10","nameStartChar11","nameChar11","buildRegexes","startChar","char","flags","ncNamePat","replace","name","RegExp","ncName","qName","nmToken","nmTokens","regexes10","regexes11","getRegexes","xmlVersion","str","test","defaultOptions","maxEntityCount","Infinity","maxEntitySize","DocTypeValidator","options","assign","suppressValidationErr","_proto","validateDocType","xmlData","i","Error","angleBracketsCount","hasBody","comment","entityCount","length","hasSeq","_this$_validateEntity","_validateEntityExp","_validateElementExp","_validateAttlistExp","_validateNotationExp","nameStart","skipWhitespace","entityValue","entityName","substring","validateName","toUpperCase","_readQuotedValue","readQuotedValue","_this$options","indexOf","notationName","identifierType","elementName","isXmlName","elemNameStart","attrNameStart","notationStart","trim","typeStart","attributeType","includes","data","index","seq","j","type","start","ValidationError","_Error","message","code","line","col","_this","constructor","captureStackTrace","_wrapNativeSuper","allowBooleanAttributes","unpairedTags","docType","isWhiteSpace","readPI","piStart","nameValidated","ch","piName","substr","toLowerCase","throwError","getLineNumberForPosition","xmlName","readCommentAndCDATA","docTypeValidator","doubleQuote","singleQuote","readAttributeStr","attrStr","tagClosed","validAttrStrRegxp","validateAttributeString","matches","string","regex","match","exec","allmatches","startIndex","lastIndex","len","push","getAllMatches","attrNames","err","msg","getPositionFromMatch","undefined","attrName","validateQName","startsWith","validateAmpersand","re","validateNumberAmpersand","count","lineNumber","lines","split","nameStartChar","regexName","isName","DANGEROUS_PROPERTY_NAMES","criticalProperties","defaultOnDangerousProperty","preserveOrder","attributeNamePrefix","attributesGroupName","textNodeName","ignoreAttributes","removeNSPrefix","parseTagValue","parseAttributeValue","trimValues","cdataPropName","numberParseOptions","hex","leadingZeros","eNotation","tagValueProcessor","tagName","val","attributeValueProcessor","stopNodes","alwaysCreateTextNode","isArray","commentPropName","processEntities","htmlEntities","entityDecoder","ignoreDeclaration","ignorePiTags","transformTagName","transformAttributeName","updateTag","jPath","attrs","captureMetaData","maxNestedTags","strictReservedNames","onDangerousProperty","validatePropertyName","propertyName","optionName","normalized","some","dangerous","normalizeProcessEntities","enabled","maxExpansionDepth","maxTotalExpansions","maxExpandedLength","allowedTags","tagFilter","appliesTo","Math","max","buildOptions","built","propertyNameOptions","unpairedTagsSet","Set","Array","map","node","METADATA_SYMBOL","XmlNode","tagname","child","create","add","addChild","keys","getMetaDataSymbol","DocTypeReader","readDocType","entities","exp","readEntityExp","readElementExp","readNotationExp","validateEntityName","readIdentifierVal","publicIdentifier","systemIdentifier","identifierVal","contentModel","readAttlistExp","attributeName","allowedNotations","notation","join","validTypes","defaultValue","hexRegex","numRegex","consider","decimalPoint","infinity","eNotationRegx","MatcherView","matcher","_matcher","separator","getCurrentTag","path","tag","getCurrentNamespace","namespace","getAttrValue","values","hasAttr","current","getPosition","position","getCounter","counter","getIndex","getDepth","toString","includeNamespace","toArray","n","expression","matchesAny","exprSet","Matcher","siblingStacks","_pathStringCache","_view","attrValues","currentLevel","Map","siblings","siblingKey","set","pop","updateCurrent","sep","result","reset","segments","hasDeepWildcard","_matchWithDeepWildcard","_matchSimple","_matchSegment","pathIdx","segIdx","segment","nextSeg","found","isCurrentNode","attrValue","String","positionValue","snapshot","restore","readOnly","Expression","pattern","_parse","_hasDeepWildcard","seg","_hasAttributeCondition","_hasPositionSelector","currentPart","_parseSegment","part","bracketContent","withoutBrackets","bracketMatch","content","slice","tagAndPosition","nsIndex","positionMatch","colonIndex","lastIndexOf","tagPart","posPart","eqIndex","nthMatch","parseInt","hasAttributeCondition","hasPositionSelector","ExpressionSet","_byDepthAndTag","_wildcardByDepth","_deepWildcards","_patterns","_sealed","TypeError","has","depth","lastSeg","addAll","expressions","expr","size","seal","isSealed","findMatch","exactKey","exactBucket","wildcardBucket","CURRENCY","cent","pound","curren","yen","euro","dollar","fnof","inr","af","birr","peso","rub","won","yuan","cedil","XML","amp","apos","gt","lt","quot","COMMON_HTML","nbsp","copy","reg","trade","mdash","ndash","hellip","laquo","raquo","lsquo","rsquo","ldquo","rdquo","bull","para","sect","deg","frac12","frac14","frac34","SPECIAL_CHARS","mergeEntityMaps","maps","out","raw","LIMIT_TIER_EXTERNAL","LIMIT_TIER_BASE","LIMIT_TIER_ALL","NCR_LEVEL","freeze","allow","leave","remove","throw","XML10_ALLOWED_C0","EntityDecoder","_limit","limit","_maxTotalExpansions","_maxExpandedLength","_postCheck","postCheck","r","_limitTiers","applyLimitsTo","_numericAllowed","numericAllowed","_baseMap","DEFAULT_XML_ENTITIES","namedEntities","_externalMap","_inputMap","_totalExpansions","_expandedLength","_removeSet","_leaveSet","ncrCfg","ncr","onLevel","nullLevel","onNCR","nullNCR","parseNCRConfig","_ncrXmlVersion","_ncrOnLevel","_ncrNullLevel","setExternalEntities","addExternalEntity","addInputEntities","setXmlVersion","version","decode","original","chunks","last","limitExpansions","limitLength","checkLimits","charCodeAt","token","replacement","tier","ncrResult","_resolveNCR","resolved","_resolveName","_tierCounts","delta","_classifyNCR","cp","_applyNCRAction","action","fromCodePoint","padStart","second","Number","isNaN","minimum","effective","extractRawAttributes","prefixedAttrs","rawAttrs","extractNamespace","rawTagName","ns","OrderedObjParser","currentNode","tagsNodeStack","parseXml","parseTextData","resolveNameSpace","buildAttributesMap","isItStopNode","replaceEntitiesValue","readStopNodeData","saveTextToParentTag","ignoreAttributesFn","entityExpansionCount","currentExpandedLength","readonlyMatcher","isCurrentNodeStopNode","stopNodeExpressionsSet","stopNodesOpts","stopNodeExp","dontTrim","hasAttributes","isLeafNode","escapeEntities","jPathOrMatcher","newval","parseValue","tags","prefix","charAt","attrsRegx","force","processedVals","hasRawAttrs","rawAttrsForMatcher","oldVal","jPathStr","hasAttrs","aName","sanitizeName","newVal","attrCollection","xmlObj","xmlNode","textData","docTypeReader","xmlLen","c1","closeIndex","findClosingIndex","lastTagName","tagData","readTagExp","attsMap","tagExp","ver","childNode","attrExpPresent","endIndex","context","min","lastTag","isSelfClosing","tagContent","entityConfig","parentNode","errMsg","closingIndex","findClosingChar","closingChar","attrBoundary","chars","closeCode0","closeCode1","fromCharCode","tagExpWithClosingIndex","separatorIndex","search","trimStart","openTagCount","xmllen","shouldParse","trimmedStr","skipLike","numStr","window","parse_int","isFinite","sign","eChar","eAdjacentToLeadingZeros","resolveEnotation","numTrimmedByZeros","decimalAdjacentToLeadingZeros","num","parsedStr","isPositive","handleInfinity","toNumber","fn","newTagName","stripAttributePrefix","prettify","compress","arr","text","compressedObj","tagObj","property","propName","isLeaf","isLeafTag","assignAttributes","attrMap","atrrName","rawAttrName","propCount","validate","tagFound","reachedRoot","getErrorObject","tagStartPos","closingTag","validateTagName","attrStrStart","isValid","otg","openPos","afterAmp","JSON","stringify","t","validateAttrName","XMLParser","externalEntities","parse","validationOption","orderedObjParser","orderedResult","addEntity","XMLValidator","minLength","expected","actual","maxLength","modifier","fixed","in","list","minOccurs","maxOccurs","date","Date","numericTypes","Traverser","validators","siblingOrder","failures","_globalUnique","_siblingOrder","traverse","ele","rules","repeatable","checkOccurences","forEach","arrayPath","callForCommonProperties","checkDataAndType","isMapType","validateMandatoryFields","applyCustomValidators","checkBy","res","sets","extra","common","breakInSets","checkUnknownSiblings","checkMissingSiblings","siblingValues","_buildSiblingValues","newpath","_checkOrderingConstraints","_checkUniquenessConstraints","_checkRelationalConstraints","commonKeys","orderKey","order","fieldRules","keyIdx","after","refKey","refIdx","before","RELATIONAL_RULES","attr","actualRaw","fieldType","refRaw","cmp","_relationalCompare","violated","a","b","da","db","na","nb","unique","vals","v","idx","fieldPath","_assertGlobalUnique","_checkUniqueInCollection","items","fieldKey","basePath","seen","item","strVal","fieldName","eleType","expandedRules","_expandRange","validateDate","_checkDateBounds","validateBoolean","isValidNum","assertValue","setInvalidDataType","range","parsed","parts","parseRange","parseDateRange","validations","setInvalidValueError","rulesForChild","nillable","rule","checkNumeric","checkString","boolean","x","parseFloat","isInt","tagRule","rulesNode","unknownAllow","_originalTraverse","scalarRules","_runSiblingUniqueness","filter","k","validateXMLData","xmldata","ruleParser","register","tagValue","lastDot","parentPath","traverser","SyntaxValidator","declResult","piEnd","declBody","end","ALLOWED","attrRe","lastAllowedIdx","attrPos","allowedIdx","leftover","parseXmlDeclaration","validateSyntax"],"sourceRoot":""}
1	+ {"version":3,"file":"./lib/fxv.min.js","mappings":"CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,iBAAZC,QACdA,QAAa,IAAID,IAEjBD,EAAU,IAAIC,GACf,CATD,CASGK,KAAM,I,mBCRT,IAAIC,EAAsB,CCA1BA,EAAwB,CAACL,EAASM,KACjC,IAAI,IAAIC,KAAOD,EACXD,EAAoBG,EAAEF,EAAYC,KAASF,EAAoBG,EAAER,EAASO,IAC5EE,OAAOC,eAAeV,EAASO,EAAK,CAAEI,YAAY,EAAMC,IAAKN,EAAWC,MCJ3EF,EAAwB,CAACQ,EAAKC,IAAUL,OAAOM,UAAUC,eAAeC,KAAKJ,EAAKC,GCClFT,EAAyBL,IACH,oBAAXkB,QAA0BA,OAAOC,aAC1CV,OAAOC,eAAeV,EAASkB,OAAOC,YAAa,CAAEC,MAAO,WAE7DX,OAAOC,eAAeV,EAAS,aAAc,CAAEoB,OAAO,M,0ECwBvD,MAAMC,EACJ,+CAoCIC,EACJ,8CAYIC,EACJD,sBAeIE,EAAeA,CAACC,EAAWC,EAAMC,EAAQ,MAC7C,MAEMC,EAAY,IAFFH,EAAUI,QAAQ,IAAK,QACxBH,EAAKG,QAAQ,IAAK,QAGjC,MAAO,CACLC,KAAM,IAAIC,OAAO,KAAKN,MAAcC,OAAWC,GAC/CK,OAAQ,IAAID,OAAO,IAAIH,KAAcD,GACrCM,MAAO,IAAIF,OAAO,IAAIH,QAAgBA,OAAgBD,GACtDO,QAAS,IAAIH,OAAO,KAAKL,OAAWC,GACpCQ,SAAU,IAAIJ,OAAO,KAAKL,cAAiBA,SAAaC,KAItDS,EAAYZ,EAAaH,EAnE7BA,sBAoEIgB,EAAYb,EAAaF,EAAiBC,EAAY,KAuBtDe,EAAqB,WAGrBC,EAAef,EAAac,EAFZA,EAAqB,aAIrCE,EAAaA,CAACC,EAAa,MAAOC,GAAY,IAC9CA,EAAkBH,EACA,QAAfE,EAAuBJ,EAAYD,EAe/BN,EAAOA,CAACa,GAAOF,aAAa,MAAOC,aAAY,GAAU,CAAC,IACrEF,EAAWC,EAAYC,GAAWZ,KAAKc,KAAKD,GAsExCE,EAAc,CAAC,OAAQ,SAAU,QAAS,UAAW,YAa9CC,EAAkBA,CAACC,GAAcN,aAAa,MAAOC,aAAY,EAAOM,eAAe,MAAS,CAAC,KAC5G,IAAKH,EAAYI,SAASF,GACxB,MAAM,IAAIG,UACR,uBAAuBH,uBAAgCF,EAAYM,KAAK,SAI5E,MAAMC,EAAQZ,EAAWC,EAAYC,GAAWK,GAChD,IAAIM,EAAQ,IAAIC,IAEhB,MAAMC,EAAaZ,IACjB,MAAMa,EAASH,EAAMzC,IAAI+B,GACzB,QAAec,IAAXD,EAAsB,OAAOA,EAEjC,MAAME,EAASN,EAAMR,KAAKD,GAE1B,OADIU,EAAMM,KAAOX,GAAcK,EAAMO,IAAIjB,EAAKe,GACvCA,GAKT,OAFAH,EAAUM,MAAQ,KAAQR,EAAQ,IAAIC,KAE/BC,GClQT,IAAMO,EAAiB,CACnBC,eAAgBC,IAChBC,cAAeD,KAGEE,EAAgB,WACjC,SAAAA,EAAYC,EAAS1B,QAAU,IAAVA,IAAAA,EAAa,OAC9BrC,KAAK+D,QAAU1D,OAAO2D,OAAO,CAAC,EAAGN,EAAgBK,GACjD/D,KAAKiE,uBAAyBF,EAC9B/D,KAAKqC,WAAaA,CACtB,CAAC,IAAA6B,EAAAJ,EAAAnD,UAwOA,OAxOA,EAEDwD,gBAAA,SAAgBC,EAASC,GACrB,GACuB,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,GAEZ,MAAM,IAAIC,MAAM,kCAGpBD,GAAK,EAML,IALA,IAAIE,EAAqB,EACrBC,GAAU,EACVC,GAAU,EACVC,EAAc,EAEXL,EAAID,EAAQO,OAAQN,IACvB,GAAmB,MAAfD,EAAQC,IAAeI,EAuBpB,GAAmB,MAAfL,EAAQC,IASf,GARII,EACuB,MAAnBL,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,KACtCI,GAAU,EACVF,KAGJA,IAEuB,IAAvBA,EAA0B,UACR,MAAfH,EAAQC,KACfG,GAAU,OAlCsB,CAChC,GAAIA,GAAWI,EAAOR,EAAS,UAAWC,GAAI,CAC1CA,GAAK,EAEL,IAAAQ,EADmB7E,KAAK8E,mBAAmBV,EAASC,EAAI,EAAGK,GAA1DA,EAAWG,EAAA,GAAER,EAACQ,EAAA,EAEnB,MAAO,GAAIL,GAAWI,EAAOR,EAAS,WAAYC,GAC9CA,GAAK,EACLA,EAAIrE,KAAK+E,oBAAoBX,EAASC,EAAI,OAEvC,IAAIG,GAAWI,EAAOR,EAAS,WAAYC,GAAI,CAClDA,GAAK,EACLA,EAAIrE,KAAKgF,oBAAoBZ,EAASC,EAAI,GAC1C,QACJ,CAAO,GAAIG,GAAWI,EAAOR,EAAS,YAAaC,GAC/CA,GAAK,EACLA,EAAIrE,KAAKiF,qBAAqBb,EAASC,EAAI,OAExC,KAAIO,EAAOR,EAAS,MAAOC,GAG9B,MAAM,IAAIC,MAAM,mBAFhBG,GAAU,CAGd,EACAF,GACJ,CAeJ,GAA2B,IAAvBA,EACA,MAAM,IAAID,MAAM,oBAGpB,OAAOD,CACX,EAAC,EAEDS,mBAAA,SAAmBV,EAASC,EAAGK,GAK3B,IADA,IAAMQ,EAHNb,EAAIc,EAAef,EAASC,GAIrBA,EAAID,EAAQO,SAAW,KAAKnC,KAAK4B,EAAQC,KAAsB,MAAfD,EAAQC,IAA6B,MAAfD,EAAQC,IACjFA,IAEJ,IAeIe,EAfEC,EAAajB,EAAQkB,UAAUJ,EAAWb,GAMhD,GALAkB,EAAaF,EAAYrF,KAAKqC,YAE9BgC,EAAIc,EAAef,EAASC,IAGvBrE,KAAKiE,sBAAuB,CAC7B,GAAkD,WAA9CG,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cAC5B,MAAM,IAAIlB,MAAM,uCACb,GAAmB,MAAfF,EAAQC,GACf,MAAM,IAAIC,MAAM,uCAExB,CAGgB,IAAAmB,EACGC,EAAgBtB,EAASC,EAAG,UAA9CA,EAACoB,EAAA,GAAEL,EAAWK,EAAA,GAEf,IAAAE,EAA0C3F,KAAK+D,QAAvCF,EAAa8B,EAAb9B,cAAeF,EAAcgC,EAAdhC,eAEvB,GAAIyB,EAAYT,OAASd,EACrB,MAAM,IAAIS,MAAM,WACDe,EAAU,WAAWD,EAAYT,OAAM,mCAAmCd,EAAa,KAK1G,IAAkC,IAA9BuB,EAAYQ,QAAQ,QACpBlB,EACkBf,EACd,MAAM,IAAIW,MAAM,iBACKI,EAAW,8BAA8Bf,EAAc,KAKpF,MAAO,CAACe,EAAaL,EAAI,EAC7B,EAAC,EAEDY,qBAAA,SAAqBb,EAASC,GAK1B,IADA,IAAMa,EAHNb,EAAIc,EAAef,EAASC,GAIrBA,EAAID,EAAQO,SAAW,KAAKnC,KAAK4B,EAAQC,KAAKA,IACrD,IAAMwB,EAAezB,EAAQkB,UAAUJ,EAAWb,IACjDrE,KAAKiE,uBAAyBsB,EAAaM,EAAc7F,KAAKqC,YAE/DgC,EAAIc,EAAef,EAASC,GAE5B,IAAMyB,EAAiB1B,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cACnD,IAAKxF,KAAKiE,uBAA4C,WAAnB6B,GAAkD,WAAnBA,EAC9D,MAAM,IAAIxB,MAAM,qCAAqCwB,EAAc,KAevE,OAZAzB,EAAIc,EAAef,EADnBC,GAAKyB,EAAenB,QAGG,WAAnBmB,EAGmB,MAAf1B,EADJC,EAAIc,EAAef,EADlBC,EAAKqB,EAAgBtB,EAASC,EAAG,oBAAhC,MAEuC,MAAfD,EAAQC,KAC7BA,EAAKqB,EAAgBtB,EAASC,EAAG,oBAAhC,IAEoB,WAAnByB,IACNzB,EAAKqB,EAAgBtB,EAASC,EAAG,oBAAhC,MAGGA,CACb,EAAC,EAEDU,oBAAA,SAAoBX,EAASC,GAKzB,IADA,IAAMa,EAHNb,EAAIc,EAAef,EAASC,GAIrBA,EAAID,EAAQO,SAAW,KAAKnC,KAAK4B,EAAQC,KAAKA,IACrD,IAAM0B,EAAc3B,EAAQkB,UAAUJ,EAAWb,GACjD,IAAKrE,KAAKiE,wBAA0B+B,EAAUD,EAAa,CAAE1D,WAAYrC,KAAKqC,aAC1E,MAAM,IAAIiC,MAAM,0BAA0ByB,EAAW,KAMzD,GAAmB,MAAf3B,EAHJC,EAAIc,EAAef,EAASC,KAGFO,EAAOR,EAAS,OAAQC,GAC9CA,GAAK,OACF,GAAmB,MAAfD,EAAQC,IAAcO,EAAOR,EAAS,KAAMC,GACnDA,GAAK,OACF,GAAmB,MAAfD,EAAQC,GAAY,CAE3B,IADAA,IACOA,EAAID,EAAQO,QAAyB,MAAfP,EAAQC,IAAYA,IACjD,GAAmB,MAAfD,EAAQC,GAAY,MAAM,IAAIC,MAAM,6BAC5C,MAAO,IAAKtE,KAAKiE,sBACb,MAAM,IAAIK,MAAM,sCAAsCF,EAAQC,GAAE,KAGpE,OAAOA,CACX,EAAC,EAEDW,oBAAA,SAAoBZ,EAASC,GAKzB,IADA,IAAM4B,EAHN5B,EAAIc,EAAef,EAASC,GAIrBA,EAAID,EAAQO,SAAW,KAAKnC,KAAK4B,EAAQC,KAAKA,IAErDkB,EADoBnB,EAAQkB,UAAUW,EAAe5B,GAC3BrE,KAAKqC,YAM/B,IADA,IAAM6D,EAHN7B,EAAIc,EAAef,EAASC,GAIrBA,EAAID,EAAQO,SAAW,KAAKnC,KAAK4B,EAAQC,KAAKA,IAOrD,GALAkB,EADsBnB,EAAQkB,UAAUY,EAAe7B,GAC3BrE,KAAKqC,YAEjCgC,EAAIc,EAAef,EAASC,GAGsB,aAA9CD,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cAA8B,CAG1D,GAAmB,MAAfpB,EADJC,EAAIc,EAAef,EADnBC,GAAK,IAEmB,MAAM,IAAIC,MAAM,yBAAwBF,EAAQC,GAAE,KAE1E,IADAA,IACOA,EAAID,EAAQO,QAAyB,MAAfP,EAAQC,IAAY,CAE7C,IADA,IAAM8B,EAAgB9B,EACfA,EAAID,EAAQO,QAAyB,MAAfP,EAAQC,IAA6B,MAAfD,EAAQC,IAAYA,IAEvEkB,EADiBnB,EAAQkB,UAAUa,EAAe9B,GAAG+B,OAC9BpG,KAAKqC,YACT,MAAf+B,EAAQC,KAERA,EAAIc,EAAef,IADnBC,GAGR,CACA,GAAmB,MAAfD,EAAQC,GAAY,MAAM,IAAIC,MAAM,kCACxCD,GACJ,KAAO,CAEH,IADA,IAAMgC,EAAYhC,EACXA,EAAID,EAAQO,SAAW,KAAKnC,KAAK4B,EAAQC,KAAKA,IACrD,IAAMiC,EAAgBlC,EAAQkB,UAAUe,EAAWhC,GAEnD,IAAKrE,KAAKiE,wBADS,CAAC,QAAS,KAAM,QAAS,SAAU,SAAU,WAAY,UAAW,YACxCpB,SAASyD,EAAcd,eAClE,MAAM,IAAIlB,MAAM,4BAA4BgC,EAAa,IAEjE,CAaA,OAXAjC,EAAIc,EAAef,EAASC,GAGsB,cAA9CD,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cAC5BnB,GAAK,EACgD,aAA9CD,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cACnCnB,GAAK,EAEJA,EAAKqB,EAAgBtB,EAASC,EAAG,yBAAhC,GAGCA,CACX,EAACP,CAAA,CA7OgC,GAkPrC,SAASqB,EAAeoB,EAAMC,GAC1B,KAAOA,EAAQD,EAAK5B,QAAU,KAAKnC,KAAK+D,EAAKC,KAASA,IACtD,OAAOA,CACX,CAEA,SAAS5B,EAAO2B,EAAME,EAAKpC,GACvB,IAAK,IAAIqC,EAAI,EAAGA,EAAID,EAAI9B,OAAQ+B,IAC5B,GAAID,EAAIC,KAAOH,EAAKlC,EAAIqC,EAAI,GAAI,OAAO,EAE3C,OAAO,CACX,CAEA,SAASnB,EAAa7D,EAAMW,GACxB,QADkC,IAAVA,IAAAA,EAAa,QAChC2D,EAAUtE,EAAM,CAAEW,WAAAA,IAAe,MAAM,IAAIiC,MAAM,wBAAwB5C,EAAI,IACtF,CAKA,SAASgE,EAAgBtB,EAASC,EAAGsC,GACjC,IAAMtF,EAAY+C,EAAQC,GAC1B,GAAkB,MAAdhD,GAAmC,MAAdA,EACrB,MAAM,IAAIiD,MAAM,8BAA8BqC,EAAI,YAAYtF,EAAS,KAI3E,IADA,IAAMuF,IADNvC,EAEOA,EAAID,EAAQO,QAAUP,EAAQC,KAAOhD,GAAWgD,IACvD,GAAID,EAAQC,KAAOhD,EAAW,MAAM,IAAIiD,MAAM,gBAAgBqC,EAAI,UAClE,IAAM3F,EAAQoD,EAAQkB,UAAUsB,EAAOvC,GACvC,MAAO,GAAGA,EAAGrD,EACjB,C,4lCCvRqB6F,EAAe,SAAAC,GAClC,SAAAD,EAAYE,EAASC,EAAMC,EAAMC,GAAM,IAADC,EAMc,OALlDA,EAAAL,EAAAjG,KAAA,KAAMkG,IAAQ,MACTrF,KAAOyF,EAAKC,YAAY1F,KAC7ByF,EAAKH,KAAOA,EACZG,EAAKF,KAAOA,EACZE,EAAKD,IAAMA,EACY,MAAvB5C,MAAM+C,mBAAN/C,MAAM+C,kBAAiBF,EAASA,EAAKC,aAAaD,CACpD,C,QAAC,O,EAAAL,G,EAAAD,G,sEAAAA,CAAA,CARiC,CAQjCS,EAR0ChD,QCOvCZ,EAAiB,CACrB6D,wBAAwB,EACxBC,aAAc,GAEdC,QAAS,CACP9D,eAAgBC,IAChBC,cAAeD,MAwNnB,SAAS8D,EAAapG,GACpB,MAAgB,MAATA,GAAyB,OAATA,GAA0B,OAATA,GAA0B,OAATA,CAC3D,CAEA,SAASqG,EAAOvD,EAASC,EAAGuD,GAK1B,IAJA,IAAMC,EAAUxD,EACVa,EAAYb,EACdyD,GAAgB,EAEbzD,EAAID,EAAQO,OAAQN,IAAK,CAC9B,IAAM0D,EAAK3D,EAAQC,GAEnB,IAAKyD,IAAyB,MAAPC,GAAqB,MAAPA,GAAa,CAEhD,IAAMC,EAAS5D,EAAQ6D,OAAO/C,EAAWb,EAAIa,GAC7C4C,GAAgB,EAEa,QAAzBE,EAAOE,cACTC,EACE,aACA,6DACAC,EAAyBhE,EAASyD,EAAU,IAEpCD,EAAcI,IAExBG,EACE,aAAa,kCACqBH,EAAM,6BACxCI,EAAyBhE,EAASyD,EAAU,GAGlD,CAEA,GAAW,MAAPE,GAAiC,MAAnB3D,EAAQC,EAAI,GAE5B,QADAA,CAGJ,CAGA8D,EACE,aACA,kDACAC,EAAyBhE,EAASyD,EAAU,GAEhD,CASA,SAASQ,EAAoBjE,EAASC,EAAGiE,GACvC,GAAIlE,EAAQO,OAASN,EAAI,GAAwB,MAAnBD,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,GAAY,CAE9E,IAAKA,GAAK,EAAGA,EAAID,EAAQO,OAAQN,IAC/B,GAAmB,MAAfD,EAAQC,IAAiC,MAAnBD,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,GAAY,CAC1EA,GAAK,EACL,KACF,CAEF,GAAmB,MAAfD,EAAQC,GACV,MAAM,IAAIC,MAAM,uCAEpB,MAAO,GACLF,EAAQO,OAASN,EAAI,GACF,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,GAIZA,EAAIiE,EAAiBnE,gBAAgBC,EAASC,EAAI,OAC7C,MACLD,EAAQO,OAASN,EAAI,GACF,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IAeZ,MAAM,IAAIC,MAAM,yCAZhB,IAAKD,GAAK,EAAGA,EAAID,EAAQO,OAAQN,IAC/B,GAAmB,MAAfD,EAAQC,IAAiC,MAAnBD,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,GAAY,CAC1EA,GAAK,EACL,KACF,CAEF,GAAmB,MAAfD,EAAQC,GACV,MAAM,IAAIC,MAAM,0CAMpB,CAEA,OAAOD,CACT,CAEA,IAAMkE,EAAc,IACdC,EAAc,IAOpB,SAASC,EAAiBrE,EAASC,GAIjC,IAHA,IAAIqE,EAAU,GACVrH,EAAY,GACZsH,GAAY,EACTtE,EAAID,EAAQO,OAAQN,IAAK,CAC9B,GAAID,EAAQC,KAAOkE,GAAenE,EAAQC,KAAOmE,EAC7B,KAAdnH,EACFA,EAAY+C,EAAQC,GACXhD,IAAc+C,EAAQC,KAG/BhD,EAAY,SAET,GAAmB,MAAf+C,EAAQC,IACC,KAAdhD,EAAkB,CACpBsH,GAAY,EACZ,KACF,CAEFD,GAAWtE,EAAQC,EACrB,CACA,MAAkB,KAAdhD,GAGG,CAAEL,MAAO0H,EAASlC,MAAOnC,EAAGsE,UAAAA,EACrC,CAEA,IAAMC,EAAoB,IAAIjH,OAAO,0DAA2D,KAEhG,SAASkH,EAAwBH,EAAS3E,EAAS+E,EAAgBzG,GAIjE,IAHA,IAAM0G,ECrXD,SAAuBC,EAAQhG,GAGpC,IAFA,IAAM+F,EAAU,GACZE,EAAQjG,EAAMkG,KAAKF,GAChBC,GAAO,CACZ,IAAME,EAAa,GACnBA,EAAWC,WAAapG,EAAMqG,UAAYJ,EAAM,GAAGtE,OAEnD,IADA,IAAM2E,EAAML,EAAMtE,OACT6B,EAAQ,EAAGA,EAAQ8C,EAAK9C,IAC/B2C,EAAWI,KAAKN,EAAMzC,IAExBuC,EAAQQ,KAAKJ,GACbF,EAAQjG,EAAMkG,KAAKF,EACrB,CACA,OAAOD,CACT,CDuWkBS,CAAcd,EAASE,GACjCa,EAAY,CAAC,EAEVpF,EAAI,EAAGA,EAAI0E,EAAQpE,OAAQN,IAAK,CACvC,GAA6B,IAAzB0E,EAAQ1E,GAAG,GAAGM,OAChB,MAAO,CAAE+E,IAAK,CAAE1C,KAAM,cAAe2C,IAAK,cAAgBZ,EAAQ1E,GAAG,GAAK,8BAA+B4C,KAAM2C,EAAqBb,EAAQ1E,MACvI,QAAsBhB,IAAlB0F,EAAQ1E,GAAG,SAAsChB,IAAlB0F,EAAQ1E,GAAG,GACnD,MAAO,CAAEqF,IAAK,CAAE1C,KAAM,cAAe2C,IAAK,cAAgBZ,EAAQ1E,GAAG,GAAK,sBAAuB4C,KAAM2C,EAAqBb,EAAQ1E,MAC/H,QAAsBhB,IAAlB0F,EAAQ1E,GAAG,KAAqBN,EAAQwD,uBACjD,MAAO,CAAEmC,IAAK,CAAE1C,KAAM,cAAe2C,IAAK,sBAAwBZ,EAAQ1E,GAAG,GAAK,oBAAqB4C,KAAM2C,EAAqBb,EAAQ1E,MAG5I,IAAMwF,EAAWd,EAAQ1E,GAAG,GAI5B,IAAKyE,EAAee,GAClB,MAAO,CAAEH,IAAK,CAAE1C,KAAM,cAAe2C,IAAK,cAAgBE,EAAW,wBAAyB5C,KAAM2C,EAAqBb,EAAQ1E,MAInI,GAAIwF,EAASC,WAAW,WAA+B,KAAlBf,EAAQ1E,GAAG,IAA4B,QAAfhC,EAC3D,MAAO,CACLqH,IAAK,CACH1C,KAAM,cACN2C,IAAI,sCAAuCE,EAAQ,8CACnD5C,KAAM2C,EAAqBb,EAAQ1E,MAKzC,GAAKhE,OAAOM,UAAUC,eAAeC,KAAK4I,EAAWI,GAGnD,MAAO,CAAEH,IAAK,CAAE1C,KAAM,cAAe2C,IAAK,cAAgBE,EAAW,iBAAkB5C,KAAM2C,EAAqBb,EAAQ1E,MAF1HoF,EAAUI,GAAY,CAI1B,CAEA,OAAO,CACT,CAeA,SAASE,EAAkB3F,EAASC,GAElC,GAAmB,MAAfD,IADJC,GACwB,OAAQ,EAChC,GAAmB,MAAfD,EAAQC,GAEV,OAlBJ,SAAiCD,EAASC,GACxC,IAAI2F,EAAK,KAKT,IAJmB,MAAf5F,EAAQC,KACVA,IACA2F,EAAK,cAEA3F,EAAID,EAAQO,OAAQN,IAAK,CAC9B,GAAmB,MAAfD,EAAQC,GAAY,OAAOA,EAC/B,IAAKD,EAAQC,GAAG4E,MAAMe,GAAK,KAC7B,CACA,OAAQ,CACV,CAOWC,CAAwB7F,IAD/BC,GAIF,IADA,IAAI6F,EAAQ,EACL7F,EAAID,EAAQO,OAAQN,IAAK6F,IAC9B,KAAI9F,EAAQC,GAAG4E,MAAM,OAASiB,EAAQ,IAAtC,CACA,GAAmB,MAAf9F,EAAQC,GAAY,MACxB,OAAQ,CAF0C,CAIpD,OAAOA,CACT,CAEA,SAAS8D,EAAWnB,EAAMD,EAASoD,GACjC,MAAM,IAAItD,EAAgBE,EAASC,EAAMmD,EAAWlD,MAAQkD,EAAYA,EAAWjD,IACrF,CAEA,SAASkB,EAAyBhE,EAASoC,GACzC,IAAM4D,EAAQhG,EAAQkB,UAAU,EAAGkB,GAAO6D,MAAM,SAChD,MAAO,CACLpD,KAAMmD,EAAMzF,OACZuC,IAAKkD,EAAMA,EAAMzF,OAAS,GAAGA,OAAS,EAE1C,CAEA,SAASiF,EAAqBX,GAC5B,OAAOA,EAAMG,WAAaH,EAAM,GAAGtE,MACrC,CEzcA,MAAM2F,EAAgB,gLAGhBC,EAAY,IAAI5I,OAAO,KADG2I,EAAgB,KAD/BA,EAEY,mDAEtB,SAASd,EAAcR,EAAQhG,GACpC,MAAM+F,EAAU,GAChB,IAAIE,EAAQjG,EAAMkG,KAAKF,GACvB,KAAOC,GAAO,CACZ,MAAME,EAAa,GACnBA,EAAWC,WAAapG,EAAMqG,UAAYJ,EAAM,GAAGtE,OACnD,MAAM2E,EAAML,EAAMtE,OAClB,IAAK,IAAI6B,EAAQ,EAAGA,EAAQ8C,EAAK9C,IAC/B2C,EAAWI,KAAKN,EAAMzC,IAExBuC,EAAQQ,KAAKJ,GACbF,EAAQjG,EAAMkG,KAAKF,EACrB,CACA,OAAOD,CACT,CAEO,MAAMyB,EAAS,SAAUxB,GAE9B,QAAQ,MADMuB,EAAUrB,KAAKF,GAE/B,EAqBayB,EAA2B,CAItC,iBACA,WACA,UACA,mBACA,mBACA,mBACA,oBAGWC,EAAqB,CAAC,YAAa,cAAe,aCzDzDC,EAA8BjJ,GAC9B+I,EAAyB5H,SAASnB,GAC7B,KAAOA,EAETA,EAIIgC,EAAiB,CAC5BkH,eAAe,EACfC,oBAAqB,KACrBC,qBAAqB,EACrBC,aAAc,QACdC,kBAAkB,EAClBC,gBAAgB,EAChB1D,wBAAwB,EAExB2D,eAAe,EACfC,qBAAqB,EACrBC,YAAY,EACZC,eAAe,EACfC,mBAAoB,CAClBC,KAAK,EACLC,cAAc,EACdC,WAAW,GAEbC,kBAAmB,SAAUC,EAASC,GACpC,OAAOA,CACT,EACAC,wBAAyB,SAAUhC,EAAU+B,GAC3C,OAAOA,CACT,EACAE,UAAW,GACXC,sBAAsB,EACtBC,QAASA,KAAM,EACfC,iBAAiB,EACjBzE,aAAc,GACd0E,iBAAiB,EACjBC,cAAc,EACdC,cAAe,KACfC,mBAAmB,EACnBC,cAAc,EACdC,kBAAkB,EAClBC,wBAAwB,EACxBC,UAAW,SAAUd,EAASe,EAAOC,GACnC,OAAOhB,CACT,EAEAiB,iBAAiB,EACjBC,cAAe,IACfC,qBAAqB,EACrBJ,OAAO,EACPK,oBAAqBpC,GAUvB,SAASqC,EAAqBC,EAAcC,GAC1C,GAA4B,iBAAjBD,EACT,OAGF,MAAME,EAAaF,EAAa/E,cAChC,GAAIuC,EAAyB2C,KAAKC,GAAaF,IAAeE,EAAUnF,eACtE,MAAM,IAAI5D,MACR,sBAAsB4I,OAAgBD,4EAI1C,GAAIvC,EAAmB0C,KAAKC,GAAaF,IAAeE,EAAUnF,eAChE,MAAM,IAAI5D,MACR,sBAAsB4I,OAAgBD,2EAG5C,CAOA,SAASK,EAAyBtM,EAAOmL,GAEvC,MAAqB,kBAAVnL,EACF,CACLuM,QAASvM,EACT6C,cAAe,IACf2J,kBAAmB,IACnBC,mBAAoB7J,IACpB8J,kBAAmB,IACnB/J,eAAgB,IAChBgK,YAAa,KACbC,UAAW,KACXC,UAAW,OAKM,iBAAV7M,GAAgC,OAAVA,EACxB,CACLuM,SAA2B,IAAlBvM,EAAMuM,QACf1J,cAAeiK,KAAKC,IAAI,EAAG/M,EAAM6C,eAAiB,KAClD2J,kBAAmBM,KAAKC,IAAI,EAAG/M,EAAMwM,mBAAqB,KAC1DC,mBAAoBK,KAAKC,IAAI,EAAG/M,EAAMyM,oBAAsB7J,KAC5D8J,kBAAmBI,KAAKC,IAAI,EAAG/M,EAAM0M,mBAAqB,KAC1D/J,eAAgBmK,KAAKC,IAAI,EAAG/M,EAAM2C,gBAAkB,KACpDgK,YAAa3M,EAAM2M,aAAe,KAClCC,UAAW5M,EAAM4M,WAAa,KAC9BC,UAAW7M,EAAM6M,WAAa,OAK3BP,GAAyB,EAClC,CAEO,MAAMU,EAAe,SAAUjK,GACpC,MAAMkK,EAAQ5N,OAAO2D,OAAO,CAAC,EAAGN,EAAgBK,GAG1CmK,EAAsB,CAC1B,CAAElN,MAAOiN,EAAMpD,oBAAqBnJ,KAAM,uBAC1C,CAAEV,MAAOiN,EAAMnD,oBAAqBpJ,KAAM,uBAC1C,CAAEV,MAAOiN,EAAMlD,aAAcrJ,KAAM,gBACnC,CAAEV,MAAOiN,EAAM5C,cAAe3J,KAAM,iBACpC,CAAEV,MAAOiN,EAAMhC,gBAAiBvK,KAAM,oBAGxC,IAAK,MAAM,MAAEV,EAAK,KAAEU,KAAUwM,EACxBlN,GACFgM,EAAqBhM,EAAOU,GAuBhC,OAnBkC,OAA9BuM,EAAMlB,sBACRkB,EAAMlB,oBAAsBpC,GAI9BsD,EAAM/B,gBAAkBoB,EAAyBW,EAAM/B,gBAAiB+B,EAAM9B,cAC9E8B,EAAME,gBAAkB,IAAIC,IAAIH,EAAMzG,cAElCyG,EAAMnC,WAAauC,MAAMrC,QAAQiC,EAAMnC,aACzCmC,EAAMnC,UAAYmC,EAAMnC,UAAUwC,IAAIC,GAChB,iBAATA,GAAqBA,EAAKzE,WAAW,MAGvC,KAAOyE,EAAKjJ,UAAU,GAExBiJ,IAIJN,CACT,EChKA,IAAIO,EAGFA,EADoB,mBAAX1N,OACS,gBAEAA,OAAO,qBAGZ,MAAM2N,EACnBrH,WAAAA,CAAYsH,GACV1O,KAAK0O,QAAUA,EACf1O,KAAK2O,MAAQ,GACb3O,KAAK,MAAQK,OAAOuO,OAAO,KAC7B,CACAC,GAAAA,CAAI1O,EAAKyL,GAEK,cAARzL,IAAqBA,EAAM,cAC/BH,KAAK2O,MAAMpF,KAAK,CAAE,CAACpJ,GAAMyL,GAC3B,CACAkD,QAAAA,CAASP,EAAMnF,GACQ,cAAjBmF,EAAKG,UAAyBH,EAAKG,QAAU,cAC7CH,EAAK,OAASlO,OAAO0O,KAAKR,EAAK,OAAO5J,OAAS,EACjD3E,KAAK2O,MAAMpF,KAAK,CAAE,CAACgF,EAAKG,SAAUH,EAAKI,MAAO,KAAQJ,EAAK,QAE3DvO,KAAK2O,MAAMpF,KAAK,CAAE,CAACgF,EAAKG,SAAUH,EAAKI,aAGtBtL,IAAf+F,IAGFpJ,KAAK2O,MAAM3O,KAAK2O,MAAMhK,OAAS,GAAG6J,GAAmB,CAAEpF,cAE3D,CAEA,wBAAO4F,GACL,OAAOR,CACT,ECpCa,MAAMS,EACjB7H,WAAAA,CAAYrD,GACR/D,KAAKiE,uBAAyBF,EAC9B/D,KAAK+D,QAAUA,CACnB,CAEAmL,WAAAA,CAAY9K,EAASC,GACjB,MAAM8K,EAAW9O,OAAOuO,OAAO,MAC/B,IAAIlK,EAAc,EAElB,GAAuB,MAAnBN,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,GAgEZ,MAAM,IAAIC,MAAM,kCAhEQ,CACxBD,GAAQ,EACR,IAAIE,EAAqB,EACrBC,GAAU,EAAOC,GAAU,EAC3B2K,EAAM,GACV,KAAO/K,EAAID,EAAQO,OAAQN,IACvB,GAAmB,MAAfD,EAAQC,IAAeI,EAoCpB,GAAmB,MAAfL,EAAQC,IASf,GARII,EACuB,MAAnBL,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,KACtCI,GAAU,EACVF,KAGJA,IAEuB,IAAvBA,EACA,UAEkB,MAAfH,EAAQC,GACfG,GAAU,EAEV4K,GAAOhL,EAAQC,OAnDiB,CAChC,GAAIG,GAAWI,EAAOR,EAAS,UAAWC,GAAI,CAE1C,IAAIgB,EAAYuG,EAEhB,GAHAvH,GAAK,GAEJgB,EAAYuG,EAAKvH,GAAKrE,KAAKqP,cAAcjL,EAASC,EAAI,EAAGrE,KAAKiE,wBACrC,IAAtB2H,EAAIhG,QAAQ,KAAa,CACzB,IAA6B,IAAzB5F,KAAK+D,QAAQwJ,SACkB,MAA/BvN,KAAK+D,QAAQJ,gBACbe,GAAe1E,KAAK+D,QAAQJ,eAC5B,MAAM,IAAIW,MACN,iBAAiBI,EAAc,+BAA+B1E,KAAK+D,QAAQJ,mBAKnFwL,EAAS9J,GAAcuG,EACvBlH,GACJ,CACJ,MACK,GAAIF,GAAWI,EAAOR,EAAS,WAAYC,GAAI,CAChDA,GAAK,EACL,MAAM,MAAEmC,GAAUxG,KAAKsP,eAAelL,EAASC,EAAI,GACnDA,EAAImC,CACR,MAAO,GAAIhC,GAAWI,EAAOR,EAAS,WAAYC,GAC9CA,GAAK,OAGF,GAAIG,GAAWI,EAAOR,EAAS,YAAaC,GAAI,CACnDA,GAAK,EACL,MAAM,MAAEmC,GAAUxG,KAAKuP,gBAAgBnL,EAASC,EAAI,EAAGrE,KAAKiE,uBAC5DI,EAAImC,CACR,KAAO,KAAI5B,EAAOR,EAAS,MAAOC,GAC7B,MAAM,IAAIC,MAAM,mBADiBG,GAAU,CACT,CAEvCF,IACA6K,EAAM,EACV,CAkBJ,GAA2B,IAAvB7K,EACA,MAAM,IAAID,MAAM,mBAExB,CAGA,MAAO,CAAE6K,WAAU9K,IACvB,CACAgL,aAAAA,CAAcjL,EAASC,GAcnB,MAAM+E,EAHN/E,EAAIc,EAAef,EAASC,GAI5B,KAAOA,EAAID,EAAQO,SAAW,KAAKnC,KAAK4B,EAAQC,KAAsB,MAAfD,EAAQC,IAA6B,MAAfD,EAAQC,IACjFA,IAEJ,IAAIgB,EAAajB,EAAQkB,UAAU8D,EAAY/E,GAQ/C,GANAmL,GAAmBnK,GAGnBhB,EAAIc,EAAef,EAASC,IAGvBrE,KAAKiE,sBAAuB,CAC7B,GAAkD,WAA9CG,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cAC5B,MAAM,IAAIlB,MAAM,uCACb,GAAmB,MAAfF,EAAQC,GACf,MAAM,IAAIC,MAAM,uCAExB,CAGA,IAAIc,EAAc,GAIlB,IAHCf,EAAGe,GAAepF,KAAKyP,kBAAkBrL,EAASC,EAAG,WAGzB,IAAzBrE,KAAK+D,QAAQwJ,SACiB,MAA9BvN,KAAK+D,QAAQF,eACbuB,EAAYT,OAAS3E,KAAK+D,QAAQF,cAClC,MAAM,IAAIS,MACN,WAAWe,YAAqBD,EAAYT,yCAAyC3E,KAAK+D,QAAQF,kBAK1G,MAAO,CAACwB,EAAYD,IADpBf,EAEJ,CAEAkL,eAAAA,CAAgBnL,EAASC,GAMrB,MAAM+E,EAJN/E,EAAIc,EAAef,EAASC,GAK5B,KAAOA,EAAID,EAAQO,SAAW,KAAKnC,KAAK4B,EAAQC,KAC5CA,IAEJ,IAAIwB,EAAezB,EAAQkB,UAAU8D,EAAY/E,IAEhDrE,KAAKiE,uBAAyBuL,GAAmB3J,GAGlDxB,EAAIc,EAAef,EAASC,GAG5B,MAAMyB,EAAiB1B,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cACnD,IAAKxF,KAAKiE,uBAA4C,WAAnB6B,GAAkD,WAAnBA,EAC9D,MAAM,IAAIxB,MAAM,qCAAqCwB,MAEzDzB,GAAKyB,EAAenB,OAGpBN,EAAIc,EAAef,EAASC,GAG5B,IAAIqL,EAAmB,KACnBC,EAAmB,KAEvB,GAAuB,WAAnB7J,GACCzB,EAAGqL,GAAoB1P,KAAKyP,kBAAkBrL,EAASC,EAAG,oBAMxC,MAAfD,EAHJC,EAAIc,EAAef,EAASC,KAGa,MAAfD,EAAQC,MAC7BA,EAAGsL,GAAoB3P,KAAKyP,kBAAkBrL,EAASC,EAAG,0BAE5D,GAAuB,WAAnByB,KAENzB,EAAGsL,GAAoB3P,KAAKyP,kBAAkBrL,EAASC,EAAG,qBAEtDrE,KAAKiE,wBAA0B0L,GAChC,MAAM,IAAIrL,MAAM,2DAIxB,MAAO,CAAEuB,eAAc6J,mBAAkBC,mBAAkBnJ,QAASnC,EACxE,CAEAoL,iBAAAA,CAAkBrL,EAASC,EAAGsC,GAC1B,IAAIiJ,EAAgB,GACpB,MAAMvO,EAAY+C,EAAQC,GAC1B,GAAkB,MAAdhD,GAAmC,MAAdA,EACrB,MAAM,IAAIiD,MAAM,kCAAkCjD,MAItD,MAAM+H,IAFN/E,EAGA,KAAOA,EAAID,EAAQO,QAAUP,EAAQC,KAAOhD,GACxCgD,IAIJ,GAFAuL,EAAgBxL,EAAQkB,UAAU8D,EAAY/E,GAE1CD,EAAQC,KAAOhD,EACf,MAAM,IAAIiD,MAAM,gBAAgBqC,WAGpC,MAAO,GADPtC,EACWuL,EACf,CAEAN,cAAAA,CAAelL,EAASC,GAWpB,MAAM+E,EAHN/E,EAAIc,EAAef,EAASC,GAI5B,KAAOA,EAAID,EAAQO,SAAW,KAAKnC,KAAK4B,EAAQC,KAC5CA,IAEJ,IAAI0B,EAAc3B,EAAQkB,UAAU8D,EAAY/E,GAGhD,IAAKrE,KAAKiE,wBAA0BuG,EAAOzE,GACvC,MAAM,IAAIzB,MAAM,0BAA0ByB,MAK9C,IAAI8J,EAAe,GAEnB,GAAmB,MAAfzL,EAHJC,EAAIc,EAAef,EAASC,KAGFO,EAAOR,EAAS,OAAQC,GAAIA,GAAK,OACtD,GAAmB,MAAfD,EAAQC,IAAcO,EAAOR,EAAS,KAAMC,GAAIA,GAAK,OACzD,GAAmB,MAAfD,EAAQC,GAAY,CAIzB,MAAM+E,IAHN/E,EAIA,KAAOA,EAAID,EAAQO,QAAyB,MAAfP,EAAQC,IACjCA,IAIJ,GAFAwL,EAAezL,EAAQkB,UAAU8D,EAAY/E,GAE1B,MAAfD,EAAQC,GACR,MAAM,IAAIC,MAAM,6BAGxB,MAAO,IAAKtE,KAAKiE,sBACb,MAAM,IAAIK,MAAM,sCAAsCF,EAAQC,OAGlE,MAAO,CACH0B,cACA8J,aAAcA,EAAazJ,OAC3BI,MAAOnC,EAEf,CAEAyL,cAAAA,CAAe1L,EAASC,GAKpB,IAAI+E,EAHJ/E,EAAIc,EAAef,EAASC,GAI5B,KAAOA,EAAID,EAAQO,SAAW,KAAKnC,KAAK4B,EAAQC,KAC5CA,IAEJ,IAAI0B,EAAc3B,EAAQkB,UAAU8D,EAAY/E,GAUhD,IAPAmL,GAAmBzJ,GAMnBqD,EAHA/E,EAAIc,EAAef,EAASC,GAIrBA,EAAID,EAAQO,SAAW,KAAKnC,KAAK4B,EAAQC,KAC5CA,IAEJ,IAAI0L,EAAgB3L,EAAQkB,UAAU8D,EAAY/E,GAGlD,IAAKmL,GAAmBO,GACpB,MAAM,IAAIzL,MAAM,4BAA4ByL,MAIhD1L,EAAIc,EAAef,EAASC,GAG5B,IAAIiC,EAAgB,GACpB,GAAkD,aAA9ClC,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,cAA8B,CAQ1D,GAPAc,EAAgB,WAOG,MAAflC,EAHJC,EAAIc,EAAef,EAHnBC,GAAK,IAOD,MAAM,IAAIC,MAAM,wBAAwBF,EAAQC,OAEpDA,IAGA,IAAI2L,EAAmB,GACvB,KAAO3L,EAAID,EAAQO,QAAyB,MAAfP,EAAQC,IAAY,CAG7C,MAAM+E,EAAa/E,EACnB,KAAOA,EAAID,EAAQO,QAAyB,MAAfP,EAAQC,IAA6B,MAAfD,EAAQC,IACvDA,IAEJ,IAAI4L,EAAW7L,EAAQkB,UAAU8D,EAAY/E,GAI7C,GADA4L,EAAWA,EAAS7J,QACfoJ,GAAmBS,GACpB,MAAM,IAAI3L,MAAM,2BAA2B2L,MAG/CD,EAAiBzG,KAAK0G,GAGH,MAAf7L,EAAQC,KACRA,IACAA,EAAIc,EAAef,EAASC,GAEpC,CAEA,GAAmB,MAAfD,EAAQC,GACR,MAAM,IAAIC,MAAM,kCAEpBD,IAGAiC,GAAiB,KAAO0J,EAAiBjN,KAAK,KAAO,GACzD,KAAO,CAEH,MAAMqG,EAAa/E,EACnB,KAAOA,EAAID,EAAQO,SAAW,KAAKnC,KAAK4B,EAAQC,KAC5CA,IAEJiC,GAAiBlC,EAAQkB,UAAU8D,EAAY/E,GAG/C,MAAM6L,EAAa,CAAC,QAAS,KAAM,QAAS,SAAU,SAAU,WAAY,UAAW,YACvF,IAAKlQ,KAAKiE,wBAA0BiM,EAAWrN,SAASyD,EAAcd,eAClE,MAAM,IAAIlB,MAAM,4BAA4BgC,KAEpD,CAGAjC,EAAIc,EAAef,EAASC,GAG5B,IAAI8L,EAAe,GAWnB,MAVkD,cAA9C/L,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,eAC5B2K,EAAe,YACf9L,GAAK,GACgD,aAA9CD,EAAQkB,UAAUjB,EAAGA,EAAI,GAAGmB,eACnC2K,EAAe,WACf9L,GAAK,IAEJA,EAAG8L,GAAgBnQ,KAAKyP,kBAAkBrL,EAASC,EAAG,WAGpD,CACH0B,cACAgK,gBACAzJ,gBACA6J,eACA3J,MAAOnC,EAEf,EAKJ,MAAMc,EAAiBA,CAACoB,EAAMC,KAC1B,KAAOA,EAAQD,EAAK5B,QAAU,KAAKnC,KAAK+D,EAAKC,KACzCA,IAEJ,OAAOA,GAKX,SAAS5B,EAAO2B,EAAME,EAAKpC,GACvB,IAAK,IAAIqC,EAAI,EAAGA,EAAID,EAAI9B,OAAQ+B,IAC5B,GAAID,EAAIC,KAAOH,EAAKlC,EAAIqC,EAAI,GAAI,OAAO,EAE3C,OAAO,CACX,CAEA,SAAS8I,GAAmB9N,GACxB,GAAI8I,EAAO9I,GACP,OAAOA,EAEP,MAAM,IAAI4C,MAAM,uBAAuB5C,IAC/C,CCtZA,MAAM0O,GAAW,wBACXC,GAAW,qCAKXC,GAAW,CACb/E,KAAK,EAELC,cAAc,EACd+E,aAAc,IACd9E,WAAW,EAEX+E,SAAU,YAuEd,MAAMC,GAAgB,0CC/Df,MAAMC,GAIXtJ,WAAAA,CAAYuJ,GACV3Q,KAAK4Q,SAAWD,CAClB,CAMA,aAAIE,GACF,OAAO7Q,KAAK4Q,SAASC,SACvB,CAMAC,aAAAA,GACE,MAAMC,EAAO/Q,KAAK4Q,SAASG,KAC3B,OAAOA,EAAKpM,OAAS,EAAIoM,EAAKA,EAAKpM,OAAS,GAAGqM,SAAM3N,CACvD,CAMA4N,mBAAAA,GACE,MAAMF,EAAO/Q,KAAK4Q,SAASG,KAC3B,OAAOA,EAAKpM,OAAS,EAAIoM,EAAKA,EAAKpM,OAAS,GAAGuM,eAAY7N,CAC7D,CAOA8N,YAAAA,CAAatH,GACX,MAAMkH,EAAO/Q,KAAK4Q,SAASG,KAC3B,GAAoB,IAAhBA,EAAKpM,OACT,OAAOoM,EAAKA,EAAKpM,OAAS,GAAGyM,SAASvH,EACxC,CAOAwH,OAAAA,CAAQxH,GACN,MAAMkH,EAAO/Q,KAAK4Q,SAASG,KAC3B,GAAoB,IAAhBA,EAAKpM,OAAc,OAAO,EAC9B,MAAM2M,EAAUP,EAAKA,EAAKpM,OAAS,GACnC,YAA0BtB,IAAnBiO,EAAQF,QAAwBvH,KAAYyH,EAAQF,MAC7D,CAMAG,WAAAA,GACE,MAAMR,EAAO/Q,KAAK4Q,SAASG,KAC3B,OAAoB,IAAhBA,EAAKpM,QAAsB,EACxBoM,EAAKA,EAAKpM,OAAS,GAAG6M,UAAY,CAC3C,CAMAC,UAAAA,GACE,MAAMV,EAAO/Q,KAAK4Q,SAASG,KAC3B,OAAoB,IAAhBA,EAAKpM,QAAsB,EACxBoM,EAAKA,EAAKpM,OAAS,GAAG+M,SAAW,CAC1C,CAOAC,QAAAA,GACE,OAAO3R,KAAKuR,aACd,CAMAK,QAAAA,GACE,OAAO5R,KAAK4Q,SAASG,KAAKpM,MAC5B,CAQAkN,QAAAA,CAAShB,EAAWiB,GAAmB,GACrC,OAAO9R,KAAK4Q,SAASiB,SAAShB,EAAWiB,EAC3C,CAMAC,OAAAA,GACE,OAAO/R,KAAK4Q,SAASG,KAAKzC,IAAI0D,GAAKA,EAAEhB,IACvC,CAOAjI,OAAAA,CAAQkJ,GACN,OAAOjS,KAAK4Q,SAAS7H,QAAQkJ,EAC/B,CAOAC,UAAAA,CAAWC,GACT,OAAOA,EAAQD,WAAWlS,KAAK4Q,SACjC,EAsBa,MAAMwB,GAMnBhL,WAAAA,CAAYrD,EAAU,CAAC,GACrB/D,KAAK6Q,UAAY9M,EAAQ8M,WAAa,IACtC7Q,KAAK+Q,KAAO,GACZ/Q,KAAKqS,cAAgB,GAIrBrS,KAAKsS,iBAAmB,KACxBtS,KAAKuS,MAAQ,IAAI7B,GAAY1Q,KAC/B,CAQAuJ,IAAAA,CAAKoC,EAAS6G,EAAa,KAAMtB,EAAY,MAC3ClR,KAAKsS,iBAAmB,KAGpBtS,KAAK+Q,KAAKpM,OAAS,IACrB3E,KAAK+Q,KAAK/Q,KAAK+Q,KAAKpM,OAAS,GAAGyM,YAAS/N,GAI3C,MAAMoP,EAAezS,KAAK+Q,KAAKpM,OAC1B3E,KAAKqS,cAAcI,KACtBzS,KAAKqS,cAAcI,GAAgB,IAAIvP,KAGzC,MAAMwP,EAAW1S,KAAKqS,cAAcI,GAG9BE,EAAazB,EAAY,GAAGA,KAAavF,IAAYA,EAGrD+F,EAAUgB,EAASlS,IAAImS,IAAe,EAG5C,IAAInB,EAAW,EACf,IAAK,MAAMtH,KAASwI,EAAStB,SAC3BI,GAAYtH,EAIdwI,EAASlP,IAAImP,EAAYjB,EAAU,GAGnC,MAAMnD,EAAO,CACXyC,IAAKrF,EACL6F,SAAUA,EACVE,QAASA,GAGPR,UACF3C,EAAK2C,UAAYA,GAGfsB,UACFjE,EAAK6C,OAASoB,GAGhBxS,KAAK+Q,KAAKxH,KAAKgF,EACjB,CAMAqE,GAAAA,GACE,GAAyB,IAArB5S,KAAK+Q,KAAKpM,OAAc,OAC5B3E,KAAKsS,iBAAmB,KAExB,MAAM/D,EAAOvO,KAAK+Q,KAAK6B,MAMvB,OAJI5S,KAAKqS,cAAc1N,OAAS3E,KAAK+Q,KAAKpM,OAAS,IACjD3E,KAAKqS,cAAc1N,OAAS3E,KAAK+Q,KAAKpM,OAAS,GAG1C4J,CACT,CAOAsE,aAAAA,CAAcL,GACZ,GAAIxS,KAAK+Q,KAAKpM,OAAS,EAAG,CACxB,MAAM2M,EAAUtR,KAAK+Q,KAAK/Q,KAAK+Q,KAAKpM,OAAS,GACzC6N,UACFlB,EAAQF,OAASoB,EAErB,CACF,CAMA1B,aAAAA,GACE,OAAO9Q,KAAK+Q,KAAKpM,OAAS,EAAI3E,KAAK+Q,KAAK/Q,KAAK+Q,KAAKpM,OAAS,GAAGqM,SAAM3N,CACtE,CAMA4N,mBAAAA,GACE,OAAOjR,KAAK+Q,KAAKpM,OAAS,EAAI3E,KAAK+Q,KAAK/Q,KAAK+Q,KAAKpM,OAAS,GAAGuM,eAAY7N,CAC5E,CAOA8N,YAAAA,CAAatH,GACX,GAAyB,IAArB7J,KAAK+Q,KAAKpM,OACd,OAAO3E,KAAK+Q,KAAK/Q,KAAK+Q,KAAKpM,OAAS,GAAGyM,SAASvH,EAClD,CAOAwH,OAAAA,CAAQxH,GACN,GAAyB,IAArB7J,KAAK+Q,KAAKpM,OAAc,OAAO,EACnC,MAAM2M,EAAUtR,KAAK+Q,KAAK/Q,KAAK+Q,KAAKpM,OAAS,GAC7C,YAA0BtB,IAAnBiO,EAAQF,QAAwBvH,KAAYyH,EAAQF,MAC7D,CAMAG,WAAAA,GACE,OAAyB,IAArBvR,KAAK+Q,KAAKpM,QAAsB,EAC7B3E,KAAK+Q,KAAK/Q,KAAK+Q,KAAKpM,OAAS,GAAG6M,UAAY,CACrD,CAMAC,UAAAA,GACE,OAAyB,IAArBzR,KAAK+Q,KAAKpM,QAAsB,EAC7B3E,KAAK+Q,KAAK/Q,KAAK+Q,KAAKpM,OAAS,GAAG+M,SAAW,CACpD,CAOAC,QAAAA,GACE,OAAO3R,KAAKuR,aACd,CAMAK,QAAAA,GACE,OAAO5R,KAAK+Q,KAAKpM,MACnB,CAQAkN,QAAAA,CAAShB,EAAWiB,GAAmB,GACrC,MAAMgB,EAAMjC,GAAa7Q,KAAK6Q,UAG9B,GAFmBiC,IAAQ9S,KAAK6Q,YAAkC,IAArBiB,EAE9B,CACb,GAA8B,OAA1B9R,KAAKsS,iBACP,OAAOtS,KAAKsS,iBAEd,MAAMhP,EAAStD,KAAK+Q,KAAKzC,IAAI0D,GAC1BA,EAAEd,UAAa,GAAGc,EAAEd,aAAac,EAAEhB,MAAQgB,EAAEhB,KAC9CjO,KAAK+P,GAEP,OADA9S,KAAKsS,iBAAmBhP,EACjBA,CACT,CAEA,OAAOtD,KAAK+Q,KAAKzC,IAAI0D,GAClBF,GAAoBE,EAAEd,UAAa,GAAGc,EAAEd,aAAac,EAAEhB,MAAQgB,EAAEhB,KAClEjO,KAAK+P,EACT,CAMAf,OAAAA,GACE,OAAO/R,KAAK+Q,KAAKzC,IAAI0D,GAAKA,EAAEhB,IAC9B,CAKAvN,KAAAA,GACEzD,KAAKsS,iBAAmB,KACxBtS,KAAK+Q,KAAO,GACZ/Q,KAAKqS,cAAgB,EACvB,CAOAtJ,OAAAA,CAAQkJ,GACN,MAAMc,EAAWd,EAAWc,SAE5B,OAAwB,IAApBA,EAASpO,SAITsN,EAAWe,kBACNhT,KAAKiT,uBAAuBF,GAG9B/S,KAAKkT,aAAaH,GAC3B,CAKAG,YAAAA,CAAaH,GACX,GAAI/S,KAAK+Q,KAAKpM,SAAWoO,EAASpO,OAChC,OAAO,EAGT,IAAK,IAAIN,EAAI,EAAGA,EAAI0O,EAASpO,OAAQN,IACnC,IAAKrE,KAAKmT,cAAcJ,EAAS1O,GAAIrE,KAAK+Q,KAAK1M,GAAIA,IAAMrE,KAAK+Q,KAAKpM,OAAS,GAC1E,OAAO,EAIX,OAAO,CACT,CAKAsO,sBAAAA,CAAuBF,GACrB,IAAIK,EAAUpT,KAAK+Q,KAAKpM,OAAS,EAC7B0O,EAASN,EAASpO,OAAS,EAE/B,KAAO0O,GAAU,GAAKD,GAAW,GAAG,CAClC,MAAME,EAAUP,EAASM,GAEzB,GAAqB,kBAAjBC,EAAQ3M,KAA0B,CAGpC,GAFA0M,IAEIA,EAAS,EACX,OAAO,EAGT,MAAME,EAAUR,EAASM,GACzB,IAAIG,GAAQ,EAEZ,IAAK,IAAInP,EAAI+O,EAAS/O,GAAK,EAAGA,IAC5B,GAAIrE,KAAKmT,cAAcI,EAASvT,KAAK+Q,KAAK1M,GAAIA,IAAMrE,KAAK+Q,KAAKpM,OAAS,GAAI,CACzEyO,EAAU/O,EAAI,EACdgP,IACAG,GAAQ,EACR,KACF,CAGF,IAAKA,EACH,OAAO,CAEX,KAAO,CACL,IAAKxT,KAAKmT,cAAcG,EAAStT,KAAK+Q,KAAKqC,GAAUA,IAAYpT,KAAK+Q,KAAKpM,OAAS,GAClF,OAAO,EAETyO,IACAC,GACF,CACF,CAEA,OAAOA,EAAS,CAClB,CAKAF,aAAAA,CAAcG,EAAS/E,EAAMkF,GAC3B,GAAoB,MAAhBH,EAAQtC,KAAesC,EAAQtC,MAAQzC,EAAKyC,IAC9C,OAAO,EAGT,QAA0B3N,IAAtBiQ,EAAQpC,WACgB,MAAtBoC,EAAQpC,WAAqBoC,EAAQpC,YAAc3C,EAAK2C,UAC1D,OAAO,EAIX,QAAyB7N,IAArBiQ,EAAQzJ,SAAwB,CAClC,IAAK4J,EACH,OAAO,EAGT,IAAKlF,EAAK6C,UAAYkC,EAAQzJ,YAAY0E,EAAK6C,QAC7C,OAAO,EAGT,QAA0B/N,IAAtBiQ,EAAQI,WACNC,OAAOpF,EAAK6C,OAAOkC,EAAQzJ,aAAe8J,OAAOL,EAAQI,WAC3D,OAAO,CAGb,CAEA,QAAyBrQ,IAArBiQ,EAAQ9B,SAAwB,CAClC,IAAKiC,EACH,OAAO,EAGT,MAAM/B,EAAUnD,EAAKmD,SAAW,EAEhC,GAAyB,UAArB4B,EAAQ9B,UAAoC,IAAZE,EAClC,OAAO,EACF,GAAyB,QAArB4B,EAAQ9B,UAAsBE,EAAU,GAAM,EACvD,OAAO,EACF,GAAyB,SAArB4B,EAAQ9B,UAAuBE,EAAU,GAAM,EACxD,OAAO,EACF,GAAyB,QAArB4B,EAAQ9B,UAAsBE,IAAY4B,EAAQM,cAC3D,OAAO,CAEX,CAEA,OAAO,CACT,CAOA1B,UAAAA,CAAWC,GACT,OAAOA,EAAQD,WAAWlS,KAC5B,CAMA6T,QAAAA,GACE,MAAO,CACL9C,KAAM/Q,KAAK+Q,KAAKzC,IAAIC,IAAQ,IAAMA,KAClC8D,cAAerS,KAAKqS,cAAc/D,IAAIA,GAAO,IAAIpL,IAAIoL,IAEzD,CAMAwF,OAAAA,CAAQD,GACN7T,KAAKsS,iBAAmB,KACxBtS,KAAK+Q,KAAO8C,EAAS9C,KAAKzC,IAAIC,IAAQ,IAAMA,KAC5CvO,KAAKqS,cAAgBwB,EAASxB,cAAc/D,IAAIA,GAAO,IAAIpL,IAAIoL,GACjE,CAkBAyF,QAAAA,GACE,OAAO/T,KAAKuS,KACd,EC9iBa,MAAMyB,GAOnB5M,WAAAA,CAAY6M,EAASlQ,EAAU,CAAC,EAAGwC,GACjCvG,KAAKiU,QAAUA,EACfjU,KAAK6Q,UAAY9M,EAAQ8M,WAAa,IACtC7Q,KAAK+S,SAAW/S,KAAKkU,OAAOD,GAC5BjU,KAAKuG,KAAOA,EAEZvG,KAAKmU,iBAAmBnU,KAAK+S,SAAS3F,KAAKgH,GAAoB,kBAAbA,EAAIzN,MACtD3G,KAAKqU,uBAAyBrU,KAAK+S,SAAS3F,KAAKgH,QAAwB/Q,IAAjB+Q,EAAIvK,UAC5D7J,KAAKsU,qBAAuBtU,KAAK+S,SAAS3F,KAAKgH,QAAwB/Q,IAAjB+Q,EAAI5C,SAC5D,CAQA0C,MAAAA,CAAOD,GACL,MAAMlB,EAAW,GAGjB,IAAI1O,EAAI,EACJkQ,EAAc,GAElB,KAAOlQ,EAAI4P,EAAQtP,QACbsP,EAAQ5P,KAAOrE,KAAK6Q,UAElBxM,EAAI,EAAI4P,EAAQtP,QAAUsP,EAAQ5P,EAAI,KAAOrE,KAAK6Q,WAEhD0D,EAAYnO,SACd2M,EAASxJ,KAAKvJ,KAAKwU,cAAcD,EAAYnO,SAC7CmO,EAAc,IAGhBxB,EAASxJ,KAAK,CAAE5C,KAAM,kBACtBtC,GAAK,IAGDkQ,EAAYnO,QACd2M,EAASxJ,KAAKvJ,KAAKwU,cAAcD,EAAYnO,SAE/CmO,EAAc,GACdlQ,MAGFkQ,GAAeN,EAAQ5P,GACvBA,KASJ,OAJIkQ,EAAYnO,QACd2M,EAASxJ,KAAKvJ,KAAKwU,cAAcD,EAAYnO,SAGxC2M,CACT,CAQAyB,aAAAA,CAAcC,GACZ,MAAMnB,EAAU,CAAE3M,KAAM,OAwBxB,IAAI+N,EAAiB,KACjBC,EAAkBF,EAEtB,MAAMG,EAAeH,EAAKxL,MAAM,8BAChC,GAAI2L,IACFD,EAAkBC,EAAa,GAAKA,EAAa,GAC7CA,EAAa,IAAI,CACnB,MAAMC,EAAUD,EAAa,GAAGE,MAAM,GAAI,GACtCD,IACFH,EAAiBG,EAErB,CAIF,IAAI3D,EAcAF,EAbA+D,EAAiBJ,EAErB,GAAIA,EAAgB9R,SAAS,MAAO,CAClC,MAAMmS,EAAUL,EAAgB/O,QAAQ,MAIxC,GAHAsL,EAAYyD,EAAgBrP,UAAU,EAAG0P,GAAS5O,OAClD2O,EAAiBJ,EAAgBrP,UAAU0P,EAAU,GAAG5O,QAEnD8K,EACH,MAAM,IAAI5M,MAAM,iCAAiCmQ,IAErD,CAIA,IAAIQ,EAAgB,KAEpB,GAAIF,EAAelS,SAAS,KAAM,CAChC,MAAMqS,EAAaH,EAAeI,YAAY,KACxCC,EAAUL,EAAezP,UAAU,EAAG4P,GAAY9O,OAClDiP,EAAUN,EAAezP,UAAU4P,EAAa,GAAG9O,OAG/B,CAAC,QAAS,OAAQ,MAAO,QAAQvD,SAASwS,IAClE,eAAe7S,KAAK6S,IAGpBrE,EAAMoE,EACNH,EAAgBI,GAGhBrE,EAAM+D,CAEV,MACE/D,EAAM+D,EAGR,IAAK/D,EACH,MAAM,IAAI1M,MAAM,4BAA4BmQ,KAS9C,GANAnB,EAAQtC,IAAMA,EACVE,IACFoC,EAAQpC,UAAYA,GAIlBwD,EACF,GAAIA,EAAe7R,SAAS,KAAM,CAChC,MAAMyS,EAAUZ,EAAe9O,QAAQ,KACvC0N,EAAQzJ,SAAW6K,EAAepP,UAAU,EAAGgQ,GAASlP,OACxDkN,EAAQI,UAAYgB,EAAepP,UAAUgQ,EAAU,GAAGlP,MAC5D,MACEkN,EAAQzJ,SAAW6K,EAAetO,OAKtC,GAAI6O,EAAe,CACjB,MAAMM,EAAWN,EAAchM,MAAM,kBACjCsM,GACFjC,EAAQ9B,SAAW,MACnB8B,EAAQM,cAAgB4B,SAASD,EAAS,GAAI,KAE9CjC,EAAQ9B,SAAWyD,CAEvB,CAEA,OAAO3B,CACT,CAMA,UAAI3O,GACF,OAAO3E,KAAK+S,SAASpO,MACvB,CAMAqO,eAAAA,GACE,OAAOhT,KAAKmU,gBACd,CAMAsB,qBAAAA,GACE,OAAOzV,KAAKqU,sBACd,CAMAqB,mBAAAA,GACE,OAAO1V,KAAKsU,oBACd,CAMAzC,QAAAA,GACE,OAAO7R,KAAKiU,OACd,EC7Ma,MAAM0B,GACnBvO,WAAAA,GAEEpH,KAAK4V,eAAiB,IAAI1S,IAG1BlD,KAAK6V,iBAAmB,IAAI3S,IAG5BlD,KAAK8V,eAAiB,GAGtB9V,KAAK+V,UAAY,IAAI3H,IAGrBpO,KAAKgW,SAAU,CACjB,CAcAnH,GAAAA,CAAIoD,GACF,GAAIjS,KAAKgW,QACP,MAAM,IAAIlT,UACR,gFAKJ,GAAI9C,KAAK+V,UAAUE,IAAIhE,EAAWgC,SAAU,OAAOjU,KAGnD,GAFAA,KAAK+V,UAAUlH,IAAIoD,EAAWgC,SAE1BhC,EAAWe,kBAEb,OADAhT,KAAK8V,eAAevM,KAAK0I,GAClBjS,KAGT,MAAMkW,EAAQjE,EAAWtN,OACnBwR,EAAUlE,EAAWc,SAASd,EAAWc,SAASpO,OAAS,GAC3DqM,EAAMmF,GAASnF,IAErB,GAAKA,GAAe,MAARA,EAIL,CAEL,MAAM7Q,EAAM,GAAG+V,KAASlF,IACnBhR,KAAK4V,eAAeK,IAAI9V,IAAMH,KAAK4V,eAAepS,IAAIrD,EAAK,IAChEH,KAAK4V,eAAepV,IAAIL,GAAKoJ,KAAK0I,EACpC,MAPOjS,KAAK6V,iBAAiBI,IAAIC,IAAQlW,KAAK6V,iBAAiBrS,IAAI0S,EAAO,IACxElW,KAAK6V,iBAAiBrV,IAAI0V,GAAO3M,KAAK0I,GAQxC,OAAOjS,IACT,CAcAoW,MAAAA,CAAOC,GACL,IAAK,MAAMC,KAAQD,EAAarW,KAAK6O,IAAIyH,GACzC,OAAOtW,IACT,CAQAiW,GAAAA,CAAIhE,GACF,OAAOjS,KAAK+V,UAAUE,IAAIhE,EAAWgC,QACvC,CAMA,QAAI1Q,GACF,OAAOvD,KAAK+V,UAAUxS,IACxB,CASAgT,IAAAA,GAEE,OADAvW,KAAKgW,SAAU,EACRhW,IACT,CAMA,YAAIwW,GACF,OAAOxW,KAAKgW,OACd,CAkBA9D,UAAAA,CAAWvB,GACT,OAAmC,OAA5B3Q,KAAKyW,UAAU9F,EACxB,CAkBA8F,SAAAA,CAAU9F,GACR,MAAMuF,EAAQvF,EAAQiB,WAIhB8E,EAAW,GAAGR,KAHRvF,EAAQG,kBAId6F,EAAc3W,KAAK4V,eAAepV,IAAIkW,GAC5C,GAAIC,EACF,IAAK,IAAItS,EAAI,EAAGA,EAAIsS,EAAYhS,OAAQN,IACtC,GAAIsM,EAAQ5H,QAAQ4N,EAAYtS,IAAK,OAAOsS,EAAYtS,GAK5D,MAAMuS,EAAiB5W,KAAK6V,iBAAiBrV,IAAI0V,GACjD,GAAIU,EACF,IAAK,IAAIvS,EAAI,EAAGA,EAAIuS,EAAejS,OAAQN,IACzC,GAAIsM,EAAQ5H,QAAQ6N,EAAevS,IAAK,OAAOuS,EAAevS,GAKlE,IAAK,IAAIA,EAAI,EAAGA,EAAIrE,KAAK8V,eAAenR,OAAQN,IAC9C,GAAIsM,EAAQ5H,QAAQ/I,KAAK8V,eAAezR,IAAK,OAAOrE,KAAK8V,eAAezR,GAG1E,OAAO,IACT,ECtMK,MAw+BMwS,GAAW,CACtBC,KAAM,IACNC,MAAO,IACPC,OAAQ,IACRC,IAAK,IACLC,KAAM,IACNC,OAAQ,IACRD,KAAM,IACNE,KAAM,IACNC,IAAK,IACLC,GAAI,IACJC,KAAM,KACNC,KAAM,IACNC,IAAK,IACLC,IAAK,IACLC,KAAM,IACNC,MAAO,KAuHIC,GAAM,CACjBC,IAAK,IACLC,KAAM,IACNC,GAAI,IACJC,GAAI,IACJC,KAAM,KAEKC,GAAc,CACzBC,KAAM,IACNC,KAAM,IACNC,IAAK,IACLC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,OAAQ,IACRC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,KAAM,IACNC,KAAM,IACNC,KAAM,IACNC,IAAK,IACLC,OAAQ,IACRC,OAAQ,IACRC,OAAQ,KCxoCJC,GAAgB,IAAIpL,IAAI,0BAQ9B,SAASoB,GAAmB9N,GAC1B,GAAgB,MAAZA,EAAK,GACP,MAAM,IAAI4C,MAAM,2DAA2D5C,MAE7E,IAAK,MAAMqG,KAAMrG,EACf,GAAI8X,GAAcvD,IAAIlO,GACpB,MAAM,IAAIzD,MAAM,uCAAuCyD,uBAAwBrG,MAGnF,OAAOA,CACT,CAaA,SAAS+X,MAAmBC,GAC1B,MAAMC,EAAMtZ,OAAOuO,OAAO,MAC1B,IAAK,MAAMN,KAAOoL,EAChB,GAAKpL,EACL,IAAK,MAAMnO,KAAOE,OAAO0O,KAAKT,GAAM,CAClC,MAAMsL,EAAMtL,EAAInO,GAChB,GAAmB,iBAARyZ,EACTD,EAAIxZ,GAAOyZ,OACN,GAAIA,GAAsB,iBAARA,QAAgCvW,IAAZuW,EAAIhO,IAAmB,CAElE,MAAMA,EAAMgO,EAAIhO,IACG,iBAARA,IACT+N,EAAIxZ,GAAOyL,EAGf,CACF,CAEF,OAAO+N,CACT,CAMA,MAAME,GAAsB,WACtBC,GAAkB,OAClBC,GAAiB,MAuBjBC,GAAY3Z,OAAO4Z,OAAO,CAAEC,MAAO,EAAGC,MAAO,EAAGC,OAAQ,EAAGC,MAAO,IAIlEC,GAAmB,IAAIlM,IAAI,CAAC,EAAM,GAAM,KAgD/B,MAAMmM,GA4BnBnT,WAAAA,CAAYrD,EAAU,CAAC,GA9FzB,IAAyB6V,EA+FrB5Z,KAAKwa,OAASzW,EAAQ0W,OAAS,CAAC,EAChCza,KAAK0a,oBAAsB1a,KAAKwa,OAAO/M,oBAAsB,EAC7DzN,KAAK2a,mBAAqB3a,KAAKwa,OAAO9M,mBAAqB,EAC3D1N,KAAK4a,WAA0C,mBAAtB7W,EAAQ8W,UAA2B9W,EAAQ8W,UAAYC,GAAKA,EACrF9a,KAAK+a,aAnGgBnB,EAmGc5Z,KAAKwa,OAAOQ,eAAiBnB,KAlGtDD,IAAQC,GAChBD,IAAQG,GAAuB,IAAI3L,IAAI,CAAC2L,KACxCH,IAAQE,GAAwB,IAAI1L,IAAI,CAAC0L,KACzCzL,MAAMrC,QAAQ4N,GAAa,IAAIxL,IAAIwL,GAChC,IAAIxL,IAAI,CAACyL,KAJgC,IAAIzL,IAAI,CAACyL,KAmGvD7Z,KAAKib,gBAAkBlX,EAAQmX,iBAAkB,EAEjDlb,KAAKmb,SAAW1B,GAAgB2B,GAAsBrX,EAAQsX,eAAiB,MAK/Erb,KAAKsb,aAAejb,OAAOuO,OAAO,MAIlC5O,KAAKub,UAAYlb,OAAOuO,OAAO,MAG/B5O,KAAKwb,iBAAmB,EACxBxb,KAAKyb,gBAAkB,EAIvBzb,KAAK0b,WAAa,IAAItN,IAAIrK,EAAQqW,QAAU/L,MAAMrC,QAAQjI,EAAQqW,QAAUrW,EAAQqW,OAAS,IAE7Fpa,KAAK2b,UAAY,IAAIvN,IAAIrK,EAAQoW,OAAS9L,MAAMrC,QAAQjI,EAAQoW,OAASpW,EAAQoW,MAAQ,IAGzF,MAAMyB,EAnGV,SAAwBC,GACtB,IAAKA,EACH,MAAO,CAAExZ,WAAY,EAAKyZ,QAAS9B,GAAUE,MAAO6B,UAAW/B,GAAUI,QAE3E,MAAM/X,EAAgC,MAAnBwZ,EAAIxZ,WAAqB,IAAM,EAC5CyZ,EAAU9B,GAAU6B,EAAIG,QAAUhC,GAAUE,MAC5C6B,EAAY/B,GAAU6B,EAAII,UAAYjC,GAAUI,OAGtD,MAAO,CAAE/X,aAAYyZ,UAASC,UADVjO,KAAKC,IAAIgO,EAAW/B,GAAUI,QAEpD,CAyFmB8B,CAAenY,EAAQ8X,KACtC7b,KAAKmc,eAAiBP,EAAOvZ,WAC7BrC,KAAKoc,YAAcR,EAAOE,QAC1B9b,KAAKqc,cAAgBT,EAAOG,SAC9B,CAWAO,mBAAAA,CAAoBhO,GAClB,GAAIA,EACF,IAAK,MAAMnO,KAAOE,OAAO0O,KAAKT,GAC5BkB,GAAmBrP,GAGvBH,KAAKsb,aAAe7B,GAAgBnL,EACtC,CAOAiO,iBAAAA,CAAkBpc,EAAKa,GACrBwO,GAAmBrP,GACE,iBAAVa,IAA8C,IAAxBA,EAAM4E,QAAQ,OAC7C5F,KAAKsb,aAAanb,GAAOa,EAE7B,CAWAwb,gBAAAA,CAAiBlO,GACftO,KAAKwb,iBAAmB,EACxBxb,KAAKyb,gBAAkB,EACvBzb,KAAKub,UAAY9B,GAAgBnL,EACnC,CAWA7K,KAAAA,GAIE,OAHAzD,KAAKub,UAAYlb,OAAOuO,OAAO,MAC/B5O,KAAKwb,iBAAmB,EACxBxb,KAAKyb,gBAAkB,EAChBzb,IACT,CAWAyc,aAAAA,CAAcC,GACZ1c,KAAKmc,eAA6B,MAAZO,EAAkB,IAAM,CAChD,CAYAC,MAAAA,CAAOpa,GACL,GAAmB,iBAARA,GAAmC,IAAfA,EAAIoC,OAAc,OAAOpC,EAIxD,MAAMqa,EAAWra,EACXsa,EAAS,GACTvT,EAAM/G,EAAIoC,OAChB,IAAImY,EAAO,EACPzY,EAAI,EAER,MAAM0Y,EAAkB/c,KAAK0a,oBAAsB,EAC7CsC,EAAchd,KAAK2a,mBAAqB,EACxCsC,EAAcF,GAAmBC,EAEvC,KAAO3Y,EAAIiF,GAAK,CAEd,GAA0B,KAAtB/G,EAAI2a,WAAW7Y,GAAqB,CAAEA,IAAK,QAAU,CAKzD,IAAIqC,EAAIrC,EAAI,EACZ,KAAOqC,EAAI4C,GAA6B,KAAtB/G,EAAI2a,WAAWxW,IAAwBA,EAAIrC,GAAM,IAAIqC,IAEvE,GAAIA,GAAK4C,GAA6B,KAAtB/G,EAAI2a,WAAWxW,GAAW,CAExCrC,IACA,QACF,CAGA,MAAM8Y,EAAQ5a,EAAIuS,MAAMzQ,EAAI,EAAGqC,GAC/B,GAAqB,IAAjByW,EAAMxY,OAAc,CAAEN,IAAK,QAAU,CAEzC,IAAI+Y,EACAC,EAEJ,GAAIrd,KAAK0b,WAAWzF,IAAIkH,GAEtBC,EAAc,QAGD/Z,IAATga,IACFA,EAAOxD,QAEJ,IAAI7Z,KAAK2b,UAAU1F,IAAIkH,GAAQ,CAEpC9Y,IACA,QACF,CAAO,GAA4B,KAAxB8Y,EAAMD,WAAW,GAAqB,CAI/C,MAAMI,EAAYtd,KAAKud,YAAYJ,GACnC,QAAkB9Z,IAAdia,EAAyB,CAE3BjZ,IACA,QACF,CACA+Y,EAAcE,EACdD,EAAOvD,EACT,KAAO,CAEL,MAAM0D,EAAWxd,KAAKyd,aAAaN,GACnCC,EAAcI,GAAUxc,MACxBqc,EAAOG,GAAUH,IACnB,EAEA,QAAoBha,IAAhB+Z,GAaJ,GANI/Y,EAAIyY,GAAMD,EAAOtT,KAAKhH,EAAIuS,MAAMgI,EAAMzY,IAC1CwY,EAAOtT,KAAK6T,GACZN,EAAOpW,EAAI,EACXrC,EAAIyY,EAGAG,GAAejd,KAAK0d,YAAYL,GAAO,CACzC,GAAIN,IACF/c,KAAKwb,mBACDxb,KAAKwb,iBAAmBxb,KAAK0a,qBAC/B,MAAM,IAAIpW,MAER,2DAAGtE,KAAKwb,sBAAsBxb,KAAK0a,uBAIzC,GAAIsC,EAAa,CAEf,MAAMW,EAAQP,EAAYzY,QAAUwY,EAAMxY,OAAS,GACnD,GAAIgZ,EAAQ,IACV3d,KAAKyb,iBAAmBkC,EACpB3d,KAAKyb,gBAAkBzb,KAAK2a,oBAC9B,MAAM,IAAIrW,MAER,4DAAGtE,KAAKyb,qBAAqBzb,KAAK2a,qBAI1C,CACF,OAlCEtW,GAmCJ,CAGIyY,EAAOxT,GAAKuT,EAAOtT,KAAKhH,EAAIuS,MAAMgI,IAGtC,MAAMxZ,EAA2B,IAAlBuZ,EAAOlY,OAAepC,EAAMsa,EAAO9Z,KAAK,IAEvD,OAAO/C,KAAK4a,WAAWtX,EAAQsZ,EACjC,CAYAc,WAAAA,CAAYL,GACV,QAAIrd,KAAK+a,YAAY9E,IAAI8D,KAClB/Z,KAAK+a,YAAY9E,IAAIoH,EAC9B,CAcAI,YAAAA,CAAa/b,GAGX,OAAIA,KAAQ1B,KAAKub,UAAkB,CAAEva,MAAOhB,KAAKub,UAAU7Z,GAAO2b,KAAMxD,IACpEnY,KAAQ1B,KAAKsb,aAAqB,CAAEta,MAAOhB,KAAKsb,aAAa5Z,GAAO2b,KAAMxD,IAC1EnY,KAAQ1B,KAAKmb,SAAiB,CAAEna,MAAOhB,KAAKmb,SAASzZ,GAAO2b,KAAMvD,SAAtE,CAEF,CAeA8D,YAAAA,CAAaC,GAEX,OAAW,IAAPA,EAAiB7d,KAAKqc,cAGtBwB,GAAM,OAAUA,GAAM,OAGE,IAAxB7d,KAAKmc,gBACH0B,GAAM,GAAQA,GAAM,KAASvD,GAAiBrE,IAAI4H,GAJf7D,GAAUI,QAO3C,CACV,CAcA0D,eAAAA,CAAgBC,EAAQZ,EAAOU,GAC7B,OAAQE,GACN,KAAK/D,GAAUE,MAAO,OAAOvG,OAAOqK,cAAcH,GAClD,KAAK7D,GAAUI,OAAQ,MAAO,GAC9B,KAAKJ,GAAUG,MAAO,OACtB,KAAKH,GAAUK,MACb,MAAM,IAAI/V,MAER,2DAAI6Y,SAAaU,EAAGhM,SAAS,IAAIrM,cAAcyY,SAAS,EAAG,SAE/D,QAAS,OAAOtK,OAAOqK,cAAcH,GAEzC,CAkBAN,WAAAA,CAAYJ,GAEV,MAAMe,EAASf,EAAMD,WAAW,GAChC,IAAIW,EAQJ,GANEA,EADa,MAAXK,GAAqC,KAAXA,EACvB1I,SAAS2H,EAAMrI,MAAM,GAAI,IAEzBU,SAAS2H,EAAMrI,MAAM,GAAI,IAI5BqJ,OAAOC,MAAMP,IAAOA,EAAK,GAAKA,EAAK,QAAU,OAGjD,MAAMQ,EAAUre,KAAK4d,aAAaC,GAGlC,IAAK7d,KAAKib,iBAAmBoD,EAAUrE,GAAUI,OAAQ,OAGzD,MAAMkE,GAAyB,IAAbD,EACdre,KAAKoc,YACLtO,KAAKC,IAAI/N,KAAKoc,YAAaiC,GAG/B,OAAOre,KAAK8d,gBAAgBQ,EAAWnB,EAAOU,EAChD,EClgBF,SAASU,GAAqBC,EAAeza,GAC3C,IAAKya,EAAe,MAAO,CAAC,EAG5B,MAAM7R,EAAQ5I,EAAQ+G,oBAClB0T,EAAcza,EAAQ+G,qBACtB0T,EAEJ,IAAK7R,EAAO,MAAO,CAAC,EAEpB,MAAM8R,EAAW,CAAC,EAClB,IAAK,MAAMte,KAAOwM,EAEZxM,EAAI2J,WAAW/F,EAAQ8G,qBAEzB4T,EADgBte,EAAImF,UAAUvB,EAAQ8G,oBAAoBlG,SACtCgI,EAAMxM,GAG1Bse,EAASte,GAAOwM,EAAMxM,GAG1B,OAAOse,CACT,CAOA,SAASC,GAAiBC,GACxB,IAAKA,GAAoC,iBAAfA,EAAyB,OAEnD,MAAMzJ,EAAayJ,EAAW/Y,QAAQ,KACtC,IAAoB,IAAhBsP,GAAqBA,EAAa,EAAG,CACvC,MAAM0J,EAAKD,EAAWrZ,UAAU,EAAG4P,GAEnC,GAAW,UAAP0J,EACF,OAAOA,CAEX,CAEF,CAEe,MAAMC,GACnBzX,WAAAA,CAAYrD,GCvEC,IAA+BiH,EDwE1ChL,KAAK+D,QAAUA,EACf/D,KAAK8e,YAAc,KACnB9e,KAAK+e,cAAgB,GACrB/e,KAAKgf,SAAWA,GAChBhf,KAAKif,cAAgBA,GACrBjf,KAAKkf,iBAAmBA,GACxBlf,KAAKmf,mBAAqBA,GAC1Bnf,KAAKof,aAAeA,GACpBpf,KAAKqf,qBAAuBA,GAC5Brf,KAAKsf,iBAAmBA,GACxBtf,KAAKuf,oBAAsBA,GAC3Bvf,KAAK8O,SAAWA,GAChB9O,KAAKwf,mBCnF2B,mBADUxU,EDoFMhL,KAAK+D,QAAQiH,kBClFlDA,EAEPqD,MAAMrC,QAAQhB,GACNnB,IACJ,IAAK,MAAMoK,KAAWjJ,EAAkB,CACpC,GAAuB,iBAAZiJ,GAAwBpK,IAAaoK,EAC5C,OAAO,EAEX,GAAIA,aAAmBtS,QAAUsS,EAAQzR,KAAKqH,GAC1C,OAAO,CAEf,GAGD,KAAM,EDqEb7J,KAAKyf,qBAAuB,EAC5Bzf,KAAK0f,sBAAwB,EAC7B,IAAIrE,EAAgB,IAAKxD,IACrB7X,KAAK+D,QAAQqI,cACfpM,KAAKoM,cAAgBpM,KAAK+D,QAAQqI,eAEO,iBAA9BpM,KAAK+D,QAAQoI,aAA2BkP,EAAgBrb,KAAK+D,QAAQoI,cACzC,IAA9BnM,KAAK+D,QAAQoI,eAAuBkP,EAAgB,IAAKlD,MAAgBtB,KAClF7W,KAAKoM,cAAgB,IAAImO,GAAc,CACrCc,cAAeA,EACfH,eAAgBlb,KAAK+D,QAAQoI,aAC7BsO,MAAO,CACLhN,mBAAoBzN,KAAK+D,QAAQmI,gBAAgBuB,mBACjDC,kBAAmB1N,KAAK+D,QAAQmI,gBAAgBwB,kBAChDsN,cAAehb,KAAK+D,QAAQmI,gBAAgB2B,cAOlD7N,KAAK2Q,QAAU,IAAIyB,GAInBpS,KAAK2f,gBAAkB3f,KAAK2Q,QAAQoD,WAGpC/T,KAAK4f,uBAAwB,EAG7B5f,KAAK6f,uBAAyB,IAAIlK,GAClC,MAAMmK,EAAgB9f,KAAK+D,QAAQ+H,UACnC,GAAIgU,GAAiBA,EAAcnb,OAAS,EAAG,CAC7C,IAAK,IAAIN,EAAI,EAAGA,EAAIyb,EAAcnb,OAAQN,IAAK,CAC7C,MAAM0b,EAAcD,EAAczb,GACP,iBAAhB0b,EAET/f,KAAK6f,uBAAuBhR,IAAI,IAAImF,GAAW+L,IACtCA,aAAuB/L,IAEhChU,KAAK6f,uBAAuBhR,IAAIkR,EAEpC,CACA/f,KAAK6f,uBAAuBtJ,MAC9B,CACF,EAcF,SAAS0I,GAAcrT,EAAKD,EAASe,EAAOsT,EAAUC,EAAeC,EAAYC,GAC/E,MAAMpc,EAAU/D,KAAK+D,QACrB,QAAYV,IAARuI,IACE7H,EAAQqH,aAAe4U,IACzBpU,EAAMA,EAAIxF,QAERwF,EAAIjH,OAAS,GAAG,CACbwb,IAAgBvU,EAAM5L,KAAKqf,qBAAqBzT,EAAKD,EAASe,IAGnE,MAAM0T,EAAiBrc,EAAQ2I,MAAQA,EAAMmF,WAAanF,EACpD2T,EAAStc,EAAQ2H,kBAAkBC,EAASC,EAAKwU,EAAgBH,EAAeC,GACtF,OAAIG,QAEKzU,SACSyU,UAAkBzU,GAAOyU,IAAWzU,EAE7CyU,EACEtc,EAAQqH,YAGEQ,EAAIxF,SACJwF,EAHZ0U,GAAW1U,EAAK7H,EAAQmH,cAAenH,EAAQuH,oBAM7CM,CAGb,CAEJ,CAEA,SAASsT,GAAiBxQ,GACxB,GAAI1O,KAAK+D,QAAQkH,eAAgB,CAC/B,MAAMsV,EAAO7R,EAAQrE,MAAM,KACrBmW,EAA+B,MAAtB9R,EAAQ+R,OAAO,GAAa,IAAM,GACjD,GAAgB,UAAZF,EAAK,GACP,MAAO,GAEW,IAAhBA,EAAK5b,SACP+J,EAAU8R,EAASD,EAAK,GAE5B,CACA,OAAO7R,CACT,CAIA,MAAMgS,GAAY,IAAI/e,OAAO,+CAAgD,MAE7E,SAASwd,GAAmBzW,EAASgE,EAAOf,EAASgV,GAAQ,GAC3D,MAAM5c,EAAU/D,KAAK+D,QACrB,IAAc,IAAV4c,IAAgD,IAA7B5c,EAAQiH,kBAAgD,iBAAZtC,EAAuB,CAIxF,MAAMK,EAAUS,EAAcd,EAASgY,IACjCpX,EAAMP,EAAQpE,OACdgI,EAAQ,CAAC,EAITiU,EAAgB,IAAIvS,MAAM/E,GAChC,IAAIuX,GAAc,EAClB,MAAMC,EAAqB,CAAC,EAE5B,IAAK,IAAIzc,EAAI,EAAGA,EAAIiF,EAAKjF,IAAK,CAC5B,MAAMwF,EAAW7J,KAAKkf,iBAAiBnW,EAAQ1E,GAAG,IAC5C0c,EAAShY,EAAQ1E,GAAG,GAE1B,GAAIwF,EAASlF,aAAqBtB,IAAX0d,EAAsB,CAC3C,IAAInV,EAAMmV,EACNhd,EAAQqH,aAAYQ,EAAMA,EAAIxF,QAClCwF,EAAM5L,KAAKqf,qBAAqBzT,EAAKD,EAAS3L,KAAK2f,iBACnDiB,EAAcvc,GAAKuH,EAEnBkV,EAAmBjX,GAAY+B,EAC/BiV,GAAc,CAChB,CACF,CAGIA,GAAgC,iBAAVnU,GAAsBA,EAAMmG,eACpDnG,EAAMmG,cAAciO,GAItB,MAAME,EAAWjd,EAAQ2I,MAAQA,EAAMmF,WAAa7R,KAAK2f,gBAGzD,IAAIsB,GAAW,EACf,IAAK,IAAI5c,EAAI,EAAGA,EAAIiF,EAAKjF,IAAK,CAC5B,MAAMwF,EAAW7J,KAAKkf,iBAAiBnW,EAAQ1E,GAAG,IAElD,GAAIrE,KAAKwf,mBAAmB3V,EAAUmX,GAAW,SAEjD,IAAIE,EAAQnd,EAAQ8G,oBAAsBhB,EAE1C,GAAIA,EAASlF,OAMX,GALIZ,EAAQyI,yBACV0U,EAAQnd,EAAQyI,uBAAuB0U,IAEzCA,EAAQC,GAAaD,EAAOnd,QAENV,IAAlB0F,EAAQ1E,GAAG,GAAkB,CAE/B,MAAM0c,EAASH,EAAcvc,GAEvB+c,EAASrd,EAAQ8H,wBAAwBhC,EAAUkX,EAAQC,GAE/DrU,EAAMuU,GADJE,QACaL,SACCK,UAAkBL,GAAUK,IAAWL,EACxCK,EAEAd,GAAWS,EAAQhd,EAAQoH,oBAAqBpH,EAAQuH,oBAEzE2V,GAAW,CACb,MAAWld,EAAQwD,yBACjBoF,EAAMuU,IAAS,EACfD,GAAW,EAGjB,CAEA,IAAKA,EAAU,OAEf,GAAIld,EAAQ+G,oBAAqB,CAC/B,MAAMuW,EAAiB,CAAC,EAExB,OADAA,EAAetd,EAAQ+G,qBAAuB6B,EACvC0U,CACT,CACA,OAAO1U,CACT,CACF,CACA,MAAMqS,GAAW,SAAU5a,GACzBA,EAAUA,EAAQ3C,QAAQ,SAAU,MACpC,MAAM6f,EAAS,IAAIC,EAAQ,QAC3B,IAAIzC,EAAcwC,EACdE,EAAW,GAGfxhB,KAAK2Q,QAAQlN,QACbzD,KAAKoM,cAAc3I,QAGnBzD,KAAKyf,qBAAuB,EAC5Bzf,KAAK0f,sBAAwB,EAC7B,MAAM3b,EAAU/D,KAAK+D,QACf0d,EAAgB,IAAIxS,EAAclL,EAAQmI,iBAC1CwV,EAAStd,EAAQO,OACvB,IAAK,IAAIN,EAAI,EAAGA,EAAIqd,EAAQrd,IAE1B,GAAW,MADAD,EAAQC,GACH,CAGd,MAAMsd,EAAKvd,EAAQ8Y,WAAW7Y,EAAI,GAClC,GAAW,KAAPsd,EAAW,CACb,MAAMC,EAAaC,GAAiBzd,EAAS,IAAKC,EAAG,8BACrD,IAAIsH,EAAUvH,EAAQkB,UAAUjB,EAAI,EAAGud,GAAYxb,OAEnD,GAAIrC,EAAQkH,eAAgB,CAC1B,MAAMiK,EAAavJ,EAAQ/F,QAAQ,MACf,IAAhBsP,IACFvJ,EAAUA,EAAQ1D,OAAOiN,EAAa,GAE1C,CAEAvJ,EAAUY,GAAiBxI,EAAQwI,iBAAkBZ,EAAS,GAAI5H,GAAS4H,QAEvEmT,IACF0C,EAAWxhB,KAAKuf,oBAAoBiC,EAAU1C,EAAa9e,KAAK2f,kBAIlE,MAAMmC,EAAc9hB,KAAK2Q,QAAQG,gBACjC,GAAInF,GAAW5H,EAAQoK,gBAAgB8H,IAAItK,GACzC,MAAM,IAAIrH,MAAM,kDAAkDqH,MAEhEmW,GAAe/d,EAAQoK,gBAAgB8H,IAAI6L,KAE7C9hB,KAAK2Q,QAAQiC,MACb5S,KAAK+e,cAAcnM,OAGrB5S,KAAK2Q,QAAQiC,MACb5S,KAAK4f,uBAAwB,EAE7Bd,EAAc9e,KAAK+e,cAAcnM,MACjC4O,EAAW,GACXnd,EAAIud,CACN,MAAO,GAAW,KAAPD,EAAW,CAEpB,IAAII,EAAUC,GAAW5d,EAASC,GAAG,EAAO,MAC5C,IAAK0d,EAAS,MAAM,IAAIzd,MAAM,yBAE9Bkd,EAAWxhB,KAAKuf,oBAAoBiC,EAAU1C,EAAa9e,KAAK2f,iBAChE,MAAMsC,EAAUjiB,KAAKmf,mBAAmB4C,EAAQG,OAAQliB,KAAK2Q,QAASoR,EAAQpW,SAAS,GACvF,GAAIsW,EAAS,CACX,MAAME,EAAMF,EAAQjiB,KAAK+D,QAAQ8G,oBAAsB,WACvD7K,KAAKoM,cAAcqQ,cAAc0B,OAAOgE,IAAQ,EAClD,CACA,GAAKpe,EAAQsI,mBAAyC,SAApB0V,EAAQpW,SAAuB5H,EAAQuI,kBAElE,CAEL,MAAM8V,EAAY,IAAIb,EAAQQ,EAAQpW,SACtCyW,EAAUvT,IAAI9K,EAAQgH,aAAc,IAEhCgX,EAAQpW,UAAYoW,EAAQG,QAAUH,EAAQM,iBAA+C,IAA7Bte,EAAQiH,mBAC1EoX,EAAU,MAAQH,GAEpBjiB,KAAK8O,SAASgQ,EAAasD,EAAWpiB,KAAK2f,gBAAiBtb,EAC9D,CAGAA,EAAI0d,EAAQH,WAAa,CAC3B,MAAO,GAAW,KAAPD,GACwB,KAA9Bvd,EAAQ8Y,WAAW7Y,EAAI,IACO,KAA9BD,EAAQ8Y,WAAW7Y,EAAI,GAAW,CACrC,MAAMie,EAAWT,GAAiBzd,EAAS,SAAOC,EAAI,EAAG,0BACzD,GAAIN,EAAQkI,gBAAiB,CAC3B,MAAMxH,EAAUL,EAAQkB,UAAUjB,EAAI,EAAGie,EAAW,GAEpDd,EAAWxhB,KAAKuf,oBAAoBiC,EAAU1C,EAAa9e,KAAK2f,iBAEhEb,EAAYjQ,IAAI9K,EAAQkI,gBAAiB,CAAC,CAAE,CAAClI,EAAQgH,cAAetG,IACtE,CACAJ,EAAIie,CACN,MAAO,GAAW,KAAPX,GACwB,KAA9Bvd,EAAQ8Y,WAAW7Y,EAAI,GAAW,CACrC,MAAMf,EAASme,EAAcvS,YAAY9K,EAASC,GAClDrE,KAAKoM,cAAcoQ,iBAAiBlZ,EAAO6L,UAC3C9K,EAAIf,EAAOe,CACb,MAAO,GAAW,KAAPsd,GACwB,KAA9Bvd,EAAQ8Y,WAAW7Y,EAAI,GAAW,CACrC,MAAMud,EAAaC,GAAiBzd,EAAS,MAAOC,EAAG,wBAA0B,EAC3E6d,EAAS9d,EAAQkB,UAAUjB,EAAI,EAAGud,GAExCJ,EAAWxhB,KAAKuf,oBAAoBiC,EAAU1C,EAAa9e,KAAK2f,iBAEhE,IAAI/T,EAAM5L,KAAKif,cAAciD,EAAQpD,EAAYpQ,QAAS1O,KAAK2f,iBAAiB,GAAM,GAAO,GAAM,GACxFtc,MAAPuI,IAAkBA,EAAM,IAGxB7H,EAAQsH,cACVyT,EAAYjQ,IAAI9K,EAAQsH,cAAe,CAAC,CAAE,CAACtH,EAAQgH,cAAemX,KAElEpD,EAAYjQ,IAAI9K,EAAQgH,aAAca,GAGxCvH,EAAIud,EAAa,CACnB,KAAO,CACL,IAAIte,EAAS0e,GAAW5d,EAASC,EAAGN,EAAQkH,gBAG5C,IAAK3H,EAAQ,CAEX,MAAMif,EAAUne,EAAQkB,UAAUwI,KAAKC,IAAI,EAAG1J,EAAI,IAAKyJ,KAAK0U,IAAId,EAAQrd,EAAI,KAC5E,MAAM,IAAIC,MAAM,6CAA6CD,gBAAgBke,KAC/E,CAEA,IAAI5W,EAAUrI,EAAOqI,QACrB,MAAMgT,EAAarb,EAAOqb,WAC1B,IAAIuD,EAAS5e,EAAO4e,OAChBG,EAAiB/e,EAAO+e,eACxBT,EAAate,EAAOse,WAIxB,KAFGjW,UAASuW,UAAW3V,GAAiBxI,EAAQwI,iBAAkBZ,EAASuW,EAAQne,IAE/EA,EAAQ+I,sBACTnB,IAAY5H,EAAQkI,iBAChBN,IAAY5H,EAAQsH,eACpBM,IAAY5H,EAAQgH,cACpBY,IAAY5H,EAAQ+G,qBAEzB,MAAM,IAAIxG,MAAM,qBAAqBqH,KAInCmT,GAAe0C,GACW,SAAxB1C,EAAYpQ,UAEd8S,EAAWxhB,KAAKuf,oBAAoBiC,EAAU1C,EAAa9e,KAAK2f,iBAAiB,IAKrF,MAAM8C,EAAU3D,EACZ2D,GAAW1e,EAAQoK,gBAAgB8H,IAAIwM,EAAQ/T,WACjDoQ,EAAc9e,KAAK+e,cAAcnM,MACjC5S,KAAK2Q,QAAQiC,OAKf,IAAI8P,GAAgB,EAChBR,EAAOvd,OAAS,GAAKud,EAAO/M,YAAY,OAAS+M,EAAOvd,OAAS,IACnE+d,GAAgB,EACoB,MAAhC/W,EAAQA,EAAQhH,OAAS,IAC3BgH,EAAUA,EAAQ1D,OAAO,EAAG0D,EAAQhH,OAAS,GAC7Cud,EAASvW,GAETuW,EAASA,EAAOja,OAAO,EAAGia,EAAOvd,OAAS,GAI5C0d,EAAkB1W,IAAYuW,GAIhC,IAEIhR,EAFAsN,EAAgB,KAChBC,EAAW,CAAC,EAIhBvN,EAAYwN,GAAiBC,GAGzBhT,IAAY2V,EAAO5S,SACrB1O,KAAK2Q,QAAQpH,KAAKoC,EAAS,CAAC,EAAGuF,GAI7BvF,IAAYuW,GAAUG,IAGxB7D,EAAgBxe,KAAKmf,mBAAmB+C,EAAQliB,KAAK2Q,QAAShF,GAE1D6S,IAGFC,EAAWF,GAAqBC,EAAeza,KAK/C4H,IAAY2V,EAAO5S,UACrB1O,KAAK4f,sBAAwB5f,KAAKof,gBAGpC,MAAMhW,EAAa/E,EACnB,GAAIrE,KAAK4f,sBAAuB,CAC9B,IAAI+C,EAAa,GAGjB,GAAID,EACFre,EAAIf,EAAOse,gBAGR,GAAI7d,EAAQoK,gBAAgB8H,IAAItK,GACnCtH,EAAIf,EAAOse,eAGR,CAEH,MAAMte,EAAStD,KAAKsf,iBAAiBlb,EAASua,EAAYiD,EAAa,GACvE,IAAKte,EAAQ,MAAM,IAAIgB,MAAM,qBAAqBqa,KAClDta,EAAIf,EAAOe,EACXse,EAAarf,EAAOqf,UACtB,CAEA,MAAMP,EAAY,IAAIb,EAAQ5V,GAE1B6S,IACF4D,EAAU,MAAQ5D,GAIpB4D,EAAUvT,IAAI9K,EAAQgH,aAAc4X,GAEpC3iB,KAAK2Q,QAAQiC,MACb5S,KAAK4f,uBAAwB,EAE7B5f,KAAK8O,SAASgQ,EAAasD,EAAWpiB,KAAK2f,gBAAiBvW,EAC9D,KAAO,CAEL,GAAIsZ,EAAe,GACd/W,UAASuW,UAAW3V,GAAiBxI,EAAQwI,iBAAkBZ,EAASuW,EAAQne,IAEnF,MAAMqe,EAAY,IAAIb,EAAQ5V,GAC1B6S,IACF4D,EAAU,MAAQ5D,GAEpBxe,KAAK8O,SAASgQ,EAAasD,EAAWpiB,KAAK2f,gBAAiBvW,GAC5DpJ,KAAK2Q,QAAQiC,MACb5S,KAAK4f,uBAAwB,CAC/B,KACK,IAAI7b,EAAQoK,gBAAgB8H,IAAItK,GAAU,CAC7C,MAAMyW,EAAY,IAAIb,EAAQ5V,GAC1B6S,IACF4D,EAAU,MAAQ5D,GAEpBxe,KAAK8O,SAASgQ,EAAasD,EAAWpiB,KAAK2f,gBAAiBvW,GAC5DpJ,KAAK2Q,QAAQiC,MACb5S,KAAK4f,uBAAwB,EAC7Bvb,EAAIf,EAAOse,WAEX,QACF,CAEK,CACH,MAAMQ,EAAY,IAAIb,EAAQ5V,GAC9B,GAAI3L,KAAK+e,cAAcpa,OAASZ,EAAQ8I,cACtC,MAAM,IAAIvI,MAAM,gCAElBtE,KAAK+e,cAAcxV,KAAKuV,GAEpBN,IACF4D,EAAU,MAAQ5D,GAEpBxe,KAAK8O,SAASgQ,EAAasD,EAAWpiB,KAAK2f,gBAAiBvW,GAC5D0V,EAAcsD,CAChB,EACAZ,EAAW,GACXnd,EAAIud,CACN,CACF,CACF,MACEJ,GAAYpd,EAAQC,GAGxB,OAAOid,EAAO3S,KAChB,EAEA,SAASG,GAASgQ,EAAasD,EAAWzR,EAASvH,GAE5CpJ,KAAK+D,QAAQ6I,kBAAiBxD,OAAa/F,GAGhD,MAAM+c,EAAiBpgB,KAAK+D,QAAQ2I,MAAQiE,EAAQkB,WAAalB,EAC3DrN,EAAStD,KAAK+D,QAAQ0I,UAAU2V,EAAU1T,QAAS0R,EAAgBgC,EAAU,QACpE,IAAX9e,IAEyB,iBAAXA,GAChB8e,EAAU1T,QAAUpL,EACpBwb,EAAYhQ,SAASsT,EAAWhZ,IAEhC0V,EAAYhQ,SAASsT,EAAWhZ,GAEpC,CAOA,SAASiW,GAAqBzT,EAAKD,EAASe,GAC1C,MAAMkW,EAAe5iB,KAAK+D,QAAQmI,gBAElC,IAAK0W,IAAiBA,EAAarV,QACjC,OAAO3B,EAIT,GAAIgX,EAAajV,YAAa,CAC5B,MAAMyS,EAAiBpgB,KAAK+D,QAAQ2I,MAAQA,EAAMmF,WAAanF,EAK/D,KAJgB2B,MAAMrC,QAAQ4W,EAAajV,aACvCiV,EAAajV,YAAY9K,SAAS8I,GAClCiX,EAAajV,YAAYhC,EAASyU,IAGpC,OAAOxU,CAEX,CAGA,GAAIgX,EAAahV,UAAW,CAC1B,MAAMwS,EAAiBpgB,KAAK+D,QAAQ2I,MAAQA,EAAMmF,WAAanF,EAC/D,IAAKkW,EAAahV,UAAUjC,EAASyU,GACnC,OAAOxU,CAEX,CAEA,OAAO5L,KAAKoM,cAAcuQ,OAAO/Q,EACnC,CAGA,SAAS2T,GAAoBiC,EAAUqB,EAAYlS,EAASuP,GAe1D,OAdIsB,SACiBne,IAAf6c,IAA0BA,EAAyC,IAA5B2C,EAAWlU,MAAMhK,aAS3CtB,KAPjBme,EAAWxhB,KAAKif,cAAcuC,EAC5BqB,EAAWnU,QACXiC,GACA,IACAkS,EAAW,OAAiD,IAAzCxiB,OAAO0O,KAAK8T,EAAW,OAAOle,OACjDub,KAEyC,KAAbsB,GAC5BqB,EAAWhU,IAAI7O,KAAK+D,QAAQgH,aAAcyW,GAC5CA,EAAW,IAENA,CACT,CAMA,SAASpC,KACP,OAAyC,IAArCpf,KAAK6f,uBAAuBtc,MAEzBvD,KAAK2Q,QAAQuB,WAAWlS,KAAK6f,uBACtC,CAuCA,SAASgC,GAAiBzd,EAAS7B,EAAK8B,EAAGye,GACzC,MAAMC,EAAe3e,EAAQwB,QAAQrD,EAAK8B,GAC1C,IAAsB,IAAlB0e,EACF,MAAM,IAAIze,MAAMwe,GAEhB,OAAOC,EAAexgB,EAAIoC,OAAS,CAEvC,CAEA,SAASqe,GAAgB5e,EAAS9C,EAAM+C,EAAGye,GACzC,MAAMC,EAAe3e,EAAQwB,QAAQtE,EAAM+C,GAC3C,IAAsB,IAAlB0e,EAAqB,MAAM,IAAIze,MAAMwe,GACzC,OAAOC,CACT,CAEA,SAASf,GAAW5d,EAASC,EAAG4G,EAAgBgY,EAAc,KAC5D,MAAM3f,EA/CR,SAAgCc,EAASC,EAAG4e,EAAc,KACxD,IAAIC,EAAe,EACnB,MAAMC,EAAQ,GACR7Z,EAAMlF,EAAQO,OACdye,EAAaH,EAAY/F,WAAW,GACpCmG,EAAaJ,EAAYte,OAAS,EAAIse,EAAY/F,WAAW,IAAM,EAEzE,IAAK,IAAI1W,EAAQnC,EAAGmC,EAAQ8C,EAAK9C,IAAS,CACxC,MAAMQ,EAAO5C,EAAQ8Y,WAAW1W,GAEhC,GAAI0c,EACElc,IAASkc,IAAcA,EAAe,QACrC,GAAa,KAATlc,GAAwB,KAATA,EACxBkc,EAAelc,OACV,GAAIA,IAASoc,EAAY,CAC9B,IAAoB,IAAhBC,EAKF,MAAO,CAAE9c,KAAMoN,OAAO2P,gBAAgBH,GAAQ3c,SAJ9C,GAAIpC,EAAQ8Y,WAAW1W,EAAQ,KAAO6c,EACpC,MAAO,CAAE9c,KAAMoN,OAAO2P,gBAAgBH,GAAQ3c,QAKpD,MAAO,GAAa,IAATQ,EAAY,CACrBmc,EAAM5Z,KAAK,IACX,QACF,CAEA4Z,EAAM5Z,KAAKvC,EACb,CACF,CAkBiBuc,CAAuBnf,EAASC,EAAI,EAAG4e,GACtD,IAAK3f,EAAQ,OACb,IAAI4e,EAAS5e,EAAOiD,KACpB,MAAMqb,EAAate,EAAOkD,MACpBgd,EAAiBtB,EAAOuB,OAAO,MACrC,IAAI9X,EAAUuW,EACVG,GAAiB,GACG,IAApBmB,IACF7X,EAAUuW,EAAO5c,UAAU,EAAGke,GAC9BtB,EAASA,EAAO5c,UAAUke,EAAiB,GAAGE,aAGhD,MAAM/E,EAAahT,EACnB,GAAIV,EAAgB,CAClB,MAAMiK,EAAavJ,EAAQ/F,QAAQ,MACf,IAAhBsP,IACFvJ,EAAUA,EAAQ1D,OAAOiN,EAAa,GACtCmN,EAAiB1W,IAAYrI,EAAOiD,KAAK0B,OAAOiN,EAAa,GAEjE,CAEA,MAAO,CACLvJ,QAASA,EACTuW,OAAQA,EACRN,WAAYA,EACZS,eAAgBA,EAChB1D,WAAYA,EAEhB,CAOA,SAASW,GAAiBlb,EAASuH,EAAStH,GAC1C,MAAM+E,EAAa/E,EAEnB,IAAIsf,EAAe,EAEnB,MAAMC,EAASxf,EAAQO,OACvB,KAAON,EAAIuf,EAAQvf,IACjB,GAAmB,MAAfD,EAAQC,GAAY,CACtB,MAAMsd,EAAKvd,EAAQ8Y,WAAW7Y,EAAI,GAClC,GAAW,KAAPsd,EAAW,CACb,MAAMC,EAAaoB,GAAgB5e,EAAS,IAAKC,EAAG,GAAGsH,mBAEvD,GADmBvH,EAAQkB,UAAUjB,EAAI,EAAGud,GAAYxb,SACnCuF,IACnBgY,IACqB,IAAjBA,GACF,MAAO,CACLhB,WAAYve,EAAQkB,UAAU8D,EAAY/E,GAC1CA,EAAGud,GAITvd,EAAIud,CACN,MAAO,GAAW,KAAPD,EAETtd,EADmBwd,GAAiBzd,EAAS,KAAMC,EAAI,EAAG,gCAErD,GAAW,KAAPsd,GACwB,KAA9Bvd,EAAQ8Y,WAAW7Y,EAAI,IACO,KAA9BD,EAAQ8Y,WAAW7Y,EAAI,GAE1BA,EADmBwd,GAAiBzd,EAAS,SAAOC,EAAI,EAAG,gCAEtD,GAAW,KAAPsd,GACwB,KAA9Bvd,EAAQ8Y,WAAW7Y,EAAI,GAE1BA,EADmBwd,GAAiBzd,EAAS,MAAOC,EAAG,2BAA6B,MAE/E,CACL,MAAM0d,EAAUC,GAAW5d,EAASC,EAAG,KAEnC0d,KACkBA,GAAWA,EAAQpW,WACnBA,GAAyD,MAA9CoW,EAAQG,OAAOH,EAAQG,OAAOvd,OAAS,IACpEgf,IAEFtf,EAAI0d,EAAQH,WAEhB,CACF,CAEJ,CAEA,SAAStB,GAAW1U,EAAKiY,EAAa9f,GACpC,GAAI8f,GAA8B,iBAARjY,EAAkB,CAE1C,MAAMyU,EAASzU,EAAIxF,OACnB,MAAe,SAAXia,GACgB,UAAXA,GNxwBE,SAAkB9d,EAAKwB,EAAU,CAAC,GAE7C,GADAA,EAAU1D,OAAO2D,OAAO,CAAC,EAAGsM,GAAUvM,IACjCxB,GAAsB,iBAARA,EAAkB,OAAOA,EAE5C,IAAIuhB,EAAavhB,EAAI6D,OAErB,GAA0B,IAAtB0d,EAAWnf,OAAc,OAAOpC,EAC/B,QAAyBc,IAArBU,EAAQggB,UAA0BhgB,EAAQggB,SAASvhB,KAAKshB,GAAa,OAAOvhB,EAChF,GAAmB,MAAfuhB,EAAoB,OAAO,EAC/B,GAAI/f,EAAQwH,KAAO6E,GAAS5N,KAAKshB,GAClC,OAyGR,SAAmBE,GAEf,GAAIxO,SAAU,OAAOA,SAASwO,EA3GG,IA4G5B,GAAI7F,OAAO3I,SAAU,OAAO2I,OAAO3I,SAASwO,EA5GhB,IA6G5B,GAAIC,QAAUA,OAAOzO,SAAU,OAAOyO,OAAOzO,SAASwO,EA7G1B,IA8G5B,MAAM,IAAI1f,MAAM,+DACzB,CA/Ge4f,CAAUJ,GAGd,GAAKK,SAASL,GAEd,IAAIA,EAAWjhB,SAAS,MAAQihB,EAAWjhB,SAAS,KACvD,OAqDR,SAA0BN,EAAKuhB,EAAY/f,GACvC,IAAKA,EAAQ0H,UAAW,OAAOlJ,EAC/B,MAAM0N,EAAW6T,EAAW7a,MAAMwH,IAClC,GAAIR,EAAU,CACV,IAAImU,EAAOnU,EAAS,IAAM,GAC1B,MAAMoU,GAAsC,IAA9BpU,EAAS,GAAGrK,QAAQ,KAAc,IAAM,IAChD4F,EAAeyE,EAAS,GACxBqU,EAA0BF,EAC5B7hB,EAAIiJ,EAAa7G,OAAS,KAAO0f,EAC/B9hB,EAAIiJ,EAAa7G,UAAY0f,EAEnC,OAAI7Y,EAAa7G,OAAS,GAAK2f,EAAgC/hB,GAC9B,IAAxBiJ,EAAa7G,SACdsL,EAAS,GAAGnG,WAAW,IAAIua,MAAYpU,EAAS,GAAG,KAAOoU,IAEvD7Y,EAAa7G,OAAS,EAEzBZ,EAAQyH,eAAiB8Y,GACzBR,GAAc7T,EAAS,IAAM,IAAMA,EAAS,GACrCkO,OAAO2F,IACJvhB,EANP4b,OAAO2F,EAWtB,CACI,OAAOvhB,CAEf,CAjFegiB,CAAiBhiB,EAAKuhB,EAAY/f,GAGtC,CAEH,MAAMkF,EAAQoH,GAASnH,KAAK4a,GAE5B,GAAI7a,EAAO,CACP,MAAMmb,EAAOnb,EAAM,IAAM,GACnBuC,EAAevC,EAAM,GAC3B,IAAIub,GA8EGR,EA9E2B/a,EAAM,MA+ET,IAAzB+a,EAAOpe,QAAQ,MAEV,OADfoe,EAASA,EAAOviB,QAAQ,MAAO,KACXuiB,EAAS,IACN,MAAdA,EAAO,GAAYA,EAAS,IAAMA,EACJ,MAA9BA,EAAOA,EAAOrf,OAAS,KAAYqf,EAASA,EAAO1e,UAAU,EAAG0e,EAAOrf,OAAS,IAClFqf,GAEJA,EArFC,MAAMS,EAAgCL,EACD,MAAjC7hB,EAAIiJ,EAAa7G,OAAS,GACK,MAA7BpC,EAAIiJ,EAAa7G,QAGvB,IAAKZ,EAAQyH,eACLA,EAAa7G,OAAS,GACM,IAAxB6G,EAAa7G,SAAiB8f,GAEtC,OAAOliB,EAEN,CACD,MAAMmiB,EAAMvG,OAAO2F,GACba,EAAYhR,OAAO+Q,GAEzB,GAAY,IAARA,EAAW,OAAOA,EACtB,IAAkC,IAA9BC,EAAUlB,OAAO,QACjB,OAAI1f,EAAQ0H,UAAkBiZ,EAClBniB,EACT,IAAiC,IAA7BuhB,EAAWle,QAAQ,KAC1B,MAAkB,MAAd+e,GACKA,IAAcH,GACdG,IAAc,GAAGP,IAAOI,IAFHE,EAGlBniB,EAGhB,IAAIyP,EAAIxG,EAAegZ,EAAoBV,EAC3C,OAAItY,EAEQwG,IAAM2S,GAAeP,EAAOpS,IAAM2S,EAAaD,EAAMniB,EAGrDyP,IAAM2S,GAAe3S,IAAMoS,EAAOO,EAAaD,EAAMniB,CAErE,CACJ,CACI,OAAOA,CAEf,EAuCJ,IAAmByhB,EA1FX,OAoHR,SAAwBzhB,EAAKmiB,EAAK3gB,GAC9B,MAAM6gB,EAAaF,IAAQ9gB,IAE3B,OAAQG,EAAQyM,SAAStI,eACrB,IAAK,OACD,OAAO,KACX,IAAK,WACD,OAAOwc,EACX,IAAK,SACD,OAAOE,EAAa,WAAa,YAErC,QACI,OAAOriB,EAEnB,CAlIesiB,CAAetiB,EAAK4b,OAAO2F,GAAa/f,EAoDvD,CMusBgB+gB,CAASlZ,EAAK7H,EAC5B,CACE,YV9vBkB,IU8vBN6H,EACHA,EAEA,EAGb,CAYA,SAASW,GAAiBwY,EAAIpZ,EAASuW,EAAQne,GAC7C,GAAIghB,EAAI,CACN,MAAMC,EAAaD,EAAGpZ,GAClBuW,IAAWvW,IACbuW,EAAS8C,GAEXrZ,EAAUqZ,CACZ,CAEA,MAAO,CAAErZ,QADTA,EAAUwV,GAAaxV,EAAS5H,GACdme,SACpB,CAIA,SAASf,GAAazf,EAAMqC,GAC1B,GAAI2G,EAAmB7H,SAASnB,GAC9B,MAAM,IAAI4C,MAAM,6BAA6B5C,4EACxC,OAAI+I,EAAyB5H,SAASnB,GACpCqC,EAAQgJ,oBAAoBrL,GAE9BA,CACT,CE7zBA,MAAM8M,GAAkBC,EAAQO,oBAQhC,SAASiW,GAAqBtY,EAAO6T,GACnC,IAAK7T,GAA0B,iBAAVA,EAAoB,MAAO,CAAC,EACjD,IAAK6T,EAAQ,OAAO7T,EAEpB,MAAM8R,EAAW,CAAC,EAClB,IAAK,MAAMte,KAAOwM,EACZxM,EAAI2J,WAAW0W,GAEjB/B,EADgBte,EAAImF,UAAUkb,EAAO7b,SACjBgI,EAAMxM,GAG1Bse,EAASte,GAAOwM,EAAMxM,GAG1B,OAAOse,CACT,CASe,SAASyG,GAAS3W,EAAMxK,EAAS4M,EAASgP,GACvD,OAAOwF,GAAS5W,EAAMxK,EAAS4M,EAASgP,EAC1C,CAQA,SAASwF,GAASC,EAAKrhB,EAAS4M,EAASgP,GACvC,IAAI0F,EACJ,MAAMC,EAAgB,CAAC,EACvB,IAAK,IAAIjhB,EAAI,EAAGA,EAAI+gB,EAAIzgB,OAAQN,IAAK,CACnC,MAAMkhB,EAASH,EAAI/gB,GACbmhB,EAAWC,GAASF,GAG1B,QAAiBliB,IAAbmiB,GAA0BA,IAAazhB,EAAQgH,aAAc,CAC/D,MAAM0T,EAAWwG,GACfM,EAAO,OAAS,CAAC,EACjBxhB,EAAQ8G,qBAEV8F,EAAQpH,KAAKic,EAAU/G,EACzB,CAEA,GAAI+G,IAAazhB,EAAQgH,kBACV1H,IAATgiB,EAAoBA,EAAOE,EAAOC,GACjCH,GAAQ,GAAKE,EAAOC,OACpB,SAAiBniB,IAAbmiB,EACT,SACK,GAAID,EAAOC,GAAW,CAE3B,IAAI5Z,EAAMuZ,GAASI,EAAOC,GAAWzhB,EAAS4M,EAASgP,GACvD,MAAM+F,EAASC,GAAU/Z,EAAK7H,GAgB9B,GAdIwhB,EAAO,MACTK,GAAiBha,EAAK2Z,EAAO,MAAO5F,EAAiB5b,GAChB,IAA5B1D,OAAO0O,KAAKnD,GAAKjH,aAA8CtB,IAA9BuI,EAAI7H,EAAQgH,eAAgChH,EAAQgI,qBAEzD,IAA5B1L,OAAO0O,KAAKnD,GAAKjH,SACtBZ,EAAQgI,qBAAsBH,EAAI7H,EAAQgH,cAAgB,GACzDa,EAAM,IAHXA,EAAMA,EAAI7H,EAAQgH,mBAMY1H,IAA5BkiB,EAAO/W,KAAiD,iBAAR5C,GAA4B,OAARA,IACtEA,EAAI4C,IAAmB+W,EAAO/W,UAIAnL,IAA5BiiB,EAAcE,IAA2BnlB,OAAOM,UAAUC,eAAeC,KAAKykB,EAAeE,GAC1FnX,MAAMrC,QAAQsZ,EAAcE,MAC/BF,EAAcE,GAAY,CAACF,EAAcE,KAE3CF,EAAcE,GAAUjc,KAAKqC,OACxB,CAKL,MAAMwU,EAAiBrc,EAAQ2I,MAAQiT,EAAgB9N,WAAa8N,EAChE5b,EAAQiI,QAAQwZ,EAAUpF,EAAgBsF,GAC5CJ,EAAcE,GAAY,CAAC5Z,GAE3B0Z,EAAcE,GAAY5Z,CAE9B,MAGiBvI,IAAbmiB,GAA0BA,IAAazhB,EAAQgH,cACjD4F,EAAQiC,KAEZ,EAEF,CAOA,MALoB,iBAATyS,EACLA,EAAK1gB,OAAS,IAAG2gB,EAAcvhB,EAAQgH,cAAgBsa,QACzChiB,IAATgiB,IAAoBC,EAAcvhB,EAAQgH,cAAgBsa,GAG9DC,CACT,CAEA,SAASG,GAAShlB,GAChB,MAAMsO,EAAO1O,OAAO0O,KAAKtO,GACzB,IAAK,IAAI4D,EAAI,EAAGA,EAAI0K,EAAKpK,OAAQN,IAAK,CACpC,MAAMlE,EAAM4O,EAAK1K,GACjB,GAAY,OAARlE,EAAc,OAAOA,CAC3B,CACF,CAEA,SAASylB,GAAiBnlB,EAAKolB,EAASlG,EAAiB5b,GACvD,GAAI8hB,EAAS,CACX,MAAM9W,EAAO1O,OAAO0O,KAAK8W,GACnBvc,EAAMyF,EAAKpK,OACjB,IAAK,IAAIN,EAAI,EAAGA,EAAIiF,EAAKjF,IAAK,CAC5B,MAAMyhB,EAAW/W,EAAK1K,GAGhB0hB,EAAcD,EAAShc,WAAW/F,EAAQ8G,qBAC5Cib,EAASxgB,UAAUvB,EAAQ8G,oBAAoBlG,QAC/CmhB,EAIE1F,EAAiBrc,EAAQ2I,MAC3BiT,EAAgB9N,WAAa,IAAMkU,EACnCpG,EAEA5b,EAAQiI,QAAQ8Z,EAAU1F,GAAgB,GAAM,GAClD3f,EAAIqlB,GAAY,CAACD,EAAQC,IAEzBrlB,EAAIqlB,GAAYD,EAAQC,EAE5B,CACF,CACF,CAEA,SAASH,GAAUllB,EAAKsD,GACtB,MAAM,aAAEgH,GAAiBhH,EACnBiiB,EAAY3lB,OAAO0O,KAAKtO,GAAKkE,OAEnC,OAAkB,IAAdqhB,KAKY,IAAdA,IACCvlB,EAAIsK,IAA8C,kBAAtBtK,EAAIsK,IAAqD,IAAtBtK,EAAIsK,GAMxE,CCxKA,MAAMrH,GAAiB,CACrB6D,wBAAwB,EACxBC,aAAc,IAIT,SAASye,GAAS7hB,EAASL,GAChCA,EAAU1D,OAAO2D,OAAO,CAAC,EAAGN,GAAgBK,GAK5C,MAAMwc,EAAO,GACb,IAAI2F,GAAW,EAGXC,GAAc,EAEC,WAAf/hB,EAAQ,KAEVA,EAAUA,EAAQ6D,OAAO,IAG3B,IAAK,IAAI5D,EAAI,EAAGA,EAAID,EAAQO,OAAQN,IAElC,GAAmB,MAAfD,EAAQC,IAAiC,MAAnBD,EAAQC,EAAI,IAGpC,GAFAA,GAAK,EACLA,EAAIsD,GAAOvD,EAASC,GAChBA,EAAEqF,IAAK,OAAOrF,MACb,IAAmB,MAAfD,EAAQC,GA0IZ,CACL,GAAIqD,GAAatD,EAAQC,IACvB,SAEF,OAAO+hB,GAAe,cAAe,SAAWhiB,EAAQC,GAAK,qBAAsB+D,GAAyBhE,EAASC,GACvH,CA/I+B,CAG7B,IAAIgiB,EAAchiB,EAGlB,GAFAA,IAEmB,MAAfD,EAAQC,GAAY,CACtBA,EAAIgE,GAAoBjE,EAASC,GACjC,QACF,CAAO,CACL,IAAIiiB,GAAa,EACE,MAAfliB,EAAQC,KAEViiB,GAAa,EACbjiB,KAGF,IAAIsH,EAAU,GACd,KAAOtH,EAAID,EAAQO,QACF,MAAfP,EAAQC,IACO,MAAfD,EAAQC,IACO,OAAfD,EAAQC,IACO,OAAfD,EAAQC,IACO,OAAfD,EAAQC,GAAaA,IAErBsH,GAAWvH,EAAQC,GAWrB,GATAsH,EAAUA,EAAQvF,OAGkB,MAAhCuF,EAAQA,EAAQhH,OAAS,KAE3BgH,EAAUA,EAAQrG,UAAU,EAAGqG,EAAQhH,OAAS,GAEhDN,MAEGkiB,GAAgB5a,GAAU,CAC7B,IAAIhC,EAMJ,OAJEA,EAD4B,IAA1BgC,EAAQvF,OAAOzB,OACX,2BAEA,QAAUgH,EAAU,wBAErBya,GAAe,aAAczc,EAAKvB,GAAyBhE,EAASC,GAC7E,CAEA,MAAMf,EAASmF,GAAiBrE,EAASC,GACzC,IAAe,IAAXf,EACF,OAAO8iB,GAAe,cAAe,mBAAqBza,EAAU,qBAAsBvD,GAAyBhE,EAASC,IAE9H,IAAIqE,EAAUpF,EAAOtC,MAGrB,GAFAqD,EAAIf,EAAOkD,MAEyB,MAAhCkC,EAAQA,EAAQ/D,OAAS,GAAY,CAEvC,MAAM6hB,EAAeniB,EAAIqE,EAAQ/D,OACjC+D,EAAUA,EAAQpD,UAAU,EAAGoD,EAAQ/D,OAAS,GAChD,MAAM8hB,EAAU5d,GAAwBH,EAAS3E,GACjD,IAAgB,IAAZ0iB,EAOF,OAAOL,GAAeK,EAAQ/c,IAAI1C,KAAMyf,EAAQ/c,IAAIC,IAAKvB,GAAyBhE,EAASoiB,EAAeC,EAAQ/c,IAAIzC,OANtHif,GAAW,CAQf,MAAO,GAAII,EAAY,CACrB,IAAKhjB,EAAOqF,UACV,OAAOyd,GAAe,aAAc,gBAAkBza,EAAU,iCAAkCvD,GAAyBhE,EAASC,IAC/H,GAAIqE,EAAQtC,OAAOzB,OAAS,EACjC,OAAOyhB,GAAe,aAAc,gBAAkBza,EAAU,+CAAgDvD,GAAyBhE,EAASiiB,IAC7I,GAAoB,IAAhB9F,EAAK5b,OACd,OAAOyhB,GAAe,aAAc,gBAAkBza,EAAU,yBAA0BvD,GAAyBhE,EAASiiB,IACvH,CACL,MAAMK,EAAMnG,EAAK3N,MACjB,GAAIjH,IAAY+a,EAAI/a,QAAS,CAC3B,IAAIgb,EAAUve,GAAyBhE,EAASsiB,EAAIL,aACpD,OAAOD,GAAe,aACpB,yBAA2BM,EAAI/a,QAAU,qBAAuBgb,EAAQ1f,KAAO,SAAW0f,EAAQzf,IAAM,6BAA+ByE,EAAU,KACjJvD,GAAyBhE,EAASiiB,GACtC,CAGmB,GAAf9F,EAAK5b,SACPwhB,GAAc,EAElB,CACF,KAAO,CACL,MAAMM,EAAU5d,GAAwBH,EAAS3E,GACjD,IAAgB,IAAZ0iB,EAIF,OAAOL,GAAeK,EAAQ/c,IAAI1C,KAAMyf,EAAQ/c,IAAIC,IAAKvB,GAAyBhE,EAASC,EAAIqE,EAAQ/D,OAAS8hB,EAAQ/c,IAAIzC,OAI9H,IAAoB,IAAhBkf,EACF,OAAOC,GAAe,aAAc,sCAAuChe,GAAyBhE,EAASC,KACzD,IAA3CN,EAAQyD,aAAa5B,QAAQ+F,IAGtC4U,EAAKhX,KAAK,CAAEoC,UAAS0a,gBAEvBH,GAAW,CACb,CAIA,IAAK7hB,IAAKA,EAAID,EAAQO,OAAQN,IAC5B,GAAmB,MAAfD,EAAQC,GAAY,CACtB,GAAuB,MAAnBD,EAAQC,EAAI,GAAY,CAE1BA,IACAA,EAAIgE,GAAoBjE,EAASC,GACjC,QACF,CAAO,GAAuB,MAAnBD,EAAQC,EAAI,GAIrB,MAFA,GADAA,EAAIsD,GAAOvD,IAAWC,GAClBA,EAAEqF,IAAK,OAAOrF,CAItB,MAAO,GAAmB,MAAfD,EAAQC,GAAY,CAC7B,MAAMuiB,EAAW7c,GAAkB3F,EAASC,GAC5C,IAAiB,GAAbuiB,EACF,OAAOR,GAAe,cAAe,4BAA6Bhe,GAAyBhE,EAASC,IACtGA,EAAIuiB,CACN,MACE,IAAoB,IAAhBT,IAAyBze,GAAatD,EAAQC,IAChD,OAAO+hB,GAAe,aAAc,wBAAyBhe,GAAyBhE,EAASC,IAIlF,MAAfD,EAAQC,IACVA,GAEJ,CACF,CAKA,CAGF,OAAK6hB,EAEqB,GAAf3F,EAAK5b,OACPyhB,GAAe,aAAc,iBAAmB7F,EAAK,GAAG5U,QAAU,KAAMvD,GAAyBhE,EAASmc,EAAK,GAAG8F,gBAChH9F,EAAK5b,OAAS,IAChByhB,GAAe,aAAc,YAClCS,KAAKC,UAAUvG,EAAKjS,IAAIyY,GAAKA,EAAEpb,SAAU,KAAM,GAAGlK,QAAQ,SAAU,IACpE,WAAY,CAAEwF,KAAM,EAAGC,IAAK,IANvBkf,GAAe,aAAc,sBAAuB,EAU/D,CAEA,SAAS1e,GAAapG,GACpB,MAAgB,MAATA,GAAyB,OAATA,GAA0B,OAATA,GAA0B,OAATA,CAC3D,CAMA,SAASqG,GAAOvD,EAASC,GACvB,MAAMuC,EAAQvC,EACd,KAAOA,EAAID,EAAQO,OAAQN,IACzB,GAAkB,KAAdD,EAAQC,IAA2B,KAAdD,EAAQC,GAAW,CAE1C,MAAMqK,EAAUtK,EAAQ6D,OAAOrB,EAAOvC,EAAIuC,GAC1C,GAAIvC,EAAI,GAAiB,QAAZqK,EACX,OAAO0X,GAAe,aAAc,6DAA8Dhe,GAAyBhE,EAASC,IAC/H,GAAkB,KAAdD,EAAQC,IAA+B,KAAlBD,EAAQC,EAAI,GAAW,CAErDA,IACA,KACF,CACE,QAEJ,CAEF,OAAOA,CACT,CAEA,SAASgE,GAAoBjE,EAASC,GACpC,GAAID,EAAQO,OAASN,EAAI,GAAwB,MAAnBD,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,IAElE,IAAKA,GAAK,EAAGA,EAAID,EAAQO,OAAQN,IAC/B,GAAmB,MAAfD,EAAQC,IAAiC,MAAnBD,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,GAAY,CAC1EA,GAAK,EACL,KACF,OAEG,GACLD,EAAQO,OAASN,EAAI,GACF,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,GACZ,CACA,IAAIE,EAAqB,EACzB,IAAKF,GAAK,EAAGA,EAAID,EAAQO,OAAQN,IAC/B,GAAmB,MAAfD,EAAQC,GACVE,SACK,GAAmB,MAAfH,EAAQC,KACjBE,IAC2B,IAAvBA,GACF,KAIR,MAAO,GACLH,EAAQO,OAASN,EAAI,GACF,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,IACO,MAAnBD,EAAQC,EAAI,GAEZ,IAAKA,GAAK,EAAGA,EAAID,EAAQO,OAAQN,IAC/B,GAAmB,MAAfD,EAAQC,IAAiC,MAAnBD,EAAQC,EAAI,IAAiC,MAAnBD,EAAQC,EAAI,GAAY,CAC1EA,GAAK,EACL,KACF,CAIJ,OAAOA,CACT,CAEA,MAAMkE,GAAc,IACdC,GAAc,IAOpB,SAASC,GAAiBrE,EAASC,GACjC,IAAIqE,EAAU,GACVrH,EAAY,GACZsH,GAAY,EAChB,KAAOtE,EAAID,EAAQO,OAAQN,IAAK,CAC9B,GAAID,EAAQC,KAAOkE,IAAenE,EAAQC,KAAOmE,GAC7B,KAAdnH,EACFA,EAAY+C,EAAQC,GACXhD,IAAc+C,EAAQC,KAG/BhD,EAAY,SAET,GAAmB,MAAf+C,EAAQC,IACC,KAAdhD,EAAkB,CACpBsH,GAAY,EACZ,KACF,CAEFD,GAAWtE,EAAQC,EACrB,CACA,MAAkB,KAAdhD,GAIG,CACLL,MAAO0H,EACPlC,MAAOnC,EACPsE,UAAWA,EAEf,CAKA,MAAMC,GAAoB,IAAIjH,OAAO,0DAA2D,KAIhG,SAASkH,GAAwBH,EAAS3E,GAKxC,MAAMgF,EAAUS,EAAcd,EAASE,IACjCa,EAAY,CAAC,EAEnB,IAAK,IAAIpF,EAAI,EAAGA,EAAI0E,EAAQpE,OAAQN,IAAK,CACvC,GAA6B,IAAzB0E,EAAQ1E,GAAG,GAAGM,OAEhB,OAAOyhB,GAAe,cAAe,cAAgBrd,EAAQ1E,GAAG,GAAK,8BAA+BuF,GAAqBb,EAAQ1E,KAC5H,QAAsBhB,IAAlB0F,EAAQ1E,GAAG,SAAsChB,IAAlB0F,EAAQ1E,GAAG,GACnD,OAAO+hB,GAAe,cAAe,cAAgBrd,EAAQ1E,GAAG,GAAK,sBAAuBuF,GAAqBb,EAAQ1E,KACpH,QAAsBhB,IAAlB0F,EAAQ1E,GAAG,KAAqBN,EAAQwD,uBAEjD,OAAO6e,GAAe,cAAe,sBAAwBrd,EAAQ1E,GAAG,GAAK,oBAAqBuF,GAAqBb,EAAQ1E,KAKjI,MAAMwF,EAAWd,EAAQ1E,GAAG,GAC5B,IAAK2iB,GAAiBnd,GACpB,OAAOuc,GAAe,cAAe,cAAgBvc,EAAW,wBAAyBD,GAAqBb,EAAQ1E,KAExH,GAAKhE,OAAOM,UAAUC,eAAeC,KAAK4I,EAAWI,GAInD,OAAOuc,GAAe,cAAe,cAAgBvc,EAAW,iBAAkBD,GAAqBb,EAAQ1E,KAF/GoF,EAAUI,GAAY,CAI1B,CAEA,OAAO,CACT,CAiBA,SAASE,GAAkB3F,EAASC,GAGlC,GAAmB,MAAfD,IADJC,GAEE,OAAQ,EACV,GAAmB,MAAfD,EAAQC,GAEV,OAtBJ,SAAiCD,EAASC,GACxC,IAAI2F,EAAK,KAKT,IAJmB,MAAf5F,EAAQC,KACVA,IACA2F,EAAK,cAEA3F,EAAID,EAAQO,OAAQN,IAAK,CAC9B,GAAmB,MAAfD,EAAQC,GACV,OAAOA,EACT,IAAKD,EAAQC,GAAG4E,MAAMe,GACpB,KACJ,CACA,OAAQ,CACV,CASWC,CAAwB7F,IAD/BC,GAGF,IAAI6F,EAAQ,EACZ,KAAO7F,EAAID,EAAQO,OAAQN,IAAK6F,IAC9B,KAAI9F,EAAQC,GAAG4E,MAAM,OAASiB,EAAQ,IAAtC,CAEA,GAAmB,MAAf9F,EAAQC,GACV,MACF,OAAQ,CAHE,CAKZ,OAAOA,CACT,CAEA,SAAS+hB,GAAepf,EAAMD,EAASoD,GACrC,MAAO,CACLT,IAAK,CACH1C,KAAMA,EACN2C,IAAK5C,EACLE,KAAMkD,EAAWlD,MAAQkD,EACzBjD,IAAKiD,EAAWjD,KAGtB,CAEA,SAAS8f,GAAiBnd,GACxB,OAAOW,EAAOX,EAChB,CAIA,SAAS0c,GAAgB7X,GACvB,OAAOlE,EAAOkE,EAChB,CAGA,SAAStG,GAAyBhE,EAASoC,GACzC,MAAM4D,EAAQhG,EAAQkB,UAAU,EAAGkB,GAAO6D,MAAM,SAChD,MAAO,CACLpD,KAAMmD,EAAMzF,OAGZuC,IAAKkD,EAAMA,EAAMzF,OAAS,GAAGA,OAAS,EAE1C,CAGA,SAASiF,GAAqBX,GAC5B,OAAOA,EAAMG,WAAaH,EAAM,GAAGtE,MACrC,CClae,MAAMsiB,GAEjB7f,WAAAA,CAAYrD,GACR/D,KAAKknB,iBAAmB,CAAC,EACzBlnB,KAAK+D,QAAUiK,EAAajK,EAEhC,CAMAojB,KAAAA,CAAM/iB,EAASgjB,GACX,GAAuB,iBAAZhjB,GAAwBA,EAAQyN,SACvCzN,EAAUA,EAAQyN,gBACf,GAAuB,iBAAZzN,EACd,MAAM,IAAIE,MAAM,mDAGpB,GAAI8iB,EAAkB,EACO,IAArBA,IAA2BA,EAAmB,CAAC,GAEnD,MAAM9jB,EAAS2iB,GAAS7hB,EAASgjB,GACjC,IAAe,IAAX9jB,EACA,MAAMgB,MAAM,GAAGhB,EAAOoG,IAAIC,OAAOrG,EAAOoG,IAAIzC,QAAQ3D,EAAOoG,IAAIxC,MAEvE,CACA,MAAMmgB,EAAmB,IAAIxI,GAAiB7e,KAAK+D,SACnDsjB,EAAiBjb,cAAckQ,oBAAoBtc,KAAKknB,kBACxD,MAAMI,EAAgBD,EAAiBrI,SAAS5a,GAChD,OAAIpE,KAAK+D,QAAQ6G,oBAAmCvH,IAAlBikB,EAAoCA,EAC1DpC,GAASoC,EAAetnB,KAAK+D,QAASsjB,EAAiB1W,QAAS0W,EAAiB1H,gBACjG,CAOA4H,SAAAA,CAAUpnB,EAAKa,GACX,IAA4B,IAAxBA,EAAM4E,QAAQ,KACd,MAAM,IAAItB,MAAM,+BACb,IAA0B,IAAtBnE,EAAIyF,QAAQ,OAAqC,IAAtBzF,EAAIyF,QAAQ,KAC9C,MAAM,IAAItB,MAAM,wEACb,GAAc,MAAVtD,EACP,MAAM,IAAIsD,MAAM,6CAEhBtE,KAAKknB,iBAAiB/mB,GAAOa,CAErC,CAYA,wBAAOgO,GACH,OAAOP,EAAQO,mBACnB,EC/DJ,MAAMwY,GAAe,CACnBvB,SAAUA,ICPCjd,GAAS,CAClBye,UAASA,CAACC,EAAUC,IACTA,EAAOhjB,QAAU+iB,EAE5BE,UAASA,CAACF,EAAUC,IACTA,EAAOhjB,QAAU+iB,EAE5B/iB,OAAMA,CAAC+iB,EAAUC,IACNA,EAAOhjB,SAAW+iB,EAE7BzT,QAAOA,CAACyT,EAAUC,EAAQE,EAAW,KACnB,IAAIlmB,OAAO+lB,EAAUG,GACtBrlB,KAAKmlB,GAEtBG,MAAKA,CAACJ,EAAUC,IACLD,IAAaC,EAExBI,GAAEA,CAACL,EAAUC,IACFD,EAASrd,MAAM,KAAKzE,QAAQ+hB,IAAW,GAIzCjD,GAAM,CACflC,IAAGA,CAACkF,EAAUC,IACHxJ,OAAOwJ,IAAWD,EAE7B3Z,IAAGA,CAAC2Z,EAAUC,IACHxJ,OAAOwJ,IAAWD,GAIpBM,GAAO,CAChBC,UAASA,CAACP,EAAUC,IACTA,GAAUD,EAErBQ,UAASA,CAACR,EAAUC,IACTA,GAAUD,GAIZS,GAmBN3F,CAACkF,EAAUC,IACHS,KAAKjB,MAAMQ,IAAWS,KAAKjB,MAAMO,GApBnCS,GAuBNpa,CAAC2Z,EAAUC,IACHS,KAAKjB,MAAMQ,IAAWS,KAAKjB,MAAMO,GC7D1CW,GAAe,CAAC,kBAAmB,UAAW,kBAAmB,UAAW,UAE3E,MAAMC,GAKTlhB,WAAAA,CAAYrD,EAASwkB,EAAYC,GAC7BxoB,KAAK+D,QAAUA,EACf/D,KAAKyoB,SAAW,GAChBzoB,KAAKuoB,WAAaA,EAIlBvoB,KAAK0oB,cAAgB,IAAIxlB,IAIzBlD,KAAK2oB,cAAgBH,GAAgB,IAAItlB,GAC7C,CAQA0lB,QAAAA,CAASC,EAAK1oB,EAAK2oB,EAAO/X,GACtB,GAAI1C,MAAMrC,QAAQ6c,GAAM,CACpB,QAAcxlB,IAAVylB,QAA2CzlB,IAApBylB,EAAM,gBACMzlB,IAA/BylB,EAAM,UAAUC,WAUhB,OATA/oB,KAAKgpB,gBAAgBF,EAAM,UAAWD,EAAIlkB,OAAQoM,QAClD8X,EAAII,QAAQ,CAACrd,EAAKpF,KACd,MAAM0iB,EAAYnY,EAAO,IAAMvK,EAAQ,IACnCnG,OAAO0O,KAAK+Z,GAAOnkB,OAAS,EAC5B3E,KAAKmpB,wBAAwBN,EAAIriB,GAAQsiB,EAAOI,GAEhDlpB,KAAK4oB,SAASC,EAAIriB,GAAQrG,EAAK2oB,EAAOI,KAMtDlpB,KAAKyoB,SAASlf,KAAK,CACfvC,KAAM,sBACN+J,KAAMA,EAAK9I,OAAO,IAE1B,KAA0B,iBAAR4gB,EACd7oB,KAAKmpB,wBAAwBN,EAAKC,EAAO/X,IAEpB,iBAAV+X,GAAsBA,EAAM,UACnC9oB,KAAKopB,iBAAiBP,EAAK1oB,EAAK2oB,EAAO/X,GAChC/Q,KAAKqpB,UAAUP,IACtB9oB,KAAKspB,wBAAwBR,EAAO/X,GAExC/Q,KAAKupB,sBAAsBV,EAAKC,EAAO/X,GAE/C,CAEAwY,qBAAAA,CAAsBV,EAAKC,EAAO/X,GAC9B,GACI+X,EAAM,WACNA,EAAM,UAAUU,SACoC,mBAA7CxpB,KAAKuoB,WAAWO,EAAM,UAAUU,SACzC,CACE,IAAIC,EAAMzpB,KAAKuoB,WAAWO,EAAM,UAAUU,SAASX,EAAK9X,EAAK9I,OAAO,IACjD,iBAARwhB,GACPzpB,KAAKyoB,SAASlf,KAAKkgB,EAE3B,CACJ,CAOAN,uBAAAA,CAAwBN,EAAKC,EAAO/X,GAChC,MAGM2Y,EC/EP,SAAqBnjB,EAAMuiB,GAC9B,MAAMa,EAAQ,CACVpjB,KAAM,GACNuiB,MAAO,GACPc,OAAQ,IAGZ,IAAK,IAAIvlB,EAAI,EAAGA,EAAIkC,EAAK5B,OAAQN,KACG,IAA5BykB,EAAMljB,QAAQW,EAAKlC,IAAYslB,EAAMpjB,KAAKgD,KAAKhD,EAAKlC,IACnDslB,EAAMC,OAAOrgB,KAAKhD,EAAKlC,IAGhC,IAAK,IAAIA,EAAI,EAAGA,EAAIykB,EAAMnkB,OAAQN,KACE,IAA5BkC,EAAKX,QAAQkjB,EAAMzkB,KAA2B,MAAbykB,EAAMzkB,IAAYslB,EAAMb,MAAMvf,KAAKuf,EAAMzkB,IAElF,OAAOslB,CACX,CD+DqBE,CAHAxpB,OAAO0O,KAAK8Z,GACPxoB,OAAO0O,KAAK+Z,IAG9B9oB,KAAK8pB,qBAAqBJ,EAAM3Y,GAChC/Q,KAAK+pB,qBAAqBL,EAAMZ,EAAO/X,GAEvC/Q,KAAKupB,sBAAsBV,EAAKC,EAAO/X,GAIvC,MAAMiZ,EAAgBhqB,KAAKiqB,oBAAoBpB,EAAKC,EAAOY,EAAKE,QAEhEF,EAAKE,OAAOX,QAAS9oB,IACjB,MAAM+pB,EAAUnZ,EAAO,IAAM5Q,EAC7BH,KAAK4oB,SAASC,EAAI1oB,GAAMA,EAAK2oB,EAAM3oB,GAAM+pB,KAI7ClqB,KAAKmqB,0BAA0BtB,EAAKC,EAAOY,EAAKE,OAAQ7Y,GACxD/Q,KAAKoqB,4BAA4BvB,EAAKC,EAAOY,EAAKE,OAAQ7Y,EAAMiZ,GAChEhqB,KAAKqqB,4BAA4BxB,EAAKC,EAAOY,EAAKE,OAAQ7Y,EAC9D,CAmBAoZ,yBAAAA,CAA0BtB,EAAKC,EAAOwB,EAAYvZ,GAE9C,MAAMwZ,EAAWxZ,EAAK9I,OAAO,GACvBuiB,EAAQxqB,KAAK2oB,cAAcnoB,IAAI+pB,GAEhCC,GAELF,EAAWrB,QAAS9oB,IAChB,MAAMsqB,EAAa3B,EAAM3oB,GACzB,IAAKsqB,IAAeA,EAAW,UAAW,OAC1C,MAAM3P,EAAI2P,EAAW,UAEfC,EAASF,EAAM5kB,QAAQzF,GAC7B,IAAgB,IAAZuqB,EAAJ,CAEA,GAAI5P,EAAE6P,MAAO,CACT,MAAMC,EAAS9P,EAAE6P,MAEjB,QAAoBtnB,IAAhBwlB,EAAI+B,GAAuB,OAC/B,MAAMC,EAASL,EAAM5kB,QAAQglB,GAC7B,IAAgB,IAAZC,EAAe,OACfH,GAAUG,GACV7qB,KAAKyoB,SAASlf,KAAK,CACfvC,KAAM,QACN+J,MAAOA,EAAO,IAAM5Q,GAAK8H,OAAO,GAChC0f,OAAQxnB,EACRunB,SAAUkD,GAGtB,CAEA,GAAI9P,EAAEgQ,OAAQ,CACV,MAAMF,EAAS9P,EAAEgQ,OAEjB,QAAoBznB,IAAhBwlB,EAAI+B,GAAuB,OAC/B,MAAMC,EAASL,EAAM5kB,QAAQglB,GAC7B,IAAgB,IAAZC,EAAe,OACfH,GAAUG,GACV7qB,KAAKyoB,SAASlf,KAAK,CACfvC,KAAM,SACN+J,MAAOA,EAAO,IAAM5Q,GAAK8H,OAAO,GAChC0f,OAAQxnB,EACRunB,SAAUkD,GAGtB,CAhCyB,GAkCjC,CA4BAP,2BAAAA,CAA4BxB,EAAKC,EAAOwB,EAAYvZ,GAChD,MAAMga,EAAmB,CAAC,SAAU,YAAa,WAAY,YAE7DT,EAAWrB,QAAS9oB,IAChB,MAAMsqB,EAAa3B,EAAM3oB,GACzB,IAAKsqB,IAAeA,EAAW,UAAW,OAC1C,MAAM3P,EAAI2P,EAAW,UAGrB,IAAKM,EAAiB3d,KAAM4d,QAAqB3nB,IAAZyX,EAAEkQ,IAAsB,OAE7D,MAAMC,EAAYpC,EAAI1oB,GAGtB,GAAI8qB,QAA+C,OACnD,GAAyB,iBAAdA,EAAwB,OAEnC,MAAMC,EAAYpQ,EAAEnU,MAAQ,SAE5BokB,EAAiB9B,QAAS+B,IACtB,QAAgB3nB,IAAZyX,EAAEkQ,GAAqB,OAE3B,MAAMJ,EAAS9P,EAAEkQ,GACXG,EAAStC,EAAI+B,GAGnB,GAAIO,QAAyC,OAC7C,GAAsB,iBAAXA,EAAqB,OAGhC,MAAMC,EAAMprB,KAAKqrB,mBAAmB1X,OAAOsX,GAAYtX,OAAOwX,GAASD,GAGvE,GAAY,OAARE,EAAc,OAElB,IAAIE,GAAW,EACF,WAATN,GAAgC,IAARI,IAAWE,GAAW,GACrC,cAATN,GAAgC,IAARI,IAAWE,GAAW,GACrC,aAATN,GAAwBI,GAAO,IAAIE,GAAW,GACrC,aAATN,GAAwBI,GAAO,IAAIE,GAAW,GAE9CA,GACAtrB,KAAKyoB,SAASlf,KAAK,CACfvC,KAAMgkB,EACNja,MAAOA,EAAO,IAAM5Q,GAAK8H,OAAO,GAChC0f,OAAQhU,OAAOsX,GACfvD,SAAUkD,OAK9B,CAWAS,kBAAAA,CAAmBE,EAAGC,EAAGN,GACrB,GAAkB,SAAdA,EAAsB,CACtB,MAAMO,EAAKrD,KAAKjB,MAAMoE,GAChBG,EAAKtD,KAAKjB,MAAMqE,GACtB,OAAIpN,MAAMqN,IAAOrN,MAAMsN,GAAY,KAC5BD,EAAKC,CAChB,CACA,IAAyC,IAArCrD,GAAaziB,QAAQslB,GAAmB,CACxC,MAAMS,EAAKxN,OAAOoN,GACZK,EAAKzN,OAAOqN,GAClB,OAAIpN,MAAMuN,IAAOvN,MAAMwN,GAAY,KAC5BD,EAAKC,CAChB,CAEA,OAAIL,EAAIC,GAAW,EACfD,EAAIC,EAAU,EACX,CACX,CAYAvB,mBAAAA,CAAoBpB,EAAKC,EAAOwB,GAC5B,MAAMhc,EAAM,IAAIpL,IAShB,OARAonB,EAAWrB,QAAS9oB,IAChB,MAAMyL,EAAMid,EAAI1oB,GACZkO,MAAMrC,QAAQJ,GACd0C,EAAI9K,IAAIrD,EAAKyL,EAAI0C,IAAIqF,SACd/H,SAAoD,iBAARA,GACnD0C,EAAI9K,IAAIrD,EAAK,CAACwT,OAAO/H,OAGtB0C,CACX,CAUA8b,2BAAAA,CAA4BvB,EAAKC,EAAOwB,EAAYvZ,EAAMiZ,GAKtDM,EAAWrB,QAAS9oB,IAChB,MAAMsqB,EAAa3B,EAAM3oB,GACzB,IAAKsqB,IAAeA,EAAW,UAAW,OAC1C,MAAMoB,EAASpB,EAAW,UAAUoB,OACpC,IAAKA,EAAQ,OAEb,MAAMC,EAAO9B,EAAcxpB,IAAIL,IAAQ,GACxB,WAAX0rB,GACAC,EAAK7C,QAAQ,CAAC8C,EAAGC,KACb,MAAMC,EAAY5d,MAAMrC,QAAQ6c,EAAI1oB,KAC7B4Q,EAAO,IAAM5Q,EAAM,IAAM6rB,EAAM,KAAK/jB,OAAO,IAC3C8I,EAAO,IAAM5Q,GAAK8H,OAAO,GAChCjI,KAAKksB,oBAAoB/rB,EAAK4rB,EAAGE,MAKjD,CASAE,wBAAAA,CAAyBC,EAAOC,EAAUC,GACtC,MAAMC,EAAO,IAAIrpB,IACjBkpB,EAAMnD,QAAQ,CAACuD,EAAMR,KACjB,MAAMpgB,EAAM4gB,EAAKH,GACjB,GAAIzgB,SAAoD,iBAARA,EAAkB,OAClE,MAAM6gB,EAAS9Y,OAAO/H,GAClB2gB,EAAKtW,IAAIwW,GACTzsB,KAAKyoB,SAASlf,KAAK,CACfvC,KAAM,SACN+J,MAAOub,EAAW,IAAMN,EAAM,KAAOK,GAAUpkB,OAAO,GACtDjH,MAAOyrB,IAGXF,EAAK/oB,IAAIipB,EAAQT,IAG7B,CAQAE,mBAAAA,CAAoBQ,EAAW1rB,EAAOirB,GAC7BjsB,KAAK0oB,cAAczS,IAAIyW,IACxB1sB,KAAK0oB,cAAcllB,IAAIkpB,EAAW,IAAIte,KAE1C,MAAMme,EAAOvsB,KAAK0oB,cAAcloB,IAAIksB,GAChCH,EAAKtW,IAAIjV,GACThB,KAAKyoB,SAASlf,KAAK,CACfvC,KAAM,SACN+J,KAAMkb,EACNjrB,UAGJurB,EAAK1d,IAAI7N,EAEjB,CAWAooB,gBAAAA,CAAiBxd,EAAKzL,EAAK2oB,EAAO/X,IACK,IAA/B+X,EAAM,UAAUC,YAChB/oB,KAAKgpB,gBAAgBF,EAAM,UAAW,EAAG/X,GAE7C,MAAM4b,EAAU7D,EAAM,UAAUniB,KAG1BimB,EAAgB5sB,KAAK6sB,aAAa/D,GAExC,GAAgB,QAAZ6D,IAAuBA,GAAW3sB,KAAKqpB,UAAUP,GAC9B,iBAARld,GAAoBA,EAAIjH,OAAS,GACxC3E,KAAKyoB,SAASlf,KAAK,CACfvC,KAAM,4BACN+J,KAAMA,EAAK9I,OAAO,GAClBjH,MAAO4K,IAGf5L,KAAKspB,wBAAwBR,EAAO/X,QACjC,GAAgB,SAAZ4b,EACP3sB,KAAK8sB,aAAalhB,EAAK+gB,EAAS5b,GAChC/Q,KAAK+sB,iBAAiBjE,EAAOld,EAAKmF,QAC/B,GAAgB,YAAZ4b,EACP3sB,KAAKgtB,gBAAgBphB,EAAK+gB,EAAS5b,QAChC,IAAuC,IAAnCsX,GAAaziB,QAAQ+mB,GACvB3sB,KAAKitB,WAAWN,EAAS/gB,GAG1B5L,KAAKktB,YAAYN,EAAc,UAAW,MAAOzO,OAAOvS,GAAMmF,GAF9D/Q,KAAKmtB,mBAAmBR,EAAS5b,EAAMnF,OAIxC,IAAgB,WAAZ+gB,GAAyBA,EAGhC,MAAM,IAAIroB,MAAM,kCAAoCqoB,GAFpD3sB,KAAKktB,YAAYN,EAAc,UAAW,SAAUhhB,EAAKmF,EAG7D,CACJ,CAOA8b,YAAAA,CAAa/D,GACT,IAAKA,EAAM,YAAcA,EAAM,UAAUsE,MAAO,OAAOtE,EACvD,MAAMuE,ECnZP,SAAoBD,GACvB,GAAqB,iBAAVA,EAAoB,OAAO,KACtC,MAAME,EAAQF,EAAM/iB,MAAM,MAC1B,GAAqB,IAAjBijB,EAAM3oB,OAAc,OAAO,KAC/B,MAAM6d,EAAMrE,OAAOmP,EAAM,IACnBvf,EAAMoQ,OAAOmP,EAAM,IACzB,OAAIlP,MAAMoE,IAAQpE,MAAMrQ,GAAa,KAC9B,CAAEyU,MAAKzU,MAClB,CD2YuBwf,CAAWzE,EAAM,UAAUsE,OAC1C,OAAKC,EAEE,IACAvE,EACH,SAAU,IACHA,EAAM,UACTtG,SAA6Bnf,IAAxBylB,EAAM,UAAUtG,IAAoBsG,EAAM,UAAUtG,IAAM7O,OAAO0Z,EAAO7K,KAC7EzU,SAA6B1K,IAAxBylB,EAAM,UAAU/a,IAAoB+a,EAAM,UAAU/a,IAAM4F,OAAO0Z,EAAOtf,OAPjE+a,CAUxB,CAUAiE,gBAAAA,CAAiBjE,EAAOld,EAAKmF,GACzB,GAAIqN,MAAMgK,KAAKjB,MAAMvb,IAAO,OAC5B,MAAMkP,EAAIgO,EAAM,UAEhB,IAAItG,EAAM1H,EAAE0H,IACRzU,EAAM+M,EAAE/M,IAGZ,GAAI+M,EAAEsS,SAAW5K,IAAQzU,GAAM,CAC3B,MAAMsf,ECjaX,SAAwBD,GAC3B,GAAqB,iBAAVA,EAAoB,OAAO,KACtC,MAAME,EAAQF,EAAM/iB,MAAM,MAC1B,GAAqB,IAAjBijB,EAAM3oB,OAAc,OAAO,KAC/B,MAAO6d,EAAKzU,GAAOuf,EACnB,OAAIlP,MAAMgK,KAAKjB,MAAM3E,KAASpE,MAAMgK,KAAKjB,MAAMpZ,IAAc,KACtD,CAAEyU,MAAKzU,MAClB,CD0Z2Byf,CAAe1S,EAAEsS,OAC5BC,IACK7K,IAAKA,EAAM6K,EAAO7K,KAClBzU,IAAKA,EAAMsf,EAAOtf,KAE/B,MAEY1K,IAARmf,GAAsBiL,GAAqBjL,EAAK5W,IAChD5L,KAAK0tB,qBAAqB,MAAO3c,EAAMnF,EAAK4W,QAEpCnf,IAAR0K,GAAsB0f,GAAqB1f,EAAKnC,IAChD5L,KAAK0tB,qBAAqB,MAAO3c,EAAMnF,EAAKmC,EAEpD,CAMAub,uBAAAA,CAAwBR,EAAOoB,GAC3B,MAAMnb,EAAO1O,OAAO0O,KAAK+Z,GACzB,IAAK,IAAIzkB,EAAI,EAAGA,EAAI0K,EAAKpK,OAAQN,IAAK,CAClC,GAAgB,WAAZ0K,EAAK1K,GAAiB,SAC1B,MACMspB,EADQ7E,EAAM/Z,EAAK1K,IACG,UACxBspB,IACIA,EAAc1F,WAAa0F,EAAc1F,UAAY,QAKnB5kB,IAA3BsqB,EAAcC,UAAqD,UAA3BD,EAAcC,WAJ7D5tB,KAAKyoB,SAASlf,KAAK,CACfvC,KAAM,UACN+J,MAAOmZ,EAAU,IAAMnb,EAAK1K,IAAI4D,OAAO,IASvD,CACJ,CAMAohB,SAAAA,CAAUrY,GACN,GAAmB,iBAARA,EAAkB,OAAO,EACpC,MAAMjC,EAAO1O,OAAO0O,KAAKiC,GACzB,OAAIA,EAAI,UACgB,IAAhBjC,EAAKpK,aAAT,EACuB,IAAhBoK,EAAKpK,MAKpB,CAEA+oB,oBAAAA,CAAqBG,EAAM3D,EAASvC,EAAQD,GACxC1nB,KAAKyoB,SAASlf,KAAK,CACfvC,KAAM6mB,EACN9c,KAAMmZ,EAAQjiB,OAAO,GACrB0f,SACAD,YAER,CAEAsB,eAAAA,CAAgBF,EAAOnB,EAAQuC,GAC3B,CAAC,YAAa,aAAajB,QAAS4E,IAChC,QAAoBxqB,IAAhBylB,EAAM+E,GAAqB,CAC3B,MAAMnG,EAAWvJ,OAAO2K,EAAM+E,IACzBJ,GAAiBI,GAAMnG,EAAUC,IAClC3nB,KAAK0tB,qBAAqBG,EAAM3D,EAASvC,EAAQD,EAEzD,GAER,CAEAoG,YAAAA,CAAahF,EAAOnB,EAAQuC,GACxB,CAAC,MAAO,OAAOjB,QAAS4E,IACpB,QAAoBxqB,IAAhBylB,EAAM+E,GAAqB,CAC3B,MAAMnG,EAAWvJ,OAAO2K,EAAM+E,IACzBJ,GAAgBI,GAAMnG,EAAUC,IACjC3nB,KAAK0tB,qBAAqBG,EAAM3D,EAASvC,EAAQD,EAEzD,GAER,CAEAqG,WAAAA,CAAYjF,EAAOnB,EAAQuC,GACvB,CAAC,YAAa,YAAa,UAAUjB,QAAS4E,IAC1C,QAAoBxqB,IAAhBylB,EAAM+E,GAAqB,CAC3B,MAAMnG,EAAWvJ,OAAO2K,EAAM+E,IACzBJ,GAAmBI,GAAMnG,EAAUC,IACpC3nB,KAAK0tB,qBAAqBG,EAAM3D,EAASvC,EAAQD,EAEzD,IAEJ,CAAC,QAAS,MAAMuB,QAAS4E,IACrB,QAAoBxqB,IAAhBylB,EAAM+E,GAAqB,CAC3B,MAAMnG,EAAWoB,EAAM+E,GAClBJ,GAAmBI,GAAMnG,EAAUC,IACpC3nB,KAAK0tB,qBAAqBG,EAAM3D,EAASvC,EAAQD,EAEzD,IAEJ,CAAC,UAAW,YAAa,aAAc,cAAcuB,QAAS4E,IAC1D,QAAoBxqB,IAAhBylB,EAAM+E,GAAqB,CAC3B,IAAIhG,EAAW,GACXgG,EAAKlpB,OAAS,IAAGkjB,EAAWgG,EAAKvoB,UAAU,IAC/C,MAAMoiB,EAAWoB,EAAM+E,GAClBJ,GAA4B,QAAE/F,EAAUC,EAAQE,IACjD7nB,KAAK0tB,qBAAqB,UAAWxD,EAASvC,EAAQD,EAE9D,GAER,CAEAwF,WAAAA,CAAYpE,EAAO6D,EAAShF,EAAQuC,GAChB,WAAZyC,EAAsB3sB,KAAK+tB,YAAYjF,EAAOnB,EAAQuC,GACrC,QAAZyC,GAAmB3sB,KAAK8tB,aAAahF,EAAOnB,EAAQuC,EACjE,CAEA8C,eAAAA,CAAgBrF,EAAQgF,EAASzC,IACiB,IAA1ClqB,KAAK+D,QAAQiqB,QAAQpoB,QAAQ+hB,IAC7B3nB,KAAKmtB,mBAAmBR,EAASzC,EAASvC,EAElD,CAEAsF,UAAAA,CAAWN,EAAS/gB,GAChB,GAAKwS,MAAMxS,GAUP,OAAO,EAVM,CACb,MAAM8Y,EAAMvG,OAAOvS,GACnB,GACiB,oBAAZ+gB,GAAiCjI,EAAM,GAC3B,oBAAZiI,GAAiCjI,EAAM,GAC3B,YAAZiI,IA+GjB,SAAe3rB,GACX,MAAMitB,EAAIC,WAAWltB,GACrB,OAAY,EAAJitB,KAAWA,CACvB,CAlH2CE,CAAMviB,GAEjC,OAAO,CAEf,CAGA,OAAO,CACX,CAEAkhB,YAAAA,CAAalhB,EAAK+gB,EAASzC,GACvB,MAAM/B,EAAOC,KAAKjB,MAAMvb,GACpBwS,MAAM+J,IAAOnoB,KAAKmtB,mBAAmBR,EAASzC,EAASte,EAC/D,CAEAuhB,kBAAAA,CAAmBR,EAASzC,EAASte,GACjC5L,KAAKyoB,SAASlf,KAAK,CACfvC,KAAM,SAAW2lB,EACjB5b,KAAMmZ,EAAQjiB,OAAO,GACrBjH,MAAO4K,GAEf,CAOAme,oBAAAA,CAAqBL,EAAMZ,EAAO/X,GAC1B2Y,EAAKZ,OACLY,EAAKZ,MAAMG,QAASmF,IAChB,MAAMC,EAAYvF,EAAMsF,GAAS,UAC7BC,IAAqC,UAAvBA,EAAUT,UAAwBS,EAAUpG,UAAY,IACtEjoB,KAAKyoB,SAASlf,KAAK,CACfvC,KAAM,UACN+J,MAAOA,EAAO,IAAMqd,GAASnmB,OAAO,MAKxD,CAMA6hB,oBAAAA,CAAqBJ,EAAM3Y,GACnB2Y,EAAKnjB,OAASvG,KAAK+D,QAAQuqB,cAC3B5E,EAAKnjB,KAAK0iB,QAASjY,IACfhR,KAAKyoB,SAASlf,KAAK,CACfvC,KAAM,UACN+J,MAAOA,EAAO,IAAMC,GAAK/I,OAAO,MAIhD,EAMJ,MAAMsmB,GAAoBjG,GAAU3nB,UAAUioB,SAE9CN,GAAU3nB,UAAUioB,SAAW,SAAkBC,EAAK1oB,EAAK2oB,EAAO/X,GAC9D,GACI1C,MAAMrC,QAAQ6c,SACJxlB,IAAVylB,QACoBzlB,IAApBylB,EAAM,gBACyBzlB,IAA/BylB,EAAM,UAAUC,WAmBhB,OAhBA/oB,KAAKgpB,gBAAgBF,EAAM,UAAWD,EAAIlkB,OAAQoM,GAClD8X,EAAII,QAAQ,CAACrd,EAAKpF,KACd,MAAM0iB,EAAYnY,EAAO,IAAMvK,EAAQ,IACvC,GAAInG,OAAO0O,KAAK+Z,GAAOnkB,OAAS,EAC5B3E,KAAKmpB,wBAAwBN,EAAIriB,GAAQsiB,EAAOI,OAC7C,CAEH,MAAMsF,EAAc1F,EACpByF,GAAkB1tB,KAAKb,KAAM6oB,EAAIriB,GAAQrG,EAAKquB,EAAatF,EAC/D,SAIAL,EAAIlkB,OAAS,GAAuB,iBAAXkkB,EAAI,IAC7B7oB,KAAKyuB,sBAAsB5F,EAAKC,EAAO/X,IAM/Cwd,GAAkB1tB,KAAKb,KAAM6oB,EAAK1oB,EAAK2oB,EAAO/X,EAClD,EASAuX,GAAU3nB,UAAU8tB,sBAAwB,SAAUrC,EAAOtD,EAAO/X,GAC9C1Q,OAAO0O,KAAK+Z,GAAO4F,OAAQC,GAAY,WAANA,GACzC1F,QAASoD,IACf,MAAM5B,EAAa3B,EAAMuD,GACpB5B,GAAeA,EAAW,WACK,SAAhCA,EAAW,UAAUoB,QACzB7rB,KAAKmsB,yBAAyBC,EAAOC,EAAUtb,IAEvD,EE9rBA,MAAMrN,GAAiB,CACnB4qB,cAAc,EACdN,QAAS,CAAC,OAAQ,UAuEtB,SAASY,GAAgBC,GACrB,IAAKA,EAAS,MAAM,IAAIvqB,MAAM,cACzB,GAAuB,iBAAZuqB,EAAsB,MAAM,IAAIvqB,MAAM,sBACtD,MAAMhB,EAASkkB,GAAavB,SAAS4I,EAAS,CAC1CtnB,wBAAwB,IAE5B,IAAe,IAAXjE,EACA,MAAM,IAAIgB,MAAMhB,EAAOoG,IAAIC,IAAM,IAAMrG,EAAOoG,IAAIzC,KAE1D,CAEA,SA/EO,MAKHG,WAAAA,CAAY0hB,EAAO/kB,GACf6qB,GAAgB9F,GAChB,MAAMgG,EAAa,IAAI7H,GAAU,CAC7Bjc,kBAAkB,EAClBF,oBAAqB,SACrBD,oBAAqB,GACrBtD,wBAAwB,IAE5BvH,KAAK8oB,MAAQgG,EAAW3H,MAAM2B,GAC9B9oB,KAAK+D,QAAU1D,OAAO2D,OAAO,CAAC,EAAGN,GAAgBK,GACjD/D,KAAKuoB,WAAa,CAAC,EAEnBvoB,KAAKuG,KAAO,IAChB,CAOAwoB,QAAAA,CAASrtB,EAAMqjB,GACX/kB,KAAKuoB,WAAW7mB,GAAQqjB,CAC5B,CAOAkB,QAAAA,CAAS4I,GACLD,GAAgBC,GAMhB,MAAMrG,EAAe,IAAItlB,IAmBnBoe,EAPS,IAAI2F,GAAU,CACzBjc,kBAAkB,EAClBF,oBAAqB,KACrBD,oBAAqB,GACrBK,eAAe,EACfQ,kBAhBsBA,CAACC,EAASqjB,EAAUtiB,KAE1C,MAAMuiB,EAAUviB,EAAMyI,YAAY,KAC5B+Z,GAA0B,IAAbD,EAAiB,GAAKviB,EAAMpH,UAAU,EAAG2pB,GACvDzG,EAAavS,IAAIiZ,IAAa1G,EAAahlB,IAAI0rB,EAAY,IAChE,MAAMxc,EAAW8V,EAAahoB,IAAI0uB,GAGlC,OADIxc,EAASA,EAAS/N,OAAS,KAAOgH,GAAS+G,EAASnJ,KAAKoC,GACtDqjB,KAUW7H,MAAM0H,GAC5B7uB,KAAKuG,KAAO+a,EACZ,MAAM6N,EAAY,IAAI7G,GAAUtoB,KAAK+D,QAAS/D,KAAKuoB,WAAYC,GAE/D,OADA2G,EAAUvG,SAAStH,EAAQ,GAAIthB,KAAK8oB,MAAO,IACpCqG,EAAU1G,QACrB,GCtEwD,IAEtD2G,GAAe,oBAAAA,IAAA,CAGlB,OAHkBA,EACZnJ,SAAP,SAAgB7hB,EAASL,GACvB,OtBUG,SAAkBK,EAASL,GAChCA,EAAU1D,OAAO2D,OAAO,CAAC,EAAGN,EAAgBK,GAE5C,IAAMwc,EAAO,GACT2F,GAAW,EAGXC,GAAc,EAEC,WAAf/hB,EAAQ,KAEVA,EAAUA,EAAQ6D,OAAO,IAG3B,IAAI5F,EAAa,MACjB,GAAI+B,EAAQ0F,WAAW,SAAU,CAC/B,IAAMulB,EAybV,SAA6BjrB,GAC3B,IAAMkrB,EAAQlrB,EAAQwB,QAAQ,OACf,IAAX0pB,GACFnnB,EAAW,aAAc,2CAA4C,CAAElB,KAAM,EAAGC,IAAK,IAcvF,IAXA,IASI+B,EATEsmB,EAAWnrB,EAAQkB,UAAU,EAAGgqB,GAChCE,EAAMF,EAAQ,EAGdG,EAAU,CAAC,UAAW,WAAY,cAClCC,EAAS,4CAEXhT,EAAU,MACViT,GAAkB,EAGqB,QAAnC1mB,EAAQymB,EAAOxmB,KAAKqmB,KAAqB,CAC/C,IAAM1lB,EAAWZ,EAAM,GACjByK,OAAyBrQ,IAAb4F,EAAM,GAAmBA,EAAM,GAAKA,EAAM,GACtD2mB,EAAU3mB,EAAMzC,MAGhBqpB,EAAaJ,EAAQ7pB,QAAQiE,IACf,IAAhBgmB,GACF1nB,EAAW,aACT,+CAAiD0B,EAAW,6CAC5D,CAAE5C,KAAM,EAAGC,IAAK,EAAI0oB,IAIpBC,GAAcF,GAChBxnB,EAAW,aACT,8BAAgC0B,EAAW,oEAC3C,CAAE5C,KAAM,EAAGC,IAAK,EAAI0oB,IAExBD,EAAiBE,EAEA,YAAbhmB,GACgB,QAAd6J,GAAqC,QAAdA,GACzBvL,EAAW,aACT,4BAA8BuL,EAAY,8CAC1C,CAAEzM,KAAM,EAAGC,IAAK,EAAI0oB,IAExBlT,EAAUhJ,GACY,eAAb7J,GACS,QAAd6J,GAAqC,OAAdA,GACzBvL,EAAW,aACT,+BAAiCuL,EAAY,uCAC7C,CAAEzM,KAAM,EAAGC,IAAK,EAAI0oB,GAI5B,CAGA,IAAME,EAAWP,EAAS9tB,QAAQ,sCAAuC,IAAI2E,OAO7E,OANI0pB,EAASnrB,OAAS,GACpBwD,EAAW,aACT,8CAAgD2nB,EAAW,KAC3D,CAAE7oB,KAAM,EAAGC,IAAK,IAGb,CAAEwV,QAAAA,EAAS8S,IAAAA,EACpB,CAzfuBO,CAAoB3rB,GACvC,GAAIirB,EAAW3lB,IAAK,OAAO2lB,EAC3BhtB,EAAagtB,EAAW3S,QACxBtY,EAAUA,EAAQkB,UAAU+pB,EAAWG,IACzC,CAUA,IARA,IAAMlnB,EAAmB,IAAIxE,EAAiBC,EAAQ0D,QAASpF,GAKzDyG,EAAiBpG,EAAgB,QAAS,CAAEL,WAAAA,IAC5CuF,EAAgBlF,EAAgB,OAAQ,CAAEL,WAAAA,IAEvCgC,EAAI,EAAGA,EAAID,EAAQO,OAAQN,IAClC,GAAmB,MAAfD,EAAQC,IAAiC,MAAnBD,EAAQC,EAAI,IAGpC,IADAA,EAAIsD,EAAOvD,EADXC,GAAK,EACkBuD,IACjB8B,IAAK,OAAOrF,OACb,GAAmB,MAAfD,EAAQC,GAAY,CAG7B,IAAIgiB,EAAchiB,EAGlB,GAAmB,MAAfD,IAFJC,GAEwB,CACtB,IACEA,EAAIgE,EAAoBjE,EAASC,EAAGiE,EACtC,CAAE,MAAOoB,GACPvB,EAAW,aAAcuB,EAAI3C,QAASqB,EAAyBhE,EAASC,EAAI,GAC9E,CACA,QACF,CACE,IAAIiiB,GAAa,EACE,MAAfliB,EAAQC,KACViiB,GAAa,EACbjiB,KAIF,IADA,IAAIsH,EAAU,GAEZtH,EAAID,EAAQO,QACG,MAAfP,EAAQC,IACO,MAAfD,EAAQC,IACO,OAAfD,EAAQC,IACO,OAAfD,EAAQC,IACO,OAAfD,EAAQC,GACRA,IAEAsH,GAAWvH,EAAQC,GAIe,OAFpCsH,EAAUA,EAAQvF,QAENuF,EAAQhH,OAAS,KAE3BgH,EAAUA,EAAQrG,UAAU,EAAGqG,EAAQhH,OAAS,GAChDN,KAKGyE,EAAe6C,IAOlBxD,EAAW,aALmB,IAA1BwD,EAAQvF,OAAOzB,OACX,2BAEA,QAAUgH,EAAU,wBAEEvD,EAAyBhE,EAASiiB,IAGlE,IAAM/iB,EAASmF,EAAiBrE,EAASC,IAC1B,IAAXf,GACF6E,EAAW,cAAe,mBAAqBwD,EAAU,qBAAsBvD,EAAyBhE,EAASC,IAEnH,IAAIqE,EAAUpF,EAAOtC,MAGrB,GAFAqD,EAAIf,EAAOkD,MAEyB,MAAhCkC,EAAQA,EAAQ/D,OAAS,GAAY,CAEvC,IAAM6hB,EAAeniB,EAAIqE,EAAQ/D,OAE3B8hB,EAAU5d,EADhBH,EAAUA,EAAQpD,UAAU,EAAGoD,EAAQ/D,OAAS,GACCZ,EAAS+E,EAAgBzG,IAC1D,IAAZokB,IACkB,IAAhBN,GACFhe,EAAW,aAAc,sCAAuCC,EAAyBhE,EAASiiB,IAEpGH,GAAW,EAES,IAAhB3F,EAAK5b,SACPwhB,GAAc,IAMhBhe,EAAWse,EAAQ/c,IAAI1C,KAAMyf,EAAQ/c,IAAIC,IAAKvB,EAAyBhE,EAASoiB,EAAeC,EAAQ/c,IAAIzC,MAE/G,MAAO,GAAIqf,EACT,GAAKhjB,EAAOqF,UAEL,GAAID,EAAQtC,OAAOzB,OAAS,EACjCwD,EAAW,aAAc,gBAAkBwD,EAAU,+CAAgDvD,EAAyBhE,EAASiiB,SAClI,GAAoB,IAAhB9F,EAAK5b,OACdwD,EAAW,aAAc,gBAAkBwD,EAAU,yBAA0BvD,EAAyBhE,EAASiiB,QAC5G,CACL,IAAMK,EAAMnG,EAAK3N,MACjB,GAAIjH,IAAY+a,EAAI/a,QAAS,CAC3B,IAAIgb,EAAUve,EAAyBhE,EAASsiB,EAAIL,aACpDle,EACE,aACA,yBAA2Bue,EAAI/a,QAAU,qBAAuBgb,EAAQ1f,KAAO,SAAW0f,EAAQzf,IAAM,6BAA+ByE,EAAU,KACjJvD,EAAyBhE,EAASiiB,GAEtC,CAGoB,IAAhB9F,EAAK5b,SACPwhB,GAAc,EAElB,MApBEhe,EAAW,aAAc,gBAAkBwD,EAAU,iCAAkCvD,EAAyBhE,EAASC,QAqBtH,CACL,IAAMoiB,EAAU5d,EAAwBH,EAAS3E,EAAS+E,EAAgBzG,IAC1D,IAAZokB,GACFte,EAAWse,EAAQ/c,IAAI1C,KAAMyf,EAAQ/c,IAAIC,IAAKvB,EAAyBhE,EAASC,EAAIqE,EAAQ/D,OAAS8hB,EAAQ/c,IAAIzC,QAG/F,IAAhBkf,EACFhe,EAAW,aAAc,sCAAuCC,EAAyBhE,EAASC,KAC9C,IAA3CN,EAAQyD,aAAa5B,QAAQ+F,IAGtC4U,EAAKhX,KAAK,CAAEoC,QAAAA,EAAS0a,YAAAA,IAEvBH,GAAW,CACb,CAIA,IAAK7hB,IAAKA,EAAID,EAAQO,OAAQN,IAC5B,GAAmB,MAAfD,EAAQC,GAAY,CACtB,GAAuB,MAAnBD,EAAQC,EAAI,GAAY,CAE1BA,IACA,IACEA,EAAIgE,EAAoBjE,EAASC,EAAGiE,EACtC,CAAE,MAAOoB,GACPvB,EAAW,iBAAkBuB,EAAI3C,QAASqB,EAAyBhE,EAASC,EAAI,GAClF,CACA,QACF,CAAO,GAAuB,MAAnBD,EAAQC,EAAI,GAKrB,MAFA,IADAA,EAAIsD,EAAOvD,EADXC,GAAK,EACkBuD,IACjB8B,IAAK,OAAOrF,CAItB,MAAO,GAAmB,MAAfD,EAAQC,GAAY,CAC7B,IAAMuiB,EAAW7c,EAAkB3F,EAASC,IAC1B,IAAduiB,GACFze,EAAW,cAAe,4BAA6BC,EAAyBhE,EAASC,IAC3FA,EAAIuiB,CACN,MACsB,IAAhBT,GAAyBze,EAAatD,EAAQC,KAChD8D,EAAW,aAAc,wBAAyBC,EAAyBhE,EAASC,IAIvE,MAAfD,EAAQC,IACVA,GAGN,KAAO,CACL,GAAIqD,EAAatD,EAAQC,IACvB,SAEE8hB,GACFhe,EAAW,aAAc,2BAA6B/D,EAAQC,GAAK,qBAAsB+D,EAAyBhE,EAASC,IAE7H8D,EAAW,cAAe,SAAW/D,EAAQC,GAAK,qBAAsB+D,EAAyBhE,EAASC,GAC5G,CAaF,OAVK6hB,EAEsB,IAAhB3F,EAAK5b,OACdwD,EAAW,aAAc,iBAAmBoY,EAAK,GAAG5U,QAAU,KAAMvD,EAAyBhE,EAASmc,EAAK,GAAG8F,cACrG9F,EAAK5b,OAAS,GACvBwD,EAAW,aAAc,YACvB0e,KAAKC,UAAUvG,EAAKjS,IAAI,SAAAyY,GAAC,OAAIA,EAAEpb,OAAO,IAAGlK,QAAQ,SAAU,IAC3D,WAAY,CAAEwF,KAAM,EAAGC,IAAK,IAN9BiB,EAAW,aAAc,sBAAuB,CAAElB,KAAM,EAAGC,IAAK,KAS3D,CACT,CsB5NW8oB,CAAe5rB,EAASL,EACjC,EAACqrB,CAAA,CAHkB,G","sources":["webpack://fxp/webpack/universalModuleDefinition","webpack://fxp/webpack/bootstrap","webpack://fxp/webpack/runtime/define property getters","webpack://fxp/webpack/runtime/hasOwnProperty shorthand","webpack://fxp/webpack/runtime/make namespace object","webpack://fxp/./node_modules/xml-naming/src/index.js","webpack://fxp/./src/DocTypeValidator.js","webpack://fxp/./src/ValidationError.js","webpack://fxp/./src/validator.js","webpack://fxp/./src/util.js","webpack://fxp/./node_modules/fast-xml-parser/src/util.js","webpack://fxp/./node_modules/fast-xml-parser/src/xmlparser/OptionsBuilder.js","webpack://fxp/./node_modules/fast-xml-parser/src/xmlparser/xmlNode.js","webpack://fxp/./node_modules/fast-xml-parser/src/xmlparser/DocTypeReader.js","webpack://fxp/./node_modules/strnum/strnum.js","webpack://fxp/./node_modules/path-expression-matcher/src/Matcher.js","webpack://fxp/./node_modules/path-expression-matcher/src/Expression.js","webpack://fxp/./node_modules/path-expression-matcher/src/ExpressionSet.js","webpack://fxp/./node_modules/@nodable/entities/src/entities.js","webpack://fxp/./node_modules/@nodable/entities/src/EntityDecoder.js","webpack://fxp/./node_modules/fast-xml-parser/src/xmlparser/OrderedObjParser.js","webpack://fxp/./node_modules/fast-xml-parser/src/ignoreAttributes.js","webpack://fxp/./node_modules/fast-xml-parser/src/xmlparser/node2json.js","webpack://fxp/./node_modules/fast-xml-parser/src/validator.js","webpack://fxp/./node_modules/fast-xml-parser/src/xmlparser/XMLParser.js","webpack://fxp/./node_modules/fast-xml-parser/src/fxp.js","webpack://fxp/./node_modules/detailed-xml-validator/src/validations.js","webpack://fxp/./node_modules/detailed-xml-validator/src/Traverser.js","webpack://fxp/./node_modules/detailed-xml-validator/src/util.js","webpack://fxp/./node_modules/detailed-xml-validator/src/validator.js","webpack://fxp/./src/fxv.js"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"fxp\"] = factory();\n\telse\n\t\troot[\"fxp\"] = factory();\n})(this, () => {\nreturn ","// The require scope\nvar __webpack_require__ = {};\n\n","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","/*\n xml-naming\n * Validates XML Name productions as defined in the XML 1.0 and 1.1 specifications.\n * Covers: Name, NCName, QName, NMToken, NMTokens\n \n XML 1.0 spec: https://www.w3.org/TR/xml/#NT-Name\n * XML 1.1 spec: https://www.w3.org/TR/xml11/#NT-NameStartChar\n * XML NS spec: https://www.w3.org/TR/xml-names/#NT-NCName\n /\n\n// ---------------------------------------------------------------------------\n// Character class strings — XML 1.0\n//\n// NameStartChar ::= \":\" \| [A-Z] \| \"_\" \| [a-z]\n// \| [#xC0-#xD6] \| [#xD8-#xF6] \| [#xF8-#x2FF]\n// \| [#x370-#x37D] \| [#x37F-#x1FFF] <- split to exclude #x0487\n// \| [#x200C-#x200D]\n// \| [#x2070-#x218F] \| [#x2C00-#x2FEF]\n// \| [#x3001-#xD7FF] \| [#xF900-#xFDCF] \| [#xFDF0-#xFFFD]\n//\n// NameChar ::= NameStartChar \| \"-\" \| \".\" \| [0-9]\n// \| #xB7 \| [#x0300-#x036F] \| [#x203F-#x2040]\n//\n// Note: \\u0487 (Combining Cyrillic Millions Sign) was added in Unicode 4.0,\n// after XML 1.0 was defined against Unicode 2.0. It falls inside the range\n// \\u037F-\\u1FFF but must be excluded. We split that range into\n// \\u037F-\\u0486 and \\u0488-\\u1FFF to exclude it explicitly.\n// ---------------------------------------------------------------------------\n\nconst nameStartChar10 =\n ':A-Za-z_' +\n '\\u00C0-\\u00D6\\u00D8-\\u00F6\\u00F8-\\u02FF' +\n '\\u0370-\\u037D' +\n '\\u037F-\\u0486\\u0488-\\u1FFF' + // split to exclude \\u0487\n '\\u200C-\\u200D' +\n '\\u2070-\\u218F' +\n '\\u2C00-\\u2FEF' +\n '\\u3001-\\uD7FF' +\n '\\uF900-\\uFDCF' +\n '\\uFDF0-\\uFFFD';\n\nconst nameChar10 =\n nameStartChar10 +\n '\\\\-\\\\.\\\\d' +\n '\\u00B7' +\n '\\u0300-\\u036F' +\n '\\u203F-\\u2040';\n\n// ---------------------------------------------------------------------------\n// Character class strings — XML 1.1\n//\n// Differences from XML 1.0:\n//\n// NameStartChar:\n// 1.0 has split ranges: \\u00C0-\\u00D6, \\u00D8-\\u00F6, \\u00F8-\\u02FF\n// 1.1 merges them into: \\u00C0-\\u02FF\n// (\\u00D7 x and \\u00F7 / are division symbols, excluded in both versions)\n//\n// 1.0 tops out at \\uFFFD (BMP only)\n// 1.1 adds \\u{10000}-\\u{EFFFF} (supplementary planes)\n// These require the /u flag on the RegExp — see buildRegexes below.\n//\n// NameChar:\n// 1.1 adds \\u0487 (Combining Cyrillic Millions Sign, added in Unicode 4.0)\n// ---------------------------------------------------------------------------\n\nconst nameStartChar11 =\n ':A-Za-z_' +\n '\\u00C0-\\u02FF' + // merged — 1.0 had three split ranges here\n '\\u0370-\\u037D' +\n '\\u037F-\\u0486\\u0488-\\u1FFF' + // split to exclude \\u0487 (combining mark, never a NameStartChar)\n '\\u200C-\\u200D' +\n '\\u2070-\\u218F' +\n '\\u2C00-\\u2FEF' +\n '\\u3001-\\uD7FF' +\n '\\uF900-\\uFDCF' +\n '\\uFDF0-\\uFFFD' +\n '\\u{10000}-\\u{EFFFF}'; // supplementary planes — REQUIRES /u flag on RegExp\n\nconst nameChar11 =\n nameStartChar11 +\n '\\\\-\\\\.\\\\d' +\n '\\u00B7' +\n '\\u0300-\\u036F' +\n '\\u0487' + // Combining Cyrillic Millions Sign — valid in 1.1, not 1.0\n '\\u203F-\\u2040';\n\n// ---------------------------------------------------------------------------\n// Regex builders\n//\n// XML 1.0 regexes: no flags — BMP only, standard JS regex behaviour.\n// XML 1.1 regexes: /u flag — required for \\u{10000}-\\u{EFFFF} to match actual\n// supplementary code points rather than lone surrogates (which are illegal XML).\n// ---------------------------------------------------------------------------\n\nconst buildRegexes = (startChar, char, flags = '') => {\n const ncStart = startChar.replace(':', '');\n const ncChar = char.replace(':', '');\n const ncNamePat = `[${ncStart}][${ncChar}]`;\n\n return {\n name: new RegExp(`^[${startChar}][${char}]$`, flags),\n ncName: new RegExp(`^${ncNamePat}$`, flags),\n qName: new RegExp(`^${ncNamePat}(?::${ncNamePat})?$`, flags),\n nmToken: new RegExp(`^[${char}]+$`, flags),\n nmTokens: new RegExp(`^[${char}]+(?:\\\\s+[${char}]+)$`, flags),\n };\n};\n\nconst regexes10 = buildRegexes(nameStartChar10, nameChar10); // no /u — BMP only\nconst regexes11 = buildRegexes(nameStartChar11, nameChar11, 'u'); // /u — enables \\u{10000}-\\u{EFFFF}\n\n// ---------------------------------------------------------------------------\n// ASCII-only fast path (opt-in, off by default)\n//\n// The XML 1.0 vs 1.1 NameStartChar/NameChar productions differ only in\n// their non-ASCII ranges (merged vs split Latin-1 ranges, \\u0487, and\n// supplementary planes). Restricted to ASCII, both versions collapse to the\n// same character classes, so a single regex pair covers both xmlVersion\n// values — no /u flag needed.\n//\n// Rationale: unicode-aware regexes (the /u flag, required for XML 1.1's\n// supplementary-plane range) are measurably slower in V8 than plain\n// non-unicode regexes on the same input, even when the input is pure ASCII.\n// For the common case — HTML/SVG ids, XML tags — names are ASCII, so callers\n// who know this can opt in to skip the unicode-aware matching path entirely.\n// This is a real but conditional win: mainly for XML 1.1 input (avoids /u),\n// or at scale where the larger unicode character classes add engine\n// overhead. It also changes behaviour (rejects legitimate non-ASCII XML\n// 1.0/1.1 names), so it must never be silently enabled — hence off by\n// default.\n// ---------------------------------------------------------------------------\n\nconst nameStartCharAscii = ':A-Za-z_';\nconst nameCharAscii = nameStartCharAscii + '\\\\-\\\\.\\\\d';\n\nconst regexesAscii = buildRegexes(nameStartCharAscii, nameCharAscii); // no /u — ASCII only\n\nconst getRegexes = (xmlVersion = '1.0', asciiOnly = false) => {\n if (asciiOnly) return regexesAscii;\n return xmlVersion === '1.1' ? regexes11 : regexes10;\n};\n\n// ---------------------------------------------------------------------------\n// Boolean validators\n// ---------------------------------------------------------------------------\n\n/*\n Returns true if the string is a valid XML Name.\n * Colons are allowed anywhere (Name production).\n * Used for: DOCTYPE entity names, notation names, DTD element declarations.\n \n @param {{ xmlVersion?: '1.0'\|'1.1', asciiOnly?: boolean }} [opts]\n * asciiOnly: skip unicode-aware matching, ASCII names only (default false).\n /\nexport const name = (str, { xmlVersion = '1.0', asciiOnly = false } = {}) =>\n getRegexes(xmlVersion, asciiOnly).name.test(str);\n\n/\n Returns true if the string is a valid NCName (Non-Colonized Name).\n * Colons are not permitted.\n * Used for: namespace prefixes, local names, SVG id attributes.\n \n @param {{ xmlVersion?: '1.0'\|'1.1', asciiOnly?: boolean }} [opts]\n * asciiOnly: skip unicode-aware matching, ASCII names only (default false).\n /\nexport const ncName = (str, { xmlVersion = '1.0', asciiOnly = false } = {}) =>\n getRegexes(xmlVersion, asciiOnly).ncName.test(str);\n\n/\n Returns true if the string is a valid QName (Qualified Name).\n * Allows exactly one colon as a prefix separator: prefix:localName.\n * Used for: element and attribute names in namespace-aware XML/SVG.\n \n @param {{ xmlVersion?: '1.0'\|'1.1', asciiOnly?: boolean }} [opts]\n * asciiOnly: skip unicode-aware matching, ASCII names only (default false).\n /\nexport const qName = (str, { xmlVersion = '1.0', asciiOnly = false } = {}) =>\n getRegexes(xmlVersion, asciiOnly).qName.test(str);\n\n/\n Returns true if the string is a valid NMToken.\n * Like Name but no restriction on the first character.\n * Used for: DTD NMTOKEN attribute values.\n \n @param {{ xmlVersion?: '1.0'\|'1.1', asciiOnly?: boolean }} [opts]\n * asciiOnly: skip unicode-aware matching, ASCII names only (default false).\n /\nexport const nmToken = (str, { xmlVersion = '1.0', asciiOnly = false } = {}) =>\n getRegexes(xmlVersion, asciiOnly).nmToken.test(str);\n\n/\n Returns true if the string is a valid NMTokens value.\n * A whitespace-separated list of NMToken values.\n * Used for: DTD NMTOKENS attribute values.\n \n @param {{ xmlVersion?: '1.0'\|'1.1', asciiOnly?: boolean }} [opts]\n * asciiOnly: skip unicode-aware matching, ASCII names only (default false).\n /\nexport const nmTokens = (str, { xmlVersion = '1.0', asciiOnly = false } = {}) =>\n getRegexes(xmlVersion, asciiOnly).nmTokens.test(str);\n\n// ---------------------------------------------------------------------------\n// Memoized validator factory\n//\n// Real documents reuse a small vocabulary of tag/attribute names across many\n// siblings (e.g. `id`, `class`, `href` repeated across hundreds of elements).\n// The plain boolean validators above re-run the regex on every call\n// regardless of repeats. `createValidator` returns a closure with a private\n// string -> boolean cache, so repeated names after the first become O(1)\n// lookups instead of regex tests.\n//\n// - opts (xmlVersion, asciiOnly) are fixed at creation time, so the regex is\n// resolved once, not on every call.\n// - The cache is private to the returned closure — no shared/global state,\n// no cross-caller pollution.\n// - `maxCacheSize` bounds memory: once the cache reaches this many entries,\n// it stops accepting new ones (existing entries keep serving hits; new\n// misses just fall through to the regex, uncached). This avoids unbounded\n// growth against adversarial/high-cardinality input (e.g. validating\n// attacker-supplied names with no repeats) without the cost/complexity of\n// a full LRU, and without the perf cliff of reset-and-refill thrashing.\n// - Call `.reset()` on the returned function to clear the cache manually\n// (e.g. between unrelated parse calls).\n// ---------------------------------------------------------------------------\n\nconst PRODUCTIONS = ['name', 'ncName', 'qName', 'nmToken', 'nmTokens'];\n\n/\n Returns a memoized boolean validator function for a single production,\n * with opts fixed at creation time.\n \n @param {'name'\|'ncName'\|'qName'\|'nmToken'\|'nmTokens'} production\n * @param {{ xmlVersion?: '1.0'\|'1.1', asciiOnly?: boolean, maxCacheSize?: number }} [opts]\n * maxCacheSize: max number of distinct strings to cache (default 2048).\n * Once reached, new strings are validated but not cached; existing cached\n * entries keep being served.\n * @returns {((str: string) => boolean) & { reset: () => void }}\n /\nexport const createValidator = (production, { xmlVersion = '1.0', asciiOnly = false, maxCacheSize = 2048 } = {}) => {\n if (!PRODUCTIONS.includes(production)) {\n throw new TypeError(\n `Unknown production \"${production}\". Must be one of: ${PRODUCTIONS.join(', ')}`\n );\n }\n\n const regex = getRegexes(xmlVersion, asciiOnly)[production];\n let cache = new Map();\n\n const validator = (str) => {\n const cached = cache.get(str);\n if (cached !== undefined) return cached;\n\n const result = regex.test(str);\n if (cache.size < maxCacheSize) cache.set(str, result);\n return result;\n };\n\n validator.reset = () => { cache = new Map(); };\n\n return validator;\n};\n\n// ---------------------------------------------------------------------------\n// Diagnostic validator\n// ---------------------------------------------------------------------------\n\n/\n Validates a string against a named production and returns a detailed result.\n \n @param {string} str\n * @param {'name'\|'ncName'\|'qName'\|'nmToken'\|'nmTokens'} production\n * @param {{ xmlVersion?: '1.0'\|'1.1', asciiOnly?: boolean }} [opts]\n * @returns {{ valid: boolean, production: string, input: string, reason?: string, position?: number }}\n /\nexport const validate = (str, production, { xmlVersion = '1.0', asciiOnly = false } = {}) => {\n if (!PRODUCTIONS.includes(production)) {\n throw new TypeError(\n `Unknown production \"${production}\". Must be one of: ${PRODUCTIONS.join(', ')}`\n );\n }\n\n const validators = { name, ncName, qName, nmToken, nmTokens };\n const isValid = validators[production](str, { xmlVersion, asciiOnly });\n\n if (isValid) return { valid: true, production, input: str };\n\n let reason = 'Does not match the production rules';\n let position;\n\n // Diagnostic fallback char checks must mirror the same character set the\n // boolean validator above used, or the reported reason/position could\n // contradict the `valid: false` result (e.g. flagging a char as illegal\n // that the unicode-aware check would have accepted).\n const startCharPattern = asciiOnly ? /^[:A-Za-z_]/ : /^[:A-Za-z_\\u00C0-\\uFFFD]/;\n const namePattern = asciiOnly ? /[\\w\\-\\\\.:]/ : /[\\w\\-\\\\.:\\u00B7\\u00C0-\\uFFFD]/;\n\n if (str.length === 0) {\n reason = 'Input is empty';\n } else if (production === 'ncName' && str.includes(':')) {\n position = str.indexOf(':');\n reason = 'Colon is not allowed in NCName';\n } else if (production === 'qName' && str.startsWith(':')) {\n reason = 'QName cannot start with a colon';\n position = 0;\n } else if (production === 'qName' && str.endsWith(':')) {\n reason = 'QName cannot end with a colon';\n position = str.length - 1;\n } else if (production === 'qName' && (str.match(/:/g) \|\| []).length > 1) {\n reason = 'QName can have at most one colon';\n position = str.lastIndexOf(':');\n } else if (\n ['name', 'ncName', 'qName'].includes(production) &&\n !startCharPattern.test(str[0])\n ) {\n reason = `First character \"${str[0]}\" is not a valid NameStartChar`;\n position = 0;\n } else {\n for (let i = 0; i < str.length; i++) {\n if (!namePattern.test(str[i])) {\n reason = `Character \"${str[i]}\" at position ${i} is not a valid NameChar`;\n position = i;\n break;\n }\n }\n }\n\n return { valid: false, production, input: str, reason, position };\n};\n\n// ---------------------------------------------------------------------------\n// Batch validator\n// ---------------------------------------------------------------------------\n\n/\n Validates an array of strings against a named production.\n \n @param {string[]} strings\n * @param {'name'\|'ncName'\|'qName'\|'nmToken'\|'nmTokens'} production\n * @param {{ xmlVersion?: '1.0'\|'1.1', asciiOnly?: boolean }} [opts]\n * @returns {Array<{ valid: boolean, production: string, input: string, reason?: string, position?: number }>}\n /\nexport const validateAll = (strings, production, opts = {}) =>\n strings.map(str => validate(str, production, opts));\n\n// ---------------------------------------------------------------------------\n// Sanitizer\n// ---------------------------------------------------------------------------\n\n/\n Transforms an invalid string into the nearest valid XML name for the given production.\n \n @param {string} str\n * @param {'name'\|'ncName'\|'qName'\|'nmToken'\|'nmTokens'} production\n * @param {{ replacement?: string, asciiOnly?: boolean }} [opts]\n * asciiOnly: also replace any non-ASCII character, not just XML-illegal\n * ones (default false).\n * @returns {string}\n /\nexport const sanitize = (str, production = 'name', { replacement = '_', asciiOnly = false } = {}) => {\n if (!str) return replacement;\n\n let result = str;\n\n // Strip colons for NCName\n if (production === 'ncName') {\n result = result.replace(/:/g, '');\n }\n\n // Replace illegal characters\n const allowedCharPattern = asciiOnly ? /[^\\w\\-\\.:]/g : /[^\\w\\-\\.:\\u00B7\\u00C0-\\uFFFD]/g;\n result = result.replace(allowedCharPattern, replacement);\n\n // Fix invalid start character for Name / NCName / QName\n if (production !== 'nmToken' && production !== 'nmTokens') {\n if (/^[\\-\\.\\d]/.test(result)) {\n result = replacement + result;\n }\n }\n\n return result \|\| replacement;\n};","import { name as isXmlName } from 'xml-naming';\n\nconst defaultOptions = {\n maxEntityCount: Infinity,\n maxEntitySize: Infinity,\n};\n\nexport default class DocTypeValidator {\n constructor(options, xmlVersion = '1.0') {\n this.options = Object.assign({}, defaultOptions, options);\n this.suppressValidationErr = !options;\n this.xmlVersion = xmlVersion;\n }\n\n validateDocType(xmlData, i) {\n if (\n xmlData[i + 3] !== 'O' \|\|\n xmlData[i + 4] !== 'C' \|\|\n xmlData[i + 5] !== 'T' \|\|\n xmlData[i + 6] !== 'Y' \|\|\n xmlData[i + 7] !== 'P' \|\|\n xmlData[i + 8] !== 'E'\n ) {\n throw new Error(`Invalid Tag instead of DOCTYPE`);\n }\n\n i += 9;\n let angleBracketsCount = 1;\n let hasBody = false;\n let comment = false;\n let entityCount = 0;\n\n for (; i < xmlData.length; i++) {\n if (xmlData[i] === '<' && !comment) {\n if (hasBody && hasSeq(xmlData, '!ENTITY', i)) {\n i += 7;\n [entityCount, i] = this._validateEntityExp(xmlData, i + 1, entityCount);\n // continue;\n } else if (hasBody && hasSeq(xmlData, '!ELEMENT', i)) {\n i += 8;\n i = this._validateElementExp(xmlData, i + 1);\n // continue;\n } else if (hasBody && hasSeq(xmlData, '!ATTLIST', i)) {\n i += 8;\n i = this._validateAttlistExp(xmlData, i + 1);\n continue;\n } else if (hasBody && hasSeq(xmlData, '!NOTATION', i)) {\n i += 9;\n i = this._validateNotationExp(xmlData, i + 1);\n // continue;\n } else if (hasSeq(xmlData, '!--', i)) {\n comment = true;\n } else {\n throw new Error(`Invalid DOCTYPE`);\n }\n angleBracketsCount++;\n } else if (xmlData[i] === '>') {\n if (comment) {\n if (xmlData[i - 1] === '-' && xmlData[i - 2] === '-') {\n comment = false;\n angleBracketsCount--;\n }\n } else {\n angleBracketsCount--;\n }\n if (angleBracketsCount === 0) break;\n } else if (xmlData[i] === '[') {\n hasBody = true;\n }\n }\n\n if (angleBracketsCount !== 0) {\n throw new Error(`Unclosed DOCTYPE`);\n }\n\n return i;\n }\n\n _validateEntityExp(xmlData, i, entityCount) {\n i = skipWhitespace(xmlData, i);\n\n // Read and validate entity name\n const nameStart = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i]) && xmlData[i] !== '\"' && xmlData[i] !== \"'\") {\n i++;\n }\n const entityName = xmlData.substring(nameStart, i);\n validateName(entityName, this.xmlVersion);\n\n i = skipWhitespace(xmlData, i);\n\n // Check for unsupported constructs\n if (!this.suppressValidationErr) {\n if (xmlData.substring(i, i + 6).toUpperCase() === 'SYSTEM') {\n throw new Error('External entities are not supported');\n } else if (xmlData[i] === '%') {\n throw new Error('Parameter entities are not supported');\n }\n }\n\n // Read and validate the entity value (validates quoting + size limit)\n let entityValue;\n [i, entityValue] = readQuotedValue(xmlData, i, 'entity');\n\n const { maxEntitySize, maxEntityCount } = this.options;\n\n if (entityValue.length > maxEntitySize) {\n throw new Error(\n `Entity \"${entityName}\" size (${entityValue.length}) exceeds maximum allowed size (${maxEntitySize})`\n );\n }\n\n // Only count non-parameter entities (parameter entities contain '&')\n if (entityValue.indexOf('&') === -1) {\n entityCount++;\n if (entityCount > maxEntityCount) {\n throw new Error(\n `Entity count (${entityCount}) exceeds maximum allowed (${maxEntityCount})`\n );\n }\n }\n\n return [entityCount, i - 1];\n }\n\n _validateNotationExp(xmlData, i) {\n i = skipWhitespace(xmlData, i);\n\n // Read and validate notation name\n const nameStart = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) i++;\n const notationName = xmlData.substring(nameStart, i);\n !this.suppressValidationErr && validateName(notationName, this.xmlVersion);\n\n i = skipWhitespace(xmlData, i);\n\n const identifierType = xmlData.substring(i, i + 6).toUpperCase();\n if (!this.suppressValidationErr && identifierType !== 'SYSTEM' && identifierType !== 'PUBLIC') {\n throw new Error(`Expected SYSTEM or PUBLIC, found \"${identifierType}\"`);\n }\n i += identifierType.length;\n i = skipWhitespace(xmlData, i);\n\n if (identifierType === 'PUBLIC') {\n [i] = readQuotedValue(xmlData, i, 'publicIdentifier');\n i = skipWhitespace(xmlData, i);\n if (xmlData[i] === '\"' \|\| xmlData[i] === \"'\") {\n [i] = readQuotedValue(xmlData, i, 'systemIdentifier');\n }\n } else if (identifierType === 'SYSTEM') {\n [i] = readQuotedValue(xmlData, i, 'systemIdentifier');\n }\n\n return --i;\n }\n\n _validateElementExp(xmlData, i) {\n i = skipWhitespace(xmlData, i);\n\n // Read and validate element name\n const nameStart = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) i++;\n const elementName = xmlData.substring(nameStart, i);\n if (!this.suppressValidationErr && !isXmlName(elementName, { xmlVersion: this.xmlVersion })) {\n throw new Error(`Invalid element name: \"${elementName}\"`);\n }\n\n i = skipWhitespace(xmlData, i);\n\n // Validate content model keyword or group\n if (xmlData[i] === 'E' && hasSeq(xmlData, 'MPTY', i)) {\n i += 4;\n } else if (xmlData[i] === 'A' && hasSeq(xmlData, 'NY', i)) {\n i += 2;\n } else if (xmlData[i] === '(') {\n i++;\n while (i < xmlData.length && xmlData[i] !== ')') i++;\n if (xmlData[i] !== ')') throw new Error('Unterminated content model');\n } else if (!this.suppressValidationErr) {\n throw new Error(`Invalid Element Expression, found \"${xmlData[i]}\"`);\n }\n\n return i;\n }\n\n _validateAttlistExp(xmlData, i) {\n i = skipWhitespace(xmlData, i);\n\n // Read element name\n const elemNameStart = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) i++;\n const elementName = xmlData.substring(elemNameStart, i);\n validateName(elementName, this.xmlVersion);\n\n i = skipWhitespace(xmlData, i);\n\n // Read attribute name\n const attrNameStart = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) i++;\n const attributeName = xmlData.substring(attrNameStart, i);\n validateName(attributeName, this.xmlVersion);\n\n i = skipWhitespace(xmlData, i);\n\n // Read attribute type\n if (xmlData.substring(i, i + 8).toUpperCase() === 'NOTATION') {\n i += 8;\n i = skipWhitespace(xmlData, i);\n if (xmlData[i] !== '(') throw new Error(`Expected '(', found \"${xmlData[i]}\"`);\n i++;\n while (i < xmlData.length && xmlData[i] !== ')') {\n const notationStart = i;\n while (i < xmlData.length && xmlData[i] !== '\|' && xmlData[i] !== ')') i++;\n const notation = xmlData.substring(notationStart, i).trim();\n validateName(notation, this.xmlVersion);\n if (xmlData[i] === '\|') {\n i++;\n i = skipWhitespace(xmlData, i);\n }\n }\n if (xmlData[i] !== ')') throw new Error('Unterminated list of notations');\n i++;\n } else {\n const typeStart = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) i++;\n const attributeType = xmlData.substring(typeStart, i);\n const validTypes = ['CDATA', 'ID', 'IDREF', 'IDREFS', 'ENTITY', 'ENTITIES', 'NMTOKEN', 'NMTOKENS'];\n if (!this.suppressValidationErr && !validTypes.includes(attributeType.toUpperCase())) {\n throw new Error(`Invalid attribute type: \"${attributeType}\"`);\n }\n }\n\n i = skipWhitespace(xmlData, i);\n\n // Read default value declaration\n if (xmlData.substring(i, i + 9).toUpperCase() === '#REQUIRED') {\n i += 9;\n } else if (xmlData.substring(i, i + 8).toUpperCase() === '#IMPLIED') {\n i += 8;\n } else {\n [i] = readQuotedValue(xmlData, i, 'ATTLIST default value');\n }\n\n return i;\n }\n}\n\n// ─── Helpers ────────────────────────────────────────────────────────────────\n\nfunction skipWhitespace(data, index) {\n while (index < data.length && /\\s/.test(data[index])) index++;\n return index;\n}\n\nfunction hasSeq(data, seq, i) {\n for (let j = 0; j < seq.length; j++) {\n if (seq[j] !== data[i + j + 1]) return false;\n }\n return true;\n}\n\nfunction validateName(name, xmlVersion = '1.0') {\n if (!isXmlName(name, { xmlVersion })) throw new Error(`Invalid entity name \"${name}\"`);\n}\n\n/\n Read a single- or double-quoted string and return [nextIndex, value].\n /\nfunction readQuotedValue(xmlData, i, type) {\n const startChar = xmlData[i];\n if (startChar !== '\"' && startChar !== \"'\") {\n throw new Error(`Expected quoted string for ${type}, found \"${startChar}\"`);\n }\n i++;\n const start = i;\n while (i < xmlData.length && xmlData[i] !== startChar) i++;\n if (xmlData[i] !== startChar) throw new Error(`Unterminated ${type} value`);\n const value = xmlData.substring(start, i);\n return [++i, value];\n}","export default class ValidationError extends Error {\n constructor(message, code, line, col) {\n super(message);\n this.name = this.constructor.name;\n this.code = code;\n this.line = line;\n this.col = col;\n Error.captureStackTrace?.(this, this.constructor);\n }\n}","'use strict';\n\nimport { getAllMatches } from './util.js';\nimport { createValidator } from 'xml-naming';\nimport DocTypeValidator from './DocTypeValidator.js';\nimport ValidationError from './ValidationError.js';\n\nconst defaultOptions = {\n allowBooleanAttributes: false,\n unpairedTags: [],\n // DOCTYPE entity limits — Infinity means no limit by default\n docType: {\n maxEntityCount: Infinity,\n maxEntitySize: Infinity,\n },\n};\n\nexport function validate(xmlData, options) {\n options = Object.assign({}, defaultOptions, options);\n\n const tags = [];\n let tagFound = false;\n\n //indicates that the root tag has been closed (aka. depth 0 has been reached)\n let reachedRoot = false;\n\n if (xmlData[0] === '\\ufeff') {\n // check for byte order mark (BOM)\n xmlData = xmlData.substr(1);\n }\n\n let xmlVersion = '1.0'; // default per spec\n if (xmlData.startsWith('<?xml')) {\n const declResult = parseXmlDeclaration(xmlData);\n if (declResult.err) return declResult;\n xmlVersion = declResult.version;\n xmlData = xmlData.substring(declResult.end);\n }\n\n const docTypeValidator = new DocTypeValidator(options.docType, xmlVersion);\n\n // One memoized validator instance per production for this parse call — element/attribute\n // names are repeated across many siblings, so caching pays off. xmlVersion is fixed for\n // the whole parse, so it's safe to bind it once here rather than re-resolving per call.\n const qNameValidator = createValidator('qName', { xmlVersion });\n const nameValidator = createValidator('name', { xmlVersion });\n\n for (let i = 0; i < xmlData.length; i++) {\n if (xmlData[i] === '<' && xmlData[i + 1] === '?') {\n i += 2;\n i = readPI(xmlData, i, nameValidator);\n if (i.err) return i;\n } else if (xmlData[i] === '<') {\n //starting of tag\n //read until you reach to '>' avoiding any '>' in attribute value\n let tagStartPos = i;\n i++;\n\n if (xmlData[i] === '!') {\n try {\n i = readCommentAndCDATA(xmlData, i, docTypeValidator);\n } catch (err) {\n throwError(\"InvalidTag\", err.message, getLineNumberForPosition(xmlData, i - 1));\n }\n continue;\n } else {\n let closingTag = false;\n if (xmlData[i] === '/') {\n closingTag = true;\n i++;\n }\n\n let tagName = '';\n for (;\n i < xmlData.length &&\n xmlData[i] !== '>' &&\n xmlData[i] !== ' ' &&\n xmlData[i] !== '\\t' &&\n xmlData[i] !== '\\n' &&\n xmlData[i] !== '\\r';\n i++\n ) {\n tagName += xmlData[i];\n }\n tagName = tagName.trim();\n\n if (tagName[tagName.length - 1] === '/') {\n //self closing tag without attributes\n tagName = tagName.substring(0, tagName.length - 1);\n i--;\n }\n\n // use the shared qName validator so namespaced tags (e.g. <ns:tag>) are\n // accepted and malformed ones (e.g. <:tag>, <ns:>, <a:b:c>) are rejected.\n if (!qNameValidator(tagName)) {\n let msg;\n if (tagName.trim().length === 0) {\n msg = \"Invalid space after '<'.\";\n } else {\n msg = \"Tag '\" + tagName + \"' is an invalid name.\";\n }\n throwError('InvalidTag', msg, getLineNumberForPosition(xmlData, tagStartPos));\n }\n\n const result = readAttributeStr(xmlData, i);\n if (result === false) {\n throwError('InvalidAttr', \"Attributes for '\" + tagName + \"' have open quote.\", getLineNumberForPosition(xmlData, i));\n }\n let attrStr = result.value;\n i = result.index;\n\n if (attrStr[attrStr.length - 1] === '/') {\n //self closing tag\n const attrStrStart = i - attrStr.length;\n attrStr = attrStr.substring(0, attrStr.length - 1);\n const isValid = validateAttributeString(attrStr, options, qNameValidator, xmlVersion);\n if (isValid === true) {\n if (reachedRoot === true) {\n throwError('InvalidXml', 'Multiple possible root nodes found.', getLineNumberForPosition(xmlData, tagStartPos));\n }\n tagFound = true;\n //if no open tags remain on the stack, this self-closing tag is the root\n if (tags.length === 0) {\n reachedRoot = true;\n }\n } else {\n //the result from the nested function returns the position of the error within the attribute\n //in order to get the 'true' error line, we need to calculate the position where the attribute begins (i - attrStr.length) and then add the position within the attribute\n //this gives us the absolute index in the entire xml, which we can use to find the line at last\n throwError(isValid.err.code, isValid.err.msg, getLineNumberForPosition(xmlData, attrStrStart + isValid.err.line));\n }\n } else if (closingTag) {\n if (!result.tagClosed) {\n throwError('InvalidTag', \"Closing tag '\" + tagName + \"' doesn't have proper closing.\", getLineNumberForPosition(xmlData, i));\n } else if (attrStr.trim().length > 0) {\n throwError('InvalidTag', \"Closing tag '\" + tagName + \"' can't have attributes or invalid starting.\", getLineNumberForPosition(xmlData, tagStartPos));\n } else if (tags.length === 0) {\n throwError('InvalidTag', \"Closing tag '\" + tagName + \"' has not been opened.\", getLineNumberForPosition(xmlData, tagStartPos));\n } else {\n const otg = tags.pop();\n if (tagName !== otg.tagName) {\n let openPos = getLineNumberForPosition(xmlData, otg.tagStartPos);\n throwError(\n 'InvalidTag',\n \"Expected closing tag '\" + otg.tagName + \"' (opened in line \" + openPos.line + \", col \" + openPos.col + \") instead of closing tag '\" + tagName + \"'.\",\n getLineNumberForPosition(xmlData, tagStartPos)\n );\n }\n\n //when there are no more tags, we reached the root level.\n if (tags.length === 0) {\n reachedRoot = true;\n }\n }\n } else {\n const isValid = validateAttributeString(attrStr, options, qNameValidator, xmlVersion);\n if (isValid !== true) {\n throwError(isValid.err.code, isValid.err.msg, getLineNumberForPosition(xmlData, i - attrStr.length + isValid.err.line));\n }\n\n if (reachedRoot === true) {\n throwError('InvalidXml', 'Multiple possible root nodes found.', getLineNumberForPosition(xmlData, i));\n } else if (options.unpairedTags.indexOf(tagName) !== -1) {\n // don't push into stack\n } else {\n tags.push({ tagName, tagStartPos });\n }\n tagFound = true;\n }\n\n //skip tag text value\n //It may include comments and CDATA value\n for (i++; i < xmlData.length; i++) {\n if (xmlData[i] === '<') {\n if (xmlData[i + 1] === '!') {\n //comment or CADATA\n i++;\n try {\n i = readCommentAndCDATA(xmlData, i, docTypeValidator);\n } catch (err) {\n throwError(\"InvalidDocType\", err.message, getLineNumberForPosition(xmlData, i - 1));\n }\n continue;\n } else if (xmlData[i + 1] === '?') {\n i += 2;\n i = readPI(xmlData, i, nameValidator);\n if (i.err) return i;\n } else {\n break;\n }\n } else if (xmlData[i] === '&') {\n const afterAmp = validateAmpersand(xmlData, i);\n if (afterAmp === -1)\n throwError('InvalidChar', \"char '&' is not expected.\", getLineNumberForPosition(xmlData, i));\n i = afterAmp;\n } else {\n if (reachedRoot === true && !isWhiteSpace(xmlData[i])) {\n throwError('InvalidXml', 'Extra text at the end', getLineNumberForPosition(xmlData, i));\n }\n }\n } //end of reading tag text value\n if (xmlData[i] === '<') {\n i--;\n }\n }\n } else {\n if (isWhiteSpace(xmlData[i])) {\n continue;\n }\n if (reachedRoot) {\n throwError('InvalidXml', \"Extra text at the end: '\" + xmlData[i] + \"' is not expected.\", getLineNumberForPosition(xmlData, i));\n }\n throwError('InvalidChar', \"char '\" + xmlData[i] + \"' is not expected.\", getLineNumberForPosition(xmlData, i));\n }\n }\n\n if (!tagFound) {\n throwError('InvalidXml', 'Start tag expected.', { line: 1, col: 1 });\n } else if (tags.length === 1) {\n throwError('InvalidTag', \"Unclosed tag '\" + tags[0].tagName + \"'.\", getLineNumberForPosition(xmlData, tags[0].tagStartPos));\n } else if (tags.length > 0) {\n throwError('InvalidXml', \"Invalid '\" +\n JSON.stringify(tags.map(t => t.tagName)).replace(/\\r?\\n/g, '') +\n \"' found.\", { line: 1, col: 1 });\n }\n\n return true;\n}\n\nfunction isWhiteSpace(char) {\n return char === ' ' \|\| char === '\\t' \|\| char === '\\n' \|\| char === '\\r';\n}\n\nfunction readPI(xmlData, i, nameValidator) {\n const piStart = i; // points just after '<?'\n const nameStart = i;\n let nameValidated = false;\n\n for (; i < xmlData.length; i++) {\n const ch = xmlData[i];\n\n if (!nameValidated && (ch === ' ' \|\| ch === '?')) {\n // First delimiter — extract and validate the PI target name once\n const piName = xmlData.substr(nameStart, i - nameStart);\n nameValidated = true;\n\n if (piName.toLowerCase() === 'xml') {\n throwError(\n 'InvalidXml',\n 'XML declaration allowed only at the start of the document.',\n getLineNumberForPosition(xmlData, piStart - 2) // point at '<'\n );\n } else if (!nameValidator(piName)) {\n // PI target must be a valid XML Name (XML 1.0 §2.6)\n throwError(\n 'InvalidXml',\n `Processing instruction target \"${piName}\" is not a valid XML Name.`,\n getLineNumberForPosition(xmlData, piStart - 2)\n );\n }\n }\n\n if (ch === '?' && xmlData[i + 1] === '>') {\n i++;\n return i;\n }\n }\n\n // reached EOF without closing '?>'\n throwError(\n 'InvalidXml',\n 'Processing instruction is not closed with \"?>\".',\n getLineNumberForPosition(xmlData, piStart - 2) // point at '<'\n );\n}\n\n/\n Handles comments, CDATA sections, and DOCTYPE declarations.\n * DOCTYPE validation is delegated to DocTypeValidator.\n * @param {string} xmlData\n * @param {number} i — points at the '!' character\n * @param {DocTypeValidator} docTypeValidator\n /\nfunction readCommentAndCDATA(xmlData, i, docTypeValidator) {\n if (xmlData.length > i + 2 && xmlData[i + 1] === '-' && xmlData[i + 2] === '-') {\n // Comment: <!-- ... -->\n for (i += 3; i < xmlData.length; i++) {\n if (xmlData[i] === '-' && xmlData[i + 1] === '-' && xmlData[i + 2] === '>') {\n i += 2;\n break;\n }\n }\n if (xmlData[i] !== '>') {\n throw new Error('Comment is not closed with \"-->\".');\n }\n } else if (\n xmlData.length > i + 7 &&\n xmlData[i + 1] === 'D' &&\n xmlData[i + 2] === 'O' &&\n xmlData[i + 3] === 'C' &&\n xmlData[i + 4] === 'T' &&\n xmlData[i + 5] === 'Y' &&\n xmlData[i + 6] === 'P' &&\n xmlData[i + 7] === 'E'\n ) {\n // DOCTYPE: delegate fully to DocTypeValidator\n // i currently points at '!', so the '<' is at i - 1\n i = docTypeValidator.validateDocType(xmlData, i - 1);\n } else if (\n xmlData.length > i + 8 &&\n xmlData[i + 1] === '[' &&\n xmlData[i + 2] === 'C' &&\n xmlData[i + 3] === 'D' &&\n xmlData[i + 4] === 'A' &&\n xmlData[i + 5] === 'T' &&\n xmlData[i + 6] === 'A' &&\n xmlData[i + 7] === '['\n ) {\n // CDATA: <![CDATA[ ... ]]>\n for (i += 8; i < xmlData.length; i++) {\n if (xmlData[i] === ']' && xmlData[i + 1] === ']' && xmlData[i + 2] === '>') {\n i += 2;\n break;\n }\n }\n if (xmlData[i] !== '>') {\n throw new Error('CDATA section is not closed with \"]]>\".');\n }\n } else {\n //Reject unrecognised <! constructs (e.g. <!ELEMENT, <!ATTLIST\n // appearing outside a DOCTYPE, or simply malformed \"<!xyz\").\n throw new Error(\"Invalid construct starting with '<!'.\");\n }\n\n return i;\n}\n\nconst doubleQuote = '\"';\nconst singleQuote = \"'\";\n\n/\n Keep reading xmlData until '<' is found outside the attribute value.\n * @param {string} xmlData\n * @param {number} i\n /\nfunction readAttributeStr(xmlData, i) {\n let attrStr = '';\n let startChar = '';\n let tagClosed = false;\n for (; i < xmlData.length; i++) {\n if (xmlData[i] === doubleQuote \|\| xmlData[i] === singleQuote) {\n if (startChar === '') {\n startChar = xmlData[i];\n } else if (startChar !== xmlData[i]) {\n // opposite quote inside value — allowed\n } else {\n startChar = '';\n }\n } else if (xmlData[i] === '>') {\n if (startChar === '') {\n tagClosed = true;\n break;\n }\n }\n attrStr += xmlData[i];\n }\n if (startChar !== '') {\n return false;\n }\n return { value: attrStr, index: i, tagClosed };\n}\n\nconst validAttrStrRegxp = new RegExp('(\\\\s)([^\\\\s=]+)(\\\\s=)?(\\\\s([\\'\"])(([\\\\s\\\\S])?)\\\\5)?', 'g');\n\nfunction validateAttributeString(attrStr, options, qNameValidator, xmlVersion) {\n const matches = getAllMatches(attrStr, validAttrStrRegxp);\n const attrNames = {};\n\n for (let i = 0; i < matches.length; i++) {\n if (matches[i][1].length === 0) {\n return { err: { code: 'InvalidAttr', msg: \"Attribute '\" + matches[i][2] + \"' has no space in starting.\", line: getPositionFromMatch(matches[i]) } };\n } else if (matches[i][3] !== undefined && matches[i][4] === undefined) {\n return { err: { code: 'InvalidAttr', msg: \"Attribute '\" + matches[i][2] + \"' is without value.\", line: getPositionFromMatch(matches[i]) } };\n } else if (matches[i][3] === undefined && !options.allowBooleanAttributes) {\n return { err: { code: 'InvalidAttr', msg: \"boolean attribute '\" + matches[i][2] + \"' is not allowed.\", line: getPositionFromMatch(matches[i]) } };\n }\n\n const attrName = matches[i][2];\n\n //validate attribute names as QNames so namespaced attributes\n // (e.g. xml:lang, xmlns:xsi) are accepted and malformed ones are rejected.\n if (!qNameValidator(attrName)) {\n return { err: { code: 'InvalidAttr', msg: \"Attribute '\" + attrName + \"' is an invalid name.\", line: getPositionFromMatch(matches[i]) } };\n }\n\n // xmlns=\"\" (undeclaring the prefixed namespace) is valid in XML 1.1\n if (attrName.startsWith('xmlns:') && matches[i][6] === '' && xmlVersion === '1.0') {\n return {\n err: {\n code: 'InvalidAttr',\n msg: `Undeclaring the prefixed namespace ${attrName}=\"\" is only permitted in XML 1.1 documents.`,\n line: getPositionFromMatch(matches[i])\n }\n };\n }\n\n if (!Object.prototype.hasOwnProperty.call(attrNames, attrName)) {\n attrNames[attrName] = 1;\n } else {\n return { err: { code: 'InvalidAttr', msg: \"Attribute '\" + attrName + \"' is repeated.\", line: getPositionFromMatch(matches[i]) } };\n }\n }\n\n return true;\n}\n\nfunction validateNumberAmpersand(xmlData, i) {\n let re = /\\d/;\n if (xmlData[i] === 'x') {\n i++;\n re = /[\\da-fA-F]/;\n }\n for (; i < xmlData.length; i++) {\n if (xmlData[i] === ';') return i;\n if (!xmlData[i].match(re)) break;\n }\n return -1;\n}\n\nfunction validateAmpersand(xmlData, i) {\n i++;\n if (xmlData[i] === ';') return -1;\n if (xmlData[i] === '#') {\n i++;\n return validateNumberAmpersand(xmlData, i);\n }\n let count = 0;\n for (; i < xmlData.length; i++, count++) {\n if (xmlData[i].match(/\\w/) && count < 20) continue;\n if (xmlData[i] === ';') break;\n return -1;\n }\n return i;\n}\n\nfunction throwError(code, message, lineNumber) {\n throw new ValidationError(message, code, lineNumber.line \|\| lineNumber, lineNumber.col);\n}\n\nfunction getLineNumberForPosition(xmlData, index) {\n const lines = xmlData.substring(0, index).split(/\\r?\\n/);\n return {\n line: lines.length,\n col: lines[lines.length - 1].length + 1,\n };\n}\n\nfunction getPositionFromMatch(match) {\n return match.startIndex + match[1].length;\n}\n\n/\n Parses and validates the XML declaration: <?xml version=\"...\" encoding=\"...\" standalone=\"...\"?>\n \n Rules (XML 1.0 §2.8 / XML 1.1 §2.8):\n * - Attributes must appear in fixed order: version, encoding, standalone\n * - No other attributes are allowed\n * - version is optional (defaults to '1.0'); if present must be '1.0' or '1.1'\n * - encoding and standalone are optional\n * - All values must be quoted (single or double)\n \n @param {string} xmlData — full XML string starting with '<?xml'\n * @returns {{ version: string, end: number } \| { err: true }}\n /\nfunction parseXmlDeclaration(xmlData) {\n const piEnd = xmlData.indexOf('?>');\n if (piEnd === -1) {\n throwError('InvalidXml', 'XML declaration is not closed with \"?>\".', { line: 1, col: 1 });\n }\n\n const declBody = xmlData.substring(5, piEnd); // content between '<?xml' and '?>' — keep leading whitespace for regex\n const end = piEnd + 2;\n\n // Allowed attributes in required order\n const ALLOWED = ['version', 'encoding', 'standalone'];\n const attrRe = /\\s+([\\w]+)\\s=\\s(?:\"([^\"])\"\|'([^'])')/g;\n\n let version = '1.0';\n let lastAllowedIdx = -1;\n let match;\n\n while ((match = attrRe.exec(declBody)) !== null) {\n const attrName = match[1];\n const attrValue = match[2] !== undefined ? match[2] : match[3];\n const attrPos = match.index;\n\n // Must be a known attribute\n const allowedIdx = ALLOWED.indexOf(attrName);\n if (allowedIdx === -1) {\n throwError('InvalidXml',\n 'XML declaration contains unknown attribute \"' + attrName + '\". Allowed: version, encoding, standalone.',\n { line: 1, col: 6 + attrPos });\n }\n\n // Must appear in fixed order: version, encoding, standalone\n if (allowedIdx <= lastAllowedIdx) {\n throwError('InvalidXml',\n 'XML declaration attribute \"' + attrName + '\" is out of order. Required order: version, encoding, standalone.',\n { line: 1, col: 6 + attrPos });\n }\n lastAllowedIdx = allowedIdx;\n\n if (attrName === 'version') {\n if (attrValue !== '1.0' && attrValue !== '1.1') {\n throwError('InvalidXml',\n 'XML declaration version \"' + attrValue + '\" is not supported. Must be \"1.0\" or \"1.1\".',\n { line: 1, col: 6 + attrPos });\n }\n version = attrValue;\n } else if (attrName === 'standalone') {\n if (attrValue !== 'yes' && attrValue !== 'no') {\n throwError('InvalidXml',\n 'XML declaration standalone \"' + attrValue + '\" is invalid. Must be \"yes\" or \"no\".',\n { line: 1, col: 6 + attrPos });\n }\n }\n // encoding: value format validation is out of scope\n }\n\n // Check for leftover unrecognised content (e.g. unquoted tokens or junk)\n const leftover = declBody.replace(/\\s+[\\w]+\\s=\\s(?:\"[^\"]\"\|'[^']')/g, '').trim();\n if (leftover.length > 0) {\n throwError('InvalidXml',\n 'XML declaration contains invalid content: \"' + leftover + '\".',\n { line: 1, col: 1 });\n }\n\n return { version, end };\n}\n","'use strict';\n\nexport function getAllMatches(string, regex) {\n const matches = [];\n let match = regex.exec(string);\n while (match) {\n const allmatches = [];\n allmatches.startIndex = regex.lastIndex - match[0].length;\n const len = match.length;\n for (let index = 0; index < len; index++) {\n allmatches.push(match[index]);\n }\n matches.push(allmatches);\n match = regex.exec(string);\n }\n return matches;\n}\n\nexport function isExist(v) {\n return typeof v !== 'undefined';\n}\n\nexport function isEmptyObject(obj) {\n return Object.keys(obj).length === 0;\n}\n\nexport function getValue(v) {\n if (exports.isExist(v)) {\n return v;\n } else {\n return '';\n }\n}\n","'use strict';\n\nconst nameStartChar = ':A-Za-z_\\\\u00C0-\\\\u00D6\\\\u00D8-\\\\u00F6\\\\u00F8-\\\\u02FF\\\\u0370-\\\\u037D\\\\u037F-\\\\u1FFF\\\\u200C-\\\\u200D\\\\u2070-\\\\u218F\\\\u2C00-\\\\u2FEF\\\\u3001-\\\\uD7FF\\\\uF900-\\\\uFDCF\\\\uFDF0-\\\\uFFFD';\nconst nameChar = nameStartChar + '\\\\-.\\\\d\\\\u00B7\\\\u0300-\\\\u036F\\\\u203F-\\\\u2040';\nexport const nameRegexp = '[' + nameStartChar + '][' + nameChar + ']';\nconst regexName = new RegExp('^' + nameRegexp + '$');\n\nexport function getAllMatches(string, regex) {\n const matches = [];\n let match = regex.exec(string);\n while (match) {\n const allmatches = [];\n allmatches.startIndex = regex.lastIndex - match[0].length;\n const len = match.length;\n for (let index = 0; index < len; index++) {\n allmatches.push(match[index]);\n }\n matches.push(allmatches);\n match = regex.exec(string);\n }\n return matches;\n}\n\nexport const isName = function (string) {\n const match = regexName.exec(string);\n return !(match === null \|\| typeof match === 'undefined');\n}\n\nexport function isExist(v) {\n return typeof v !== 'undefined';\n}\n\nexport function isEmptyObject(obj) {\n return Object.keys(obj).length === 0;\n}\n\nexport function getValue(v) {\n if (exports.isExist(v)) {\n return v;\n } else {\n return '';\n }\n}\n\n/*\n Dangerous property names that could lead to prototype pollution or security issues\n /\nexport const DANGEROUS_PROPERTY_NAMES = [\n // '__proto__',\n // 'constructor',\n // 'prototype',\n 'hasOwnProperty',\n 'toString',\n 'valueOf',\n '__defineGetter__',\n '__defineSetter__',\n '__lookupGetter__',\n '__lookupSetter__'\n];\n\nexport const criticalProperties = [\"__proto__\", \"constructor\", \"prototype\"];","import { DANGEROUS_PROPERTY_NAMES, criticalProperties } from \"../util.js\";\nimport { COMMON_HTML, CURRENCY } from '@nodable/entities';\n\nconst defaultOnDangerousProperty = (name) => {\n if (DANGEROUS_PROPERTY_NAMES.includes(name)) {\n return \"__\" + name;\n }\n return name;\n};\n\n\nexport const defaultOptions = {\n preserveOrder: false,\n attributeNamePrefix: '@_',\n attributesGroupName: false,\n textNodeName: '#text',\n ignoreAttributes: true,\n removeNSPrefix: false, // remove NS from tag name or attribute name if true\n allowBooleanAttributes: false, //a tag can have attributes without any value\n //ignoreRootElement : false,\n parseTagValue: true,\n parseAttributeValue: false,\n trimValues: true, //Trim string values of tag and attributes\n cdataPropName: false,\n numberParseOptions: {\n hex: true,\n leadingZeros: true,\n eNotation: true\n },\n tagValueProcessor: function (tagName, val) {\n return val;\n },\n attributeValueProcessor: function (attrName, val) {\n return val;\n },\n stopNodes: [], //nested tags will not be parsed even for errors\n alwaysCreateTextNode: false,\n isArray: () => false,\n commentPropName: false,\n unpairedTags: [],\n processEntities: true,\n htmlEntities: false,\n entityDecoder: null,\n ignoreDeclaration: false,\n ignorePiTags: false,\n transformTagName: false,\n transformAttributeName: false,\n updateTag: function (tagName, jPath, attrs) {\n return tagName\n },\n // skipEmptyListItem: false\n captureMetaData: false,\n maxNestedTags: 100,\n strictReservedNames: true,\n jPath: true, // if true, pass jPath string to callbacks; if false, pass matcher instance\n onDangerousProperty: defaultOnDangerousProperty\n};\n\n\n/\n Validates that a property name is safe to use\n * @param {string} propertyName - The property name to validate\n * @param {string} optionName - The option field name (for error message)\n * @throws {Error} If property name is dangerous\n /\nfunction validatePropertyName(propertyName, optionName) {\n if (typeof propertyName !== 'string') {\n return; // Only validate string property names\n }\n\n const normalized = propertyName.toLowerCase();\n if (DANGEROUS_PROPERTY_NAMES.some(dangerous => normalized === dangerous.toLowerCase())) {\n throw new Error(\n `[SECURITY] Invalid ${optionName}: \"${propertyName}\" is a reserved JavaScript keyword that could cause prototype pollution`\n );\n }\n\n if (criticalProperties.some(dangerous => normalized === dangerous.toLowerCase())) {\n throw new Error(\n `[SECURITY] Invalid ${optionName}: \"${propertyName}\" is a reserved JavaScript keyword that could cause prototype pollution`\n );\n }\n}\n\n/\n Normalizes processEntities option for backward compatibility\n * @param {boolean\|object} value \n * @returns {object} Always returns normalized object\n /\nfunction normalizeProcessEntities(value, htmlEntities) {\n // Boolean backward compatibility\n if (typeof value === 'boolean') {\n return {\n enabled: value, // true or false\n maxEntitySize: 10000,\n maxExpansionDepth: 10000,\n maxTotalExpansions: Infinity,\n maxExpandedLength: 100000,\n maxEntityCount: 1000,\n allowedTags: null,\n tagFilter: null,\n appliesTo: \"all\",\n };\n }\n\n // Object config - merge with defaults\n if (typeof value === 'object' && value !== null) {\n return {\n enabled: value.enabled !== false,\n maxEntitySize: Math.max(1, value.maxEntitySize ?? 10000),\n maxExpansionDepth: Math.max(1, value.maxExpansionDepth ?? 10000),\n maxTotalExpansions: Math.max(1, value.maxTotalExpansions ?? Infinity),\n maxExpandedLength: Math.max(1, value.maxExpandedLength ?? 100000),\n maxEntityCount: Math.max(1, value.maxEntityCount ?? 1000),\n allowedTags: value.allowedTags ?? null,\n tagFilter: value.tagFilter ?? null,\n appliesTo: value.appliesTo ?? \"all\",\n };\n }\n\n // Default to enabled with limits\n return normalizeProcessEntities(true);\n}\n\nexport const buildOptions = function (options) {\n const built = Object.assign({}, defaultOptions, options);\n\n // Validate property names to prevent prototype pollution\n const propertyNameOptions = [\n { value: built.attributeNamePrefix, name: 'attributeNamePrefix' },\n { value: built.attributesGroupName, name: 'attributesGroupName' },\n { value: built.textNodeName, name: 'textNodeName' },\n { value: built.cdataPropName, name: 'cdataPropName' },\n { value: built.commentPropName, name: 'commentPropName' }\n ];\n\n for (const { value, name } of propertyNameOptions) {\n if (value) {\n validatePropertyName(value, name);\n }\n }\n\n if (built.onDangerousProperty === null) {\n built.onDangerousProperty = defaultOnDangerousProperty;\n }\n\n // Always normalize processEntities for backward compatibility and validation\n built.processEntities = normalizeProcessEntities(built.processEntities, built.htmlEntities);\n built.unpairedTagsSet = new Set(built.unpairedTags);\n // Convert old-style stopNodes for backward compatibility\n if (built.stopNodes && Array.isArray(built.stopNodes)) {\n built.stopNodes = built.stopNodes.map(node => {\n if (typeof node === 'string' && node.startsWith('.')) {\n // Old syntax: .tagname meant \"tagname anywhere\"\n // Convert to new syntax: ..tagname\n return '..' + node.substring(2);\n }\n return node;\n });\n }\n //console.debug(built.processEntities)\n return built;\n};","'use strict';\n\nlet METADATA_SYMBOL;\n\nif (typeof Symbol !== \"function\") {\n METADATA_SYMBOL = \"@@xmlMetadata\";\n} else {\n METADATA_SYMBOL = Symbol(\"XML Node Metadata\");\n}\n\nexport default class XmlNode {\n constructor(tagname) {\n this.tagname = tagname;\n this.child = []; //nested tags, text, cdata, comments in order\n this[\":@\"] = Object.create(null); //attributes map\n }\n add(key, val) {\n // this.child.push( {name : key, val: val, isCdata: isCdata });\n if (key === \"__proto__\") key = \"#__proto__\";\n this.child.push({ [key]: val });\n }\n addChild(node, startIndex) {\n if (node.tagname === \"__proto__\") node.tagname = \"#__proto__\";\n if (node[\":@\"] && Object.keys(node[\":@\"]).length > 0) {\n this.child.push({ [node.tagname]: node.child, [\":@\"]: node[\":@\"] });\n } else {\n this.child.push({ [node.tagname]: node.child });\n }\n // if requested, add the startIndex\n if (startIndex !== undefined) {\n // Note: for now we just overwrite the metadata. If we had more complex metadata,\n // we might need to do an object append here: metadata = { ...metadata, startIndex }\n this.child[this.child.length - 1][METADATA_SYMBOL] = { startIndex };\n }\n }\n /* symbol used for metadata /\n static getMetaDataSymbol() {\n return METADATA_SYMBOL;\n }\n}\n","import { isName } from '../util.js';\n\nexport default class DocTypeReader {\n constructor(options) {\n this.suppressValidationErr = !options;\n this.options = options;\n }\n\n readDocType(xmlData, i) {\n const entities = Object.create(null);\n let entityCount = 0;\n\n if (xmlData[i + 3] === 'O' &&\n xmlData[i + 4] === 'C' &&\n xmlData[i + 5] === 'T' &&\n xmlData[i + 6] === 'Y' &&\n xmlData[i + 7] === 'P' &&\n xmlData[i + 8] === 'E') {\n i = i + 9;\n let angleBracketsCount = 1;\n let hasBody = false, comment = false;\n let exp = \"\";\n for (; i < xmlData.length; i++) {\n if (xmlData[i] === '<' && !comment) { //Determine the tag type\n if (hasBody && hasSeq(xmlData, \"!ENTITY\", i)) {\n i += 7;\n let entityName, val;\n [entityName, val, i] = this.readEntityExp(xmlData, i + 1, this.suppressValidationErr);\n if (val.indexOf(\"&\") === -1) { //Parameter entities are not supported\n if (this.options.enabled !== false &&\n this.options.maxEntityCount != null &&\n entityCount >= this.options.maxEntityCount) {\n throw new Error(\n `Entity count (${entityCount + 1}) exceeds maximum allowed (${this.options.maxEntityCount})`\n );\n }\n //const escaped = entityName.replace(/[.\\-+:]/g, '\\\\.');\n //const escaped = entityName.replace(/[.+?^${}()\|[\\]\\\\]/g, '\\\\$&');\n entities[entityName] = val;\n entityCount++;\n }\n }\n else if (hasBody && hasSeq(xmlData, \"!ELEMENT\", i)) {\n i += 8;//Not supported\n const { index } = this.readElementExp(xmlData, i + 1);\n i = index;\n } else if (hasBody && hasSeq(xmlData, \"!ATTLIST\", i)) {\n i += 8;//Not supported\n // const {index} = this.readAttlistExp(xmlData,i+1);\n // i = index;\n } else if (hasBody && hasSeq(xmlData, \"!NOTATION\", i)) {\n i += 9;//Not supported\n const { index } = this.readNotationExp(xmlData, i + 1, this.suppressValidationErr);\n i = index;\n } else if (hasSeq(xmlData, \"!--\", i)) comment = true;\n else throw new Error(`Invalid DOCTYPE`);\n\n angleBracketsCount++;\n exp = \"\";\n } else if (xmlData[i] === '>') { //Read tag content\n if (comment) {\n if (xmlData[i - 1] === \"-\" && xmlData[i - 2] === \"-\") {\n comment = false;\n angleBracketsCount--;\n }\n } else {\n angleBracketsCount--;\n }\n if (angleBracketsCount === 0) {\n break;\n }\n } else if (xmlData[i] === '[') {\n hasBody = true;\n } else {\n exp += xmlData[i];\n }\n }\n if (angleBracketsCount !== 0) {\n throw new Error(`Unclosed DOCTYPE`);\n }\n } else {\n throw new Error(`Invalid Tag instead of DOCTYPE`);\n }\n return { entities, i };\n }\n readEntityExp(xmlData, i) {\n //External entities are not supported\n // <!ENTITY ext SYSTEM \"http://normal-website.com\" >\n\n //Parameter entities are not supported\n // <!ENTITY entityname \"&anotherElement;\">\n\n //Internal entities are supported\n // <!ENTITY entityname \"replacement text\">\n\n // Skip leading whitespace after <!ENTITY\n i = skipWhitespace(xmlData, i);\n\n // Read entity name\n const startIndex = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i]) && xmlData[i] !== '\"' && xmlData[i] !== \"'\") {\n i++;\n }\n let entityName = xmlData.substring(startIndex, i);\n\n validateEntityName(entityName);\n\n // Skip whitespace after entity name\n i = skipWhitespace(xmlData, i);\n\n // Check for unsupported constructs (external entities or parameter entities)\n if (!this.suppressValidationErr) {\n if (xmlData.substring(i, i + 6).toUpperCase() === \"SYSTEM\") {\n throw new Error(\"External entities are not supported\");\n } else if (xmlData[i] === \"%\") {\n throw new Error(\"Parameter entities are not supported\");\n }\n }\n\n // Read entity value (internal entity)\n let entityValue = \"\";\n [i, entityValue] = this.readIdentifierVal(xmlData, i, \"entity\");\n\n // Validate entity size\n if (this.options.enabled !== false &&\n this.options.maxEntitySize != null &&\n entityValue.length > this.options.maxEntitySize) {\n throw new Error(\n `Entity \"${entityName}\" size (${entityValue.length}) exceeds maximum allowed size (${this.options.maxEntitySize})`\n );\n }\n\n i--;\n return [entityName, entityValue, i];\n }\n\n readNotationExp(xmlData, i) {\n // Skip leading whitespace after <!NOTATION\n i = skipWhitespace(xmlData, i);\n\n // Read notation name\n\n const startIndex = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) {\n i++;\n }\n let notationName = xmlData.substring(startIndex, i);\n\n !this.suppressValidationErr && validateEntityName(notationName);\n\n // Skip whitespace after notation name\n i = skipWhitespace(xmlData, i);\n\n // Check identifier type (SYSTEM or PUBLIC)\n const identifierType = xmlData.substring(i, i + 6).toUpperCase();\n if (!this.suppressValidationErr && identifierType !== \"SYSTEM\" && identifierType !== \"PUBLIC\") {\n throw new Error(`Expected SYSTEM or PUBLIC, found \"${identifierType}\"`);\n }\n i += identifierType.length;\n\n // Skip whitespace after identifier type\n i = skipWhitespace(xmlData, i);\n\n // Read public identifier (if PUBLIC)\n let publicIdentifier = null;\n let systemIdentifier = null;\n\n if (identifierType === \"PUBLIC\") {\n [i, publicIdentifier] = this.readIdentifierVal(xmlData, i, \"publicIdentifier\");\n\n // Skip whitespace after public identifier\n i = skipWhitespace(xmlData, i);\n\n // Optionally read system identifier\n if (xmlData[i] === '\"' \|\| xmlData[i] === \"'\") {\n [i, systemIdentifier] = this.readIdentifierVal(xmlData, i, \"systemIdentifier\");\n }\n } else if (identifierType === \"SYSTEM\") {\n // Read system identifier (mandatory for SYSTEM)\n [i, systemIdentifier] = this.readIdentifierVal(xmlData, i, \"systemIdentifier\");\n\n if (!this.suppressValidationErr && !systemIdentifier) {\n throw new Error(\"Missing mandatory system identifier for SYSTEM notation\");\n }\n }\n\n return { notationName, publicIdentifier, systemIdentifier, index: --i };\n }\n\n readIdentifierVal(xmlData, i, type) {\n let identifierVal = \"\";\n const startChar = xmlData[i];\n if (startChar !== '\"' && startChar !== \"'\") {\n throw new Error(`Expected quoted string, found \"${startChar}\"`);\n }\n i++;\n\n const startIndex = i;\n while (i < xmlData.length && xmlData[i] !== startChar) {\n i++;\n }\n identifierVal = xmlData.substring(startIndex, i);\n\n if (xmlData[i] !== startChar) {\n throw new Error(`Unterminated ${type} value`);\n }\n i++;\n return [i, identifierVal];\n }\n\n readElementExp(xmlData, i) {\n // <!ELEMENT br EMPTY>\n // <!ELEMENT div ANY>\n // <!ELEMENT title (#PCDATA)>\n // <!ELEMENT book (title, author+)>\n // <!ELEMENT name (content-model)>\n\n // Skip leading whitespace after <!ELEMENT\n i = skipWhitespace(xmlData, i);\n\n // Read element name\n const startIndex = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) {\n i++;\n }\n let elementName = xmlData.substring(startIndex, i);\n\n // Validate element name\n if (!this.suppressValidationErr && !isName(elementName)) {\n throw new Error(`Invalid element name: \"${elementName}\"`);\n }\n\n // Skip whitespace after element name\n i = skipWhitespace(xmlData, i);\n let contentModel = \"\";\n // Expect '(' to start content model\n if (xmlData[i] === \"E\" && hasSeq(xmlData, \"MPTY\", i)) i += 4;\n else if (xmlData[i] === \"A\" && hasSeq(xmlData, \"NY\", i)) i += 2;\n else if (xmlData[i] === \"(\") {\n i++; // Move past '('\n\n // Read content model\n const startIndex = i;\n while (i < xmlData.length && xmlData[i] !== \")\") {\n i++;\n }\n contentModel = xmlData.substring(startIndex, i);\n\n if (xmlData[i] !== \")\") {\n throw new Error(\"Unterminated content model\");\n }\n\n } else if (!this.suppressValidationErr) {\n throw new Error(`Invalid Element Expression, found \"${xmlData[i]}\"`);\n }\n\n return {\n elementName,\n contentModel: contentModel.trim(),\n index: i\n };\n }\n\n readAttlistExp(xmlData, i) {\n // Skip leading whitespace after <!ATTLIST\n i = skipWhitespace(xmlData, i);\n\n // Read element name\n let startIndex = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) {\n i++;\n }\n let elementName = xmlData.substring(startIndex, i);\n\n // Validate element name\n validateEntityName(elementName)\n\n // Skip whitespace after element name\n i = skipWhitespace(xmlData, i);\n\n // Read attribute name\n startIndex = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) {\n i++;\n }\n let attributeName = xmlData.substring(startIndex, i);\n\n // Validate attribute name\n if (!validateEntityName(attributeName)) {\n throw new Error(`Invalid attribute name: \"${attributeName}\"`);\n }\n\n // Skip whitespace after attribute name\n i = skipWhitespace(xmlData, i);\n\n // Read attribute type\n let attributeType = \"\";\n if (xmlData.substring(i, i + 8).toUpperCase() === \"NOTATION\") {\n attributeType = \"NOTATION\";\n i += 8; // Move past \"NOTATION\"\n\n // Skip whitespace after \"NOTATION\"\n i = skipWhitespace(xmlData, i);\n\n // Expect '(' to start the list of notations\n if (xmlData[i] !== \"(\") {\n throw new Error(`Expected '(', found \"${xmlData[i]}\"`);\n }\n i++; // Move past '('\n\n // Read the list of allowed notations\n let allowedNotations = [];\n while (i < xmlData.length && xmlData[i] !== \")\") {\n\n\n const startIndex = i;\n while (i < xmlData.length && xmlData[i] !== \"\|\" && xmlData[i] !== \")\") {\n i++;\n }\n let notation = xmlData.substring(startIndex, i);\n\n // Validate notation name\n notation = notation.trim();\n if (!validateEntityName(notation)) {\n throw new Error(`Invalid notation name: \"${notation}\"`);\n }\n\n allowedNotations.push(notation);\n\n // Skip '\|' separator or exit loop\n if (xmlData[i] === \"\|\") {\n i++; // Move past '\|'\n i = skipWhitespace(xmlData, i); // Skip optional whitespace after '\|'\n }\n }\n\n if (xmlData[i] !== \")\") {\n throw new Error(\"Unterminated list of notations\");\n }\n i++; // Move past ')'\n\n // Store the allowed notations as part of the attribute type\n attributeType += \" (\" + allowedNotations.join(\"\|\") + \")\";\n } else {\n // Handle simple types (e.g., CDATA, ID, IDREF, etc.)\n const startIndex = i;\n while (i < xmlData.length && !/\\s/.test(xmlData[i])) {\n i++;\n }\n attributeType += xmlData.substring(startIndex, i);\n\n // Validate simple attribute type\n const validTypes = [\"CDATA\", \"ID\", \"IDREF\", \"IDREFS\", \"ENTITY\", \"ENTITIES\", \"NMTOKEN\", \"NMTOKENS\"];\n if (!this.suppressValidationErr && !validTypes.includes(attributeType.toUpperCase())) {\n throw new Error(`Invalid attribute type: \"${attributeType}\"`);\n }\n }\n\n // Skip whitespace after attribute type\n i = skipWhitespace(xmlData, i);\n\n // Read default value\n let defaultValue = \"\";\n if (xmlData.substring(i, i + 8).toUpperCase() === \"#REQUIRED\") {\n defaultValue = \"#REQUIRED\";\n i += 8;\n } else if (xmlData.substring(i, i + 7).toUpperCase() === \"#IMPLIED\") {\n defaultValue = \"#IMPLIED\";\n i += 7;\n } else {\n [i, defaultValue] = this.readIdentifierVal(xmlData, i, \"ATTLIST\");\n }\n\n return {\n elementName,\n attributeName,\n attributeType,\n defaultValue,\n index: i\n }\n }\n}\n\n\n\nconst skipWhitespace = (data, index) => {\n while (index < data.length && /\\s/.test(data[index])) {\n index++;\n }\n return index;\n};\n\n\n\nfunction hasSeq(data, seq, i) {\n for (let j = 0; j < seq.length; j++) {\n if (seq[j] !== data[i + j + 1]) return false;\n }\n return true;\n}\n\nfunction validateEntityName(name) {\n if (isName(name))\n return name;\n else\n throw new Error(`Invalid entity name ${name}`);\n}","const hexRegex = /^[-+]?0x[a-fA-F0-9]+$/;\nconst numRegex = /^([\\-\\+])?(0)([0-9](\\.[0-9])?)$/;\n// const octRegex = /^0x[a-z0-9]+/;\n// const binRegex = /0x[a-z0-9]+/;\n\n\nconst consider = {\n hex: true,\n // oct: false,\n leadingZeros: true,\n decimalPoint: \"\\.\",\n eNotation: true,\n //skipLike: /regex/,\n infinity: \"original\", // \"null\", \"infinity\" (Infinity type), \"string\" (\"Infinity\" (the string literal))\n};\n\nexport default function toNumber(str, options = {}) {\n options = Object.assign({}, consider, options);\n if (!str \|\| typeof str !== \"string\") return str;\n\n let trimmedStr = str.trim();\n\n if (trimmedStr.length === 0) return str;\n else if (options.skipLike !== undefined && options.skipLike.test(trimmedStr)) return str;\n else if (trimmedStr === \"0\") return 0;\n else if (options.hex && hexRegex.test(trimmedStr)) {\n return parse_int(trimmedStr, 16);\n // }else if (options.oct && octRegex.test(str)) {\n // return Number.parseInt(val, 8);\n } else if (!isFinite(trimmedStr)) { //Infinity\n return handleInfinity(str, Number(trimmedStr), options);\n } else if (trimmedStr.includes('e') \|\| trimmedStr.includes('E')) { //eNotation\n return resolveEnotation(str, trimmedStr, options);\n // }else if (options.parseBin && binRegex.test(str)) {\n // return Number.parseInt(val, 2);\n } else {\n //separate negative sign, leading zeros, and rest number\n const match = numRegex.exec(trimmedStr);\n // +00.123 => [ , '+', '00', '.123', ..\n if (match) {\n const sign = match[1] \|\| \"\";\n const leadingZeros = match[2];\n let numTrimmedByZeros = trimZeros(match[3]); //complete num without leading zeros\n const decimalAdjacentToLeadingZeros = sign ? // 0., -00., 000.\n str[leadingZeros.length + 1] === \".\"\n : str[leadingZeros.length] === \".\";\n\n //trim ending zeros for floating number\n if (!options.leadingZeros //leading zeros are not allowed\n && (leadingZeros.length > 1\n \|\| (leadingZeros.length === 1 && !decimalAdjacentToLeadingZeros))) {\n // 00, 00.3, +03.24, 03, 03.24\n return str;\n }\n else {//no leading zeros or leading zeros are allowed\n const num = Number(trimmedStr);\n const parsedStr = String(num);\n\n if (num === 0) return num;\n if (parsedStr.search(/[eE]/) !== -1) { //given number is long and parsed to eNotation\n if (options.eNotation) return num;\n else return str;\n } else if (trimmedStr.indexOf(\".\") !== -1) { //floating number\n if (parsedStr === \"0\") return num; //0.0\n else if (parsedStr === numTrimmedByZeros) return num; //0.456. 0.79000\n else if (parsedStr === `${sign}${numTrimmedByZeros}`) return num;\n else return str;\n }\n\n let n = leadingZeros ? numTrimmedByZeros : trimmedStr;\n if (leadingZeros) {\n // -009 => -9\n return (n === parsedStr) \|\| (sign + n === parsedStr) ? num : str\n } else {\n // +9\n return (n === parsedStr) \|\| (n === sign + parsedStr) ? num : str\n }\n }\n } else { //non-numeric string\n return str;\n }\n }\n}\n\nconst eNotationRegx = /^([-+])?(0)(\\d(\\.\\d)?[eE][-\\+]?\\d+)$/;\nfunction resolveEnotation(str, trimmedStr, options) {\n if (!options.eNotation) return str;\n const notation = trimmedStr.match(eNotationRegx);\n if (notation) {\n let sign = notation[1] \|\| \"\";\n const eChar = notation[3].indexOf(\"e\") === -1 ? \"E\" : \"e\";\n const leadingZeros = notation[2];\n const eAdjacentToLeadingZeros = sign ? // 0E.\n str[leadingZeros.length + 1] === eChar\n : str[leadingZeros.length] === eChar;\n\n if (leadingZeros.length > 1 && eAdjacentToLeadingZeros) return str;\n else if (leadingZeros.length === 1\n && (notation[3].startsWith(`.${eChar}`) \|\| notation[3][0] === eChar)) {\n return Number(trimmedStr);\n } else if (leadingZeros.length > 0) {\n // Has leading zeros — only accept if leadingZeros option allows it\n if (options.leadingZeros && !eAdjacentToLeadingZeros) {\n trimmedStr = (notation[1] \|\| \"\") + notation[3];\n return Number(trimmedStr);\n } else return str;\n } else {\n // No leading zeros — always valid e-notation, parse it\n return Number(trimmedStr);\n }\n } else {\n return str;\n }\n}\n\n/\n \n * @param {string} numStr without leading zeros\n * @returns \n /\nfunction trimZeros(numStr) {\n if (numStr && numStr.indexOf(\".\") !== -1) {//float\n numStr = numStr.replace(/0+$/, \"\"); //remove ending zeros\n if (numStr === \".\") numStr = \"0\";\n else if (numStr[0] === \".\") numStr = \"0\" + numStr;\n else if (numStr[numStr.length - 1] === \".\") numStr = numStr.substring(0, numStr.length - 1);\n return numStr;\n }\n return numStr;\n}\n\nfunction parse_int(numStr, base) {\n //polyfill\n if (parseInt) return parseInt(numStr, base);\n else if (Number.parseInt) return Number.parseInt(numStr, base);\n else if (window && window.parseInt) return window.parseInt(numStr, base);\n else throw new Error(\"parseInt, Number.parseInt, window.parseInt are not supported\")\n}\n\n/\n Handle infinite values based on user option\n * @param {string} str - original input string\n * @param {number} num - parsed number (Infinity or -Infinity)\n * @param {object} options - user options\n * @returns {string\|number\|null} based on infinity option\n /\nfunction handleInfinity(str, num, options) {\n const isPositive = num === Infinity;\n\n switch (options.infinity.toLowerCase()) {\n case \"null\":\n return null;\n case \"infinity\":\n return num; // Return Infinity or -Infinity\n case \"string\":\n return isPositive ? \"Infinity\" : \"-Infinity\";\n case \"original\":\n default:\n return str; // Return original string like \"1e1000\"\n }\n}","import ExpressionSet from \"./ExpressionSet.js\";\n\n/\n MatcherView - A lightweight read-only view over a Matcher's internal state.\n \n Created once by Matcher and reused across all callbacks. Holds a direct\n * reference to the parent Matcher so it always reflects current parser state\n * with zero copying or freezing overhead.\n \n Users receive this via {@link Matcher#readOnly} or directly from parser\n * callbacks. It exposes all query and matching methods but has no mutation\n * methods — misuse is caught at the TypeScript level rather than at runtime.\n \n @example\n * const matcher = new Matcher();\n * const view = matcher.readOnly();\n \n matcher.push(\"root\", {});\n * view.getCurrentTag(); // \"root\"\n * view.getDepth(); // 1\n /\nexport class MatcherView {\n /\n @param {Matcher} matcher - The parent Matcher instance to read from.\n /\n constructor(matcher) {\n this._matcher = matcher;\n }\n\n /\n Get the path separator used by the parent matcher.\n * @returns {string}\n /\n get separator() {\n return this._matcher.separator;\n }\n\n /\n Get current tag name.\n * @returns {string\|undefined}\n /\n getCurrentTag() {\n const path = this._matcher.path;\n return path.length > 0 ? path[path.length - 1].tag : undefined;\n }\n\n /\n Get current namespace.\n * @returns {string\|undefined}\n /\n getCurrentNamespace() {\n const path = this._matcher.path;\n return path.length > 0 ? path[path.length - 1].namespace : undefined;\n }\n\n /\n Get current node's attribute value.\n * @param {string} attrName\n * @returns {}\n /\n getAttrValue(attrName) {\n const path = this._matcher.path;\n if (path.length === 0) return undefined;\n return path[path.length - 1].values?.[attrName];\n }\n\n /*\n Check if current node has an attribute.\n * @param {string} attrName\n * @returns {boolean}\n /\n hasAttr(attrName) {\n const path = this._matcher.path;\n if (path.length === 0) return false;\n const current = path[path.length - 1];\n return current.values !== undefined && attrName in current.values;\n }\n\n /\n Get current node's sibling position (child index in parent).\n * @returns {number}\n /\n getPosition() {\n const path = this._matcher.path;\n if (path.length === 0) return -1;\n return path[path.length - 1].position ?? 0;\n }\n\n /\n Get current node's repeat counter (occurrence count of this tag name).\n * @returns {number}\n /\n getCounter() {\n const path = this._matcher.path;\n if (path.length === 0) return -1;\n return path[path.length - 1].counter ?? 0;\n }\n\n /\n Get current node's sibling index (alias for getPosition).\n * @returns {number}\n * @deprecated Use getPosition() or getCounter() instead\n /\n getIndex() {\n return this.getPosition();\n }\n\n /\n Get current path depth.\n * @returns {number}\n /\n getDepth() {\n return this._matcher.path.length;\n }\n\n /\n Get path as string.\n * @param {string} [separator] - Optional separator (uses default if not provided)\n * @param {boolean} [includeNamespace=true]\n * @returns {string}\n /\n toString(separator, includeNamespace = true) {\n return this._matcher.toString(separator, includeNamespace);\n }\n\n /\n Get path as array of tag names.\n * @returns {string[]}\n /\n toArray() {\n return this._matcher.path.map(n => n.tag);\n }\n\n /\n Match current path against an Expression.\n * @param {Expression} expression\n * @returns {boolean}\n /\n matches(expression) {\n return this._matcher.matches(expression);\n }\n\n /\n Match any expression in the given set against the current path.\n * @param {ExpressionSet} exprSet\n * @returns {boolean}\n /\n matchesAny(exprSet) {\n return exprSet.matchesAny(this._matcher);\n }\n}\n\n/\n Matcher - Tracks current path in XML/JSON tree and matches against Expressions.\n \n The matcher maintains a stack of nodes representing the current path from root to\n * current tag. It only stores attribute values for the current (top) node to minimize\n * memory usage. Sibling tracking is used to auto-calculate position and counter.\n \n Use {@link Matcher#readOnly} to obtain a {@link MatcherView} safe to pass to\n * user callbacks — it always reflects current state with no Proxy overhead.\n \n @example\n * const matcher = new Matcher();\n * matcher.push(\"root\", {});\n * matcher.push(\"users\", {});\n * matcher.push(\"user\", { id: \"123\", type: \"admin\" });\n \n const expr = new Expression(\"root.users.user\");\n * matcher.matches(expr); // true\n /\nexport default class Matcher {\n /\n Create a new Matcher.\n * @param {Object} [options={}]\n * @param {string} [options.separator='.'] - Default path separator\n /\n constructor(options = {}) {\n this.separator = options.separator \|\| '.';\n this.path = [];\n this.siblingStacks = [];\n // Each path node: { tag, values, position, counter, namespace? }\n // values only present for current (last) node\n // Each siblingStacks entry: Map<tagName, count> tracking occurrences at each level\n this._pathStringCache = null;\n this._view = new MatcherView(this);\n }\n\n /\n Push a new tag onto the path.\n * @param {string} tagName\n * @param {Object\|null} [attrValues=null]\n * @param {string\|null} [namespace=null]\n /\n push(tagName, attrValues = null, namespace = null) {\n this._pathStringCache = null;\n\n // Remove values from previous current node (now becoming ancestor)\n if (this.path.length > 0) {\n this.path[this.path.length - 1].values = undefined;\n }\n\n // Get or create sibling tracking for current level\n const currentLevel = this.path.length;\n if (!this.siblingStacks[currentLevel]) {\n this.siblingStacks[currentLevel] = new Map();\n }\n\n const siblings = this.siblingStacks[currentLevel];\n\n // Create a unique key for sibling tracking that includes namespace\n const siblingKey = namespace ? `${namespace}:${tagName}` : tagName;\n\n // Calculate counter (how many times this tag appeared at this level)\n const counter = siblings.get(siblingKey) \|\| 0;\n\n // Calculate position (total children at this level so far)\n let position = 0;\n for (const count of siblings.values()) {\n position += count;\n }\n\n // Update sibling count for this tag\n siblings.set(siblingKey, counter + 1);\n\n // Create new node\n const node = {\n tag: tagName,\n position: position,\n counter: counter\n };\n\n if (namespace !== null && namespace !== undefined) {\n node.namespace = namespace;\n }\n\n if (attrValues !== null && attrValues !== undefined) {\n node.values = attrValues;\n }\n\n this.path.push(node);\n }\n\n /\n Pop the last tag from the path.\n * @returns {Object\|undefined} The popped node\n /\n pop() {\n if (this.path.length === 0) return undefined;\n this._pathStringCache = null;\n\n const node = this.path.pop();\n\n if (this.siblingStacks.length > this.path.length + 1) {\n this.siblingStacks.length = this.path.length + 1;\n }\n\n return node;\n }\n\n /\n Update current node's attribute values.\n * Useful when attributes are parsed after push.\n * @param {Object} attrValues\n /\n updateCurrent(attrValues) {\n if (this.path.length > 0) {\n const current = this.path[this.path.length - 1];\n if (attrValues !== null && attrValues !== undefined) {\n current.values = attrValues;\n }\n }\n }\n\n /\n Get current tag name.\n * @returns {string\|undefined}\n /\n getCurrentTag() {\n return this.path.length > 0 ? this.path[this.path.length - 1].tag : undefined;\n }\n\n /\n Get current namespace.\n * @returns {string\|undefined}\n /\n getCurrentNamespace() {\n return this.path.length > 0 ? this.path[this.path.length - 1].namespace : undefined;\n }\n\n /\n Get current node's attribute value.\n * @param {string} attrName\n * @returns {}\n /\n getAttrValue(attrName) {\n if (this.path.length === 0) return undefined;\n return this.path[this.path.length - 1].values?.[attrName];\n }\n\n /*\n Check if current node has an attribute.\n * @param {string} attrName\n * @returns {boolean}\n /\n hasAttr(attrName) {\n if (this.path.length === 0) return false;\n const current = this.path[this.path.length - 1];\n return current.values !== undefined && attrName in current.values;\n }\n\n /\n Get current node's sibling position (child index in parent).\n * @returns {number}\n /\n getPosition() {\n if (this.path.length === 0) return -1;\n return this.path[this.path.length - 1].position ?? 0;\n }\n\n /\n Get current node's repeat counter (occurrence count of this tag name).\n * @returns {number}\n /\n getCounter() {\n if (this.path.length === 0) return -1;\n return this.path[this.path.length - 1].counter ?? 0;\n }\n\n /\n Get current node's sibling index (alias for getPosition).\n * @returns {number}\n * @deprecated Use getPosition() or getCounter() instead\n /\n getIndex() {\n return this.getPosition();\n }\n\n /\n Get current path depth.\n * @returns {number}\n /\n getDepth() {\n return this.path.length;\n }\n\n /\n Get path as string.\n * @param {string} [separator] - Optional separator (uses default if not provided)\n * @param {boolean} [includeNamespace=true]\n * @returns {string}\n /\n toString(separator, includeNamespace = true) {\n const sep = separator \|\| this.separator;\n const isDefault = (sep === this.separator && includeNamespace === true);\n\n if (isDefault) {\n if (this._pathStringCache !== null) {\n return this._pathStringCache;\n }\n const result = this.path.map(n =>\n (n.namespace) ? `${n.namespace}:${n.tag}` : n.tag\n ).join(sep);\n this._pathStringCache = result;\n return result;\n }\n\n return this.path.map(n =>\n (includeNamespace && n.namespace) ? `${n.namespace}:${n.tag}` : n.tag\n ).join(sep);\n }\n\n /\n Get path as array of tag names.\n * @returns {string[]}\n /\n toArray() {\n return this.path.map(n => n.tag);\n }\n\n /\n Reset the path to empty.\n /\n reset() {\n this._pathStringCache = null;\n this.path = [];\n this.siblingStacks = [];\n }\n\n /\n Match current path against an Expression.\n * @param {Expression} expression\n * @returns {boolean}\n /\n matches(expression) {\n const segments = expression.segments;\n\n if (segments.length === 0) {\n return false;\n }\n\n if (expression.hasDeepWildcard()) {\n return this._matchWithDeepWildcard(segments);\n }\n\n return this._matchSimple(segments);\n }\n\n /\n @private\n /\n _matchSimple(segments) {\n if (this.path.length !== segments.length) {\n return false;\n }\n\n for (let i = 0; i < segments.length; i++) {\n if (!this._matchSegment(segments[i], this.path[i], i === this.path.length - 1)) {\n return false;\n }\n }\n\n return true;\n }\n\n /\n @private\n /\n _matchWithDeepWildcard(segments) {\n let pathIdx = this.path.length - 1;\n let segIdx = segments.length - 1;\n\n while (segIdx >= 0 && pathIdx >= 0) {\n const segment = segments[segIdx];\n\n if (segment.type === 'deep-wildcard') {\n segIdx--;\n\n if (segIdx < 0) {\n return true;\n }\n\n const nextSeg = segments[segIdx];\n let found = false;\n\n for (let i = pathIdx; i >= 0; i--) {\n if (this._matchSegment(nextSeg, this.path[i], i === this.path.length - 1)) {\n pathIdx = i - 1;\n segIdx--;\n found = true;\n break;\n }\n }\n\n if (!found) {\n return false;\n }\n } else {\n if (!this._matchSegment(segment, this.path[pathIdx], pathIdx === this.path.length - 1)) {\n return false;\n }\n pathIdx--;\n segIdx--;\n }\n }\n\n return segIdx < 0;\n }\n\n /\n @private\n /\n _matchSegment(segment, node, isCurrentNode) {\n if (segment.tag !== '' && segment.tag !== node.tag) {\n return false;\n }\n\n if (segment.namespace !== undefined) {\n if (segment.namespace !== '' && segment.namespace !== node.namespace) {\n return false;\n }\n }\n\n if (segment.attrName !== undefined) {\n if (!isCurrentNode) {\n return false;\n }\n\n if (!node.values \|\| !(segment.attrName in node.values)) {\n return false;\n }\n\n if (segment.attrValue !== undefined) {\n if (String(node.values[segment.attrName]) !== String(segment.attrValue)) {\n return false;\n }\n }\n }\n\n if (segment.position !== undefined) {\n if (!isCurrentNode) {\n return false;\n }\n\n const counter = node.counter ?? 0;\n\n if (segment.position === 'first' && counter !== 0) {\n return false;\n } else if (segment.position === 'odd' && counter % 2 !== 1) {\n return false;\n } else if (segment.position === 'even' && counter % 2 !== 0) {\n return false;\n } else if (segment.position === 'nth' && counter !== segment.positionValue) {\n return false;\n }\n }\n\n return true;\n }\n\n /\n Match any expression in the given set against the current path.\n * @param {ExpressionSet} exprSet\n * @returns {boolean}\n /\n matchesAny(exprSet) {\n return exprSet.matchesAny(this);\n }\n\n /\n Create a snapshot of current state.\n * @returns {Object}\n /\n snapshot() {\n return {\n path: this.path.map(node => ({ ...node })),\n siblingStacks: this.siblingStacks.map(map => new Map(map))\n };\n }\n\n /\n Restore state from snapshot.\n * @param {Object} snapshot\n /\n restore(snapshot) {\n this._pathStringCache = null;\n this.path = snapshot.path.map(node => ({ ...node }));\n this.siblingStacks = snapshot.siblingStacks.map(map => new Map(map));\n }\n\n /\n Return the read-only {@link MatcherView} for this matcher.\n \n The same instance is returned on every call — no allocation occurs.\n * It always reflects the current parser state and is safe to pass to\n * user callbacks without risk of accidental mutation.\n \n @returns {MatcherView}\n \n @example\n * const view = matcher.readOnly();\n * // pass view to callbacks — it stays in sync automatically\n * view.matches(expr); // ✓\n * view.getCurrentTag(); // ✓\n * // view.push(...) // ✗ method does not exist — caught by TypeScript\n /\n readOnly() {\n return this._view;\n }\n}","/\n Expression - Parses and stores a tag pattern expression\n * \n * Patterns are parsed once and stored in an optimized structure for fast matching.\n * \n * @example\n * const expr = new Expression(\"root.users.user\");\n * const expr2 = new Expression(\"..user[id]:first\");\n * const expr3 = new Expression(\"root/users/user\", { separator: '/' });\n /\nexport default class Expression {\n /\n Create a new Expression\n * @param {string} pattern - Pattern string (e.g., \"root.users.user\", \"..user[id]\")\n * @param {Object} options - Configuration options\n * @param {string} options.separator - Path separator (default: '.')\n /\n constructor(pattern, options = {}, data) {\n this.pattern = pattern;\n this.separator = options.separator \|\| '.';\n this.segments = this._parse(pattern);\n this.data = data;\n // Cache expensive checks for performance (O(1) instead of O(n))\n this._hasDeepWildcard = this.segments.some(seg => seg.type === 'deep-wildcard');\n this._hasAttributeCondition = this.segments.some(seg => seg.attrName !== undefined);\n this._hasPositionSelector = this.segments.some(seg => seg.position !== undefined);\n }\n\n /\n Parse pattern string into segments\n * @private\n * @param {string} pattern - Pattern to parse\n * @returns {Array} Array of segment objects\n /\n _parse(pattern) {\n const segments = [];\n\n // Split by separator but handle \"..\" specially\n let i = 0;\n let currentPart = '';\n\n while (i < pattern.length) {\n if (pattern[i] === this.separator) {\n // Check if next char is also separator (deep wildcard)\n if (i + 1 < pattern.length && pattern[i + 1] === this.separator) {\n // Flush current part if any\n if (currentPart.trim()) {\n segments.push(this._parseSegment(currentPart.trim()));\n currentPart = '';\n }\n // Add deep wildcard\n segments.push({ type: 'deep-wildcard' });\n i += 2; // Skip both separators\n } else {\n // Regular separator\n if (currentPart.trim()) {\n segments.push(this._parseSegment(currentPart.trim()));\n }\n currentPart = '';\n i++;\n }\n } else {\n currentPart += pattern[i];\n i++;\n }\n }\n\n // Flush remaining part\n if (currentPart.trim()) {\n segments.push(this._parseSegment(currentPart.trim()));\n }\n\n return segments;\n }\n\n /\n Parse a single segment\n * @private\n * @param {string} part - Segment string (e.g., \"user\", \"ns::user\", \"user[id]\", \"ns::user:first\")\n * @returns {Object} Segment object\n /\n _parseSegment(part) {\n const segment = { type: 'tag' };\n\n // NEW NAMESPACE SYNTAX (v2.0):\n // ============================\n // Namespace uses DOUBLE colon (::)\n // Position uses SINGLE colon (:)\n // \n // Examples:\n // \"user\" → tag\n // \"user:first\" → tag + position\n // \"user[id]\" → tag + attribute\n // \"user[id]:first\" → tag + attribute + position\n // \"ns::user\" → namespace + tag\n // \"ns::user:first\" → namespace + tag + position\n // \"ns::user[id]\" → namespace + tag + attribute\n // \"ns::user[id]:first\" → namespace + tag + attribute + position\n // \"ns::first\" → namespace + tag named \"first\" (NO ambiguity!)\n //\n // This eliminates all ambiguity:\n // :: = namespace separator\n // : = position selector\n // [] = attributes\n\n // Step 1: Extract brackets [attr] or [attr=value]\n let bracketContent = null;\n let withoutBrackets = part;\n\n const bracketMatch = part.match(/^([^\\[]+)(\\[[^\\]]\\])(.)$/);\n if (bracketMatch) {\n withoutBrackets = bracketMatch[1] + bracketMatch[3];\n if (bracketMatch[2]) {\n const content = bracketMatch[2].slice(1, -1);\n if (content) {\n bracketContent = content;\n }\n }\n }\n\n // Step 2: Check for namespace (double colon ::)\n let namespace = undefined;\n let tagAndPosition = withoutBrackets;\n\n if (withoutBrackets.includes('::')) {\n const nsIndex = withoutBrackets.indexOf('::');\n namespace = withoutBrackets.substring(0, nsIndex).trim();\n tagAndPosition = withoutBrackets.substring(nsIndex + 2).trim(); // Skip ::\n\n if (!namespace) {\n throw new Error(`Invalid namespace in pattern: ${part}`);\n }\n }\n\n // Step 3: Parse tag and position (single colon :)\n let tag = undefined;\n let positionMatch = null;\n\n if (tagAndPosition.includes(':')) {\n const colonIndex = tagAndPosition.lastIndexOf(':'); // Use last colon for position\n const tagPart = tagAndPosition.substring(0, colonIndex).trim();\n const posPart = tagAndPosition.substring(colonIndex + 1).trim();\n\n // Verify position is a valid keyword\n const isPositionKeyword = ['first', 'last', 'odd', 'even'].includes(posPart) \|\|\n /^nth\$\\d+\$$/.test(posPart);\n\n if (isPositionKeyword) {\n tag = tagPart;\n positionMatch = posPart;\n } else {\n // Not a valid position keyword, treat whole thing as tag\n tag = tagAndPosition;\n }\n } else {\n tag = tagAndPosition;\n }\n\n if (!tag) {\n throw new Error(`Invalid segment pattern: ${part}`);\n }\n\n segment.tag = tag;\n if (namespace) {\n segment.namespace = namespace;\n }\n\n // Step 4: Parse attributes\n if (bracketContent) {\n if (bracketContent.includes('=')) {\n const eqIndex = bracketContent.indexOf('=');\n segment.attrName = bracketContent.substring(0, eqIndex).trim();\n segment.attrValue = bracketContent.substring(eqIndex + 1).trim();\n } else {\n segment.attrName = bracketContent.trim();\n }\n }\n\n // Step 5: Parse position selector\n if (positionMatch) {\n const nthMatch = positionMatch.match(/^nth\$(\\d+)\$$/);\n if (nthMatch) {\n segment.position = 'nth';\n segment.positionValue = parseInt(nthMatch[1], 10);\n } else {\n segment.position = positionMatch;\n }\n }\n\n return segment;\n }\n\n /\n Get the number of segments\n * @returns {number}\n /\n get length() {\n return this.segments.length;\n }\n\n /\n Check if expression contains deep wildcard\n * @returns {boolean}\n /\n hasDeepWildcard() {\n return this._hasDeepWildcard;\n }\n\n /\n Check if expression has attribute conditions\n * @returns {boolean}\n /\n hasAttributeCondition() {\n return this._hasAttributeCondition;\n }\n\n /\n Check if expression has position selectors\n * @returns {boolean}\n /\n hasPositionSelector() {\n return this._hasPositionSelector;\n }\n\n /\n Get string representation\n * @returns {string}\n /\n toString() {\n return this.pattern;\n }\n}","/\n ExpressionSet - An indexed collection of Expressions for efficient bulk matching\n \n Instead of iterating all expressions on every tag, ExpressionSet pre-indexes\n * them at insertion time by depth and terminal tag name. At match time, only\n * the relevant bucket is evaluated — typically reducing checks from O(E) to O(1)\n * lookup plus O(small bucket) matches.\n \n Three buckets are maintained:\n * - `_byDepthAndTag` — exact depth + exact tag name (tightest, used first)\n * - `_wildcardByDepth` — exact depth + wildcard tag `` (depth-matched only)\n - `_deepWildcards` — expressions containing `..` (cannot be depth-indexed)\n \n @example\n * import { Expression, ExpressionSet } from 'fast-xml-tagger';\n \n // Build once at config time\n * const stopNodes = new ExpressionSet();\n * stopNodes.add(new Expression('root.users.user'));\n * stopNodes.add(new Expression('root.config.setting'));\n * stopNodes.add(new Expression('..script'));\n \n // Query on every tag — hot path\n * if (stopNodes.matchesAny(matcher)) { ... }\n /\nexport default class ExpressionSet {\n constructor() {\n /* @type {Map<string, import('./Expression.js').default[]>} depth:tag → expressions /\n this._byDepthAndTag = new Map();\n\n /* @type {Map<number, import('./Expression.js').default[]>} depth → wildcard-tag expressions /\n this._wildcardByDepth = new Map();\n\n /* @type {import('./Expression.js').default[]} expressions containing deep wildcard (..) /\n this._deepWildcards = [];\n\n /* @type {Set<string>} pattern strings already added — used for deduplication /\n this._patterns = new Set();\n\n /* @type {boolean} whether the set is sealed against further additions /\n this._sealed = false;\n }\n\n /\n Add an Expression to the set.\n * Duplicate patterns (same pattern string) are silently ignored.\n \n @param {import('./Expression.js').default} expression - A pre-constructed Expression instance\n * @returns {this} for chaining\n * @throws {TypeError} if called after seal()\n \n @example\n * set.add(new Expression('root.users.user'));\n * set.add(new Expression('..script'));\n /\n add(expression) {\n if (this._sealed) {\n throw new TypeError(\n 'ExpressionSet is sealed. Create a new ExpressionSet to add more expressions.'\n );\n }\n\n // Deduplicate by pattern string\n if (this._patterns.has(expression.pattern)) return this;\n this._patterns.add(expression.pattern);\n\n if (expression.hasDeepWildcard()) {\n this._deepWildcards.push(expression);\n return this;\n }\n\n const depth = expression.length;\n const lastSeg = expression.segments[expression.segments.length - 1];\n const tag = lastSeg?.tag;\n\n if (!tag \|\| tag === '') {\n // Can index by depth but not by tag\n if (!this._wildcardByDepth.has(depth)) this._wildcardByDepth.set(depth, []);\n this._wildcardByDepth.get(depth).push(expression);\n } else {\n // Tightest bucket: depth + tag\n const key = `${depth}:${tag}`;\n if (!this._byDepthAndTag.has(key)) this._byDepthAndTag.set(key, []);\n this._byDepthAndTag.get(key).push(expression);\n }\n\n return this;\n }\n\n /*\n Add multiple expressions at once.\n \n @param {import('./Expression.js').default[]} expressions - Array of Expression instances\n * @returns {this} for chaining\n \n @example\n * set.addAll([\n * new Expression('root.users.user'),\n * new Expression('root.config.setting'),\n * ]);\n /\n addAll(expressions) {\n for (const expr of expressions) this.add(expr);\n return this;\n }\n\n /\n Check whether a pattern string is already present in the set.\n \n @param {import('./Expression.js').default} expression\n * @returns {boolean}\n /\n has(expression) {\n return this._patterns.has(expression.pattern);\n }\n\n /\n Number of expressions in the set.\n * @type {number}\n /\n get size() {\n return this._patterns.size;\n }\n\n /\n Seal the set against further modifications.\n * Useful to prevent accidental mutations after config is built.\n * Calling add() or addAll() on a sealed set throws a TypeError.\n \n @returns {this}\n /\n seal() {\n this._sealed = true;\n return this;\n }\n\n /\n Whether the set has been sealed.\n * @type {boolean}\n /\n get isSealed() {\n return this._sealed;\n }\n\n /\n Test whether the matcher's current path matches any expression in the set.\n \n Evaluation order (cheapest → most expensive):\n * 1. Exact depth + tag bucket — O(1) lookup, typically 0–2 expressions\n * 2. Depth-only wildcard bucket — O(1) lookup, rare\n * 3. Deep-wildcard list — always checked, but usually small\n \n @param {import('./Matcher.js').default} matcher - Matcher instance (or readOnly view)\n * @returns {boolean} true if any expression matches the current path\n \n @example\n * if (stopNodes.matchesAny(matcher)) {\n * // handle stop node\n * }\n /\n matchesAny(matcher) {\n return this.findMatch(matcher) !== null;\n }\n /\n Find and return the first Expression that matches the matcher's current path.\n \n Uses the same evaluation order as matchesAny (cheapest → most expensive):\n * 1. Exact depth + tag bucket\n * 2. Depth-only wildcard bucket\n * 3. Deep-wildcard list\n \n @param {import('./Matcher.js').default} matcher - Matcher instance (or readOnly view)\n * @returns {import('./Expression.js').default \| null} the first matching Expression, or null\n \n @example\n * const expr = stopNodes.findMatch(matcher);\n * if (expr) {\n * // access expr.config, expr.pattern, etc.\n * }\n /\n findMatch(matcher) {\n const depth = matcher.getDepth();\n const tag = matcher.getCurrentTag();\n\n // 1. Tightest bucket — most expressions live here\n const exactKey = `${depth}:${tag}`;\n const exactBucket = this._byDepthAndTag.get(exactKey);\n if (exactBucket) {\n for (let i = 0; i < exactBucket.length; i++) {\n if (matcher.matches(exactBucket[i])) return exactBucket[i];\n }\n }\n\n // 2. Depth-matched wildcard-tag expressions\n const wildcardBucket = this._wildcardByDepth.get(depth);\n if (wildcardBucket) {\n for (let i = 0; i < wildcardBucket.length; i++) {\n if (matcher.matches(wildcardBucket[i])) return wildcardBucket[i];\n }\n }\n\n // 3. Deep wildcards — cannot be pre-filtered by depth or tag\n for (let i = 0; i < this._deepWildcards.length; i++) {\n if (matcher.matches(this._deepWildcards[i])) return this._deepWildcards[i];\n }\n\n return null;\n }\n}\n","// ---------------------------------------------------------------------------\n// Complete HTML5 named entity reference\n// Organized by logical categories for easy maintenance and selective importing\n// ---------------------------------------------------------------------------\n\n/\n Basic Latin & Special Characters\n * @type {Record<string, string>}\n /\nexport const BASIC_LATIN = {\n amp: '&',\n AMP: '&',\n lt: '<',\n LT: '<',\n gt: '>',\n GT: '>',\n quot: '\"',\n QUOT: '\"',\n apos: \"'\",\n lsquo: '‘',\n rsquo: '’',\n ldquo: '“',\n rdquo: '”',\n lsquor: '‚',\n rsquor: '’',\n ldquor: '„',\n bdquo: '„',\n comma: ',',\n period: '.',\n colon: ':',\n semi: ';',\n excl: '!',\n quest: '?',\n num: '#',\n dollar: '$',\n percent: '%',\n amp: '&',\n ast: '',\n commat: '@',\n lowbar: '_',\n verbar: '\|',\n vert: '\|',\n sol: '/',\n bsol: '\\\\',\n lbrace: '{',\n rbrace: '}',\n lbrack: '[',\n rbrack: ']',\n lpar: '(',\n rpar: ')',\n nbsp: '\\u00a0',\n iexcl: '¡',\n cent: '¢',\n pound: '£',\n curren: '¤',\n yen: '¥',\n brvbar: '¦',\n sect: '§',\n uml: '¨',\n copy: '©',\n COPY: '©',\n ordf: 'ª',\n laquo: '«',\n not: '¬',\n shy: '\\u00ad',\n reg: '®',\n REG: '®',\n macr: '¯',\n deg: '°',\n plusmn: '±',\n sup2: '²',\n sup3: '³',\n acute: '´',\n micro: 'µ',\n para: '¶',\n middot: '·',\n cedil: '¸',\n sup1: '¹',\n ordm: 'º',\n raquo: '»',\n frac14: '¼',\n frac12: '½',\n half: '½',\n frac34: '¾',\n iquest: '¿',\n times: '×',\n div: '÷',\n divide: '÷',\n};\n\n/*\n Latin Extended & Accented Letters (A-Z)\n * @type {Record<string, string>}\n /\nexport const LATIN_ACCENTS = {\n Agrave: 'À',\n agrave: 'à',\n Aacute: 'Á',\n aacute: 'á',\n Acirc: 'Â',\n acirc: 'â',\n Atilde: 'Ã',\n atilde: 'ã',\n Auml: 'Ä',\n auml: 'ä',\n Aring: 'Å',\n aring: 'å',\n AElig: 'Æ',\n aelig: 'æ',\n Ccedil: 'Ç',\n ccedil: 'ç',\n Egrave: 'È',\n egrave: 'è',\n Eacute: 'É',\n eacute: 'é',\n Ecirc: 'Ê',\n ecirc: 'ê',\n Euml: 'Ë',\n euml: 'ë',\n Igrave: 'Ì',\n igrave: 'ì',\n Iacute: 'Í',\n iacute: 'í',\n Icirc: 'Î',\n icirc: 'î',\n Iuml: 'Ï',\n iuml: 'ï',\n ETH: 'Ð',\n eth: 'ð',\n Ntilde: 'Ñ',\n ntilde: 'ñ',\n Ograve: 'Ò',\n ograve: 'ò',\n Oacute: 'Ó',\n oacute: 'ó',\n Ocirc: 'Ô',\n ocirc: 'ô',\n Otilde: 'Õ',\n otilde: 'õ',\n Ouml: 'Ö',\n ouml: 'ö',\n Oslash: 'Ø',\n oslash: 'ø',\n Ugrave: 'Ù',\n ugrave: 'ù',\n Uacute: 'Ú',\n uacute: 'ú',\n Ucirc: 'Û',\n ucirc: 'û',\n Uuml: 'Ü',\n uuml: 'ü',\n Yacute: 'Ý',\n yacute: 'ý',\n THORN: 'Þ',\n thorn: 'þ',\n szlig: 'ß',\n yuml: 'ÿ',\n Yuml: 'Ÿ',\n};\n\n/\n Latin Extended (Letters with diacritics)\n * @type {Record<string, string>}\n /\nexport const LATIN_EXTENDED = {\n Amacr: 'Ā',\n amacr: 'ā',\n Abreve: 'Ă',\n abreve: 'ă',\n Aogon: 'Ą',\n aogon: 'ą',\n Cacute: 'Ć',\n cacute: 'ć',\n Ccirc: 'Ĉ',\n ccirc: 'ĉ',\n Cdot: 'Ċ',\n cdot: 'ċ',\n Ccaron: 'Č',\n ccaron: 'č',\n Dcaron: 'Ď',\n dcaron: 'ď',\n Dstrok: 'Đ',\n dstrok: 'đ',\n Emacr: 'Ē',\n emacr: 'ē',\n Ecaron: 'Ě',\n ecaron: 'ě',\n Edot: 'Ė',\n edot: 'ė',\n Eogon: 'Ę',\n eogon: 'ę',\n Gcirc: 'Ĝ',\n gcirc: 'ĝ',\n Gbreve: 'Ğ',\n gbreve: 'ğ',\n Gdot: 'Ġ',\n gdot: 'ġ',\n Gcedil: 'Ģ',\n Hcirc: 'Ĥ',\n hcirc: 'ĥ',\n Hstrok: 'Ħ',\n hstrok: 'ħ',\n Itilde: 'Ĩ',\n itilde: 'ĩ',\n Imacr: 'Ī',\n imacr: 'ī',\n Iogon: 'Į',\n iogon: 'į',\n Idot: 'İ',\n IJlig: 'Ĳ',\n ijlig: 'ĳ',\n Jcirc: 'Ĵ',\n jcirc: 'ĵ',\n Kcedil: 'Ķ',\n kcedil: 'ķ',\n kgreen: 'ĸ',\n Lacute: 'Ĺ',\n lacute: 'ĺ',\n Lcedil: 'Ļ',\n lcedil: 'ļ',\n Lcaron: 'Ľ',\n lcaron: 'ľ',\n Lmidot: 'Ŀ',\n lmidot: 'ŀ',\n Lstrok: 'Ł',\n lstrok: 'ł',\n Nacute: 'Ń',\n nacute: 'ń',\n Ncaron: 'Ň',\n ncaron: 'ň',\n Ncedil: 'Ņ',\n ncedil: 'ņ',\n ENG: 'Ŋ',\n eng: 'ŋ',\n Omacr: 'Ō',\n omacr: 'ō',\n Odblac: 'Ő',\n odblac: 'ő',\n OElig: 'Œ',\n oelig: 'œ',\n Racute: 'Ŕ',\n racute: 'ŕ',\n Rcaron: 'Ř',\n rcaron: 'ř',\n Rcedil: 'Ŗ',\n rcedil: 'ŗ',\n Sacute: 'Ś',\n sacute: 'ś',\n Scirc: 'Ŝ',\n scirc: 'ŝ',\n Scedil: 'Ş',\n scedil: 'ş',\n Scaron: 'Š',\n scaron: 'š',\n Tcedil: 'Ţ',\n tcedil: 'ţ',\n Tcaron: 'Ť',\n tcaron: 'ť',\n Tstrok: 'Ŧ',\n tstrok: 'ŧ',\n Utilde: 'Ũ',\n utilde: 'ũ',\n Umacr: 'Ū',\n umacr: 'ū',\n Ubreve: 'Ŭ',\n ubreve: 'ŭ',\n Uring: 'Ů',\n uring: 'ů',\n Udblac: 'Ű',\n udblac: 'ű',\n Uogon: 'Ų',\n uogon: 'ų',\n Wcirc: 'Ŵ',\n wcirc: 'ŵ',\n Ycirc: 'Ŷ',\n ycirc: 'ŷ',\n Zacute: 'Ź',\n zacute: 'ź',\n Zdot: 'Ż',\n zdot: 'ż',\n Zcaron: 'Ž',\n zcaron: 'ž',\n};\n\n/\n Greek Letters\n * @type {Record<string, string>}\n /\nexport const GREEK = {\n Alpha: 'Α',\n alpha: 'α',\n Beta: 'Β',\n beta: 'β',\n Gamma: 'Γ',\n gamma: 'γ',\n Delta: 'Δ',\n delta: 'δ',\n Epsilon: 'Ε',\n epsilon: 'ε',\n epsiv: 'ϵ',\n varepsilon: 'ϵ',\n Zeta: 'Ζ',\n zeta: 'ζ',\n Eta: 'Η',\n eta: 'η',\n Theta: 'Θ',\n theta: 'θ',\n thetasym: 'ϑ',\n vartheta: 'ϑ',\n Iota: 'Ι',\n iota: 'ι',\n Kappa: 'Κ',\n kappa: 'κ',\n kappav: 'ϰ',\n varkappa: 'ϰ',\n Lambda: 'Λ',\n lambda: 'λ',\n Mu: 'Μ',\n mu: 'μ',\n Nu: 'Ν',\n nu: 'ν',\n Xi: 'Ξ',\n xi: 'ξ',\n Omicron: 'Ο',\n omicron: 'ο',\n Pi: 'Π',\n pi: 'π',\n piv: 'ϖ',\n varpi: 'ϖ',\n Rho: 'Ρ',\n rho: 'ρ',\n rhov: 'ϱ',\n varrho: 'ϱ',\n Sigma: 'Σ',\n sigma: 'σ',\n sigmaf: 'ς',\n sigmav: 'ς',\n varsigma: 'ς',\n Tau: 'Τ',\n tau: 'τ',\n Upsilon: 'Υ',\n upsilon: 'υ',\n upsi: 'υ',\n Upsi: 'ϒ',\n upsih: 'ϒ',\n Phi: 'Φ',\n phi: 'φ',\n phiv: 'ϕ',\n varphi: 'ϕ',\n Chi: 'Χ',\n chi: 'χ',\n Psi: 'Ψ',\n psi: 'ψ',\n Omega: 'Ω',\n omega: 'ω',\n ohm: 'Ω',\n Gammad: 'Ϝ',\n gammad: 'ϝ',\n digamma: 'ϝ',\n};\n\n/\n Cyrillic Letters\n * @type {Record<string, string>}\n /\nexport const CYRILLIC = {\n Afr: '𝔄',\n afr: '𝔞',\n Acy: 'А',\n acy: 'а',\n Bcy: 'Б',\n bcy: 'б',\n Vcy: 'В',\n vcy: 'в',\n Gcy: 'Г',\n gcy: 'г',\n Dcy: 'Д',\n dcy: 'д',\n IEcy: 'Е',\n iecy: 'е',\n IOcy: 'Ё',\n iocy: 'ё',\n ZHcy: 'Ж',\n zhcy: 'ж',\n Zcy: 'З',\n zcy: 'з',\n Icy: 'И',\n icy: 'и',\n Jcy: 'Й',\n jcy: 'й',\n Kcy: 'К',\n kcy: 'к',\n Lcy: 'Л',\n lcy: 'л',\n Mcy: 'М',\n mcy: 'м',\n Ncy: 'Н',\n ncy: 'н',\n Ocy: 'О',\n ocy: 'о',\n Pcy: 'П',\n pcy: 'п',\n Rcy: 'Р',\n rcy: 'р',\n Scy: 'С',\n scy: 'с',\n Tcy: 'Т',\n tcy: 'т',\n Ucy: 'У',\n ucy: 'у',\n Fcy: 'Ф',\n fcy: 'ф',\n KHcy: 'Х',\n khcy: 'х',\n TScy: 'Ц',\n tscy: 'ц',\n CHcy: 'Ч',\n chcy: 'ч',\n SHcy: 'Ш',\n shcy: 'ш',\n SHCHcy: 'Щ',\n shchcy: 'щ',\n HARDcy: 'Ъ',\n hardcy: 'ъ',\n Ycy: 'Ы',\n ycy: 'ы',\n SOFTcy: 'Ь',\n softcy: 'ь',\n Ecy: 'Э',\n ecy: 'э',\n YUcy: 'Ю',\n yucy: 'ю',\n YAcy: 'Я',\n yacy: 'я',\n DJcy: 'Ђ',\n djcy: 'ђ',\n GJcy: 'Ѓ',\n gjcy: 'ѓ',\n Jukcy: 'Є',\n jukcy: 'є',\n DScy: 'Ѕ',\n dscy: 'ѕ',\n Iukcy: 'І',\n iukcy: 'і',\n YIcy: 'Ї',\n yicy: 'ї',\n Jsercy: 'Ј',\n jsercy: 'ј',\n LJcy: 'Љ',\n ljcy: 'љ',\n NJcy: 'Њ',\n njcy: 'њ',\n TSHcy: 'Ћ',\n tshcy: 'ћ',\n KJcy: 'Ќ',\n kjcy: 'ќ',\n Ubrcy: 'Ў',\n ubrcy: 'ў',\n DZcy: 'Џ',\n dzcy: 'џ',\n};\n\n/\n Mathematical Operators & Relations\n * @type {Record<string, string>}\n /\nexport const MATH = {\n plus: '+',\n minus: '−',\n mnplus: '∓',\n mp: '∓',\n pm: '±',\n times: '×',\n div: '÷',\n divide: '÷',\n sdot: '⋅',\n star: '☆',\n starf: '★',\n bigstar: '★',\n lowast: '∗',\n ast: '',\n midast: '',\n compfn: '∘',\n smallcircle: '∘',\n bullet: '•',\n bull: '•',\n nbsp: '\\u00a0',\n hellip: '…',\n mldr: '…',\n prime: '′',\n Prime: '″',\n tprime: '‴',\n bprime: '‵',\n backprime: '‵',\n minus: '−',\n minusd: '∸',\n dotminus: '∸',\n plusdo: '∔',\n dotplus: '∔',\n plusmn: '±',\n minusplus: '∓',\n mnplus: '∓',\n mp: '∓',\n setminus: '∖',\n smallsetminus: '∖',\n Backslash: '∖',\n setmn: '∖',\n ssetmn: '∖',\n lowbar: '_',\n verbar: '\|',\n vert: '\|',\n VerticalLine: '\|',\n colon: ':',\n Colon: '∷',\n Proportion: '∷',\n ratio: '∶',\n equals: '=',\n ne: '≠',\n nequiv: '≢',\n equiv: '≡',\n Congruent: '≡',\n sim: '∼',\n thicksim: '∼',\n thksim: '∼',\n sime: '≃',\n simeq: '≃',\n TildeEqual: '≃',\n asymp: '≈',\n approx: '≈',\n thickapprox: '≈',\n thkap: '≈',\n TildeTilde: '≈',\n ncong: '≇',\n cong: '≅',\n TildeFullEqual: '≅',\n asympeq: '≍',\n CupCap: '≍',\n bump: '≎',\n Bumpeq: '≎',\n HumpDownHump: '≎',\n bumpe: '≏',\n bumpeq: '≏',\n HumpEqual: '≏',\n dotminus: '∸',\n minusd: '∸',\n plusdo: '∔',\n dotplus: '∔',\n le: '≤',\n LessEqual: '≤',\n ge: '≥',\n GreaterEqual: '≥',\n lesseqgtr: '⋚',\n lesseqqgtr: '⪋',\n greater: '>',\n less: '<',\n};\n\n/\n Mathematical Operators (Advanced)\n * @type {Record<string, string>}\n /\nexport const MATH_ADVANCED = {\n alefsym: 'ℵ',\n aleph: 'ℵ',\n beth: 'ℶ',\n gimel: 'ℷ',\n daleth: 'ℸ',\n forall: '∀',\n ForAll: '∀',\n part: '∂',\n PartialD: '∂',\n exist: '∃',\n Exists: '∃',\n nexist: '∄',\n nexists: '∄',\n empty: '∅',\n emptyset: '∅',\n emptyv: '∅',\n varnothing: '∅',\n nabla: '∇',\n Del: '∇',\n isin: '∈',\n isinv: '∈',\n in: '∈',\n Element: '∈',\n notin: '∉',\n notinva: '∉',\n ni: '∋',\n niv: '∋',\n SuchThat: '∋',\n ReverseElement: '∋',\n notni: '∌',\n notniva: '∌',\n prod: '∏',\n Product: '∏',\n coprod: '∐',\n Coproduct: '∐',\n sum: '∑',\n Sum: '∑',\n minus: '−',\n mp: '∓',\n plusdo: '∔',\n dotplus: '∔',\n setminus: '∖',\n lowast: '∗',\n radic: '√',\n Sqrt: '√',\n prop: '∝',\n propto: '∝',\n Proportional: '∝',\n varpropto: '∝',\n infin: '∞',\n infintie: '⧝',\n ang: '∠',\n angle: '∠',\n angmsd: '∡',\n measuredangle: '∡',\n angsph: '∢',\n mid: '∣',\n VerticalBar: '∣',\n nmid: '∤',\n nsmid: '∤',\n npar: '∦',\n parallel: '∥',\n spar: '∥',\n nparallel: '∦',\n nspar: '∦',\n and: '∧',\n wedge: '∧',\n or: '∨',\n vee: '∨',\n cap: '∩',\n cup: '∪',\n int: '∫',\n Integral: '∫',\n conint: '∮',\n ContourIntegral: '∮',\n Conint: '∯',\n DoubleContourIntegral: '∯',\n Cconint: '∰',\n there4: '∴',\n therefore: '∴',\n Therefore: '∴',\n becaus: '∵',\n because: '∵',\n Because: '∵',\n ratio: '∶',\n Proportion: '∷',\n minusd: '∸',\n dotminus: '∸',\n mDDot: '∺',\n homtht: '∻',\n sim: '∼',\n bsimg: '∽',\n backsim: '∽',\n ac: '∾',\n mstpos: '∾',\n acd: '∿',\n VerticalTilde: '≀',\n wr: '≀',\n wreath: '≀',\n nsime: '≄',\n nsimeq: '≄',\n nsimeq: '≄',\n ncong: '≇',\n simne: '≆',\n ncongdot: '⩭̸',\n ngsim: '≵',\n nsim: '≁',\n napprox: '≉',\n nap: '≉',\n ngeq: '≱',\n nge: '≱',\n nleq: '≰',\n nle: '≰',\n ngtr: '≯',\n ngt: '≯',\n nless: '≮',\n nlt: '≮',\n nprec: '⊀',\n npr: '⊀',\n nsucc: '⊁',\n nsc: '⊁',\n};\n\n/\n Arrows\n * @type {Record<string, string>}\n /\nexport const ARROWS = {\n larr: '←',\n leftarrow: '←',\n LeftArrow: '←',\n uarr: '↑',\n uparrow: '↑',\n UpArrow: '↑',\n rarr: '→',\n rightarrow: '→',\n RightArrow: '→',\n darr: '↓',\n downarrow: '↓',\n DownArrow: '↓',\n harr: '↔',\n leftrightarrow: '↔',\n LeftRightArrow: '↔',\n varr: '↕',\n updownarrow: '↕',\n UpDownArrow: '↕',\n nwarr: '↖',\n nwarrow: '↖',\n UpperLeftArrow: '↖',\n nearr: '↗',\n nearrow: '↗',\n UpperRightArrow: '↗',\n searr: '↘',\n searrow: '↘',\n LowerRightArrow: '↘',\n swarr: '↙',\n swarrow: '↙',\n LowerLeftArrow: '↙',\n lArr: '⇐',\n Leftarrow: '⇐',\n uArr: '⇑',\n Uparrow: '⇑',\n rArr: '⇒',\n Rightarrow: '⇒',\n dArr: '⇓',\n Downarrow: '⇓',\n hArr: '⇔',\n Leftrightarrow: '⇔',\n iff: '⇔',\n vArr: '⇕',\n Updownarrow: '⇕',\n lAarr: '⇚',\n Lleftarrow: '⇚',\n rAarr: '⇛',\n Rrightarrow: '⇛',\n lrarr: '⇆',\n leftrightarrows: '⇆',\n rlarr: '⇄',\n rightleftarrows: '⇄',\n lrhar: '⇋',\n leftrightharpoons: '⇋',\n ReverseEquilibrium: '⇋',\n rlhar: '⇌',\n rightleftharpoons: '⇌',\n Equilibrium: '⇌',\n udarr: '⇅',\n UpArrowDownArrow: '⇅',\n duarr: '⇵',\n DownArrowUpArrow: '⇵',\n llarr: '⇇',\n leftleftarrows: '⇇',\n rrarr: '⇉',\n rightrightarrows: '⇉',\n ddarr: '⇊',\n downdownarrows: '⇊',\n har: '↽',\n lhard: '↽',\n leftharpoondown: '↽',\n lharu: '↼',\n leftharpoonup: '↼',\n rhard: '⇁',\n rightharpoondown: '⇁',\n rharu: '⇀',\n rightharpoonup: '⇀',\n lsh: '↰',\n Lsh: '↰',\n rsh: '↱',\n Rsh: '↱',\n ldsh: '↲',\n rdsh: '↳',\n hookleftarrow: '↩',\n hookrightarrow: '↪',\n mapstoleft: '↤',\n mapstoup: '↥',\n map: '↦',\n mapsto: '↦',\n mapstodown: '↧',\n crarr: '↵',\n nwarrow: '↖',\n nearrow: '↗',\n searrow: '↘',\n swarrow: '↙',\n nleftarrow: '↚',\n nleftrightarrow: '↮',\n nrightarrow: '↛',\n nrarr: '↛',\n larrtl: '↢',\n rarrtl: '↣',\n leftarrowtail: '↢',\n rightarrowtail: '↣',\n twoheadleftarrow: '↞',\n twoheadrightarrow: '↠',\n Larr: '↞',\n Rarr: '↠',\n larrhk: '↩',\n rarrhk: '↪',\n larrlp: '↫',\n looparrowleft: '↫',\n rarrlp: '↬',\n looparrowright: '↬',\n harrw: '↭',\n leftrightsquigarrow: '↭',\n nrarrw: '↝̸',\n rarrw: '↝',\n rightsquigarrow: '↝',\n larrbfs: '⤟',\n rarrbfs: '⤠',\n nvHarr: '⤄',\n nvlArr: '⤂',\n nvrArr: '⤃',\n larrfs: '⤝',\n rarrfs: '⤞',\n Map: '⤅',\n larrsim: '⥳',\n rarrsim: '⥴',\n harrcir: '⥈',\n Uarrocir: '⥉',\n lurdshar: '⥊',\n ldrdhar: '⥧',\n ldrushar: '⥋',\n rdldhar: '⥩',\n lrhard: '⥭',\n rlhar: '⇌',\n uharr: '↾',\n uharl: '↿',\n dharr: '⇂',\n dharl: '⇃',\n Uarr: '↟',\n Darr: '↡',\n zigrarr: '⇝',\n nwArr: '⇖',\n neArr: '⇗',\n seArr: '⇘',\n swArr: '⇙',\n nharr: '↮',\n nhArr: '⇎',\n nlarr: '↚',\n nlArr: '⇍',\n nrarr: '↛',\n nrArr: '⇏',\n larrb: '⇤',\n LeftArrowBar: '⇤',\n rarrb: '⇥',\n RightArrowBar: '⇥',\n};\n\n/\n Geometric Shapes\n * @type {Record<string, string>}\n /\nexport const SHAPES = {\n square: '□',\n Square: '□',\n squ: '□',\n squf: '▪',\n squarf: '▪',\n blacksquar: '▪',\n blacksquare: '▪',\n FilledVerySmallSquare: '▪',\n blk34: '▓',\n blk12: '▒',\n blk14: '░',\n block: '█',\n srect: '▭',\n rect: '▭',\n sdot: '⋅',\n sdotb: '⊡',\n dotsquare: '⊡',\n triangle: '▵',\n tri: '▵',\n trine: '▵',\n utri: '▵',\n triangledown: '▿',\n dtri: '▿',\n tridown: '▿',\n triangleleft: '◃',\n ltri: '◃',\n triangleright: '▹',\n rtri: '▹',\n blacktriangle: '▴',\n utrif: '▴',\n blacktriangledown: '▾',\n dtrif: '▾',\n blacktriangleleft: '◂',\n ltrif: '◂',\n blacktriangleright: '▸',\n rtrif: '▸',\n loz: '◊',\n lozenge: '◊',\n blacklozenge: '⧫',\n lozf: '⧫',\n bigcirc: '◯',\n xcirc: '◯',\n circ: 'ˆ',\n Circle: '○',\n cir: '○',\n o: '○',\n bullet: '•',\n bull: '•',\n hellip: '…',\n mldr: '…',\n nldr: '‥',\n boxh: '─',\n HorizontalLine: '─',\n boxv: '│',\n boxdr: '┌',\n boxdl: '┐',\n boxur: '└',\n boxul: '┘',\n boxvr: '├',\n boxvl: '┤',\n boxhd: '┬',\n boxhu: '┴',\n boxvh: '┼',\n boxH: '═',\n boxV: '║',\n boxdR: '╒',\n boxDr: '╓',\n boxDR: '╔',\n boxDl: '╕',\n boxdL: '╖',\n boxDL: '╗',\n boxuR: '╘',\n boxUr: '╙',\n boxUR: '╚',\n boxUl: '╜',\n boxuL: '╛',\n boxUL: '╝',\n boxvR: '╞',\n boxVr: '╟',\n boxVR: '╠',\n boxVl: '╢',\n boxvL: '╡',\n boxVL: '╣',\n boxHd: '╤',\n boxhD: '╥',\n boxHD: '╦',\n boxHu: '╧',\n boxhU: '╨',\n boxHU: '╩',\n boxvH: '╪',\n boxVh: '╫',\n boxVH: '╬',\n};\n\n/\n Punctuation & Diacritics\n * @type {Record<string, string>}\n /\nexport const PUNCTUATION = {\n excl: '!',\n iexcl: '¡',\n brvbar: '¦',\n sect: '§',\n uml: '¨',\n copy: '©',\n ordf: 'ª',\n laquo: '«',\n not: '¬',\n shy: '\\u00ad',\n reg: '®',\n macr: '¯',\n deg: '°',\n plusmn: '±',\n sup2: '²',\n sup3: '³',\n acute: '´',\n micro: 'µ',\n para: '¶',\n middot: '·',\n cedil: '¸',\n sup1: '¹',\n ordm: 'º',\n raquo: '»',\n frac14: '¼',\n frac12: '½',\n frac34: '¾',\n iquest: '¿',\n nbsp: '\\u00a0',\n comma: ',',\n period: '.',\n colon: ':',\n semi: ';',\n vert: '\|',\n Verbar: '‖',\n verbar: '\|',\n dblac: '˝',\n circ: 'ˆ',\n caron: 'ˇ',\n breve: '˘',\n dot: '˙',\n ring: '˚',\n ogon: '˛',\n tilde: '˜',\n DiacriticalGrave: '`',\n DiacriticalAcute: '´',\n DiacriticalTilde: '˜',\n DiacriticalDot: '˙',\n DiacriticalDoubleAcute: '˝',\n grave: '`',\n acute: '´',\n};\n\n/\n Currency Symbols\n * @type {Record<string, string>}\n /\nexport const CURRENCY = {\n cent: '¢',\n pound: '£',\n curren: '¤',\n yen: '¥',\n euro: '€',\n dollar: '$',\n euro: '€',\n fnof: 'ƒ',\n inr: '₹',\n af: '؋',\n birr: 'ብር',\n peso: '₱',\n rub: '₽',\n won: '₩',\n yuan: '¥',\n cedil: '¸',\n};\n\n/\n Fractions\n * @type {Record<string, string>}\n /\nexport const FRACTIONS = {\n frac12: '½',\n half: '½',\n frac13: '⅓',\n frac14: '¼',\n frac15: '⅕',\n frac16: '⅙',\n frac18: '⅛',\n frac23: '⅔',\n frac25: '⅖',\n frac34: '¾',\n frac35: '⅗',\n frac38: '⅜',\n frac45: '⅘',\n frac56: '⅚',\n frac58: '⅝',\n frac78: '⅞',\n frasl: '⁄',\n};\n\n/\n Miscellaneous Symbols\n * @type {Record<string, string>}\n /\nexport const MISC_SYMBOLS = {\n trade: '™',\n TRADE: '™',\n telrec: '⌕',\n target: '⌖',\n ulcorn: '⌜',\n ulcorner: '⌜',\n urcorn: '⌝',\n urcorner: '⌝',\n dlcorn: '⌞',\n llcorner: '⌞',\n drcorn: '⌟',\n lrcorner: '⌟',\n intercal: '⊺',\n intcal: '⊺',\n oplus: '⊕',\n CirclePlus: '⊕',\n ominus: '⊖',\n CircleMinus: '⊖',\n otimes: '⊗',\n CircleTimes: '⊗',\n osol: '⊘',\n odot: '⊙',\n CircleDot: '⊙',\n oast: '⊛',\n circledast: '⊛',\n odash: '⊝',\n circleddash: '⊝',\n ocirc: '⊚',\n circledcirc: '⊚',\n boxplus: '⊞',\n plusb: '⊞',\n boxminus: '⊟',\n minusb: '⊟',\n boxtimes: '⊠',\n timesb: '⊠',\n boxdot: '⊡',\n sdotb: '⊡',\n veebar: '⊻',\n vee: '∨',\n barvee: '⊽',\n and: '∧',\n wedge: '∧',\n Cap: '⋒',\n Cup: '⋓',\n Fork: '⋔',\n pitchfork: '⋔',\n epar: '⋕',\n ltlarr: '⥶',\n nvap: '≍⃒',\n nvsim: '∼⃒',\n nvge: '≥⃒',\n nvle: '≤⃒',\n nvlt: '<⃒',\n nvgt: '>⃒',\n nvltrie: '⊴⃒',\n nvrtrie: '⊵⃒',\n Vdash: '⊩',\n dashv: '⊣',\n vDash: '⊨',\n Vdash: '⊩',\n Vvdash: '⊪',\n nvdash: '⊬',\n nvDash: '⊭',\n nVdash: '⊮',\n nVDash: '⊯',\n};\n\n/\n All entities combined (if you need everything)\n * @type {Record<string, string>}\n /\nexport const ALL_ENTITIES = {\n ...BASIC_LATIN,\n ...LATIN_ACCENTS,\n ...LATIN_EXTENDED,\n ...GREEK,\n ...CYRILLIC,\n ...MATH,\n ...MATH_ADVANCED,\n ...ARROWS,\n ...SHAPES,\n ...PUNCTUATION,\n ...CURRENCY,\n ...FRACTIONS,\n ...MISC_SYMBOLS,\n};\n\nexport const XML = {\n amp: \"&\",\n apos: \"'\",\n gt: \">\",\n lt: \"<\",\n quot: \"\\\"\"\n}\nexport const COMMON_HTML = {\n nbsp: '\\u00a0',\n copy: '\\u00a9',\n reg: '\\u00ae',\n trade: '\\u2122',\n mdash: '\\u2014',\n ndash: '\\u2013',\n hellip: '\\u2026',\n laquo: '\\u00ab',\n raquo: '\\u00bb',\n lsquo: '\\u2018',\n rsquo: '\\u2019',\n ldquo: '\\u201c',\n rdquo: '\\u201d',\n bull: '\\u2022',\n para: '\\u00b6',\n sect: '\\u00a7',\n deg: '\\u00b0',\n frac12: '\\u00bd',\n frac14: '\\u00bc',\n frac34: '\\u00be',\n}\n// ---------------------------------------------------------------------------\n// Note: NUMERIC_ENTITIES (&#NNN; / &#xHH;) are handled by the scanner directly\n// via String.fromCodePoint() without any map lookup.\n// ---------------------------------------------------------------------------","// ---------------------------------------------------------------------------\n// Built-in named entity map (name → replacement string)\n// No regex, no {regex,val} objects — just flat key/value pairs.\n// ---------------------------------------------------------------------------\n\nimport { XML as DEFAULT_XML_ENTITIES } from \"./entities.js\"\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nconst SPECIAL_CHARS = new Set('!?\\\\\\\\/[]$%{}^&()<>\|+');\n\n/*\n Validate that an entity name contains no dangerous characters.\n * @param {string} name\n * @returns {string} the name, unchanged\n * @throws {Error} on invalid characters\n /\nfunction validateEntityName(name) {\n if (name[0] === '#') {\n throw new Error(`[EntityReplacer] Invalid character '#' in entity name: \"${name}\"`);\n }\n for (const ch of name) {\n if (SPECIAL_CHARS.has(ch)) {\n throw new Error(`[EntityReplacer] Invalid character '${ch}' in entity name: \"${name}\"`);\n }\n }\n return name;\n}\n\n/\n Merge one or more entity maps into a flat name→string map.\n * Accepts either:\n * - plain string values: { amp: '&' }\n * - legacy {regex,val} / {regx,val}: { lt: { regex: /.../, val: '<' } }\n \n Values containing '&' are skipped (recursive expansion risk).\n \n @param {...object} maps\n * @returns {Record<string, string>}\n /\nfunction mergeEntityMaps(...maps) {\n const out = Object.create(null);\n for (const map of maps) {\n if (!map) continue;\n for (const key of Object.keys(map)) {\n const raw = map[key];\n if (typeof raw === 'string') {\n out[key] = raw;\n } else if (raw && typeof raw === 'object' && raw.val !== undefined) {\n // Legacy {regex,val} or {regx,val} — extract the string val only\n const val = raw.val;\n if (typeof val === 'string') {\n out[key] = val;\n }\n // function vals are not supported in the scanner — skip\n }\n }\n }\n return out;\n}\n\n// ---------------------------------------------------------------------------\n// applyLimitsTo helpers\n// ---------------------------------------------------------------------------\n\nconst LIMIT_TIER_EXTERNAL = 'external'; // input/runtime + persistent external maps\nconst LIMIT_TIER_BASE = 'base'; // DEFAULT_XML_ENTITIES + namedEntities (system) maps\nconst LIMIT_TIER_ALL = 'all'; // every entity regardless of tier\n\n/\n Resolve `applyLimitsTo` option into a normalised Set of tier strings.\n * Accepted values: 'external' \| 'base' \| 'all' \| string[]\n * Default: 'external' (only untrusted injected entities are counted).\n * @param {string\|string[]\|undefined} raw\n * @returns {Set<string>}\n /\nfunction parseLimitTiers(raw) {\n if (!raw \|\| raw === LIMIT_TIER_EXTERNAL) return new Set([LIMIT_TIER_EXTERNAL]);\n if (raw === LIMIT_TIER_ALL) return new Set([LIMIT_TIER_ALL]);\n if (raw === LIMIT_TIER_BASE) return new Set([LIMIT_TIER_BASE]);\n if (Array.isArray(raw)) return new Set(raw);\n return new Set([LIMIT_TIER_EXTERNAL]); // safe default for unrecognised values\n}\n\n// ---------------------------------------------------------------------------\n// NCR (Numeric Character Reference) classification\n// ---------------------------------------------------------------------------\n\n// Severity order — higher number = stricter action.\n// Used to enforce minimum action levels for specific codepoint ranges.\nconst NCR_LEVEL = Object.freeze({ allow: 0, leave: 1, remove: 2, throw: 3 });\n\n// XML 1.0 §2.2: allowed chars are #x9 \| #xA \| #xD \| [#x20-#xD7FF] \| [#xE000-#xFFFD] \| [#x10000-#x10FFFF]\n// Restricted C0: U+0001–U+001F excluding U+0009, U+000A, U+000D\nconst XML10_ALLOWED_C0 = new Set([0x09, 0x0A, 0x0D]);\n\n/\n Parse the `ncr` constructor option into flat, hot-path-friendly fields.\n * @param {object\|undefined} ncr\n * @returns {{ xmlVersion: number, onLevel: number, nullLevel: number }}\n /\nfunction parseNCRConfig(ncr) {\n if (!ncr) {\n return { xmlVersion: 1.0, onLevel: NCR_LEVEL.allow, nullLevel: NCR_LEVEL.remove };\n }\n const xmlVersion = ncr.xmlVersion === 1.1 ? 1.1 : 1.0;\n const onLevel = NCR_LEVEL[ncr.onNCR] ?? NCR_LEVEL.allow;\n const nullLevel = NCR_LEVEL[ncr.nullNCR] ?? NCR_LEVEL.remove;\n // 'allow' is not meaningful for null — clamp to at least 'remove'\n const clampedNull = Math.max(nullLevel, NCR_LEVEL.remove);\n return { xmlVersion, onLevel, nullLevel: clampedNull };\n}\n\n// ---------------------------------------------------------------------------\n// EntityReplacer\n// ---------------------------------------------------------------------------\n\n/\n Single-pass, zero-regex entity replacer for XML/HTML content.\n \n Algorithm: scan the string once for '&', read to ';', resolve via map\n * or direct codepoint conversion, build output chunks, join once at the end.\n \n Entity lookup priority (highest → lowest):\n * 1. input / runtime (DOCTYPE entities for current document)\n * 2. persistent external (survive across documents)\n * 3. base named map (DEFAULT_XML_ENTITIES + user-supplied namedEntities)\n \n Both input and external resolve as the 'external' tier for limit purposes.\n * Base map entities resolve as the 'base' tier.\n \n Numeric / hex references (&#NNN; / &#xHH;) are resolved directly via\n * String.fromCodePoint() — no map needed. They count as 'base' tier.\n \n @example\n * const replacer = new EntityReplacer({ namedEntities: COMMON_HTML });\n * replacer.setExternalEntities({ brand: 'Acme' });\n \n const instance = replacer.reset();\n * instance.addInputEntities({ version: '1.0' });\n * instance.encode('&brand; v&version; <'); // 'Acme v1.0 <'\n /\nexport default class EntityDecoder {\n /\n @param {object} [options]\n * @param {object\|null} [options.namedEntities] — extra named entities merged into base map\n * @param {object} [options.limit] — security limits\n * @param {number} [options.limit.maxTotalExpansions=0] — 0 = unlimited\n * @param {number} [options.limit.maxExpandedLength=0] — 0 = unlimited\n * @param {'external'\|'base'\|'all'\|string[]} [options.limit.applyLimitsTo='external']\n * Which entity tiers count against the security limits:\n * - 'external' (default) — only input/runtime + persistent external entities\n * - 'base' — only DEFAULT_XML_ENTITIES + namedEntities\n * - 'all' — every entity regardless of tier\n * - string[] — explicit combination, e.g. ['external', 'base']\n * @param {((resolved: string, original: string) => string)\|null} [options.postCheck=null]\n * @param {string[]} [options.remove=[]] — entity names (e.g. ['nbsp', '#13']) to delete (replace with empty string)\n * @param {string[]} [options.leave=[]] — entity names to keep as literal (unchanged in output)\n * @param {object} [options.ncr] — Numeric Character Reference controls\n * @param {1.0\|1.1} [options.ncr.xmlVersion=1.0]\n * XML version governing which codepoint ranges are restricted:\n * - 1.0 — C0 controls U+0001–U+001F (except U+0009/000A/000D) are prohibited\n * - 1.1 — C0 controls are allowed when written as NCRs; C1 (U+007F–U+009F) decoded as-is\n * @param {'allow'\|'leave'\|'remove'\|'throw'} [options.ncr.onNCR='allow']\n * Base action for numeric references. Severity order: allow < leave < remove < throw.\n * For codepoint ranges that carry a minimum level (surrogates → remove, XML 1.0 C0 → remove),\n * the effective action is max(onNCR, rangeMinimum).\n * @param {'remove'\|'throw'} [options.ncr.nullNCR='remove']\n * Action for U+0000 (null). 'allow' and 'leave' are clamped to 'remove' since null is never safe.\n /\n constructor(options = {}) {\n this._limit = options.limit \|\| {};\n this._maxTotalExpansions = this._limit.maxTotalExpansions \|\| 0;\n this._maxExpandedLength = this._limit.maxExpandedLength \|\| 0;\n this._postCheck = typeof options.postCheck === 'function' ? options.postCheck : r => r;\n this._limitTiers = parseLimitTiers(this._limit.applyLimitsTo ?? LIMIT_TIER_EXTERNAL);\n this._numericAllowed = options.numericAllowed ?? true;\n // Base map: DEFAULT_XML_ENTITIES + user-supplied extras. Immutable after construction.\n this._baseMap = mergeEntityMaps(DEFAULT_XML_ENTITIES, options.namedEntities \|\| null);\n\n // Persistent external entities — survive across documents.\n // Stored as a separate map so reset() never touches them.\n /* @type {Record<string, string>} /\n this._externalMap = Object.create(null);\n\n // Input / runtime entities — current document only, wiped on reset().\n /* @type {Record<string, string>} /\n this._inputMap = Object.create(null);\n\n // Per-document counters\n this._totalExpansions = 0;\n this._expandedLength = 0;\n\n // --- New: remove / leave sets ---\n /* @type {Set<string>} /\n this._removeSet = new Set(options.remove && Array.isArray(options.remove) ? options.remove : []);\n /* @type {Set<string>} /\n this._leaveSet = new Set(options.leave && Array.isArray(options.leave) ? options.leave : []);\n\n // --- NCR config (parsed into flat fields for hot-path speed) ---\n const ncrCfg = parseNCRConfig(options.ncr);\n this._ncrXmlVersion = ncrCfg.xmlVersion;\n this._ncrOnLevel = ncrCfg.onLevel;\n this._ncrNullLevel = ncrCfg.nullLevel;\n }\n\n // -------------------------------------------------------------------------\n // Persistent external entity registration\n // -------------------------------------------------------------------------\n\n /\n Replace the full set of persistent external entities.\n * All keys are validated — throws on invalid characters.\n * @param {Record<string, string \| { regex?: RegExp, val: string }>} map\n /\n setExternalEntities(map) {\n if (map) {\n for (const key of Object.keys(map)) {\n validateEntityName(key);\n }\n }\n this._externalMap = mergeEntityMaps(map);\n }\n\n /\n Add a single persistent external entity.\n * @param {string} key\n * @param {string} value\n /\n addExternalEntity(key, value) {\n validateEntityName(key);\n if (typeof value === 'string' && value.indexOf('&') === -1) {\n this._externalMap[key] = value;\n }\n }\n\n // -------------------------------------------------------------------------\n // Input / runtime entity registration (per document)\n // -------------------------------------------------------------------------\n\n /\n Inject DOCTYPE entities for the current document.\n * Also resets per-document expansion counters.\n * @param {Record<string, string \| { regx?: RegExp, regex?: RegExp, val: string }>} map\n /\n addInputEntities(map) {\n this._totalExpansions = 0;\n this._expandedLength = 0;\n this._inputMap = mergeEntityMaps(map);\n }\n\n // -------------------------------------------------------------------------\n // Per-document reset\n // -------------------------------------------------------------------------\n\n /\n Wipe input/runtime entities and reset counters.\n * Call this before processing each new document.\n * @returns {this}\n /\n reset() {\n this._inputMap = Object.create(null);\n this._totalExpansions = 0;\n this._expandedLength = 0;\n return this;\n }\n\n // -------------------------------------------------------------------------\n // XML version (can be set after construction, e.g. once parser reads <?xml?>)\n // -------------------------------------------------------------------------\n\n /\n Update the XML version used for NCR classification.\n * Call this as soon as the document's `<?xml version=\"...\">` declaration is parsed.\n * @param {1.0\|1.1\|number} version\n /\n setXmlVersion(version) {\n this._ncrXmlVersion = version === 1.1 ? 1.1 : 1.0;\n }\n\n // -------------------------------------------------------------------------\n // Primary API\n // -------------------------------------------------------------------------\n\n /\n Replace all entity references in `str` in a single pass.\n \n @param {string} str\n * @returns {string}\n /\n decode(str) {\n if (typeof str !== 'string' \|\| str.length === 0) return str;\n //TODO: check if needed\n //if (str.indexOf('&') === -1) return str; // fast path — no entities at all\n\n const original = str;\n const chunks = [];\n const len = str.length;\n let last = 0; // start of next unprocessed literal chunk\n let i = 0;\n\n const limitExpansions = this._maxTotalExpansions > 0;\n const limitLength = this._maxExpandedLength > 0;\n const checkLimits = limitExpansions \|\| limitLength;\n\n while (i < len) {\n // Scan forward to next '&'\n if (str.charCodeAt(i) !== 38 / '&' /) { i++; continue; }\n\n // --- Found '&' at position i ---\n\n // Scan forward to ';'\n let j = i + 1;\n while (j < len && str.charCodeAt(j) !== 59 / ';' / && (j - i) <= 32) j++;\n\n if (j >= len \|\| str.charCodeAt(j) !== 59) {\n // No closing ';' within window — treat '&' as literal\n i++;\n continue;\n }\n\n // Raw token between '&' and ';' (exclusive)\n const token = str.slice(i + 1, j);\n if (token.length === 0) { i++; continue; }\n\n let replacement;\n let tier; // which limit tier this entity belongs to\n\n if (this._removeSet.has(token)) {\n // Remove entity: replace with empty string\n replacement = '';\n // If entity was unknown (replacement undefined), we still need a tier for limits.\n // Treat as external tier because it's user-directed removal of an unknown reference.\n if (tier === undefined) {\n tier = LIMIT_TIER_EXTERNAL;\n }\n } else if (this._leaveSet.has(token)) {\n // Do not replace — keep original &token; as literal\n i++;\n continue;\n } else if (token.charCodeAt(0) === 35 / '#' /) {\n // ---- Numeric / NCR reference ----\n // NCR classification always runs first — prohibited codepoints must be\n // caught regardless of numericAllowed.\n const ncrResult = this._resolveNCR(token);\n if (ncrResult === undefined) {\n // 'leave' action — keep original &token; as-is\n i++;\n continue;\n }\n replacement = ncrResult; // '' for remove, char string for allow\n tier = LIMIT_TIER_BASE;\n } else {\n // ---- Named reference ----\n const resolved = this._resolveName(token);\n replacement = resolved?.value;\n tier = resolved?.tier;\n }\n\n if (replacement === undefined) {\n // Unknown entity — leave as-is, advance past '&' only\n i++;\n continue;\n }\n\n // Flush literal chunk before this entity\n if (i > last) chunks.push(str.slice(last, i));\n chunks.push(replacement);\n last = j + 1; // skip past ';'\n i = last;\n\n // Apply expansion limits only if this tier is being tracked\n if (checkLimits && this._tierCounts(tier)) {\n if (limitExpansions) {\n this._totalExpansions++;\n if (this._totalExpansions > this._maxTotalExpansions) {\n throw new Error(\n `[EntityReplacer] Entity expansion count limit exceeded: ` +\n `${this._totalExpansions} > ${this._maxTotalExpansions}`\n );\n }\n }\n if (limitLength) {\n // delta: replacement.length minus the raw &token; length (token.length + 2 for '&' and ';')\n const delta = replacement.length - (token.length + 2);\n if (delta > 0) {\n this._expandedLength += delta;\n if (this._expandedLength > this._maxExpandedLength) {\n throw new Error(\n `[EntityReplacer] Expanded content length limit exceeded: ` +\n `${this._expandedLength} > ${this._maxExpandedLength}`\n );\n }\n }\n }\n }\n }\n\n // Flush trailing literal\n if (last < len) chunks.push(str.slice(last));\n\n // If nothing was replaced, chunks is empty — return original\n const result = chunks.length === 0 ? str : chunks.join('');\n\n return this._postCheck(result, original);\n }\n\n // -------------------------------------------------------------------------\n // Private: limit tier check\n // -------------------------------------------------------------------------\n\n /\n Returns true if a resolved entity of the given tier should count\n * against the expansion/length limits.\n * @param {string} tier — LIMIT_TIER_EXTERNAL \| LIMIT_TIER_BASE\n * @returns {boolean}\n /\n _tierCounts(tier) {\n if (this._limitTiers.has(LIMIT_TIER_ALL)) return true;\n return this._limitTiers.has(tier);\n }\n\n // -------------------------------------------------------------------------\n // Private: entity resolution\n // -------------------------------------------------------------------------\n\n /\n Resolve a named entity token (without & and ;).\n * Priority: inputMap > externalMap > baseMap\n * Returns the resolved value tagged with its limit tier.\n \n @param {string} name\n * @returns {{ value: string, tier: string }\|undefined}\n /\n _resolveName(name) {\n // input and external both count as 'external' tier for limit purposes —\n // they are injected at runtime and are the untrusted surface.\n if (name in this._inputMap) return { value: this._inputMap[name], tier: LIMIT_TIER_EXTERNAL };\n if (name in this._externalMap) return { value: this._externalMap[name], tier: LIMIT_TIER_EXTERNAL };\n if (name in this._baseMap) return { value: this._baseMap[name], tier: LIMIT_TIER_BASE };\n return undefined;\n }\n\n /\n Classify a codepoint and return the minimum action level that must be applied.\n * Returns -1 when no minimum is imposed (normal allow path).\n \n Ranges checked (in priority order):\n * 1. U+0000 — null, governed by nullNCR (always ≥ remove)\n * 2. U+D800–U+DFFF — surrogates, always prohibited (min: remove)\n * 3. U+0001–U+001F \\ {0x09,0x0A,0x0D} — XML 1.0 restricted C0 (min: remove)\n * (skipped in XML 1.1 — C0 controls are allowed when written as NCRs)\n \n @param {number} cp — codepoint\n * @returns {number} — minimum NCR_LEVEL value, or -1 for no restriction\n /\n _classifyNCR(cp) {\n // 1. Null\n if (cp === 0) return this._ncrNullLevel;\n\n // 2. Surrogates — always prohibited, minimum 'remove'\n if (cp >= 0xD800 && cp <= 0xDFFF) return NCR_LEVEL.remove;\n\n // 3. XML 1.0 restricted C0 controls\n if (this._ncrXmlVersion === 1.0) {\n if (cp >= 0x01 && cp <= 0x1F && !XML10_ALLOWED_C0.has(cp)) return NCR_LEVEL.remove;\n }\n\n return -1; // no restriction\n }\n\n /\n Execute a resolved NCR action.\n \n @param {number} action — NCR_LEVEL value\n * @param {string} token — raw token (e.g. '#38') for error messages\n * @param {number} cp — codepoint, used only for error messages\n * @returns {string\|undefined}\n * - decoded character string → 'allow'\n * - '' → 'remove'\n * - undefined → 'leave' (caller must skip past '&' only)\n * - throws Error → 'throw'\n /\n _applyNCRAction(action, token, cp) {\n switch (action) {\n case NCR_LEVEL.allow: return String.fromCodePoint(cp);\n case NCR_LEVEL.remove: return '';\n case NCR_LEVEL.leave: return undefined; // signal: keep literal\n case NCR_LEVEL.throw:\n throw new Error(\n `[EntityDecoder] Prohibited numeric character reference ` +\n `&${token}; (U+${cp.toString(16).toUpperCase().padStart(4, '0')})`\n );\n default: return String.fromCodePoint(cp);\n }\n }\n\n /\n Full NCR resolution pipeline for a numeric token.\n \n Steps:\n * 1. Parse the codepoint (decimal or hex).\n * 2. Validate the raw codepoint range (NaN, <0, >0x10FFFF).\n * 3. If numericAllowed is false and no minimum restriction applies → leave as-is.\n * 4. Classify the codepoint to find the minimum required action level.\n * 5. Resolve effective action = max(onNCR, minimum).\n * 6. Apply and return.\n \n @param {string} token — e.g. '#38', '#x26', '#X26'\n * @returns {string\|undefined}\n * - string (incl. '') — replacement ('' = remove)\n * - undefined — leave original &token; as-is\n /\n _resolveNCR(token) {\n // Step 1: parse codepoint\n const second = token.charCodeAt(1);\n let cp;\n if (second === 120 / x / \|\| second === 88 / X /) {\n cp = parseInt(token.slice(2), 16);\n } else {\n cp = parseInt(token.slice(1), 10);\n }\n\n // Step 2: out-of-range → leave as-is unconditionally\n if (Number.isNaN(cp) \|\| cp < 0 \|\| cp > 0x10FFFF) return undefined;\n\n // Step 3: classify to get minimum action level\n const minimum = this._classifyNCR(cp);\n\n // Step 4: if numericAllowed is false and no hard minimum → leave\n if (!this._numericAllowed && minimum < NCR_LEVEL.remove) return undefined;\n\n // Step 5: effective action = max(configured onNCR, range minimum)\n const effective = minimum === -1\n ? this._ncrOnLevel\n : Math.max(this._ncrOnLevel, minimum);\n\n // Step 6: apply\n return this._applyNCRAction(effective, token, cp);\n }\n}","'use strict';\n///@ts-check\n\nimport { getAllMatches, isExist, DANGEROUS_PROPERTY_NAMES, criticalProperties } from '../util.js';\nimport xmlNode from './xmlNode.js';\nimport DocTypeReader from './DocTypeReader.js';\nimport toNumber from \"strnum\";\nimport getIgnoreAttributesFn from \"../ignoreAttributes.js\";\nimport { Expression, Matcher } from 'path-expression-matcher';\nimport { ExpressionSet } from 'path-expression-matcher';\nimport { EntityDecoder, XML, CURRENCY, COMMON_HTML } from '@nodable/entities';\n\n// const regx =\n// '<((!\\\\[CDATA\\\\[([\\\\s\\\\S]?)(]]>))\|((NAME:)?(NAME))([^>])>\|((\\\\/)(NAME)\\\\s>))([^<])'\n// .replace(/NAME/g, util.nameRegexp);\n\n//const tagsRegx = new RegExp(\"<(\\\\/?[\\\\w:\\\\-\\._]+)([^>])>(\\\\s\"+cdataRegx+\")([^<]+)?\",\"g\");\n//const tagsRegx = new RegExp(\"<(\\\\/?)((\\\\w:)?([\\\\w:\\\\-\\._]+))([^>])>([^<])(\"+cdataRegx+\"([^<]))([^<]+)?\",\"g\");\n\n// Helper functions for attribute and namespace handling\n\n/\n Extract raw attributes (without prefix) from prefixed attribute map\n * @param {object} prefixedAttrs - Attributes with prefix from buildAttributesMap\n * @param {object} options - Parser options containing attributeNamePrefix\n * @returns {object} Raw attributes for matcher\n /\nfunction extractRawAttributes(prefixedAttrs, options) {\n if (!prefixedAttrs) return {};\n\n // Handle attributesGroupName option\n const attrs = options.attributesGroupName\n ? prefixedAttrs[options.attributesGroupName]\n : prefixedAttrs;\n\n if (!attrs) return {};\n\n const rawAttrs = {};\n for (const key in attrs) {\n // Remove the attribute prefix to get raw name\n if (key.startsWith(options.attributeNamePrefix)) {\n const rawName = key.substring(options.attributeNamePrefix.length);\n rawAttrs[rawName] = attrs[key];\n } else {\n // Attribute without prefix (shouldn't normally happen, but be safe)\n rawAttrs[key] = attrs[key];\n }\n }\n return rawAttrs;\n}\n\n/\n Extract namespace from raw tag name\n * @param {string} rawTagName - Tag name possibly with namespace (e.g., \"soap:Envelope\")\n * @returns {string\|undefined} Namespace or undefined\n /\nfunction extractNamespace(rawTagName) {\n if (!rawTagName \|\| typeof rawTagName !== 'string') return undefined;\n\n const colonIndex = rawTagName.indexOf(':');\n if (colonIndex !== -1 && colonIndex > 0) {\n const ns = rawTagName.substring(0, colonIndex);\n // Don't treat xmlns as a namespace\n if (ns !== 'xmlns') {\n return ns;\n }\n }\n return undefined;\n}\n\nexport default class OrderedObjParser {\n constructor(options) {\n this.options = options;\n this.currentNode = null;\n this.tagsNodeStack = [];\n this.parseXml = parseXml;\n this.parseTextData = parseTextData;\n this.resolveNameSpace = resolveNameSpace;\n this.buildAttributesMap = buildAttributesMap;\n this.isItStopNode = isItStopNode;\n this.replaceEntitiesValue = replaceEntitiesValue;\n this.readStopNodeData = readStopNodeData;\n this.saveTextToParentTag = saveTextToParentTag;\n this.addChild = addChild;\n this.ignoreAttributesFn = getIgnoreAttributesFn(this.options.ignoreAttributes)\n this.entityExpansionCount = 0;\n this.currentExpandedLength = 0;\n let namedEntities = { ...XML };\n if (this.options.entityDecoder) {\n this.entityDecoder = this.options.entityDecoder\n } else {\n if (typeof this.options.htmlEntities === \"object\") namedEntities = this.options.htmlEntities;\n else if (this.options.htmlEntities === true) namedEntities = { ...COMMON_HTML, ...CURRENCY };\n this.entityDecoder = new EntityDecoder({\n namedEntities: namedEntities,\n numericAllowed: this.options.htmlEntities,\n limit: {\n maxTotalExpansions: this.options.processEntities.maxTotalExpansions,\n maxExpandedLength: this.options.processEntities.maxExpandedLength,\n applyLimitsTo: this.options.processEntities.appliesTo,\n }\n //postCheck: resolved => resolved\n });\n }\n\n // Initialize path matcher for path-expression-matcher\n this.matcher = new Matcher();\n\n // Live read-only proxy of matcher — PEM creates and caches this internally.\n // All user callbacks receive this instead of the mutable matcher.\n this.readonlyMatcher = this.matcher.readOnly();\n\n // Flag to track if current node is a stop node (optimization)\n this.isCurrentNodeStopNode = false;\n\n // Pre-compile stopNodes expressions\n this.stopNodeExpressionsSet = new ExpressionSet();\n const stopNodesOpts = this.options.stopNodes;\n if (stopNodesOpts && stopNodesOpts.length > 0) {\n for (let i = 0; i < stopNodesOpts.length; i++) {\n const stopNodeExp = stopNodesOpts[i];\n if (typeof stopNodeExp === 'string') {\n // Convert string to Expression object\n this.stopNodeExpressionsSet.add(new Expression(stopNodeExp));\n } else if (stopNodeExp instanceof Expression) {\n // Already an Expression object\n this.stopNodeExpressionsSet.add(stopNodeExp);\n }\n }\n this.stopNodeExpressionsSet.seal();\n }\n }\n\n}\n\n\n/\n @param {string} val\n * @param {string} tagName\n * @param {string\|Matcher} jPath - jPath string or Matcher instance based on options.jPath\n * @param {boolean} dontTrim\n * @param {boolean} hasAttributes\n * @param {boolean} isLeafNode\n * @param {boolean} escapeEntities\n /\nfunction parseTextData(val, tagName, jPath, dontTrim, hasAttributes, isLeafNode, escapeEntities) {\n const options = this.options;\n if (val !== undefined) {\n if (options.trimValues && !dontTrim) {\n val = val.trim();\n }\n if (val.length > 0) {\n if (!escapeEntities) val = this.replaceEntitiesValue(val, tagName, jPath);\n\n // Pass jPath string or matcher based on options.jPath setting\n const jPathOrMatcher = options.jPath ? jPath.toString() : jPath;\n const newval = options.tagValueProcessor(tagName, val, jPathOrMatcher, hasAttributes, isLeafNode);\n if (newval === null \|\| newval === undefined) {\n //don't parse\n return val;\n } else if (typeof newval !== typeof val \|\| newval !== val) {\n //overwrite\n return newval;\n } else if (options.trimValues) {\n return parseValue(val, options.parseTagValue, options.numberParseOptions);\n } else {\n const trimmedVal = val.trim();\n if (trimmedVal === val) {\n return parseValue(val, options.parseTagValue, options.numberParseOptions);\n } else {\n return val;\n }\n }\n }\n }\n}\n\nfunction resolveNameSpace(tagname) {\n if (this.options.removeNSPrefix) {\n const tags = tagname.split(':');\n const prefix = tagname.charAt(0) === '/' ? '/' : '';\n if (tags[0] === 'xmlns') {\n return '';\n }\n if (tags.length === 2) {\n tagname = prefix + tags[1];\n }\n }\n return tagname;\n}\n\n//TODO: change regex to capture NS\n//const attrsRegx = new RegExp(\"([\\\\w\\\\-\\\\.\\\\:]+)\\\\s=\\\\s(['\\\"])((.\|\\n)?)\\\\2\",\"gm\");\nconst attrsRegx = new RegExp('([^\\\\s=]+)\\\\s(=\\\\s([\\'\"])([\\\\s\\\\S]?)\\\\3)?', 'gm');\n\nfunction buildAttributesMap(attrStr, jPath, tagName, force = false) {\n const options = this.options;\n if (force === true \|\| (options.ignoreAttributes !== true && typeof attrStr === 'string')) {\n // attrStr = attrStr.replace(/\\r?\\n/g, ' ');\n //attrStr = attrStr \|\| attrStr.trim();\n\n const matches = getAllMatches(attrStr, attrsRegx);\n const len = matches.length; //don't make it inline\n const attrs = {};\n\n // Pre-process values once: trim + entity replacement\n // Reused in both matcher update and second pass\n const processedVals = new Array(len);\n let hasRawAttrs = false;\n const rawAttrsForMatcher = {};\n\n for (let i = 0; i < len; i++) {\n const attrName = this.resolveNameSpace(matches[i][1]);\n const oldVal = matches[i][4];\n\n if (attrName.length && oldVal !== undefined) {\n let val = oldVal;\n if (options.trimValues) val = val.trim();\n val = this.replaceEntitiesValue(val, tagName, this.readonlyMatcher);\n processedVals[i] = val;\n\n rawAttrsForMatcher[attrName] = val;\n hasRawAttrs = true;\n }\n }\n\n // Update matcher ONCE before second pass, if applicable\n if (hasRawAttrs && typeof jPath === 'object' && jPath.updateCurrent) {\n jPath.updateCurrent(rawAttrsForMatcher);\n }\n\n // Hoist toString() once — path doesn't change during attribute processing\n const jPathStr = options.jPath ? jPath.toString() : this.readonlyMatcher;\n\n // Second pass: apply processors, build final attrs\n let hasAttrs = false;\n for (let i = 0; i < len; i++) {\n const attrName = this.resolveNameSpace(matches[i][1]);\n\n if (this.ignoreAttributesFn(attrName, jPathStr)) continue;\n\n let aName = options.attributeNamePrefix + attrName;\n\n if (attrName.length) {\n if (options.transformAttributeName) {\n aName = options.transformAttributeName(aName);\n }\n aName = sanitizeName(aName, options);\n\n if (matches[i][4] !== undefined) {\n // Reuse already-processed value — no double entity replacement\n const oldVal = processedVals[i];\n\n const newVal = options.attributeValueProcessor(attrName, oldVal, jPathStr);\n if (newVal === null \|\| newVal === undefined) {\n attrs[aName] = oldVal;\n } else if (typeof newVal !== typeof oldVal \|\| newVal !== oldVal) {\n attrs[aName] = newVal;\n } else {\n attrs[aName] = parseValue(oldVal, options.parseAttributeValue, options.numberParseOptions);\n }\n hasAttrs = true;\n } else if (options.allowBooleanAttributes) {\n attrs[aName] = true;\n hasAttrs = true;\n }\n }\n }\n\n if (!hasAttrs) return;\n\n if (options.attributesGroupName) {\n const attrCollection = {};\n attrCollection[options.attributesGroupName] = attrs;\n return attrCollection;\n }\n return attrs;\n }\n}\nconst parseXml = function (xmlData) {\n xmlData = xmlData.replace(/\\r\\n?/g, \"\\n\"); //TODO: remove this line\n const xmlObj = new xmlNode('!xml');\n let currentNode = xmlObj;\n let textData = \"\";\n\n // Reset matcher for new document\n this.matcher.reset();\n this.entityDecoder.reset();\n\n // Reset entity expansion counters for this document\n this.entityExpansionCount = 0;\n this.currentExpandedLength = 0;\n const options = this.options;\n const docTypeReader = new DocTypeReader(options.processEntities);\n const xmlLen = xmlData.length;\n for (let i = 0; i < xmlLen; i++) {//for each char in XML data\n const ch = xmlData[i];\n if (ch === '<') {\n // const nextIndex = i+1;\n // const _2ndChar = xmlData[nextIndex];\n const c1 = xmlData.charCodeAt(i + 1);\n if (c1 === 47) {//Closing Tag '/'\n const closeIndex = findClosingIndex(xmlData, \">\", i, \"Closing Tag is not closed.\")\n let tagName = xmlData.substring(i + 2, closeIndex).trim();\n\n if (options.removeNSPrefix) {\n const colonIndex = tagName.indexOf(\":\");\n if (colonIndex !== -1) {\n tagName = tagName.substr(colonIndex + 1);\n }\n }\n\n tagName = transformTagName(options.transformTagName, tagName, \"\", options).tagName;\n\n if (currentNode) {\n textData = this.saveTextToParentTag(textData, currentNode, this.readonlyMatcher);\n }\n\n //check if last tag of nested tag was unpaired tag\n const lastTagName = this.matcher.getCurrentTag();\n if (tagName && options.unpairedTagsSet.has(tagName)) {\n throw new Error(`Unpaired tag can not be used as closing tag: </${tagName}>`);\n }\n if (lastTagName && options.unpairedTagsSet.has(lastTagName)) {\n // Pop the unpaired tag\n this.matcher.pop();\n this.tagsNodeStack.pop();\n }\n // Pop the closing tag\n this.matcher.pop();\n this.isCurrentNodeStopNode = false; // Reset flag when closing tag\n\n currentNode = this.tagsNodeStack.pop();//avoid recursion, set the parent tag scope\n textData = \"\";\n i = closeIndex;\n } else if (c1 === 63) { //'?'\n\n let tagData = readTagExp(xmlData, i, false, \"?>\");\n if (!tagData) throw new Error(\"Pi Tag is not closed.\");\n\n textData = this.saveTextToParentTag(textData, currentNode, this.readonlyMatcher);\n const attsMap = this.buildAttributesMap(tagData.tagExp, this.matcher, tagData.tagName, true);\n if (attsMap) {\n const ver = attsMap[this.options.attributeNamePrefix + \"version\"];\n this.entityDecoder.setXmlVersion(Number(ver) \|\| 1.0);\n }\n if ((options.ignoreDeclaration && tagData.tagName === \"?xml\") \|\| options.ignorePiTags) {\n //do nothing\n } else {\n\n const childNode = new xmlNode(tagData.tagName);\n childNode.add(options.textNodeName, \"\");\n\n if (tagData.tagName !== tagData.tagExp && tagData.attrExpPresent && options.ignoreAttributes !== true) {\n childNode[\":@\"] = attsMap\n }\n this.addChild(currentNode, childNode, this.readonlyMatcher, i);\n }\n\n\n i = tagData.closeIndex + 1;\n } else if (c1 === 33\n && xmlData.charCodeAt(i + 2) === 45\n && xmlData.charCodeAt(i + 3) === 45) { //'!--'\n const endIndex = findClosingIndex(xmlData, \"-->\", i + 4, \"Comment is not closed.\")\n if (options.commentPropName) {\n const comment = xmlData.substring(i + 4, endIndex - 2);\n\n textData = this.saveTextToParentTag(textData, currentNode, this.readonlyMatcher);\n\n currentNode.add(options.commentPropName, [{ [options.textNodeName]: comment }]);\n }\n i = endIndex;\n } else if (c1 === 33\n && xmlData.charCodeAt(i + 2) === 68) { //'!D'\n const result = docTypeReader.readDocType(xmlData, i);\n this.entityDecoder.addInputEntities(result.entities);\n i = result.i;\n } else if (c1 === 33\n && xmlData.charCodeAt(i + 2) === 91) { // '!['\n const closeIndex = findClosingIndex(xmlData, \"]]>\", i, \"CDATA is not closed.\") - 2;\n const tagExp = xmlData.substring(i + 9, closeIndex);\n\n textData = this.saveTextToParentTag(textData, currentNode, this.readonlyMatcher);\n\n let val = this.parseTextData(tagExp, currentNode.tagname, this.readonlyMatcher, true, false, true, true);\n if (val == undefined) val = \"\";\n\n //cdata should be set even if it is 0 length string\n if (options.cdataPropName) {\n currentNode.add(options.cdataPropName, [{ [options.textNodeName]: tagExp }]);\n } else {\n currentNode.add(options.textNodeName, val);\n }\n\n i = closeIndex + 2;\n } else {//Opening tag\n let result = readTagExp(xmlData, i, options.removeNSPrefix);\n\n // Safety check: readTagExp can return undefined\n if (!result) {\n // Log context for debugging\n const context = xmlData.substring(Math.max(0, i - 50), Math.min(xmlLen, i + 50));\n throw new Error(`readTagExp returned undefined at position ${i}. Context: \"${context}\"`);\n }\n\n let tagName = result.tagName;\n const rawTagName = result.rawTagName;\n let tagExp = result.tagExp;\n let attrExpPresent = result.attrExpPresent;\n let closeIndex = result.closeIndex;\n\n ({ tagName, tagExp } = transformTagName(options.transformTagName, tagName, tagExp, options));\n\n if (options.strictReservedNames &&\n (tagName === options.commentPropName\n \|\| tagName === options.cdataPropName\n \|\| tagName === options.textNodeName\n \|\| tagName === options.attributesGroupName\n )) {\n throw new Error(`Invalid tag name: ${tagName}`);\n }\n\n //save text as child node\n if (currentNode && textData) {\n if (currentNode.tagname !== '!xml') {\n //when nested tag is found\n textData = this.saveTextToParentTag(textData, currentNode, this.readonlyMatcher, false);\n }\n }\n\n //check if last tag was unpaired tag\n const lastTag = currentNode;\n if (lastTag && options.unpairedTagsSet.has(lastTag.tagname)) {\n currentNode = this.tagsNodeStack.pop();\n this.matcher.pop();\n }\n\n // Clean up self-closing syntax BEFORE processing attributes\n // This is where tagExp gets the trailing / removed\n let isSelfClosing = false;\n if (tagExp.length > 0 && tagExp.lastIndexOf(\"/\") === tagExp.length - 1) {\n isSelfClosing = true;\n if (tagName[tagName.length - 1] === \"/\") {\n tagName = tagName.substr(0, tagName.length - 1);\n tagExp = tagName;\n } else {\n tagExp = tagExp.substr(0, tagExp.length - 1);\n }\n\n // Re-check attrExpPresent after cleaning\n attrExpPresent = (tagName !== tagExp);\n }\n\n // Now process attributes with CLEAN tagExp (no trailing /)\n let prefixedAttrs = null;\n let rawAttrs = {};\n let namespace = undefined;\n\n // Extract namespace from rawTagName\n namespace = extractNamespace(rawTagName);\n\n // Push tag to matcher FIRST (with empty attrs for now) so callbacks see correct path\n if (tagName !== xmlObj.tagname) {\n this.matcher.push(tagName, {}, namespace);\n }\n\n // Now build attributes - callbacks will see correct matcher state\n if (tagName !== tagExp && attrExpPresent) {\n // Build attributes (returns prefixed attributes for the tree)\n // Note: buildAttributesMap now internally updates the matcher with raw attributes\n prefixedAttrs = this.buildAttributesMap(tagExp, this.matcher, tagName);\n\n if (prefixedAttrs) {\n // Extract raw attributes (without prefix) for our use\n //TODO: seems a performance overhead\n rawAttrs = extractRawAttributes(prefixedAttrs, options);\n }\n }\n\n // Now check if this is a stop node (after attributes are set)\n if (tagName !== xmlObj.tagname) {\n this.isCurrentNodeStopNode = this.isItStopNode();\n }\n\n const startIndex = i;\n if (this.isCurrentNodeStopNode) {\n let tagContent = \"\";\n\n // For self-closing tags, content is empty\n if (isSelfClosing) {\n i = result.closeIndex;\n }\n //unpaired tag\n else if (options.unpairedTagsSet.has(tagName)) {\n i = result.closeIndex;\n }\n //normal tag\n else {\n //read until closing tag is found\n const result = this.readStopNodeData(xmlData, rawTagName, closeIndex + 1);\n if (!result) throw new Error(`Unexpected end of ${rawTagName}`);\n i = result.i;\n tagContent = result.tagContent;\n }\n\n const childNode = new xmlNode(tagName);\n\n if (prefixedAttrs) {\n childNode[\":@\"] = prefixedAttrs;\n }\n\n // For stop nodes, store raw content as-is without any processing\n childNode.add(options.textNodeName, tagContent);\n\n this.matcher.pop(); // Pop the stop node tag\n this.isCurrentNodeStopNode = false; // Reset flag\n\n this.addChild(currentNode, childNode, this.readonlyMatcher, startIndex);\n } else {\n //selfClosing tag\n if (isSelfClosing) {\n ({ tagName, tagExp } = transformTagName(options.transformTagName, tagName, tagExp, options));\n\n const childNode = new xmlNode(tagName);\n if (prefixedAttrs) {\n childNode[\":@\"] = prefixedAttrs;\n }\n this.addChild(currentNode, childNode, this.readonlyMatcher, startIndex);\n this.matcher.pop(); // Pop self-closing tag\n this.isCurrentNodeStopNode = false; // Reset flag\n }\n else if (options.unpairedTagsSet.has(tagName)) {//unpaired tag\n const childNode = new xmlNode(tagName);\n if (prefixedAttrs) {\n childNode[\":@\"] = prefixedAttrs;\n }\n this.addChild(currentNode, childNode, this.readonlyMatcher, startIndex);\n this.matcher.pop(); // Pop unpaired tag\n this.isCurrentNodeStopNode = false; // Reset flag\n i = result.closeIndex;\n // Continue to next iteration without changing currentNode\n continue;\n }\n //opening tag\n else {\n const childNode = new xmlNode(tagName);\n if (this.tagsNodeStack.length > options.maxNestedTags) {\n throw new Error(\"Maximum nested tags exceeded\");\n }\n this.tagsNodeStack.push(currentNode);\n\n if (prefixedAttrs) {\n childNode[\":@\"] = prefixedAttrs;\n }\n this.addChild(currentNode, childNode, this.readonlyMatcher, startIndex);\n currentNode = childNode;\n }\n textData = \"\";\n i = closeIndex;\n }\n }\n } else {\n textData += xmlData[i];\n }\n }\n return xmlObj.child;\n}\n\nfunction addChild(currentNode, childNode, matcher, startIndex) {\n // unset startIndex if not requested\n if (!this.options.captureMetaData) startIndex = undefined;\n\n // Pass jPath string or matcher based on options.jPath setting\n const jPathOrMatcher = this.options.jPath ? matcher.toString() : matcher;\n const result = this.options.updateTag(childNode.tagname, jPathOrMatcher, childNode[\":@\"])\n if (result === false) {\n //do nothing\n } else if (typeof result === \"string\") {\n childNode.tagname = result\n currentNode.addChild(childNode, startIndex);\n } else {\n currentNode.addChild(childNode, startIndex);\n }\n}\n\n/\n @param {object} val - Entity object with regex and val properties\n * @param {string} tagName - Tag name\n * @param {string\|Matcher} jPath - jPath string or Matcher instance based on options.jPath\n /\nfunction replaceEntitiesValue(val, tagName, jPath) {\n const entityConfig = this.options.processEntities;\n\n if (!entityConfig \|\| !entityConfig.enabled) {\n return val;\n }\n\n // Check if tag is allowed to contain entities\n if (entityConfig.allowedTags) {\n const jPathOrMatcher = this.options.jPath ? jPath.toString() : jPath;\n const allowed = Array.isArray(entityConfig.allowedTags)\n ? entityConfig.allowedTags.includes(tagName)\n : entityConfig.allowedTags(tagName, jPathOrMatcher);\n\n if (!allowed) {\n return val;\n }\n }\n\n // Apply custom tag filter if provided\n if (entityConfig.tagFilter) {\n const jPathOrMatcher = this.options.jPath ? jPath.toString() : jPath;\n if (!entityConfig.tagFilter(tagName, jPathOrMatcher)) {\n return val; // Skip based on custom filter\n }\n }\n\n return this.entityDecoder.decode(val);\n}\n\n\nfunction saveTextToParentTag(textData, parentNode, matcher, isLeafNode) {\n if (textData) { //store previously collected data as textNode\n if (isLeafNode === undefined) isLeafNode = parentNode.child.length === 0\n\n textData = this.parseTextData(textData,\n parentNode.tagname,\n matcher,\n false,\n parentNode[\":@\"] ? Object.keys(parentNode[\":@\"]).length !== 0 : false,\n isLeafNode);\n\n if (textData !== undefined && textData !== \"\")\n parentNode.add(this.options.textNodeName, textData);\n textData = \"\";\n }\n return textData;\n}\n\n/\n @param {Array<Expression>} stopNodeExpressions - Array of compiled Expression objects\n * @param {Matcher} matcher - Current path matcher\n /\nfunction isItStopNode() {\n if (this.stopNodeExpressionsSet.size === 0) return false;\n\n return this.matcher.matchesAny(this.stopNodeExpressionsSet);\n}\n\n/\n Returns the tag Expression and where it is ending handling single-double quotes situation\n * @param {string} xmlData \n * @param {number} i starting index\n * @returns \n /\nfunction tagExpWithClosingIndex(xmlData, i, closingChar = \">\") {\n let attrBoundary = 0;\n const chars = [];\n const len = xmlData.length;\n const closeCode0 = closingChar.charCodeAt(0);\n const closeCode1 = closingChar.length > 1 ? closingChar.charCodeAt(1) : -1;\n\n for (let index = i; index < len; index++) {\n const code = xmlData.charCodeAt(index);\n\n if (attrBoundary) {\n if (code === attrBoundary) attrBoundary = 0;\n } else if (code === 34 \|\| code === 39) { // \" or '\n attrBoundary = code;\n } else if (code === closeCode0) {\n if (closeCode1 !== -1) {\n if (xmlData.charCodeAt(index + 1) === closeCode1) {\n return { data: String.fromCharCode(...chars), index };\n }\n } else {\n return { data: String.fromCharCode(...chars), index };\n }\n } else if (code === 9) { // \\t\n chars.push(32); // space\n continue;\n }\n\n chars.push(code);\n }\n}\n\nfunction findClosingIndex(xmlData, str, i, errMsg) {\n const closingIndex = xmlData.indexOf(str, i);\n if (closingIndex === -1) {\n throw new Error(errMsg)\n } else {\n return closingIndex + str.length - 1;\n }\n}\n\nfunction findClosingChar(xmlData, char, i, errMsg) {\n const closingIndex = xmlData.indexOf(char, i);\n if (closingIndex === -1) throw new Error(errMsg);\n return closingIndex; // no offset needed\n}\n\nfunction readTagExp(xmlData, i, removeNSPrefix, closingChar = \">\") {\n const result = tagExpWithClosingIndex(xmlData, i + 1, closingChar);\n if (!result) return;\n let tagExp = result.data;\n const closeIndex = result.index;\n const separatorIndex = tagExp.search(/\\s/);\n let tagName = tagExp;\n let attrExpPresent = true;\n if (separatorIndex !== -1) {//separate tag name and attributes expression\n tagName = tagExp.substring(0, separatorIndex);\n tagExp = tagExp.substring(separatorIndex + 1).trimStart();\n }\n\n const rawTagName = tagName;\n if (removeNSPrefix) {\n const colonIndex = tagName.indexOf(\":\");\n if (colonIndex !== -1) {\n tagName = tagName.substr(colonIndex + 1);\n attrExpPresent = tagName !== result.data.substr(colonIndex + 1);\n }\n }\n\n return {\n tagName: tagName,\n tagExp: tagExp,\n closeIndex: closeIndex,\n attrExpPresent: attrExpPresent,\n rawTagName: rawTagName,\n }\n}\n/\n find paired tag for a stop node\n * @param {string} xmlData \n * @param {string} tagName \n * @param {number} i \n /\nfunction readStopNodeData(xmlData, tagName, i) {\n const startIndex = i;\n // Starting at 1 since we already have an open tag\n let openTagCount = 1;\n\n const xmllen = xmlData.length;\n for (; i < xmllen; i++) {\n if (xmlData[i] === \"<\") {\n const c1 = xmlData.charCodeAt(i + 1);\n if (c1 === 47) {//close tag '/'\n const closeIndex = findClosingChar(xmlData, \">\", i, `${tagName} is not closed`);\n let closeTagName = xmlData.substring(i + 2, closeIndex).trim();\n if (closeTagName === tagName) {\n openTagCount--;\n if (openTagCount === 0) {\n return {\n tagContent: xmlData.substring(startIndex, i),\n i: closeIndex\n }\n }\n }\n i = closeIndex;\n } else if (c1 === 63) { //?\n const closeIndex = findClosingIndex(xmlData, \"?>\", i + 1, \"StopNode is not closed.\")\n i = closeIndex;\n } else if (c1 === 33\n && xmlData.charCodeAt(i + 2) === 45\n && xmlData.charCodeAt(i + 3) === 45) { // '!--'\n const closeIndex = findClosingIndex(xmlData, \"-->\", i + 3, \"StopNode is not closed.\")\n i = closeIndex;\n } else if (c1 === 33\n && xmlData.charCodeAt(i + 2) === 91) { // '!['\n const closeIndex = findClosingIndex(xmlData, \"]]>\", i, \"StopNode is not closed.\") - 2;\n i = closeIndex;\n } else {\n const tagData = readTagExp(xmlData, i, '>')\n\n if (tagData) {\n const openTagName = tagData && tagData.tagName;\n if (openTagName === tagName && tagData.tagExp[tagData.tagExp.length - 1] !== \"/\") {\n openTagCount++;\n }\n i = tagData.closeIndex;\n }\n }\n }\n }//end for loop\n}\n\nfunction parseValue(val, shouldParse, options) {\n if (shouldParse && typeof val === 'string') {\n //console.log(options)\n const newval = val.trim();\n if (newval === 'true') return true;\n else if (newval === 'false') return false;\n else return toNumber(val, options);\n } else {\n if (isExist(val)) {\n return val;\n } else {\n return '';\n }\n }\n}\n\nfunction fromCodePoint(str, base, prefix) {\n const codePoint = Number.parseInt(str, base);\n\n if (codePoint >= 0 && codePoint <= 0x10FFFF) {\n return String.fromCodePoint(codePoint);\n } else {\n return prefix + str + \";\";\n }\n}\n\nfunction transformTagName(fn, tagName, tagExp, options) {\n if (fn) {\n const newTagName = fn(tagName);\n if (tagExp === tagName) {\n tagExp = newTagName\n }\n tagName = newTagName;\n }\n tagName = sanitizeName(tagName, options);\n return { tagName, tagExp };\n}\n\n\n\nfunction sanitizeName(name, options) {\n if (criticalProperties.includes(name)) {\n throw new Error(`[SECURITY] Invalid name: \"${name}\" is a reserved JavaScript keyword that could cause prototype pollution`);\n } else if (DANGEROUS_PROPERTY_NAMES.includes(name)) {\n return options.onDangerousProperty(name);\n }\n return name;\n}","export default function getIgnoreAttributesFn(ignoreAttributes) {\n if (typeof ignoreAttributes === 'function') {\n return ignoreAttributes\n }\n if (Array.isArray(ignoreAttributes)) {\n return (attrName) => {\n for (const pattern of ignoreAttributes) {\n if (typeof pattern === 'string' && attrName === pattern) {\n return true\n }\n if (pattern instanceof RegExp && pattern.test(attrName)) {\n return true\n }\n }\n }\n }\n return () => false\n}","'use strict';\n\nimport XmlNode from './xmlNode.js';\nimport { Matcher } from 'path-expression-matcher';\n\nconst METADATA_SYMBOL = XmlNode.getMetaDataSymbol();\n\n/\n Helper function to strip attribute prefix from attribute map\n * @param {object} attrs - Attributes with prefix (e.g., {\"@_class\": \"code\"})\n * @param {string} prefix - Attribute prefix to remove (e.g., \"@_\")\n * @returns {object} Attributes without prefix (e.g., {\"class\": \"code\"})\n /\nfunction stripAttributePrefix(attrs, prefix) {\n if (!attrs \|\| typeof attrs !== 'object') return {};\n if (!prefix) return attrs;\n\n const rawAttrs = {};\n for (const key in attrs) {\n if (key.startsWith(prefix)) {\n const rawName = key.substring(prefix.length);\n rawAttrs[rawName] = attrs[key];\n } else {\n // Attribute without prefix (shouldn't normally happen, but be safe)\n rawAttrs[key] = attrs[key];\n }\n }\n return rawAttrs;\n}\n\n/\n \n * @param {array} node \n * @param {any} options \n * @param {Matcher} matcher - Path matcher instance\n * @returns \n /\nexport default function prettify(node, options, matcher, readonlyMatcher) {\n return compress(node, options, matcher, readonlyMatcher);\n}\n\n/\n @param {array} arr \n * @param {object} options \n * @param {Matcher} matcher - Path matcher instance\n * @returns object\n /\nfunction compress(arr, options, matcher, readonlyMatcher) {\n let text;\n const compressedObj = {}; //This is intended to be a plain object\n for (let i = 0; i < arr.length; i++) {\n const tagObj = arr[i];\n const property = propName(tagObj);\n\n // Push current property to matcher WITH RAW ATTRIBUTES (no prefix)\n if (property !== undefined && property !== options.textNodeName) {\n const rawAttrs = stripAttributePrefix(\n tagObj[\":@\"] \|\| {},\n options.attributeNamePrefix\n );\n matcher.push(property, rawAttrs);\n }\n\n if (property === options.textNodeName) {\n if (text === undefined) text = tagObj[property];\n else text += \"\" + tagObj[property];\n } else if (property === undefined) {\n continue;\n } else if (tagObj[property]) {\n\n let val = compress(tagObj[property], options, matcher, readonlyMatcher);\n const isLeaf = isLeafTag(val, options);\n\n if (tagObj[\":@\"]) {\n assignAttributes(val, tagObj[\":@\"], readonlyMatcher, options);\n } else if (Object.keys(val).length === 1 && val[options.textNodeName] !== undefined && !options.alwaysCreateTextNode) {\n val = val[options.textNodeName];\n } else if (Object.keys(val).length === 0) {\n if (options.alwaysCreateTextNode) val[options.textNodeName] = \"\";\n else val = \"\";\n }\n\n if (tagObj[METADATA_SYMBOL] !== undefined && typeof val === \"object\" && val !== null) {\n val[METADATA_SYMBOL] = tagObj[METADATA_SYMBOL]; // copy over metadata\n }\n\n\n if (compressedObj[property] !== undefined && Object.prototype.hasOwnProperty.call(compressedObj, property)) {\n if (!Array.isArray(compressedObj[property])) {\n compressedObj[property] = [compressedObj[property]];\n }\n compressedObj[property].push(val);\n } else {\n //TODO: if a node is not an array, then check if it should be an array\n //also determine if it is a leaf node\n\n // Pass jPath string or readonlyMatcher based on options.jPath setting\n const jPathOrMatcher = options.jPath ? readonlyMatcher.toString() : readonlyMatcher;\n if (options.isArray(property, jPathOrMatcher, isLeaf)) {\n compressedObj[property] = [val];\n } else {\n compressedObj[property] = val;\n }\n }\n\n // Pop property from matcher after processing\n if (property !== undefined && property !== options.textNodeName) {\n matcher.pop();\n }\n }\n\n }\n // if(text && text.length > 0) compressedObj[options.textNodeName] = text;\n if (typeof text === \"string\") {\n if (text.length > 0) compressedObj[options.textNodeName] = text;\n } else if (text !== undefined) compressedObj[options.textNodeName] = text;\n\n\n return compressedObj;\n}\n\nfunction propName(obj) {\n const keys = Object.keys(obj);\n for (let i = 0; i < keys.length; i++) {\n const key = keys[i];\n if (key !== \":@\") return key;\n }\n}\n\nfunction assignAttributes(obj, attrMap, readonlyMatcher, options) {\n if (attrMap) {\n const keys = Object.keys(attrMap);\n const len = keys.length; //don't make it inline\n for (let i = 0; i < len; i++) {\n const atrrName = keys[i]; // This is the PREFIXED name (e.g., \"@_class\")\n\n // Strip prefix for matcher path (for isArray callback)\n const rawAttrName = atrrName.startsWith(options.attributeNamePrefix)\n ? atrrName.substring(options.attributeNamePrefix.length)\n : atrrName;\n\n // For attributes, we need to create a temporary path\n // Pass jPath string or matcher based on options.jPath setting\n const jPathOrMatcher = options.jPath\n ? readonlyMatcher.toString() + \".\" + rawAttrName\n : readonlyMatcher;\n\n if (options.isArray(atrrName, jPathOrMatcher, true, true)) {\n obj[atrrName] = [attrMap[atrrName]];\n } else {\n obj[atrrName] = attrMap[atrrName];\n }\n }\n }\n}\n\nfunction isLeafTag(obj, options) {\n const { textNodeName } = options;\n const propCount = Object.keys(obj).length;\n\n if (propCount === 0) {\n return true;\n }\n\n if (\n propCount === 1 &&\n (obj[textNodeName] \|\| typeof obj[textNodeName] === \"boolean\" \|\| obj[textNodeName] === 0)\n ) {\n return true;\n }\n\n return false;\n}","'use strict';\n\nimport { getAllMatches, isName } from './util.js';\n\nconst defaultOptions = {\n allowBooleanAttributes: false, //A tag can have attributes without any value\n unpairedTags: []\n};\n\n//const tagsPattern = new RegExp(\"<\\\\/?([\\\\w:\\\\-_\\.]+)\\\\s\\/?>\",\"g\");\nexport function validate(xmlData, options) {\n options = Object.assign({}, defaultOptions, options);\n\n //xmlData = xmlData.replace(/(\\r\\n\|\\n\|\\r)/gm,\"\");//make it single line\n //xmlData = xmlData.replace(/(^\\s<\\?xml.?\\?>)/g,\"\");//Remove XML starting tag\n //xmlData = xmlData.replace(/(<!DOCTYPE[\\s\\w\\\"\\.\\/\\-\\:]+(\\[.\\])\\s>)/g,\"\");//Remove DOCTYPE\n const tags = [];\n let tagFound = false;\n\n //indicates that the root tag has been closed (aka. depth 0 has been reached)\n let reachedRoot = false;\n\n if (xmlData[0] === '\\ufeff') {\n // check for byte order mark (BOM)\n xmlData = xmlData.substr(1);\n }\n\n for (let i = 0; i < xmlData.length; i++) {\n\n if (xmlData[i] === '<' && xmlData[i + 1] === '?') {\n i += 2;\n i = readPI(xmlData, i);\n if (i.err) return i;\n } else if (xmlData[i] === '<') {\n //starting of tag\n //read until you reach to '>' avoiding any '>' in attribute value\n let tagStartPos = i;\n i++;\n\n if (xmlData[i] === '!') {\n i = readCommentAndCDATA(xmlData, i);\n continue;\n } else {\n let closingTag = false;\n if (xmlData[i] === '/') {\n //closing tag\n closingTag = true;\n i++;\n }\n //read tagname\n let tagName = '';\n for (; i < xmlData.length &&\n xmlData[i] !== '>' &&\n xmlData[i] !== ' ' &&\n xmlData[i] !== '\\t' &&\n xmlData[i] !== '\\n' &&\n xmlData[i] !== '\\r'; i++\n ) {\n tagName += xmlData[i];\n }\n tagName = tagName.trim();\n //console.log(tagName);\n\n if (tagName[tagName.length - 1] === '/') {\n //self closing tag without attributes\n tagName = tagName.substring(0, tagName.length - 1);\n //continue;\n i--;\n }\n if (!validateTagName(tagName)) {\n let msg;\n if (tagName.trim().length === 0) {\n msg = \"Invalid space after '<'.\";\n } else {\n msg = \"Tag '\" + tagName + \"' is an invalid name.\";\n }\n return getErrorObject('InvalidTag', msg, getLineNumberForPosition(xmlData, i));\n }\n\n const result = readAttributeStr(xmlData, i);\n if (result === false) {\n return getErrorObject('InvalidAttr', \"Attributes for '\" + tagName + \"' have open quote.\", getLineNumberForPosition(xmlData, i));\n }\n let attrStr = result.value;\n i = result.index;\n\n if (attrStr[attrStr.length - 1] === '/') {\n //self closing tag\n const attrStrStart = i - attrStr.length;\n attrStr = attrStr.substring(0, attrStr.length - 1);\n const isValid = validateAttributeString(attrStr, options);\n if (isValid === true) {\n tagFound = true;\n //continue; //text may presents after self closing tag\n } else {\n //the result from the nested function returns the position of the error within the attribute\n //in order to get the 'true' error line, we need to calculate the position where the attribute begins (i - attrStr.length) and then add the position within the attribute\n //this gives us the absolute index in the entire xml, which we can use to find the line at last\n return getErrorObject(isValid.err.code, isValid.err.msg, getLineNumberForPosition(xmlData, attrStrStart + isValid.err.line));\n }\n } else if (closingTag) {\n if (!result.tagClosed) {\n return getErrorObject('InvalidTag', \"Closing tag '\" + tagName + \"' doesn't have proper closing.\", getLineNumberForPosition(xmlData, i));\n } else if (attrStr.trim().length > 0) {\n return getErrorObject('InvalidTag', \"Closing tag '\" + tagName + \"' can't have attributes or invalid starting.\", getLineNumberForPosition(xmlData, tagStartPos));\n } else if (tags.length === 0) {\n return getErrorObject('InvalidTag', \"Closing tag '\" + tagName + \"' has not been opened.\", getLineNumberForPosition(xmlData, tagStartPos));\n } else {\n const otg = tags.pop();\n if (tagName !== otg.tagName) {\n let openPos = getLineNumberForPosition(xmlData, otg.tagStartPos);\n return getErrorObject('InvalidTag',\n \"Expected closing tag '\" + otg.tagName + \"' (opened in line \" + openPos.line + \", col \" + openPos.col + \") instead of closing tag '\" + tagName + \"'.\",\n getLineNumberForPosition(xmlData, tagStartPos));\n }\n\n //when there are no more tags, we reached the root level.\n if (tags.length == 0) {\n reachedRoot = true;\n }\n }\n } else {\n const isValid = validateAttributeString(attrStr, options);\n if (isValid !== true) {\n //the result from the nested function returns the position of the error within the attribute\n //in order to get the 'true' error line, we need to calculate the position where the attribute begins (i - attrStr.length) and then add the position within the attribute\n //this gives us the absolute index in the entire xml, which we can use to find the line at last\n return getErrorObject(isValid.err.code, isValid.err.msg, getLineNumberForPosition(xmlData, i - attrStr.length + isValid.err.line));\n }\n\n //if the root level has been reached before ...\n if (reachedRoot === true) {\n return getErrorObject('InvalidXml', 'Multiple possible root nodes found.', getLineNumberForPosition(xmlData, i));\n } else if (options.unpairedTags.indexOf(tagName) !== -1) {\n //don't push into stack\n } else {\n tags.push({ tagName, tagStartPos });\n }\n tagFound = true;\n }\n\n //skip tag text value\n //It may include comments and CDATA value\n for (i++; i < xmlData.length; i++) {\n if (xmlData[i] === '<') {\n if (xmlData[i + 1] === '!') {\n //comment or CADATA\n i++;\n i = readCommentAndCDATA(xmlData, i);\n continue;\n } else if (xmlData[i + 1] === '?') {\n i = readPI(xmlData, ++i);\n if (i.err) return i;\n } else {\n break;\n }\n } else if (xmlData[i] === '&') {\n const afterAmp = validateAmpersand(xmlData, i);\n if (afterAmp == -1)\n return getErrorObject('InvalidChar', \"char '&' is not expected.\", getLineNumberForPosition(xmlData, i));\n i = afterAmp;\n } else {\n if (reachedRoot === true && !isWhiteSpace(xmlData[i])) {\n return getErrorObject('InvalidXml', \"Extra text at the end\", getLineNumberForPosition(xmlData, i));\n }\n }\n } //end of reading tag text value\n if (xmlData[i] === '<') {\n i--;\n }\n }\n } else {\n if (isWhiteSpace(xmlData[i])) {\n continue;\n }\n return getErrorObject('InvalidChar', \"char '\" + xmlData[i] + \"' is not expected.\", getLineNumberForPosition(xmlData, i));\n }\n }\n\n if (!tagFound) {\n return getErrorObject('InvalidXml', 'Start tag expected.', 1);\n } else if (tags.length == 1) {\n return getErrorObject('InvalidTag', \"Unclosed tag '\" + tags[0].tagName + \"'.\", getLineNumberForPosition(xmlData, tags[0].tagStartPos));\n } else if (tags.length > 0) {\n return getErrorObject('InvalidXml', \"Invalid '\" +\n JSON.stringify(tags.map(t => t.tagName), null, 4).replace(/\\r?\\n/g, '') +\n \"' found.\", { line: 1, col: 1 });\n }\n\n return true;\n};\n\nfunction isWhiteSpace(char) {\n return char === ' ' \|\| char === '\\t' \|\| char === '\\n' \|\| char === '\\r';\n}\n/\n Read Processing insstructions and skip\n * @param {} xmlData\n @param {} i\n /\nfunction readPI(xmlData, i) {\n const start = i;\n for (; i < xmlData.length; i++) {\n if (xmlData[i] == '?' \|\| xmlData[i] == ' ') {\n //tagname\n const tagname = xmlData.substr(start, i - start);\n if (i > 5 && tagname === 'xml') {\n return getErrorObject('InvalidXml', 'XML declaration allowed only at the start of the document.', getLineNumberForPosition(xmlData, i));\n } else if (xmlData[i] == '?' && xmlData[i + 1] == '>') {\n //check if valid attribut string\n i++;\n break;\n } else {\n continue;\n }\n }\n }\n return i;\n}\n\nfunction readCommentAndCDATA(xmlData, i) {\n if (xmlData.length > i + 5 && xmlData[i + 1] === '-' && xmlData[i + 2] === '-') {\n //comment\n for (i += 3; i < xmlData.length; i++) {\n if (xmlData[i] === '-' && xmlData[i + 1] === '-' && xmlData[i + 2] === '>') {\n i += 2;\n break;\n }\n }\n } else if (\n xmlData.length > i + 8 &&\n xmlData[i + 1] === 'D' &&\n xmlData[i + 2] === 'O' &&\n xmlData[i + 3] === 'C' &&\n xmlData[i + 4] === 'T' &&\n xmlData[i + 5] === 'Y' &&\n xmlData[i + 6] === 'P' &&\n xmlData[i + 7] === 'E'\n ) {\n let angleBracketsCount = 1;\n for (i += 8; i < xmlData.length; i++) {\n if (xmlData[i] === '<') {\n angleBracketsCount++;\n } else if (xmlData[i] === '>') {\n angleBracketsCount--;\n if (angleBracketsCount === 0) {\n break;\n }\n }\n }\n } else if (\n xmlData.length > i + 9 &&\n xmlData[i + 1] === '[' &&\n xmlData[i + 2] === 'C' &&\n xmlData[i + 3] === 'D' &&\n xmlData[i + 4] === 'A' &&\n xmlData[i + 5] === 'T' &&\n xmlData[i + 6] === 'A' &&\n xmlData[i + 7] === '['\n ) {\n for (i += 8; i < xmlData.length; i++) {\n if (xmlData[i] === ']' && xmlData[i + 1] === ']' && xmlData[i + 2] === '>') {\n i += 2;\n break;\n }\n }\n }\n\n return i;\n}\n\nconst doubleQuote = '\"';\nconst singleQuote = \"'\";\n\n/*\n Keep reading xmlData until '<' is found outside the attribute value.\n * @param {string} xmlData\n * @param {number} i\n /\nfunction readAttributeStr(xmlData, i) {\n let attrStr = '';\n let startChar = '';\n let tagClosed = false;\n for (; i < xmlData.length; i++) {\n if (xmlData[i] === doubleQuote \|\| xmlData[i] === singleQuote) {\n if (startChar === '') {\n startChar = xmlData[i];\n } else if (startChar !== xmlData[i]) {\n //if vaue is enclosed with double quote then single quotes are allowed inside the value and vice versa\n } else {\n startChar = '';\n }\n } else if (xmlData[i] === '>') {\n if (startChar === '') {\n tagClosed = true;\n break;\n }\n }\n attrStr += xmlData[i];\n }\n if (startChar !== '') {\n return false;\n }\n\n return {\n value: attrStr,\n index: i,\n tagClosed: tagClosed\n };\n}\n\n/\n Select all the attributes whether valid or invalid.\n /\nconst validAttrStrRegxp = new RegExp('(\\\\s)([^\\\\s=]+)(\\\\s=)?(\\\\s([\\'\"])(([\\\\s\\\\S])?)\\\\5)?', 'g');\n\n//attr, =\"sd\", a=\"amit's\", a=\"sd\"b=\"saf\", ab cd=\"\"\n\nfunction validateAttributeString(attrStr, options) {\n //console.log(\"start:\"+attrStr+\":end\");\n\n //if(attrStr.trim().length === 0) return true; //empty string\n\n const matches = getAllMatches(attrStr, validAttrStrRegxp);\n const attrNames = {};\n\n for (let i = 0; i < matches.length; i++) {\n if (matches[i][1].length === 0) {\n //nospace before attribute name: a=\"sd\"b=\"saf\"\n return getErrorObject('InvalidAttr', \"Attribute '\" + matches[i][2] + \"' has no space in starting.\", getPositionFromMatch(matches[i]))\n } else if (matches[i][3] !== undefined && matches[i][4] === undefined) {\n return getErrorObject('InvalidAttr', \"Attribute '\" + matches[i][2] + \"' is without value.\", getPositionFromMatch(matches[i]));\n } else if (matches[i][3] === undefined && !options.allowBooleanAttributes) {\n //independent attribute: ab\n return getErrorObject('InvalidAttr', \"boolean attribute '\" + matches[i][2] + \"' is not allowed.\", getPositionFromMatch(matches[i]));\n }\n / else if(matches[i][6] === undefined){//attribute without value: ab=\n return { err: { code:\"InvalidAttr\",msg:\"attribute \" + matches[i][2] + \" has no value assigned.\"}};\n } /\n const attrName = matches[i][2];\n if (!validateAttrName(attrName)) {\n return getErrorObject('InvalidAttr', \"Attribute '\" + attrName + \"' is an invalid name.\", getPositionFromMatch(matches[i]));\n }\n if (!Object.prototype.hasOwnProperty.call(attrNames, attrName)) {\n //check for duplicate attribute.\n attrNames[attrName] = 1;\n } else {\n return getErrorObject('InvalidAttr', \"Attribute '\" + attrName + \"' is repeated.\", getPositionFromMatch(matches[i]));\n }\n }\n\n return true;\n}\n\nfunction validateNumberAmpersand(xmlData, i) {\n let re = /\\d/;\n if (xmlData[i] === 'x') {\n i++;\n re = /[\\da-fA-F]/;\n }\n for (; i < xmlData.length; i++) {\n if (xmlData[i] === ';')\n return i;\n if (!xmlData[i].match(re))\n break;\n }\n return -1;\n}\n\nfunction validateAmpersand(xmlData, i) {\n // https://www.w3.org/TR/xml/#dt-charref\n i++;\n if (xmlData[i] === ';')\n return -1;\n if (xmlData[i] === '#') {\n i++;\n return validateNumberAmpersand(xmlData, i);\n }\n let count = 0;\n for (; i < xmlData.length; i++, count++) {\n if (xmlData[i].match(/\\w/) && count < 20)\n continue;\n if (xmlData[i] === ';')\n break;\n return -1;\n }\n return i;\n}\n\nfunction getErrorObject(code, message, lineNumber) {\n return {\n err: {\n code: code,\n msg: message,\n line: lineNumber.line \|\| lineNumber,\n col: lineNumber.col,\n },\n };\n}\n\nfunction validateAttrName(attrName) {\n return isName(attrName);\n}\n\n// const startsWithXML = /^xml/i;\n\nfunction validateTagName(tagname) {\n return isName(tagname) / && !tagname.match(startsWithXML) /;\n}\n\n//this function returns the line number for the character at the given index\nfunction getLineNumberForPosition(xmlData, index) {\n const lines = xmlData.substring(0, index).split(/\\r?\\n/);\n return {\n line: lines.length,\n\n // column number is last line's length + 1, because column numbering starts at 1:\n col: lines[lines.length - 1].length + 1\n };\n}\n\n//this function returns the position of the first character of match within attrStr\nfunction getPositionFromMatch(match) {\n return match.startIndex + match[1].length;\n}\n","import { buildOptions } from './OptionsBuilder.js';\nimport OrderedObjParser from './OrderedObjParser.js';\nimport prettify from './node2json.js';\nimport { validate } from \"../validator.js\";\nimport XmlNode from './xmlNode.js';\n\nexport default class XMLParser {\n\n constructor(options) {\n this.externalEntities = {};\n this.options = buildOptions(options);\n\n }\n /\n Parse XML dats to JS object \n * @param {string\|Uint8Array} xmlData \n * @param {boolean\|Object} validationOption \n /\n parse(xmlData, validationOption) {\n if (typeof xmlData !== \"string\" && xmlData.toString) {\n xmlData = xmlData.toString();\n } else if (typeof xmlData !== \"string\") {\n throw new Error(\"XML data is accepted in String or Bytes[] form.\")\n }\n\n if (validationOption) {\n if (validationOption === true) validationOption = {}; //validate with default options\n\n const result = validate(xmlData, validationOption);\n if (result !== true) {\n throw Error(`${result.err.msg}:${result.err.line}:${result.err.col}`)\n }\n }\n const orderedObjParser = new OrderedObjParser(this.options);\n orderedObjParser.entityDecoder.setExternalEntities(this.externalEntities);\n const orderedResult = orderedObjParser.parseXml(xmlData);\n if (this.options.preserveOrder \|\| orderedResult === undefined) return orderedResult;\n else return prettify(orderedResult, this.options, orderedObjParser.matcher, orderedObjParser.readonlyMatcher);\n }\n\n /\n Add Entity which is not by default supported by this library\n * @param {string} key \n * @param {string} value \n /\n addEntity(key, value) {\n if (value.indexOf(\"&\") !== -1) {\n throw new Error(\"Entity value can't have '&'\")\n } else if (key.indexOf(\"&\") !== -1 \|\| key.indexOf(\";\") !== -1) {\n throw new Error(\"An entity must be set without '&' and ';'. Eg. use '#xD' for ' '\")\n } else if (value === \"&\") {\n throw new Error(\"An entity with value '&' is not permitted\");\n } else {\n this.externalEntities[key] = value;\n }\n }\n\n /\n Returns a Symbol that can be used to access the metadata\n * property on a node.\n * \n * If Symbol is not available in the environment, an ordinary property is used\n * and the name of the property is here returned.\n * \n * The XMLMetaData property is only present when `captureMetaData`\n * is true in the options.\n /\n static getMetaDataSymbol() {\n return XmlNode.getMetaDataSymbol();\n }\n}","'use strict';\n\nimport { validate } from './validator.js';\nimport XMLParser from './xmlparser/XMLParser.js';\nimport XMLBuilder from './xmlbuilder/json2xml.js';\n\nconst XMLValidator = {\n validate: validate\n}\nexport {\n XMLParser,\n XMLValidator,\n XMLBuilder\n};","export const string = {\n minLength(expected, actual) {\n return actual.length >= expected;\n },\n maxLength(expected, actual) {\n return actual.length <= expected;\n },\n length(expected, actual) {\n return actual.length === expected;\n },\n pattern(expected, actual, modifier = \"\") {\n const regxp = new RegExp(expected, modifier);\n return regxp.test(actual);\n },\n fixed(expected, actual) {\n return expected === actual;\n },\n in(expected, actual) {\n return expected.split(\",\").indexOf(actual) > -1;\n },\n};\n\nexport const num = {\n min(expected, actual) {\n return Number(actual) >= expected;\n },\n max(expected, actual) {\n return Number(actual) <= expected;\n },\n};\n\nexport const list = {\n minOccurs(expected, actual) {\n return actual >= expected;\n },\n maxOccurs(expected, actual) {\n return actual <= expected;\n },\n};\n\nexport const date = {\n /\n Compare two date strings.\n * @param {string} a\n * @param {string} b\n * @returns {number}\n /\n compare(a, b) {\n return Date.parse(a) - Date.parse(b);\n },\n\n isBefore(actual, reference) {\n return Date.parse(actual) < Date.parse(reference);\n },\n\n isAfter(actual, reference) {\n return Date.parse(actual) > Date.parse(reference);\n },\n\n min(expected, actual) {\n return Date.parse(actual) >= Date.parse(expected);\n },\n\n max(expected, actual) {\n return Date.parse(actual) <= Date.parse(expected);\n },\n};\n","import as validations from \"./validations.js\";\nimport { breakInSets, parseRange, parseDateRange } from \"./util.js\";\n\nconst numericTypes = [\"positiveInteger\", \"integer\", \"positiveDecimal\", \"decimal\", \"number\"];\n\nexport class Traverser {\n /*\n @param {object} options\n * @param {object} validators\n /\n constructor(options, validators, siblingOrder) {\n this.options = options;\n this.failures = [];\n this.validators = validators;\n\n // uniqueness tracking: field path -> array of seen values (sibling-scoped)\n // global uniqueness tracking: field name -> array of seen values (document-scoped)\n this._globalUnique = new Map(); // Map<fieldName, Set<string>>\n\n // Side-channel sibling order map built during XML parsing.\n // Map<parentPath, string[]> where parentPath matches Traverser's dot-notation path.\n this._siblingOrder = siblingOrder \|\| new Map();\n }\n\n /\n @param {object\|string} ele\n * @param {string} key\n * @param {object\|string} rules\n * @param {string} path\n /\n traverse(ele, key, rules, path) {\n if (Array.isArray(ele)) {\n if (rules !== undefined && rules[\"@rules\"] !== undefined) {\n if (rules[\"@rules\"].repeatable !== undefined) {\n this.checkOccurences(rules[\"@rules\"], ele.length, path);\n ele.forEach((val, index) => {\n const arrayPath = path + \"[\" + index + \"]\";\n if (Object.keys(rules).length > 1) {\n this.callForCommonProperties(ele[index], rules, arrayPath);\n } else {\n this.traverse(ele[index], key, rules, arrayPath);\n }\n });\n return;\n }\n }\n this.failures.push({\n code: \"unexpected sequence\",\n path: path.substr(1),\n });\n } else if (typeof ele === \"object\") {\n this.callForCommonProperties(ele, rules, path);\n } else {\n if (typeof rules === \"object\" && rules[\"@rules\"]) {\n this.checkDataAndType(ele, key, rules, path);\n } else if (this.isMapType(rules)) {\n this.validateMandatoryFields(rules, path);\n }\n this.applyCustomValidators(ele, rules, path);\n }\n }\n\n applyCustomValidators(ele, rules, path) {\n if (\n rules[\"@rules\"] &&\n rules[\"@rules\"].checkBy &&\n typeof this.validators[rules[\"@rules\"].checkBy] === \"function\"\n ) {\n let res = this.validators[rules[\"@rules\"].checkBy](ele, path.substr(1));\n if (typeof res === \"object\") {\n this.failures.push(res);\n }\n }\n }\n\n /\n @param {object} ele\n * @param {object} rules\n * @param {string} path\n /\n callForCommonProperties(ele, rules, path) {\n const tags = Object.keys(ele);\n const rulesTags = Object.keys(rules);\n\n const sets = breakInSets(tags, rulesTags);\n this.checkUnknownSiblings(sets, path);\n this.checkMissingSiblings(sets, rules, path);\n\n this.applyCustomValidators(ele, rules, path);\n\n // Collect sibling values for uniqueness checks before traversing\n // Build a map of fieldName -> array of values for this sibling scope\n const siblingValues = this._buildSiblingValues(ele, rules, sets.common);\n\n sets.common.forEach((key) => {\n const newpath = path + \".\" + key;\n this.traverse(ele[key], key, rules[key], newpath);\n });\n\n // After traversing, run ordering, uniqueness, and relational checks for this sibling scope\n this._checkOrderingConstraints(ele, rules, sets.common, path);\n this._checkUniquenessConstraints(ele, rules, sets.common, path, siblingValues);\n this._checkRelationalConstraints(ele, rules, sets.common, path);\n }\n\n // ─── Ordering Constraints (before / after) ────────────────────────────────\n\n /\n For every field that has `before` or `after` in its rules, validate that\n * it appears positionally before or after the referenced sibling tag in the\n * original XML document order.\n \n Order is sourced from the side-channel `_siblingOrder` map built during\n * parsing — not from JS object key order, which is unreliable for integer keys.\n \n Works for any tag type, not just dates.\n \n @param {object} ele\n * @param {object} rules\n * @param {string[]} commonKeys\n * @param {string} path - current traversal path (e.g. \".event\" or \".order[0]\")\n /\n _checkOrderingConstraints(ele, rules, commonKeys, path) {\n // The siblingOrder map is keyed by the parent path without the leading dot.\n const orderKey = path.substr(1);\n const order = this._siblingOrder.get(orderKey);\n // If we have no order info for this path, skip — can happen for empty elements.\n if (!order) return;\n\n commonKeys.forEach((key) => {\n const fieldRules = rules[key];\n if (!fieldRules \|\| !fieldRules[\"@rules\"]) return;\n const r = fieldRules[\"@rules\"];\n\n const keyIdx = order.indexOf(key);\n if (keyIdx === -1) return; // tag not recorded — skip\n\n if (r.after) {\n const refKey = r.after;\n // Skip silently if referenced sibling is absent from data\n if (ele[refKey] === undefined) return;\n const refIdx = order.indexOf(refKey);\n if (refIdx === -1) return;\n if (keyIdx <= refIdx) {\n this.failures.push({\n code: \"after\",\n path: (path + \".\" + key).substr(1),\n actual: key,\n expected: refKey,\n });\n }\n }\n\n if (r.before) {\n const refKey = r.before;\n // Skip silently if referenced sibling is absent from data\n if (ele[refKey] === undefined) return;\n const refIdx = order.indexOf(refKey);\n if (refIdx === -1) return;\n if (keyIdx >= refIdx) {\n this.failures.push({\n code: \"before\",\n path: (path + \".\" + key).substr(1),\n actual: key,\n expected: refKey,\n });\n }\n }\n });\n }\n\n // ─── Relational Constraints (sameAs / notSameAs / lessThan / moreThan) ──────\n\n /\n Compare this field's value against another sibling field's value.\n \n Supported rule attributes:\n * sameAs=\"refField\" — values must be equal\n * notSameAs=\"refField\" — values must differ\n * lessThan=\"refField\" — this value must be strictly less than ref value\n * moreThan=\"refField\" — this value must be strictly greater than ref value\n \n Comparison is type-aware based on the field's declared `type`:\n * date types → Date.parse() comparison\n * numeric types → Number() comparison\n * all others → lexicographic string comparison\n \n Skips silently when:\n * - The referenced sibling is absent from data\n * - Either value is an object/map (not a primitive)\n * - The ref value cannot be coerced to the expected type\n \n @param {object} ele\n * @param {object} rules\n * @param {string[]} commonKeys\n * @param {string} path\n /\n _checkRelationalConstraints(ele, rules, commonKeys, path) {\n const RELATIONAL_RULES = [\"sameAs\", \"notSameAs\", \"lessThan\", \"moreThan\"];\n\n commonKeys.forEach((key) => {\n const fieldRules = rules[key];\n if (!fieldRules \|\| !fieldRules[\"@rules\"]) return;\n const r = fieldRules[\"@rules\"];\n\n // Check if any relational rule is present\n if (!RELATIONAL_RULES.some((attr) => r[attr] !== undefined)) return;\n\n const actualRaw = ele[key];\n\n // Skip maps and arrays — only primitives are comparable\n if (actualRaw === null \|\| actualRaw === undefined) return;\n if (typeof actualRaw === \"object\") return;\n\n const fieldType = r.type \|\| \"string\";\n\n RELATIONAL_RULES.forEach((attr) => {\n if (r[attr] === undefined) return;\n\n const refKey = r[attr];\n const refRaw = ele[refKey];\n\n // Skip silently if ref sibling is absent or is a map/array\n if (refRaw === undefined \|\| refRaw === null) return;\n if (typeof refRaw === \"object\") return;\n\n // Coerce both values and compare\n const cmp = this._relationalCompare(String(actualRaw), String(refRaw), fieldType);\n\n // cmp is null when coercion fails — skip silently\n if (cmp === null) return;\n\n let violated = false;\n if (attr === \"sameAs\" && cmp !== 0) violated = true;\n if (attr === \"notSameAs\" && cmp === 0) violated = true;\n if (attr === \"lessThan\" && cmp >= 0) violated = true;\n if (attr === \"moreThan\" && cmp <= 0) violated = true;\n\n if (violated) {\n this.failures.push({\n code: attr,\n path: (path + \".\" + key).substr(1),\n actual: String(actualRaw),\n expected: refKey,\n });\n }\n });\n });\n }\n\n /\n Compare two string-encoded values using the appropriate strategy for the field type.\n * Returns a negative number, zero, or positive number (like Array.sort comparator).\n * Returns null if coercion fails (caller should skip silently).\n * @param {string} a\n * @param {string} b\n * @param {string} fieldType\n * @returns {number\|null}\n /\n _relationalCompare(a, b, fieldType) {\n if (fieldType === \"date\") {\n const da = Date.parse(a);\n const db = Date.parse(b);\n if (isNaN(da) \|\| isNaN(db)) return null;\n return da - db;\n }\n if (numericTypes.indexOf(fieldType) !== -1) {\n const na = Number(a);\n const nb = Number(b);\n if (isNaN(na) \|\| isNaN(nb)) return null;\n return na - nb;\n }\n // string / no type — lexicographic\n if (a < b) return -1;\n if (a > b) return 1;\n return 0;\n }\n\n // ─── Uniqueness Constraints ───────────────────────────────────────────────\n\n /\n Build a map of fieldName -> array of values found in this sibling scope.\n * Works for both scalar values and array (repeatable) values.\n * @param {object} ele\n * @param {object} rules\n * @param {string[]} commonKeys\n * @returns {Map<string, string[]>}\n /\n _buildSiblingValues(ele, rules, commonKeys) {\n const map = new Map();\n commonKeys.forEach((key) => {\n const val = ele[key];\n if (Array.isArray(val)) {\n map.set(key, val.map(String));\n } else if (val !== undefined && val !== null && typeof val !== \"object\") {\n map.set(key, [String(val)]);\n }\n });\n return map;\n }\n\n /\n Check uniqueness constraints for fields in this sibling scope.\n * @param {object} ele\n * @param {object} rules\n * @param {string[]} commonKeys\n * @param {string} path\n * @param {Map<string, string[]>} siblingValues\n /\n _checkUniquenessConstraints(ele, rules, commonKeys, path, siblingValues) {\n // For repeatable items (array context), ele is a single item; sibling-scope\n // uniqueness is managed by the parent array traversal which collects all items.\n // We handle uniqueness at the collection level in `_checkUniqueInCollection`.\n // This method handles per-field unique=\"global\".\n commonKeys.forEach((key) => {\n const fieldRules = rules[key];\n if (!fieldRules \|\| !fieldRules[\"@rules\"]) return;\n const unique = fieldRules[\"@rules\"].unique;\n if (!unique) return;\n\n const vals = siblingValues.get(key) \|\| [];\n if (unique === \"global\") {\n vals.forEach((v, idx) => {\n const fieldPath = Array.isArray(ele[key])\n ? (path + \".\" + key + \"[\" + idx + \"]\").substr(1)\n : (path + \".\" + key).substr(1);\n this._assertGlobalUnique(key, v, fieldPath);\n });\n }\n // unique=\"true\" (sibling scope) is handled at the repeatable-collection level\n });\n }\n\n /\n Check uniqueness within a collection of repeatable items.\n * Called from _traverseRepeatableCollection when sibling-scoped uniqueness is needed.\n * @param {Array<object>} items\n * @param {string} fieldKey - field to check\n * @param {string} basePath - path prefix for error messages\n /\n _checkUniqueInCollection(items, fieldKey, basePath) {\n const seen = new Map(); // value -> first index\n items.forEach((item, idx) => {\n const val = item[fieldKey];\n if (val === undefined \|\| val === null \|\| typeof val === \"object\") return;\n const strVal = String(val);\n if (seen.has(strVal)) {\n this.failures.push({\n code: \"unique\",\n path: (basePath + \"[\" + idx + \"].\" + fieldKey).substr(1),\n value: strVal,\n });\n } else {\n seen.set(strVal, idx);\n }\n });\n }\n\n /\n Assert a value is unique globally (across the whole document).\n * @param {string} fieldName\n * @param {string} value\n * @param {string} fieldPath\n /\n _assertGlobalUnique(fieldName, value, fieldPath) {\n if (!this._globalUnique.has(fieldName)) {\n this._globalUnique.set(fieldName, new Set());\n }\n const seen = this._globalUnique.get(fieldName);\n if (seen.has(value)) {\n this.failures.push({\n code: \"unique\",\n path: fieldPath,\n value,\n });\n } else {\n seen.add(value);\n }\n }\n\n // ─── Data & Type ──────────────────────────────────────────────────────────\n\n /\n Check if the leaf node has correct type and passes validations.\n * @param {string} val\n * @param {string} key\n * @param {object} rules\n * @param {string} path\n /\n checkDataAndType(val, key, rules, path) {\n if (rules[\"@rules\"].repeatable === true) {\n this.checkOccurences(rules[\"@rules\"], 1, path);\n }\n const eleType = rules[\"@rules\"].type;\n\n // Expand range shorthand before numeric validation\n const expandedRules = this._expandRange(rules);\n\n if (eleType === \"map\" \|\| (!eleType && this.isMapType(rules))) {\n if (typeof val === \"string\" && val.length > 0) {\n this.failures.push({\n code: \"unexpected value in a map\",\n path: path.substr(1),\n value: val,\n });\n }\n this.validateMandatoryFields(rules, path);\n } else if (eleType === \"date\") {\n this.validateDate(val, eleType, path);\n this._checkDateBounds(rules, val, path);\n } else if (eleType === \"boolean\") {\n this.validateBoolean(val, eleType, path);\n } else if (numericTypes.indexOf(eleType) !== -1) {\n if (!this.isValidNum(eleType, val)) {\n this.setInvalidDataType(eleType, path, val);\n } else {\n this.assertValue(expandedRules[\"@rules\"], \"num\", Number(val), path);\n }\n } else if (eleType === \"string\" \|\| !eleType) {\n this.assertValue(expandedRules[\"@rules\"], \"string\", val, path);\n } else {\n throw new Error(\"Unsupported data type in Rules:\" + eleType);\n }\n }\n\n /\n Expand `range=\"min..max\"` shorthand into `min` and `max` on a cloned rules object.\n * @param {object} rules\n * @returns {object}\n /\n _expandRange(rules) {\n if (!rules[\"@rules\"] \|\| !rules[\"@rules\"].range) return rules;\n const parsed = parseRange(rules[\"@rules\"].range);\n if (!parsed) return rules;\n // Clone to avoid mutating the shared rules object\n return {\n ...rules,\n \"@rules\": {\n ...rules[\"@rules\"],\n min: rules[\"@rules\"].min !== undefined ? rules[\"@rules\"].min : String(parsed.min),\n max: rules[\"@rules\"].max !== undefined ? rules[\"@rules\"].max : String(parsed.max),\n },\n };\n }\n\n /\n Check `min`, `max`, and `range` bounds for a date field.\n * Only runs after the value has already passed `validateDate` (i.e. it is a valid date).\n * Explicit `min`/`max` take precedence over `range` shorthand.\n * @param {object} rules\n * @param {string} val\n * @param {string} path\n /\n _checkDateBounds(rules, val, path) {\n if (isNaN(Date.parse(val))) return; // invalid date — type check already reported it\n const r = rules[\"@rules\"];\n\n let min = r.min;\n let max = r.max;\n\n // Expand range shorthand only for the parts not already set explicitly\n if (r.range && (!min \|\| !max)) {\n const parsed = parseDateRange(r.range);\n if (parsed) {\n if (!min) min = parsed.min;\n if (!max) max = parsed.max;\n }\n }\n\n if (min !== undefined && !validations.date.min(min, val)) {\n this.setInvalidValueError(\"min\", path, val, min);\n }\n if (max !== undefined && !validations.date.max(max, val)) {\n this.setInvalidValueError(\"max\", path, val, max);\n }\n }\n\n /\n @param {object} rules\n * @param {string} newpath\n /\n validateMandatoryFields(rules, newpath) {\n const keys = Object.keys(rules);\n for (let i = 0; i < keys.length; i++) {\n if (keys[i] === \"@rules\") continue;\n const child = rules[keys[i]];\n const rulesForChild = child[\"@rules\"];\n if (rulesForChild) {\n if (rulesForChild.minOccurs && rulesForChild.minOccurs > 0) {\n this.failures.push({\n code: \"missing\",\n path: (newpath + \".\" + keys[i]).substr(1),\n });\n } else if (rulesForChild.nillable !== undefined && rulesForChild.nillable === \"false\") {\n this.failures.push({\n code: \"missing\",\n path: (newpath + \".\" + keys[i]).substr(1),\n });\n }\n }\n }\n }\n\n /\n @param {any} tag\n * @returns {boolean}\n /\n isMapType(tag) {\n if (typeof tag === \"string\") return false;\n const keys = Object.keys(tag);\n if (tag[\"@rules\"]) {\n if (keys.length === 1) return false;\n } else if (keys.length === 0) {\n return false;\n } else {\n return true;\n }\n }\n\n setInvalidValueError(rule, newpath, actual, expected) {\n this.failures.push({\n code: rule,\n path: newpath.substr(1),\n actual,\n expected,\n });\n }\n\n checkOccurences(rules, actual, newpath) {\n [\"minOccurs\", \"maxOccurs\"].forEach((rule) => {\n if (rules[rule] !== undefined) {\n const expected = Number(rules[rule]);\n if (!validations.list[rule](expected, actual)) {\n this.setInvalidValueError(rule, newpath, actual, expected);\n }\n }\n });\n }\n\n checkNumeric(rules, actual, newpath) {\n [\"min\", \"max\"].forEach((rule) => {\n if (rules[rule] !== undefined) {\n const expected = Number(rules[rule]);\n if (!validations.num[rule](expected, actual)) {\n this.setInvalidValueError(rule, newpath, actual, expected);\n }\n }\n });\n }\n\n checkString(rules, actual, newpath) {\n [\"minLength\", \"maxLength\", \"length\"].forEach((rule) => {\n if (rules[rule] !== undefined) {\n const expected = Number(rules[rule]);\n if (!validations.string[rule](expected, actual)) {\n this.setInvalidValueError(rule, newpath, actual, expected);\n }\n }\n });\n [\"fixed\", \"in\"].forEach((rule) => {\n if (rules[rule] !== undefined) {\n const expected = rules[rule];\n if (!validations.string[rule](expected, actual)) {\n this.setInvalidValueError(rule, newpath, actual, expected);\n }\n }\n });\n [\"pattern\", \"pattern_i\", \"pattern_im\", \"pattern_mi\"].forEach((rule) => {\n if (rules[rule] !== undefined) {\n let modifier = \"\";\n if (rule.length > 8) modifier = rule.substring(8);\n const expected = rules[rule];\n if (!validations.string[\"pattern\"](expected, actual, modifier)) {\n this.setInvalidValueError(\"pattern\", newpath, actual, expected);\n }\n }\n });\n }\n\n assertValue(rules, eleType, actual, newpath) {\n if (eleType === \"string\") this.checkString(rules, actual, newpath);\n else if (eleType === \"num\") this.checkNumeric(rules, actual, newpath);\n }\n\n validateBoolean(actual, eleType, newpath) {\n if (this.options.boolean.indexOf(actual) === -1) {\n this.setInvalidDataType(eleType, newpath, actual);\n }\n }\n\n isValidNum(eleType, val) {\n if (!isNaN(val)) {\n const num = Number(val);\n if (\n (eleType === \"positiveInteger\" && num < 0) \|\|\n (eleType === \"positiveDecimal\" && num < 0) \|\|\n (eleType === \"integer\" && !isInt(val))\n ) {\n return false;\n }\n } else {\n return false;\n }\n return true;\n }\n\n validateDate(val, eleType, newpath) {\n const date = Date.parse(val);\n if (isNaN(date)) this.setInvalidDataType(eleType, newpath, val);\n }\n\n setInvalidDataType(eleType, newpath, val) {\n this.failures.push({\n code: \"not a \" + eleType,\n path: newpath.substr(1),\n value: val,\n });\n }\n\n /\n @param {object} sets\n * @param {object} rules\n * @param {string} path\n /\n checkMissingSiblings(sets, rules, path) {\n if (sets.rules) {\n sets.rules.forEach((tagRule) => {\n const rulesNode = rules[tagRule][\"@rules\"];\n if (rulesNode && (rulesNode.nillable === \"false\" \|\| rulesNode.minOccurs > 0)) {\n this.failures.push({\n code: \"missing\",\n path: (path + \".\" + tagRule).substr(1),\n });\n }\n });\n }\n }\n\n /\n @param {object} sets\n * @param {string} path\n /\n checkUnknownSiblings(sets, path) {\n if (sets.data && !this.options.unknownAllow) {\n sets.data.forEach((tag) => {\n this.failures.push({\n code: \"unknown\",\n path: (path + \".\" + tag).substr(1),\n });\n });\n }\n }\n}\n\n// ─── Traverser subclass that adds repeatable-collection uniqueness ─────────────\n// We override the array-handling branch of traverse() to also run sibling uniqueness.\n\nconst _originalTraverse = Traverser.prototype.traverse;\n\nTraverser.prototype.traverse = function traverse(ele, key, rules, path) {\n if (\n Array.isArray(ele) &&\n rules !== undefined &&\n rules[\"@rules\"] !== undefined &&\n rules[\"@rules\"].repeatable !== undefined\n ) {\n // Run the original logic (occurrence checks + per-item traversal)\n this.checkOccurences(rules[\"@rules\"], ele.length, path);\n ele.forEach((val, index) => {\n const arrayPath = path + \"[\" + index + \"]\";\n if (Object.keys(rules).length > 1) {\n this.callForCommonProperties(ele[index], rules, arrayPath);\n } else {\n // Simple scalar repeatable\n const scalarRules = rules;\n _originalTraverse.call(this, ele[index], key, scalarRules, arrayPath);\n }\n });\n\n // After all items processed, check sibling-scoped uniqueness\n if (ele.length > 0 && typeof ele[0] === \"object\") {\n this._runSiblingUniqueness(ele, rules, path);\n }\n return;\n }\n\n // For everything else, delegate to the original implementation\n _originalTraverse.call(this, ele, key, rules, path);\n};\n\n/\n Scan child field rules of a repeatable element for `unique=\"true\"` and\n * validate all occurrences within the array scope.\n * @param {Array<object>} items\n * @param {object} rules - rules for the repeatable element\n * @param {string} path\n /\nTraverser.prototype._runSiblingUniqueness = function (items, rules, path) {\n const fieldKeys = Object.keys(rules).filter((k) => k !== \"@rules\");\n fieldKeys.forEach((fieldKey) => {\n const fieldRules = rules[fieldKey];\n if (!fieldRules \|\| !fieldRules[\"@rules\"]) return;\n if (fieldRules[\"@rules\"].unique !== \"true\") return;\n this._checkUniqueInCollection(items, fieldKey, path);\n });\n};\n\nfunction isInt(value) {\n const x = parseFloat(value);\n return (x \| 0) === x;\n}\n","/\n @param {string[]} data\n * @param {string[]} rules\n * @returns {{ data: string[], rules: string[], common: string[] }}\n /\nexport function breakInSets(data, rules) {\n const extra = {\n data: [],\n rules: [],\n common: [],\n };\n\n for (let i = 0; i < data.length; i++) {\n if (rules.indexOf(data[i]) === -1) extra.data.push(data[i]);\n else extra.common.push(data[i]);\n }\n\n for (let i = 0; i < rules.length; i++) {\n if (data.indexOf(rules[i]) === -1 && rules[i] !== \"@\") extra.rules.push(rules[i]);\n }\n return extra;\n}\n\n/\n Parse a range shorthand \"min..max\" string into { min, max } numbers.\n * Returns null if the string is not a valid range.\n * @param {string} range\n * @returns {{ min: number, max: number } \| null}\n /\nexport function parseRange(range) {\n if (typeof range !== \"string\") return null;\n const parts = range.split(\"..\");\n if (parts.length !== 2) return null;\n const min = Number(parts[0]);\n const max = Number(parts[1]);\n if (isNaN(min) \|\| isNaN(max)) return null;\n return { min, max };\n}\n\n/\n Parse a date range shorthand \"minDate..maxDate\" string into { min, max } date strings.\n * Returns null if either part is not a parseable date.\n * @param {string} range\n * @returns {{ min: string, max: string } \| null}\n /\nexport function parseDateRange(range) {\n if (typeof range !== \"string\") return null;\n const parts = range.split(\"..\");\n if (parts.length !== 2) return null;\n const [min, max] = parts;\n if (isNaN(Date.parse(min)) \|\| isNaN(Date.parse(max))) return null;\n return { min, max };\n}\n","import { XMLParser, XMLValidator } from \"fast-xml-parser\";\nimport { Traverser } from \"./Traverser.js\";\n\nconst defaultOptions = {\n unknownAllow: true,\n boolean: [\"true\", \"false\"],\n};\n\nexport class Validator {\n /\n @param {string} rules - XML string containing rule definitions\n * @param {object} [options]\n /\n constructor(rules, options) {\n validateXMLData(rules);\n const ruleParser = new XMLParser({\n ignoreAttributes: false,\n attributesGroupName: \"@rules\",\n attributeNamePrefix: \"\",\n allowBooleanAttributes: true,\n });\n this.rules = ruleParser.parse(rules);\n this.options = Object.assign({}, defaultOptions, options);\n this.validators = {};\n /* @type {object\|null} Parsed XML data after the last validate() call /\n this.data = null;\n }\n\n /\n Register a custom validator function.\n * @param {string} name\n * @param {(value: string, path: string) => object \| undefined} fn\n /\n register(name, fn) {\n this.validators[name] = fn;\n }\n\n /\n Validate XML data against the rules.\n * @param {string} xmldata\n * @returns {Array<object>} Array of failure objects (empty if valid)\n */\n validate(xmldata) {\n validateXMLData(xmldata);\n\n // Side-channel: record the insertion order of child tags per parent path.\n // Map<parentPath, string[]> — parentPath uses the same dot-notation as Traverser.\n // tagValueProcessor fires for every tag in document order, giving us reliable\n // positional information independent of JS object key ordering.\n const siblingOrder = new Map();\n const tagValueProcessor = (tagName, tagValue, jPath) => {\n // jPath is \"root.parent.child\" — parent path is everything before the last segment\n const lastDot = jPath.lastIndexOf(\".\");\n const parentPath = lastDot === -1 ? \"\" : jPath.substring(0, lastDot);\n if (!siblingOrder.has(parentPath)) siblingOrder.set(parentPath, []);\n const siblings = siblingOrder.get(parentPath);\n // Only push if not already recorded (FXP may fire multiple times for arrays)\n if (siblings[siblings.length - 1] !== tagName) siblings.push(tagName);\n return tagValue;\n };\n\n const parser = new XMLParser({\n ignoreAttributes: false,\n attributesGroupName: \":a\",\n attributeNamePrefix: \"\",\n parseTagValue: false,\n tagValueProcessor,\n });\n const xmlObj = parser.parse(xmldata);\n this.data = xmlObj;\n const traverser = new Traverser(this.options, this.validators, siblingOrder);\n traverser.traverse(xmlObj, \"\", this.rules, \"\");\n return traverser.failures;\n }\n}\n\nfunction validateXMLData(xmldata) {\n if (!xmldata) throw new Error(\"Empty data\");\n else if (typeof xmldata !== \"string\") throw new Error(\"Not a valid string\");\n const result = XMLValidator.validate(xmldata, {\n allowBooleanAttributes: true,\n });\n if (result !== true) {\n throw new Error(result.err.msg + \":\" + result.err.line);\n }\n}\n\nexport default Validator;\n","'use strict';\n\nimport { validate as validateSyntax } from './validator.js';\nimport BusinessRulesValidator from 'detailed-xml-validator';\n\nclass SyntaxValidator {\n static validate(xmlData, options) {\n return validateSyntax(xmlData, options);\n }\n}\n\nexport { SyntaxValidator, BusinessRulesValidator };"],"names":["root","factory","exports","module","define","amd","this","__webpack_require__","definition","key","o","Object","defineProperty","enumerable","get","obj","prop","prototype","hasOwnProperty","call","Symbol","toStringTag","value","nameStartChar10","nameStartChar11","nameChar11","buildRegexes","startChar","char","flags","ncNamePat","replace","name","RegExp","ncName","qName","nmToken","nmTokens","regexes10","regexes11","nameStartCharAscii","regexesAscii","getRegexes","xmlVersion","asciiOnly","str","test","PRODUCTIONS","createValidator","production","maxCacheSize","includes","TypeError","join","regex","cache","Map","validator","cached","undefined","result","size","set","reset","defaultOptions","maxEntityCount","Infinity","maxEntitySize","DocTypeValidator","options","assign","suppressValidationErr","_proto","validateDocType","xmlData","i","Error","angleBracketsCount","hasBody","comment","entityCount","length","hasSeq","_this$_validateEntity","_validateEntityExp","_validateElementExp","_validateAttlistExp","_validateNotationExp","nameStart","skipWhitespace","entityValue","entityName","substring","validateName","toUpperCase","_readQuotedValue","readQuotedValue","_this$options","indexOf","notationName","identifierType","elementName","isXmlName","elemNameStart","attrNameStart","notationStart","trim","typeStart","attributeType","data","index","seq","j","type","start","ValidationError","_Error","message","code","line","col","_this","constructor","captureStackTrace","_wrapNativeSuper","allowBooleanAttributes","unpairedTags","docType","isWhiteSpace","readPI","nameValidator","piStart","nameValidated","ch","piName","substr","toLowerCase","throwError","getLineNumberForPosition","readCommentAndCDATA","docTypeValidator","doubleQuote","singleQuote","readAttributeStr","attrStr","tagClosed","validAttrStrRegxp","validateAttributeString","qNameValidator","matches","string","match","exec","allmatches","startIndex","lastIndex","len","push","getAllMatches","attrNames","err","msg","getPositionFromMatch","attrName","startsWith","validateAmpersand","re","validateNumberAmpersand","count","lineNumber","lines","split","nameStartChar","regexName","isName","DANGEROUS_PROPERTY_NAMES","criticalProperties","defaultOnDangerousProperty","preserveOrder","attributeNamePrefix","attributesGroupName","textNodeName","ignoreAttributes","removeNSPrefix","parseTagValue","parseAttributeValue","trimValues","cdataPropName","numberParseOptions","hex","leadingZeros","eNotation","tagValueProcessor","tagName","val","attributeValueProcessor","stopNodes","alwaysCreateTextNode","isArray","commentPropName","processEntities","htmlEntities","entityDecoder","ignoreDeclaration","ignorePiTags","transformTagName","transformAttributeName","updateTag","jPath","attrs","captureMetaData","maxNestedTags","strictReservedNames","onDangerousProperty","validatePropertyName","propertyName","optionName","normalized","some","dangerous","normalizeProcessEntities","enabled","maxExpansionDepth","maxTotalExpansions","maxExpandedLength","allowedTags","tagFilter","appliesTo","Math","max","buildOptions","built","propertyNameOptions","unpairedTagsSet","Set","Array","map","node","METADATA_SYMBOL","XmlNode","tagname","child","create","add","addChild","keys","getMetaDataSymbol","DocTypeReader","readDocType","entities","exp","readEntityExp","readElementExp","readNotationExp","validateEntityName","readIdentifierVal","publicIdentifier","systemIdentifier","identifierVal","contentModel","readAttlistExp","attributeName","allowedNotations","notation","validTypes","defaultValue","hexRegex","numRegex","consider","decimalPoint","infinity","eNotationRegx","MatcherView","matcher","_matcher","separator","getCurrentTag","path","tag","getCurrentNamespace","namespace","getAttrValue","values","hasAttr","current","getPosition","position","getCounter","counter","getIndex","getDepth","toString","includeNamespace","toArray","n","expression","matchesAny","exprSet","Matcher","siblingStacks","_pathStringCache","_view","attrValues","currentLevel","siblings","siblingKey","pop","updateCurrent","sep","segments","hasDeepWildcard","_matchWithDeepWildcard","_matchSimple","_matchSegment","pathIdx","segIdx","segment","nextSeg","found","isCurrentNode","attrValue","String","positionValue","snapshot","restore","readOnly","Expression","pattern","_parse","_hasDeepWildcard","seg","_hasAttributeCondition","_hasPositionSelector","currentPart","_parseSegment","part","bracketContent","withoutBrackets","bracketMatch","content","slice","tagAndPosition","nsIndex","positionMatch","colonIndex","lastIndexOf","tagPart","posPart","eqIndex","nthMatch","parseInt","hasAttributeCondition","hasPositionSelector","ExpressionSet","_byDepthAndTag","_wildcardByDepth","_deepWildcards","_patterns","_sealed","has","depth","lastSeg","addAll","expressions","expr","seal","isSealed","findMatch","exactKey","exactBucket","wildcardBucket","CURRENCY","cent","pound","curren","yen","euro","dollar","fnof","inr","af","birr","peso","rub","won","yuan","cedil","XML","amp","apos","gt","lt","quot","COMMON_HTML","nbsp","copy","reg","trade","mdash","ndash","hellip","laquo","raquo","lsquo","rsquo","ldquo","rdquo","bull","para","sect","deg","frac12","frac14","frac34","SPECIAL_CHARS","mergeEntityMaps","maps","out","raw","LIMIT_TIER_EXTERNAL","LIMIT_TIER_BASE","LIMIT_TIER_ALL","NCR_LEVEL","freeze","allow","leave","remove","throw","XML10_ALLOWED_C0","EntityDecoder","_limit","limit","_maxTotalExpansions","_maxExpandedLength","_postCheck","postCheck","r","_limitTiers","applyLimitsTo","_numericAllowed","numericAllowed","_baseMap","DEFAULT_XML_ENTITIES","namedEntities","_externalMap","_inputMap","_totalExpansions","_expandedLength","_removeSet","_leaveSet","ncrCfg","ncr","onLevel","nullLevel","onNCR","nullNCR","parseNCRConfig","_ncrXmlVersion","_ncrOnLevel","_ncrNullLevel","setExternalEntities","addExternalEntity","addInputEntities","setXmlVersion","version","decode","original","chunks","last","limitExpansions","limitLength","checkLimits","charCodeAt","token","replacement","tier","ncrResult","_resolveNCR","resolved","_resolveName","_tierCounts","delta","_classifyNCR","cp","_applyNCRAction","action","fromCodePoint","padStart","second","Number","isNaN","minimum","effective","extractRawAttributes","prefixedAttrs","rawAttrs","extractNamespace","rawTagName","ns","OrderedObjParser","currentNode","tagsNodeStack","parseXml","parseTextData","resolveNameSpace","buildAttributesMap","isItStopNode","replaceEntitiesValue","readStopNodeData","saveTextToParentTag","ignoreAttributesFn","entityExpansionCount","currentExpandedLength","readonlyMatcher","isCurrentNodeStopNode","stopNodeExpressionsSet","stopNodesOpts","stopNodeExp","dontTrim","hasAttributes","isLeafNode","escapeEntities","jPathOrMatcher","newval","parseValue","tags","prefix","charAt","attrsRegx","force","processedVals","hasRawAttrs","rawAttrsForMatcher","oldVal","jPathStr","hasAttrs","aName","sanitizeName","newVal","attrCollection","xmlObj","xmlNode","textData","docTypeReader","xmlLen","c1","closeIndex","findClosingIndex","lastTagName","tagData","readTagExp","attsMap","tagExp","ver","childNode","attrExpPresent","endIndex","context","min","lastTag","isSelfClosing","tagContent","entityConfig","parentNode","errMsg","closingIndex","findClosingChar","closingChar","attrBoundary","chars","closeCode0","closeCode1","fromCharCode","tagExpWithClosingIndex","separatorIndex","search","trimStart","openTagCount","xmllen","shouldParse","trimmedStr","skipLike","numStr","window","parse_int","isFinite","sign","eChar","eAdjacentToLeadingZeros","resolveEnotation","numTrimmedByZeros","decimalAdjacentToLeadingZeros","num","parsedStr","isPositive","handleInfinity","toNumber","fn","newTagName","stripAttributePrefix","prettify","compress","arr","text","compressedObj","tagObj","property","propName","isLeaf","isLeafTag","assignAttributes","attrMap","atrrName","rawAttrName","propCount","validate","tagFound","reachedRoot","getErrorObject","tagStartPos","closingTag","validateTagName","attrStrStart","isValid","otg","openPos","afterAmp","JSON","stringify","t","validateAttrName","XMLParser","externalEntities","parse","validationOption","orderedObjParser","orderedResult","addEntity","XMLValidator","minLength","expected","actual","maxLength","modifier","fixed","in","list","minOccurs","maxOccurs","date","Date","numericTypes","Traverser","validators","siblingOrder","failures","_globalUnique","_siblingOrder","traverse","ele","rules","repeatable","checkOccurences","forEach","arrayPath","callForCommonProperties","checkDataAndType","isMapType","validateMandatoryFields","applyCustomValidators","checkBy","res","sets","extra","common","breakInSets","checkUnknownSiblings","checkMissingSiblings","siblingValues","_buildSiblingValues","newpath","_checkOrderingConstraints","_checkUniquenessConstraints","_checkRelationalConstraints","commonKeys","orderKey","order","fieldRules","keyIdx","after","refKey","refIdx","before","RELATIONAL_RULES","attr","actualRaw","fieldType","refRaw","cmp","_relationalCompare","violated","a","b","da","db","na","nb","unique","vals","v","idx","fieldPath","_assertGlobalUnique","_checkUniqueInCollection","items","fieldKey","basePath","seen","item","strVal","fieldName","eleType","expandedRules","_expandRange","validateDate","_checkDateBounds","validateBoolean","isValidNum","assertValue","setInvalidDataType","range","parsed","parts","parseRange","parseDateRange","validations","setInvalidValueError","rulesForChild","nillable","rule","checkNumeric","checkString","boolean","x","parseFloat","isInt","tagRule","rulesNode","unknownAllow","_originalTraverse","scalarRules","_runSiblingUniqueness","filter","k","validateXMLData","xmldata","ruleParser","register","tagValue","lastDot","parentPath","traverser","SyntaxValidator","declResult","piEnd","declBody","end","ALLOWED","attrRe","lastAllowedIdx","attrPos","allowedIdx","leftover","parseXmlDeclaration","validateSyntax"],"sourceRoot":""}