npm - @rio-cloud/cdk-v2-constructs - Versions diffs - 8.0.0 → 8.0.2 - Mend

@rio-cloud/cdk-v2-constructs 8.0.0 → 8.0.2

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 (1835) hide show

package/node_modules/fast-xml-parser/lib/fxbuilder.min.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"./lib/fxbuilder.min.js","mappings":"CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,iBAAZC,QACdA,QAAoB,WAAID,IAExBD,EAAiB,WAAIC,GACtB,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,mCCKxC,MAAMC,EAOnBC,WAAAA,CAAYC,EAASC,EAAU,CAAC,GAC9BpB,KAAKmB,QAAUA,EACfnB,KAAKqB,UAAYD,EAAQC,WAAa,IACtCrB,KAAKsB,SAAWtB,KAAKuB,OAAOJ,GAG5BnB,KAAKwB,iBAAmBxB,KAAKsB,SAASG,KAAKC,GAAoB,kBAAbA,EAAIC,MACtD3B,KAAK4B,uBAAyB5B,KAAKsB,SAASG,KAAKC,QAAwBG,IAAjBH,EAAII,UAC5D9B,KAAK+B,qBAAuB/B,KAAKsB,SAASG,KAAKC,QAAwBG,IAAjBH,EAAIM,SAC5D,CAQAT,MAAAA,CAAOJ,GACL,MAAMG,EAAW,GAGjB,IAAIW,EAAI,EACJC,EAAc,GAElB,KAAOD,EAAId,EAAQgB,QACbhB,EAAQc,KAAOjC,KAAKqB,UAElBY,EAAI,EAAId,EAAQgB,QAAUhB,EAAQc,EAAI,KAAOjC,KAAKqB,WAEhDa,EAAYE,SACdd,EAASe,KAAKrC,KAAKsC,cAAcJ,EAAYE,SAC7CF,EAAc,IAGhBZ,EAASe,KAAK,CAAEV,KAAM,kBACtBM,GAAK,IAGDC,EAAYE,QACdd,EAASe,KAAKrC,KAAKsC,cAAcJ,EAAYE,SAE/CF,EAAc,GACdD,MAGFC,GAAef,EAAQc,GACvBA,KASJ,OAJIC,EAAYE,QACdd,EAASe,KAAKrC,KAAKsC,cAAcJ,EAAYE,SAGxCd,CACT,CAQAgB,aAAAA,CAAcC,GACZ,MAAMC,EAAU,CAAEb,KAAM,OAwBxB,IAAIc,EAAiB,KACjBC,EAAkBH,EAEtB,MAAMI,EAAeJ,EAAKK,MAAM,8BAChC,GAAID,IACFD,EAAkBC,EAAa,GAAKA,EAAa,GAC7CA,EAAa,IAAI,CACnB,MAAME,EAAUF,EAAa,GAAGG,MAAM,GAAI,GACtCD,IACFJ,EAAiBI,EAErB,CAIF,IAAIE,EAcAC,EAbAC,EAAiBP,EAErB,GAAIA,EAAgBQ,SAAS,MAAO,CAClC,MAAMC,EAAUT,EAAgBU,QAAQ,MAIxC,GAHAL,EAAYL,EAAgBW,UAAU,EAAGF,GAASf,OAClDa,EAAiBP,EAAgBW,UAAUF,EAAU,GAAGf,QAEnDW,EACH,MAAM,IAAIO,MAAM,iCAAiCf,IAErD,CAIA,IAAIgB,EAAgB,KAEpB,GAAIN,EAAeC,SAAS,KAAM,CAChC,MAAMM,EAAaP,EAAeQ,YAAY,KACxCC,EAAUT,EAAeI,UAAU,EAAGG,GAAYpB,OAClDuB,EAAUV,EAAeI,UAAUG,EAAa,GAAGpB,OAG/B,CAAC,QAAS,OAAQ,MAAO,QAAQc,SAASS,IAClE,eAAeC,KAAKD,IAGpBX,EAAMU,EACNH,EAAgBI,GAGhBX,EAAMC,CAEV,MACED,EAAMC,EAGR,IAAKD,EACH,MAAM,IAAIM,MAAM,4BAA4Bf,KAS9C,GANAC,EAAQQ,IAAMA,EACVD,IACFP,EAAQO,UAAYA,GAIlBN,EACF,GAAIA,EAAeS,SAAS,KAAM,CAChC,MAAMW,EAAUpB,EAAeW,QAAQ,KACvCZ,EAAQV,SAAWW,EAAeY,UAAU,EAAGQ,GAASzB,OACxDI,EAAQsB,UAAYrB,EAAeY,UAAUQ,EAAU,GAAGzB,MAC5D,MACEI,EAAQV,SAAWW,EAAeL,OAKtC,GAAImB,EAAe,CACjB,MAAMQ,EAAWR,EAAcX,MAAM,kBACjCmB,GACFvB,EAAQR,SAAW,MACnBQ,EAAQwB,cAAgBC,SAASF,EAAS,GAAI,KAE9CvB,EAAQR,SAAWuB,CAEvB,CAEA,OAAOf,CACT,CAMA,UAAIL,GACF,OAAOnC,KAAKsB,SAASa,MACvB,CAMA+B,eAAAA,GACE,OAAOlE,KAAKwB,gBACd,CAMA2C,qBAAAA,GACE,OAAOnE,KAAK4B,sBACd,CAMAwC,mBAAAA,GACE,OAAOpE,KAAK+B,oBACd,CAMAsC,QAAAA,GACE,OAAOrE,KAAKmB,OACd,EChNF,MAAMmD,EAAmB,IAAIC,IAAI,CAAC,OAAQ,MAAO,QAAS,gBAAiB,YAE5D,MAAMC,EAMnBtD,WAAAA,CAAYE,EAAU,CAAC,GACrBpB,KAAKqB,UAAYD,EAAQC,WAAa,IACtCrB,KAAKyE,KAAO,GACZzE,KAAK0E,cAAgB,EAIvB,CAQArC,IAAAA,CAAKsC,EAASC,EAAa,KAAM7B,EAAY,MAEvC/C,KAAKyE,KAAKtC,OAAS,IACRnC,KAAKyE,KAAKzE,KAAKyE,KAAKtC,OAAS,GACrC0C,YAAShD,GAIhB,MAAMiD,EAAe9E,KAAKyE,KAAKtC,OAC1BnC,KAAK0E,cAAcI,KACtB9E,KAAK0E,cAAcI,GAAgB,IAAIC,KAGzC,MAAMC,EAAWhF,KAAK0E,cAAcI,GAG9BG,EAAalC,EAAY,GAAGA,KAAa4B,IAAYA,EAGrDO,EAAUF,EAASxE,IAAIyE,IAAe,EAG5C,IAAIjD,EAAW,EACf,IAAK,MAAMmD,KAASH,EAASH,SAC3B7C,GAAYmD,EAIdH,EAASI,IAAIH,EAAYC,EAAU,GAGnC,MAAMG,EAAO,CACXrC,IAAK2B,EACL3C,SAAUA,EACVkD,QAASA,GAIPnC,UACFsC,EAAKtC,UAAYA,GAIf6B,UACFS,EAAKR,OAASD,GAGhB5E,KAAKyE,KAAKpC,KAAKgD,EACjB,CAMAC,GAAAA,GACE,GAAyB,IAArBtF,KAAKyE,KAAKtC,OACZ,OAGF,MAAMkD,EAAOrF,KAAKyE,KAAKa,MASvB,OAJItF,KAAK0E,cAAcvC,OAASnC,KAAKyE,KAAKtC,OAAS,IACjDnC,KAAK0E,cAAcvC,OAASnC,KAAKyE,KAAKtC,OAAS,GAG1CkD,CACT,CAOAE,aAAAA,CAAcX,GACZ,GAAI5E,KAAKyE,KAAKtC,OAAS,EAAG,CACxB,MAAMqD,EAAUxF,KAAKyE,KAAKzE,KAAKyE,KAAKtC,OAAS,GACzCyC,UACFY,EAAQX,OAASD,EAErB,CACF,CAMAa,aAAAA,GACE,OAAOzF,KAAKyE,KAAKtC,OAAS,EAAInC,KAAKyE,KAAKzE,KAAKyE,KAAKtC,OAAS,GAAGa,SAAMnB,CACtE,CAMA6D,mBAAAA,GACE,OAAO1F,KAAKyE,KAAKtC,OAAS,EAAInC,KAAKyE,KAAKzE,KAAKyE,KAAKtC,OAAS,GAAGY,eAAYlB,CAC5E,CAOA8D,YAAAA,CAAa7D,GACX,GAAyB,IAArB9B,KAAKyE,KAAKtC,OAAc,OAC5B,MAAMqD,EAAUxF,KAAKyE,KAAKzE,KAAKyE,KAAKtC,OAAS,GAC7C,OAAOqD,EAAQX,SAAS/C,EAC1B,CAOA8D,OAAAA,CAAQ9D,GACN,GAAyB,IAArB9B,KAAKyE,KAAKtC,OAAc,OAAO,EACnC,MAAMqD,EAAUxF,KAAKyE,KAAKzE,KAAKyE,KAAKtC,OAAS,GAC7C,YAA0BN,IAAnB2D,EAAQX,QAAwB/C,KAAY0D,EAAQX,MAC7D,CAMAgB,WAAAA,GACE,OAAyB,IAArB7F,KAAKyE,KAAKtC,QAAsB,EAC7BnC,KAAKyE,KAAKzE,KAAKyE,KAAKtC,OAAS,GAAGH,UAAY,CACrD,CAMA8D,UAAAA,GACE,OAAyB,IAArB9F,KAAKyE,KAAKtC,QAAsB,EAC7BnC,KAAKyE,KAAKzE,KAAKyE,KAAKtC,OAAS,GAAG+C,SAAW,CACpD,CAOAa,QAAAA,GACE,OAAO/F,KAAK6F,aACd,CAMAG,QAAAA,GACE,OAAOhG,KAAKyE,KAAKtC,MACnB,CAQAkC,QAAAA,CAAShD,EAAW4E,GAAmB,GACrC,MAAMC,EAAM7E,GAAarB,KAAKqB,UAC9B,OAAOrB,KAAKyE,KAAK0B,IAAIC,GACfH,GAAoBG,EAAErD,UACjB,GAAGqD,EAAErD,aAAaqD,EAAEpD,MAEtBoD,EAAEpD,KACRqD,KAAKH,EACV,CAMAI,OAAAA,GACE,OAAOtG,KAAKyE,KAAK0B,IAAIC,GAAKA,EAAEpD,IAC9B,CAKAuD,KAAAA,GACEvG,KAAKyE,KAAO,GACZzE,KAAK0E,cAAgB,EACvB,CAOA8B,OAAAA,CAAQC,GACN,MAAMnF,EAAWmF,EAAWnF,SAE5B,OAAwB,IAApBA,EAASa,SAKTsE,EAAWvC,kBACNlE,KAAK0G,uBAAuBpF,GAI9BtB,KAAK2G,aAAarF,GAC3B,CAMAqF,YAAAA,CAAarF,GAEX,GAAItB,KAAKyE,KAAKtC,SAAWb,EAASa,OAChC,OAAO,EAIT,IAAK,IAAIF,EAAI,EAAGA,EAAIX,EAASa,OAAQF,IAAK,CACxC,MAAMO,EAAUlB,EAASW,GACnBoD,EAAOrF,KAAKyE,KAAKxC,GACjB2E,EAAiB3E,IAAMjC,KAAKyE,KAAKtC,OAAS,EAEhD,IAAKnC,KAAK6G,cAAcrE,EAAS6C,EAAMuB,GACrC,OAAO,CAEX,CAEA,OAAO,CACT,CAMAF,sBAAAA,CAAuBpF,GACrB,IAAIwF,EAAU9G,KAAKyE,KAAKtC,OAAS,EAC7B4E,EAASzF,EAASa,OAAS,EAE/B,KAAO4E,GAAU,GAAKD,GAAW,GAAG,CAClC,MAAMtE,EAAUlB,EAASyF,GAEzB,GAAqB,kBAAjBvE,EAAQb,KAA0B,CAIpC,GAFAoF,IAEIA,EAAS,EAEX,OAAO,EAIT,MAAMC,EAAU1F,EAASyF,GACzB,IAAIE,GAAQ,EAEZ,IAAK,IAAIhF,EAAI6E,EAAS7E,GAAK,EAAGA,IAAK,CACjC,MAAM2E,EAAiB3E,IAAMjC,KAAKyE,KAAKtC,OAAS,EAChD,GAAInC,KAAK6G,cAAcG,EAAShH,KAAKyE,KAAKxC,GAAI2E,GAAgB,CAC5DE,EAAU7E,EAAI,EACd8E,IACAE,GAAQ,EACR,KACF,CACF,CAEA,IAAKA,EACH,OAAO,CAEX,KAAO,CAEL,MAAML,EAAiBE,IAAY9G,KAAKyE,KAAKtC,OAAS,EACtD,IAAKnC,KAAK6G,cAAcrE,EAASxC,KAAKyE,KAAKqC,GAAUF,GACnD,OAAO,EAETE,IACAC,GACF,CACF,CAGA,OAAOA,EAAS,CAClB,CAUAF,aAAAA,CAAcrE,EAAS6C,EAAMuB,GAE3B,GAAoB,MAAhBpE,EAAQQ,KAAeR,EAAQQ,MAAQqC,EAAKrC,IAC9C,OAAO,EAIT,QAA0BnB,IAAtBW,EAAQO,WAEgB,MAAtBP,EAAQO,WAAqBP,EAAQO,YAAcsC,EAAKtC,UAC1D,OAAO,EAOX,QAAyBlB,IAArBW,EAAQV,SAAwB,CAClC,IAAK8E,EAEH,OAAO,EAGT,IAAKvB,EAAKR,UAAYrC,EAAQV,YAAYuD,EAAKR,QAC7C,OAAO,EAIT,QAA0BhD,IAAtBW,EAAQsB,UAAyB,CACnC,MAAMoD,EAAc7B,EAAKR,OAAOrC,EAAQV,UAExC,GAAIqF,OAAOD,KAAiBC,OAAO3E,EAAQsB,WACzC,OAAO,CAEX,CACF,CAGA,QAAyBjC,IAArBW,EAAQR,SAAwB,CAClC,IAAK4E,EAEH,OAAO,EAGT,MAAM1B,EAAUG,EAAKH,SAAW,EAEhC,GAAyB,UAArB1C,EAAQR,UAAoC,IAAZkD,EAClC,OAAO,EACF,GAAyB,QAArB1C,EAAQR,UAAsBkD,EAAU,GAAM,EACvD,OAAO,EACF,GAAyB,SAArB1C,EAAQR,UAAuBkD,EAAU,GAAM,EACxD,OAAO,EACF,GAAyB,QAArB1C,EAAQR,UACbkD,IAAY1C,EAAQwB,cACtB,OAAO,CAGb,CAEA,OAAO,CACT,CAMAoD,QAAAA,GACE,MAAO,CACL3C,KAAMzE,KAAKyE,KAAK0B,IAAId,IAAQ,IAAMA,KAClCX,cAAe1E,KAAK0E,cAAcyB,IAAIA,GAAO,IAAIpB,IAAIoB,IAEzD,CAMAkB,OAAAA,CAAQD,GACNpH,KAAKyE,KAAO2C,EAAS3C,KAAK0B,IAAId,IAAQ,IAAMA,KAC5CrF,KAAK0E,cAAgB0C,EAAS1C,cAAcyB,IAAIA,GAAO,IAAIpB,IAAIoB,GACjE,CAuBAmB,QAAAA,GAGE,OAAO,IAAIC,MAFEvH,KAEU,CACrBQ,GAAAA,CAAIgH,EAAQ9G,EAAM+G,GAEhB,GAAInD,EAAiBoD,IAAIhH,GACvB,MAAO,KACL,MAAM,IAAIiH,UACR,gBAAgBjH,2EAMtB,MAAMM,EAAQ4G,QAAQpH,IAAIgH,EAAQ9G,EAAM+G,GAIxC,MAAa,SAAT/G,GAA4B,kBAATA,EACdL,OAAOwH,OACZC,MAAMC,QAAQ/G,GACVA,EAAMmF,IAAI6B,GACVA,aAAgBjD,IACZ1E,OAAOwH,OAAO,IAAI9C,IAAIiD,IACtB3H,OAAOwH,OAAO,IAAKG,KAEvBhH,GAKa,mBAAVA,EACFA,EAAMiH,KAAKT,GAGbxG,CACT,EAGAoE,GAAAA,CAAI8C,EAASxH,GACX,MAAM,IAAIiH,UACR,wBAAwBR,OAAOzG,8BAEnC,EAGAyH,cAAAA,CAAeD,EAASxH,GACtB,MAAM,IAAIiH,UACR,2BAA2BR,OAAOzG,gCAEtC,GAEJ,ECtea,SAAS0H,EAAMC,EAAQjH,GAClC,IAAIkH,EAAc,GACdlH,EAAQmH,QAAUnH,EAAQoH,SAASrG,OAAS,IAC5CmG,EAXI,MAeR,MAAMG,EAAsB,GAC5B,GAAIrH,EAAQsH,WAAaZ,MAAMC,QAAQ3G,EAAQsH,WAC3C,IAAK,IAAIzG,EAAI,EAAGA,EAAIb,EAAQsH,UAAUvG,OAAQF,IAAK,CAC/C,MAAMoD,EAAOjE,EAAQsH,UAAUzG,GACX,iBAAToD,EACPoD,EAAoBpG,KAAK,IAAIpB,EAAWoE,IACjCA,aAAgBpE,GACvBwH,EAAoBpG,KAAKgD,EAEjC,CAMJ,OAAOsD,EAASN,EAAQjH,EAASkH,EAFjB,IAAI9D,EAEmCiE,EAC3D,CAEA,SAASE,EAASC,EAAKxH,EAASkH,EAAaO,EAASJ,GAClD,IAAIK,EAAS,GACTC,GAAuB,EAE3B,GAAI3H,EAAQ4H,eAAiBH,EAAQ7C,WAAa5E,EAAQ4H,cACtD,MAAM,IAAI1F,MAAM,gCAGpB,IAAKwE,MAAMC,QAAQa,GAAM,CAErB,GAAIA,QAAmC,CACnC,IAAIK,EAAOL,EAAIvE,WAEf,OADA4E,EAAOC,EAAqBD,EAAM7H,GAC3B6H,CACX,CACA,MAAO,EACX,CAEA,IAAK,IAAIhH,EAAI,EAAGA,EAAI2G,EAAIzG,OAAQF,IAAK,CACjC,MAAMkH,EAASP,EAAI3G,GACb0C,EAAUyE,EAASD,GACzB,QAAgBtH,IAAZ8C,EAAuB,SAG3B,MAAMC,EAAayE,EAAuBF,EAAO,MAAO/H,GAGxDyH,EAAQxG,KAAKsC,EAASC,GAGtB,MAAM0E,EAAaC,EAAcV,EAASJ,GAE1C,GAAI9D,IAAYvD,EAAQoI,aAAc,CAClC,IAAIC,EAAUN,EAAOxE,GAChB2E,IACDG,EAAUrI,EAAQsI,kBAAkB/E,EAAS8E,GAC7CA,EAAUP,EAAqBO,EAASrI,IAExC2H,IACAD,GAAUR,GAEdQ,GAAUW,EACVV,GAAuB,EACvBF,EAAQvD,MACR,QACJ,CAAO,GAAIX,IAAYvD,EAAQuI,cAAe,CACtCZ,IACAD,GAAUR,GAEdQ,GAAU,YAAYK,EAAOxE,GAAS,GAAGvD,EAAQoI,mBACjDT,GAAuB,EACvBF,EAAQvD,MACR,QACJ,CAAO,GAAIX,IAAYvD,EAAQwI,gBAAiB,CAC5Cd,GAAUR,EAAc,UAAOa,EAAOxE,GAAS,GAAGvD,EAAQoI,sBAC1DT,GAAuB,EACvBF,EAAQvD,MACR,QACJ,CAAO,GAAmB,MAAfX,EAAQ,GAAY,CAC3B,MAAMkF,EAASC,EAAYX,EAAO,MAAO/H,EAASkI,GAC5CS,EAAsB,SAAZpF,EAAqB,GAAK2D,EAC1C,IAAI0B,EAAiBb,EAAOxE,GAAS,GAAGvD,EAAQoI,cAChDQ,EAA2C,IAA1BA,EAAe7H,OAAe,IAAM6H,EAAiB,GACtElB,GAAUiB,EAAU,IAAIpF,IAAUqF,IAAiBH,MACnDd,GAAuB,EACvBF,EAAQvD,MACR,QACJ,CAEA,IAAI2E,EAAgB3B,EACE,KAAlB2B,IACAA,GAAiB7I,EAAQoH,UAI7B,MACM0B,EAAW5B,EAAc,IAAI3D,IADpBmF,EAAYX,EAAO,MAAO/H,EAASkI,KAIlD,IAAIa,EAEAA,EADAb,EACWc,EAAcjB,EAAOxE,GAAUvD,GAG/BuH,EAASQ,EAAOxE,GAAUvD,EAAS6I,EAAepB,EAASJ,IAG3B,IAA3CrH,EAAQiJ,aAAajH,QAAQuB,GACzBvD,EAAQkJ,qBAAsBxB,GAAUoB,EAAW,IAClDpB,GAAUoB,EAAW,KACjBC,GAAgC,IAApBA,EAAShI,SAAiBf,EAAQmJ,kBAEhDJ,GAAYA,EAASK,SAAS,KACrC1B,GAAUoB,EAAW,IAAIC,IAAW7B,MAAgB3D,MAEpDmE,GAAUoB,EAAW,IACjBC,GAA4B,KAAhB7B,IAAuB6B,EAASjH,SAAS,OAASiH,EAASjH,SAAS,OAChF4F,GAAUR,EAAclH,EAAQoH,SAAW2B,EAAW7B,EAEtDQ,GAAUqB,EAEdrB,GAAU,KAAKnE,MAVfmE,GAAUoB,EAAW,KAYzBnB,GAAuB,EAGvBF,EAAQvD,KACZ,CAEA,OAAOwD,CACX,CAMA,SAASO,EAAuBoB,EAASrJ,GACrC,IAAKqJ,GAAWrJ,EAAQsJ,iBAAkB,OAAO,KAEjD,MAAM9F,EAAa,CAAC,EACpB,IAAI+F,GAAW,EAEf,IAAK,IAAIC,KAAQH,EACRpK,OAAOM,UAAUC,eAAeC,KAAK4J,EAASG,KAKnDhG,EAHsBgG,EAAKC,WAAWzJ,EAAQ0J,qBACxCF,EAAKG,OAAO3J,EAAQ0J,oBAAoB3I,QACxCyI,GACsBH,EAAQG,GACpCD,GAAW,GAGf,OAAOA,EAAW/F,EAAa,IACnC,CAMA,SAASwF,EAAcxB,EAAKxH,GACxB,IAAK0G,MAAMC,QAAQa,GAEf,OAAIA,QACOA,EAAIvE,WAER,GAGX,IAAIxB,EAAU,GACd,IAAK,IAAIZ,EAAI,EAAGA,EAAI2G,EAAIzG,OAAQF,IAAK,CACjC,MAAM+F,EAAOY,EAAI3G,GACX0C,EAAUyE,EAASpB,GAEzB,GAAIrD,IAAYvD,EAAQoI,aAEpB3G,GAAWmF,EAAKrD,QACb,GAAIA,IAAYvD,EAAQuI,cAE3B9G,GAAWmF,EAAKrD,GAAS,GAAGvD,EAAQoI,mBACjC,GAAI7E,IAAYvD,EAAQwI,gBAE3B/G,GAAWmF,EAAKrD,GAAS,GAAGvD,EAAQoI,kBACjC,IAAI7E,GAA0B,MAAfA,EAAQ,GAE1B,SACG,GAAIA,EAAS,CAIhB,MAAMkF,EAASmB,EAAgBhD,EAAK,MAAO5G,GACrC6J,EAAgBb,EAAcpC,EAAKrD,GAAUvD,GAE9C6J,GAA0C,IAAzBA,EAAc9I,OAGhCU,GAAW,IAAI8B,IAAUkF,KAAUoB,MAAkBtG,KAFrD9B,GAAW,IAAI8B,IAAUkF,KAIjC,EACJ,CACA,OAAOhH,CACX,CAKA,SAASmI,EAAgBP,EAASrJ,GAC9B,IAAI8J,EAAU,GACd,GAAIT,IAAYrJ,EAAQsJ,iBACpB,IAAK,IAAIE,KAAQH,EAAS,CACtB,IAAKpK,OAAOM,UAAUC,eAAeC,KAAK4J,EAASG,GAAO,SAE1D,IAAIO,EAAUV,EAAQG,IACN,IAAZO,GAAoB/J,EAAQgK,0BAC5BF,GAAW,IAAIN,EAAKG,OAAO3J,EAAQ0J,oBAAoB3I,UAEvD+I,GAAW,IAAIN,EAAKG,OAAO3J,EAAQ0J,oBAAoB3I,YAAYgJ,IAE3E,CAEJ,OAAOD,CACX,CAEA,SAAS9B,EAAS3I,GACd,MAAM4K,EAAOhL,OAAOgL,KAAK5K,GACzB,IAAK,IAAIwB,EAAI,EAAGA,EAAIoJ,EAAKlJ,OAAQF,IAAK,CAClC,MAAM9B,EAAMkL,EAAKpJ,GACjB,GAAK5B,OAAOM,UAAUC,eAAeC,KAAKJ,EAAKN,IACnC,OAARA,EAAc,OAAOA,CAC7B,CACJ,CAEA,SAAS2J,EAAYW,EAASrJ,EAASkI,GACnC,IAAI4B,EAAU,GACd,GAAIT,IAAYrJ,EAAQsJ,iBACpB,IAAK,IAAIE,KAAQH,EAAS,CACtB,IAAKpK,OAAOM,UAAUC,eAAeC,KAAK4J,EAASG,GAAO,SAC1D,IAAIO,EAEA7B,EAEA6B,EAAUV,EAAQG,IAGlBO,EAAU/J,EAAQkK,wBAAwBV,EAAMH,EAAQG,IACxDO,EAAUjC,EAAqBiC,EAAS/J,KAG5B,IAAZ+J,GAAoB/J,EAAQgK,0BAC5BF,GAAW,IAAIN,EAAKG,OAAO3J,EAAQ0J,oBAAoB3I,UAEvD+I,GAAW,IAAIN,EAAKG,OAAO3J,EAAQ0J,oBAAoB3I,YAAYgJ,IAE3E,CAEJ,OAAOD,CACX,CAEA,SAAS3B,EAAcV,EAASJ,GAC5B,IAAKA,GAAsD,IAA/BA,EAAoBtG,OAAc,OAAO,EAErE,IAAK,IAAIF,EAAI,EAAGA,EAAIwG,EAAoBtG,OAAQF,IAC5C,GAAI4G,EAAQrC,QAAQiC,EAAoBxG,IACpC,OAAO,EAGf,OAAO,CACX,CAEA,SAASiH,EAAqBqC,EAAWnK,GACrC,GAAImK,GAAaA,EAAUpJ,OAAS,GAAKf,EAAQoK,gBAC7C,IAAK,IAAIvJ,EAAI,EAAGA,EAAIb,EAAQqK,SAAStJ,OAAQF,IAAK,CAC9C,MAAMyJ,EAAStK,EAAQqK,SAASxJ,GAChCsJ,EAAYA,EAAUI,QAAQD,EAAOE,MAAOF,EAAOG,IACvD,CAEJ,OAAON,CACX,CC7RA,MAAMO,EAAiB,CACrBhB,oBAAqB,KACrBiB,qBAAqB,EACrBvC,aAAc,QACdkB,kBAAkB,EAClBf,eAAe,EACfpB,QAAQ,EACRC,SAAU,KACV+B,mBAAmB,EACnBD,sBAAsB,EACtBc,2BAA2B,EAC3B1B,kBAAmB,SAAUvJ,EAAK6L,GAChC,OAAOA,CACT,EACAV,wBAAyB,SAAUxJ,EAAUkK,GAC3C,OAAOA,CACT,EACAC,eAAe,EACfrC,iBAAiB,EACjBS,aAAc,GACdoB,SAAU,CACR,CAAEG,MAAO,IAAIM,OAAO,IAAK,KAAML,IAAK,SACpC,CAAED,MAAO,IAAIM,OAAO,IAAK,KAAML,IAAK,QACpC,CAAED,MAAO,IAAIM,OAAO,IAAK,KAAML,IAAK,QACpC,CAAED,MAAO,IAAIM,OAAO,IAAM,KAAML,IAAK,UACrC,CAAED,MAAO,IAAIM,OAAO,IAAM,KAAML,IAAK,WAEvCL,iBAAiB,EACjB9C,UAAW,GAGXyD,cAAc,EACdnD,cAAe,IACfoD,OAAO,GAGM,SAASC,EAAQjL,GAkB9B,GAjBApB,KAAKoB,QAAUf,OAAOiM,OAAO,CAAC,EAAGR,EAAgB1K,GAK7CpB,KAAKoB,QAAQsH,WAAaZ,MAAMC,QAAQ/H,KAAKoB,QAAQsH,aACvD1I,KAAKoB,QAAQsH,UAAY1I,KAAKoB,QAAQsH,UAAUvC,IAAId,GAC9B,iBAATA,GAAqBA,EAAKwF,WAAW,MAEvC,KAAOxF,EAAKhC,UAAU,GAExBgC,IAKXrF,KAAKyI,oBAAsB,GACvBzI,KAAKoB,QAAQsH,WAAaZ,MAAMC,QAAQ/H,KAAKoB,QAAQsH,WACvD,IAAK,IAAIzG,EAAI,EAAGA,EAAIjC,KAAKoB,QAAQsH,UAAUvG,OAAQF,IAAK,CACtD,MAAMoD,EAAOrF,KAAKoB,QAAQsH,UAAUzG,GAChB,iBAAToD,EACTrF,KAAKyI,oBAAoBpG,KAAK,IAAIpB,EAAWoE,IACpCA,aAAgBpE,GACzBjB,KAAKyI,oBAAoBpG,KAAKgD,EAElC,CCpEW,IAA+BqF,GDuEN,IAAlC1K,KAAKoB,QAAQsJ,kBAA6B1K,KAAKoB,QAAQ2K,oBACzD/L,KAAKuM,YAAc,WACjB,OAAO,CACT,GAEAvM,KAAKwM,mBC3E2B,mBADU9B,ED4EM1K,KAAKoB,QAAQsJ,kBC1ElDA,EAEP5C,MAAMC,QAAQ2C,GACN5I,IACJ,IAAK,MAAMX,KAAWuJ,EAAkB,CACpC,GAAuB,iBAAZvJ,GAAwBW,IAAaX,EAC5C,OAAO,EAEX,GAAIA,aAAmB+K,QAAU/K,EAAQyC,KAAK9B,GAC1C,OAAO,CAEf,GAGD,KAAM,ED6Db9B,KAAKyM,cAAgBzM,KAAKoB,QAAQ0J,oBAAoB3I,OACtDnC,KAAKuM,YAAcA,GAGrBvM,KAAK0M,qBAAuBA,EAExB1M,KAAKoB,QAAQmH,QACfvI,KAAK2M,UAAYA,EACjB3M,KAAK4M,WAAa,MAClB5M,KAAK6M,QAAU,OAEf7M,KAAK2M,UAAY,WACf,MAAO,EACT,EACA3M,KAAK4M,WAAa,IAClB5M,KAAK6M,QAAU,GAEnB,CAkKA,SAASH,EAAqBI,EAAQ3M,EAAK4M,EAAOlE,GAEhD,MAAMjE,EAAa5E,KAAKgN,kBAAkBF,GAQ1C,GALAjE,EAAQxG,KAAKlC,EAAKyE,GAGC5E,KAAKuJ,cAAcV,GAEtB,CAEd,MAAMoE,EAAajN,KAAKkN,gBAAgBJ,GAClC5B,EAAUlL,KAAKmN,2BAA2BL,GAEhD,OADAjE,EAAQvD,MACDtF,KAAKoN,gBAAgBH,EAAY9M,EAAK+K,EAAS6B,EACxD,CAEA,MAAMM,EAASrN,KAAKsN,IAAIR,EAAQC,EAAQ,EAAGlE,GAI3C,OAFAA,EAAQvD,WAEkCzD,IAAtCiL,EAAO9M,KAAKoB,QAAQoI,eAA8D,IAA/BnJ,OAAOgL,KAAKyB,GAAQ3K,OAClEnC,KAAKuN,iBAAiBT,EAAO9M,KAAKoB,QAAQoI,cAAerJ,EAAKkN,EAAOnC,QAAS6B,EAAOlE,GAErF7I,KAAKoN,gBAAgBC,EAAOxB,IAAK1L,EAAKkN,EAAOnC,QAAS6B,EAEjE,CA2OA,SAASJ,EAAUI,GACjB,OAAO/M,KAAKoB,QAAQoH,SAASgF,OAAOT,EACtC,CAEA,SAASR,EAAYkB,GACnB,SAAIA,EAAK5C,WAAW7K,KAAKoB,QAAQ0J,sBAAwB2C,IAASzN,KAAKoB,QAAQoI,eACtEiE,EAAK1C,OAAO/K,KAAKyM,cAI5B,CAhbAJ,EAAQ1L,UAAU+M,MAAQ,SAAUC,GAClC,GAAI3N,KAAKoB,QAAQ6K,cACf,OAAO2B,EAAmBD,EAAM3N,KAAKoB,SAChC,CACD0G,MAAMC,QAAQ4F,IAAS3N,KAAKoB,QAAQyM,eAAiB7N,KAAKoB,QAAQyM,cAAc1L,OAAS,IAC3FwL,EAAO,CACL,CAAC3N,KAAKoB,QAAQyM,eAAgBF,IAIlC,MAAM9E,EAAU,IAAIrE,EACpB,OAAOxE,KAAKsN,IAAIK,EAAM,EAAG9E,GAASgD,GACpC,CACF,EAEAQ,EAAQ1L,UAAU2M,IAAM,SAAUK,EAAMZ,EAAOlE,GAC7C,IAAIqC,EAAU,GACVW,EAAM,GACV,GAAI7L,KAAKoB,QAAQ4H,eAAiBH,EAAQ7C,YAAchG,KAAKoB,QAAQ4H,cACnE,MAAM,IAAI1F,MAAM,gCAGlB,MAAM8I,EAAQpM,KAAKoB,QAAQgL,MAAQvD,EAAQxE,WAAawE,EAGlDiF,EAAoB9N,KAAKuJ,cAAcV,GAE7C,IAAK,IAAI1I,KAAOwN,EACd,GAAKtN,OAAOM,UAAUC,eAAeC,KAAK8M,EAAMxN,GAChD,QAAyB,IAAdwN,EAAKxN,GAEVH,KAAKuM,YAAYpM,KACnB0L,GAAO,SAEJ,GAAkB,OAAd8B,EAAKxN,GAEVH,KAAKuM,YAAYpM,IAEVA,IAAQH,KAAKoB,QAAQuI,cAD9BkC,GAAO,GAGa,MAAX1L,EAAI,GACb0L,GAAO7L,KAAK2M,UAAUI,GAAS,IAAM5M,EAAM,IAAMH,KAAK4M,WAEtDf,GAAO7L,KAAK2M,UAAUI,GAAS,IAAM5M,EAAM,IAAMH,KAAK4M,gBAGnD,GAAIe,EAAKxN,aAAgB4N,KAC9BlC,GAAO7L,KAAKuN,iBAAiBI,EAAKxN,GAAMA,EAAK,GAAI4M,EAAOlE,QACnD,GAAyB,iBAAd8E,EAAKxN,GAAmB,CAExC,MAAMyK,EAAO5K,KAAKuM,YAAYpM,GAC9B,GAAIyK,IAAS5K,KAAKwM,mBAAmB5B,EAAMwB,GACzClB,GAAWlL,KAAKgO,iBAAiBpD,EAAM,GAAK+C,EAAKxN,GAAM2N,QAClD,IAAKlD,EAEV,GAAIzK,IAAQH,KAAKoB,QAAQoI,aAAc,CACrC,IAAIyE,EAASjO,KAAKoB,QAAQsI,kBAAkBvJ,EAAK,GAAKwN,EAAKxN,IAC3D0L,GAAO7L,KAAKkJ,qBAAqB+E,EACnC,KAAO,CAELpF,EAAQxG,KAAKlC,GACb,MAAMmJ,EAAatJ,KAAKuJ,cAAcV,GAGtC,GAFAA,EAAQvD,MAEJgE,EAAY,CAEd,MAAMiC,EAAY,GAAKoC,EAAKxN,GAE1B0L,GADgB,KAAdN,EACKvL,KAAK2M,UAAUI,GAAS,IAAM5M,EAAMH,KAAKkO,SAAS/N,GAAOH,KAAK4M,WAE9D5M,KAAK2M,UAAUI,GAAS,IAAM5M,EAAM,IAAMoL,EAAY,KAAOpL,EAAMH,KAAK4M,UAEnF,MACEf,GAAO7L,KAAKuN,iBAAiBI,EAAKxN,GAAMA,EAAK,GAAI4M,EAAOlE,EAE5D,CAEJ,MAAO,GAAIf,MAAMC,QAAQ4F,EAAKxN,IAAO,CAEnC,MAAMgO,EAASR,EAAKxN,GAAKgC,OACzB,IAAIiM,EAAa,GACbC,EAAc,GAClB,IAAK,IAAIC,EAAI,EAAGA,EAAIH,EAAQG,IAAK,CAC/B,MAAMtG,EAAO2F,EAAKxN,GAAKmO,GACvB,QAAoB,IAATtG,QAEJ,GAAa,OAATA,EACM,MAAX7H,EAAI,GAAY0L,GAAO7L,KAAK2M,UAAUI,GAAS,IAAM5M,EAAM,IAAMH,KAAK4M,WACrEf,GAAO7L,KAAK2M,UAAUI,GAAS,IAAM5M,EAAM,IAAMH,KAAK4M,gBAEtD,GAAoB,iBAAT5E,EAChB,GAAIhI,KAAKoB,QAAQ+K,aAAc,CAE7BtD,EAAQxG,KAAKlC,GACb,MAAMkN,EAASrN,KAAKsN,IAAItF,EAAM+E,EAAQ,EAAGlE,GAEzCA,EAAQvD,MAER8I,GAAcf,EAAOxB,IACjB7L,KAAKoB,QAAQ2K,qBAAuB/D,EAAKpH,eAAeZ,KAAKoB,QAAQ2K,uBACvEsC,GAAehB,EAAOnC,QAE1B,MACEkD,GAAcpO,KAAK0M,qBAAqB1E,EAAM7H,EAAK4M,EAAOlE,QAG5D,GAAI7I,KAAKoB,QAAQ+K,aAAc,CAC7B,IAAIZ,EAAYvL,KAAKoB,QAAQsI,kBAAkBvJ,EAAK6H,GACpDuD,EAAYvL,KAAKkJ,qBAAqBqC,GACtC6C,GAAc7C,CAChB,KAAO,CAEL1C,EAAQxG,KAAKlC,GACb,MAAMmJ,EAAatJ,KAAKuJ,cAAcV,GAGtC,GAFAA,EAAQvD,MAEJgE,EAAY,CAEd,MAAMiC,EAAY,GAAKvD,EAErBoG,GADgB,KAAd7C,EACYvL,KAAK2M,UAAUI,GAAS,IAAM5M,EAAMH,KAAKkO,SAAS/N,GAAOH,KAAK4M,WAE9D5M,KAAK2M,UAAUI,GAAS,IAAM5M,EAAM,IAAMoL,EAAY,KAAOpL,EAAMH,KAAK4M,UAE1F,MACEwB,GAAcpO,KAAKuN,iBAAiBvF,EAAM7H,EAAK,GAAI4M,EAAOlE,EAE9D,CAEJ,CACI7I,KAAKoB,QAAQ+K,eACfiC,EAAapO,KAAKoN,gBAAgBgB,EAAYjO,EAAKkO,EAAatB,IAElElB,GAAOuC,CACT,MAEE,GAAIpO,KAAKoB,QAAQ2K,qBAAuB5L,IAAQH,KAAKoB,QAAQ2K,oBAAqB,CAChF,MAAMwC,EAAKlO,OAAOgL,KAAKsC,EAAKxN,IACtBqO,EAAID,EAAGpM,OACb,IAAK,IAAImM,EAAI,EAAGA,EAAIE,EAAGF,IACrBpD,GAAWlL,KAAKgO,iBAAiBO,EAAGD,GAAI,GAAKX,EAAKxN,GAAKoO,EAAGD,IAAKR,EAEnE,MACEjC,GAAO7L,KAAK0M,qBAAqBiB,EAAKxN,GAAMA,EAAK4M,EAAOlE,GAI9D,MAAO,CAAEqC,QAASA,EAASW,IAAKA,EAClC,EAEAQ,EAAQ1L,UAAUqN,iBAAmB,SAAUlM,EAAU+J,EAAKvC,GAK5D,OAJKA,IACHuC,EAAM7L,KAAKoB,QAAQkK,wBAAwBxJ,EAAU,GAAK+J,GAC1DA,EAAM7L,KAAKkJ,qBAAqB2C,IAE9B7L,KAAKoB,QAAQgK,2BAAqC,SAARS,EACrC,IAAM/J,EACD,IAAMA,EAAW,KAAO+J,EAAM,GAC9C,EAgCAQ,EAAQ1L,UAAUqM,kBAAoB,SAAUvM,GAC9C,IAAKA,GAAsB,iBAARA,EAAkB,OAAO,KAE5C,MAAMmE,EAAa,CAAC,EACpB,IAAI+F,GAAW,EAGf,GAAI3K,KAAKoB,QAAQ2K,qBAAuBtL,EAAIT,KAAKoB,QAAQ2K,qBAAsB,CAC7E,MAAM0C,EAAYhO,EAAIT,KAAKoB,QAAQ2K,qBACnC,IAAK,IAAI2C,KAAWD,EACbpO,OAAOM,UAAUC,eAAeC,KAAK4N,EAAWC,KAKrD9J,EAHiB8J,EAAQ7D,WAAW7K,KAAKoB,QAAQ0J,qBAC7C4D,EAAQrL,UAAUrD,KAAKoB,QAAQ0J,oBAAoB3I,QACnDuM,GACmBD,EAAUC,GACjC/D,GAAW,EAEf,MAEE,IAAK,IAAIxK,KAAOM,EAAK,CACnB,IAAKJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAKN,GAAM,SACrD,MAAMyK,EAAO5K,KAAKuM,YAAYpM,GAC1ByK,IACFhG,EAAWgG,GAAQnK,EAAIN,GACvBwK,GAAW,EAEf,CAGF,OAAOA,EAAW/F,EAAa,IACjC,EAGAyH,EAAQ1L,UAAUuM,gBAAkB,SAAUzM,GAC5C,GAAmB,iBAARA,EACT,OAAOA,EAGT,GAAmB,iBAARA,GAA4B,OAARA,EAC7B,OAAO0G,OAAO1G,GAIhB,QAAuCoB,IAAnCpB,EAAIT,KAAKoB,QAAQoI,cACnB,OAAO/I,EAAIT,KAAKoB,QAAQoI,cAI1B,IAAI3G,EAAU,GAEd,IAAK,IAAI1C,KAAOM,EAAK,CACnB,IAAKJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAKN,GAAM,SAGrD,GAAIH,KAAKuM,YAAYpM,GAAM,SAC3B,GAAIH,KAAKoB,QAAQ2K,qBAAuB5L,IAAQH,KAAKoB,QAAQ2K,oBAAqB,SAElF,MAAM/K,EAAQP,EAAIN,GAElB,GAAIA,IAAQH,KAAKoB,QAAQoI,aACvB3G,GAAW7B,OACN,GAAI8G,MAAMC,QAAQ/G,IAEvB,IAAK,IAAIgH,KAAQhH,EACf,GAAoB,iBAATgH,GAAqC,iBAATA,EACrCnF,GAAW,IAAI1C,KAAO6H,MAAS7H,UAC1B,GAAoB,iBAAT6H,GAA8B,OAATA,EAAe,CACpD,MAAMiD,EAAgBjL,KAAKkN,gBAAgBlF,GACrC2G,EAAc3O,KAAKmN,2BAA2BnF,GAElDnF,GADoB,KAAlBoI,EACS,IAAI9K,IAAMwO,MAEV,IAAIxO,IAAMwO,KAAe1D,MAAkB9K,IAE1D,OAEG,GAAqB,iBAAVa,GAAgC,OAAVA,EAAgB,CAEtD,MAAMiK,EAAgBjL,KAAKkN,gBAAgBlM,GACrC2N,EAAc3O,KAAKmN,2BAA2BnM,GAElD6B,GADoB,KAAlBoI,EACS,IAAI9K,IAAMwO,MAEV,IAAIxO,IAAMwO,KAAe1D,MAAkB9K,IAE1D,MAEE0C,GAAW,IAAI1C,KAAOa,MAAUb,IAEpC,CAEA,OAAO0C,CACT,EAGAwJ,EAAQ1L,UAAUwM,2BAA6B,SAAU1M,GACvD,IAAKA,GAAsB,iBAARA,EAAkB,MAAO,GAE5C,IAAIyK,EAAU,GAGd,GAAIlL,KAAKoB,QAAQ2K,qBAAuBtL,EAAIT,KAAKoB,QAAQ2K,qBAAsB,CAC7E,MAAM0C,EAAYhO,EAAIT,KAAKoB,QAAQ2K,qBACnC,IAAK,IAAI2C,KAAWD,EAAW,CAC7B,IAAKpO,OAAOM,UAAUC,eAAeC,KAAK4N,EAAWC,GAAU,SAC/D,MAAME,EAAWF,EAAQ7D,WAAW7K,KAAKoB,QAAQ0J,qBAC7C4D,EAAQrL,UAAUrD,KAAKoB,QAAQ0J,oBAAoB3I,QACnDuM,EACE7C,EAAM4C,EAAUC,IACV,IAAR7C,GAAgB7L,KAAKoB,QAAQgK,0BAC/BF,GAAW,IAAM0D,EAEjB1D,GAAW,IAAM0D,EAAW,KAAO/C,EAAM,GAE7C,CACF,MAEE,IAAK,IAAI1L,KAAOM,EAAK,CACnB,IAAKJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAKN,GAAM,SACrD,MAAMyK,EAAO5K,KAAKuM,YAAYpM,GAC9B,GAAIyK,EAAM,CACR,MAAMiB,EAAMpL,EAAIN,IACJ,IAAR0L,GAAgB7L,KAAKoB,QAAQgK,0BAC/BF,GAAW,IAAMN,EAEjBM,GAAW,IAAMN,EAAO,KAAOiB,EAAM,GAEzC,CACF,CAGF,OAAOX,CACT,EAEAmB,EAAQ1L,UAAUyM,gBAAkB,SAAUvB,EAAK1L,EAAK+K,EAAS6B,GAC/D,GAAY,KAARlB,EACF,MAAe,MAAX1L,EAAI,GAAmBH,KAAK2M,UAAUI,GAAS,IAAM5M,EAAM+K,EAAU,IAAMlL,KAAK4M,WAE3E5M,KAAK2M,UAAUI,GAAS,IAAM5M,EAAM+K,EAAUlL,KAAKkO,SAAS/N,GAAOH,KAAK4M,WAE5E,CAEL,IAAIiC,EAAY,KAAO1O,EAAMH,KAAK4M,WAC9BkC,EAAgB,GAQpB,MANe,MAAX3O,EAAI,KACN2O,EAAgB,IAChBD,EAAY,KAIT3D,GAAuB,KAAZA,IAAyC,IAAtBW,EAAIzI,QAAQ,MAEH,IAAjCpD,KAAKoB,QAAQwI,iBAA6BzJ,IAAQH,KAAKoB,QAAQwI,iBAA4C,IAAzBkF,EAAc3M,OAClGnC,KAAK2M,UAAUI,GAAS,UAAOlB,UAAW7L,KAAK6M,QAGpD7M,KAAK2M,UAAUI,GAAS,IAAM5M,EAAM+K,EAAU4D,EAAgB9O,KAAK4M,WACnEf,EACA7L,KAAK2M,UAAUI,GAAS8B,EAPlB7O,KAAK2M,UAAUI,GAAS,IAAM5M,EAAM+K,EAAU4D,EAAgB,IAAMjD,EAAMgD,CAStF,CACF,EAEAxC,EAAQ1L,UAAUuN,SAAW,SAAU/N,GACrC,IAAI+N,EAAW,GAQf,OAPgD,IAA5ClO,KAAKoB,QAAQiJ,aAAajH,QAAQjD,GAC/BH,KAAKoB,QAAQkJ,uBAAsB4D,EAAW,KAEnDA,EADSlO,KAAKoB,QAAQmJ,kBACX,IAEA,MAAMpK,IAEZ+N,CACT,EAEA7B,EAAQ1L,UAAU4I,cAAgB,SAAUV,GAC1C,IAAK7I,KAAKyI,qBAA2D,IAApCzI,KAAKyI,oBAAoBtG,OAAc,OAAO,EAE/E,IAAK,IAAIF,EAAI,EAAGA,EAAIjC,KAAKyI,oBAAoBtG,OAAQF,IACnD,GAAI4G,EAAQrC,QAAQxG,KAAKyI,oBAAoBxG,IAC3C,OAAO,EAGX,OAAO,CACT,EAcAoK,EAAQ1L,UAAU4M,iBAAmB,SAAU1B,EAAK1L,EAAK+K,EAAS6B,EAAOlE,GACvE,IAAmC,IAA/B7I,KAAKoB,QAAQuI,eAA2BxJ,IAAQH,KAAKoB,QAAQuI,cAC/D,OAAO3J,KAAK2M,UAAUI,GAAS,YAAYlB,OAAW7L,KAAK6M,QACtD,IAAqC,IAAjC7M,KAAKoB,QAAQwI,iBAA6BzJ,IAAQH,KAAKoB,QAAQwI,gBACxE,OAAO5J,KAAK2M,UAAUI,GAAS,UAAOlB,UAAW7L,KAAK6M,QACjD,GAAe,MAAX1M,EAAI,GACb,OAAOH,KAAK2M,UAAUI,GAAS,IAAM5M,EAAM+K,EAAU,IAAMlL,KAAK4M,WAC3D,CAEL,IAAIrB,EAAYvL,KAAKoB,QAAQsI,kBAAkBvJ,EAAK0L,GAGpD,OAFAN,EAAYvL,KAAKkJ,qBAAqBqC,GAEpB,KAAdA,EACKvL,KAAK2M,UAAUI,GAAS,IAAM5M,EAAM+K,EAAUlL,KAAKkO,SAAS/N,GAAOH,KAAK4M,WAExE5M,KAAK2M,UAAUI,GAAS,IAAM5M,EAAM+K,EAAU,IACnDK,EACA,KAAOpL,EAAMH,KAAK4M,UAExB,CACF,EAEAP,EAAQ1L,UAAUuI,qBAAuB,SAAUqC,GACjD,GAAIA,GAAaA,EAAUpJ,OAAS,GAAKnC,KAAKoB,QAAQoK,gBACpD,IAAK,IAAIvJ,EAAI,EAAGA,EAAIjC,KAAKoB,QAAQqK,SAAStJ,OAAQF,IAAK,CACrD,MAAMyJ,EAAS1L,KAAKoB,QAAQqK,SAASxJ,GACrCsJ,EAAYA,EAAUI,QAAQD,EAAOE,MAAOF,EAAOG,IACrD,CAEF,OAAON,CACT,EElgBA,U","sources":["webpack://XMLBuilder/webpack/universalModuleDefinition","webpack://XMLBuilder/webpack/bootstrap","webpack://XMLBuilder/webpack/runtime/define property getters","webpack://XMLBuilder/webpack/runtime/hasOwnProperty shorthand","webpack://XMLBuilder/webpack/runtime/make namespace object","webpack://XMLBuilder/./node_modules/path-expression-matcher/src/Expression.js","webpack://XMLBuilder/./node_modules/path-expression-matcher/src/Matcher.js","webpack://XMLBuilder/./node_modules/fast-xml-builder/src/orderedJs2Xml.js","webpack://XMLBuilder/./node_modules/fast-xml-builder/src/fxb.js","webpack://XMLBuilder/./node_modules/fast-xml-builder/src/ignoreAttributes.js","webpack://XMLBuilder/./src/xmlbuilder/json2xml.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[\"XMLBuilder\"] = factory();\n\telse\n\t\troot[\"XMLBuilder\"] = 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 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 = {}) {\n this.pattern = pattern;\n this.separator = options.separator \|\| '.';\n this.segments = this._parse(pattern);\n\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 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 * @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 /\n\n/\n Names of methods that mutate Matcher state.\n * Any attempt to call these on a read-only view throws a TypeError.\n * @type {Set<string>}\n /\nconst MUTATING_METHODS = new Set(['push', 'pop', 'reset', 'updateCurrent', 'restore']);\n\nexport default class Matcher {\n /\n Create a new Matcher\n * @param {Object} options - Configuration options\n * @param {string} options.separator - Default path separator (default: '.')\n /\n constructor(options = {}) {\n this.separator = options.separator \|\| '.';\n this.path = [];\n this.siblingStacks = [];\n // Each path node: { tag: string, values: object, position: number, counter: number }\n // values only present for current (last) node\n // Each siblingStacks entry: Map<tagName, count> tracking occurrences at each level\n }\n\n /\n Push a new tag onto the path\n * @param {string} tagName - Name of the tag\n * @param {Object} attrValues - Attribute key-value pairs for current node (optional)\n * @param {string} namespace - Namespace for the tag (optional)\n /\n push(tagName, attrValues = null, namespace = null) {\n // Remove values from previous current node (now becoming ancestor)\n if (this.path.length > 0) {\n const prev = this.path[this.path.length - 1];\n prev.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 // Store namespace if provided\n if (namespace !== null && namespace !== undefined) {\n node.namespace = namespace;\n }\n\n // Store values only for current node\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) {\n return undefined;\n }\n\n const node = this.path.pop();\n\n // Clean up sibling tracking for levels deeper than current\n // After pop, path.length is the new depth\n // We need to clean up siblingStacks[path.length + 1] and beyond\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 - Attribute values\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 - Attribute name\n * @returns {} Attribute value or undefined\n /\n getAttrValue(attrName) {\n if (this.path.length === 0) return undefined;\n const current = this.path[this.path.length - 1];\n return current.values?.[attrName];\n }\n\n /*\n Check if current node has an attribute\n * @param {string} attrName - Attribute name\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 for backward compatibility)\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 - Whether to include namespace in output (default: true)\n * @returns {string}\n /\n toString(separator, includeNamespace = true) {\n const sep = separator \|\| this.separator;\n return this.path.map(n => {\n if (includeNamespace && n.namespace) {\n return `${n.namespace}:${n.tag}`;\n }\n return 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.path = [];\n this.siblingStacks = [];\n }\n\n /\n Match current path against an Expression\n * @param {Expression} expression - The expression to match against\n * @returns {boolean} True if current path matches the expression\n /\n matches(expression) {\n const segments = expression.segments;\n\n if (segments.length === 0) {\n return false;\n }\n\n // Handle deep wildcard patterns\n if (expression.hasDeepWildcard()) {\n return this._matchWithDeepWildcard(segments);\n }\n\n // Simple path matching (no deep wildcards)\n return this._matchSimple(segments);\n }\n\n /\n Match simple path (no deep wildcards)\n * @private\n /\n _matchSimple(segments) {\n // Path must be same length as segments\n if (this.path.length !== segments.length) {\n return false;\n }\n\n // Match each segment bottom-to-top\n for (let i = 0; i < segments.length; i++) {\n const segment = segments[i];\n const node = this.path[i];\n const isCurrentNode = (i === this.path.length - 1);\n\n if (!this._matchSegment(segment, node, isCurrentNode)) {\n return false;\n }\n }\n\n return true;\n }\n\n /\n Match path with deep wildcards\n * @private\n /\n _matchWithDeepWildcard(segments) {\n let pathIdx = this.path.length - 1; // Start from current node (bottom)\n let segIdx = segments.length - 1; // Start from last segment\n\n while (segIdx >= 0 && pathIdx >= 0) {\n const segment = segments[segIdx];\n\n if (segment.type === 'deep-wildcard') {\n // \"..\" matches zero or more levels\n segIdx--;\n\n if (segIdx < 0) {\n // Pattern ends with \"..\", always matches\n return true;\n }\n\n // Find where next segment matches in the path\n const nextSeg = segments[segIdx];\n let found = false;\n\n for (let i = pathIdx; i >= 0; i--) {\n const isCurrentNode = (i === this.path.length - 1);\n if (this._matchSegment(nextSeg, this.path[i], isCurrentNode)) {\n pathIdx = i - 1;\n segIdx--;\n found = true;\n break;\n }\n }\n\n if (!found) {\n return false;\n }\n } else {\n // Regular segment\n const isCurrentNode = (pathIdx === this.path.length - 1);\n if (!this._matchSegment(segment, this.path[pathIdx], isCurrentNode)) {\n return false;\n }\n pathIdx--;\n segIdx--;\n }\n }\n\n // All segments must be consumed\n return segIdx < 0;\n }\n\n /\n Match a single segment against a node\n * @private\n * @param {Object} segment - Segment from Expression\n * @param {Object} node - Node from path\n * @param {boolean} isCurrentNode - Whether this is the current (last) node\n * @returns {boolean}\n /\n _matchSegment(segment, node, isCurrentNode) {\n // Match tag name ( is wildcard)\n if (segment.tag !== '' && segment.tag !== node.tag) {\n return false;\n }\n\n // Match namespace if specified in segment\n if (segment.namespace !== undefined) {\n // Segment has namespace - node must match it\n if (segment.namespace !== '' && segment.namespace !== node.namespace) {\n return false;\n }\n }\n // If segment has no namespace, it matches nodes with or without namespace\n\n // Match attribute name (check if node has this attribute)\n // Can only check for current node since ancestors don't have values\n if (segment.attrName !== undefined) {\n if (!isCurrentNode) {\n // Can't check attributes for ancestor nodes (values not stored)\n return false;\n }\n\n if (!node.values \|\| !(segment.attrName in node.values)) {\n return false;\n }\n\n // Match attribute value (only possible for current node)\n if (segment.attrValue !== undefined) {\n const actualValue = node.values[segment.attrName];\n // Both should be strings\n if (String(actualValue) !== String(segment.attrValue)) {\n return false;\n }\n }\n }\n\n // Match position (only for current node)\n if (segment.position !== undefined) {\n if (!isCurrentNode) {\n // Can't check position for ancestor nodes\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') {\n if (counter !== segment.positionValue) {\n return false;\n }\n }\n }\n\n return true;\n }\n\n /*\n Create a snapshot of current state\n * @returns {Object} State snapshot\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 - State snapshot\n /\n restore(snapshot) {\n this.path = snapshot.path.map(node => ({ ...node }));\n this.siblingStacks = snapshot.siblingStacks.map(map => new Map(map));\n }\n\n /\n Return a read-only view of this matcher.\n \n The returned object exposes all query/inspection methods but throws a\n * TypeError if any state-mutating method is called (`push`, `pop`, `reset`,\n * `updateCurrent`, `restore`). Property reads (e.g. `.path`, `.separator`)\n * are allowed but the returned arrays/objects are frozen so callers cannot\n * mutate internal state through them either.\n \n @returns {ReadOnlyMatcher} A proxy that forwards read operations and blocks writes.\n \n @example\n * const matcher = new Matcher();\n * matcher.push(\"root\", {});\n \n const ro = matcher.readOnly();\n * ro.matches(expr); // ✓ works\n * ro.getCurrentTag(); // ✓ works\n * ro.push(\"child\", {}); // ✗ throws TypeError\n * ro.reset(); // ✗ throws TypeError\n /\n readOnly() {\n const self = this;\n\n return new Proxy(self, {\n get(target, prop, receiver) {\n // Block mutating methods\n if (MUTATING_METHODS.has(prop)) {\n return () => {\n throw new TypeError(\n `Cannot call '${prop}' on a read-only Matcher. ` +\n `Obtain a writable instance to mutate state.`\n );\n };\n }\n\n const value = Reflect.get(target, prop, receiver);\n\n // Freeze array/object properties so callers can't mutate internal\n // state through direct property access (e.g. matcher.path.push(...))\n if (prop === 'path' \|\| prop === 'siblingStacks') {\n return Object.freeze(\n Array.isArray(value)\n ? value.map(item =>\n item instanceof Map\n ? Object.freeze(new Map(item)) // freeze a copy of each Map\n : Object.freeze({ ...item }) // freeze a copy of each node\n )\n : value\n );\n }\n\n // Bind methods so `this` inside them still refers to the real Matcher\n if (typeof value === 'function') {\n return value.bind(target);\n }\n\n return value;\n },\n\n // Prevent any property assignment on the read-only view\n set(_target, prop) {\n throw new TypeError(\n `Cannot set property '${String(prop)}' on a read-only Matcher.`\n );\n },\n\n // Prevent property deletion\n deleteProperty(_target, prop) {\n throw new TypeError(\n `Cannot delete property '${String(prop)}' from a read-only Matcher.`\n );\n }\n });\n }\n}","import { Expression, Matcher } from 'path-expression-matcher';\n\nconst EOL = \"\\n\";\n\n/\n \n * @param {array} jArray \n * @param {any} options \n * @returns \n /\nexport default function toXml(jArray, options) {\n let indentation = \"\";\n if (options.format && options.indentBy.length > 0) {\n indentation = EOL;\n }\n\n // Pre-compile stopNode expressions for pattern matching\n const stopNodeExpressions = [];\n if (options.stopNodes && Array.isArray(options.stopNodes)) {\n for (let i = 0; i < options.stopNodes.length; i++) {\n const node = options.stopNodes[i];\n if (typeof node === 'string') {\n stopNodeExpressions.push(new Expression(node));\n } else if (node instanceof Expression) {\n stopNodeExpressions.push(node);\n }\n }\n }\n\n // Initialize matcher for path tracking\n const matcher = new Matcher();\n\n return arrToStr(jArray, options, indentation, matcher, stopNodeExpressions);\n}\n\nfunction arrToStr(arr, options, indentation, matcher, stopNodeExpressions) {\n let xmlStr = \"\";\n let isPreviousElementTag = false;\n\n if (options.maxNestedTags && matcher.getDepth() > options.maxNestedTags) {\n throw new Error(\"Maximum nested tags exceeded\");\n }\n\n if (!Array.isArray(arr)) {\n // Non-array values (e.g. string tag values) should be treated as text content\n if (arr !== undefined && arr !== null) {\n let text = arr.toString();\n text = replaceEntitiesValue(text, options);\n return text;\n }\n return \"\";\n }\n\n for (let i = 0; i < arr.length; i++) {\n const tagObj = arr[i];\n const tagName = propName(tagObj);\n if (tagName === undefined) continue;\n\n // Extract attributes from \":@\" property\n const attrValues = extractAttributeValues(tagObj[\":@\"], options);\n\n // Push tag to matcher WITH attributes\n matcher.push(tagName, attrValues);\n\n // Check if this is a stop node using Expression matching\n const isStopNode = checkStopNode(matcher, stopNodeExpressions);\n\n if (tagName === options.textNodeName) {\n let tagText = tagObj[tagName];\n if (!isStopNode) {\n tagText = options.tagValueProcessor(tagName, tagText);\n tagText = replaceEntitiesValue(tagText, options);\n }\n if (isPreviousElementTag) {\n xmlStr += indentation;\n }\n xmlStr += tagText;\n isPreviousElementTag = false;\n matcher.pop();\n continue;\n } else if (tagName === options.cdataPropName) {\n if (isPreviousElementTag) {\n xmlStr += indentation;\n }\n xmlStr += `<![CDATA[${tagObj[tagName][0][options.textNodeName]}]]>`;\n isPreviousElementTag = false;\n matcher.pop();\n continue;\n } else if (tagName === options.commentPropName) {\n xmlStr += indentation + `<!--${tagObj[tagName][0][options.textNodeName]}-->`;\n isPreviousElementTag = true;\n matcher.pop();\n continue;\n } else if (tagName[0] === \"?\") {\n const attStr = attr_to_str(tagObj[\":@\"], options, isStopNode);\n const tempInd = tagName === \"?xml\" ? \"\" : indentation;\n let piTextNodeName = tagObj[tagName][0][options.textNodeName];\n piTextNodeName = piTextNodeName.length !== 0 ? \" \" + piTextNodeName : \"\"; //remove extra spacing\n xmlStr += tempInd + `<${tagName}${piTextNodeName}${attStr}?>`;\n isPreviousElementTag = true;\n matcher.pop();\n continue;\n }\n\n let newIdentation = indentation;\n if (newIdentation !== \"\") {\n newIdentation += options.indentBy;\n }\n\n // Pass isStopNode to attr_to_str so attributes are also not processed for stopNodes\n const attStr = attr_to_str(tagObj[\":@\"], options, isStopNode);\n const tagStart = indentation + `<${tagName}${attStr}`;\n\n // If this is a stopNode, get raw content without processing\n let tagValue;\n if (isStopNode) {\n tagValue = getRawContent(tagObj[tagName], options);\n } else {\n\n tagValue = arrToStr(tagObj[tagName], options, newIdentation, matcher, stopNodeExpressions);\n }\n\n if (options.unpairedTags.indexOf(tagName) !== -1) {\n if (options.suppressUnpairedNode) xmlStr += tagStart + \">\";\n else xmlStr += tagStart + \"/>\";\n } else if ((!tagValue \|\| tagValue.length === 0) && options.suppressEmptyNode) {\n xmlStr += tagStart + \"/>\";\n } else if (tagValue && tagValue.endsWith(\">\")) {\n xmlStr += tagStart + `>${tagValue}${indentation}</${tagName}>`;\n } else {\n xmlStr += tagStart + \">\";\n if (tagValue && indentation !== \"\" && (tagValue.includes(\"/>\") \|\| tagValue.includes(\"</\"))) {\n xmlStr += indentation + options.indentBy + tagValue + indentation;\n } else {\n xmlStr += tagValue;\n }\n xmlStr += `</${tagName}>`;\n }\n isPreviousElementTag = true;\n\n // Pop tag from matcher\n matcher.pop();\n }\n\n return xmlStr;\n}\n\n/\n Extract attribute values from the \":@\" object and return as plain object\n * for passing to matcher.push()\n /\nfunction extractAttributeValues(attrMap, options) {\n if (!attrMap \|\| options.ignoreAttributes) return null;\n\n const attrValues = {};\n let hasAttrs = false;\n\n for (let attr in attrMap) {\n if (!Object.prototype.hasOwnProperty.call(attrMap, attr)) continue;\n // Remove the attribute prefix to get clean attribute name\n const cleanAttrName = attr.startsWith(options.attributeNamePrefix)\n ? attr.substr(options.attributeNamePrefix.length)\n : attr;\n attrValues[cleanAttrName] = attrMap[attr];\n hasAttrs = true;\n }\n\n return hasAttrs ? attrValues : null;\n}\n\n/\n Extract raw content from a stopNode without any processing\n * This preserves the content exactly as-is, including special characters\n /\nfunction getRawContent(arr, options) {\n if (!Array.isArray(arr)) {\n // Non-array values return as-is\n if (arr !== undefined && arr !== null) {\n return arr.toString();\n }\n return \"\";\n }\n\n let content = \"\";\n for (let i = 0; i < arr.length; i++) {\n const item = arr[i];\n const tagName = propName(item);\n\n if (tagName === options.textNodeName) {\n // Raw text content - NO processing, NO entity replacement\n content += item[tagName];\n } else if (tagName === options.cdataPropName) {\n // CDATA content\n content += item[tagName][0][options.textNodeName];\n } else if (tagName === options.commentPropName) {\n // Comment content\n content += item[tagName][0][options.textNodeName];\n } else if (tagName && tagName[0] === \"?\") {\n // Processing instruction - skip for stopNodes\n continue;\n } else if (tagName) {\n // Nested tags within stopNode\n // Recursively get raw content and reconstruct the tag\n // For stopNodes, we don't process attributes either\n const attStr = attr_to_str_raw(item[\":@\"], options);\n const nestedContent = getRawContent(item[tagName], options);\n\n if (!nestedContent \|\| nestedContent.length === 0) {\n content += `<${tagName}${attStr}/>`;\n } else {\n content += `<${tagName}${attStr}>${nestedContent}</${tagName}>`;\n }\n }\n }\n return content;\n}\n\n/\n Build attribute string for stopNodes - NO entity replacement\n /\nfunction attr_to_str_raw(attrMap, options) {\n let attrStr = \"\";\n if (attrMap && !options.ignoreAttributes) {\n for (let attr in attrMap) {\n if (!Object.prototype.hasOwnProperty.call(attrMap, attr)) continue;\n // For stopNodes, use raw value without processing\n let attrVal = attrMap[attr];\n if (attrVal === true && options.suppressBooleanAttributes) {\n attrStr += ` ${attr.substr(options.attributeNamePrefix.length)}`;\n } else {\n attrStr += ` ${attr.substr(options.attributeNamePrefix.length)}=\"${attrVal}\"`;\n }\n }\n }\n return attrStr;\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 (!Object.prototype.hasOwnProperty.call(obj, key)) continue;\n if (key !== \":@\") return key;\n }\n}\n\nfunction attr_to_str(attrMap, options, isStopNode) {\n let attrStr = \"\";\n if (attrMap && !options.ignoreAttributes) {\n for (let attr in attrMap) {\n if (!Object.prototype.hasOwnProperty.call(attrMap, attr)) continue;\n let attrVal;\n\n if (isStopNode) {\n // For stopNodes, use raw value without any processing\n attrVal = attrMap[attr];\n } else {\n // Normal processing: apply attributeValueProcessor and entity replacement\n attrVal = options.attributeValueProcessor(attr, attrMap[attr]);\n attrVal = replaceEntitiesValue(attrVal, options);\n }\n\n if (attrVal === true && options.suppressBooleanAttributes) {\n attrStr += ` ${attr.substr(options.attributeNamePrefix.length)}`;\n } else {\n attrStr += ` ${attr.substr(options.attributeNamePrefix.length)}=\"${attrVal}\"`;\n }\n }\n }\n return attrStr;\n}\n\nfunction checkStopNode(matcher, stopNodeExpressions) {\n if (!stopNodeExpressions \|\| stopNodeExpressions.length === 0) return false;\n\n for (let i = 0; i < stopNodeExpressions.length; i++) {\n if (matcher.matches(stopNodeExpressions[i])) {\n return true;\n }\n }\n return false;\n}\n\nfunction replaceEntitiesValue(textValue, options) {\n if (textValue && textValue.length > 0 && options.processEntities) {\n for (let i = 0; i < options.entities.length; i++) {\n const entity = options.entities[i];\n textValue = textValue.replace(entity.regex, entity.val);\n }\n }\n return textValue;\n}","'use strict';\n//parse Empty Node as self closing node\nimport buildFromOrderedJs from './orderedJs2Xml.js';\nimport getIgnoreAttributesFn from \"./ignoreAttributes.js\";\nimport { Expression, Matcher } from 'path-expression-matcher';\n\nconst defaultOptions = {\n attributeNamePrefix: '@_',\n attributesGroupName: false,\n textNodeName: '#text',\n ignoreAttributes: true,\n cdataPropName: false,\n format: false,\n indentBy: ' ',\n suppressEmptyNode: false,\n suppressUnpairedNode: true,\n suppressBooleanAttributes: true,\n tagValueProcessor: function (key, a) {\n return a;\n },\n attributeValueProcessor: function (attrName, a) {\n return a;\n },\n preserveOrder: false,\n commentPropName: false,\n unpairedTags: [],\n entities: [\n { regex: new RegExp(\"&\", \"g\"), val: \"&\" },//it must be on top\n { regex: new RegExp(\">\", \"g\"), val: \">\" },\n { regex: new RegExp(\"<\", \"g\"), val: \"<\" },\n { regex: new RegExp(\"\\'\", \"g\"), val: \"'\" },\n { regex: new RegExp(\"\\\"\", \"g\"), val: \""\" }\n ],\n processEntities: true,\n stopNodes: [],\n // transformTagName: false,\n // transformAttributeName: false,\n oneListGroup: false,\n maxNestedTags: 100,\n jPath: true // When true, callbacks receive string jPath; when false, receive Matcher instance\n};\n\nexport default function Builder(options) {\n this.options = Object.assign({}, defaultOptions, options);\n\n // Convert old-style stopNodes for backward compatibility\n // Old syntax: \".tag\" meant \"tag anywhere in tree\"\n // New syntax: \"..tag\" means \"tag anywhere in tree\"\n if (this.options.stopNodes && Array.isArray(this.options.stopNodes)) {\n this.options.stopNodes = this.options.stopNodes.map(node => {\n if (typeof node === 'string' && node.startsWith('.')) {\n // Convert old wildcard syntax to deep wildcard\n return '..' + node.substring(2);\n }\n return node;\n });\n }\n\n // Pre-compile stopNode expressions for pattern matching\n this.stopNodeExpressions = [];\n if (this.options.stopNodes && Array.isArray(this.options.stopNodes)) {\n for (let i = 0; i < this.options.stopNodes.length; i++) {\n const node = this.options.stopNodes[i];\n if (typeof node === 'string') {\n this.stopNodeExpressions.push(new Expression(node));\n } else if (node instanceof Expression) {\n this.stopNodeExpressions.push(node);\n }\n }\n }\n\n if (this.options.ignoreAttributes === true \|\| this.options.attributesGroupName) {\n this.isAttribute = function (/a/) {\n return false;\n };\n } else {\n this.ignoreAttributesFn = getIgnoreAttributesFn(this.options.ignoreAttributes)\n this.attrPrefixLen = this.options.attributeNamePrefix.length;\n this.isAttribute = isAttribute;\n }\n\n this.processTextOrObjNode = processTextOrObjNode\n\n if (this.options.format) {\n this.indentate = indentate;\n this.tagEndChar = '>\\n';\n this.newLine = '\\n';\n } else {\n this.indentate = function () {\n return '';\n };\n this.tagEndChar = '>';\n this.newLine = '';\n }\n}\n\nBuilder.prototype.build = function (jObj) {\n if (this.options.preserveOrder) {\n return buildFromOrderedJs(jObj, this.options);\n } else {\n if (Array.isArray(jObj) && this.options.arrayNodeName && this.options.arrayNodeName.length > 1) {\n jObj = {\n [this.options.arrayNodeName]: jObj\n }\n }\n // Initialize matcher for path tracking\n const matcher = new Matcher();\n return this.j2x(jObj, 0, matcher).val;\n }\n};\n\nBuilder.prototype.j2x = function (jObj, level, matcher) {\n let attrStr = '';\n let val = '';\n if (this.options.maxNestedTags && matcher.getDepth() >= this.options.maxNestedTags) {\n throw new Error(\"Maximum nested tags exceeded\");\n }\n // Get jPath based on option: string for backward compatibility, or Matcher for new features\n const jPath = this.options.jPath ? matcher.toString() : matcher;\n\n // Check if current node is a stopNode (will be used for attribute encoding)\n const isCurrentStopNode = this.checkStopNode(matcher);\n\n for (let key in jObj) {\n if (!Object.prototype.hasOwnProperty.call(jObj, key)) continue;\n if (typeof jObj[key] === 'undefined') {\n // supress undefined node only if it is not an attribute\n if (this.isAttribute(key)) {\n val += '';\n }\n } else if (jObj[key] === null) {\n // null attribute should be ignored by the attribute list, but should not cause the tag closing\n if (this.isAttribute(key)) {\n val += '';\n } else if (key === this.options.cdataPropName) {\n val += '';\n } else if (key[0] === '?') {\n val += this.indentate(level) + '<' + key + '?' + this.tagEndChar;\n } else {\n val += this.indentate(level) + '<' + key + '/' + this.tagEndChar;\n }\n // val += this.indentate(level) + '<' + key + '/' + this.tagEndChar;\n } else if (jObj[key] instanceof Date) {\n val += this.buildTextValNode(jObj[key], key, '', level, matcher);\n } else if (typeof jObj[key] !== 'object') {\n //premitive type\n const attr = this.isAttribute(key);\n if (attr && !this.ignoreAttributesFn(attr, jPath)) {\n attrStr += this.buildAttrPairStr(attr, '' + jObj[key], isCurrentStopNode);\n } else if (!attr) {\n //tag value\n if (key === this.options.textNodeName) {\n let newval = this.options.tagValueProcessor(key, '' + jObj[key]);\n val += this.replaceEntitiesValue(newval);\n } else {\n // Check if this is a stopNode before building\n matcher.push(key);\n const isStopNode = this.checkStopNode(matcher);\n matcher.pop();\n\n if (isStopNode) {\n // Build as raw content without encoding\n const textValue = '' + jObj[key];\n if (textValue === '') {\n val += this.indentate(level) + '<' + key + this.closeTag(key) + this.tagEndChar;\n } else {\n val += this.indentate(level) + '<' + key + '>' + textValue + '</' + key + this.tagEndChar;\n }\n } else {\n val += this.buildTextValNode(jObj[key], key, '', level, matcher);\n }\n }\n }\n } else if (Array.isArray(jObj[key])) {\n //repeated nodes\n const arrLen = jObj[key].length;\n let listTagVal = \"\";\n let listTagAttr = \"\";\n for (let j = 0; j < arrLen; j++) {\n const item = jObj[key][j];\n if (typeof item === 'undefined') {\n // supress undefined node\n } else if (item === null) {\n if (key[0] === \"?\") val += this.indentate(level) + '<' + key + '?' + this.tagEndChar;\n else val += this.indentate(level) + '<' + key + '/' + this.tagEndChar;\n // val += this.indentate(level) + '<' + key + '/' + this.tagEndChar;\n } else if (typeof item === 'object') {\n if (this.options.oneListGroup) {\n // Push tag to matcher before recursive call\n matcher.push(key);\n const result = this.j2x(item, level + 1, matcher);\n // Pop tag from matcher after recursive call\n matcher.pop();\n\n listTagVal += result.val;\n if (this.options.attributesGroupName && item.hasOwnProperty(this.options.attributesGroupName)) {\n listTagAttr += result.attrStr\n }\n } else {\n listTagVal += this.processTextOrObjNode(item, key, level, matcher)\n }\n } else {\n if (this.options.oneListGroup) {\n let textValue = this.options.tagValueProcessor(key, item);\n textValue = this.replaceEntitiesValue(textValue);\n listTagVal += textValue;\n } else {\n // Check if this is a stopNode before building\n matcher.push(key);\n const isStopNode = this.checkStopNode(matcher);\n matcher.pop();\n\n if (isStopNode) {\n // Build as raw content without encoding\n const textValue = '' + item;\n if (textValue === '') {\n listTagVal += this.indentate(level) + '<' + key + this.closeTag(key) + this.tagEndChar;\n } else {\n listTagVal += this.indentate(level) + '<' + key + '>' + textValue + '</' + key + this.tagEndChar;\n }\n } else {\n listTagVal += this.buildTextValNode(item, key, '', level, matcher);\n }\n }\n }\n }\n if (this.options.oneListGroup) {\n listTagVal = this.buildObjectNode(listTagVal, key, listTagAttr, level);\n }\n val += listTagVal;\n } else {\n //nested node\n if (this.options.attributesGroupName && key === this.options.attributesGroupName) {\n const Ks = Object.keys(jObj[key]);\n const L = Ks.length;\n for (let j = 0; j < L; j++) {\n attrStr += this.buildAttrPairStr(Ks[j], '' + jObj[key][Ks[j]], isCurrentStopNode);\n }\n } else {\n val += this.processTextOrObjNode(jObj[key], key, level, matcher)\n }\n }\n }\n return { attrStr: attrStr, val: val };\n};\n\nBuilder.prototype.buildAttrPairStr = function (attrName, val, isStopNode) {\n if (!isStopNode) {\n val = this.options.attributeValueProcessor(attrName, '' + val);\n val = this.replaceEntitiesValue(val);\n }\n if (this.options.suppressBooleanAttributes && val === \"true\") {\n return ' ' + attrName;\n } else return ' ' + attrName + '=\"' + val + '\"';\n}\n\nfunction processTextOrObjNode(object, key, level, matcher) {\n // Extract attributes to pass to matcher\n const attrValues = this.extractAttributes(object);\n\n // Push tag to matcher before recursion WITH attributes\n matcher.push(key, attrValues);\n\n // Check if this entire node is a stopNode\n const isStopNode = this.checkStopNode(matcher);\n\n if (isStopNode) {\n // For stopNodes, build raw content without entity encoding\n const rawContent = this.buildRawContent(object);\n const attrStr = this.buildAttributesForStopNode(object);\n matcher.pop();\n return this.buildObjectNode(rawContent, key, attrStr, level);\n }\n\n const result = this.j2x(object, level + 1, matcher);\n // Pop tag from matcher after recursion\n matcher.pop();\n\n if (object[this.options.textNodeName] !== undefined && Object.keys(object).length === 1) {\n return this.buildTextValNode(object[this.options.textNodeName], key, result.attrStr, level, matcher);\n } else {\n return this.buildObjectNode(result.val, key, result.attrStr, level);\n }\n}\n\n// Helper method to extract attributes from an object\nBuilder.prototype.extractAttributes = function (obj) {\n if (!obj \|\| typeof obj !== 'object') return null;\n\n const attrValues = {};\n let hasAttrs = false;\n\n // Check for attributesGroupName (when attributes are grouped)\n if (this.options.attributesGroupName && obj[this.options.attributesGroupName]) {\n const attrGroup = obj[this.options.attributesGroupName];\n for (let attrKey in attrGroup) {\n if (!Object.prototype.hasOwnProperty.call(attrGroup, attrKey)) continue;\n // Remove attribute prefix if present\n const cleanKey = attrKey.startsWith(this.options.attributeNamePrefix)\n ? attrKey.substring(this.options.attributeNamePrefix.length)\n : attrKey;\n attrValues[cleanKey] = attrGroup[attrKey];\n hasAttrs = true;\n }\n } else {\n // Look for individual attributes (prefixed with attributeNamePrefix)\n for (let key in obj) {\n if (!Object.prototype.hasOwnProperty.call(obj, key)) continue;\n const attr = this.isAttribute(key);\n if (attr) {\n attrValues[attr] = obj[key];\n hasAttrs = true;\n }\n }\n }\n\n return hasAttrs ? attrValues : null;\n};\n\n// Build raw content for stopNode without entity encoding\nBuilder.prototype.buildRawContent = function (obj) {\n if (typeof obj === 'string') {\n return obj; // Already a string, return as-is\n }\n\n if (typeof obj !== 'object' \|\| obj === null) {\n return String(obj);\n }\n\n // Check if this is a stopNode data from parser: { \"#text\": \"raw xml\", \"@_attr\": \"val\" }\n if (obj[this.options.textNodeName] !== undefined) {\n return obj[this.options.textNodeName]; // Return raw text without encoding\n }\n\n // Build raw XML from nested structure\n let content = '';\n\n for (let key in obj) {\n if (!Object.prototype.hasOwnProperty.call(obj, key)) continue;\n\n // Skip attributes\n if (this.isAttribute(key)) continue;\n if (this.options.attributesGroupName && key === this.options.attributesGroupName) continue;\n\n const value = obj[key];\n\n if (key === this.options.textNodeName) {\n content += value; // Raw text\n } else if (Array.isArray(value)) {\n // Array of same tag\n for (let item of value) {\n if (typeof item === 'string' \|\| typeof item === 'number') {\n content += `<${key}>${item}</${key}>`;\n } else if (typeof item === 'object' && item !== null) {\n const nestedContent = this.buildRawContent(item);\n const nestedAttrs = this.buildAttributesForStopNode(item);\n if (nestedContent === '') {\n content += `<${key}${nestedAttrs}/>`;\n } else {\n content += `<${key}${nestedAttrs}>${nestedContent}</${key}>`;\n }\n }\n }\n } else if (typeof value === 'object' && value !== null) {\n // Nested object\n const nestedContent = this.buildRawContent(value);\n const nestedAttrs = this.buildAttributesForStopNode(value);\n if (nestedContent === '') {\n content += `<${key}${nestedAttrs}/>`;\n } else {\n content += `<${key}${nestedAttrs}>${nestedContent}</${key}>`;\n }\n } else {\n // Primitive value\n content += `<${key}>${value}</${key}>`;\n }\n }\n\n return content;\n};\n\n// Build attribute string for stopNode (no entity encoding)\nBuilder.prototype.buildAttributesForStopNode = function (obj) {\n if (!obj \|\| typeof obj !== 'object') return '';\n\n let attrStr = '';\n\n // Check for attributesGroupName (when attributes are grouped)\n if (this.options.attributesGroupName && obj[this.options.attributesGroupName]) {\n const attrGroup = obj[this.options.attributesGroupName];\n for (let attrKey in attrGroup) {\n if (!Object.prototype.hasOwnProperty.call(attrGroup, attrKey)) continue;\n const cleanKey = attrKey.startsWith(this.options.attributeNamePrefix)\n ? attrKey.substring(this.options.attributeNamePrefix.length)\n : attrKey;\n const val = attrGroup[attrKey];\n if (val === true && this.options.suppressBooleanAttributes) {\n attrStr += ' ' + cleanKey;\n } else {\n attrStr += ' ' + cleanKey + '=\"' + val + '\"'; // No encoding for stopNode\n }\n }\n } else {\n // Look for individual attributes\n for (let key in obj) {\n if (!Object.prototype.hasOwnProperty.call(obj, key)) continue;\n const attr = this.isAttribute(key);\n if (attr) {\n const val = obj[key];\n if (val === true && this.options.suppressBooleanAttributes) {\n attrStr += ' ' + attr;\n } else {\n attrStr += ' ' + attr + '=\"' + val + '\"'; // No encoding for stopNode\n }\n }\n }\n }\n\n return attrStr;\n};\n\nBuilder.prototype.buildObjectNode = function (val, key, attrStr, level) {\n if (val === \"\") {\n if (key[0] === \"?\") return this.indentate(level) + '<' + key + attrStr + '?' + this.tagEndChar;\n else {\n return this.indentate(level) + '<' + key + attrStr + this.closeTag(key) + this.tagEndChar;\n }\n } else {\n\n let tagEndExp = '</' + key + this.tagEndChar;\n let piClosingChar = \"\";\n\n if (key[0] === \"?\") {\n piClosingChar = \"?\";\n tagEndExp = \"\";\n }\n\n // attrStr is an empty string in case the attribute came as undefined or null\n if ((attrStr \|\| attrStr === '') && val.indexOf('<') === -1) {\n return (this.indentate(level) + '<' + key + attrStr + piClosingChar + '>' + val + tagEndExp);\n } else if (this.options.commentPropName !== false && key === this.options.commentPropName && piClosingChar.length === 0) {\n return this.indentate(level) + `<!--${val}-->` + this.newLine;\n } else {\n return (\n this.indentate(level) + '<' + key + attrStr + piClosingChar + this.tagEndChar +\n val +\n this.indentate(level) + tagEndExp);\n }\n }\n}\n\nBuilder.prototype.closeTag = function (key) {\n let closeTag = \"\";\n if (this.options.unpairedTags.indexOf(key) !== -1) { //unpaired\n if (!this.options.suppressUnpairedNode) closeTag = \"/\"\n } else if (this.options.suppressEmptyNode) { //empty\n closeTag = \"/\";\n } else {\n closeTag = `></${key}`\n }\n return closeTag;\n}\n\nBuilder.prototype.checkStopNode = function (matcher) {\n if (!this.stopNodeExpressions \|\| this.stopNodeExpressions.length === 0) return false;\n\n for (let i = 0; i < this.stopNodeExpressions.length; i++) {\n if (matcher.matches(this.stopNodeExpressions[i])) {\n return true;\n }\n }\n return false;\n}\n\nfunction buildEmptyObjNode(val, key, attrStr, level) {\n if (val !== '') {\n return this.buildObjectNode(val, key, attrStr, level);\n } else {\n if (key[0] === \"?\") return this.indentate(level) + '<' + key + attrStr + '?' + this.tagEndChar;\n else {\n return this.indentate(level) + '<' + key + attrStr + '/' + this.tagEndChar;\n // return this.buildTagStr(level,key, attrStr);\n }\n }\n}\n\nBuilder.prototype.buildTextValNode = function (val, key, attrStr, level, matcher) {\n if (this.options.cdataPropName !== false && key === this.options.cdataPropName) {\n return this.indentate(level) + `<![CDATA[${val}]]>` + this.newLine;\n } else if (this.options.commentPropName !== false && key === this.options.commentPropName) {\n return this.indentate(level) + `<!--${val}-->` + this.newLine;\n } else if (key[0] === \"?\") {//PI tag\n return this.indentate(level) + '<' + key + attrStr + '?' + this.tagEndChar;\n } else {\n // Normal processing: apply tagValueProcessor and entity replacement\n let textValue = this.options.tagValueProcessor(key, val);\n textValue = this.replaceEntitiesValue(textValue);\n\n if (textValue === '') {\n return this.indentate(level) + '<' + key + attrStr + this.closeTag(key) + this.tagEndChar;\n } else {\n return this.indentate(level) + '<' + key + attrStr + '>' +\n textValue +\n '</' + key + this.tagEndChar;\n }\n }\n}\n\nBuilder.prototype.replaceEntitiesValue = function (textValue) {\n if (textValue && textValue.length > 0 && this.options.processEntities) {\n for (let i = 0; i < this.options.entities.length; i++) {\n const entity = this.options.entities[i];\n textValue = textValue.replace(entity.regex, entity.val);\n }\n }\n return textValue;\n}\n\nfunction indentate(level) {\n return this.options.indentBy.repeat(level);\n}\n\nfunction isAttribute(name /, options/) {\n if (name.startsWith(this.options.attributeNamePrefix) && name !== this.options.textNodeName) {\n return name.substr(this.attrPrefixLen);\n } else {\n return false;\n }\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}","// Re-export from fast-xml-builder for backward compatibility\nimport XMLBuilder from 'fast-xml-builder';\nexport default XMLBuilder;\n\n// If there are any named exports you also want to re-export:\nexport from 'fast-xml-builder';"],"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","Expression","constructor","pattern","options","separator","segments","_parse","_hasDeepWildcard","some","seg","type","_hasAttributeCondition","undefined","attrName","_hasPositionSelector","position","i","currentPart","length","trim","push","_parseSegment","part","segment","bracketContent","withoutBrackets","bracketMatch","match","content","slice","namespace","tag","tagAndPosition","includes","nsIndex","indexOf","substring","Error","positionMatch","colonIndex","lastIndexOf","tagPart","posPart","test","eqIndex","attrValue","nthMatch","positionValue","parseInt","hasDeepWildcard","hasAttributeCondition","hasPositionSelector","toString","MUTATING_METHODS","Set","Matcher","path","siblingStacks","tagName","attrValues","values","currentLevel","Map","siblings","siblingKey","counter","count","set","node","pop","updateCurrent","current","getCurrentTag","getCurrentNamespace","getAttrValue","hasAttr","getPosition","getCounter","getIndex","getDepth","includeNamespace","sep","map","n","join","toArray","reset","matches","expression","_matchWithDeepWildcard","_matchSimple","isCurrentNode","_matchSegment","pathIdx","segIdx","nextSeg","found","actualValue","String","snapshot","restore","readOnly","Proxy","target","receiver","has","TypeError","Reflect","freeze","Array","isArray","item","bind","_target","deleteProperty","toXml","jArray","indentation","format","indentBy","stopNodeExpressions","stopNodes","arrToStr","arr","matcher","xmlStr","isPreviousElementTag","maxNestedTags","text","replaceEntitiesValue","tagObj","propName","extractAttributeValues","isStopNode","checkStopNode","textNodeName","tagText","tagValueProcessor","cdataPropName","commentPropName","attStr","attr_to_str","tempInd","piTextNodeName","newIdentation","tagStart","tagValue","getRawContent","unpairedTags","suppressUnpairedNode","suppressEmptyNode","endsWith","attrMap","ignoreAttributes","hasAttrs","attr","startsWith","attributeNamePrefix","substr","attr_to_str_raw","nestedContent","attrStr","attrVal","suppressBooleanAttributes","keys","attributeValueProcessor","textValue","processEntities","entities","entity","replace","regex","val","defaultOptions","attributesGroupName","a","preserveOrder","RegExp","oneListGroup","jPath","Builder","assign","isAttribute","ignoreAttributesFn","attrPrefixLen","processTextOrObjNode","indentate","tagEndChar","newLine","object","level","extractAttributes","rawContent","buildRawContent","buildAttributesForStopNode","buildObjectNode","result","j2x","buildTextValNode","repeat","name","build","jObj","buildFromOrderedJs","arrayNodeName","isCurrentStopNode","Date","buildAttrPairStr","newval","closeTag","arrLen","listTagVal","listTagAttr","j","Ks","L","attrGroup","attrKey","nestedAttrs","cleanKey","tagEndExp","piClosingChar"],"sourceRoot":""}
1	+ {"version":3,"file":"./lib/fxbuilder.min.js","mappings":"CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,iBAAZC,QACdA,QAAoB,WAAID,IAExBD,EAAiB,WAAIC,GACtB,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,mCCKxC,MAAMC,EAOnBC,WAAAA,CAAYC,EAASC,EAAU,CAAC,EAAGC,GACjCrB,KAAKmB,QAAUA,EACfnB,KAAKsB,UAAYF,EAAQE,WAAa,IACtCtB,KAAKuB,SAAWvB,KAAKwB,OAAOL,GAC5BnB,KAAKqB,KAAOA,EAEZrB,KAAKyB,iBAAmBzB,KAAKuB,SAASG,KAAKC,GAAoB,kBAAbA,EAAIC,MACtD5B,KAAK6B,uBAAyB7B,KAAKuB,SAASG,KAAKC,QAAwBG,IAAjBH,EAAII,UAC5D/B,KAAKgC,qBAAuBhC,KAAKuB,SAASG,KAAKC,QAAwBG,IAAjBH,EAAIM,SAC5D,CAQAT,MAAAA,CAAOL,GACL,MAAMI,EAAW,GAGjB,IAAIW,EAAI,EACJC,EAAc,GAElB,KAAOD,EAAIf,EAAQiB,QACbjB,EAAQe,KAAOlC,KAAKsB,UAElBY,EAAI,EAAIf,EAAQiB,QAAUjB,EAAQe,EAAI,KAAOlC,KAAKsB,WAEhDa,EAAYE,SACdd,EAASe,KAAKtC,KAAKuC,cAAcJ,EAAYE,SAC7CF,EAAc,IAGhBZ,EAASe,KAAK,CAAEV,KAAM,kBACtBM,GAAK,IAGDC,EAAYE,QACdd,EAASe,KAAKtC,KAAKuC,cAAcJ,EAAYE,SAE/CF,EAAc,GACdD,MAGFC,GAAehB,EAAQe,GACvBA,KASJ,OAJIC,EAAYE,QACdd,EAASe,KAAKtC,KAAKuC,cAAcJ,EAAYE,SAGxCd,CACT,CAQAgB,aAAAA,CAAcC,GACZ,MAAMC,EAAU,CAAEb,KAAM,OAwBxB,IAAIc,EAAiB,KACjBC,EAAkBH,EAEtB,MAAMI,EAAeJ,EAAKK,MAAM,8BAChC,GAAID,IACFD,EAAkBC,EAAa,GAAKA,EAAa,GAC7CA,EAAa,IAAI,CACnB,MAAME,EAAUF,EAAa,GAAGG,MAAM,GAAI,GACtCD,IACFJ,EAAiBI,EAErB,CAIF,IAAIE,EAcAC,EAbAC,EAAiBP,EAErB,GAAIA,EAAgBQ,SAAS,MAAO,CAClC,MAAMC,EAAUT,EAAgBU,QAAQ,MAIxC,GAHAL,EAAYL,EAAgBW,UAAU,EAAGF,GAASf,OAClDa,EAAiBP,EAAgBW,UAAUF,EAAU,GAAGf,QAEnDW,EACH,MAAM,IAAIO,MAAM,iCAAiCf,IAErD,CAIA,IAAIgB,EAAgB,KAEpB,GAAIN,EAAeC,SAAS,KAAM,CAChC,MAAMM,EAAaP,EAAeQ,YAAY,KACxCC,EAAUT,EAAeI,UAAU,EAAGG,GAAYpB,OAClDuB,EAAUV,EAAeI,UAAUG,EAAa,GAAGpB,OAG/B,CAAC,QAAS,OAAQ,MAAO,QAAQc,SAASS,IAClE,eAAeC,KAAKD,IAGpBX,EAAMU,EACNH,EAAgBI,GAGhBX,EAAMC,CAEV,MACED,EAAMC,EAGR,IAAKD,EACH,MAAM,IAAIM,MAAM,4BAA4Bf,KAS9C,GANAC,EAAQQ,IAAMA,EACVD,IACFP,EAAQO,UAAYA,GAIlBN,EACF,GAAIA,EAAeS,SAAS,KAAM,CAChC,MAAMW,EAAUpB,EAAeW,QAAQ,KACvCZ,EAAQV,SAAWW,EAAeY,UAAU,EAAGQ,GAASzB,OACxDI,EAAQsB,UAAYrB,EAAeY,UAAUQ,EAAU,GAAGzB,MAC5D,MACEI,EAAQV,SAAWW,EAAeL,OAKtC,GAAImB,EAAe,CACjB,MAAMQ,EAAWR,EAAcX,MAAM,kBACjCmB,GACFvB,EAAQR,SAAW,MACnBQ,EAAQwB,cAAgBC,SAASF,EAAS,GAAI,KAE9CvB,EAAQR,SAAWuB,CAEvB,CAEA,OAAOf,CACT,CAMA,UAAIL,GACF,OAAOpC,KAAKuB,SAASa,MACvB,CAMA+B,eAAAA,GACE,OAAOnE,KAAKyB,gBACd,CAMA2C,qBAAAA,GACE,OAAOpE,KAAK6B,sBACd,CAMAwC,mBAAAA,GACE,OAAOrE,KAAKgC,oBACd,CAMAsC,QAAAA,GACE,OAAOtE,KAAKmB,OACd,ECjNK,MAAMoD,EAIXrD,WAAAA,CAAYsD,GACVxE,KAAKyE,SAAWD,CAClB,CAMA,aAAIlD,GACF,OAAOtB,KAAKyE,SAASnD,SACvB,CAMAoD,aAAAA,GACE,MAAMC,EAAO3E,KAAKyE,SAASE,KAC3B,OAAOA,EAAKvC,OAAS,EAAIuC,EAAKA,EAAKvC,OAAS,GAAGa,SAAMnB,CACvD,CAMA8C,mBAAAA,GACE,MAAMD,EAAO3E,KAAKyE,SAASE,KAC3B,OAAOA,EAAKvC,OAAS,EAAIuC,EAAKA,EAAKvC,OAAS,GAAGY,eAAYlB,CAC7D,CAOA+C,YAAAA,CAAa9C,GACX,MAAM4C,EAAO3E,KAAKyE,SAASE,KAC3B,GAAoB,IAAhBA,EAAKvC,OACT,OAAOuC,EAAKA,EAAKvC,OAAS,GAAG0C,SAAS/C,EACxC,CAOAgD,OAAAA,CAAQhD,GACN,MAAM4C,EAAO3E,KAAKyE,SAASE,KAC3B,GAAoB,IAAhBA,EAAKvC,OAAc,OAAO,EAC9B,MAAM4C,EAAUL,EAAKA,EAAKvC,OAAS,GACnC,YAA0BN,IAAnBkD,EAAQF,QAAwB/C,KAAYiD,EAAQF,MAC7D,CAMAG,WAAAA,GACE,MAAMN,EAAO3E,KAAKyE,SAASE,KAC3B,OAAoB,IAAhBA,EAAKvC,QAAsB,EACxBuC,EAAKA,EAAKvC,OAAS,GAAGH,UAAY,CAC3C,CAMAiD,UAAAA,GACE,MAAMP,EAAO3E,KAAKyE,SAASE,KAC3B,OAAoB,IAAhBA,EAAKvC,QAAsB,EACxBuC,EAAKA,EAAKvC,OAAS,GAAG+C,SAAW,CAC1C,CAOAC,QAAAA,GACE,OAAOpF,KAAKiF,aACd,CAMAI,QAAAA,GACE,OAAOrF,KAAKyE,SAASE,KAAKvC,MAC5B,CAQAkC,QAAAA,CAAShD,EAAWgE,GAAmB,GACrC,OAAOtF,KAAKyE,SAASH,SAAShD,EAAWgE,EAC3C,CAMAC,OAAAA,GACE,OAAOvF,KAAKyE,SAASE,KAAKa,IAAIC,GAAKA,EAAExC,IACvC,CAOAyC,OAAAA,CAAQC,GACN,OAAO3F,KAAKyE,SAASiB,QAAQC,EAC/B,CAOAC,UAAAA,CAAWC,GACT,OAAOA,EAAQD,WAAW5F,KAAKyE,SACjC,EAsBa,MAAMqB,EAMnB5E,WAAAA,CAAYE,EAAU,CAAC,GACrBpB,KAAKsB,UAAYF,EAAQE,WAAa,IACtCtB,KAAK2E,KAAO,GACZ3E,KAAK+F,cAAgB,GAIrB/F,KAAKgG,iBAAmB,KACxBhG,KAAKiG,MAAQ,IAAI1B,EAAYvE,KAC/B,CAQAsC,IAAAA,CAAK4D,EAASC,EAAa,KAAMnD,EAAY,MAC3ChD,KAAKgG,iBAAmB,KAGpBhG,KAAK2E,KAAKvC,OAAS,IACrBpC,KAAK2E,KAAK3E,KAAK2E,KAAKvC,OAAS,GAAG0C,YAAShD,GAI3C,MAAMsE,EAAepG,KAAK2E,KAAKvC,OAC1BpC,KAAK+F,cAAcK,KACtBpG,KAAK+F,cAAcK,GAAgB,IAAIC,KAGzC,MAAMC,EAAWtG,KAAK+F,cAAcK,GAG9BG,EAAavD,EAAY,GAAGA,KAAakD,IAAYA,EAGrDf,EAAUmB,EAAS9F,IAAI+F,IAAe,EAG5C,IAAItE,EAAW,EACf,IAAK,MAAMuE,KAASF,EAASxB,SAC3B7C,GAAYuE,EAIdF,EAASG,IAAIF,EAAYpB,EAAU,GAGnC,MAAMuB,EAAO,CACXzD,IAAKiD,EACLjE,SAAUA,EACVkD,QAASA,GAGPnC,UACF0D,EAAK1D,UAAYA,GAGfmD,UACFO,EAAK5B,OAASqB,GAGhBnG,KAAK2E,KAAKrC,KAAKoE,EACjB,CAMAC,GAAAA,GACE,GAAyB,IAArB3G,KAAK2E,KAAKvC,OAAc,OAC5BpC,KAAKgG,iBAAmB,KAExB,MAAMU,EAAO1G,KAAK2E,KAAKgC,MAMvB,OAJI3G,KAAK+F,cAAc3D,OAASpC,KAAK2E,KAAKvC,OAAS,IACjDpC,KAAK+F,cAAc3D,OAASpC,KAAK2E,KAAKvC,OAAS,GAG1CsE,CACT,CAOAE,aAAAA,CAAcT,GACZ,GAAInG,KAAK2E,KAAKvC,OAAS,EAAG,CACxB,MAAM4C,EAAUhF,KAAK2E,KAAK3E,KAAK2E,KAAKvC,OAAS,GACzC+D,UACFnB,EAAQF,OAASqB,EAErB,CACF,CAMAzB,aAAAA,GACE,OAAO1E,KAAK2E,KAAKvC,OAAS,EAAIpC,KAAK2E,KAAK3E,KAAK2E,KAAKvC,OAAS,GAAGa,SAAMnB,CACtE,CAMA8C,mBAAAA,GACE,OAAO5E,KAAK2E,KAAKvC,OAAS,EAAIpC,KAAK2E,KAAK3E,KAAK2E,KAAKvC,OAAS,GAAGY,eAAYlB,CAC5E,CAOA+C,YAAAA,CAAa9C,GACX,GAAyB,IAArB/B,KAAK2E,KAAKvC,OACd,OAAOpC,KAAK2E,KAAK3E,KAAK2E,KAAKvC,OAAS,GAAG0C,SAAS/C,EAClD,CAOAgD,OAAAA,CAAQhD,GACN,GAAyB,IAArB/B,KAAK2E,KAAKvC,OAAc,OAAO,EACnC,MAAM4C,EAAUhF,KAAK2E,KAAK3E,KAAK2E,KAAKvC,OAAS,GAC7C,YAA0BN,IAAnBkD,EAAQF,QAAwB/C,KAAYiD,EAAQF,MAC7D,CAMAG,WAAAA,GACE,OAAyB,IAArBjF,KAAK2E,KAAKvC,QAAsB,EAC7BpC,KAAK2E,KAAK3E,KAAK2E,KAAKvC,OAAS,GAAGH,UAAY,CACrD,CAMAiD,UAAAA,GACE,OAAyB,IAArBlF,KAAK2E,KAAKvC,QAAsB,EAC7BpC,KAAK2E,KAAK3E,KAAK2E,KAAKvC,OAAS,GAAG+C,SAAW,CACpD,CAOAC,QAAAA,GACE,OAAOpF,KAAKiF,aACd,CAMAI,QAAAA,GACE,OAAOrF,KAAK2E,KAAKvC,MACnB,CAQAkC,QAAAA,CAAShD,EAAWgE,GAAmB,GACrC,MAAMuB,EAAMvF,GAAatB,KAAKsB,UAG9B,GAFmBuF,IAAQ7G,KAAKsB,YAAkC,IAArBgE,EAE9B,CACb,GAA8B,OAA1BtF,KAAKgG,iBACP,OAAOhG,KAAKgG,iBAEd,MAAMc,EAAS9G,KAAK2E,KAAKa,IAAIC,GAC1BA,EAAEzC,UAAa,GAAGyC,EAAEzC,aAAayC,EAAExC,MAAQwC,EAAExC,KAC9C8D,KAAKF,GAEP,OADA7G,KAAKgG,iBAAmBc,EACjBA,CACT,CAEA,OAAO9G,KAAK2E,KAAKa,IAAIC,GAClBH,GAAoBG,EAAEzC,UAAa,GAAGyC,EAAEzC,aAAayC,EAAExC,MAAQwC,EAAExC,KAClE8D,KAAKF,EACT,CAMAtB,OAAAA,GACE,OAAOvF,KAAK2E,KAAKa,IAAIC,GAAKA,EAAExC,IAC9B,CAKA+D,KAAAA,GACEhH,KAAKgG,iBAAmB,KACxBhG,KAAK2E,KAAO,GACZ3E,KAAK+F,cAAgB,EACvB,CAOAL,OAAAA,CAAQC,GACN,MAAMpE,EAAWoE,EAAWpE,SAE5B,OAAwB,IAApBA,EAASa,SAITuD,EAAWxB,kBACNnE,KAAKiH,uBAAuB1F,GAG9BvB,KAAKkH,aAAa3F,GAC3B,CAKA2F,YAAAA,CAAa3F,GACX,GAAIvB,KAAK2E,KAAKvC,SAAWb,EAASa,OAChC,OAAO,EAGT,IAAK,IAAIF,EAAI,EAAGA,EAAIX,EAASa,OAAQF,IACnC,IAAKlC,KAAKmH,cAAc5F,EAASW,GAAIlC,KAAK2E,KAAKzC,GAAIA,IAAMlC,KAAK2E,KAAKvC,OAAS,GAC1E,OAAO,EAIX,OAAO,CACT,CAKA6E,sBAAAA,CAAuB1F,GACrB,IAAI6F,EAAUpH,KAAK2E,KAAKvC,OAAS,EAC7BiF,EAAS9F,EAASa,OAAS,EAE/B,KAAOiF,GAAU,GAAKD,GAAW,GAAG,CAClC,MAAM3E,EAAUlB,EAAS8F,GAEzB,GAAqB,kBAAjB5E,EAAQb,KAA0B,CAGpC,GAFAyF,IAEIA,EAAS,EACX,OAAO,EAGT,MAAMC,EAAU/F,EAAS8F,GACzB,IAAIE,GAAQ,EAEZ,IAAK,IAAIrF,EAAIkF,EAASlF,GAAK,EAAGA,IAC5B,GAAIlC,KAAKmH,cAAcG,EAAStH,KAAK2E,KAAKzC,GAAIA,IAAMlC,KAAK2E,KAAKvC,OAAS,GAAI,CACzEgF,EAAUlF,EAAI,EACdmF,IACAE,GAAQ,EACR,KACF,CAGF,IAAKA,EACH,OAAO,CAEX,KAAO,CACL,IAAKvH,KAAKmH,cAAc1E,EAASzC,KAAK2E,KAAKyC,GAAUA,IAAYpH,KAAK2E,KAAKvC,OAAS,GAClF,OAAO,EAETgF,IACAC,GACF,CACF,CAEA,OAAOA,EAAS,CAClB,CAKAF,aAAAA,CAAc1E,EAASiE,EAAMc,GAC3B,GAAoB,MAAhB/E,EAAQQ,KAAeR,EAAQQ,MAAQyD,EAAKzD,IAC9C,OAAO,EAGT,QAA0BnB,IAAtBW,EAAQO,WACgB,MAAtBP,EAAQO,WAAqBP,EAAQO,YAAc0D,EAAK1D,UAC1D,OAAO,EAIX,QAAyBlB,IAArBW,EAAQV,SAAwB,CAClC,IAAKyF,EACH,OAAO,EAGT,IAAKd,EAAK5B,UAAYrC,EAAQV,YAAY2E,EAAK5B,QAC7C,OAAO,EAGT,QAA0BhD,IAAtBW,EAAQsB,WACN0D,OAAOf,EAAK5B,OAAOrC,EAAQV,aAAe0F,OAAOhF,EAAQsB,WAC3D,OAAO,CAGb,CAEA,QAAyBjC,IAArBW,EAAQR,SAAwB,CAClC,IAAKuF,EACH,OAAO,EAGT,MAAMrC,EAAUuB,EAAKvB,SAAW,EAEhC,GAAyB,UAArB1C,EAAQR,UAAoC,IAAZkD,EAClC,OAAO,EACF,GAAyB,QAArB1C,EAAQR,UAAsBkD,EAAU,GAAM,EACvD,OAAO,EACF,GAAyB,SAArB1C,EAAQR,UAAuBkD,EAAU,GAAM,EACxD,OAAO,EACF,GAAyB,QAArB1C,EAAQR,UAAsBkD,IAAY1C,EAAQwB,cAC3D,OAAO,CAEX,CAEA,OAAO,CACT,CAOA2B,UAAAA,CAAWC,GACT,OAAOA,EAAQD,WAAW5F,KAC5B,CAMA0H,QAAAA,GACE,MAAO,CACL/C,KAAM3E,KAAK2E,KAAKa,IAAIkB,IAAQ,IAAMA,KAClCX,cAAe/F,KAAK+F,cAAcP,IAAIA,GAAO,IAAIa,IAAIb,IAEzD,CAMAmC,OAAAA,CAAQD,GACN1H,KAAKgG,iBAAmB,KACxBhG,KAAK2E,KAAO+C,EAAS/C,KAAKa,IAAIkB,IAAQ,IAAMA,KAC5C1G,KAAK+F,cAAgB2B,EAAS3B,cAAcP,IAAIA,GAAO,IAAIa,IAAIb,GACjE,CAkBAoC,QAAAA,GACE,OAAO5H,KAAKiG,KACd,EC9iBa,SAAS4B,EAAMC,EAAQ1G,GAClC,IAAI2G,EAAc,GACd3G,EAAQ4G,QAAU5G,EAAQ6G,SAAS7F,OAAS,IAC5C2F,EAXI,MAeR,MAAMG,EAAsB,GAC5B,GAAI9G,EAAQ+G,WAAaC,MAAMC,QAAQjH,EAAQ+G,WAC3C,IAAK,IAAIjG,EAAI,EAAGA,EAAId,EAAQ+G,UAAU/F,OAAQF,IAAK,CAC/C,MAAMwE,EAAOtF,EAAQ+G,UAAUjG,GACX,iBAATwE,EACPwB,EAAoB5F,KAAK,IAAIrB,EAAWyF,IACjCA,aAAgBzF,GACvBiH,EAAoB5F,KAAKoE,EAEjC,CAMJ,OAAO4B,EAASR,EAAQ1G,EAAS2G,EAFjB,IAAIjC,EAEmCoC,EAC3D,CAEA,SAASI,EAASC,EAAKnH,EAAS2G,EAAavD,EAAS0D,GAClD,IAAIM,EAAS,GACTC,GAAuB,EAE3B,GAAIrH,EAAQsH,eAAiBlE,EAAQa,WAAajE,EAAQsH,cACtD,MAAM,IAAInF,MAAM,gCAGpB,IAAK6E,MAAMC,QAAQE,GAAM,CAErB,GAAIA,QAAmC,CACnC,IAAII,EAAOJ,EAAIjE,WAEf,OADAqE,EAAOC,EAAqBD,EAAMvH,GAC3BuH,CACX,CACA,MAAO,EACX,CAEA,IAAK,IAAIzG,EAAI,EAAGA,EAAIqG,EAAInG,OAAQF,IAAK,CACjC,MAAM2G,EAASN,EAAIrG,GACbgE,EAAU4C,EAASD,GACzB,QAAgB/G,IAAZoE,EAAuB,SAG3B,MAAMC,EAAa4C,EAAuBF,EAAO,MAAOzH,GAGxDoD,EAAQlC,KAAK4D,EAASC,GAGtB,MAAM6C,EAAaC,EAAczE,EAAS0D,GAE1C,GAAIhC,IAAY9E,EAAQ8H,aAAc,CAClC,IAAIC,EAAUN,EAAO3C,GAChB8C,IACDG,EAAU/H,EAAQgI,kBAAkBlD,EAASiD,GAC7CA,EAAUP,EAAqBO,EAAS/H,IAExCqH,IACAD,GAAUT,GAEdS,GAAUW,EACVV,GAAuB,EACvBjE,EAAQmC,MACR,QACJ,CAAO,GAAIT,IAAY9E,EAAQiI,cAAe,CACtCZ,IACAD,GAAUT,GAEd,MAAMuB,EAAMT,EAAO3C,GAAS,GAAG9E,EAAQ8H,cAEvCV,GAAU,YADMf,OAAO6B,GAAKC,QAAQ,SAAU,wBAE9Cd,GAAuB,EACvBjE,EAAQmC,MACR,QACJ,CAAO,GAAIT,IAAY9E,EAAQoI,gBAAiB,CAC5C,MAAMF,EAAMT,EAAO3C,GAAS,GAAG9E,EAAQ8H,cAIvCV,GAAUT,EAAc,UAHRN,OAAO6B,GAClBC,QAAQ,MAAO,OACfA,QAAQ,KAAM,cAEnBd,GAAuB,EACvBjE,EAAQmC,MACR,QACJ,CAAO,GAAmB,MAAfT,EAAQ,GAAY,CAC3B,MAAMuD,EAASC,EAAYb,EAAO,MAAOzH,EAAS4H,GAC5CW,EAAsB,SAAZzD,EAAqB,GAAK6B,EAC1C,IAAI6B,EAAiBf,EAAO3C,GAAS,GAAG9E,EAAQ8H,cAChDU,EAA2C,IAA1BA,EAAexH,OAAe,IAAMwH,EAAiB,GACtEpB,GAAUmB,EAAU,IAAIzD,IAAU0D,IAAiBH,MACnDhB,GAAuB,EACvBjE,EAAQmC,MACR,QACJ,CAEA,IAAIkD,EAAgB9B,EACE,KAAlB8B,IACAA,GAAiBzI,EAAQ6G,UAI7B,MACM6B,EAAW/B,EAAc,IAAI7B,IADpBwD,EAAYb,EAAO,MAAOzH,EAAS4H,KAIlD,IAAIe,EAEAA,EADAf,EACWgB,EAAcnB,EAAO3C,GAAU9E,GAG/BkH,EAASO,EAAO3C,GAAU9E,EAASyI,EAAerF,EAAS0D,IAG3B,IAA3C9G,EAAQ6I,aAAa5G,QAAQ6C,GACzB9E,EAAQ8I,qBAAsB1B,GAAUsB,EAAW,IAClDtB,GAAUsB,EAAW,KACjBC,GAAgC,IAApBA,EAAS3H,SAAiBhB,EAAQ+I,kBAEhDJ,GAAYA,EAASK,SAAS,KACrC5B,GAAUsB,EAAW,IAAIC,IAAWhC,MAAgB7B,MAEpDsC,GAAUsB,EAAW,IACjBC,GAA4B,KAAhBhC,IAAuBgC,EAAS5G,SAAS,OAAS4G,EAAS5G,SAAS,OAChFqF,GAAUT,EAAc3G,EAAQ6G,SAAW8B,EAAWhC,EAEtDS,GAAUuB,EAEdvB,GAAU,KAAKtC,MAVfsC,GAAUsB,EAAW,KAYzBrB,GAAuB,EAGvBjE,EAAQmC,KACZ,CAEA,OAAO6B,CACX,CAMA,SAASO,EAAuBsB,EAASjJ,GACrC,IAAKiJ,GAAWjJ,EAAQkJ,iBAAkB,OAAO,KAEjD,MAAMnE,EAAa,CAAC,EACpB,IAAIoE,GAAW,EAEf,IAAK,IAAIC,KAAQH,EACRhK,OAAOM,UAAUC,eAAeC,KAAKwJ,EAASG,KAKnDrE,EAHsBqE,EAAKC,WAAWrJ,EAAQsJ,qBACxCF,EAAKG,OAAOvJ,EAAQsJ,oBAAoBtI,QACxCoI,GACsBH,EAAQG,GACpCD,GAAW,GAGf,OAAOA,EAAWpE,EAAa,IACnC,CAMA,SAAS6D,EAAczB,EAAKnH,GACxB,IAAKgH,MAAMC,QAAQE,GAEf,OAAIA,QACOA,EAAIjE,WAER,GAGX,IAAIxB,EAAU,GACd,IAAK,IAAIZ,EAAI,EAAGA,EAAIqG,EAAInG,OAAQF,IAAK,CACjC,MAAM0I,EAAOrC,EAAIrG,GACXgE,EAAU4C,EAAS8B,GAEzB,GAAI1E,IAAY9E,EAAQ8H,aAEpBpG,GAAW8H,EAAK1E,QACb,GAAIA,IAAY9E,EAAQiI,cAE3BvG,GAAW8H,EAAK1E,GAAS,GAAG9E,EAAQ8H,mBACjC,GAAIhD,IAAY9E,EAAQoI,gBAE3B1G,GAAW8H,EAAK1E,GAAS,GAAG9E,EAAQ8H,kBACjC,IAAIhD,GAA0B,MAAfA,EAAQ,GAE1B,SACG,GAAIA,EAAS,CAIhB,MAAMuD,EAASoB,EAAgBD,EAAK,MAAOxJ,GACrC0J,EAAgBd,EAAcY,EAAK1E,GAAU9E,GAE9C0J,GAA0C,IAAzBA,EAAc1I,OAGhCU,GAAW,IAAIoD,IAAUuD,KAAUqB,MAAkB5E,KAFrDpD,GAAW,IAAIoD,IAAUuD,KAIjC,EACJ,CACA,OAAO3G,CACX,CAKA,SAAS+H,EAAgBR,EAASjJ,GAC9B,IAAI2J,EAAU,GACd,GAAIV,IAAYjJ,EAAQkJ,iBACpB,IAAK,IAAIE,KAAQH,EAAS,CACtB,IAAKhK,OAAOM,UAAUC,eAAeC,KAAKwJ,EAASG,GAAO,SAE1D,IAAIQ,EAAUX,EAAQG,IACN,IAAZQ,GAAoB5J,EAAQ6J,0BAC5BF,GAAW,IAAIP,EAAKG,OAAOvJ,EAAQsJ,oBAAoBtI,UAEvD2I,GAAW,IAAIP,EAAKG,OAAOvJ,EAAQsJ,oBAAoBtI,YAAY4I,IAE3E,CAEJ,OAAOD,CACX,CAEA,SAASjC,EAASrI,GACd,MAAMyK,EAAO7K,OAAO6K,KAAKzK,GACzB,IAAK,IAAIyB,EAAI,EAAGA,EAAIgJ,EAAK9I,OAAQF,IAAK,CAClC,MAAM/B,EAAM+K,EAAKhJ,GACjB,GAAK7B,OAAOM,UAAUC,eAAeC,KAAKJ,EAAKN,IACnC,OAARA,EAAc,OAAOA,CAC7B,CACJ,CAEA,SAASuJ,EAAYW,EAASjJ,EAAS4H,GACnC,IAAI+B,EAAU,GACd,GAAIV,IAAYjJ,EAAQkJ,iBACpB,IAAK,IAAIE,KAAQH,EAAS,CACtB,IAAKhK,OAAOM,UAAUC,eAAeC,KAAKwJ,EAASG,GAAO,SAC1D,IAAIQ,EAEAhC,EAEAgC,EAAUX,EAAQG,IAGlBQ,EAAU5J,EAAQ+J,wBAAwBX,EAAMH,EAAQG,IACxDQ,EAAUpC,EAAqBoC,EAAS5J,KAG5B,IAAZ4J,GAAoB5J,EAAQ6J,0BAC5BF,GAAW,IAAIP,EAAKG,OAAOvJ,EAAQsJ,oBAAoBtI,UAEvD2I,GAAW,IAAIP,EAAKG,OAAOvJ,EAAQsJ,oBAAoBtI,YAAY4I,IAE3E,CAEJ,OAAOD,CACX,CAEA,SAAS9B,EAAczE,EAAS0D,GAC5B,IAAKA,GAAsD,IAA/BA,EAAoB9F,OAAc,OAAO,EAErE,IAAK,IAAIF,EAAI,EAAGA,EAAIgG,EAAoB9F,OAAQF,IAC5C,GAAIsC,EAAQkB,QAAQwC,EAAoBhG,IACpC,OAAO,EAGf,OAAO,CACX,CAEA,SAAS0G,EAAqBwC,EAAWhK,GACrC,GAAIgK,GAAaA,EAAUhJ,OAAS,GAAKhB,EAAQiK,gBAC7C,IAAK,IAAInJ,EAAI,EAAGA,EAAId,EAAQkK,SAASlJ,OAAQF,IAAK,CAC9C,MAAMqJ,EAASnK,EAAQkK,SAASpJ,GAChCkJ,EAAYA,EAAU7B,QAAQgC,EAAOC,MAAOD,EAAOjC,IACvD,CAEJ,OAAO8B,CACX,CCnSA,MAAMK,EAAiB,CACrBf,oBAAqB,KACrBgB,qBAAqB,EACrBxC,aAAc,QACdoB,kBAAkB,EAClBjB,eAAe,EACfrB,QAAQ,EACRC,SAAU,KACVkC,mBAAmB,EACnBD,sBAAsB,EACtBe,2BAA2B,EAC3B7B,kBAAmB,SAAUjJ,EAAKwL,GAChC,OAAOA,CACT,EACAR,wBAAyB,SAAUpJ,EAAU4J,GAC3C,OAAOA,CACT,EACAC,eAAe,EACfpC,iBAAiB,EACjBS,aAAc,GACdqB,SAAU,CACR,CAAEE,MAAO,IAAIK,OAAO,IAAK,KAAMvC,IAAK,SACpC,CAAEkC,MAAO,IAAIK,OAAO,IAAK,KAAMvC,IAAK,QACpC,CAAEkC,MAAO,IAAIK,OAAO,IAAK,KAAMvC,IAAK,QACpC,CAAEkC,MAAO,IAAIK,OAAO,IAAM,KAAMvC,IAAK,UACrC,CAAEkC,MAAO,IAAIK,OAAO,IAAM,KAAMvC,IAAK,WAEvC+B,iBAAiB,EACjBlD,UAAW,GAGX2D,cAAc,EACdpD,cAAe,IACfqD,OAAO,GAGM,SAASC,EAAQ5K,GAkB9B,GAjBApB,KAAKoB,QAAUf,OAAO4L,OAAO,CAAC,EAAGR,EAAgBrK,GAK7CpB,KAAKoB,QAAQ+G,WAAaC,MAAMC,QAAQrI,KAAKoB,QAAQ+G,aACvDnI,KAAKoB,QAAQ+G,UAAYnI,KAAKoB,QAAQ+G,UAAU3C,IAAIkB,GAC9B,iBAATA,GAAqBA,EAAK+D,WAAW,MAEvC,KAAO/D,EAAKpD,UAAU,GAExBoD,IAKX1G,KAAKkI,oBAAsB,GACvBlI,KAAKoB,QAAQ+G,WAAaC,MAAMC,QAAQrI,KAAKoB,QAAQ+G,WACvD,IAAK,IAAIjG,EAAI,EAAGA,EAAIlC,KAAKoB,QAAQ+G,UAAU/F,OAAQF,IAAK,CACtD,MAAMwE,EAAO1G,KAAKoB,QAAQ+G,UAAUjG,GAChB,iBAATwE,EACT1G,KAAKkI,oBAAoB5F,KAAK,IAAIrB,EAAWyF,IACpCA,aAAgBzF,GACzBjB,KAAKkI,oBAAoB5F,KAAKoE,EAElC,CCpEW,IAA+B4D,GDuEN,IAAlCtK,KAAKoB,QAAQkJ,kBAA6BtK,KAAKoB,QAAQsK,oBACzD1L,KAAKkM,YAAc,WACjB,OAAO,CACT,GAEAlM,KAAKmM,mBC3E2B,mBADU7B,ED4EMtK,KAAKoB,QAAQkJ,kBC1ElDA,EAEPlC,MAAMC,QAAQiC,GACNvI,IACJ,IAAK,MAAMZ,KAAWmJ,EAAkB,CACpC,GAAuB,iBAAZnJ,GAAwBY,IAAaZ,EAC5C,OAAO,EAEX,GAAIA,aAAmB0K,QAAU1K,EAAQ0C,KAAK9B,GAC1C,OAAO,CAEf,GAGD,KAAM,ED6Db/B,KAAKoM,cAAgBpM,KAAKoB,QAAQsJ,oBAAoBtI,OACtDpC,KAAKkM,YAAcA,GAGrBlM,KAAKqM,qBAAuBA,EAExBrM,KAAKoB,QAAQ4G,QACfhI,KAAKsM,UAAYA,EACjBtM,KAAKuM,WAAa,MAClBvM,KAAKwM,QAAU,OAEfxM,KAAKsM,UAAY,WACf,MAAO,EACT,EACAtM,KAAKuM,WAAa,IAClBvM,KAAKwM,QAAU,GAEnB,CAkKA,SAASH,EAAqBI,EAAQtM,EAAKuM,EAAOlI,GAEhD,MAAM2B,EAAanG,KAAK2M,kBAAkBF,GAQ1C,GALAjI,EAAQlC,KAAKnC,EAAKgG,GAGCnG,KAAKiJ,cAAczE,GAEtB,CAEd,MAAMoI,EAAa5M,KAAK6M,gBAAgBJ,GAClC1B,EAAU/K,KAAK8M,2BAA2BL,GAEhD,OADAjI,EAAQmC,MACD3G,KAAK+M,gBAAgBH,EAAYzM,EAAK4K,EAAS2B,EACxD,CAEA,MAAM5F,EAAS9G,KAAKgN,IAAIP,EAAQC,EAAQ,EAAGlI,GAI3C,OAFAA,EAAQmC,WAEkC7E,IAAtC2K,EAAOzM,KAAKoB,QAAQ8H,eAA8D,IAA/B7I,OAAO6K,KAAKuB,GAAQrK,OAClEpC,KAAKiN,iBAAiBR,EAAOzM,KAAKoB,QAAQ8H,cAAe/I,EAAK2G,EAAOiE,QAAS2B,EAAOlI,GAErFxE,KAAK+M,gBAAgBjG,EAAOwC,IAAKnJ,EAAK2G,EAAOiE,QAAS2B,EAEjE,CA+OA,SAASJ,EAAUI,GACjB,OAAO1M,KAAKoB,QAAQ6G,SAASiF,OAAOR,EACtC,CAEA,SAASR,EAAYiB,GACnB,SAAIA,EAAK1C,WAAWzK,KAAKoB,QAAQsJ,sBAAwByC,IAASnN,KAAKoB,QAAQ8H,eACtEiE,EAAKxC,OAAO3K,KAAKoM,cAI5B,CApbAJ,EAAQrL,UAAUyM,MAAQ,SAAUC,GAClC,GAAIrN,KAAKoB,QAAQwK,cACf,OAAO0B,EAAmBD,EAAMrN,KAAKoB,SAChC,CACDgH,MAAMC,QAAQgF,IAASrN,KAAKoB,QAAQmM,eAAiBvN,KAAKoB,QAAQmM,cAAcnL,OAAS,IAC3FiL,EAAO,CACL,CAACrN,KAAKoB,QAAQmM,eAAgBF,IAIlC,MAAM7I,EAAU,IAAIsB,EACpB,OAAO9F,KAAKgN,IAAIK,EAAM,EAAG7I,GAAS8E,GACpC,CACF,EAEA0C,EAAQrL,UAAUqM,IAAM,SAAUK,EAAMX,EAAOlI,GAC7C,IAAIuG,EAAU,GACVzB,EAAM,GACV,GAAItJ,KAAKoB,QAAQsH,eAAiBlE,EAAQa,YAAcrF,KAAKoB,QAAQsH,cACnE,MAAM,IAAInF,MAAM,gCAGlB,MAAMwI,EAAQ/L,KAAKoB,QAAQ2K,MAAQvH,EAAQF,WAAaE,EAGlDgJ,EAAoBxN,KAAKiJ,cAAczE,GAE7C,IAAK,IAAIrE,KAAOkN,EACd,GAAKhN,OAAOM,UAAUC,eAAeC,KAAKwM,EAAMlN,GAChD,QAAyB,IAAdkN,EAAKlN,GAEVH,KAAKkM,YAAY/L,KACnBmJ,GAAO,SAEJ,GAAkB,OAAd+D,EAAKlN,GAEVH,KAAKkM,YAAY/L,IAEVA,IAAQH,KAAKoB,QAAQiI,cAD9BC,GAAO,GAGa,MAAXnJ,EAAI,GACbmJ,GAAOtJ,KAAKsM,UAAUI,GAAS,IAAMvM,EAAM,IAAMH,KAAKuM,WAEtDjD,GAAOtJ,KAAKsM,UAAUI,GAAS,IAAMvM,EAAM,IAAMH,KAAKuM,gBAGnD,GAAIc,EAAKlN,aAAgBsN,KAC9BnE,GAAOtJ,KAAKiN,iBAAiBI,EAAKlN,GAAMA,EAAK,GAAIuM,EAAOlI,QACnD,GAAyB,iBAAd6I,EAAKlN,GAAmB,CAExC,MAAMqK,EAAOxK,KAAKkM,YAAY/L,GAC9B,GAAIqK,IAASxK,KAAKmM,mBAAmB3B,EAAMuB,GACzChB,GAAW/K,KAAK0N,iBAAiBlD,EAAM,GAAK6C,EAAKlN,GAAMqN,QAClD,IAAKhD,EAEV,GAAIrK,IAAQH,KAAKoB,QAAQ8H,aAAc,CACrC,IAAIyE,EAAS3N,KAAKoB,QAAQgI,kBAAkBjJ,EAAK,GAAKkN,EAAKlN,IAC3DmJ,GAAOtJ,KAAK4I,qBAAqB+E,EACnC,KAAO,CAELnJ,EAAQlC,KAAKnC,GACb,MAAM6I,EAAahJ,KAAKiJ,cAAczE,GAGtC,GAFAA,EAAQmC,MAEJqC,EAAY,CAEd,MAAMoC,EAAY,GAAKiC,EAAKlN,GAE1BmJ,GADgB,KAAd8B,EACKpL,KAAKsM,UAAUI,GAAS,IAAMvM,EAAMH,KAAK4N,SAASzN,GAAOH,KAAKuM,WAE9DvM,KAAKsM,UAAUI,GAAS,IAAMvM,EAAM,IAAMiL,EAAY,KAAOjL,EAAMH,KAAKuM,UAEnF,MACEjD,GAAOtJ,KAAKiN,iBAAiBI,EAAKlN,GAAMA,EAAK,GAAIuM,EAAOlI,EAE5D,CAEJ,MAAO,GAAI4D,MAAMC,QAAQgF,EAAKlN,IAAO,CAEnC,MAAM0N,EAASR,EAAKlN,GAAKiC,OACzB,IAAI0L,EAAa,GACbC,EAAc,GAClB,IAAK,IAAIC,EAAI,EAAGA,EAAIH,EAAQG,IAAK,CAC/B,MAAMpD,EAAOyC,EAAKlN,GAAK6N,GACvB,QAAoB,IAATpD,QAEJ,GAAa,OAATA,EACM,MAAXzK,EAAI,GAAYmJ,GAAOtJ,KAAKsM,UAAUI,GAAS,IAAMvM,EAAM,IAAMH,KAAKuM,WACrEjD,GAAOtJ,KAAKsM,UAAUI,GAAS,IAAMvM,EAAM,IAAMH,KAAKuM,gBAEtD,GAAoB,iBAAT3B,EAChB,GAAI5K,KAAKoB,QAAQ0K,aAAc,CAE7BtH,EAAQlC,KAAKnC,GACb,MAAM2G,EAAS9G,KAAKgN,IAAIpC,EAAM8B,EAAQ,EAAGlI,GAEzCA,EAAQmC,MAERmH,GAAchH,EAAOwC,IACjBtJ,KAAKoB,QAAQsK,qBAAuBd,EAAKhK,eAAeZ,KAAKoB,QAAQsK,uBACvEqC,GAAejH,EAAOiE,QAE1B,MACE+C,GAAc9N,KAAKqM,qBAAqBzB,EAAMzK,EAAKuM,EAAOlI,QAG5D,GAAIxE,KAAKoB,QAAQ0K,aAAc,CAC7B,IAAIV,EAAYpL,KAAKoB,QAAQgI,kBAAkBjJ,EAAKyK,GACpDQ,EAAYpL,KAAK4I,qBAAqBwC,GACtC0C,GAAc1C,CAChB,KAAO,CAEL5G,EAAQlC,KAAKnC,GACb,MAAM6I,EAAahJ,KAAKiJ,cAAczE,GAGtC,GAFAA,EAAQmC,MAEJqC,EAAY,CAEd,MAAMoC,EAAY,GAAKR,EAErBkD,GADgB,KAAd1C,EACYpL,KAAKsM,UAAUI,GAAS,IAAMvM,EAAMH,KAAK4N,SAASzN,GAAOH,KAAKuM,WAE9DvM,KAAKsM,UAAUI,GAAS,IAAMvM,EAAM,IAAMiL,EAAY,KAAOjL,EAAMH,KAAKuM,UAE1F,MACEuB,GAAc9N,KAAKiN,iBAAiBrC,EAAMzK,EAAK,GAAIuM,EAAOlI,EAE9D,CAEJ,CACIxE,KAAKoB,QAAQ0K,eACfgC,EAAa9N,KAAK+M,gBAAgBe,EAAY3N,EAAK4N,EAAarB,IAElEpD,GAAOwE,CACT,MAEE,GAAI9N,KAAKoB,QAAQsK,qBAAuBvL,IAAQH,KAAKoB,QAAQsK,oBAAqB,CAChF,MAAMuC,EAAK5N,OAAO6K,KAAKmC,EAAKlN,IACtB+N,EAAID,EAAG7L,OACb,IAAK,IAAI4L,EAAI,EAAGA,EAAIE,EAAGF,IACrBjD,GAAW/K,KAAK0N,iBAAiBO,EAAGD,GAAI,GAAKX,EAAKlN,GAAK8N,EAAGD,IAAKR,EAEnE,MACElE,GAAOtJ,KAAKqM,qBAAqBgB,EAAKlN,GAAMA,EAAKuM,EAAOlI,GAI9D,MAAO,CAAEuG,QAASA,EAASzB,IAAKA,EAClC,EAEA0C,EAAQrL,UAAU+M,iBAAmB,SAAU3L,EAAUuH,EAAKN,GAK5D,OAJKA,IACHM,EAAMtJ,KAAKoB,QAAQ+J,wBAAwBpJ,EAAU,GAAKuH,GAC1DA,EAAMtJ,KAAK4I,qBAAqBU,IAE9BtJ,KAAKoB,QAAQ6J,2BAAqC,SAAR3B,EACrC,IAAMvH,EACD,IAAMA,EAAW,KAAOuH,EAAM,GAC9C,EAgCA0C,EAAQrL,UAAUgM,kBAAoB,SAAUlM,GAC9C,IAAKA,GAAsB,iBAARA,EAAkB,OAAO,KAE5C,MAAM0F,EAAa,CAAC,EACpB,IAAIoE,GAAW,EAGf,GAAIvK,KAAKoB,QAAQsK,qBAAuBjL,EAAIT,KAAKoB,QAAQsK,qBAAsB,CAC7E,MAAMyC,EAAY1N,EAAIT,KAAKoB,QAAQsK,qBACnC,IAAK,IAAI0C,KAAWD,EACb9N,OAAOM,UAAUC,eAAeC,KAAKsN,EAAWC,KAKrDjI,EAHiBiI,EAAQ3D,WAAWzK,KAAKoB,QAAQsJ,qBAC7C0D,EAAQ9K,UAAUtD,KAAKoB,QAAQsJ,oBAAoBtI,QACnDgM,GACmBD,EAAUC,GACjC7D,GAAW,EAEf,MAEE,IAAK,IAAIpK,KAAOM,EAAK,CACnB,IAAKJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAKN,GAAM,SACrD,MAAMqK,EAAOxK,KAAKkM,YAAY/L,GAC1BqK,IACFrE,EAAWqE,GAAQ/J,EAAIN,GACvBoK,GAAW,EAEf,CAGF,OAAOA,EAAWpE,EAAa,IACjC,EAGA6F,EAAQrL,UAAUkM,gBAAkB,SAAUpM,GAC5C,GAAmB,iBAARA,EACT,OAAOA,EAGT,GAAmB,iBAARA,GAA4B,OAARA,EAC7B,OAAOgH,OAAOhH,GAIhB,QAAuCqB,IAAnCrB,EAAIT,KAAKoB,QAAQ8H,cACnB,OAAOzI,EAAIT,KAAKoB,QAAQ8H,cAI1B,IAAIpG,EAAU,GAEd,IAAK,IAAI3C,KAAOM,EAAK,CACnB,IAAKJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAKN,GAAM,SAGrD,GAAIH,KAAKkM,YAAY/L,GAAM,SAC3B,GAAIH,KAAKoB,QAAQsK,qBAAuBvL,IAAQH,KAAKoB,QAAQsK,oBAAqB,SAElF,MAAM1K,EAAQP,EAAIN,GAElB,GAAIA,IAAQH,KAAKoB,QAAQ8H,aACvBpG,GAAW9B,OACN,GAAIoH,MAAMC,QAAQrH,IAEvB,IAAK,IAAI4J,KAAQ5J,EACf,GAAoB,iBAAT4J,GAAqC,iBAATA,EACrC9H,GAAW,IAAI3C,KAAOyK,MAASzK,UAC1B,GAAoB,iBAATyK,GAA8B,OAATA,EAAe,CACpD,MAAME,EAAgB9K,KAAK6M,gBAAgBjC,GACrCyD,EAAcrO,KAAK8M,2BAA2BlC,GAElD9H,GADoB,KAAlBgI,EACS,IAAI3K,IAAMkO,MAEV,IAAIlO,IAAMkO,KAAevD,MAAkB3K,IAE1D,OAEG,GAAqB,iBAAVa,GAAgC,OAAVA,EAAgB,CAEtD,MAAM8J,EAAgB9K,KAAK6M,gBAAgB7L,GACrCqN,EAAcrO,KAAK8M,2BAA2B9L,GAElD8B,GADoB,KAAlBgI,EACS,IAAI3K,IAAMkO,MAEV,IAAIlO,IAAMkO,KAAevD,MAAkB3K,IAE1D,MAEE2C,GAAW,IAAI3C,KAAOa,MAAUb,IAEpC,CAEA,OAAO2C,CACT,EAGAkJ,EAAQrL,UAAUmM,2BAA6B,SAAUrM,GACvD,IAAKA,GAAsB,iBAARA,EAAkB,MAAO,GAE5C,IAAIsK,EAAU,GAGd,GAAI/K,KAAKoB,QAAQsK,qBAAuBjL,EAAIT,KAAKoB,QAAQsK,qBAAsB,CAC7E,MAAMyC,EAAY1N,EAAIT,KAAKoB,QAAQsK,qBACnC,IAAK,IAAI0C,KAAWD,EAAW,CAC7B,IAAK9N,OAAOM,UAAUC,eAAeC,KAAKsN,EAAWC,GAAU,SAC/D,MAAME,EAAWF,EAAQ3D,WAAWzK,KAAKoB,QAAQsJ,qBAC7C0D,EAAQ9K,UAAUtD,KAAKoB,QAAQsJ,oBAAoBtI,QACnDgM,EACE9E,EAAM6E,EAAUC,IACV,IAAR9E,GAAgBtJ,KAAKoB,QAAQ6J,0BAC/BF,GAAW,IAAMuD,EAEjBvD,GAAW,IAAMuD,EAAW,KAAOhF,EAAM,GAE7C,CACF,MAEE,IAAK,IAAInJ,KAAOM,EAAK,CACnB,IAAKJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAKN,GAAM,SACrD,MAAMqK,EAAOxK,KAAKkM,YAAY/L,GAC9B,GAAIqK,EAAM,CACR,MAAMlB,EAAM7I,EAAIN,IACJ,IAARmJ,GAAgBtJ,KAAKoB,QAAQ6J,0BAC/BF,GAAW,IAAMP,EAEjBO,GAAW,IAAMP,EAAO,KAAOlB,EAAM,GAEzC,CACF,CAGF,OAAOyB,CACT,EAEAiB,EAAQrL,UAAUoM,gBAAkB,SAAUzD,EAAKnJ,EAAK4K,EAAS2B,GAC/D,GAAY,KAARpD,EACF,MAAe,MAAXnJ,EAAI,GAAmBH,KAAKsM,UAAUI,GAAS,IAAMvM,EAAM4K,EAAU,IAAM/K,KAAKuM,WAE3EvM,KAAKsM,UAAUI,GAAS,IAAMvM,EAAM4K,EAAU/K,KAAK4N,SAASzN,GAAOH,KAAKuM,WAE5E,CAEL,IAAIgC,EAAY,KAAOpO,EAAMH,KAAKuM,WAC9BiC,EAAgB,GAQpB,MANe,MAAXrO,EAAI,KACNqO,EAAgB,IAChBD,EAAY,KAITxD,GAAuB,KAAZA,IAAyC,IAAtBzB,EAAIjG,QAAQ,MAEH,IAAjCrD,KAAKoB,QAAQoI,iBAA6BrJ,IAAQH,KAAKoB,QAAQoI,iBAA4C,IAAzBgF,EAAcpM,OAClGpC,KAAKsM,UAAUI,GAAS,UAAOpD,UAAWtJ,KAAKwM,QAGpDxM,KAAKsM,UAAUI,GAAS,IAAMvM,EAAM4K,EAAUyD,EAAgBxO,KAAKuM,WACnEjD,EACAtJ,KAAKsM,UAAUI,GAAS6B,EAPlBvO,KAAKsM,UAAUI,GAAS,IAAMvM,EAAM4K,EAAUyD,EAAgB,IAAMlF,EAAMiF,CAStF,CACF,EAEAvC,EAAQrL,UAAUiN,SAAW,SAAUzN,GACrC,IAAIyN,EAAW,GAQf,OAPgD,IAA5C5N,KAAKoB,QAAQ6I,aAAa5G,QAAQlD,GAC/BH,KAAKoB,QAAQ8I,uBAAsB0D,EAAW,KAEnDA,EADS5N,KAAKoB,QAAQ+I,kBACX,IAEA,MAAMhK,IAEZyN,CACT,EAEA5B,EAAQrL,UAAUsI,cAAgB,SAAUzE,GAC1C,IAAKxE,KAAKkI,qBAA2D,IAApClI,KAAKkI,oBAAoB9F,OAAc,OAAO,EAE/E,IAAK,IAAIF,EAAI,EAAGA,EAAIlC,KAAKkI,oBAAoB9F,OAAQF,IACnD,GAAIsC,EAAQkB,QAAQ1F,KAAKkI,oBAAoBhG,IAC3C,OAAO,EAGX,OAAO,CACT,EAcA8J,EAAQrL,UAAUsM,iBAAmB,SAAU3D,EAAKnJ,EAAK4K,EAAS2B,EAAOlI,GACvE,IAAmC,IAA/BxE,KAAKoB,QAAQiI,eAA2BlJ,IAAQH,KAAKoB,QAAQiI,cAAe,CAC9E,MAAMoF,EAAUhH,OAAO6B,GAAKC,QAAQ,SAAU,mBAC9C,OAAOvJ,KAAKsM,UAAUI,GAAS,YAAY+B,OAAezO,KAAKwM,OACjE,CAAO,IAAqC,IAAjCxM,KAAKoB,QAAQoI,iBAA6BrJ,IAAQH,KAAKoB,QAAQoI,gBAAiB,CACzF,MAAMiF,EAAUhH,OAAO6B,GACpBC,QAAQ,MAAO,OACfA,QAAQ,KAAM,MACjB,OAAOvJ,KAAKsM,UAAUI,GAAS,UAAO+B,UAAezO,KAAKwM,OAC5D,CAAO,GAAe,MAAXrM,EAAI,GACb,OAAOH,KAAKsM,UAAUI,GAAS,IAAMvM,EAAM4K,EAAU,IAAM/K,KAAKuM,WAC3D,CAEL,IAAInB,EAAYpL,KAAKoB,QAAQgI,kBAAkBjJ,EAAKmJ,GAGpD,OAFA8B,EAAYpL,KAAK4I,qBAAqBwC,GAEpB,KAAdA,EACKpL,KAAKsM,UAAUI,GAAS,IAAMvM,EAAM4K,EAAU/K,KAAK4N,SAASzN,GAAOH,KAAKuM,WAExEvM,KAAKsM,UAAUI,GAAS,IAAMvM,EAAM4K,EAAU,IACnDK,EACA,KAAOjL,EAAMH,KAAKuM,UAExB,CACF,EAEAP,EAAQrL,UAAUiI,qBAAuB,SAAUwC,GACjD,GAAIA,GAAaA,EAAUhJ,OAAS,GAAKpC,KAAKoB,QAAQiK,gBACpD,IAAK,IAAInJ,EAAI,EAAGA,EAAIlC,KAAKoB,QAAQkK,SAASlJ,OAAQF,IAAK,CACrD,MAAMqJ,EAASvL,KAAKoB,QAAQkK,SAASpJ,GACrCkJ,EAAYA,EAAU7B,QAAQgC,EAAOC,MAAOD,EAAOjC,IACrD,CAEF,OAAO8B,CACT,EEtgBA,U","sources":["webpack://XMLBuilder/webpack/universalModuleDefinition","webpack://XMLBuilder/webpack/bootstrap","webpack://XMLBuilder/webpack/runtime/define property getters","webpack://XMLBuilder/webpack/runtime/hasOwnProperty shorthand","webpack://XMLBuilder/webpack/runtime/make namespace object","webpack://XMLBuilder/./node_modules/path-expression-matcher/src/Expression.js","webpack://XMLBuilder/./node_modules/path-expression-matcher/src/Matcher.js","webpack://XMLBuilder/./node_modules/fast-xml-builder/src/orderedJs2Xml.js","webpack://XMLBuilder/./node_modules/fast-xml-builder/src/fxb.js","webpack://XMLBuilder/./node_modules/fast-xml-builder/src/ignoreAttributes.js","webpack://XMLBuilder/./src/xmlbuilder/json2xml.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[\"XMLBuilder\"] = factory();\n\telse\n\t\troot[\"XMLBuilder\"] = 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 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}","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}","import { Expression, Matcher } from 'path-expression-matcher';\n\nconst EOL = \"\\n\";\n\n/\n \n * @param {array} jArray \n * @param {any} options \n * @returns \n /\nexport default function toXml(jArray, options) {\n let indentation = \"\";\n if (options.format && options.indentBy.length > 0) {\n indentation = EOL;\n }\n\n // Pre-compile stopNode expressions for pattern matching\n const stopNodeExpressions = [];\n if (options.stopNodes && Array.isArray(options.stopNodes)) {\n for (let i = 0; i < options.stopNodes.length; i++) {\n const node = options.stopNodes[i];\n if (typeof node === 'string') {\n stopNodeExpressions.push(new Expression(node));\n } else if (node instanceof Expression) {\n stopNodeExpressions.push(node);\n }\n }\n }\n\n // Initialize matcher for path tracking\n const matcher = new Matcher();\n\n return arrToStr(jArray, options, indentation, matcher, stopNodeExpressions);\n}\n\nfunction arrToStr(arr, options, indentation, matcher, stopNodeExpressions) {\n let xmlStr = \"\";\n let isPreviousElementTag = false;\n\n if (options.maxNestedTags && matcher.getDepth() > options.maxNestedTags) {\n throw new Error(\"Maximum nested tags exceeded\");\n }\n\n if (!Array.isArray(arr)) {\n // Non-array values (e.g. string tag values) should be treated as text content\n if (arr !== undefined && arr !== null) {\n let text = arr.toString();\n text = replaceEntitiesValue(text, options);\n return text;\n }\n return \"\";\n }\n\n for (let i = 0; i < arr.length; i++) {\n const tagObj = arr[i];\n const tagName = propName(tagObj);\n if (tagName === undefined) continue;\n\n // Extract attributes from \":@\" property\n const attrValues = extractAttributeValues(tagObj[\":@\"], options);\n\n // Push tag to matcher WITH attributes\n matcher.push(tagName, attrValues);\n\n // Check if this is a stop node using Expression matching\n const isStopNode = checkStopNode(matcher, stopNodeExpressions);\n\n if (tagName === options.textNodeName) {\n let tagText = tagObj[tagName];\n if (!isStopNode) {\n tagText = options.tagValueProcessor(tagName, tagText);\n tagText = replaceEntitiesValue(tagText, options);\n }\n if (isPreviousElementTag) {\n xmlStr += indentation;\n }\n xmlStr += tagText;\n isPreviousElementTag = false;\n matcher.pop();\n continue;\n } else if (tagName === options.cdataPropName) {\n if (isPreviousElementTag) {\n xmlStr += indentation;\n }\n const val = tagObj[tagName][0][options.textNodeName];\n const safeVal = String(val).replace(/\\]\\]>/g, ']]]]><![CDATA[>');\n xmlStr += `<![CDATA[${safeVal}]]>`;\n isPreviousElementTag = false;\n matcher.pop();\n continue;\n } else if (tagName === options.commentPropName) {\n const val = tagObj[tagName][0][options.textNodeName]\n const safeVal = String(val)\n .replace(/--/g, '- -') // -- is illegal anywhere in comment content\n .replace(/-$/, '- '); // trailing - would form -- with the closing -->\n xmlStr += indentation + `<!--${safeVal}-->`;\n isPreviousElementTag = true;\n matcher.pop();\n continue;\n } else if (tagName[0] === \"?\") {\n const attStr = attr_to_str(tagObj[\":@\"], options, isStopNode);\n const tempInd = tagName === \"?xml\" ? \"\" : indentation;\n let piTextNodeName = tagObj[tagName][0][options.textNodeName];\n piTextNodeName = piTextNodeName.length !== 0 ? \" \" + piTextNodeName : \"\"; //remove extra spacing\n xmlStr += tempInd + `<${tagName}${piTextNodeName}${attStr}?>`;\n isPreviousElementTag = true;\n matcher.pop();\n continue;\n }\n\n let newIdentation = indentation;\n if (newIdentation !== \"\") {\n newIdentation += options.indentBy;\n }\n\n // Pass isStopNode to attr_to_str so attributes are also not processed for stopNodes\n const attStr = attr_to_str(tagObj[\":@\"], options, isStopNode);\n const tagStart = indentation + `<${tagName}${attStr}`;\n\n // If this is a stopNode, get raw content without processing\n let tagValue;\n if (isStopNode) {\n tagValue = getRawContent(tagObj[tagName], options);\n } else {\n\n tagValue = arrToStr(tagObj[tagName], options, newIdentation, matcher, stopNodeExpressions);\n }\n\n if (options.unpairedTags.indexOf(tagName) !== -1) {\n if (options.suppressUnpairedNode) xmlStr += tagStart + \">\";\n else xmlStr += tagStart + \"/>\";\n } else if ((!tagValue \|\| tagValue.length === 0) && options.suppressEmptyNode) {\n xmlStr += tagStart + \"/>\";\n } else if (tagValue && tagValue.endsWith(\">\")) {\n xmlStr += tagStart + `>${tagValue}${indentation}</${tagName}>`;\n } else {\n xmlStr += tagStart + \">\";\n if (tagValue && indentation !== \"\" && (tagValue.includes(\"/>\") \|\| tagValue.includes(\"</\"))) {\n xmlStr += indentation + options.indentBy + tagValue + indentation;\n } else {\n xmlStr += tagValue;\n }\n xmlStr += `</${tagName}>`;\n }\n isPreviousElementTag = true;\n\n // Pop tag from matcher\n matcher.pop();\n }\n\n return xmlStr;\n}\n\n/\n Extract attribute values from the \":@\" object and return as plain object\n * for passing to matcher.push()\n /\nfunction extractAttributeValues(attrMap, options) {\n if (!attrMap \|\| options.ignoreAttributes) return null;\n\n const attrValues = {};\n let hasAttrs = false;\n\n for (let attr in attrMap) {\n if (!Object.prototype.hasOwnProperty.call(attrMap, attr)) continue;\n // Remove the attribute prefix to get clean attribute name\n const cleanAttrName = attr.startsWith(options.attributeNamePrefix)\n ? attr.substr(options.attributeNamePrefix.length)\n : attr;\n attrValues[cleanAttrName] = attrMap[attr];\n hasAttrs = true;\n }\n\n return hasAttrs ? attrValues : null;\n}\n\n/\n Extract raw content from a stopNode without any processing\n * This preserves the content exactly as-is, including special characters\n /\nfunction getRawContent(arr, options) {\n if (!Array.isArray(arr)) {\n // Non-array values return as-is\n if (arr !== undefined && arr !== null) {\n return arr.toString();\n }\n return \"\";\n }\n\n let content = \"\";\n for (let i = 0; i < arr.length; i++) {\n const item = arr[i];\n const tagName = propName(item);\n\n if (tagName === options.textNodeName) {\n // Raw text content - NO processing, NO entity replacement\n content += item[tagName];\n } else if (tagName === options.cdataPropName) {\n // CDATA content\n content += item[tagName][0][options.textNodeName];\n } else if (tagName === options.commentPropName) {\n // Comment content\n content += item[tagName][0][options.textNodeName];\n } else if (tagName && tagName[0] === \"?\") {\n // Processing instruction - skip for stopNodes\n continue;\n } else if (tagName) {\n // Nested tags within stopNode\n // Recursively get raw content and reconstruct the tag\n // For stopNodes, we don't process attributes either\n const attStr = attr_to_str_raw(item[\":@\"], options);\n const nestedContent = getRawContent(item[tagName], options);\n\n if (!nestedContent \|\| nestedContent.length === 0) {\n content += `<${tagName}${attStr}/>`;\n } else {\n content += `<${tagName}${attStr}>${nestedContent}</${tagName}>`;\n }\n }\n }\n return content;\n}\n\n/\n Build attribute string for stopNodes - NO entity replacement\n /\nfunction attr_to_str_raw(attrMap, options) {\n let attrStr = \"\";\n if (attrMap && !options.ignoreAttributes) {\n for (let attr in attrMap) {\n if (!Object.prototype.hasOwnProperty.call(attrMap, attr)) continue;\n // For stopNodes, use raw value without processing\n let attrVal = attrMap[attr];\n if (attrVal === true && options.suppressBooleanAttributes) {\n attrStr += ` ${attr.substr(options.attributeNamePrefix.length)}`;\n } else {\n attrStr += ` ${attr.substr(options.attributeNamePrefix.length)}=\"${attrVal}\"`;\n }\n }\n }\n return attrStr;\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 (!Object.prototype.hasOwnProperty.call(obj, key)) continue;\n if (key !== \":@\") return key;\n }\n}\n\nfunction attr_to_str(attrMap, options, isStopNode) {\n let attrStr = \"\";\n if (attrMap && !options.ignoreAttributes) {\n for (let attr in attrMap) {\n if (!Object.prototype.hasOwnProperty.call(attrMap, attr)) continue;\n let attrVal;\n\n if (isStopNode) {\n // For stopNodes, use raw value without any processing\n attrVal = attrMap[attr];\n } else {\n // Normal processing: apply attributeValueProcessor and entity replacement\n attrVal = options.attributeValueProcessor(attr, attrMap[attr]);\n attrVal = replaceEntitiesValue(attrVal, options);\n }\n\n if (attrVal === true && options.suppressBooleanAttributes) {\n attrStr += ` ${attr.substr(options.attributeNamePrefix.length)}`;\n } else {\n attrStr += ` ${attr.substr(options.attributeNamePrefix.length)}=\"${attrVal}\"`;\n }\n }\n }\n return attrStr;\n}\n\nfunction checkStopNode(matcher, stopNodeExpressions) {\n if (!stopNodeExpressions \|\| stopNodeExpressions.length === 0) return false;\n\n for (let i = 0; i < stopNodeExpressions.length; i++) {\n if (matcher.matches(stopNodeExpressions[i])) {\n return true;\n }\n }\n return false;\n}\n\nfunction replaceEntitiesValue(textValue, options) {\n if (textValue && textValue.length > 0 && options.processEntities) {\n for (let i = 0; i < options.entities.length; i++) {\n const entity = options.entities[i];\n textValue = textValue.replace(entity.regex, entity.val);\n }\n }\n return textValue;\n}\n\nfunction cdataVal(val) {\n\n}\n\nfunction commentVal(val) {\n\n}","'use strict';\n//parse Empty Node as self closing node\nimport buildFromOrderedJs from './orderedJs2Xml.js';\nimport getIgnoreAttributesFn from \"./ignoreAttributes.js\";\nimport { Expression, Matcher } from 'path-expression-matcher';\n\nconst defaultOptions = {\n attributeNamePrefix: '@_',\n attributesGroupName: false,\n textNodeName: '#text',\n ignoreAttributes: true,\n cdataPropName: false,\n format: false,\n indentBy: ' ',\n suppressEmptyNode: false,\n suppressUnpairedNode: true,\n suppressBooleanAttributes: true,\n tagValueProcessor: function (key, a) {\n return a;\n },\n attributeValueProcessor: function (attrName, a) {\n return a;\n },\n preserveOrder: false,\n commentPropName: false,\n unpairedTags: [],\n entities: [\n { regex: new RegExp(\"&\", \"g\"), val: \"&\" },//it must be on top\n { regex: new RegExp(\">\", \"g\"), val: \">\" },\n { regex: new RegExp(\"<\", \"g\"), val: \"<\" },\n { regex: new RegExp(\"\\'\", \"g\"), val: \"'\" },\n { regex: new RegExp(\"\\\"\", \"g\"), val: \""\" }\n ],\n processEntities: true,\n stopNodes: [],\n // transformTagName: false,\n // transformAttributeName: false,\n oneListGroup: false,\n maxNestedTags: 100,\n jPath: true // When true, callbacks receive string jPath; when false, receive Matcher instance\n};\n\nexport default function Builder(options) {\n this.options = Object.assign({}, defaultOptions, options);\n\n // Convert old-style stopNodes for backward compatibility\n // Old syntax: \".tag\" meant \"tag anywhere in tree\"\n // New syntax: \"..tag\" means \"tag anywhere in tree\"\n if (this.options.stopNodes && Array.isArray(this.options.stopNodes)) {\n this.options.stopNodes = this.options.stopNodes.map(node => {\n if (typeof node === 'string' && node.startsWith('.')) {\n // Convert old wildcard syntax to deep wildcard\n return '..' + node.substring(2);\n }\n return node;\n });\n }\n\n // Pre-compile stopNode expressions for pattern matching\n this.stopNodeExpressions = [];\n if (this.options.stopNodes && Array.isArray(this.options.stopNodes)) {\n for (let i = 0; i < this.options.stopNodes.length; i++) {\n const node = this.options.stopNodes[i];\n if (typeof node === 'string') {\n this.stopNodeExpressions.push(new Expression(node));\n } else if (node instanceof Expression) {\n this.stopNodeExpressions.push(node);\n }\n }\n }\n\n if (this.options.ignoreAttributes === true \|\| this.options.attributesGroupName) {\n this.isAttribute = function (/a/) {\n return false;\n };\n } else {\n this.ignoreAttributesFn = getIgnoreAttributesFn(this.options.ignoreAttributes)\n this.attrPrefixLen = this.options.attributeNamePrefix.length;\n this.isAttribute = isAttribute;\n }\n\n this.processTextOrObjNode = processTextOrObjNode\n\n if (this.options.format) {\n this.indentate = indentate;\n this.tagEndChar = '>\\n';\n this.newLine = '\\n';\n } else {\n this.indentate = function () {\n return '';\n };\n this.tagEndChar = '>';\n this.newLine = '';\n }\n}\n\nBuilder.prototype.build = function (jObj) {\n if (this.options.preserveOrder) {\n return buildFromOrderedJs(jObj, this.options);\n } else {\n if (Array.isArray(jObj) && this.options.arrayNodeName && this.options.arrayNodeName.length > 1) {\n jObj = {\n [this.options.arrayNodeName]: jObj\n }\n }\n // Initialize matcher for path tracking\n const matcher = new Matcher();\n return this.j2x(jObj, 0, matcher).val;\n }\n};\n\nBuilder.prototype.j2x = function (jObj, level, matcher) {\n let attrStr = '';\n let val = '';\n if (this.options.maxNestedTags && matcher.getDepth() >= this.options.maxNestedTags) {\n throw new Error(\"Maximum nested tags exceeded\");\n }\n // Get jPath based on option: string for backward compatibility, or Matcher for new features\n const jPath = this.options.jPath ? matcher.toString() : matcher;\n\n // Check if current node is a stopNode (will be used for attribute encoding)\n const isCurrentStopNode = this.checkStopNode(matcher);\n\n for (let key in jObj) {\n if (!Object.prototype.hasOwnProperty.call(jObj, key)) continue;\n if (typeof jObj[key] === 'undefined') {\n // supress undefined node only if it is not an attribute\n if (this.isAttribute(key)) {\n val += '';\n }\n } else if (jObj[key] === null) {\n // null attribute should be ignored by the attribute list, but should not cause the tag closing\n if (this.isAttribute(key)) {\n val += '';\n } else if (key === this.options.cdataPropName) {\n val += '';\n } else if (key[0] === '?') {\n val += this.indentate(level) + '<' + key + '?' + this.tagEndChar;\n } else {\n val += this.indentate(level) + '<' + key + '/' + this.tagEndChar;\n }\n // val += this.indentate(level) + '<' + key + '/' + this.tagEndChar;\n } else if (jObj[key] instanceof Date) {\n val += this.buildTextValNode(jObj[key], key, '', level, matcher);\n } else if (typeof jObj[key] !== 'object') {\n //premitive type\n const attr = this.isAttribute(key);\n if (attr && !this.ignoreAttributesFn(attr, jPath)) {\n attrStr += this.buildAttrPairStr(attr, '' + jObj[key], isCurrentStopNode);\n } else if (!attr) {\n //tag value\n if (key === this.options.textNodeName) {\n let newval = this.options.tagValueProcessor(key, '' + jObj[key]);\n val += this.replaceEntitiesValue(newval);\n } else {\n // Check if this is a stopNode before building\n matcher.push(key);\n const isStopNode = this.checkStopNode(matcher);\n matcher.pop();\n\n if (isStopNode) {\n // Build as raw content without encoding\n const textValue = '' + jObj[key];\n if (textValue === '') {\n val += this.indentate(level) + '<' + key + this.closeTag(key) + this.tagEndChar;\n } else {\n val += this.indentate(level) + '<' + key + '>' + textValue + '</' + key + this.tagEndChar;\n }\n } else {\n val += this.buildTextValNode(jObj[key], key, '', level, matcher);\n }\n }\n }\n } else if (Array.isArray(jObj[key])) {\n //repeated nodes\n const arrLen = jObj[key].length;\n let listTagVal = \"\";\n let listTagAttr = \"\";\n for (let j = 0; j < arrLen; j++) {\n const item = jObj[key][j];\n if (typeof item === 'undefined') {\n // supress undefined node\n } else if (item === null) {\n if (key[0] === \"?\") val += this.indentate(level) + '<' + key + '?' + this.tagEndChar;\n else val += this.indentate(level) + '<' + key + '/' + this.tagEndChar;\n // val += this.indentate(level) + '<' + key + '/' + this.tagEndChar;\n } else if (typeof item === 'object') {\n if (this.options.oneListGroup) {\n // Push tag to matcher before recursive call\n matcher.push(key);\n const result = this.j2x(item, level + 1, matcher);\n // Pop tag from matcher after recursive call\n matcher.pop();\n\n listTagVal += result.val;\n if (this.options.attributesGroupName && item.hasOwnProperty(this.options.attributesGroupName)) {\n listTagAttr += result.attrStr\n }\n } else {\n listTagVal += this.processTextOrObjNode(item, key, level, matcher)\n }\n } else {\n if (this.options.oneListGroup) {\n let textValue = this.options.tagValueProcessor(key, item);\n textValue = this.replaceEntitiesValue(textValue);\n listTagVal += textValue;\n } else {\n // Check if this is a stopNode before building\n matcher.push(key);\n const isStopNode = this.checkStopNode(matcher);\n matcher.pop();\n\n if (isStopNode) {\n // Build as raw content without encoding\n const textValue = '' + item;\n if (textValue === '') {\n listTagVal += this.indentate(level) + '<' + key + this.closeTag(key) + this.tagEndChar;\n } else {\n listTagVal += this.indentate(level) + '<' + key + '>' + textValue + '</' + key + this.tagEndChar;\n }\n } else {\n listTagVal += this.buildTextValNode(item, key, '', level, matcher);\n }\n }\n }\n }\n if (this.options.oneListGroup) {\n listTagVal = this.buildObjectNode(listTagVal, key, listTagAttr, level);\n }\n val += listTagVal;\n } else {\n //nested node\n if (this.options.attributesGroupName && key === this.options.attributesGroupName) {\n const Ks = Object.keys(jObj[key]);\n const L = Ks.length;\n for (let j = 0; j < L; j++) {\n attrStr += this.buildAttrPairStr(Ks[j], '' + jObj[key][Ks[j]], isCurrentStopNode);\n }\n } else {\n val += this.processTextOrObjNode(jObj[key], key, level, matcher)\n }\n }\n }\n return { attrStr: attrStr, val: val };\n};\n\nBuilder.prototype.buildAttrPairStr = function (attrName, val, isStopNode) {\n if (!isStopNode) {\n val = this.options.attributeValueProcessor(attrName, '' + val);\n val = this.replaceEntitiesValue(val);\n }\n if (this.options.suppressBooleanAttributes && val === \"true\") {\n return ' ' + attrName;\n } else return ' ' + attrName + '=\"' + val + '\"';\n}\n\nfunction processTextOrObjNode(object, key, level, matcher) {\n // Extract attributes to pass to matcher\n const attrValues = this.extractAttributes(object);\n\n // Push tag to matcher before recursion WITH attributes\n matcher.push(key, attrValues);\n\n // Check if this entire node is a stopNode\n const isStopNode = this.checkStopNode(matcher);\n\n if (isStopNode) {\n // For stopNodes, build raw content without entity encoding\n const rawContent = this.buildRawContent(object);\n const attrStr = this.buildAttributesForStopNode(object);\n matcher.pop();\n return this.buildObjectNode(rawContent, key, attrStr, level);\n }\n\n const result = this.j2x(object, level + 1, matcher);\n // Pop tag from matcher after recursion\n matcher.pop();\n\n if (object[this.options.textNodeName] !== undefined && Object.keys(object).length === 1) {\n return this.buildTextValNode(object[this.options.textNodeName], key, result.attrStr, level, matcher);\n } else {\n return this.buildObjectNode(result.val, key, result.attrStr, level);\n }\n}\n\n// Helper method to extract attributes from an object\nBuilder.prototype.extractAttributes = function (obj) {\n if (!obj \|\| typeof obj !== 'object') return null;\n\n const attrValues = {};\n let hasAttrs = false;\n\n // Check for attributesGroupName (when attributes are grouped)\n if (this.options.attributesGroupName && obj[this.options.attributesGroupName]) {\n const attrGroup = obj[this.options.attributesGroupName];\n for (let attrKey in attrGroup) {\n if (!Object.prototype.hasOwnProperty.call(attrGroup, attrKey)) continue;\n // Remove attribute prefix if present\n const cleanKey = attrKey.startsWith(this.options.attributeNamePrefix)\n ? attrKey.substring(this.options.attributeNamePrefix.length)\n : attrKey;\n attrValues[cleanKey] = attrGroup[attrKey];\n hasAttrs = true;\n }\n } else {\n // Look for individual attributes (prefixed with attributeNamePrefix)\n for (let key in obj) {\n if (!Object.prototype.hasOwnProperty.call(obj, key)) continue;\n const attr = this.isAttribute(key);\n if (attr) {\n attrValues[attr] = obj[key];\n hasAttrs = true;\n }\n }\n }\n\n return hasAttrs ? attrValues : null;\n};\n\n// Build raw content for stopNode without entity encoding\nBuilder.prototype.buildRawContent = function (obj) {\n if (typeof obj === 'string') {\n return obj; // Already a string, return as-is\n }\n\n if (typeof obj !== 'object' \|\| obj === null) {\n return String(obj);\n }\n\n // Check if this is a stopNode data from parser: { \"#text\": \"raw xml\", \"@_attr\": \"val\" }\n if (obj[this.options.textNodeName] !== undefined) {\n return obj[this.options.textNodeName]; // Return raw text without encoding\n }\n\n // Build raw XML from nested structure\n let content = '';\n\n for (let key in obj) {\n if (!Object.prototype.hasOwnProperty.call(obj, key)) continue;\n\n // Skip attributes\n if (this.isAttribute(key)) continue;\n if (this.options.attributesGroupName && key === this.options.attributesGroupName) continue;\n\n const value = obj[key];\n\n if (key === this.options.textNodeName) {\n content += value; // Raw text\n } else if (Array.isArray(value)) {\n // Array of same tag\n for (let item of value) {\n if (typeof item === 'string' \|\| typeof item === 'number') {\n content += `<${key}>${item}</${key}>`;\n } else if (typeof item === 'object' && item !== null) {\n const nestedContent = this.buildRawContent(item);\n const nestedAttrs = this.buildAttributesForStopNode(item);\n if (nestedContent === '') {\n content += `<${key}${nestedAttrs}/>`;\n } else {\n content += `<${key}${nestedAttrs}>${nestedContent}</${key}>`;\n }\n }\n }\n } else if (typeof value === 'object' && value !== null) {\n // Nested object\n const nestedContent = this.buildRawContent(value);\n const nestedAttrs = this.buildAttributesForStopNode(value);\n if (nestedContent === '') {\n content += `<${key}${nestedAttrs}/>`;\n } else {\n content += `<${key}${nestedAttrs}>${nestedContent}</${key}>`;\n }\n } else {\n // Primitive value\n content += `<${key}>${value}</${key}>`;\n }\n }\n\n return content;\n};\n\n// Build attribute string for stopNode (no entity encoding)\nBuilder.prototype.buildAttributesForStopNode = function (obj) {\n if (!obj \|\| typeof obj !== 'object') return '';\n\n let attrStr = '';\n\n // Check for attributesGroupName (when attributes are grouped)\n if (this.options.attributesGroupName && obj[this.options.attributesGroupName]) {\n const attrGroup = obj[this.options.attributesGroupName];\n for (let attrKey in attrGroup) {\n if (!Object.prototype.hasOwnProperty.call(attrGroup, attrKey)) continue;\n const cleanKey = attrKey.startsWith(this.options.attributeNamePrefix)\n ? attrKey.substring(this.options.attributeNamePrefix.length)\n : attrKey;\n const val = attrGroup[attrKey];\n if (val === true && this.options.suppressBooleanAttributes) {\n attrStr += ' ' + cleanKey;\n } else {\n attrStr += ' ' + cleanKey + '=\"' + val + '\"'; // No encoding for stopNode\n }\n }\n } else {\n // Look for individual attributes\n for (let key in obj) {\n if (!Object.prototype.hasOwnProperty.call(obj, key)) continue;\n const attr = this.isAttribute(key);\n if (attr) {\n const val = obj[key];\n if (val === true && this.options.suppressBooleanAttributes) {\n attrStr += ' ' + attr;\n } else {\n attrStr += ' ' + attr + '=\"' + val + '\"'; // No encoding for stopNode\n }\n }\n }\n }\n\n return attrStr;\n};\n\nBuilder.prototype.buildObjectNode = function (val, key, attrStr, level) {\n if (val === \"\") {\n if (key[0] === \"?\") return this.indentate(level) + '<' + key + attrStr + '?' + this.tagEndChar;\n else {\n return this.indentate(level) + '<' + key + attrStr + this.closeTag(key) + this.tagEndChar;\n }\n } else {\n\n let tagEndExp = '</' + key + this.tagEndChar;\n let piClosingChar = \"\";\n\n if (key[0] === \"?\") {\n piClosingChar = \"?\";\n tagEndExp = \"\";\n }\n\n // attrStr is an empty string in case the attribute came as undefined or null\n if ((attrStr \|\| attrStr === '') && val.indexOf('<') === -1) {\n return (this.indentate(level) + '<' + key + attrStr + piClosingChar + '>' + val + tagEndExp);\n } else if (this.options.commentPropName !== false && key === this.options.commentPropName && piClosingChar.length === 0) {\n return this.indentate(level) + `<!--${val}-->` + this.newLine;\n } else {\n return (\n this.indentate(level) + '<' + key + attrStr + piClosingChar + this.tagEndChar +\n val +\n this.indentate(level) + tagEndExp);\n }\n }\n}\n\nBuilder.prototype.closeTag = function (key) {\n let closeTag = \"\";\n if (this.options.unpairedTags.indexOf(key) !== -1) { //unpaired\n if (!this.options.suppressUnpairedNode) closeTag = \"/\"\n } else if (this.options.suppressEmptyNode) { //empty\n closeTag = \"/\";\n } else {\n closeTag = `></${key}`\n }\n return closeTag;\n}\n\nBuilder.prototype.checkStopNode = function (matcher) {\n if (!this.stopNodeExpressions \|\| this.stopNodeExpressions.length === 0) return false;\n\n for (let i = 0; i < this.stopNodeExpressions.length; i++) {\n if (matcher.matches(this.stopNodeExpressions[i])) {\n return true;\n }\n }\n return false;\n}\n\nfunction buildEmptyObjNode(val, key, attrStr, level) {\n if (val !== '') {\n return this.buildObjectNode(val, key, attrStr, level);\n } else {\n if (key[0] === \"?\") return this.indentate(level) + '<' + key + attrStr + '?' + this.tagEndChar;\n else {\n return this.indentate(level) + '<' + key + attrStr + '/' + this.tagEndChar;\n // return this.buildTagStr(level,key, attrStr);\n }\n }\n}\n\nBuilder.prototype.buildTextValNode = function (val, key, attrStr, level, matcher) {\n if (this.options.cdataPropName !== false && key === this.options.cdataPropName) {\n const safeVal = String(val).replace(/\\]\\]>/g, ']]]]><![CDATA[>');\n return this.indentate(level) + `<![CDATA[${safeVal}]]>` + this.newLine;\n } else if (this.options.commentPropName !== false && key === this.options.commentPropName) {\n const safeVal = String(val)\n .replace(/--/g, '- -') // -- is illegal anywhere in comment content\n .replace(/-$/, '- '); // trailing - would form -- with the closing -->\n return this.indentate(level) + `<!--${safeVal}-->` + this.newLine;\n } else if (key[0] === \"?\") {//PI tag\n return this.indentate(level) + '<' + key + attrStr + '?' + this.tagEndChar;\n } else {\n // Normal processing: apply tagValueProcessor and entity replacement\n let textValue = this.options.tagValueProcessor(key, val);\n textValue = this.replaceEntitiesValue(textValue);\n\n if (textValue === '') {\n return this.indentate(level) + '<' + key + attrStr + this.closeTag(key) + this.tagEndChar;\n } else {\n return this.indentate(level) + '<' + key + attrStr + '>' +\n textValue +\n '</' + key + this.tagEndChar;\n }\n }\n}\n\nBuilder.prototype.replaceEntitiesValue = function (textValue) {\n if (textValue && textValue.length > 0 && this.options.processEntities) {\n for (let i = 0; i < this.options.entities.length; i++) {\n const entity = this.options.entities[i];\n textValue = textValue.replace(entity.regex, entity.val);\n }\n }\n return textValue;\n}\n\nfunction indentate(level) {\n return this.options.indentBy.repeat(level);\n}\n\nfunction isAttribute(name /, options/) {\n if (name.startsWith(this.options.attributeNamePrefix) && name !== this.options.textNodeName) {\n return name.substr(this.attrPrefixLen);\n } else {\n return false;\n }\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}","// Re-export from fast-xml-builder for backward compatibility\nimport XMLBuilder from 'fast-xml-builder';\nexport default XMLBuilder;\n\n// If there are any named exports you also want to re-export:\nexport from 'fast-xml-builder';"],"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","Expression","constructor","pattern","options","data","separator","segments","_parse","_hasDeepWildcard","some","seg","type","_hasAttributeCondition","undefined","attrName","_hasPositionSelector","position","i","currentPart","length","trim","push","_parseSegment","part","segment","bracketContent","withoutBrackets","bracketMatch","match","content","slice","namespace","tag","tagAndPosition","includes","nsIndex","indexOf","substring","Error","positionMatch","colonIndex","lastIndexOf","tagPart","posPart","test","eqIndex","attrValue","nthMatch","positionValue","parseInt","hasDeepWildcard","hasAttributeCondition","hasPositionSelector","toString","MatcherView","matcher","_matcher","getCurrentTag","path","getCurrentNamespace","getAttrValue","values","hasAttr","current","getPosition","getCounter","counter","getIndex","getDepth","includeNamespace","toArray","map","n","matches","expression","matchesAny","exprSet","Matcher","siblingStacks","_pathStringCache","_view","tagName","attrValues","currentLevel","Map","siblings","siblingKey","count","set","node","pop","updateCurrent","sep","result","join","reset","_matchWithDeepWildcard","_matchSimple","_matchSegment","pathIdx","segIdx","nextSeg","found","isCurrentNode","String","snapshot","restore","readOnly","toXml","jArray","indentation","format","indentBy","stopNodeExpressions","stopNodes","Array","isArray","arrToStr","arr","xmlStr","isPreviousElementTag","maxNestedTags","text","replaceEntitiesValue","tagObj","propName","extractAttributeValues","isStopNode","checkStopNode","textNodeName","tagText","tagValueProcessor","cdataPropName","val","replace","commentPropName","attStr","attr_to_str","tempInd","piTextNodeName","newIdentation","tagStart","tagValue","getRawContent","unpairedTags","suppressUnpairedNode","suppressEmptyNode","endsWith","attrMap","ignoreAttributes","hasAttrs","attr","startsWith","attributeNamePrefix","substr","item","attr_to_str_raw","nestedContent","attrStr","attrVal","suppressBooleanAttributes","keys","attributeValueProcessor","textValue","processEntities","entities","entity","regex","defaultOptions","attributesGroupName","a","preserveOrder","RegExp","oneListGroup","jPath","Builder","assign","isAttribute","ignoreAttributesFn","attrPrefixLen","processTextOrObjNode","indentate","tagEndChar","newLine","object","level","extractAttributes","rawContent","buildRawContent","buildAttributesForStopNode","buildObjectNode","j2x","buildTextValNode","repeat","name","build","jObj","buildFromOrderedJs","arrayNodeName","isCurrentStopNode","Date","buildAttrPairStr","newval","closeTag","arrLen","listTagVal","listTagAttr","j","Ks","L","attrGroup","attrKey","nestedAttrs","cleanKey","tagEndExp","piClosingChar","safeVal"],"sourceRoot":""}